Lines Matching defs:child
437 /* Propagate the aggregated tag info to the new child */
474 struct radix_tree_node *child;
481 * The candidate node has more than one child, or its child
486 child = rcu_dereference_raw(node->slots[0]);
487 if (!child)
498 if (radix_tree_is_internal_node(child))
499 entry_to_node(child)->parent = NULL;
508 root->xa_head = (void __rcu *)child;
531 if (!radix_tree_is_internal_node(child)) {
602 struct radix_tree_node *node = NULL, *child;
609 shift = radix_tree_load_root(root, &child, &maxindex);
617 child = rcu_dereference_raw(root->xa_head);
622 if (child == NULL) {
623 /* Have to add a child node. */
624 child = radix_tree_node_alloc(gfp, node, root, shift,
626 if (!child)
628 rcu_assign_pointer(*slot, node_to_entry(child));
631 } else if (!radix_tree_is_internal_node(child))
635 node = entry_to_node(child);
636 offset = radix_tree_descend(node, &child, index);
659 struct radix_tree_node *child = entry_to_node(node);
662 void *entry = rcu_dereference_raw(child->slots[offset]);
663 if (xa_is_node(entry) && child->shift) {
664 child = entry_to_node(entry);
670 struct radix_tree_node *old = child;
671 offset = child->offset + 1;
672 child = child->parent;
1158 struct radix_tree_node *node, *child;
1178 radix_tree_load_root(root, &child, &maxindex);
1181 if (!child)
1184 if (!radix_tree_is_internal_node(child)) {
1194 node = entry_to_node(child);
1195 offset = radix_tree_descend(node, &child, index);
1198 !tag_get(node, tag, offset) : !child) {
1220 child = rcu_dereference_raw(node->slots[offset]);
1223 if (!child)
1225 if (child == RADIX_TREE_RETRY)
1227 } while (node->shift && radix_tree_is_internal_node(child));
1480 struct radix_tree_node *node = NULL, *child;
1486 shift = radix_tree_load_root(root, &child, &maxindex);
1497 child = rcu_dereference_raw(root->xa_head);
1504 if (child == NULL) {
1505 /* Have to add a child node. */
1506 child = radix_tree_node_alloc(gfp, node, root, shift,
1508 if (!child)
1510 all_tag_set(child, IDR_FREE);
1511 rcu_assign_pointer(*slot, node_to_entry(child));
1514 } else if (!radix_tree_is_internal_node(child))
1517 node = entry_to_node(child);
1518 offset = radix_tree_descend(node, &child, start);
1532 child = rcu_dereference_raw(node->slots[offset]);