2 * Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 #include "gtkrbtree.h"
24 static void _gtk_rbnode_validate_allocator (GAllocator *allocator);
25 static GtkRBNode * _gtk_rbnode_new (GtkRBTree *tree,
27 static void _gtk_rbnode_free (GtkRBNode *node);
28 static void _gtk_rbnode_rotate_left (GtkRBTree *tree,
30 static void _gtk_rbnode_rotate_right (GtkRBTree *tree,
32 static void _gtk_rbtree_insert_fixup (GtkRBTree *tree,
34 static void _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
36 static gint _count_nodes (GtkRBTree *tree,
38 static inline void _fixup_validation (GtkRBTree *tree,
40 static inline void _fixup_parity (GtkRBTree *tree,
47 struct _GAllocator /* from gmem.c */
55 GtkRBNode *free_nodes; /* implementation specific */
59 G_LOCK_DEFINE_STATIC (current_allocator);
60 static GAllocator *current_allocator = NULL;
63 /* HOLDS: current_allocator_lock */
65 _gtk_rbnode_validate_allocator (GAllocator *allocator)
67 g_return_if_fail (allocator != NULL);
68 g_return_if_fail (allocator->is_unused == TRUE);
70 if (allocator->type != G_ALLOCATOR_NODE)
72 allocator->type = G_ALLOCATOR_NODE;
73 if (allocator->mem_chunk)
75 g_mem_chunk_destroy (allocator->mem_chunk);
76 allocator->mem_chunk = NULL;
80 if (!allocator->mem_chunk)
82 allocator->mem_chunk = g_mem_chunk_new (allocator->name,
84 sizeof (GtkRBNode) * allocator->n_preallocs,
86 allocator->free_nodes = NULL;
89 allocator->is_unused = FALSE;
93 _gtk_rbnode_new (GtkRBTree *tree,
98 G_LOCK (current_allocator);
99 if (!current_allocator)
101 GAllocator *allocator = g_allocator_new ("GTK+ default GtkRBNode allocator",
103 _gtk_rbnode_validate_allocator (allocator);
104 allocator->last = NULL;
105 current_allocator = allocator;
107 if (!current_allocator->free_nodes)
108 node = g_chunk_new (GtkRBNode, current_allocator->mem_chunk);
111 node = current_allocator->free_nodes;
112 current_allocator->free_nodes = node->left;
114 G_UNLOCK (current_allocator);
116 node->left = tree->nil;
117 node->right = tree->nil;
118 node->parent = tree->nil;
119 node->flags = GTK_RBNODE_RED;
122 node->children = NULL;
123 node->offset = height;
128 _gtk_rbnode_free (GtkRBNode *node)
130 G_LOCK (current_allocator);
131 node->left = current_allocator->free_nodes;
132 current_allocator->free_nodes = node;
133 if (gtk_debug_flags & GTK_DEBUG_TREE)
135 /* unfortunately node->left has to continue to point to
138 node->right = (gpointer) 0xdeadbeef;
139 node->parent = (gpointer) 0xdeadbeef;
140 node->offset = 56789;
144 G_UNLOCK (current_allocator);
148 _gtk_rbnode_rotate_left (GtkRBTree *tree,
151 gint node_height, right_height;
152 GtkRBNode *right = node->right;
154 g_return_if_fail (node != tree->nil);
156 node_height = node->offset -
157 (node->left?node->left->offset:0) -
158 (node->right?node->right->offset:0) -
159 (node->children?node->children->root->offset:0);
160 right_height = right->offset -
161 (right->left?right->left->offset:0) -
162 (right->right?right->right->offset:0) -
163 (right->children?right->children->root->offset:0);
164 node->right = right->left;
165 if (right->left != tree->nil)
166 right->left->parent = node;
168 if (right != tree->nil)
169 right->parent = node->parent;
170 if (node->parent != tree->nil)
172 if (node == node->parent->left)
173 node->parent->left = right;
175 node->parent->right = right;
181 if (node != tree->nil)
182 node->parent = right;
184 node->count = 1 + (node->left?node->left->count:0) +
185 (node->right?node->right->count:0);
186 right->count = 1 + (right->left?right->left->count:0) +
187 (right->right?right->right->count:0);
189 node->offset = node_height +
190 (node->left?node->left->offset:0) +
191 (node->right?node->right->offset:0) +
192 (node->children?node->children->root->offset:0);
193 right->offset = right_height +
194 (right->left?right->left->offset:0) +
195 (right->right?right->right->offset:0) +
196 (right->children?right->children->root->offset:0);
198 _fixup_validation (tree, node);
199 _fixup_validation (tree, right);
200 _fixup_parity (tree, node);
201 _fixup_parity (tree, right);
205 _gtk_rbnode_rotate_right (GtkRBTree *tree,
208 gint node_height, left_height;
209 GtkRBNode *left = node->left;
211 g_return_if_fail (node != tree->nil);
213 node_height = node->offset -
214 (node->left?node->left->offset:0) -
215 (node->right?node->right->offset:0) -
216 (node->children?node->children->root->offset:0);
217 left_height = left->offset -
218 (left->left?left->left->offset:0) -
219 (left->right?left->right->offset:0) -
220 (left->children?left->children->root->offset:0);
222 node->left = left->right;
223 if (left->right != tree->nil)
224 left->right->parent = node;
226 if (left != tree->nil)
227 left->parent = node->parent;
228 if (node->parent != tree->nil)
230 if (node == node->parent->right)
231 node->parent->right = left;
233 node->parent->left = left;
240 /* link node and left */
242 if (node != tree->nil)
245 node->count = 1 + (node->left?node->left->count:0) +
246 (node->right?node->right->count:0);
247 left->count = 1 + (left->left?left->left->count:0) +
248 (left->right?left->right->count:0);
250 node->offset = node_height +
251 (node->left?node->left->offset:0) +
252 (node->right?node->right->offset:0) +
253 (node->children?node->children->root->offset:0);
254 left->offset = left_height +
255 (left->left?left->left->offset:0) +
256 (left->right?left->right->offset:0) +
257 (left->children?left->children->root->offset:0);
259 _fixup_validation (tree, node);
260 _fixup_validation (tree, left);
261 _fixup_parity (tree, node);
262 _fixup_parity (tree, left);
266 _gtk_rbtree_insert_fixup (GtkRBTree *tree,
270 /* check Red-Black properties */
271 while (node != tree->root && GTK_RBNODE_GET_COLOR (node->parent) == GTK_RBNODE_RED)
273 /* we have a violation */
274 if (node->parent == node->parent->parent->left)
276 GtkRBNode *y = node->parent->parent->right;
277 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
279 /* uncle is GTK_RBNODE_RED */
280 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
281 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
282 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
283 node = node->parent->parent;
287 /* uncle is GTK_RBNODE_BLACK */
288 if (node == node->parent->right)
290 /* make node a left child */
292 _gtk_rbnode_rotate_left (tree, node);
295 /* recolor and rotate */
296 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
297 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
298 _gtk_rbnode_rotate_right(tree, node->parent->parent);
303 /* mirror image of above code */
304 GtkRBNode *y = node->parent->parent->left;
305 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
307 /* uncle is GTK_RBNODE_RED */
308 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
309 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
310 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
311 node = node->parent->parent;
315 /* uncle is GTK_RBNODE_BLACK */
316 if (node == node->parent->left)
319 _gtk_rbnode_rotate_right (tree, node);
321 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
322 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
323 _gtk_rbnode_rotate_left (tree, node->parent->parent);
327 GTK_RBNODE_SET_COLOR (tree->root, GTK_RBNODE_BLACK);
331 _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
334 while (node != tree->root && GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
336 if (node == node->parent->left)
338 GtkRBNode *w = node->parent->right;
339 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
341 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
342 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
343 _gtk_rbnode_rotate_left (tree, node->parent);
344 w = node->parent->right;
346 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
348 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
353 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
355 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
356 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
357 _gtk_rbnode_rotate_right (tree, w);
358 w = node->parent->right;
360 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
361 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
362 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
363 _gtk_rbnode_rotate_left (tree, node->parent);
369 GtkRBNode *w = node->parent->left;
370 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
372 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
373 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
374 _gtk_rbnode_rotate_right (tree, node->parent);
375 w = node->parent->left;
377 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
379 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
384 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
386 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
387 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
388 _gtk_rbnode_rotate_left (tree, w);
389 w = node->parent->left;
391 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
392 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
393 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
394 _gtk_rbnode_rotate_right (tree, node->parent);
399 GTK_RBNODE_SET_COLOR (node, GTK_RBNODE_BLACK);
402 /* Public functions */
404 _gtk_rbnode_push_allocator (GAllocator *allocator)
406 G_LOCK (current_allocator);
407 _gtk_rbnode_validate_allocator ( allocator );
408 allocator->last = current_allocator;
409 current_allocator = allocator;
410 G_UNLOCK (current_allocator);
414 _gtk_rbnode_pop_allocator (void)
416 G_LOCK (current_allocator);
417 if (current_allocator)
419 GAllocator *allocator;
421 allocator = current_allocator;
422 current_allocator = allocator->last;
423 allocator->last = NULL;
424 allocator->is_unused = TRUE;
426 G_UNLOCK (current_allocator);
430 _gtk_rbtree_new (void)
434 retval = (GtkRBTree *) g_new (GtkRBTree, 1);
435 retval->parent_tree = NULL;
436 retval->parent_node = NULL;
438 retval->nil = g_new0 (GtkRBNode, 1);
439 retval->nil->left = NULL;
440 retval->nil->right = NULL;
441 retval->nil->parent = NULL;
442 retval->nil->flags = GTK_RBNODE_BLACK;
443 retval->nil->count = 0;
444 retval->nil->offset = 0;
445 retval->nil->parity = 0;
447 retval->root = retval->nil;
452 _gtk_rbtree_free_helper (GtkRBTree *tree,
457 _gtk_rbtree_free (node->children);
459 _gtk_rbnode_free (node);
463 _gtk_rbtree_free (GtkRBTree *tree)
465 _gtk_rbtree_traverse (tree,
468 _gtk_rbtree_free_helper,
471 if (tree->parent_node &&
472 tree->parent_node->children == tree)
473 tree->parent_node->children = NULL;
474 _gtk_rbnode_free (tree->nil);
479 _gtk_rbtree_remove (GtkRBTree *tree)
484 gint height = tree->root->offset;
486 #ifdef G_ENABLE_DEBUG
487 if (gtk_debug_flags & GTK_DEBUG_TREE)
488 _gtk_rbtree_test (G_STRLOC, tree);
491 tmp_tree = tree->parent_tree;
492 tmp_node = tree->parent_node;
494 /* ugly hack to make _fixup_validation work in the first iteration of the
496 GTK_RBNODE_UNSET_FLAG (tree->root, GTK_RBNODE_DESCENDANTS_INVALID);
498 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
500 _fixup_validation (tmp_tree, tmp_node);
501 tmp_node->offset -= height;
503 /* If the removed tree was odd, flip all parents */
504 if (tree->root->parity)
505 tmp_node->parity = !tmp_node->parity;
507 tmp_node = tmp_node->parent;
508 if (tmp_node == tmp_tree->nil)
510 tmp_node = tmp_tree->parent_node;
511 tmp_tree = tmp_tree->parent_tree;
515 tmp_tree = tree->parent_tree;
516 tmp_node = tree->parent_node;
517 _gtk_rbtree_free (tree);
519 #ifdef G_ENABLE_DEBUG
520 if (gtk_debug_flags & GTK_DEBUG_TREE)
521 _gtk_rbtree_test (G_STRLOC, tmp_tree);
527 _gtk_rbtree_insert_after (GtkRBTree *tree,
533 gboolean right = TRUE;
537 #ifdef G_ENABLE_DEBUG
538 if (gtk_debug_flags & GTK_DEBUG_TREE)
540 g_print ("\n\n_gtk_rbtree_insert_after: %p\n", current);
541 _gtk_rbtree_debug_spew (tree);
542 _gtk_rbtree_test (G_STRLOC, tree);
544 #endif /* G_ENABLE_DEBUG */
546 if (current != NULL && current->right != tree->nil)
548 current = current->right;
549 while (current->left != tree->nil)
550 current = current->left;
554 node = _gtk_rbnode_new (tree, height);
555 node->parent = (current?current:tree->nil);
557 /* insert node in tree */
561 current->right = node;
563 current->left = node;
564 tmp_node = node->parent;
570 tmp_node = tree->parent_node;
571 tmp_tree = tree->parent_tree;
574 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
576 /* We only want to propagate the count if we are in the tree we
578 if (tmp_tree == tree)
581 tmp_node->parity += 1;
582 tmp_node->offset += height;
583 tmp_node = tmp_node->parent;
584 if (tmp_node == tmp_tree->nil)
586 tmp_node = tmp_tree->parent_node;
587 tmp_tree = tmp_tree->parent_tree;
592 _gtk_rbtree_node_mark_valid (tree, node);
594 _gtk_rbtree_node_mark_invalid (tree, node);
596 _gtk_rbtree_insert_fixup (tree, node);
598 #ifdef G_ENABLE_DEBUG
599 if (gtk_debug_flags & GTK_DEBUG_TREE)
601 g_print ("_gtk_rbtree_insert_after finished...\n");
602 _gtk_rbtree_debug_spew (tree);
604 _gtk_rbtree_test (G_STRLOC, tree);
606 #endif /* G_ENABLE_DEBUG */
612 _gtk_rbtree_insert_before (GtkRBTree *tree,
618 gboolean left = TRUE;
622 #ifdef G_ENABLE_DEBUG
623 if (gtk_debug_flags & GTK_DEBUG_TREE)
625 g_print ("\n\n_gtk_rbtree_insert_before: %p\n", current);
626 _gtk_rbtree_debug_spew (tree);
627 _gtk_rbtree_test (G_STRLOC, tree);
629 #endif /* G_ENABLE_DEBUG */
631 if (current != NULL && current->left != tree->nil)
633 current = current->left;
634 while (current->right != tree->nil)
635 current = current->right;
640 node = _gtk_rbnode_new (tree, height);
641 node->parent = (current?current:tree->nil);
643 /* insert node in tree */
647 current->left = node;
649 current->right = node;
650 tmp_node = node->parent;
656 tmp_node = tree->parent_node;
657 tmp_tree = tree->parent_tree;
660 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
662 /* We only want to propagate the count if we are in the tree we
664 if (tmp_tree == tree)
667 tmp_node->parity += 1;
668 tmp_node->offset += height;
669 tmp_node = tmp_node->parent;
670 if (tmp_node == tmp_tree->nil)
672 tmp_node = tmp_tree->parent_node;
673 tmp_tree = tmp_tree->parent_tree;
678 _gtk_rbtree_node_mark_valid (tree, node);
680 _gtk_rbtree_node_mark_invalid (tree, node);
682 _gtk_rbtree_insert_fixup (tree, node);
684 #ifdef G_ENABLE_DEBUG
685 if (gtk_debug_flags & GTK_DEBUG_TREE)
687 g_print ("_gtk_rbtree_insert_before finished...\n");
688 _gtk_rbtree_debug_spew (tree);
690 _gtk_rbtree_test (G_STRLOC, tree);
692 #endif /* G_ENABLE_DEBUG */
698 _gtk_rbtree_find_count (GtkRBTree *tree,
704 while (node != tree->nil && (node->left->count + 1 != count))
706 if (node->left->count >= count)
710 count -= (node->left->count + 1);
714 if (node == tree->nil)
720 _gtk_rbtree_node_set_height (GtkRBTree *tree,
724 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
725 GtkRBNode *tmp_node = node;
726 GtkRBTree *tmp_tree = tree;
731 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
733 tmp_node->offset += diff;
734 tmp_node = tmp_node->parent;
735 if (tmp_node == tmp_tree->nil)
737 tmp_node = tmp_tree->parent_node;
738 tmp_tree = tmp_tree->parent_tree;
741 #ifdef G_ENABLE_DEBUG
742 if (gtk_debug_flags & GTK_DEBUG_TREE)
743 _gtk_rbtree_test (G_STRLOC, tree);
748 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
751 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
754 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
757 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
759 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
761 if (node == tree->nil)
763 node = tree->parent_node;
764 tree = tree->parent_tree;
771 /* Draconian version. */
773 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
776 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
779 _fixup_validation (tree, node);
781 if (node == tree->nil)
783 node = tree->parent_node;
784 tree = tree->parent_tree;
792 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
795 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
796 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
799 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
800 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
804 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
805 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
806 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
807 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
808 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
811 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
813 if (node == tree->nil)
815 node = tree->parent_node;
816 tree = tree->parent_tree;
823 /* Draconian version */
825 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
828 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
829 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
833 _fixup_validation (tree, node);
835 if (node == tree->nil)
837 node = tree->parent_node;
838 tree = tree->parent_tree;
844 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
847 _gtk_rbtree_column_invalid (GtkRBTree *tree)
856 while (node->left != tree->nil)
861 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
862 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
863 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
866 _gtk_rbtree_column_invalid (node->children);
868 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
872 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
881 while (node->left != tree->nil)
886 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
887 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
890 _gtk_rbtree_mark_invalid (node->children);
892 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
896 _gtk_rbtree_set_fixed_height (GtkRBTree *tree,
907 while (node->left != tree->nil)
912 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
913 _gtk_rbtree_node_set_height (tree, node, height);
916 _gtk_rbtree_set_fixed_height (node->children, height);
918 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
921 typedef struct _GtkRBReorder
932 gtk_rbtree_reorder_sort_func (gconstpointer a,
935 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
939 gtk_rbtree_reorder_invert_func (gconstpointer a,
942 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
946 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
949 if (node == tree->nil)
954 if (node->left != tree->nil)
956 gtk_rbtree_reorder_fixup (tree, node->left);
957 node->offset += node->left->offset;
958 node->parity += node->left->parity;
960 if (node->right != tree->nil)
962 gtk_rbtree_reorder_fixup (tree, node->right);
963 node->offset += node->right->offset;
964 node->parity += node->right->parity;
969 node->offset += node->children->root->offset;
970 node->parity += node->children->root->parity;
973 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
974 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
975 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
976 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
977 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
979 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
982 /* It basically pulls everything out of the tree, rearranges it, and puts it
983 * back together. Our strategy is to keep the old RBTree intact, and just
984 * rearrange the contents. When that is done, we go through and update the
985 * heights. There is probably a more elegant way to write this function. If
986 * anyone wants to spend the time writing it, patches will be accepted.
989 _gtk_rbtree_reorder (GtkRBTree *tree,
993 GtkRBReorder reorder = {0, };
998 g_return_if_fail (tree != NULL);
999 g_return_if_fail (length > 0);
1000 g_return_if_fail (tree->root->count == length);
1002 /* Sort the trees values in the new tree. */
1003 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
1004 for (i = 0; i < length; i++)
1006 reorder.order = new_order[i];
1007 reorder.invert_order = i;
1008 g_array_append_val (array, reorder);
1011 g_array_sort(array, gtk_rbtree_reorder_sort_func);
1015 while (node && node->left != tree->nil)
1018 for (i = 0; i < length; i++)
1020 g_assert (node != tree->nil);
1021 g_array_index (array, GtkRBReorder, i).children = node->children;
1022 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
1023 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
1025 node = _gtk_rbtree_next (tree, node);
1028 g_array_sort (array, gtk_rbtree_reorder_invert_func);
1032 while (node && node->left != tree->nil)
1035 /* Go through the tree and change the values to the new ones. */
1036 for (i = 0; i < length; i++)
1038 reorder = g_array_index (array, GtkRBReorder, i);
1039 node->children = reorder.children;
1041 node->children->parent_node = node;
1042 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
1043 /* We temporarily set the height to this. */
1044 node->offset = reorder.height;
1045 node = _gtk_rbtree_next (tree, node);
1047 gtk_rbtree_reorder_fixup (tree, tree->root);
1049 g_array_free (array, TRUE);
1054 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
1061 g_assert (node->left);
1063 retval = node->left->offset;
1065 while (tree && node && node != tree->nil)
1068 node = node->parent;
1070 /* Add left branch, plus children, iff we came from the right */
1071 if (node->right == last)
1072 retval += node->offset - node->right->offset;
1074 if (node == tree->nil)
1076 node = tree->parent_node;
1077 tree = tree->parent_tree;
1079 /* Add the parent node, plus the left branch. */
1081 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
1088 _gtk_rbtree_node_find_parity (GtkRBTree *tree,
1095 g_assert (node->left);
1097 retval = node->left->parity;
1099 while (tree && node && node != tree->nil)
1102 node = node->parent;
1104 /* Add left branch, plus children, iff we came from the right */
1105 if (node->right == last)
1106 retval += node->parity - node->right->parity;
1108 if (node == tree->nil)
1110 node = tree->parent_node;
1111 tree = tree->parent_tree;
1113 /* Add the parent node, plus the left branch. */
1115 retval += node->left->parity + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1123 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1125 GtkRBTree **new_tree,
1126 GtkRBNode **new_node)
1128 GtkRBNode *tmp_node;
1141 tmp_node = tree->root;
1142 while (tmp_node != tree->nil &&
1143 (tmp_node->left->offset > height ||
1144 (tmp_node->offset - tmp_node->right->offset) < height))
1146 if (tmp_node->left->offset > height)
1147 tmp_node = tmp_node->left;
1150 height -= (tmp_node->offset - tmp_node->right->offset);
1151 tmp_node = tmp_node->right;
1154 if (tmp_node == tree->nil)
1160 if (tmp_node->children)
1162 if ((tmp_node->offset -
1163 tmp_node->right->offset -
1164 tmp_node->children->root->offset) > height)
1167 *new_node = tmp_node;
1168 return (height - tmp_node->left->offset);
1170 return _gtk_rbtree_real_find_offset (tmp_node->children,
1171 height - tmp_node->left->offset -
1173 tmp_node->left->offset -
1174 tmp_node->right->offset -
1175 tmp_node->children->root->offset),
1180 *new_node = tmp_node;
1181 return (height - tmp_node->left->offset);
1185 _gtk_rbtree_find_offset (GtkRBTree *tree,
1187 GtkRBTree **new_tree,
1188 GtkRBNode **new_node)
1193 (height >= tree->root->offset))
1200 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1204 _gtk_rbtree_remove_node (GtkRBTree *tree,
1208 GtkRBTree *tmp_tree;
1209 GtkRBNode *tmp_node;
1213 g_return_if_fail (tree != NULL);
1214 g_return_if_fail (node != NULL);
1217 #ifdef G_ENABLE_DEBUG
1218 if (gtk_debug_flags & GTK_DEBUG_TREE)
1220 g_print ("\n\n_gtk_rbtree_remove_node: %p\n", node);
1221 _gtk_rbtree_debug_spew (tree);
1222 _gtk_rbtree_test (G_STRLOC, tree);
1224 #endif /* G_ENABLE_DEBUG */
1226 /* make sure we're deleting a node that's actually in the tree */
1227 for (x = node; x->parent != tree->nil; x = x->parent)
1229 g_return_if_fail (x == tree->root);
1231 #ifdef G_ENABLE_DEBUG
1232 if (gtk_debug_flags & GTK_DEBUG_TREE)
1233 _gtk_rbtree_test (G_STRLOC, tree);
1236 if (node->left == tree->nil || node->right == tree->nil)
1244 while (y->left != tree->nil)
1248 /* adjust count only beneath tree */
1249 for (x = y; x != tree->nil; x = x->parent)
1254 /* offsets and parity adjust all the way up through parent trees */
1255 y_height = GTK_RBNODE_GET_HEIGHT (y);
1256 node_height = GTK_RBNODE_GET_HEIGHT (node) + (node->children?node->children->root->offset:0);
1260 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1262 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1263 _fixup_validation (tmp_tree, tmp_node);
1264 _fixup_parity (tmp_tree, tmp_node);
1265 tmp_node = tmp_node->parent;
1266 if (tmp_node == tmp_tree->nil)
1268 tmp_node = tmp_tree->parent_node;
1269 tmp_tree = tmp_tree->parent_tree;
1273 /* x is y's only child, or nil */
1274 if (y->left != tree->nil)
1279 /* remove y from the parent chain */
1280 x->parent = y->parent;
1281 if (y->parent != tree->nil)
1283 if (y == y->parent->left)
1284 y->parent->left = x;
1286 y->parent->right = x;
1293 /* We need to clean up the validity of the tree.
1300 /* We skip the first time, iff x is nil */
1301 if (tmp_node != tmp_tree->nil)
1303 _fixup_validation (tmp_tree, tmp_node);
1304 _fixup_parity (tmp_tree, tmp_node);
1306 tmp_node = tmp_node->parent;
1307 if (tmp_node == tmp_tree->nil)
1309 tmp_node = tmp_tree->parent_node;
1310 tmp_tree = tmp_tree->parent_tree;
1313 while (tmp_tree != NULL);
1319 /* Copy the node over */
1320 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1321 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_BLACK);
1323 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_RED);
1324 node->children = y->children;
1327 node->children = y->children;
1328 node->children->parent_node = node;
1332 node->children = NULL;
1334 _fixup_validation (tree, node);
1335 _fixup_parity (tree, node);
1336 /* We want to see how different our height is from the previous node.
1337 * To do this, we compare our current height with our supposed height.
1339 diff = y_height - GTK_RBNODE_GET_HEIGHT (node);
1343 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1345 tmp_node->offset += diff;
1346 _fixup_validation (tmp_tree, tmp_node);
1347 _fixup_parity (tmp_tree, tmp_node);
1348 tmp_node = tmp_node->parent;
1349 if (tmp_node == tmp_tree->nil)
1351 tmp_node = tmp_tree->parent_node;
1352 tmp_tree = tmp_tree->parent_tree;
1357 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_BLACK)
1358 _gtk_rbtree_remove_node_fixup (tree, x);
1359 _gtk_rbnode_free (y);
1361 #ifdef G_ENABLE_DEBUG
1362 if (gtk_debug_flags & GTK_DEBUG_TREE)
1364 g_print ("_gtk_rbtree_remove_node finished...\n");
1365 _gtk_rbtree_debug_spew (tree);
1367 _gtk_rbtree_test (G_STRLOC, tree);
1369 #endif /* G_ENABLE_DEBUG */
1373 _gtk_rbtree_next (GtkRBTree *tree,
1376 g_return_val_if_fail (tree != NULL, NULL);
1377 g_return_val_if_fail (node != NULL, NULL);
1379 /* Case 1: the node's below us. */
1380 if (node->right != tree->nil)
1383 while (node->left != tree->nil)
1388 /* Case 2: it's an ancestor */
1389 while (node->parent != tree->nil)
1391 if (node->parent->right == node)
1392 node = node->parent;
1394 return (node->parent);
1397 /* Case 3: There is no next node */
1402 _gtk_rbtree_prev (GtkRBTree *tree,
1405 g_return_val_if_fail (tree != NULL, NULL);
1406 g_return_val_if_fail (node != NULL, NULL);
1408 /* Case 1: the node's below us. */
1409 if (node->left != tree->nil)
1412 while (node->right != tree->nil)
1417 /* Case 2: it's an ancestor */
1418 while (node->parent != tree->nil)
1420 if (node->parent->left == node)
1421 node = node->parent;
1423 return (node->parent);
1426 /* Case 3: There is no next node */
1431 _gtk_rbtree_next_full (GtkRBTree *tree,
1433 GtkRBTree **new_tree,
1434 GtkRBNode **new_node)
1436 g_return_if_fail (tree != NULL);
1437 g_return_if_fail (node != NULL);
1438 g_return_if_fail (new_tree != NULL);
1439 g_return_if_fail (new_node != NULL);
1443 *new_tree = node->children;
1444 *new_node = (*new_tree)->root;
1445 while ((*new_node)->left != (*new_tree)->nil)
1446 *new_node = (*new_node)->left;
1451 *new_node = _gtk_rbtree_next (tree, node);
1453 while ((*new_node == NULL) &&
1454 (*new_tree != NULL))
1456 *new_node = (*new_tree)->parent_node;
1457 *new_tree = (*new_tree)->parent_tree;
1459 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1464 _gtk_rbtree_prev_full (GtkRBTree *tree,
1466 GtkRBTree **new_tree,
1467 GtkRBNode **new_node)
1469 g_return_if_fail (tree != NULL);
1470 g_return_if_fail (node != NULL);
1471 g_return_if_fail (new_tree != NULL);
1472 g_return_if_fail (new_node != NULL);
1475 *new_node = _gtk_rbtree_prev (tree, node);
1477 if (*new_node == NULL)
1479 *new_node = (*new_tree)->parent_node;
1480 *new_tree = (*new_tree)->parent_tree;
1484 while ((*new_node)->children)
1486 *new_tree = (*new_node)->children;
1487 *new_node = (*new_tree)->root;
1488 while ((*new_node)->right != (*new_tree)->nil)
1489 *new_node = (*new_node)->right;
1495 _gtk_rbtree_get_depth (GtkRBTree *tree)
1497 GtkRBTree *tmp_tree;
1500 tmp_tree = tree->parent_tree;
1504 tmp_tree = tmp_tree->parent_tree;
1511 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1513 GtkRBTreeTraverseFunc func,
1516 if (node == tree->nil)
1519 (* func) (tree, node, data);
1520 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1521 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1525 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1527 GtkRBTreeTraverseFunc func,
1530 if (node == tree->nil)
1533 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1534 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1535 (* func) (tree, node, data);
1539 _gtk_rbtree_traverse (GtkRBTree *tree,
1541 GTraverseType order,
1542 GtkRBTreeTraverseFunc func,
1545 g_return_if_fail (tree != NULL);
1546 g_return_if_fail (node != NULL);
1547 g_return_if_fail (func != NULL);
1548 g_return_if_fail (order <= G_LEVEL_ORDER);
1553 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1556 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1561 g_warning ("unsupported traversal order.");
1567 _count_nodes (GtkRBTree *tree,
1571 if (node == tree->nil)
1574 g_assert (node->left);
1575 g_assert (node->right);
1577 res = (_count_nodes (tree, node->left) +
1578 _count_nodes (tree, node->right) + 1);
1580 if (res != node->count)
1581 g_print ("Tree failed\n");
1586 void _fixup_validation (GtkRBTree *tree,
1589 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1590 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1591 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1592 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1593 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1595 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1599 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1604 void _fixup_parity (GtkRBTree *tree,
1608 ((node->children != NULL && node->children->root != node->children->nil) ? node->children->root->parity : 0) +
1609 ((node->left != tree->nil) ? node->left->parity : 0) +
1610 ((node->right != tree->nil) ? node->right->parity : 0);
1613 #ifdef G_ENABLE_DEBUG
1615 get_parity (GtkRBNode *node)
1617 guint child_total = 0;
1620 /* The parity of a node is node->parity minus
1621 * the parity of left, right, and children.
1623 * This is equivalent to saying that if left, right, children
1624 * sum to 0 parity, then node->parity is the parity of node,
1625 * and if left, right, children are odd parity, then
1626 * node->parity is the reverse of the node's parity.
1629 child_total += (guint) node->left->parity;
1630 child_total += (guint) node->right->parity;
1633 child_total += (guint) node->children->root->parity;
1635 rem = child_total % 2;
1638 return node->parity;
1640 return !node->parity;
1644 count_parity (GtkRBTree *tree,
1649 if (node == tree->nil)
1653 count_parity (tree, node->left) +
1654 count_parity (tree, node->right) +
1656 (node->children ? count_parity (node->children, node->children->root) : 0);
1658 res = res % (guint)2;
1660 if (res != node->parity)
1661 g_print ("parity incorrect for node\n");
1663 if (get_parity (node) != 1)
1664 g_error ("Node has incorrect parity %d", get_parity (node));
1670 _gtk_rbtree_test_height (GtkRBTree *tree,
1673 gint computed_offset = 0;
1675 /* This whole test is sort of a useless truism. */
1677 if (node->left != tree->nil)
1678 computed_offset += node->left->offset;
1680 if (node->right != tree->nil)
1681 computed_offset += node->right->offset;
1683 if (node->children && node->children->root != node->children->nil)
1684 computed_offset += node->children->root->offset;
1686 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1687 g_error ("node has broken offset\n");
1689 if (node->left != tree->nil)
1690 _gtk_rbtree_test_height (tree, node->left);
1692 if (node->right != tree->nil)
1693 _gtk_rbtree_test_height (tree, node->right);
1695 if (node->children && node->children->root != node->children->nil)
1696 _gtk_rbtree_test_height (node->children, node->children->root);
1700 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1702 gint expected_dirtyness)
1705 if (expected_dirtyness)
1707 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1708 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1709 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1710 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1711 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1715 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1716 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1717 if (node->left != tree->nil)
1718 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1719 if (node->right != tree->nil)
1720 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1721 if (node->children != NULL)
1722 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1725 if (node->left != tree->nil)
1726 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1727 if (node->right != tree->nil)
1728 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1729 if (node->children != NULL && node->children->root != node->children->nil)
1730 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1733 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1736 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1739 g_assert (node != tree->nil);
1741 g_assert (node->left != NULL);
1742 g_assert (node->right != NULL);
1743 g_assert (node->parent != NULL);
1745 if (node->left != tree->nil)
1747 g_assert (node->left->parent == node);
1748 _gtk_rbtree_test_structure_helper (tree, node->left);
1750 if (node->right != tree->nil)
1752 g_assert (node->right->parent == node);
1753 _gtk_rbtree_test_structure_helper (tree, node->right);
1756 if (node->children != NULL)
1758 g_assert (node->children->parent_tree == tree);
1759 g_assert (node->children->parent_node == node);
1761 _gtk_rbtree_test_structure (node->children);
1765 _gtk_rbtree_test_structure (GtkRBTree *tree)
1767 g_assert (tree->root);
1768 if (tree->root == tree->nil)
1771 g_assert (tree->root->parent == tree->nil);
1772 _gtk_rbtree_test_structure_helper (tree, tree->root);
1776 _gtk_rbtree_test (const gchar *where,
1779 GtkRBTree *tmp_tree;
1784 /* Test the entire tree */
1786 while (tmp_tree->parent_tree)
1787 tmp_tree = tmp_tree->parent_tree;
1789 g_assert (tmp_tree->nil != NULL);
1791 if (tmp_tree->root == tmp_tree->nil)
1794 _gtk_rbtree_test_structure (tmp_tree);
1796 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1797 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1800 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1801 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1802 g_assert (count_parity (tmp_tree, tmp_tree->root) == tmp_tree->root->parity);
1806 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1811 for (i = 0; i < depth; i++)
1814 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1816 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1819 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1820 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1821 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1822 if (node->children != NULL)
1824 g_print ("Looking at child.\n");
1825 _gtk_rbtree_debug_spew (node->children);
1826 g_print ("Done looking at child.\n");
1828 if (node->left != tree->nil)
1830 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1832 if (node->right != tree->nil)
1834 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1839 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1841 g_return_if_fail (tree != NULL);
1843 if (tree->root == tree->nil)
1844 g_print ("Empty tree...\n");
1846 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);
1848 #endif /* G_ENABLE_DEBUG */