Lines Matching refs:right
15 struct _t *right; \
43 tmp1 = node->_f.right; \
45 node->_f.right = tmp2; \
49 head->top._f.right = tmp1; \
50 else if (parent->_f.right == node) \
51 parent->_f.right = tmp1; \
66 tmp2 = tmp1->_f.right; \
71 head->top._f.right = tmp1; \
72 else if (parent->_f.right == node) \
73 parent->_f.right = tmp1; \
76 tmp1->_f.right = node; \
88 node->_f.right = &_n##_rb_zero; \
89 p = &head->top._f.right; \
94 p = &n->_f.right; \
104 tmp1 = gparent->_f.right; \
111 if (node == parent->_f.right) { \
140 head->top._f.right->_f.colour = C_BLACK; \
152 tmp = parent->_f.right; \
157 tmp = parent->_f.right; \
161 (tmp->_f.right == &_n##_rb_zero || \
162 tmp->_f.right->_f.colour == C_BLACK)) { \
167 if (tmp->_f.right == &_n##_rb_zero || \
168 tmp->_f.right->_f.colour == C_BLACK) {\
175 tmp = parent->_f.right; \
179 if (tmp->_f.right != &_n##_rb_zero) \
180 tmp->_f.right->_f.colour = C_BLACK;\
182 node = head->top._f.right; \
194 (tmp->_f.right == &_n##_rb_zero || \
195 tmp->_f.right->_f.colour == C_BLACK)) { \
202 _t *tmp2 = tmp->_f.right; \
215 node = head->top._f.right; \
231 child = node->_f.right; \
232 } else if (node->_f.right == &_n##_rb_zero) { \
235 node = node->_f.right; \
238 child = node->_f.right; \
247 parent->_f.right = child; \
249 head->top._f.right = child; \
258 old->_f.parent->_f.right = node; \
260 head->top._f.right = child; \
263 if (old->_f.right != &_n##_rb_zero) \
264 old->_f.right->_f.parent = node; \
278 parent->_f.right = child; \
280 head->top._f.right = child; \
295 head->top._f.right = &_n##_rb_zero; \
298 _n##_rb_zero._f.right = &_n##_rb_zero; \
307 _t *node = head->top._f.right; \
316 while ((node->_f.parent->_f.right == node) && \
323 for (node = node->_f.parent->_f.right; node != &_n##_rb_zero;\
342 node = head->top._f.right; \
350 node = node->_f.right; \