Re: [RFC v3 1/7] hashtable: introduce a small and naive hashtable
From: Sasha Levin <hidden>
Date: 2012-08-07 01:53:44
Also in:
linux-mm, lkml
On 08/07/2012 03:48 AM, Li Wei wrote:
On 08/07/2012 08:45 AM, Sasha Levin wrote:quoted
+/** + * hash_for_each - iterate over a hashtable + * @name: hashtable to iterate + * @bits: bit count of hashing function of the hashtable + * @bkt: integer to use as bucket loop cursor + * @node: the &struct list_head to use as a loop cursor for each bucket + * @obj: the type * to use as a loop cursor for each bucket + * @member: the name of the hlist_node within the struct + */ +#define hash_for_each(name, bits, bkt, node, obj, member) \ + for (bkt = 0; bkt < HASH_SIZE(bits); bkt++) \ + hlist_for_each_entry(obj, node, &name[i], member)Where is the 'i' coming from? maybe &name[bkt]?
Heh, yeah. And the only place that uses this macro had 'i' declared as the loop counter, so it didn't trigger any issues during testing. Thanks! -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@kvack.org. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a>