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 #ifdef G_ENABLE_DEBUG
486 if (gtk_debug_flags & GTK_DEBUG_TREE)
487 _gtk_rbtree_test (G_STRLOC, tree);
490 tmp_tree = tree->parent_tree;
491 tmp_node = tree->parent_node;
493 /* ugly hack to make _fixup_validation work in the first iteration of the
495 GTK_RBNODE_UNSET_FLAG (tree->root, GTK_RBNODE_DESCENDANTS_INVALID);
497 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
499 _fixup_validation (tmp_tree, tmp_node);
500 tmp_node->offset -= height;
502 /* If the removed tree was odd, flip all parents */
503 if (tree->root->parity)
504 tmp_node->parity = !tmp_node->parity;
506 tmp_node = tmp_node->parent;
507 if (tmp_node == tmp_tree->nil)
509 tmp_node = tmp_tree->parent_node;
510 tmp_tree = tmp_tree->parent_tree;
514 tmp_tree = tree->parent_tree;
515 tmp_node = tree->parent_node;
516 _gtk_rbtree_free (tree);
518 #ifdef G_ENABLE_DEBUG
519 if (gtk_debug_flags & GTK_DEBUG_TREE)
520 _gtk_rbtree_test (G_STRLOC, tmp_tree);
526 _gtk_rbtree_insert_after (GtkRBTree *tree,
532 gboolean right = TRUE;
536 #ifdef G_ENABLE_DEBUG
537 if (gtk_debug_flags & GTK_DEBUG_TREE)
539 g_print ("\n\n_gtk_rbtree_insert_after: %p\n", current);
540 _gtk_rbtree_debug_spew (tree);
541 _gtk_rbtree_test (G_STRLOC, tree);
543 #endif /* G_ENABLE_DEBUG */
545 if (current != NULL && current->right != tree->nil)
547 current = current->right;
548 while (current->left != tree->nil)
549 current = current->left;
553 node = _gtk_rbnode_new (tree, height);
554 node->parent = (current?current:tree->nil);
556 /* insert node in tree */
560 current->right = node;
562 current->left = node;
563 tmp_node = node->parent;
569 tmp_node = tree->parent_node;
570 tmp_tree = tree->parent_tree;
573 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
575 /* We only want to propagate the count if we are in the tree we
577 if (tmp_tree == tree)
580 tmp_node->parity += 1;
581 tmp_node->offset += height;
582 tmp_node = tmp_node->parent;
583 if (tmp_node == tmp_tree->nil)
585 tmp_node = tmp_tree->parent_node;
586 tmp_tree = tmp_tree->parent_tree;
591 _gtk_rbtree_node_mark_valid (tree, node);
593 _gtk_rbtree_node_mark_invalid (tree, node);
595 _gtk_rbtree_insert_fixup (tree, node);
597 #ifdef G_ENABLE_DEBUG
598 if (gtk_debug_flags & GTK_DEBUG_TREE)
600 g_print ("_gtk_rbtree_insert_after finished...\n");
601 _gtk_rbtree_debug_spew (tree);
603 _gtk_rbtree_test (G_STRLOC, tree);
605 #endif /* G_ENABLE_DEBUG */
611 _gtk_rbtree_insert_before (GtkRBTree *tree,
617 gboolean left = TRUE;
621 #ifdef G_ENABLE_DEBUG
622 if (gtk_debug_flags & GTK_DEBUG_TREE)
624 g_print ("\n\n_gtk_rbtree_insert_before: %p\n", current);
625 _gtk_rbtree_debug_spew (tree);
626 _gtk_rbtree_test (G_STRLOC, tree);
628 #endif /* G_ENABLE_DEBUG */
630 if (current != NULL && current->left != tree->nil)
632 current = current->left;
633 while (current->right != tree->nil)
634 current = current->right;
639 node = _gtk_rbnode_new (tree, height);
640 node->parent = (current?current:tree->nil);
642 /* insert node in tree */
646 current->left = node;
648 current->right = node;
649 tmp_node = node->parent;
655 tmp_node = tree->parent_node;
656 tmp_tree = tree->parent_tree;
659 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
661 /* We only want to propagate the count if we are in the tree we
663 if (tmp_tree == tree)
666 tmp_node->parity += 1;
667 tmp_node->offset += height;
668 tmp_node = tmp_node->parent;
669 if (tmp_node == tmp_tree->nil)
671 tmp_node = tmp_tree->parent_node;
672 tmp_tree = tmp_tree->parent_tree;
677 _gtk_rbtree_node_mark_valid (tree, node);
679 _gtk_rbtree_node_mark_invalid (tree, node);
681 _gtk_rbtree_insert_fixup (tree, node);
683 #ifdef G_ENABLE_DEBUG
684 if (gtk_debug_flags & GTK_DEBUG_TREE)
686 g_print ("_gtk_rbtree_insert_before finished...\n");
687 _gtk_rbtree_debug_spew (tree);
689 _gtk_rbtree_test (G_STRLOC, tree);
691 #endif /* G_ENABLE_DEBUG */
697 _gtk_rbtree_find_count (GtkRBTree *tree,
703 while (node != tree->nil && (node->left->count + 1 != count))
705 if (node->left->count >= count)
709 count -= (node->left->count + 1);
713 if (node == tree->nil)
719 _gtk_rbtree_node_set_height (GtkRBTree *tree,
723 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
724 GtkRBNode *tmp_node = node;
725 GtkRBTree *tmp_tree = tree;
730 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
732 tmp_node->offset += diff;
733 tmp_node = tmp_node->parent;
734 if (tmp_node == tmp_tree->nil)
736 tmp_node = tmp_tree->parent_node;
737 tmp_tree = tmp_tree->parent_tree;
740 #ifdef G_ENABLE_DEBUG
741 if (gtk_debug_flags & GTK_DEBUG_TREE)
742 _gtk_rbtree_test (G_STRLOC, tree);
747 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
750 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
753 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
756 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
758 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
760 if (node == tree->nil)
762 node = tree->parent_node;
763 tree = tree->parent_tree;
770 /* Draconian version. */
772 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
775 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
778 _fixup_validation (tree, node);
780 if (node == tree->nil)
782 node = tree->parent_node;
783 tree = tree->parent_tree;
791 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
794 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
795 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
798 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
799 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
803 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
804 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
805 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
806 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
807 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
810 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
812 if (node == tree->nil)
814 node = tree->parent_node;
815 tree = tree->parent_tree;
822 /* Draconian version */
824 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
827 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
828 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
832 _fixup_validation (tree, node);
834 if (node == tree->nil)
836 node = tree->parent_node;
837 tree = tree->parent_tree;
843 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
846 _gtk_rbtree_column_invalid (GtkRBTree *tree)
855 while (node->left != tree->nil)
860 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
861 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
862 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
865 _gtk_rbtree_column_invalid (node->children);
867 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
871 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
880 while (node->left != tree->nil)
885 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
886 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
889 _gtk_rbtree_mark_invalid (node->children);
891 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
895 _gtk_rbtree_set_fixed_height (GtkRBTree *tree,
906 while (node->left != tree->nil)
911 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
912 _gtk_rbtree_node_set_height (tree, node, height);
915 _gtk_rbtree_set_fixed_height (node->children, height);
917 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
920 typedef struct _GtkRBReorder
931 gtk_rbtree_reorder_sort_func (gconstpointer a,
934 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
938 gtk_rbtree_reorder_invert_func (gconstpointer a,
941 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
945 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
948 if (node == tree->nil)
953 if (node->left != tree->nil)
955 gtk_rbtree_reorder_fixup (tree, node->left);
956 node->offset += node->left->offset;
957 node->parity += node->left->parity;
959 if (node->right != tree->nil)
961 gtk_rbtree_reorder_fixup (tree, node->right);
962 node->offset += node->right->offset;
963 node->parity += node->right->parity;
968 node->offset += node->children->root->offset;
969 node->parity += node->children->root->parity;
972 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
973 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
974 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
975 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
976 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
978 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
981 /* It basically pulls everything out of the tree, rearranges it, and puts it
982 * back together. Our strategy is to keep the old RBTree intact, and just
983 * rearrange the contents. When that is done, we go through and update the
984 * heights. There is probably a more elegant way to write this function. If
985 * anyone wants to spend the time writing it, patches will be accepted.
988 _gtk_rbtree_reorder (GtkRBTree *tree,
992 GtkRBReorder reorder = {0, };
997 g_return_if_fail (tree != NULL);
998 g_return_if_fail (length > 0);
999 g_return_if_fail (tree->root->count == length);
1001 /* Sort the trees values in the new tree. */
1002 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
1003 for (i = 0; i < length; i++)
1005 reorder.order = new_order[i];
1006 reorder.invert_order = i;
1007 g_array_append_val (array, reorder);
1010 g_array_sort(array, gtk_rbtree_reorder_sort_func);
1014 while (node && node->left != tree->nil)
1017 for (i = 0; i < length; i++)
1019 g_assert (node != tree->nil);
1020 g_array_index (array, GtkRBReorder, i).children = node->children;
1021 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
1022 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
1024 node = _gtk_rbtree_next (tree, node);
1027 g_array_sort (array, gtk_rbtree_reorder_invert_func);
1031 while (node && node->left != tree->nil)
1034 /* Go through the tree and change the values to the new ones. */
1035 for (i = 0; i < length; i++)
1037 reorder = g_array_index (array, GtkRBReorder, i);
1038 node->children = reorder.children;
1040 node->children->parent_node = node;
1041 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
1042 /* We temporarily set the height to this. */
1043 node->offset = reorder.height;
1044 node = _gtk_rbtree_next (tree, node);
1046 gtk_rbtree_reorder_fixup (tree, tree->root);
1048 g_array_free (array, TRUE);
1053 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
1060 g_assert (node->left);
1062 retval = node->left->offset;
1064 while (tree && node && node != tree->nil)
1067 node = node->parent;
1069 /* Add left branch, plus children, iff we came from the right */
1070 if (node->right == last)
1071 retval += node->offset - node->right->offset;
1073 if (node == tree->nil)
1075 node = tree->parent_node;
1076 tree = tree->parent_tree;
1078 /* Add the parent node, plus the left branch. */
1080 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
1087 _gtk_rbtree_node_find_parity (GtkRBTree *tree,
1094 g_assert (node->left);
1096 retval = node->left->parity;
1098 while (tree && node && node != tree->nil)
1101 node = node->parent;
1103 /* Add left branch, plus children, iff we came from the right */
1104 if (node->right == last)
1105 retval += node->parity - node->right->parity;
1107 if (node == tree->nil)
1109 node = tree->parent_node;
1110 tree = tree->parent_tree;
1112 /* Add the parent node, plus the left branch. */
1114 retval += node->left->parity + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1122 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1124 GtkRBTree **new_tree,
1125 GtkRBNode **new_node)
1127 GtkRBNode *tmp_node;
1140 tmp_node = tree->root;
1141 while (tmp_node != tree->nil &&
1142 (tmp_node->left->offset > height ||
1143 (tmp_node->offset - tmp_node->right->offset) < height))
1145 if (tmp_node->left->offset > height)
1146 tmp_node = tmp_node->left;
1149 height -= (tmp_node->offset - tmp_node->right->offset);
1150 tmp_node = tmp_node->right;
1153 if (tmp_node == tree->nil)
1159 if (tmp_node->children)
1161 if ((tmp_node->offset -
1162 tmp_node->right->offset -
1163 tmp_node->children->root->offset) > height)
1166 *new_node = tmp_node;
1167 return (height - tmp_node->left->offset);
1169 return _gtk_rbtree_real_find_offset (tmp_node->children,
1170 height - tmp_node->left->offset -
1172 tmp_node->left->offset -
1173 tmp_node->right->offset -
1174 tmp_node->children->root->offset),
1179 *new_node = tmp_node;
1180 return (height - tmp_node->left->offset);
1184 _gtk_rbtree_find_offset (GtkRBTree *tree,
1186 GtkRBTree **new_tree,
1187 GtkRBNode **new_node)
1192 (height >= tree->root->offset))
1199 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1203 _gtk_rbtree_remove_node (GtkRBTree *tree,
1207 GtkRBTree *tmp_tree;
1208 GtkRBNode *tmp_node;
1212 g_return_if_fail (tree != NULL);
1213 g_return_if_fail (node != NULL);
1216 #ifdef G_ENABLE_DEBUG
1217 if (gtk_debug_flags & GTK_DEBUG_TREE)
1219 g_print ("\n\n_gtk_rbtree_remove_node: %p\n", node);
1220 _gtk_rbtree_debug_spew (tree);
1221 _gtk_rbtree_test (G_STRLOC, tree);
1223 #endif /* G_ENABLE_DEBUG */
1225 /* make sure we're deleting a node that's actually in the tree */
1226 for (x = node; x->parent != tree->nil; x = x->parent)
1228 g_return_if_fail (x == tree->root);
1230 #ifdef G_ENABLE_DEBUG
1231 if (gtk_debug_flags & GTK_DEBUG_TREE)
1232 _gtk_rbtree_test (G_STRLOC, tree);
1235 if (node->left == tree->nil || node->right == tree->nil)
1243 while (y->left != tree->nil)
1247 /* adjust count only beneath tree */
1248 for (x = y; x != tree->nil; x = x->parent)
1253 /* offsets and parity adjust all the way up through parent trees */
1254 y_height = GTK_RBNODE_GET_HEIGHT (y);
1255 node_height = GTK_RBNODE_GET_HEIGHT (node) + (node->children?node->children->root->offset:0);
1259 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1261 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1262 _fixup_validation (tmp_tree, tmp_node);
1263 _fixup_parity (tmp_tree, tmp_node);
1264 tmp_node = tmp_node->parent;
1265 if (tmp_node == tmp_tree->nil)
1267 tmp_node = tmp_tree->parent_node;
1268 tmp_tree = tmp_tree->parent_tree;
1272 /* x is y's only child, or nil */
1273 if (y->left != tree->nil)
1278 /* remove y from the parent chain */
1279 x->parent = y->parent;
1280 if (y->parent != tree->nil)
1282 if (y == y->parent->left)
1283 y->parent->left = x;
1285 y->parent->right = x;
1292 /* We need to clean up the validity of the tree.
1299 /* We skip the first time, iff x is nil */
1300 if (tmp_node != tmp_tree->nil)
1302 _fixup_validation (tmp_tree, tmp_node);
1303 _fixup_parity (tmp_tree, tmp_node);
1305 tmp_node = tmp_node->parent;
1306 if (tmp_node == tmp_tree->nil)
1308 tmp_node = tmp_tree->parent_node;
1309 tmp_tree = tmp_tree->parent_tree;
1312 while (tmp_tree != NULL);
1318 /* Copy the node over */
1319 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1320 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_BLACK);
1322 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_RED);
1323 node->children = y->children;
1326 node->children = y->children;
1327 node->children->parent_node = node;
1331 node->children = NULL;
1333 _fixup_validation (tree, node);
1334 _fixup_parity (tree, node);
1335 /* We want to see how different our height is from the previous node.
1336 * To do this, we compare our current height with our supposed height.
1338 diff = y_height - GTK_RBNODE_GET_HEIGHT (node);
1342 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1344 tmp_node->offset += diff;
1345 _fixup_validation (tmp_tree, tmp_node);
1346 _fixup_parity (tmp_tree, tmp_node);
1347 tmp_node = tmp_node->parent;
1348 if (tmp_node == tmp_tree->nil)
1350 tmp_node = tmp_tree->parent_node;
1351 tmp_tree = tmp_tree->parent_tree;
1356 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_BLACK)
1357 _gtk_rbtree_remove_node_fixup (tree, x);
1358 _gtk_rbnode_free (y);
1360 #ifdef G_ENABLE_DEBUG
1361 if (gtk_debug_flags & GTK_DEBUG_TREE)
1363 g_print ("_gtk_rbtree_remove_node finished...\n");
1364 _gtk_rbtree_debug_spew (tree);
1366 _gtk_rbtree_test (G_STRLOC, tree);
1368 #endif /* G_ENABLE_DEBUG */
1372 _gtk_rbtree_next (GtkRBTree *tree,
1375 g_return_val_if_fail (tree != NULL, NULL);
1376 g_return_val_if_fail (node != NULL, NULL);
1378 /* Case 1: the node's below us. */
1379 if (node->right != tree->nil)
1382 while (node->left != tree->nil)
1387 /* Case 2: it's an ancestor */
1388 while (node->parent != tree->nil)
1390 if (node->parent->right == node)
1391 node = node->parent;
1393 return (node->parent);
1396 /* Case 3: There is no next node */
1401 _gtk_rbtree_prev (GtkRBTree *tree,
1404 g_return_val_if_fail (tree != NULL, NULL);
1405 g_return_val_if_fail (node != NULL, NULL);
1407 /* Case 1: the node's below us. */
1408 if (node->left != tree->nil)
1411 while (node->right != tree->nil)
1416 /* Case 2: it's an ancestor */
1417 while (node->parent != tree->nil)
1419 if (node->parent->left == node)
1420 node = node->parent;
1422 return (node->parent);
1425 /* Case 3: There is no next node */
1430 _gtk_rbtree_next_full (GtkRBTree *tree,
1432 GtkRBTree **new_tree,
1433 GtkRBNode **new_node)
1435 g_return_if_fail (tree != NULL);
1436 g_return_if_fail (node != NULL);
1437 g_return_if_fail (new_tree != NULL);
1438 g_return_if_fail (new_node != NULL);
1442 *new_tree = node->children;
1443 *new_node = (*new_tree)->root;
1444 while ((*new_node)->left != (*new_tree)->nil)
1445 *new_node = (*new_node)->left;
1450 *new_node = _gtk_rbtree_next (tree, node);
1452 while ((*new_node == NULL) &&
1453 (*new_tree != NULL))
1455 *new_node = (*new_tree)->parent_node;
1456 *new_tree = (*new_tree)->parent_tree;
1458 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1463 _gtk_rbtree_prev_full (GtkRBTree *tree,
1465 GtkRBTree **new_tree,
1466 GtkRBNode **new_node)
1468 g_return_if_fail (tree != NULL);
1469 g_return_if_fail (node != NULL);
1470 g_return_if_fail (new_tree != NULL);
1471 g_return_if_fail (new_node != NULL);
1474 *new_node = _gtk_rbtree_prev (tree, node);
1476 if (*new_node == NULL)
1478 *new_node = (*new_tree)->parent_node;
1479 *new_tree = (*new_tree)->parent_tree;
1483 while ((*new_node)->children)
1485 *new_tree = (*new_node)->children;
1486 *new_node = (*new_tree)->root;
1487 while ((*new_node)->right != (*new_tree)->nil)
1488 *new_node = (*new_node)->right;
1494 _gtk_rbtree_get_depth (GtkRBTree *tree)
1496 GtkRBTree *tmp_tree;
1499 tmp_tree = tree->parent_tree;
1503 tmp_tree = tmp_tree->parent_tree;
1510 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1512 GtkRBTreeTraverseFunc func,
1515 if (node == tree->nil)
1518 (* func) (tree, node, data);
1519 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1520 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1524 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1526 GtkRBTreeTraverseFunc func,
1529 if (node == tree->nil)
1532 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1533 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1534 (* func) (tree, node, data);
1538 _gtk_rbtree_traverse (GtkRBTree *tree,
1540 GTraverseType order,
1541 GtkRBTreeTraverseFunc func,
1544 g_return_if_fail (tree != NULL);
1545 g_return_if_fail (node != NULL);
1546 g_return_if_fail (func != NULL);
1547 g_return_if_fail (order <= G_LEVEL_ORDER);
1552 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1555 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1560 g_warning ("unsupported traversal order.");
1566 _count_nodes (GtkRBTree *tree,
1570 if (node == tree->nil)
1573 g_assert (node->left);
1574 g_assert (node->right);
1576 res = (_count_nodes (tree, node->left) +
1577 _count_nodes (tree, node->right) + 1);
1579 if (res != node->count)
1580 g_print ("Tree failed\n");
1585 void _fixup_validation (GtkRBTree *tree,
1588 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1589 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1590 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1591 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1592 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1594 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1598 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1603 void _fixup_parity (GtkRBTree *tree,
1607 ((node->children != NULL && node->children->root != node->children->nil) ? node->children->root->parity : 0) +
1608 ((node->left != tree->nil) ? node->left->parity : 0) +
1609 ((node->right != tree->nil) ? node->right->parity : 0);
1612 #ifdef G_ENABLE_DEBUG
1614 get_parity (GtkRBNode *node)
1616 guint child_total = 0;
1619 /* The parity of a node is node->parity minus
1620 * the parity of left, right, and children.
1622 * This is equivalent to saying that if left, right, children
1623 * sum to 0 parity, then node->parity is the parity of node,
1624 * and if left, right, children are odd parity, then
1625 * node->parity is the reverse of the node's parity.
1628 child_total += (guint) node->left->parity;
1629 child_total += (guint) node->right->parity;
1632 child_total += (guint) node->children->root->parity;
1634 rem = child_total % 2;
1637 return node->parity;
1639 return !node->parity;
1643 count_parity (GtkRBTree *tree,
1648 if (node == tree->nil)
1652 count_parity (tree, node->left) +
1653 count_parity (tree, node->right) +
1655 (node->children ? count_parity (node->children, node->children->root) : 0);
1657 res = res % (guint)2;
1659 if (res != node->parity)
1660 g_print ("parity incorrect for node\n");
1662 if (get_parity (node) != 1)
1663 g_error ("Node has incorrect parity %d", get_parity (node));
1669 _gtk_rbtree_test_height (GtkRBTree *tree,
1672 gint computed_offset = 0;
1674 /* This whole test is sort of a useless truism. */
1676 if (node->left != tree->nil)
1677 computed_offset += node->left->offset;
1679 if (node->right != tree->nil)
1680 computed_offset += node->right->offset;
1682 if (node->children && node->children->root != node->children->nil)
1683 computed_offset += node->children->root->offset;
1685 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1686 g_error ("node has broken offset\n");
1688 if (node->left != tree->nil)
1689 _gtk_rbtree_test_height (tree, node->left);
1691 if (node->right != tree->nil)
1692 _gtk_rbtree_test_height (tree, node->right);
1694 if (node->children && node->children->root != node->children->nil)
1695 _gtk_rbtree_test_height (node->children, node->children->root);
1699 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1701 gint expected_dirtyness)
1704 if (expected_dirtyness)
1706 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1707 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1708 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1709 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1710 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1714 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1715 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1716 if (node->left != tree->nil)
1717 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1718 if (node->right != tree->nil)
1719 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1720 if (node->children != NULL)
1721 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1724 if (node->left != tree->nil)
1725 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1726 if (node->right != tree->nil)
1727 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1728 if (node->children != NULL && node->children->root != node->children->nil)
1729 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1732 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1735 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1738 g_assert (node != tree->nil);
1740 g_assert (node->left != NULL);
1741 g_assert (node->right != NULL);
1742 g_assert (node->parent != NULL);
1744 if (node->left != tree->nil)
1746 g_assert (node->left->parent == node);
1747 _gtk_rbtree_test_structure_helper (tree, node->left);
1749 if (node->right != tree->nil)
1751 g_assert (node->right->parent == node);
1752 _gtk_rbtree_test_structure_helper (tree, node->right);
1755 if (node->children != NULL)
1757 g_assert (node->children->parent_tree == tree);
1758 g_assert (node->children->parent_node == node);
1760 _gtk_rbtree_test_structure (node->children);
1764 _gtk_rbtree_test_structure (GtkRBTree *tree)
1766 g_assert (tree->root);
1767 if (tree->root == tree->nil)
1770 g_assert (tree->root->parent == tree->nil);
1771 _gtk_rbtree_test_structure_helper (tree, tree->root);
1775 _gtk_rbtree_test (const gchar *where,
1778 GtkRBTree *tmp_tree;
1783 /* Test the entire tree */
1785 while (tmp_tree->parent_tree)
1786 tmp_tree = tmp_tree->parent_tree;
1788 g_assert (tmp_tree->nil != NULL);
1790 if (tmp_tree->root == tmp_tree->nil)
1793 _gtk_rbtree_test_structure (tmp_tree);
1795 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1796 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1799 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1800 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1801 g_assert (count_parity (tmp_tree, tmp_tree->root) == tmp_tree->root->parity);
1805 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1810 for (i = 0; i < depth; i++)
1813 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1815 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1818 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1819 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1820 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1821 if (node->children != NULL)
1823 g_print ("Looking at child.\n");
1824 _gtk_rbtree_debug_spew (node->children);
1825 g_print ("Done looking at child.\n");
1827 if (node->left != tree->nil)
1829 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1831 if (node->right != tree->nil)
1833 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1838 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1840 g_return_if_fail (tree != NULL);
1842 if (tree->root == tree->nil)
1843 g_print ("Empty tree...\n");
1845 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);
1847 #endif /* G_ENABLE_DEBUG */