Home | History | Annotate | Download | only in ext2fs

Lines Matching refs:rb_left

30 	if ((node->rb_right = right->rb_left))
31 ext2fs_rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
39 parent->rb_left = right;
50 struct rb_node *left = node->rb_left;
53 if ((node->rb_left = left->rb_right))
64 parent->rb_left = left;
79 if (parent == gparent->rb_left)
107 register struct rb_node *uncle = gparent->rb_left;
118 if (parent->rb_left == node)
143 if (parent->rb_left == node)
153 if ((!other->rb_left || ext2fs_rb_is_black(other->rb_left)) &&
164 ext2fs_rb_set_black(other->rb_left);
179 other = parent->rb_left;
185 other = parent->rb_left;
187 if ((!other->rb_left || ext2fs_rb_is_black(other->rb_left)) &&
196 if (!other->rb_left || ext2fs_rb_is_black(other->rb_left))
201 other = parent->rb_left;
205 ext2fs_rb_set_black(other->rb_left);
221 if (!node->rb_left)
224 child = node->rb_left;
230 while ((left = node->rb_left) != NULL)
234 if (ext2fs_rb_parent(old)->rb_left == old)
235 ext2fs_rb_parent(old)->rb_left = node;
250 parent->rb_left = child;
257 node->rb_left = old->rb_left;
258 ext2fs_rb_set_parent(old->rb_left, node);
270 if (parent->rb_left == node)
271 parent->rb_left = child;
293 if (node == parent->rb_left && parent->rb_right)
295 else if (parent->rb_left)
296 func(parent->rb_left, data);
308 if (node->rb_left)
309 node = node->rb_left;
324 if (!node->rb_right && !node->rb_left)
327 deepest = node->rb_left;
328 else if (!node->rb_left)
361 while (n->rb_left)
362 n = n->rb_left;
389 while (node->rb_left)
390 node=node->rb_left;
415 if (node->rb_left) {
416 node = node->rb_left;
424 while ((parent = ext2fs_rb_parent(node)) && node == parent->rb_left)
437 if (victim == parent->rb_left)
438 parent->rb_left = new;
444 if (victim->rb_left)
445 ext2fs_rb_set_parent(victim->rb_left, new);