X-Git-Url: http://git.onelab.eu/?a=blobdiff_plain;f=lib%2Fhmap.c;h=542d8b5a8eb73550df8cb2322b9eb434a6f69bc9;hb=HEAD;hp=f15e72cb9e1ef9c9ca8c03aca6cfa6beca39f9a3;hpb=85606e05b691be7c2f2d4bcf0e91170b71ec8fbb;p=sliver-openvswitch.git diff --git a/lib/hmap.c b/lib/hmap.c index f15e72cb9..542d8b5a8 100644 --- a/lib/hmap.c +++ b/lib/hmap.c @@ -21,6 +21,9 @@ #include "coverage.h" #include "random.h" #include "util.h" +#include "vlog.h" + +VLOG_DEFINE_THIS_MODULE(hmap); COVERAGE_DEFINE(hmap_pathological); COVERAGE_DEFINE(hmap_expand); @@ -85,7 +88,7 @@ hmap_moved(struct hmap *hmap) } static void -resize(struct hmap *hmap, size_t new_mask) +resize(struct hmap *hmap, size_t new_mask, const char *where) { struct hmap tmp; size_t i; @@ -109,7 +112,10 @@ resize(struct hmap *hmap, size_t new_mask) count++; } if (count > 5) { + static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(10, 10); COVERAGE_INC(hmap_pathological); + VLOG_DBG_RL(&rl, "%s: %d nodes in bucket (%"PRIuSIZE" nodes, %"PRIuSIZE" buckets)", + where, count, hmap->n, hmap->mask + 1); } } hmap_swap(hmap, &tmp); @@ -136,38 +142,50 @@ calc_mask(size_t capacity) return mask; } -/* Expands 'hmap', if necessary, to optimize the performance of searches. */ +/* Expands 'hmap', if necessary, to optimize the performance of searches. + * + * ('where' is used in debug logging. Commonly one would use hmap_expand() to + * automatically provide the caller's source file and line number for + * 'where'.) */ void -hmap_expand(struct hmap *hmap) +hmap_expand_at(struct hmap *hmap, const char *where) { size_t new_mask = calc_mask(hmap->n); if (new_mask > hmap->mask) { COVERAGE_INC(hmap_expand); - resize(hmap, new_mask); + resize(hmap, new_mask, where); } } -/* Shrinks 'hmap', if necessary, to optimize the performance of iteration. */ +/* Shrinks 'hmap', if necessary, to optimize the performance of iteration. + * + * ('where' is used in debug logging. Commonly one would use hmap_shrink() to + * automatically provide the caller's source file and line number for + * 'where'.) */ void -hmap_shrink(struct hmap *hmap) +hmap_shrink_at(struct hmap *hmap, const char *where) { size_t new_mask = calc_mask(hmap->n); if (new_mask < hmap->mask) { COVERAGE_INC(hmap_shrink); - resize(hmap, new_mask); + resize(hmap, new_mask, where); } } /* Expands 'hmap', if necessary, to optimize the performance of searches when * it has up to 'n' elements. (But iteration will be slow in a hash map whose - * allocated capacity is much higher than its current number of nodes.) */ + * allocated capacity is much higher than its current number of nodes.) + * + * ('where' is used in debug logging. Commonly one would use hmap_reserve() to + * automatically provide the caller's source file and line number for + * 'where'.) */ void -hmap_reserve(struct hmap *hmap, size_t n) +hmap_reserve_at(struct hmap *hmap, size_t n, const char *where) { size_t new_mask = calc_mask(n); if (new_mask > hmap->mask) { COVERAGE_INC(hmap_reserve); - resize(hmap, new_mask); + resize(hmap, new_mask, where); } } @@ -196,8 +214,8 @@ hmap_random_node(const struct hmap *hmap) size_t n, i; /* Choose a random non-empty bucket. */ - for (i = random_uint32(); ; i++) { - bucket = hmap->buckets[i & hmap->mask]; + for (;;) { + bucket = hmap->buckets[random_uint32() & hmap->mask]; if (bucket) { break; }