Lines Matching refs:__entry
42 RB_ENTRY(rb_node) __entry;
44 #define rb_left __entry.rbe_left
45 #define rb_right __entry.rbe_right
66 RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);
68 #define rb_parent(r) RB_PARENT(r, __entry)
74 #define RB_EMPTY_NODE(node) (RB_PARENT(node, __entry) == node)
75 #define RB_CLEAR_NODE(node) RB_SET_PARENT(node, node, __entry)
93 if (RB_LEFT(node, __entry)) in __rb_deepest_left()
94 node = RB_LEFT(node, __entry); in __rb_deepest_left()
96 node = RB_RIGHT(node, __entry); in __rb_deepest_left()
105 RB_PARENT(__DECONST(struct rb_node *, node), __entry); in rb_next_postorder()
108 (node == RB_LEFT(parent, __entry)) && in rb_next_postorder()
109 (RB_RIGHT(parent, __entry))) in rb_next_postorder()
110 return (__rb_deepest_left(RB_RIGHT(parent, __entry))); in rb_next_postorder()
126 RB_SET(node, parent, __entry); in rb_link_node()
135 RB_SWAP_CHILD((struct linux_root *)root, victim, new, __entry); in rb_replace_node()
137 RB_SET_PARENT(victim->rb_left, new, __entry); in rb_replace_node()
139 RB_SET_PARENT(victim->rb_right, new, __entry); in rb_replace_node()