Lines Matching refs:parent
75 struct _t *parent; \
103 _t *parent, *tmp1, *tmp2; \
105 parent = node->_f.parent; \
110 tmp2->_f.parent = node; \
111 if (parent == & _n##_rb_zero) \
113 else if (parent->_f.right == node) \
114 parent->_f.right = tmp1; \
116 parent->_f.left = tmp1; \
118 tmp1->_f.parent = parent; \
119 node->_f.parent = tmp1; \
125 _t *parent, *tmp1, *tmp2; \
127 parent = node->_f.parent; \
132 tmp2->_f.parent = node; \
133 if (parent == &_n##_rb_zero) \
135 else if (parent->_f.right == node) \
136 parent->_f.right = tmp1; \
138 parent->_f.left = tmp1; \
140 tmp1->_f.parent = parent; \
141 node->_f.parent = tmp1; \
147 _t *n, *parent, **p, *tmp1, *gparent; \
149 parent = &head->top; \
158 parent = n; \
162 node->_f.parent = parent; \
164 while ((node != &_n##_rb_zero) && (parent->_f.colour == C_RED)){\
165 gparent = parent->_f.parent; \
166 if (parent == gparent->_f.left) { \
169 parent->_f.colour = C_BLACK; \
174 if (node == parent->_f.right) { \
175 node = parent; \
177 parent = node->_f.parent; \
179 parent->_f.colour = C_BLACK; \
186 parent->_f.colour = C_BLACK; \
191 if (node == parent->_f.left) { \
192 node = parent; \
194 parent = node->_f.parent; \
196 parent->_f.colour = C_BLACK; \
198 rotate_left(head, parent->_f.parent); \
201 parent = node->_f.parent; \
208 deleteblack(struct _n##_rb_head *head, _t *parent, _t *node) \
214 if (parent->_f.left == node) { \
215 tmp = parent->_f.right; \
218 parent->_f.colour = C_RED; \
219 rotate_left(head, parent); \
220 tmp = parent->_f.right; \
227 node = parent; \
228 parent = node->_f.parent; \
238 tmp = parent->_f.right; \
240 tmp->_f.colour = parent->_f.colour; \
241 parent->_f.colour = C_BLACK; \
244 rotate_left(head, parent); \
248 tmp = parent->_f.left; \
251 parent->_f.colour = C_RED; \
252 rotate_right(head, parent); \
253 tmp = parent->_f.left; \
260 node = parent; \
261 parent = node->_f.parent; \
271 tmp = parent->_f.left; \
273 tmp->_f.colour = parent->_f.colour; \
274 parent->_f.colour = C_BLACK; \
277 rotate_right(head, parent); \
290 _t *child, *parent, *old = node, *left; \
302 parent = node->_f.parent; \
305 child->_f.parent = parent; \
306 if (parent != &_n##_rb_zero) { \
307 if (parent->_f.left == node) \
308 parent->_f.left = child; \
310 parent->_f.right = child; \
314 if (node->_f.parent == old) \
315 parent = node; \
317 if (old->_f.parent != &_n##_rb_zero) { \
318 if (old->_f.parent->_f.left == old) \
319 old->_f.parent->_f.left = node; \
321 old->_f.parent->_f.right = node; \
325 old->_f.left->_f.parent = node; \
327 old->_f.right->_f.parent = node; \
328 if (parent != &_n##_rb_zero) { \
329 left = parent; \
333 parent = node->_f.parent; \
336 child->_f.parent = parent; \
337 if (parent != &_n##_rb_zero) { \
338 if (parent->_f.left == node) \
339 parent->_f.left = child; \
341 parent->_f.right = child; \
347 deleteblack(head, parent, node); \
358 head->top._f.parent = &head->top; \
361 _n##_rb_zero._f.parent = &_n##_rb_zero; \
378 while ((node->_f.parent->_f.right == node) && \
381 node = node->_f.parent; \
385 for (node = node->_f.parent->_f.right; node != &_n##_rb_zero;\
Indexes created Wed Oct 22 13:09:56 GMT 2025