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.
20 #include "gtkrbtree.h"
23 static void _gtk_rbnode_validate_allocator (GAllocator *allocator);
24 static GtkRBNode * _gtk_rbnode_new (GtkRBTree *tree,
26 static void _gtk_rbnode_free (GtkRBNode *node);
27 static void _gtk_rbnode_rotate_left (GtkRBTree *tree,
29 static void _gtk_rbnode_rotate_right (GtkRBTree *tree,
31 static void _gtk_rbtree_insert_fixup (GtkRBTree *tree,
33 static void _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
35 static gint _count_nodes (GtkRBTree *tree,
37 static inline void _fixup_validation (GtkRBTree *tree,
39 static inline void _fixup_parity (GtkRBTree *tree,
46 struct _GAllocator /* from gmem.c */
54 GtkRBNode *free_nodes; /* implementation specific */
58 G_LOCK_DEFINE_STATIC (current_allocator);
59 static GAllocator *current_allocator = NULL;
62 /* HOLDS: current_allocator_lock */
64 _gtk_rbnode_validate_allocator (GAllocator *allocator)
66 g_return_if_fail (allocator != NULL);
67 g_return_if_fail (allocator->is_unused == TRUE);
69 if (allocator->type != G_ALLOCATOR_NODE)
71 allocator->type = G_ALLOCATOR_NODE;
72 if (allocator->mem_chunk)
74 g_mem_chunk_destroy (allocator->mem_chunk);
75 allocator->mem_chunk = NULL;
79 if (!allocator->mem_chunk)
81 allocator->mem_chunk = g_mem_chunk_new (allocator->name,
83 sizeof (GtkRBNode) * allocator->n_preallocs,
85 allocator->free_nodes = NULL;
88 allocator->is_unused = FALSE;
92 _gtk_rbnode_new (GtkRBTree *tree,
97 G_LOCK (current_allocator);
98 if (!current_allocator)
100 GAllocator *allocator = g_allocator_new ("GTK+ default GtkRBNode allocator",
102 _gtk_rbnode_validate_allocator (allocator);
103 allocator->last = NULL;
104 current_allocator = allocator;
106 if (!current_allocator->free_nodes)
107 node = g_chunk_new (GtkRBNode, current_allocator->mem_chunk);
110 node = current_allocator->free_nodes;
111 current_allocator->free_nodes = node->left;
113 G_UNLOCK (current_allocator);
115 node->left = tree->nil;
116 node->right = tree->nil;
117 node->parent = tree->nil;
118 node->flags = GTK_RBNODE_RED;
121 node->children = NULL;
122 node->offset = height;
127 _gtk_rbnode_free (GtkRBNode *node)
129 G_LOCK (current_allocator);
130 node->left = current_allocator->free_nodes;
131 current_allocator->free_nodes = node;
132 if (gtk_debug_flags & GTK_DEBUG_TREE)
134 /* unfortunately node->left has to continue to point to
137 node->right = (gpointer) 0xdeadbeef;
138 node->parent = (gpointer) 0xdeadbeef;
139 node->offset = 56789;
143 G_UNLOCK (current_allocator);
147 _gtk_rbnode_rotate_left (GtkRBTree *tree,
150 gint node_height, right_height;
151 GtkRBNode *right = node->right;
153 g_return_if_fail (node != tree->nil);
155 node_height = node->offset -
156 (node->left?node->left->offset:0) -
157 (node->right?node->right->offset:0) -
158 (node->children?node->children->root->offset:0);
159 right_height = right->offset -
160 (right->left?right->left->offset:0) -
161 (right->right?right->right->offset:0) -
162 (right->children?right->children->root->offset:0);
163 node->right = right->left;
164 if (right->left != tree->nil)
165 right->left->parent = node;
167 if (right != tree->nil)
168 right->parent = node->parent;
169 if (node->parent != tree->nil)
171 if (node == node->parent->left)
172 node->parent->left = right;
174 node->parent->right = right;
180 if (node != tree->nil)
181 node->parent = right;
183 node->count = 1 + (node->left?node->left->count:0) +
184 (node->right?node->right->count:0);
185 right->count = 1 + (right->left?right->left->count:0) +
186 (right->right?right->right->count:0);
188 node->offset = node_height +
189 (node->left?node->left->offset:0) +
190 (node->right?node->right->offset:0) +
191 (node->children?node->children->root->offset:0);
192 right->offset = right_height +
193 (right->left?right->left->offset:0) +
194 (right->right?right->right->offset:0) +
195 (right->children?right->children->root->offset:0);
197 _fixup_validation (tree, node);
198 _fixup_validation (tree, right);
199 _fixup_parity (tree, node);
200 _fixup_parity (tree, right);
204 _gtk_rbnode_rotate_right (GtkRBTree *tree,
207 gint node_height, left_height;
208 GtkRBNode *left = node->left;
210 g_return_if_fail (node != tree->nil);
212 node_height = node->offset -
213 (node->left?node->left->offset:0) -
214 (node->right?node->right->offset:0) -
215 (node->children?node->children->root->offset:0);
216 left_height = left->offset -
217 (left->left?left->left->offset:0) -
218 (left->right?left->right->offset:0) -
219 (left->children?left->children->root->offset:0);
221 node->left = left->right;
222 if (left->right != tree->nil)
223 left->right->parent = node;
225 if (left != tree->nil)
226 left->parent = node->parent;
227 if (node->parent != tree->nil)
229 if (node == node->parent->right)
230 node->parent->right = left;
232 node->parent->left = left;
239 /* link node and left */
241 if (node != tree->nil)
244 node->count = 1 + (node->left?node->left->count:0) +
245 (node->right?node->right->count:0);
246 left->count = 1 + (left->left?left->left->count:0) +
247 (left->right?left->right->count:0);
249 node->offset = node_height +
250 (node->left?node->left->offset:0) +
251 (node->right?node->right->offset:0) +
252 (node->children?node->children->root->offset:0);
253 left->offset = left_height +
254 (left->left?left->left->offset:0) +
255 (left->right?left->right->offset:0) +
256 (left->children?left->children->root->offset:0);
258 _fixup_validation (tree, node);
259 _fixup_validation (tree, left);
260 _fixup_parity (tree, node);
261 _fixup_parity (tree, left);
265 _gtk_rbtree_insert_fixup (GtkRBTree *tree,
269 /* check Red-Black properties */
270 while (node != tree->root && GTK_RBNODE_GET_COLOR (node->parent) == GTK_RBNODE_RED)
272 /* we have a violation */
273 if (node->parent == node->parent->parent->left)
275 GtkRBNode *y = node->parent->parent->right;
276 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
278 /* uncle is GTK_RBNODE_RED */
279 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
280 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
281 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
282 node = node->parent->parent;
286 /* uncle is GTK_RBNODE_BLACK */
287 if (node == node->parent->right)
289 /* make node a left child */
291 _gtk_rbnode_rotate_left (tree, node);
294 /* recolor and rotate */
295 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
296 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
297 _gtk_rbnode_rotate_right(tree, node->parent->parent);
302 /* mirror image of above code */
303 GtkRBNode *y = node->parent->parent->left;
304 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
306 /* uncle is GTK_RBNODE_RED */
307 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
308 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
309 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
310 node = node->parent->parent;
314 /* uncle is GTK_RBNODE_BLACK */
315 if (node == node->parent->left)
318 _gtk_rbnode_rotate_right (tree, node);
320 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
321 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
322 _gtk_rbnode_rotate_left (tree, node->parent->parent);
326 GTK_RBNODE_SET_COLOR (tree->root, GTK_RBNODE_BLACK);
330 _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
333 while (node != tree->root && GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
335 if (node == node->parent->left)
337 GtkRBNode *w = node->parent->right;
338 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
340 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
341 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
342 _gtk_rbnode_rotate_left (tree, node->parent);
343 w = node->parent->right;
345 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
347 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
352 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
354 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
355 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
356 _gtk_rbnode_rotate_right (tree, w);
357 w = node->parent->right;
359 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
360 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
361 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
362 _gtk_rbnode_rotate_left (tree, node->parent);
368 GtkRBNode *w = node->parent->left;
369 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
371 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
372 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
373 _gtk_rbnode_rotate_right (tree, node->parent);
374 w = node->parent->left;
376 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
378 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
383 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
385 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
386 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
387 _gtk_rbnode_rotate_left (tree, w);
388 w = node->parent->left;
390 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
391 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
392 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
393 _gtk_rbnode_rotate_right (tree, node->parent);
398 GTK_RBNODE_SET_COLOR (node, GTK_RBNODE_BLACK);
401 /* Public functions */
403 _gtk_rbnode_push_allocator (GAllocator *allocator)
405 G_LOCK (current_allocator);
406 _gtk_rbnode_validate_allocator ( allocator );
407 allocator->last = current_allocator;
408 current_allocator = allocator;
409 G_UNLOCK (current_allocator);
413 _gtk_rbnode_pop_allocator (void)
415 G_LOCK (current_allocator);
416 if (current_allocator)
418 GAllocator *allocator;
420 allocator = current_allocator;
421 current_allocator = allocator->last;
422 allocator->last = NULL;
423 allocator->is_unused = TRUE;
425 G_UNLOCK (current_allocator);
429 _gtk_rbtree_new (void)
433 retval = (GtkRBTree *) g_new (GtkRBTree, 1);
434 retval->parent_tree = NULL;
435 retval->parent_node = NULL;
437 retval->nil = g_new0 (GtkRBNode, 1);
438 retval->nil->left = NULL;
439 retval->nil->right = NULL;
440 retval->nil->parent = NULL;
441 retval->nil->flags = GTK_RBNODE_BLACK;
442 retval->nil->count = 0;
443 retval->nil->offset = 0;
444 retval->nil->parity = 0;
446 retval->root = retval->nil;
451 _gtk_rbtree_free_helper (GtkRBTree *tree,
456 _gtk_rbtree_free (node->children);
458 _gtk_rbnode_free (node);
462 _gtk_rbtree_free (GtkRBTree *tree)
464 _gtk_rbtree_traverse (tree,
467 _gtk_rbtree_free_helper,
470 if (tree->parent_node &&
471 tree->parent_node->children == tree)
472 tree->parent_node->children = NULL;
473 _gtk_rbnode_free (tree->nil);
478 _gtk_rbtree_remove (GtkRBTree *tree)
483 gint height = tree->root->offset;
485 if (gtk_debug_flags & GTK_DEBUG_TREE)
486 _gtk_rbtree_test (G_STRLOC, tree);
488 tmp_tree = tree->parent_tree;
489 tmp_node = tree->parent_node;
491 /* ugly hack to make _fixup_validation work in the first iteration of the
493 GTK_RBNODE_UNSET_FLAG (tree->root, GTK_RBNODE_DESCENDANTS_INVALID);
495 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
497 _fixup_validation (tmp_tree, tmp_node);
498 tmp_node->offset -= height;
500 /* If the removed tree was odd, flip all parents */
501 if (tree->root->parity)
502 tmp_node->parity = !tmp_node->parity;
504 tmp_node = tmp_node->parent;
505 if (tmp_node == tmp_tree->nil)
507 tmp_node = tmp_tree->parent_node;
508 tmp_tree = tmp_tree->parent_tree;
512 tmp_tree = tree->parent_tree;
513 tmp_node = tree->parent_node;
514 _gtk_rbtree_free (tree);
516 if (gtk_debug_flags & GTK_DEBUG_TREE)
517 _gtk_rbtree_test (G_STRLOC, tmp_tree);
522 _gtk_rbtree_insert_after (GtkRBTree *tree,
528 gboolean right = TRUE;
532 if (gtk_debug_flags & GTK_DEBUG_TREE)
534 g_print ("\n\n_gtk_rbtree_insert_after: 0x%x\n", (gint) current);
535 _gtk_rbtree_debug_spew (tree);
536 _gtk_rbtree_test (G_STRLOC, tree);
539 if (current != NULL && current->right != tree->nil)
541 current = current->right;
542 while (current->left != tree->nil)
543 current = current->left;
547 node = _gtk_rbnode_new (tree, height);
548 node->parent = (current?current:tree->nil);
550 /* insert node in tree */
554 current->right = node;
556 current->left = node;
557 tmp_node = node->parent;
563 tmp_node = tree->parent_node;
564 tmp_tree = tree->parent_tree;
567 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
569 /* We only want to propagate the count if we are in the tree we
571 if (tmp_tree == tree)
574 tmp_node->parity += 1;
575 tmp_node->offset += height;
576 tmp_node = tmp_node->parent;
577 if (tmp_node == tmp_tree->nil)
579 tmp_node = tmp_tree->parent_node;
580 tmp_tree = tmp_tree->parent_tree;
585 _gtk_rbtree_node_mark_valid (tree, node);
587 _gtk_rbtree_node_mark_invalid (tree, node);
589 _gtk_rbtree_insert_fixup (tree, node);
591 if (gtk_debug_flags & GTK_DEBUG_TREE)
593 g_print ("_gtk_rbtree_insert_after finished...\n");
594 _gtk_rbtree_debug_spew (tree);
596 _gtk_rbtree_test (G_STRLOC, tree);
603 _gtk_rbtree_insert_before (GtkRBTree *tree,
609 gboolean left = TRUE;
613 if (gtk_debug_flags & GTK_DEBUG_TREE)
615 g_print ("\n\n_gtk_rbtree_insert_before: 0x%x\n", (gint) current);
616 _gtk_rbtree_debug_spew (tree);
617 _gtk_rbtree_test (G_STRLOC, tree);
620 if (current != NULL && current->left != tree->nil)
622 current = current->left;
623 while (current->right != tree->nil)
624 current = current->right;
629 node = _gtk_rbnode_new (tree, height);
630 node->parent = (current?current:tree->nil);
632 /* insert node in tree */
636 current->left = node;
638 current->right = node;
639 tmp_node = node->parent;
645 tmp_node = tree->parent_node;
646 tmp_tree = tree->parent_tree;
649 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
651 /* We only want to propagate the count if we are in the tree we
653 if (tmp_tree == tree)
656 tmp_node->parity += 1;
657 tmp_node->offset += height;
658 tmp_node = tmp_node->parent;
659 if (tmp_node == tmp_tree->nil)
661 tmp_node = tmp_tree->parent_node;
662 tmp_tree = tmp_tree->parent_tree;
667 _gtk_rbtree_node_mark_valid (tree, node);
669 _gtk_rbtree_node_mark_invalid (tree, node);
671 _gtk_rbtree_insert_fixup (tree, node);
673 if (gtk_debug_flags & GTK_DEBUG_TREE)
675 g_print ("_gtk_rbtree_insert_before finished...\n");
676 _gtk_rbtree_debug_spew (tree);
678 _gtk_rbtree_test (G_STRLOC, tree);
685 _gtk_rbtree_find_count (GtkRBTree *tree,
691 while (node != tree->nil && (node->left->count + 1 != count))
693 if (node->left->count >= count)
697 count -= (node->left->count + 1);
701 if (node == tree->nil)
707 _gtk_rbtree_node_set_height (GtkRBTree *tree,
711 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
712 GtkRBNode *tmp_node = node;
713 GtkRBTree *tmp_tree = tree;
718 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
720 tmp_node->offset += diff;
721 tmp_node = tmp_node->parent;
722 if (tmp_node == tmp_tree->nil)
724 tmp_node = tmp_tree->parent_node;
725 tmp_tree = tmp_tree->parent_tree;
728 if (gtk_debug_flags & GTK_DEBUG_TREE)
729 _gtk_rbtree_test (G_STRLOC, tree);
733 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
736 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
739 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
742 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
744 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
746 if (node == tree->nil)
748 node = tree->parent_node;
749 tree = tree->parent_tree;
756 /* Draconian version. */
758 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
761 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
764 _fixup_validation (tree, node);
766 if (node == tree->nil)
768 node = tree->parent_node;
769 tree = tree->parent_tree;
777 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
780 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
781 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
784 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
785 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
789 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
790 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
791 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
792 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
793 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
796 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
798 if (node == tree->nil)
800 node = tree->parent_node;
801 tree = tree->parent_tree;
808 /* Draconian version */
810 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
813 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
814 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
818 _fixup_validation (tree, node);
820 if (node == tree->nil)
822 node = tree->parent_node;
823 tree = tree->parent_tree;
829 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
832 _gtk_rbtree_column_invalid (GtkRBTree *tree)
841 while (node->left != tree->nil)
846 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
847 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
848 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
851 _gtk_rbtree_column_invalid (node->children);
853 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
857 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
866 while (node->left != tree->nil)
871 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
872 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
875 _gtk_rbtree_mark_invalid (node->children);
877 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
880 typedef struct _GtkRBReorder
891 gtk_rbtree_reorder_sort_func (gconstpointer a,
894 return ((GtkRBReorder *) a)->order > ((GtkRBReorder *) b)->order;
898 gtk_rbtree_reorder_invert_func (gconstpointer a,
901 return ((GtkRBReorder *) a)->invert_order > ((GtkRBReorder *) b)->invert_order;
905 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
908 if (node == tree->nil)
913 if (node->left != tree->nil)
915 gtk_rbtree_reorder_fixup (tree, node->left);
916 node->offset += node->left->offset;
917 node->parity += node->left->parity;
919 if (node->right != tree->nil)
921 gtk_rbtree_reorder_fixup (tree, node->right);
922 node->offset += node->right->offset;
923 node->parity += node->right->parity;
928 node->offset += node->children->root->offset;
929 node->parity += node->children->root->parity;
932 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
933 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
934 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
935 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
936 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
938 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
941 /* It basically pulls everything out of the tree, rearranges it, and puts it
942 * back together. Our strategy is to keep the old RBTree intact, and just
943 * rearrange the contents. When that is done, we go through and update the
944 * heights. There is probably a more elegant way to write this function. If
945 * anyone wants to spend the time writing it, patches will be accepted.
948 _gtk_rbtree_reorder (GtkRBTree *tree,
952 GtkRBReorder reorder;
957 g_return_if_fail (tree != NULL);
958 g_return_if_fail (length > 0);
959 g_return_if_fail (tree->root->count == length);
961 /* Sort the trees values in the new tree. */
962 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
963 for (i = 0; i < length; i++)
965 reorder.order = new_order[i];
966 reorder.invert_order = i;
967 g_array_append_val (array, reorder);
970 g_array_sort(array, gtk_rbtree_reorder_sort_func);
974 while (node && node->left != tree->nil)
977 for (i = 0; i < length; i++)
979 g_assert (node != tree->nil);
980 g_array_index (array, GtkRBReorder, i).children = node->children;
981 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
982 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
984 node = _gtk_rbtree_next (tree, node);
987 g_array_sort (array, gtk_rbtree_reorder_invert_func);
991 while (node && node->left != tree->nil)
994 /* Go through the tree and change the values to the new ones. */
995 for (i = 0; i < length; i++)
997 reorder = g_array_index (array, GtkRBReorder, i);
998 node->children = reorder.children;
1000 node->children->parent_node = node;
1001 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
1002 /* We temporarily set the height to this. */
1003 node->offset = reorder.height;
1004 node = _gtk_rbtree_next (tree, node);
1006 gtk_rbtree_reorder_fixup (tree, tree->root);
1011 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
1018 g_assert (node->left);
1020 retval = node->left->offset;
1022 while (tree && node && node != tree->nil)
1025 node = node->parent;
1027 /* Add left branch, plus children, iff we came from the right */
1028 if (node->right == last)
1029 retval += node->offset - node->right->offset;
1031 if (node == tree->nil)
1033 node = tree->parent_node;
1034 tree = tree->parent_tree;
1036 /* Add the parent node, plus the left branch. */
1038 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
1045 _gtk_rbtree_node_find_parity (GtkRBTree *tree,
1052 g_assert (node->left);
1054 retval = node->left->parity;
1056 while (tree && node && node != tree->nil)
1059 node = node->parent;
1061 /* Add left branch, plus children, iff we came from the right */
1062 if (node->right == last)
1063 retval += node->parity - node->right->parity;
1065 if (node == tree->nil)
1067 node = tree->parent_node;
1068 tree = tree->parent_tree;
1070 /* Add the parent node, plus the left branch. */
1072 retval += node->left->parity + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1080 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1082 GtkRBTree **new_tree,
1083 GtkRBNode **new_node)
1085 GtkRBNode *tmp_node;
1098 tmp_node = tree->root;
1099 while (tmp_node != tree->nil &&
1100 (tmp_node->left->offset > height ||
1101 (tmp_node->offset - tmp_node->right->offset) < height))
1103 if (tmp_node->left->offset > height)
1104 tmp_node = tmp_node->left;
1107 height -= (tmp_node->offset - tmp_node->right->offset);
1108 tmp_node = tmp_node->right;
1111 if (tmp_node == tree->nil)
1117 if (tmp_node->children)
1119 if ((tmp_node->offset -
1120 tmp_node->right->offset -
1121 tmp_node->children->root->offset) > height)
1124 *new_node = tmp_node;
1125 return (height - tmp_node->left->offset);
1127 return _gtk_rbtree_real_find_offset (tmp_node->children,
1128 height - tmp_node->left->offset -
1130 tmp_node->left->offset -
1131 tmp_node->right->offset -
1132 tmp_node->children->root->offset),
1137 *new_node = tmp_node;
1138 return (height - tmp_node->left->offset);
1142 _gtk_rbtree_find_offset (GtkRBTree *tree,
1144 GtkRBTree **new_tree,
1145 GtkRBNode **new_node)
1150 (height >= tree->root->offset))
1157 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1161 _gtk_rbtree_remove_node (GtkRBTree *tree,
1165 GtkRBTree *tmp_tree;
1166 GtkRBNode *tmp_node;
1170 g_return_if_fail (tree != NULL);
1171 g_return_if_fail (node != NULL);
1173 if (gtk_debug_flags & GTK_DEBUG_TREE)
1175 g_print ("\n\n_gtk_rbtree_remove_node: 0x%x\n", (gint) node);
1176 _gtk_rbtree_debug_spew (tree);
1177 _gtk_rbtree_test (G_STRLOC, tree);
1179 /* make sure we're deleting a node that's actually in the tree */
1180 for (x = node; x->parent != tree->nil; x = x->parent)
1182 g_return_if_fail (x == tree->root);
1184 if (gtk_debug_flags & GTK_DEBUG_TREE)
1185 _gtk_rbtree_test (G_STRLOC, tree);
1187 if (node->left == tree->nil || node->right == tree->nil)
1195 while (y->left != tree->nil)
1199 /* adjust count only beneath tree */
1200 for (x = y; x != tree->nil; x = x->parent)
1205 /* offsets and parity adjust all the way up through parent trees */
1206 y_height = GTK_RBNODE_GET_HEIGHT (y);
1207 node_height = GTK_RBNODE_GET_HEIGHT (node) + (node->children?node->children->root->offset:0);
1211 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1213 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1214 _fixup_validation (tmp_tree, tmp_node);
1215 _fixup_parity (tmp_tree, tmp_node);
1216 tmp_node = tmp_node->parent;
1217 if (tmp_node == tmp_tree->nil)
1219 tmp_node = tmp_tree->parent_node;
1220 tmp_tree = tmp_tree->parent_tree;
1224 /* x is y's only child, or nil */
1225 if (y->left != tree->nil)
1230 /* remove y from the parent chain */
1231 x->parent = y->parent;
1232 if (y->parent != tree->nil)
1234 if (y == y->parent->left)
1235 y->parent->left = x;
1237 y->parent->right = x;
1244 /* We need to clean up the validity of the tree.
1251 /* We skip the first time, iff x is nil */
1252 if (tmp_node != tmp_tree->nil)
1254 _fixup_validation (tmp_tree, tmp_node);
1255 _fixup_parity (tmp_tree, tmp_node);
1257 tmp_node = tmp_node->parent;
1258 if (tmp_node == tmp_tree->nil)
1260 tmp_node = tmp_tree->parent_node;
1261 tmp_tree = tmp_tree->parent_tree;
1264 while (tmp_tree != NULL);
1270 /* Copy the node over */
1271 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1272 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_BLACK);
1274 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_RED);
1275 node->children = y->children;
1278 node->children = y->children;
1279 node->children->parent_node = node;
1283 node->children = NULL;
1285 _fixup_validation (tree, node);
1286 _fixup_parity (tree, node);
1287 /* We want to see how different our height is from the previous node.
1288 * To do this, we compare our current height with our supposed height.
1290 diff = y_height - GTK_RBNODE_GET_HEIGHT (node);
1294 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1296 tmp_node->offset += diff;
1297 _fixup_validation (tmp_tree, tmp_node);
1298 _fixup_parity (tmp_tree, tmp_node);
1299 tmp_node = tmp_node->parent;
1300 if (tmp_node == tmp_tree->nil)
1302 tmp_node = tmp_tree->parent_node;
1303 tmp_tree = tmp_tree->parent_tree;
1308 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_BLACK)
1309 _gtk_rbtree_remove_node_fixup (tree, x);
1310 _gtk_rbnode_free (y);
1312 if (gtk_debug_flags & GTK_DEBUG_TREE)
1314 g_print ("_gtk_rbtree_remove_node finished...\n");
1315 _gtk_rbtree_debug_spew (tree);
1317 _gtk_rbtree_test (G_STRLOC, tree);
1322 _gtk_rbtree_next (GtkRBTree *tree,
1325 g_return_val_if_fail (tree != NULL, NULL);
1326 g_return_val_if_fail (node != NULL, NULL);
1328 /* Case 1: the node's below us. */
1329 if (node->right != tree->nil)
1332 while (node->left != tree->nil)
1337 /* Case 2: it's an ancestor */
1338 while (node->parent != tree->nil)
1340 if (node->parent->right == node)
1341 node = node->parent;
1343 return (node->parent);
1346 /* Case 3: There is no next node */
1351 _gtk_rbtree_prev (GtkRBTree *tree,
1354 g_return_val_if_fail (tree != NULL, NULL);
1355 g_return_val_if_fail (node != NULL, NULL);
1357 /* Case 1: the node's below us. */
1358 if (node->left != tree->nil)
1361 while (node->right != tree->nil)
1366 /* Case 2: it's an ancestor */
1367 while (node->parent != tree->nil)
1369 if (node->parent->left == node)
1370 node = node->parent;
1372 return (node->parent);
1375 /* Case 3: There is no next node */
1380 _gtk_rbtree_next_full (GtkRBTree *tree,
1382 GtkRBTree **new_tree,
1383 GtkRBNode **new_node)
1385 g_return_if_fail (tree != NULL);
1386 g_return_if_fail (node != NULL);
1387 g_return_if_fail (new_tree != NULL);
1388 g_return_if_fail (new_node != NULL);
1392 *new_tree = node->children;
1393 *new_node = (*new_tree)->root;
1394 while ((*new_node)->left != (*new_tree)->nil)
1395 *new_node = (*new_node)->left;
1400 *new_node = _gtk_rbtree_next (tree, node);
1402 while ((*new_node == NULL) &&
1403 (*new_tree != NULL))
1405 *new_node = (*new_tree)->parent_node;
1406 *new_tree = (*new_tree)->parent_tree;
1408 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1413 _gtk_rbtree_prev_full (GtkRBTree *tree,
1415 GtkRBTree **new_tree,
1416 GtkRBNode **new_node)
1418 g_return_if_fail (tree != NULL);
1419 g_return_if_fail (node != NULL);
1420 g_return_if_fail (new_tree != NULL);
1421 g_return_if_fail (new_node != NULL);
1424 *new_node = _gtk_rbtree_prev (tree, node);
1426 if (*new_node == NULL)
1428 *new_node = (*new_tree)->parent_node;
1429 *new_tree = (*new_tree)->parent_tree;
1433 while ((*new_node)->children)
1435 *new_tree = (*new_node)->children;
1436 *new_node = (*new_tree)->root;
1437 while ((*new_node)->right != (*new_tree)->nil)
1438 *new_node = (*new_node)->right;
1444 _gtk_rbtree_get_depth (GtkRBTree *tree)
1446 GtkRBTree *tmp_tree;
1449 tmp_tree = tree->parent_tree;
1453 tmp_tree = tmp_tree->parent_tree;
1460 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1462 GtkRBTreeTraverseFunc func,
1465 if (node == tree->nil)
1468 (* func) (tree, node, data);
1469 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1470 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1474 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1476 GtkRBTreeTraverseFunc func,
1479 if (node == tree->nil)
1482 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1483 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1484 (* func) (tree, node, data);
1488 _gtk_rbtree_traverse (GtkRBTree *tree,
1490 GTraverseType order,
1491 GtkRBTreeTraverseFunc func,
1494 g_return_if_fail (tree != NULL);
1495 g_return_if_fail (node != NULL);
1496 g_return_if_fail (func != NULL);
1497 g_return_if_fail (order <= G_LEVEL_ORDER);
1502 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1505 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1510 g_warning ("unsupported traversal order.");
1516 _count_nodes (GtkRBTree *tree,
1520 if (node == tree->nil)
1523 g_assert (node->left);
1524 g_assert (node->right);
1526 res = (_count_nodes (tree, node->left) +
1527 _count_nodes (tree, node->right) + 1);
1529 if (res != node->count)
1530 g_print ("Tree failed\n");
1535 void _fixup_validation (GtkRBTree *tree,
1538 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1539 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1540 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1541 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1542 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1544 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1548 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1553 void _fixup_parity (GtkRBTree *tree,
1557 ((node->children != NULL && node->children->root != node->children->nil) ? node->children->root->parity : 0) +
1558 ((node->left != tree->nil) ? node->left->parity : 0) +
1559 ((node->right != tree->nil) ? node->right->parity : 0);
1563 get_parity (GtkRBNode *node)
1565 guint child_total = 0;
1568 /* The parity of a node is node->parity minus
1569 * the parity of left, right, and children.
1571 * This is equivalent to saying that if left, right, children
1572 * sum to 0 parity, then node->parity is the parity of node,
1573 * and if left, right, children are odd parity, then
1574 * node->parity is the reverse of the node's parity.
1577 child_total += (guint) node->left->parity;
1578 child_total += (guint) node->right->parity;
1581 child_total += (guint) node->children->root->parity;
1583 rem = child_total % 2;
1586 return node->parity;
1588 return !node->parity;
1592 count_parity (GtkRBTree *tree,
1597 if (node == tree->nil)
1601 count_parity (tree, node->left) +
1602 count_parity (tree, node->right) +
1604 (node->children ? count_parity (node->children, node->children->root) : 0);
1606 res = res % (guint)2;
1608 if (res != node->parity)
1609 g_print ("parity incorrect for node\n");
1611 if (get_parity (node) != 1)
1612 g_error ("Node has incorrect parity %d", get_parity (node));
1618 _gtk_rbtree_test_height (GtkRBTree *tree,
1621 gint computed_offset = 0;
1623 /* This whole test is sort of a useless truism. */
1625 if (node->left != tree->nil)
1626 computed_offset += node->left->offset;
1628 if (node->right != tree->nil)
1629 computed_offset += node->right->offset;
1631 if (node->children && node->children->root != node->children->nil)
1632 computed_offset += node->children->root->offset;
1634 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1635 g_error ("node has broken offset\n");
1637 if (node->left != tree->nil)
1638 _gtk_rbtree_test_height (tree, node->left);
1640 if (node->right != tree->nil)
1641 _gtk_rbtree_test_height (tree, node->right);
1643 if (node->children && node->children->root != node->children->nil)
1644 _gtk_rbtree_test_height (node->children, node->children->root);
1648 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1650 gint expected_dirtyness)
1653 if (expected_dirtyness)
1655 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1656 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1657 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1658 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1659 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1663 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1664 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1665 if (node->left != tree->nil)
1666 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1667 if (node->right != tree->nil)
1668 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1669 if (node->children != NULL)
1670 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1673 if (node->left != tree->nil)
1674 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1675 if (node->right != tree->nil)
1676 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1677 if (node->children != NULL && node->children->root != node->children->nil)
1678 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1681 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1684 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1687 g_assert (node != tree->nil);
1689 g_assert (node->left != NULL);
1690 g_assert (node->right != NULL);
1691 g_assert (node->parent != NULL);
1693 if (node->left != tree->nil)
1695 g_assert (node->left->parent == node);
1696 _gtk_rbtree_test_structure_helper (tree, node->left);
1698 if (node->right != tree->nil)
1700 g_assert (node->right->parent == node);
1701 _gtk_rbtree_test_structure_helper (tree, node->right);
1704 if (node->children != NULL)
1706 g_assert (node->children->parent_tree == tree);
1707 g_assert (node->children->parent_node == node);
1709 _gtk_rbtree_test_structure (node->children);
1713 _gtk_rbtree_test_structure (GtkRBTree *tree)
1715 g_assert (tree->root);
1716 if (tree->root == tree->nil)
1719 g_assert (tree->root->parent == tree->nil);
1720 _gtk_rbtree_test_structure_helper (tree, tree->root);
1724 _gtk_rbtree_test (const gchar *where,
1727 GtkRBTree *tmp_tree;
1732 /* Test the entire tree */
1734 while (tmp_tree->parent_tree)
1735 tmp_tree = tmp_tree->parent_tree;
1737 g_assert (tmp_tree->nil != NULL);
1739 if (tmp_tree->root == tmp_tree->nil)
1742 _gtk_rbtree_test_structure (tmp_tree);
1744 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1745 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1748 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1749 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1750 g_assert (count_parity (tmp_tree, tmp_tree->root) == tmp_tree->root->parity);
1754 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1759 for (i = 0; i < depth; i++)
1762 g_print ("(0x%x - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1764 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1767 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1768 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1769 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1770 if (node->children != NULL)
1772 g_print ("Looking at child.\n");
1773 _gtk_rbtree_debug_spew (node->children);
1774 g_print ("Done looking at child.\n");
1776 if (node->left != tree->nil)
1778 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1780 if (node->right != tree->nil)
1782 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1787 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1789 g_return_if_fail (tree != NULL);
1791 if (tree->root == tree->nil)
1792 g_print ("Empty tree...\n");
1794 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);