Messages in this thread | | | Subject | RE: [PATCH v3 01/17] hashtable: introduce a small and naive hashtable | Date | Thu, 6 Sep 2012 15:36:52 +0100 | From | "David Laight" <> |
| |
> My solution to making 'break' work in the iterator is: > > for (bkt = 0, node = NULL; bkt < HASH_SIZE(name) && node == NULL; bkt++) > hlist_for_each_entry(obj, node, &name[bkt], member)
I'd take a look at the generated code. Might come out a bit better if the condition is changed to: node == NULL && bkt < HASH_SIZE(name) you might find the compiler always optimises out the node == NULL comparison. (It might anyway, but switching the order gives it a better chance.)
David
| |