Lines Matching defs:node
72 #define RB_EMPTY_NODE(node) (RB_PARENT(node, __entry) == node)
73 #define RB_CLEAR_NODE(node) RB_SET_PARENT(node, node, __entry)
75 #define rb_insert_color(node, root) do { \
76 if (rb_parent(node)) \
78 rb_parent(node), (node)); \
80 #define rb_erase(node, root) \
81 linux_root_RB_REMOVE((struct linux_root *)(root), (node))
82 #define rb_next(node) RB_NEXT(linux_root, NULL, (node))
83 #define rb_prev(node) RB_PREV(linux_root, NULL, (node))
89 __rb_deepest_left(struct rb_node *node)
92 while (node != NULL) {
93 parent = node;
94 if (RB_LEFT(node, __entry))
95 node = RB_LEFT(node, __entry);
97 node = RB_RIGHT(node, __entry);
103 rb_next_postorder(const struct rb_node *node)
106 RB_PARENT(__DECONST(struct rb_node *, node), __entry);
109 (node == RB_LEFT(parent, __entry)) &&
124 rb_link_node(struct rb_node *node, struct rb_node *parent,
127 RB_SET(node, parent, __entry);
128 *rb_link = node;
146 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root,
149 if (rb_parent(node))
151 rb_parent(node), node);
153 root->rb_leftmost = node;
157 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)
161 if (node == root->rb_leftmost)
162 retval = root->rb_leftmost = linux_root_RB_NEXT(node);
165 linux_root_RB_REMOVE((struct linux_root *)&root->rb_root, node);
179 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,
188 if (less(node, parent)) {
196 rb_link_node(node, parent, link);
197 rb_insert_color_cached(node, tree, leftmost);
199 return (leftmost ? node : NULL);