| /lib/ |
| A D | radix-tree.c | 285 ret->array = root; in radix_tree_node_alloc()
421 if (!entry && (!is_idr(root) || root_tag_get(root, IDR_FREE))) in radix_tree_extend()
430 if (is_idr(root)) { in radix_tree_extend()
567 if (!is_idr(root)) in delete_node()
569 root->xa_head = NULL; in delete_node()
854 if (is_idr(root)) { in calculate_count()
895 delete_node(root, node); in __radix_tree_replace()
951 root_tag_set(root, tag); in node_tag_set()
989 root_tag_set(root, tag); in radix_tree_tag_set()
1372 if (is_idr(root)) in __radix_tree_delete()
[all …]
|
| A D | rbtree_test.c | 77 rb_erase_cached(&node->rb, root); in erase_cached()
87 struct rb_root_cached *root) in RB_DECLARE_CALLBACKS_MAX()
145 struct rb_root_cached *root) in erase_augmented_cached() argument
257 insert(nodes + j, &root); in basic_check()
259 erase(nodes + j, &root); in basic_check()
286 insert(nodes + i, &root); in basic_check()
305 node = rb_first(&root.rb_root); in basic_check()
317 node = rb_first_cached(&root); in basic_check()
326 erase(nodes + i, &root); in basic_check()
333 insert(nodes + j, &root); in basic_check()
[all …]
|
| A D | rbtree.c | 76 struct rb_root *root, int color) in __rb_rotate_set_parents() argument
81 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
436 __rb_insert(node, root, dummy_rotate); in rb_insert_color()
459 __rb_insert(node, root, augment_rotate); in __rb_insert_augmented()
470 n = root->rb_node; in rb_first()
483 n = root->rb_node; in rb_last()
554 struct rb_root *root) in rb_replace_node() argument
566 __rb_change_child(victim, new, parent, root); in rb_replace_node()
571 struct rb_root *root) in rb_replace_node_rcu() argument
625 if (!root->rb_node) in rb_first_postorder()
[all …]
|
| A D | interval_tree_test.c | 26 static struct rb_root_cached root = RB_ROOT_CACHED; variable
38 for (node = interval_tree_iter_first(root, start, last); node; in search()
78 interval_tree_insert(nodes + j, &root); in basic_check()
80 interval_tree_remove(nodes + j, &root); in basic_check()
103 interval_tree_insert(nodes + j, &root); in search_check()
113 results += search(&root, start, last); in search_check()
125 interval_tree_remove(nodes + j, &root); in search_check()
157 interval_tree_insert(nodes + j, &root); in intersection_range_check()
189 interval_tree_remove(nodes + j, &root); in intersection_range_check()
256 interval_tree_insert(nodes + j, &root); in span_iteration_check()
[all …]
|
| A D | test_objagg.c | 37 struct root { struct
131 struct root *root; in root_create() local
133 root = kzalloc(sizeof(*root), GFP_KERNEL); in root_create()
134 if (!root) in root_create()
136 memcpy(&root->key, key, sizeof(root->key)); in root_create()
137 memcpy(root->buf, world->next_root_buf, sizeof(root->buf)); in root_create()
139 return root; in root_create()
144 struct root *root = root_priv; in root_destroy() local
148 kfree(root); in root_destroy()
156 const struct root *root; in test_nodelta_obj_get() local
[all …]
|
| A D | assoc_array.c | 31 cursor = root; in assoc_array_subtree_iterate()
138 struct assoc_array_ptr *root = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_iterate() local
140 if (!root) in assoc_array_iterate()
353 cursor = root; in assoc_array_destroy_subtree()
445 array->root = NULL; in assoc_array_destroy()
1281 if (!array->root) in assoc_array_clear()
1289 edit->set[1].ptr = &array->root; in assoc_array_clear()
1373 if (edit->array->root == NULL) { in assoc_array_apply_edit()
1469 if (!array->root) in assoc_array_gc()
1478 edit->set[0].ptr = &array->root; in assoc_array_gc()
[all …]
|
| A D | generic-radix-tree.c | 26 struct genradix_root *v = READ_ONCE(radix->root); in __genradix_ptr_alloc()
53 if ((v = cmpxchg_release(&radix->root, r, new_root)) == r) { in __genradix_ptr_alloc()
98 r = READ_ONCE(radix->root); in __genradix_iter_peek()
152 r = READ_ONCE(radix->root); in __genradix_iter_peek_prev()
225 struct genradix_root *r = xchg(&radix->root, NULL); in __genradix_free()
|
| A D | bootconfig.c | 291 int __init xbc_node_compose_key_after(struct xbc_node *root, in xbc_node_compose_key_after() argument
298 if (!node || node == root) in xbc_node_compose_key_after()
304 while (node && node != root) { in xbc_node_compose_key_after()
310 if (!node && root) in xbc_node_compose_key_after()
340 struct xbc_node * __init xbc_node_find_next_leaf(struct xbc_node *root, in xbc_node_find_next_leaf() argument
349 node = root; in xbc_node_find_next_leaf()
360 if (node == root) /* @root was a leaf, no child node. */ in xbc_node_find_next_leaf()
365 if (node == root) in xbc_node_find_next_leaf()
392 const char * __init xbc_node_find_next_key_value(struct xbc_node *root, in xbc_node_find_next_key_value() argument
399 *leaf = xbc_node_find_next_leaf(root, *leaf); in xbc_node_find_next_key_value()
|
| A D | maple_tree.c | 1370 struct maple_enode *root; in mas_start() local
1377 root = mas_root(mas); in mas_start()
1392 if (unlikely(!root)) { in mas_start()
1406 return root; in mas_start()
3721 if (xa_is_node(root)) in mas_new_root()
6724 struct maple_enode *root; in mas_dup_build() local
6733 root = mas_start(mas); in mas_dup_build()
6746 new_mas->node = root; in mas_dup_build()
6749 root = mte_mk_root(root); in mas_dup_build()
6881 if (xa_is_node(root)) in __mt_destroy()
[all …]
|
| A D | Kconfig.debug | 1911 If this option is disabled, you allow userspace (root) access to all
1929 If this option is disabled, you allow userspace (root) access to all
3265 tristate "Integer square root test" if !KUNIT_ALL_TESTS
3270 which performs square root calculation. The test suite checks
3274 and edge cases to ensure the accuracy and reliability of the square root
|
| /lib/zlib_inflate/ |
| A D | inftrees.c | 29 unsigned root; /* number of index bits for root table */ in zlib_inflate_table() local
99 root = *bits; in zlib_inflate_table()
102 if (root > max) root = max; in zlib_inflate_table()
114 if (root < min) root = min; in zlib_inflate_table()
191 curr = root; /* current table index bits */ in zlib_inflate_table()
194 used = 1U << root; /* use root table entries */ in zlib_inflate_table()
246 if (len > root && (huff & mask) != low) { in zlib_inflate_table()
249 drop = root; in zlib_inflate_table()
272 (*table)[low].bits = (unsigned char)root; in zlib_inflate_table()
291 len = root; in zlib_inflate_table()
[all …]
|
| /lib/reed_solomon/ |
| A D | reed_solomon.c | 73 int i, j, sr, root, iprim; in codec_init() local
135 for (i = 0, root = fcr * prim; i < nroots; i++, root += prim) { in codec_init()
142 rs->index_of[rs->genpoly[j]] + root)]; in codec_init()
149 rs->index_of[rs->genpoly[0]] + root)]; in codec_init()
|
| A D | decode_rs.c | 37 uint16_t *root = rsc->buffers + RS_DECODE_ROOT * (nroots + 1); variable
217 root[count] = i;
258 i * root[j])];
267 num2 = alpha_to[rs_modnn(rs, root[j] * (fcr - 1) + nn)];
275 i * root[j])];
|