Lines Matching refs:parent
91 struct rb_node *parent = NULL; in __rb_deepest_left() local
93 parent = node; in __rb_deepest_left()
99 return (parent); in __rb_deepest_left()
105 struct rb_node *parent = in rb_next_postorder() local
108 if (parent != NULL && in rb_next_postorder()
109 (node == RB_LEFT(parent, __entry)) && in rb_next_postorder()
110 (RB_RIGHT(parent, __entry))) in rb_next_postorder()
111 return (__rb_deepest_left(RB_RIGHT(parent, __entry))); in rb_next_postorder()
113 return (parent); in rb_next_postorder()
124 rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
127 RB_SET(node, parent, __entry); in rb_link_node()
183 struct rb_node *parent = NULL; in rb_add_cached() local
187 parent = *link; in rb_add_cached()
188 if (less(node, parent)) { in rb_add_cached()
189 link = &RB_LEFT(parent, __entry); in rb_add_cached()
191 link = &RB_RIGHT(parent, __entry); in rb_add_cached()
196 rb_link_node(node, parent, link); in rb_add_cached()
207 struct rb_node *parent = NULL; in rb_add() local
210 parent = *link; in rb_add()
211 if (less(node, parent)) { in rb_add()
212 link = &RB_LEFT(parent, __entry); in rb_add()
214 link = &RB_RIGHT(parent, __entry); in rb_add()
218 rb_link_node(node, parent, link); in rb_add()