X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=lib%2Fhmap.c;h=9f2774465c3c357b81b4a0086594966e1a72cd11;hb=2c8fcc9cd6a7bbb948f6c79879e89c7ed791c9b1;hp=6bc5ea74bd79482897a353d5ad8361a7f360fe0c;hpb=f3099647623f2b13ece56cf8cf31761c00c1c297;p=openvswitch diff --git a/lib/hmap.c b/lib/hmap.c index 6bc5ea74..9f277446 100644 --- a/lib/hmap.c +++ b/lib/hmap.c @@ -23,6 +23,11 @@ #include "random.h" #include "util.h" +COVERAGE_DEFINE(hmap_pathological); +COVERAGE_DEFINE(hmap_expand); +COVERAGE_DEFINE(hmap_shrink); +COVERAGE_DEFINE(hmap_reserve); + /* Initializes 'hmap' as an empty hash table. */ void hmap_init(struct hmap *hmap) @@ -213,3 +218,46 @@ hmap_random_node(const struct hmap *hmap) } return node; } + +/* Returns the next node in 'hmap' in hash order, or NULL if no nodes remain in + * 'hmap'. Uses '*bucketp' and '*offsetp' to determine where to begin + * iteration, and stores new values to pass on the next iteration into them + * before returning. + * + * It's better to use plain HMAP_FOR_EACH and related functions, since they are + * faster and better at dealing with hmaps that change during iteration. + * + * Before beginning iteration, store 0 into '*bucketp' and '*offsetp'. + */ +struct hmap_node * +hmap_at_position(const struct hmap *hmap, + uint32_t *bucketp, uint32_t *offsetp) +{ + size_t offset; + size_t b_idx; + + offset = *offsetp; + for (b_idx = *bucketp; b_idx <= hmap->mask; b_idx++) { + struct hmap_node *node; + size_t n_idx; + + for (n_idx = 0, node = hmap->buckets[b_idx]; node != NULL; + n_idx++, node = node->next) { + if (n_idx == offset) { + if (node->next) { + *bucketp = node->hash & hmap->mask; + *offsetp = offset + 1; + } else { + *bucketp = (node->hash & hmap->mask) + 1; + *offsetp = 0; + } + return node; + } + } + offset = 0; + } + + *bucketp = 0; + *offsetp = 0; + return NULL; +}