Lines Matching refs:child
70 * rc_node_destroy()ed (hold a lock on its parent or child, hold a flag,
93 * apropriate child.
171 * parent service. For snapshots they point to the child snaplevels, and for
894 * verify that the 'parent' type can have a child typed 'child'
897 * _TYPE_MISMATCH - parent type cannot have children of type child
900 rc_check_parent_child(uint32_t parent, uint32_t child)
906 child == 0 || child >= NUM_TYPES)
911 if (type == child)
1618 * The child list is being built or changed (due to creation
1626 * A child is being created -- locks out other creations, to
1787 * Link in a child node.
2179 * ITER_READ request, keeping it out of cache_hash and any child lists
2697 * If pg is a child of an instance or snapshot, we want to compose the
3215 * _NOT_FOUND - no child with that name/type combo found
3224 rc_node_t *child = NULL;
3230 ret = rc_node_find_named_child(np, name, type, &child);
3240 &child);
3243 * loop only if we succeeded, but no child of
3247 child != NULL)
3256 rc_node_assign(outp, child);
3257 if (child != NULL)
3258 rc_node_rele(child);
3881 * _EXISTS - child already exists
4348 * For each child, call rc_node_finish_delete() and recurse. If andformer
4406 * The last client or child reference to np, which must be either
4426 * Since the last client or child reference has been
4790 * in a new "child" node. Since we can only delete from the top node,
5117 * np's parent's child list. np is placed on the new node's rn_former list,
6334 * Do uu_list_walk_next(iter->rni_iter) until we find a child which matches