Hello, Any reason why we allocate at least max_entries of buckets of a hash map? 466 467 /* hash table size must be power of 2 */ 468 htab->n_buckets = roundup_pow_of_two(htab->map.max_entries); This looks very odd to me, as I never see any other hash table implementation like this. I _guess_ we try to make it a perfect hash? But in reality no hash is perfect, so it is impossible to have no conflicts, that is, there is almost always a bucket that has multiple elements. Or is it because other special maps (LRU?) require this? I can not immediately see it from htab_map_alloc(). Thanks!
