Home
last modified time | relevance | path

Searched refs:head (Results 1 – 6 of 6) sorted by relevance

/lib/
Dplist.c55 static void plist_check_head(struct plist_head *head) in plist_check_head() argument
57 WARN_ON(!head->lock); in plist_check_head()
58 if (head->lock) in plist_check_head()
59 WARN_ON_SMP(!spin_is_locked(head->lock)); in plist_check_head()
60 plist_check_list(&head->prio_list); in plist_check_head()
61 plist_check_list(&head->node_list); in plist_check_head()
74 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add() argument
78 plist_check_head(head); in plist_add()
81 list_for_each_entry(iter, &head->prio_list, plist.prio_list) { in plist_add()
96 plist_check_head(head); in plist_add()
[all …]
Ddynamic_printk.c52 struct hlist_head *head; in find_debug_module() local
58 head = &module_table[i]; in find_debug_module()
59 hlist_for_each_entry_rcu(element, node, head, hlist) in find_debug_module()
69 struct hlist_head *head; in find_debug_module_hash() local
74 head = &module_table[hash]; in find_debug_module_hash()
75 hlist_for_each_entry_rcu(element, node, head, hlist) in find_debug_module_hash()
340 struct hlist_head *head; in pr_debug_seq_show() local
346 head = &module_table[i]; in pr_debug_seq_show()
347 hlist_for_each_entry_rcu(elem, node, head, hlist) { in pr_debug_seq_show()
Didr.c55 static void idr_layer_rcu_free(struct rcu_head *head) in idr_layer_rcu_free() argument
59 layer = container_of(head, struct idr_layer, rcu_head); in idr_layer_rcu_free()
Dradix-tree.c174 static void radix_tree_node_rcu_free(struct rcu_head *head) in radix_tree_node_rcu_free() argument
177 container_of(head, struct radix_tree_node, rcu_head); in radix_tree_node_rcu_free()
/lib/zlib_deflate/
Ddeflate.c155 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
156 s->head[s->ins_h] = (Pos)(str))
163 s->head[s->hash_size-1] = NIL; \
164 memset((char *)s->head, 0, (unsigned)(s->hash_size-1)*sizeof(*s->head));
218 s->head = (Pos *) mem->head_memory; in zlib_deflateInit2()
591 ds->head = (Pos *) mem->head_memory;
597 memcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));
900 p = &s->head[n]; in fill_window()
Ddefutil.h110 Pos *head; /* Heads of the hash chains or NIL. */ member