Home
last modified time | relevance | path

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

/lib/
A Dbtree.c177 head->node = NULL; in __btree_init()
178 head->height = 0; in __btree_init()
200 mempool_free(head->node, head->mempool); in btree_destroy()
322 node = head->node; in btree_get_prev()
417 if (head->node) { in btree_grow()
423 head->height++; in btree_grow()
439 head->height--; in btree_shrink()
752 if (head->node) in btree_visitor()
753 count = __btree_for_each(head, geo, head->node, opaque, func, in btree_visitor()
770 if (head->node) in btree_grim_visitor()
[all …]
A Dllist.c31 struct llist_node *llist_del_first(struct llist_head *head) in llist_del_first() argument
35 entry = smp_load_acquire(&head->first); in llist_del_first()
40 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first()
57 bool llist_del_first_this(struct llist_head *head, in llist_del_first_this() argument
63 entry = smp_load_acquire(&head->first); in llist_del_first_this()
68 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first_this()
81 struct llist_node *llist_reverse_order(struct llist_node *head) in llist_reverse_order() argument
85 while (head) { in llist_reverse_order()
86 struct llist_node *tmp = head; in llist_reverse_order()
87 head = head->next; in llist_reverse_order()
A Dplist.c58 if (!plist_head_empty(head)) in plist_check_head()
78 plist_check_head(head); in plist_add()
82 if (plist_head_empty(head)) in plist_add()
113 plist_check_head(head); in plist_add()
124 plist_check_head(head); in plist_del()
142 plist_check_head(head); in plist_del()
160 plist_check_head(head); in plist_requeue()
161 BUG_ON(plist_head_empty(head)); in plist_requeue()
164 if (node == plist_last(head)) in plist_requeue()
172 plist_del(node, head); in plist_requeue()
[all …]
A Dlist_sort.c16 struct list_head *head, **tail = &head; in merge() local
38 return head; in merge()
49 static void merge_final(void *priv, list_cmp_func_t cmp, struct list_head *head, in merge_final() argument
52 struct list_head *tail = head; in merge_final()
94 tail->next = head; in merge_final()
95 head->prev = tail; in merge_final()
189 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp) in list_sort() argument
191 struct list_head *list = head->next, *pending = NULL; in list_sort()
194 if (list == head->prev) /* Zero or one elements */ in list_sort()
198 head->prev->next = NULL; in list_sort()
[all …]
A Dtimerqueue.c35 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add() argument
40 return rb_add_cached(&node->node, &head->rb_root, __timerqueue_less); in timerqueue_add()
53 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del() argument
57 rb_erase_cached(&node->node, &head->rb_root); in timerqueue_del()
60 return !RB_EMPTY_ROOT(&head->rb_root.rb_root); in timerqueue_del()
A Dref_tracker.c17 struct list_head head; /* anchor into dir->list or dir->quarantine */ member
84 list_for_each_entry(tracker, &dir->list, head) { in ref_tracker_get_stats()
233 list_for_each_entry_safe(tracker, n, &dir->quarantine, head) { in ref_tracker_dir_exit()
234 list_del(&tracker->head); in ref_tracker_dir_exit()
241 list_for_each_entry_safe(tracker, n, &dir->list, head) { in ref_tracker_dir_exit()
242 list_del(&tracker->head); in ref_tracker_dir_exit()
281 list_add(&tracker->head, &dir->list); in ref_tracker_alloc()
330 list_move_tail(&tracker->head, &dir->quarantine); in ref_tracker_free()
332 tracker = list_first_entry(&dir->quarantine, struct ref_tracker, head); in ref_tracker_free()
333 list_del(&tracker->head); in ref_tracker_free()
A Drhashtable.c235 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
266 RCU_INIT_POINTER(entry->next, head); in rhashtable_rehash_one()
504 struct rhash_head *head; in rhashtable_lookup_one() local
515 ht->p.obj_cmpfn(&arg, rht_obj(ht, head)) : in rhashtable_lookup_one()
517 pprev = &head->next; in rhashtable_lookup_one()
522 return rht_obj(ht, head); in rhashtable_lookup_one()
528 head = rht_dereference_bucket(head->next, tbl, hash); in rhashtable_lookup_one()
529 RCU_INIT_POINTER(list->rhead.next, head); in rhashtable_lookup_one()
551 struct rhash_head *head; in rhashtable_insert_one() local
572 head = rht_ptr(bkt, tbl, hash); in rhashtable_insert_one()
[all …]
A Ddigsig.c75 int head, i; in digsig_verify_rsa() local
161 head = len - l; in digsig_verify_rsa()
162 memset(out1, 0, head); in digsig_verify_rsa()
163 memcpy(out1 + head, p, l); in digsig_verify_rsa()
A Dnlattr.c60 static int __nla_validate_parse(const struct nlattr *head, int len, int maxtype,
89 static int nla_validate_array(const struct nlattr *head, int len, int maxtype, in nla_validate_array() argument
97 nla_for_each_attr(entry, head, len, rem) { in nla_validate_array()
604 static int __nla_validate_parse(const struct nlattr *head, int len, int maxtype, in __nla_validate_parse() argument
622 nla_for_each_attr(nla, head, len, rem) { in __nla_validate_parse()
673 int __nla_validate(const struct nlattr *head, int len, int maxtype, in __nla_validate() argument
677 return __nla_validate_parse(head, len, maxtype, policy, validate, in __nla_validate()
728 const struct nlattr *head, int len, in __nla_parse() argument
732 return __nla_validate_parse(head, len, maxtype, policy, validate, in __nla_parse()
745 struct nlattr *nla_find(const struct nlattr *head, int len, int attrtype) in nla_find() argument
[all …]
A Ddebugobjects.c190 obj = hlist_entry(head->first, typeof(*obj), node); in pool_push_batch()
193 hlist_splice_init(head, last, &dst->objects); in pool_push_batch()
207 hlist_move_list(&src->objects, head); in pool_pop_batch()
209 obj = hlist_entry(head->first, typeof(*obj), node); in pool_pop_batch()
318 static void free_object_list(struct hlist_head *head) in free_object_list() argument
324 hlist_for_each_entry_safe(obj, tmp, head, node) { in free_object_list()
373 free_object_list(head); in kmem_alloc_batch()
382 hlist_add_head(&obj->node, head); in kmem_alloc_batch()
401 HLIST_HEAD(head); in fill_pool()
407 if (!pool_push_batch(&pool_global, &head)) in fill_pool()
[all …]
A Dradix-tree.h8 extern void radix_tree_node_rcu_free(struct rcu_head *head);
A Dxarray.c574 if (!head) { in xas_expand()
580 } else if (xa_is_node(head)) { in xas_expand()
581 node = xa_to_node(head); in xas_expand()
586 while (max > max_index(head)) { in xas_expand()
595 if (xa_is_value(head)) in xas_expand()
597 RCU_INIT_POINTER(node->slots[0], head); in xas_expand()
619 if (xa_is_node(head)) { in xas_expand()
620 xa_to_node(head)->offset = 0; in xas_expand()
621 rcu_assign_pointer(xa_to_node(head)->parent, node); in xas_expand()
623 head = xa_mk_node(node); in xas_expand()
[all …]
A Dtest_objpool.c437 static int ot_objpool_release(struct objpool_head *head, void *context) in ot_objpool_release() argument
441 WARN_ON(!head || !sop || head != &sop->pool); in ot_objpool_release()
A Dmaple_tree.c194 static void mt_free_rcu(struct rcu_head *head) in mt_free_rcu() argument
977 mat->tail = mat->head = dead_enode; in mat_add()
1001 while (mat->head) { in mas_mat_destroy()
1002 next = mte_to_mat(mat->head)->next; in mas_mat_destroy()
1003 node = mte_to_node(mat->head); in mas_mat_destroy()
1007 mat->head = next; in mas_mat_destroy()
1205 struct maple_alloc *head = mas->alloc; in mas_push_node() local
1214 if (head->node_count < MAPLE_ALLOC_SLOTS) { in mas_push_node()
1215 head->slot[head->node_count++] = reuse; in mas_push_node()
1216 head->total++; in mas_push_node()
[all …]
A Dbootconfig.c454 static struct xbc_node * __init __xbc_add_sibling(char *data, uint32_t flag, bool head) in __xbc_add_sibling() argument
466 if (!last_parent->child || head) { in __xbc_add_sibling()
A Diov_iter.c328 struct page *head; in page_copy_sane() local
341 head = compound_head(page); in page_copy_sane()
342 v += (page - head) << PAGE_SHIFT; in page_copy_sane()
344 if (WARN_ON(n > v || v > page_size(head))) in page_copy_sane()
A Dradix-tree.c290 void radix_tree_node_rcu_free(struct rcu_head *head) in radix_tree_node_rcu_free() argument
293 container_of(head, struct radix_tree_node, rcu_head); in radix_tree_node_rcu_free()
A Dassoc_array.c1300 static void assoc_array_rcu_cleanup(struct rcu_head *head) in assoc_array_rcu_cleanup() argument
1303 container_of(head, struct assoc_array_edit, rcu); in assoc_array_rcu_cleanup()
/lib/tests/
A Dtest_list_sort.c63 LIST_HEAD(head); in list_sort_test()
79 list_add_tail(&el->list, &head); in list_sort_test()
82 list_sort(test, &head, cmp); in list_sort_test()
84 for (cur = head.next; cur->next != &head; cur = cur->next) { in list_sort_test()
104 KUNIT_EXPECT_PTR_EQ_MSG(test, head.prev, cur, "list is corrupted"); in list_sort_test()
/lib/zlib_deflate/
A Ddeflate.c173 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
174 s->head[s->ins_h] = (Pos)(str))
181 s->head[s->hash_size-1] = NIL; \
182 memset((char *)s->head, 0, (unsigned)(s->hash_size-1)*sizeof(*s->head));
260 s->head = (Pos *) mem->head_memory; in zlib_deflateInit2()
780 p = &s->head[n]; in fill_window()
A Ddefutil.h112 Pos *head; /* Heads of the hash chains or NIL. */ member
/lib/zstd/compress/
A Dzstd_lazy.c989 ZSTD_row_getSSEMask(int nbChunks, const BYTE* const src, const BYTE tag, const U32 head) in ZSTD_row_getSSEMask() argument
1000 if (nbChunks == 1) return ZSTD_rotateRight_U16((U16)matches[0], head); in ZSTD_row_getSSEMask()
1001 if (nbChunks == 2) return ZSTD_rotateRight_U32((U32)matches[1] << 16 | (U32)matches[0], head); in ZSTD_row_getSSEMask()
1003 …U64((U64)matches[3] << 48 | (U64)matches[2] << 32 | (U64)matches[1] << 16 | (U64)matches[0], head); in ZSTD_row_getSSEMask()

Completed in 67 milliseconds