Lines Matching refs:left
73 struct _t *left; \
107 tmp2 = tmp1->_f.left; \
116 parent->_f.left = tmp1; \
117 tmp1->_f.left = node; \
128 tmp1 = node->_f.left; \
130 node->_f.left = tmp2; \
138 parent->_f.left = tmp1; \
150 node->_f.left = &_n##_rb_zero; \
155 p = &n->_f.left; \
166 if (parent == gparent->_f.left) { \
184 tmp1 = gparent->_f.left; \
191 if (node == parent->_f.left) { \
214 if (parent->_f.left == node) { \
222 if ((tmp->_f.left == &_n##_rb_zero || \
223 tmp->_f.left->_f.colour == C_BLACK) && \
232 _t *tmp2 = tmp->_f.left; \
248 tmp = parent->_f.left; \
253 tmp = parent->_f.left; \
255 if ((tmp->_f.left == &_n##_rb_zero || \
256 tmp->_f.left->_f.colour == C_BLACK) && \
263 if (tmp->_f.left == &_n##_rb_zero || \
264 tmp->_f.left->_f.colour == C_BLACK) {\
271 tmp = parent->_f.left; \
275 if (tmp->_f.left != &_n##_rb_zero) \
276 tmp->_f.left->_f.colour = C_BLACK;\
290 _t *child, *parent, *old = node, *left; \
293 if (node->_f.left == &_n##_rb_zero) { \
296 child = node->_f.left; \
299 while ((left = node->_f.left) != &_n##_rb_zero) \
300 node = left; \
307 if (parent->_f.left == node) \
308 parent->_f.left = child; \
318 if (old->_f.parent->_f.left == old) \
319 old->_f.parent->_f.left = node; \
325 old->_f.left->_f.parent = node; \
329 left = parent; \
338 if (parent->_f.left == node) \
339 parent->_f.left = child; \
356 head->top._f.left = &_n##_rb_zero; \
359 _n##_rb_zero._f.left = &_n##_rb_zero; \
373 node = node->_f.left; \
386 node = node->_f.left) \
410 node = node->_f.left; \
Indexes created Wed Oct 15 16:09:53 GMT 2025