Searched refs:child (Results 1 – 4 of 4) sorted by relevance
| /lib/ |
| D | radix-tree.c | 483 struct radix_tree_node *child; in radix_tree_shrink() local
495 child = rcu_dereference_raw(node->slots[0]); in radix_tree_shrink()
496 if (!child) in radix_tree_shrink()
507 if (radix_tree_is_internal_node(child)) in radix_tree_shrink()
508 entry_to_node(child)->parent = NULL; in radix_tree_shrink()
517 root->xa_head = (void __rcu *)child; in radix_tree_shrink()
540 if (!radix_tree_is_internal_node(child)) { in radix_tree_shrink()
611 struct radix_tree_node *node = NULL, *child; in __radix_tree_create() local
618 shift = radix_tree_load_root(root, &child, &maxindex); in __radix_tree_create()
626 child = rcu_dereference_raw(root->xa_head); in __radix_tree_create()
[all …]
|
| D | test_sysctl.c | 123 .child = test_table,
133 .child = test_sysctl_table,
|
| D | btree.c | 541 unsigned long *key, int level, unsigned long *child, int fill) in rebalance() argument
552 mempool_free(child, head->mempool); in rebalance()
558 BUG_ON(bval(geo, parent, i) != child); in rebalance()
566 child, fill, in rebalance()
576 child, fill, in rebalance()
684 unsigned long *child; in __btree_for_each() local
687 child = bval(geo, node, i); in __btree_for_each()
688 if (!child) in __btree_for_each()
691 count = __btree_for_each(head, geo, child, opaque, in __btree_for_each()
694 func(child, opaque, bkey(geo, node, i), count++, in __btree_for_each()
|
| D | assoc_array.c | 1561 struct assoc_array_node *child; in assoc_array_gc() local
1573 child = assoc_array_ptr_to_node(ptr); in assoc_array_gc()
1574 new_n->nr_leaves_on_branch += child->nr_leaves_on_branch; in assoc_array_gc()
1576 if (child->nr_leaves_on_branch <= nr_free + 1) { in assoc_array_gc()
1579 slot, child->nr_leaves_on_branch, nr_free + 1, in assoc_array_gc()
1592 struct assoc_array_ptr *p = child->slots[i]; in assoc_array_gc()
1602 kfree(child); in assoc_array_gc()
1605 slot, child->nr_leaves_on_branch, nr_free + 1, in assoc_array_gc()
|