hash_head
struct hlist_head *hash_head;
hash_head = keyhashentry(key);
hlist_for_each_entry_rcu(k, hash_head, hash_entry) {
hlist_add_head_rcu(&key->hash_entry, hash_head);
struct hlist_head *hash_head;
hash_head = keyhashentry(key);
hlist_for_each_entry_rcu(k, hash_head, hash_entry) {
struct hlist_head *hash_head;
hash_head = classhashentry(key);
hlist_for_each_entry_rcu(class, hash_head, hash_entry) {
hlist_add_head_rcu(&class->hash_entry, hash_head);
struct hlist_head *hash_head = chainhashentry(chain_key);
hlist_add_head_rcu(&chain->entry, hash_head);
struct hlist_head *hash_head = chainhashentry(chain_key);
hlist_for_each_entry_rcu(chain, hash_head, entry) {
struct hlist_head *hash_head;
hash_head = stack_trace_hash + (hash & (STACK_TRACE_HASH_SIZE - 1));
hlist_for_each_entry(t2, hash_head, hash_entry) {
hlist_add_head(&trace->hash_entry, hash_head);
struct hlist_head *hash_head = keyhashentry(key);
hlist_for_each_entry_rcu(k, hash_head, hash_entry) {
struct hlist_head *hash_head;
hash_head = classhashentry(key);
hlist_for_each_entry_rcu_notrace(class, hash_head, hash_entry) {
IPos hash_head = NIL; /* head of hash chain */
INSERT_STRING(s, s->strstart, hash_head);
if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
s->strstart - hash_head <= MAX_DIST(s)) {
s->match_length = longest_match (s, hash_head);
INSERT_STRING(s, s->strstart, hash_head);
IPos hash_head = NIL; /* head of the hash chain */
INSERT_STRING(s, s->strstart, hash_head);
if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
s->match_length = longest_match (s, hash_head);
INSERT_STRING(s, s->strstart, hash_head);
hlist_add_head(node, hash_head(table, key))
hlist_for_each_entry(obj, hash_head(table, key), member)
hlist_for_each_entry_safe(obj, tmp, hash_head(table, key), member)