Lines Matching refs:right
17 struct _t *right; \
45 tmp1 = node->_f.right; \
47 node->_f.right = tmp2; \
51 head->top._f.right = tmp1; \
52 else if (parent->_f.right == node) \
53 parent->_f.right = tmp1; \
68 tmp2 = tmp1->_f.right; \
73 head->top._f.right = tmp1; \
74 else if (parent->_f.right == node) \
75 parent->_f.right = tmp1; \
78 tmp1->_f.right = node; \
90 node->_f.right = &_n##_rb_zero; \
91 p = &head->top._f.right; \
96 p = &n->_f.right; \
106 tmp1 = gparent->_f.right; \
113 if (node == parent->_f.right) { \
142 head->top._f.right->_f.colour = C_BLACK; \
154 tmp = parent->_f.right; \
159 tmp = parent->_f.right; \
163 (tmp->_f.right == &_n##_rb_zero || \
164 tmp->_f.right->_f.colour == C_BLACK)) { \
169 if (tmp->_f.right == &_n##_rb_zero || \
170 tmp->_f.right->_f.colour == C_BLACK) {\
177 tmp = parent->_f.right; \
181 if (tmp->_f.right != &_n##_rb_zero) \
182 tmp->_f.right->_f.colour = C_BLACK;\
184 node = head->top._f.right; \
196 (tmp->_f.right == &_n##_rb_zero || \
197 tmp->_f.right->_f.colour == C_BLACK)) { \
204 _t *tmp2 = tmp->_f.right; \
217 node = head->top._f.right; \
233 child = node->_f.right; \
234 } else if (node->_f.right == &_n##_rb_zero) { \
237 node = node->_f.right; \
240 child = node->_f.right; \
249 parent->_f.right = child; \
251 head->top._f.right = child; \
260 old->_f.parent->_f.right = node; \
262 head->top._f.right = child; \
265 if (old->_f.right != &_n##_rb_zero) \
266 old->_f.right->_f.parent = node; \
280 parent->_f.right = child; \
282 head->top._f.right = child; \
297 head->top._f.right = &_n##_rb_zero; \
300 _n##_rb_zero._f.right = &_n##_rb_zero; \
309 _t *node = head->top._f.right; \
318 while ((node->_f.parent->_f.right == node) && \
325 for (node = node->_f.parent->_f.right; node != &_n##_rb_zero;\
344 node = head->top._f.right; \
352 node = node->_f.right; \