Lines Matching defs:child
435 /* Propagate the aggregated tag info to the new child */
472 struct radix_tree_node *child;
479 * The candidate node has more than one child, or its child
484 child = rcu_dereference_raw(node->slots[0]);
485 if (!child)
496 if (radix_tree_is_internal_node(child))
497 entry_to_node(child)->parent = NULL;
506 root->xa_head = (void __rcu *)child;
529 if (!radix_tree_is_internal_node(child)) {
600 struct radix_tree_node *node = NULL, *child;
607 shift = radix_tree_load_root(root, &child, &maxindex);
615 child = rcu_dereference_raw(root->xa_head);
620 if (child == NULL) {
621 /* Have to add a child node. */
622 child = radix_tree_node_alloc(gfp, node, root, shift,
624 if (!child)
626 rcu_assign_pointer(*slot, node_to_entry(child));
629 } else if (!radix_tree_is_internal_node(child))
633 node = entry_to_node(child);
634 offset = radix_tree_descend(node, &child, index);
657 struct radix_tree_node *child = entry_to_node(node);
660 void *entry = rcu_dereference_raw(child->slots[offset]);
661 if (xa_is_node(entry) && child->shift) {
662 child = entry_to_node(entry);
668 struct radix_tree_node *old = child;
669 offset = child->offset + 1;
670 child = child->parent;
1155 struct radix_tree_node *node, *child;
1175 radix_tree_load_root(root, &child, &maxindex);
1178 if (!child)
1181 if (!radix_tree_is_internal_node(child)) {
1191 node = entry_to_node(child);
1192 offset = radix_tree_descend(node, &child, index);
1195 !tag_get(node, tag, offset) : !child) {
1217 child = rcu_dereference_raw(node->slots[offset]);
1220 if (!child)
1222 if (child == RADIX_TREE_RETRY)
1224 } while (node->shift && radix_tree_is_internal_node(child));
1477 struct radix_tree_node *node = NULL, *child;
1483 shift = radix_tree_load_root(root, &child, &maxindex);
1494 child = rcu_dereference_raw(root->xa_head);
1501 if (child == NULL) {
1502 /* Have to add a child node. */
1503 child = radix_tree_node_alloc(gfp, node, root, shift,
1505 if (!child)
1507 all_tag_set(child, IDR_FREE);
1508 rcu_assign_pointer(*slot, node_to_entry(child));
1511 } else if (!radix_tree_is_internal_node(child))
1514 node = entry_to_node(child);
1515 offset = radix_tree_descend(node, &child, start);
1529 child = rcu_dereference_raw(node->slots[offset]);