Lines Matching refs:__entry
40 RB_ENTRY(rb_node) __entry;
42 #define rb_left __entry.rbe_link[_RB_L]
43 #define rb_right __entry.rbe_link[_RB_R]
64 RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);
66 #define rb_parent(r) RB_PARENT(r, __entry)
72 #define RB_EMPTY_NODE(node) (RB_PARENT(node, __entry) == node)
73 #define RB_CLEAR_NODE(node) RB_SET_PARENT(node, node, __entry)
94 if (RB_LEFT(node, __entry)) in __rb_deepest_left()
95 node = RB_LEFT(node, __entry); in __rb_deepest_left()
97 node = RB_RIGHT(node, __entry); in __rb_deepest_left()
106 RB_PARENT(__DECONST(struct rb_node *, node), __entry); 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()
127 RB_SET(node, parent, __entry); in rb_link_node()
137 victim, new, __entry); in rb_replace_node()
138 if (RB_LEFT(victim, __entry)) in rb_replace_node()
139 RB_SET_PARENT(RB_LEFT(victim, __entry), new, __entry); in rb_replace_node()
140 if (RB_RIGHT(victim, __entry)) in rb_replace_node()
141 RB_SET_PARENT(RB_RIGHT(victim, __entry), new, __entry); in rb_replace_node()
189 link = &RB_LEFT(parent, __entry); in rb_add_cached()
191 link = &RB_RIGHT(parent, __entry); in rb_add_cached()