Lines Matching defs:node
103 * @kn_from: kernfs node which should be treated as root for the path
104 * @kn_to: kernfs node to which path is needed
178 * kernfs_name - obtain the name of a given node
203 * kernfs_path_from_node - build path of node @to relative to @from.
281 * kernfs_get_parent - determine the parent node and pin it
358 struct rb_node **node = &kn->parent->dir.children.rb_node;
361 while (*node) {
365 pos = rb_to_kn(*node);
366 parent = *node;
369 node = &pos->rb.rb_left;
371 node = &pos->rb.rb_right;
376 /* add new node and rebalance the tree */
377 rb_link_node(&kn->rb, parent, node);
573 /* The kernfs node has been deactivated */
577 /* The kernfs node has been moved? */
581 /* The kernfs node has been renamed */
585 /* The kernfs node has been moved to a different namespace */
610 * is accessible, the returned node can be in any state and the caller is
721 * kernfs_find_and_get_node_by_id - get kernfs_node from node id
723 * @id: the target node id
729 * NULL on failure. Return a kernfs node with reference counter incremented
823 * Activate the new node unless CREATE_DEACTIVATED is requested.
825 * activating the node with kernfs_activate(). A node which hasn't
851 struct rb_node *node = parent->dir.children.rb_node;
864 while (node) {
868 kn = rb_to_kn(node);
871 node = node->rb_left;
873 node = node->rb_right;
1036 * Returns the created node on success, ERR_PTR() value on failure.
1070 * Returns the created node on success, ERR_PTR() value on failure.
1242 * descendants. @root is included in the iteration and the last node to be
1270 * kernfs_activate - activate a node which started deactivated
1273 * If the root has KERNFS_ROOT_CREATE_DEACTIVATED set, a newly created node
1274 * needs to be explicitly activated. A node which hasn't been activated
1325 /* deactivate and unlink the subtree node-by-node */
1349 * kernfs_unlink_sibling() succeeds once per node. Use it
1552 * @kn: target node
1649 struct rb_node *node = parent->dir.children.rb_node;
1650 while (node) {
1651 pos = rb_to_kn(node);
1654 node = node->rb_left;
1656 node = node->rb_right;
1663 struct rb_node *node = rb_next(&pos->rb);
1664 if (!node)
1667 pos = rb_to_kn(node);
1678 struct rb_node *node = rb_next(&pos->rb);
1679 if (!node)
1682 pos = rb_to_kn(node);