It seems I don't get the purpose of introducing hindex into lib. Now I get it. Thanks.
At 2013-07-17 01:08:16,"Ben Pfaff" <b...@nicira.com> wrote: >On Tue, Jul 16, 2013 at 06:46:22PM +0800, ZhengLingyun wrote: >> As you have said in hindex.h, hindex need a high-quality hash function to >> work appropriately. So maybe these two kinds of hindex_head_node() are >> similar in performance. > >No. The quality of the hash function ensures that each bucket has a >small number of head nodes. It does not do anything to reduce the >number of body nodes. If there is no expectation of duplicates, then >the client would use hmap instead, since it uses less time and space. >
_______________________________________________ dev mailing list dev@openvswitch.org http://openvswitch.org/mailman/listinfo/dev
