Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 39) sorted by relevance

12

/lib/
A Dradix-tree.c300 memset(node->slots, 0, sizeof(node->slots)); in radix_tree_node_rcu_free()
301 memset(node->tags, 0, sizeof(node->tags)); in radix_tree_node_rcu_free()
396 node = entry_to_node(node); in radix_tree_load_root()
478 node = entry_to_node(node); in radix_tree_shrink()
947 node = node->parent; in node_tag_set()
1007 node = node->parent; in node_tag_clear()
1232 iter->node = node; in radix_tree_next_chunk()
1379 return node && delete_node(root, node); in __radix_tree_delete()
1527 node = node->parent; in idr_get_free()
1542 iter->node = node; in idr_get_free()
[all …]
A Dbootconfig.c231 node = xbc_node_get_next(node); in xbc_node_find_subkey()
265 node = xbc_node_get_child(node); in xbc_node_find_value()
298 if (!node || node == root) in xbc_node_compose_key_after()
302 node = xbc_node_get_parent(node); in xbc_node_compose_key_after()
304 while (node && node != root) { in xbc_node_compose_key_after()
308 node = xbc_node_get_parent(node); in xbc_node_compose_key_after()
371 node = xbc_node_get_next(node); in xbc_node_find_next_leaf()
376 node = xbc_node_get_child(node); in xbc_node_find_next_leaf()
441 node = xbc_node_get_next(node); in xbc_last_sibling()
449 node = xbc_node_get_child(node); in xbc_last_child()
[all …]
A Dbtree.c210 unsigned long *node = head->node; in btree_last() local
216 node = bval(geo, node, 0); in btree_last()
244 unsigned long *node = head->node; in btree_lookup_node() local
255 node = bval(geo, node, i); in btree_lookup_node()
322 node = head->node; in btree_get_prev()
330 node = bval(geo, node, i); in btree_get_prev()
402 node = bval(geo, node, i); in find_level()
422 head->node = node; in btree_grow()
435 node = head->node; in btree_shrink()
438 head->node = bval(geo, node, 0); in btree_shrink()
[all …]
A Drbtree.c504 node = node->rb_right; in rb_next()
506 node = node->rb_left; in rb_next()
517 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
518 node = parent; in rb_next()
536 node = node->rb_left; in rb_prev()
538 node = node->rb_right; in rb_prev()
546 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
547 node = parent; in rb_prev()
596 node = node->rb_left; in rb_left_deepest_node()
598 node = node->rb_right; in rb_left_deepest_node()
[all …]
A Dtimerqueue.c18 rb_entry((_n), struct timerqueue_node, node)
35 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add() argument
38 WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node)); in timerqueue_add()
40 return rb_add_cached(&node->node, &head->rb_root, __timerqueue_less); in timerqueue_add()
55 WARN_ON_ONCE(RB_EMPTY_NODE(&node->node)); in timerqueue_del()
57 rb_erase_cached(&node->node, &head->rb_root); in timerqueue_del()
58 RB_CLEAR_NODE(&node->node); in timerqueue_del()
73 struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node) in timerqueue_iterate_next() argument
77 if (!node) in timerqueue_iterate_next()
79 next = rb_next(&node->node); in timerqueue_iterate_next()
[all …]
A Dxarray.c453 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_shrink()
496 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_delete_node()
763 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in update_node()
803 if (node && (xas->xa_shift < node->shift)) in xas_store()
828 if (xa_is_node(next) && (!node || node->shift)) in xas_store()
896 node = xa_parent_locked(xas->xa, node); in xas_set_mark()
928 node = xa_parent_locked(xas->xa, node); in xas_clear_mark()
2365 .xa_node = xa_parent_locked(node->array, node), in xa_delete_node()
2417 node, node->parent ? "offset" : "max", node->offset, in xa_dump_node()
2418 node->parent, node->shift, node->count, node->nr_values, in xa_dump_node()
[all …]
A Dmaple_tree.c1180 ret = node->slot[--node->node_count]; in mas_pop_node()
1181 node->slot[node->node_count] = NULL; in mas_pop_node()
1290 node = node->slot[0]; in mas_alloc_nodes()
2952 mas->node = l_mas.node; in mas_spanning_rebalance()
3287 tmp_mas.node = mast->l->node; in mas_push_data()
3290 tmp_mas.node = mast->r->node; in mas_push_data()
3389 mas->node = l_mas.node; in mas_split()
6630 node = mte_to_node(mas->node); in mas_dup_free()
6639 node = mte_to_node(mas->node); in mas_dup_free()
7420 if (node != mas->node) in mas_validate_parent_slot()
[all …]
A Drbtree_test.c36 u32 key = node->key; in insert()
53 u32 key = node->key; in insert_cached()
81 #define NODE_VAL(node) ((node)->val) argument
90 u32 key = node->key; in RB_DECLARE_CALLBACKS_MAX()
91 u32 val = node->val; in RB_DECLARE_CALLBACKS_MAX()
105 node->augmented = val; in RB_DECLARE_CALLBACKS_MAX()
114 u32 key = node->key; in insert_augmented_cached()
115 u32 val = node->val; in insert_augmented_cached()
132 node->augmented = val; in insert_augmented_cached()
247 struct rb_node *node; in basic_check() local
[all …]
A Dplist.c79 WARN_ON(!plist_node_empty(node)); in plist_add()
89 if (node->prio < iter->prio) { in plist_add()
140 list_del_init(&node->node_list); in plist_del()
162 BUG_ON(plist_node_empty(node)); in plist_requeue()
164 if (node == plist_last(head)) in plist_requeue()
167 iter = plist_next(node); in plist_requeue()
169 if (node->prio != iter->prio) in plist_requeue()
172 plist_del(node, head); in plist_requeue()
186 if (node->prio != iter->prio) { in plist_requeue()
236 plist_requeue(node, &test_head); in plist_test_requeue()
[all …]
A Dassoc_array.c91 slot = node->parent_slot; in assoc_array_subtree_iterate()
218 result->terminal_node.node = node; in assoc_array_walk()
318 node = result.terminal_node.node; in assoc_array_find()
380 pr_devel("Node %p [back=%p]\n", node, node->back_pointer); in assoc_array_destroy_subtree()
400 kfree(node); in assoc_array_destroy_subtree()
488 node = result->terminal_node.node; in assoc_array_insert_into_terminal_node()
505 ptr = node->slots[i]; in assoc_array_insert_into_terminal_node()
552 ptr = node->slots[i]; in assoc_array_insert_into_terminal_node()
1105 node = result.terminal_node.node; in assoc_array_delete()
1180 parent = node; in assoc_array_delete()
[all …]
A Dunion_find.c13 struct uf_node *uf_find(struct uf_node *node) in uf_find() argument
17 while (node->parent != node) { in uf_find()
18 parent = node->parent; in uf_find()
19 node->parent = parent->parent; in uf_find()
20 node = parent; in uf_find()
22 return node; in uf_find()
A Dinterval_tree_test.c35 struct interval_tree_node *node; in search() local
38 for (node = interval_tree_iter_first(root, start, last); node; in search()
39 node = interval_tree_iter_next(node, start, last)) in search()
134 struct interval_tree_node *node; in intersection_range_check() local
173 node = nodes + j; in intersection_range_check()
175 if (start <= node->last && last >= node->start) in intersection_range_check()
181 for (node = interval_tree_iter_first(&root, start, last); node; in intersection_range_check()
182 node = interval_tree_iter_next(node, start, last)) in intersection_range_check()
183 bitmap_set(intxn2, node - nodes, 1); in intersection_range_check()
A Dgroup_cpus.c48 int node; in alloc_node_to_cpumask() local
54 for (node = 0; node < nr_node_ids; node++) { in alloc_node_to_cpumask()
55 if (!zalloc_cpumask_var(&masks[node], GFP_KERNEL)) in alloc_node_to_cpumask()
62 while (--node >= 0) in alloc_node_to_cpumask()
63 free_cpumask_var(masks[node]); in alloc_node_to_cpumask()
70 int node; in free_node_to_cpumask() local
72 for (node = 0; node < nr_node_ids; node++) in free_node_to_cpumask()
73 free_cpumask_var(masks[node]); in free_node_to_cpumask()
A Dtest_kho.c197 static int kho_test_restore_data(const void *fdt, int node) in kho_test_restore_data() argument
205 node = fdt_path_offset(fdt, "/data"); in kho_test_restore_data()
207 nr_folios = fdt_getprop(fdt, node, "nr_folios", &len); in kho_test_restore_data()
211 old_csum = fdt_getprop(fdt, node, "csum", &len); in kho_test_restore_data()
215 folios_info = fdt_getprop(fdt, node, "folios_info", &len); in kho_test_restore_data()
246 int node, len, err; in kho_test_restore() local
248 node = fdt_path_offset(fdt, "/"); in kho_test_restore()
249 if (node < 0) in kho_test_restore()
252 if (fdt_node_check_compatible(fdt, node, KHO_TEST_COMPAT)) in kho_test_restore()
255 magic = fdt_getprop(fdt, node, "magic", &len); in kho_test_restore()
[all …]
A Dobjagg.c751 node = &graph->nodes[j]; in objagg_tmp_graph_node_weight()
752 if (node->crossed_out) in objagg_tmp_graph_node_weight()
768 node = &graph->nodes[i]; in objagg_tmp_graph_node_max_weight()
769 if (node->crossed_out) in objagg_tmp_graph_node_max_weight()
804 node = &graph->nodes[i++]; in objagg_tmp_graph_create()
816 node = &graph->nodes[j]; in objagg_tmp_graph_create()
861 node->crossed_out = true; in objagg_opt_simple_greedy_fillup_hints()
863 node->objagg_obj, in objagg_opt_simple_greedy_fillup_hints()
874 node = &graph->nodes[j]; in objagg_opt_simple_greedy_fillup_hints()
875 if (node->crossed_out) in objagg_opt_simple_greedy_fillup_hints()
[all …]
A Dcpumask.c28 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node() argument
30 *mask = kmalloc_node(cpumask_size(), flags, node); in alloc_cpumask_var_node()
108 unsigned int cpumask_local_spread(unsigned int i, int node) in cpumask_local_spread() argument
115 cpu = sched_numa_find_nth_cpu(cpu_online_mask, i, node); in cpumask_local_spread()
A Ddebugobjects.c232 hlist_del(&obj->node); in __alloc_object()
298 obj->batch_last = &obj->node; in pcpu_free()
325 hlist_del(&obj->node); in free_object_list()
379 last = &obj->node; in kmem_alloc_batch()
382 hlist_add_head(&obj->node, head); in kmem_alloc_batch()
467 hlist_add_head(&obj->node, &b->list); in alloc_object()
523 hlist_add_head(&obj->node, &pool_boot); in __free_object()
549 hlist_del(&obj->node); in put_objects()
974 hlist_del(&obj->node); in debug_object_free()
1103 hlist_del(&obj->node); in __debug_check_no_obj_freed()
[all …]
A Dinterval_tree.c7 #define START(node) ((node)->start) argument
8 #define LAST(node) ((node)->last) argument
A Didr.c292 struct radix_tree_node *node; in idr_replace() local
298 entry = __radix_tree_lookup(&idr->idr_rt, id, &node, &slot); in idr_replace()
302 __radix_tree_replace(&idr->idr_rt, node, slot, ptr); in idr_replace()
636 struct xa_node *node = xa_to_node(entry); in ida_dump_entry() local
637 unsigned int shift = node->shift + IDA_CHUNK_SHIFT + in ida_dump_entry()
641 xa_dump_node(node); in ida_dump_entry()
643 ida_dump_entry(node->slots[i], in ida_dump_entry()
644 index | (i << node->shift)); in ida_dump_entry()
A Dklist.c175 struct klist_node *node; member
192 if (waiter->node != n) in klist_release()
242 waiter.node = n; in klist_remove()
/lib/tests/
A Dhashtable_test.c15 struct hlist_node node; member
43 hash_add(hash, &a.node, a.key); in hashtable_test_hash_empty()
56 hash_add(hash, &a.node, a.key); in hashtable_test_hash_hashed()
59 hash_add(hash, &b.node, b.key); in hashtable_test_hash_hashed()
74 hash_add(hash, &a.node, a.key); in hashtable_test_hash_add()
78 hash_add(hash, &b.node, b.key); in hashtable_test_hash_add()
102 hash_add(hash, &a.node, a.key); in hashtable_test_hash_del()
108 hash_del(&b.node); in hashtable_test_hash_del()
117 hash_del(&a.node); in hashtable_test_hash_del()
176 hash_del(&x->node); in hashtable_test_hash_for_each_safe()
[all …]
/lib/842/
A D842_compress.c68 struct hlist_node node; member
74 struct hlist_node node; member
80 struct hlist_node node; member
115 for (_i = 0; _i < ARRAY_SIZE((p)->node##b); _i++) { \
116 (p)->node##b[_i].index = _i; \
117 (p)->node##b[_i].data = 0; \
118 INIT_HLIST_NODE(&(p)->node##b[_i].node); \
125 hash_for_each_possible(p->htable##b, _n, node, p->data##b[n]) { \
140 struct sw842_hlist_node##b *_n = &(p)->node##b[(i)+(d)]; \
141 hash_del(&_n->node); \
[all …]
/lib/kunit/
A Dstring-stream.c36 list_del(&frag->node); in string_stream_fragment_destroy()
84 list_add_tail(&frag_container->node, &stream->fragments); in string_stream_vadd()
110 node) { in string_stream_clear()
128 list_for_each_entry(frag_container, &stream->fragments, node) in string_stream_get_string()
A Dresource.c40 list_add_tail(&res->node, &test->resources); in __kunit_add_resource()
54 was_linked = !list_empty(&res->node); in kunit_remove_resource()
55 list_del_init(&res->node); in kunit_remove_resource()
/lib/zlib_deflate/
A Ddeftree.c494 int node; /* new node being created */ in build_tree() local
517 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
518 tree[node].Freq = 1; in build_tree()
519 s->depth[node] = 0; in build_tree()
520 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
533 node = elems; /* next internal node of the tree */ in build_tree()
542 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
543 s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1); in build_tree()
544 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
548 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); in build_tree()
[all …]

Completed in 74 milliseconds

12