Pileus Git - ~andy/gtk/blob - gtk/gtktreemodelsort.c

   1 /* gtktreemodelsort.c
   2  * Copyright (C) 2000,2001  Red Hat, Inc.,  Jonathan Blandford <jrb@redhat.com>
   3  * Copyright (C) 2001,2002  Kristian Rietveld <kris@gtk.org>
   4  *
   5  * This library is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU Library General Public
   7  * License as published by the Free Software Foundation; either
   8  * version 2 of the License, or (at your option) any later version.
   9  *
  10  * This library is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  * Library General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU Library General Public
  16  * License along with this library; if not, write to the
  17  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  18  * Boston, MA 02111-1307, USA.
  19  */
  20
  21 /* NOTE: There is a potential for confusion in this code as to whether an iter,
  22  * path or value refers to the GtkTreeModelSort model, or the child model being
  23  * sorted.  As a convention, variables referencing the child model will have an
  24  * s_ prefix before them (ie. s_iter, s_value, s_path);
  25  */
  26
  27 /* ITER FORMAT:
  28  *
  29  * iter->stamp = tree_model_sort->stamp
  30  * iter->user_data = SortLevel
  31  * iter->user_data2 = SortElt
  32  */
  33
  34 /* WARNING: this code is dangerous, can cause sleepless nights,
  35  * can cause your dog to die among other bad things
  36  *
  37  * we warned you and we're not liable for any head injuries.
  38  */
  39
  40 #include <string.h>
  41
  42 #include "gtktreemodelsort.h"
  43 #include "gtktreesortable.h"
  44 #include "gtktreestore.h"
  45 #include "gtktreedatalist.h"
  46 #include "gtkintl.h"
  47
  48 typedef struct _SortElt SortElt;
  49 typedef struct _SortLevel SortLevel;
  50 typedef struct _SortData SortData;
  51 typedef struct _SortTuple SortTuple;
  52
  53 struct _SortElt
  54 {
  55   GtkTreeIter  iter;
  56   SortLevel   *children;
  57   gint         offset;
  58   gint         ref_count;
  59   gint         zero_ref_count;
  60 };
  61
  62 struct _SortLevel
  63 {
  64   GArray    *array;
  65   gint       ref_count;
  66   SortElt   *parent_elt;
  67   SortLevel *parent_level;
  68 };
  69
  70 struct _SortData
  71 {
  72   GtkTreeModelSort *tree_model_sort;
  73   GtkTreePath *parent_path;
  74   gint parent_path_depth;
  75   gint *parent_path_indices;
  76   GtkTreeIterCompareFunc sort_func;
  77   gpointer sort_data;
  78 };
  79
  80 struct _SortTuple
  81 {
  82   SortElt   *elt;
  83   gint       offset;
  84 };
  85
  86 /* Properties */
  87 enum {
  88   PROP_0,
  89   /* Construct args */
  90   PROP_MODEL
  91 };
  92
  93
  94
  95 #define GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS(tree_model_sort) \
  96         (((GtkTreeModelSort *)tree_model_sort)->child_flags&GTK_TREE_MODEL_ITERS_PERSIST)
  97 #define SORT_ELT(sort_elt) ((SortElt *)sort_elt)
  98 #define SORT_LEVEL(sort_level) ((SortLevel *)sort_level)
  99
 100 #define GET_CHILD_ITER(tree_model_sort,child_iter,sort_iter) gtk_tree_model_sort_convert_iter_to_child_iter(GTK_TREE_MODEL_SORT (tree_model_sort), child_iter, sort_iter);
 101
 102 #define NO_SORT_FUNC ((GtkTreeIterCompareFunc) 0x1)
 103
 104 #define VALID_ITER(iter, tree_model_sort) (iter != NULL && iter->user_data != NULL && iter->user_data2 != NULL && tree_model_sort->stamp == iter->stamp)
 105
 106 /* general (object/interface init, etc) */
 107 static void gtk_tree_model_sort_init                  (GtkTreeModelSort      *tree_model_sort);
 108 static void gtk_tree_model_sort_class_init            (GtkTreeModelSortClass *tree_model_sort_class);
 109 static void gtk_tree_model_sort_tree_model_init       (GtkTreeModelIface     *iface);
 110 static void gtk_tree_model_sort_tree_sortable_init    (GtkTreeSortableIface  *iface);
 111 static void gtk_tree_model_sort_finalize              (GObject               *object);
 112 static void gtk_tree_model_sort_set_property          (GObject               *object,
 113                                                        guint                  prop_id,
 114                                                        const GValue          *value,
 115                                                        GParamSpec            *pspec);
 116 static void gtk_tree_model_sort_get_property          (GObject               *object,
 117                                                        guint                  prop_id,
 118                                                        GValue                *value,
 119                                                        GParamSpec            *pspec);
 120
 121 /* our signal handlers */
 122 static void gtk_tree_model_sort_row_changed           (GtkTreeModel          *model,
 123                                                        GtkTreePath           *start_path,
 124                                                        GtkTreeIter           *start_iter,
 125                                                        gpointer               data);
 126 static void gtk_tree_model_sort_row_inserted          (GtkTreeModel          *model,
 127                                                        GtkTreePath           *path,
 128                                                        GtkTreeIter           *iter,
 129                                                        gpointer               data);
 130 static void gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel          *model,
 131                                                        GtkTreePath           *path,
 132                                                        GtkTreeIter           *iter,
 133                                                        gpointer               data);
 134 static void gtk_tree_model_sort_row_deleted           (GtkTreeModel          *model,
 135                                                        GtkTreePath           *path,
 136                                                        gpointer               data);
 137 static void gtk_tree_model_sort_rows_reordered        (GtkTreeModel          *s_model,
 138                                                        GtkTreePath           *s_path,
 139                                                        GtkTreeIter           *s_iter,
 140                                                        gint                  *new_order,
 141                                                        gpointer               data);
 142
 143 /* TreeModel interface */
 144 static GtkTreeModelFlags gtk_tree_model_sort_get_flags     (GtkTreeModel          *tree_model);
 145 static gint         gtk_tree_model_sort_get_n_columns      (GtkTreeModel          *tree_model);
 146 static GType        gtk_tree_model_sort_get_column_type    (GtkTreeModel          *tree_model,
 147                                                             gint                   index);
 148 static gboolean     gtk_tree_model_sort_get_iter           (GtkTreeModel          *tree_model,
 149                                                             GtkTreeIter           *iter,
 150                                                             GtkTreePath           *path);
 151 static GtkTreePath *gtk_tree_model_sort_get_path           (GtkTreeModel          *tree_model,
 152                                                             GtkTreeIter           *iter);
 153 static void         gtk_tree_model_sort_get_value          (GtkTreeModel          *tree_model,
 154                                                             GtkTreeIter           *iter,
 155                                                             gint                   column,
 156                                                             GValue                *value);
 157 static gboolean     gtk_tree_model_sort_iter_next          (GtkTreeModel          *tree_model,
 158                                                             GtkTreeIter           *iter);
 159 static gboolean     gtk_tree_model_sort_iter_children      (GtkTreeModel          *tree_model,
 160                                                             GtkTreeIter           *iter,
 161                                                             GtkTreeIter           *parent);
 162 static gboolean     gtk_tree_model_sort_iter_has_child     (GtkTreeModel          *tree_model,
 163                                                             GtkTreeIter           *iter);
 164 static gint         gtk_tree_model_sort_iter_n_children    (GtkTreeModel          *tree_model,
 165                                                             GtkTreeIter           *iter);
 166 static gboolean     gtk_tree_model_sort_iter_nth_child     (GtkTreeModel          *tree_model,
 167                                                             GtkTreeIter           *iter,
 168                                                             GtkTreeIter           *parent,
 169                                                             gint                   n);
 170 static gboolean     gtk_tree_model_sort_iter_parent        (GtkTreeModel          *tree_model,
 171                                                             GtkTreeIter           *iter,
 172                                                             GtkTreeIter           *child);
 173 static void         gtk_tree_model_sort_ref_node           (GtkTreeModel          *tree_model,
 174                                                             GtkTreeIter           *iter);
 175 static void         gtk_tree_model_sort_real_unref_node    (GtkTreeModel          *tree_model,
 176                                                             GtkTreeIter           *iter,
 177                                                             gboolean               propagate_unref);
 178 static void         gtk_tree_model_sort_unref_node         (GtkTreeModel          *tree_model,
 179                                                             GtkTreeIter           *iter);
 180
 181 /* TreeSortable interface */
 182 static gboolean     gtk_tree_model_sort_get_sort_column_id    (GtkTreeSortable        *sortable,
 183                                                                gint                   *sort_column_id,
 184                                                                GtkSortType            *order);
 185 static void         gtk_tree_model_sort_set_sort_column_id    (GtkTreeSortable        *sortable,
 186                                                                gint                    sort_column_id,
 187                                                                GtkSortType        order);
 188 static void         gtk_tree_model_sort_set_sort_func         (GtkTreeSortable        *sortable,
 189                                                                gint                    sort_column_id,
 190                                                                GtkTreeIterCompareFunc  func,
 191                                                                gpointer                data,
 192                                                                GtkDestroyNotify        destroy);
 193 static void         gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable        *sortable,
 194                                                                GtkTreeIterCompareFunc  func,
 195                                                                gpointer                data,
 196                                                                GtkDestroyNotify        destroy);
 197 static gboolean     gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable     *sortable);
 198
 199 /* Private functions (sort funcs, level handling and other utils) */
 200 static void         gtk_tree_model_sort_build_level       (GtkTreeModelSort *tree_model_sort,
 201                                                            SortLevel        *parent_level,
 202                                                            SortElt          *parent_elt);
 203 static void         gtk_tree_model_sort_free_level        (GtkTreeModelSort *tree_model_sort,
 204                                                            SortLevel        *sort_level);
 205 static void         gtk_tree_model_sort_increment_stamp   (GtkTreeModelSort *tree_model_sort);
 206 static void         gtk_tree_model_sort_sort_level        (GtkTreeModelSort *tree_model_sort,
 207                                                            SortLevel        *level,
 208                                                            gboolean          recurse,
 209                                                            gboolean          emit_reordered);
 210 static void         gtk_tree_model_sort_sort              (GtkTreeModelSort *tree_model_sort);
 211 static gint         gtk_tree_model_sort_level_find_insert (GtkTreeModelSort *tree_model_sort,
 212                                                            SortLevel        *level,
 213                                                            GtkTreeIter      *iter,
 214                                                            gboolean          skip_sort_elt);
 215 static gboolean     gtk_tree_model_sort_insert_value      (GtkTreeModelSort *tree_model_sort,
 216                                                            SortLevel        *level,
 217                                                            GtkTreePath      *s_path,
 218                                                            GtkTreeIter      *s_iter);
 219 static GtkTreePath *gtk_tree_model_sort_elt_get_path      (SortLevel        *level,
 220                                                            SortElt          *elt);
 221 static void         gtk_tree_model_sort_set_model         (GtkTreeModelSort *tree_model_sort,
 222                                                            GtkTreeModel     *child_model);
 223 static GtkTreePath *gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
 224                                                                          GtkTreePath      *child_path,
 225                                                                          gboolean          build_levels);
 226
 227 static GObjectClass *parent_class = NULL;
 228
 229 GType
 230 gtk_tree_model_sort_get_type (void)
 231 {
 232   static GType tree_model_sort_type = 0;
 233
 234   if (!tree_model_sort_type)
 235     {
 236       static const GTypeInfo tree_model_sort_info =
 237       {
 238         sizeof (GtkTreeModelSortClass),
 239         NULL,           /* base_init */
 240         NULL,           /* base_finalize */
 241         (GClassInitFunc) gtk_tree_model_sort_class_init,
 242         NULL,           /* class_finalize */
 243         NULL,           /* class_data */
 244         sizeof (GtkTreeModelSort),
 245         0,              /* n_preallocs */
 246         (GInstanceInitFunc) gtk_tree_model_sort_init
 247       };
 248
 249       static const GInterfaceInfo tree_model_info =
 250       {
 251         (GInterfaceInitFunc) gtk_tree_model_sort_tree_model_init,
 252         NULL,
 253         NULL
 254       };
 255
 256       static const GInterfaceInfo sortable_info =
 257       {
 258         (GInterfaceInitFunc) gtk_tree_model_sort_tree_sortable_init,
 259         NULL,
 260         NULL
 261       };
 262
 263       tree_model_sort_type =
 264         g_type_register_static (G_TYPE_OBJECT, "GtkTreeModelSort",
 265                                 &tree_model_sort_info, 0);
 266
 267       g_type_add_interface_static (tree_model_sort_type,
 268                                    GTK_TYPE_TREE_MODEL,
 269                                    &tree_model_info);
 270
 271       g_type_add_interface_static (tree_model_sort_type,
 272                                    GTK_TYPE_TREE_SORTABLE,
 273                                    &sortable_info);
 274     }
 275
 276   return tree_model_sort_type;
 277 }
 278
 279 static void
 280 gtk_tree_model_sort_init (GtkTreeModelSort *tree_model_sort)
 281 {
 282   tree_model_sort->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
 283   tree_model_sort->stamp = 0;
 284   tree_model_sort->zero_ref_count = 0;
 285   tree_model_sort->root = NULL;
 286   tree_model_sort->sort_list = NULL;
 287 }
 288
 289 static void
 290 gtk_tree_model_sort_class_init (GtkTreeModelSortClass *class)
 291 {
 292   GObjectClass *object_class;
 293
 294   object_class = (GObjectClass *) class;
 295   parent_class = g_type_class_peek_parent (class);
 296
 297   object_class->set_property = gtk_tree_model_sort_set_property;
 298   object_class->get_property = gtk_tree_model_sort_get_property;
 299
 300   object_class->finalize = gtk_tree_model_sort_finalize;
 301
 302   /* Properties */
 303   g_object_class_install_property (object_class,
 304                                    PROP_MODEL,
 305                                    g_param_spec_object ("model",
 306                                                         _("TreeModelSort Model"),
 307                                                         _("The model for the TreeModelSort to sort"),
 308                                                         GTK_TYPE_TREE_MODEL,
 309                                                         G_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY));
 310 }
 311
 312 static void
 313 gtk_tree_model_sort_tree_model_init (GtkTreeModelIface *iface)
 314 {
 315   iface->get_flags = gtk_tree_model_sort_get_flags;
 316   iface->get_n_columns = gtk_tree_model_sort_get_n_columns;
 317   iface->get_column_type = gtk_tree_model_sort_get_column_type;
 318   iface->get_iter = gtk_tree_model_sort_get_iter;
 319   iface->get_path = gtk_tree_model_sort_get_path;
 320   iface->get_value = gtk_tree_model_sort_get_value;
 321   iface->iter_next = gtk_tree_model_sort_iter_next;
 322   iface->iter_children = gtk_tree_model_sort_iter_children;
 323   iface->iter_has_child = gtk_tree_model_sort_iter_has_child;
 324   iface->iter_n_children = gtk_tree_model_sort_iter_n_children;
 325   iface->iter_nth_child = gtk_tree_model_sort_iter_nth_child;
 326   iface->iter_parent = gtk_tree_model_sort_iter_parent;
 327   iface->ref_node = gtk_tree_model_sort_ref_node;
 328   iface->unref_node = gtk_tree_model_sort_unref_node;
 329 }
 330
 331 static void
 332 gtk_tree_model_sort_tree_sortable_init (GtkTreeSortableIface *iface)
 333 {
 334   iface->get_sort_column_id = gtk_tree_model_sort_get_sort_column_id;
 335   iface->set_sort_column_id = gtk_tree_model_sort_set_sort_column_id;
 336   iface->set_sort_func = gtk_tree_model_sort_set_sort_func;
 337   iface->set_default_sort_func = gtk_tree_model_sort_set_default_sort_func;
 338   iface->has_default_sort_func = gtk_tree_model_sort_has_default_sort_func;
 339 }
 340
 341 /**
 342  * gtk_tree_model_sort_new_with_model:
 343  * @child_model: A #GtkTreeModel
 344  *
 345  * Creates a new #GtkTreeModel, with @child_model as the child_model.
 346  *
 347  * Return value: A new #GtkTreeModel.
 348  */
 349 GtkTreeModel *
 350 gtk_tree_model_sort_new_with_model (GtkTreeModel      *child_model)
 351 {
 352   GtkTreeModel *retval;
 353
 354   g_return_val_if_fail (GTK_IS_TREE_MODEL (child_model), NULL);
 355
 356   retval = g_object_new (gtk_tree_model_sort_get_type (), NULL);
 357
 358   gtk_tree_model_sort_set_model (GTK_TREE_MODEL_SORT (retval), child_model);
 359
 360   return retval;
 361 }
 362
 363 /* GObject callbacks */
 364 static void
 365 gtk_tree_model_sort_finalize (GObject *object)
 366 {
 367   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) object;
 368
 369   gtk_tree_model_sort_set_model (tree_model_sort, NULL);
 370
 371   if (tree_model_sort->root)
 372     gtk_tree_model_sort_free_level (tree_model_sort, tree_model_sort->root);
 373
 374   if (tree_model_sort->sort_list)
 375     {
 376       _gtk_tree_data_list_header_free (tree_model_sort->sort_list);
 377       tree_model_sort->sort_list = NULL;
 378     }
 379
 380   /* must chain up */
 381   parent_class->finalize (object);
 382 }
 383
 384 static void
 385 gtk_tree_model_sort_set_property (GObject      *object,
 386                                   guint         prop_id,
 387                                   const GValue *value,
 388                                   GParamSpec   *pspec)
 389 {
 390   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
 391
 392   switch (prop_id)
 393     {
 394     case PROP_MODEL:
 395       gtk_tree_model_sort_set_model (tree_model_sort, g_value_get_object (value));
 396       break;
 397     default:
 398       G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
 399       break;
 400     }
 401 }
 402
 403 static void
 404 gtk_tree_model_sort_get_property (GObject    *object,
 405                                   guint       prop_id,
 406                                   GValue     *value,
 407                                   GParamSpec *pspec)
 408 {
 409   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
 410
 411   switch (prop_id)
 412     {
 413     case PROP_MODEL:
 414       g_value_set_object (value, gtk_tree_model_sort_get_model(tree_model_sort));
 415       break;
 416     default:
 417       G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
 418       break;
 419     }
 420 }
 421
 422 static void
 423 gtk_tree_model_sort_row_changed (GtkTreeModel *s_model,
 424                                  GtkTreePath  *start_s_path,
 425                                  GtkTreeIter  *start_s_iter,
 426                                  gpointer      data)
 427 {
 428   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 429   GtkTreePath *path = NULL;
 430   GtkTreeIter iter;
 431   GtkTreeIter tmpiter;
 432
 433   SortElt tmp;
 434   SortElt *elt;
 435   SortLevel *level;
 436
 437   gboolean free_s_path = FALSE;
 438
 439   gint offset, index = 0, old_index, i;
 440
 441   g_return_if_fail (start_s_path != NULL || start_s_iter != NULL);
 442
 443   if (!start_s_path)
 444     {
 445       free_s_path = TRUE;
 446       start_s_path = gtk_tree_model_get_path (s_model, start_s_iter);
 447     }
 448
 449   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
 450                                                               start_s_path,
 451                                                               FALSE);
 452   if (!path)
 453     {
 454       if (free_s_path)
 455         gtk_tree_path_free (start_s_path);
 456       return;
 457     }
 458
 459   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 460
 461   level = iter.user_data;
 462   elt = iter.user_data2;
 463
 464   if (level->array->len < 2 ||
 465       (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
 466        tree_model_sort->default_sort_func == NO_SORT_FUNC))
 467     {
 468       if (free_s_path)
 469         gtk_tree_path_free (start_s_path);
 470
 471       gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
 472
 473       gtk_tree_path_free (path);
 474
 475       return;
 476     }
 477
 478   if (!GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
 479     {
 480       gtk_tree_model_get_iter (tree_model_sort->child_model,
 481                                &tmpiter, start_s_path);
 482     }
 483
 484   offset = elt->offset;
 485
 486   for (i = 0; i < level->array->len; i++)
 487     if (elt->offset == g_array_index (level->array, SortElt, i).offset)
 488       index = i;
 489
 490   memcpy (&tmp, elt, sizeof (SortElt));
 491   g_array_remove_index (level->array, index);
 492
 493   old_index = index;
 494
 495   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
 496     index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
 497                                                    level,
 498                                                    &tmp.iter,
 499                                                    TRUE);
 500   else
 501     index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
 502                                                    level,
 503                                                    &tmpiter,
 504                                                    TRUE);
 505
 506   g_array_insert_val (level->array, index, tmp);
 507
 508   for (i = 0; i < level->array->len; i++)
 509     if (g_array_index (level->array, SortElt, i).children)
 510       g_array_index (level->array, SortElt, i).children->parent_elt = &g_array_index (level->array, SortElt, i);
 511
 512   gtk_tree_path_up (path);
 513   gtk_tree_path_append_index (path, index);
 514
 515   gtk_tree_model_sort_increment_stamp (tree_model_sort);
 516
 517   /* if the item moved, then emit rows_reordered */
 518   if (old_index != index)
 519     {
 520       gint *new_order;
 521       gint j;
 522
 523       GtkTreePath *tmppath;
 524
 525       new_order = g_new (gint, level->array->len);
 526
 527       for (j = 0; j < level->array->len; j++)
 528         {
 529           if (index > old_index)
 530             {
 531               if (j == index)
 532                 new_order[j] = old_index;
 533               else if (j >= old_index && j < index)
 534                 new_order[j] = j + 1;
 535               else
 536                 new_order[j] = j;
 537             }
 538           else if (index < old_index)
 539             {
 540               if (j == index)
 541                 new_order[j] = old_index;
 542               else if (j > index && j <= old_index)
 543                 new_order[j] = j - 1;
 544               else
 545                 new_order[j] = j;
 546             }
 547           /* else? shouldn't really happen */
 548         }
 549
 550       if (level->parent_elt)
 551         {
 552           iter.stamp = tree_model_sort->stamp;
 553           iter.user_data = level->parent_level;
 554           iter.user_data2 = level->parent_elt;
 555
 556           tmppath = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort), &iter);
 557
 558           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
 559                                          tmppath, &iter, new_order);
 560         }
 561       else
 562         {
 563           /* toplevel */
 564           tmppath = gtk_tree_path_new ();
 565
 566           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), tmppath,
 567                                          NULL, new_order);
 568         }
 569
 570       gtk_tree_path_free (tmppath);
 571       g_free (new_order);
 572     }
 573
 574   /* emit row_changed signal (at new location) */
 575   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 576   gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
 577
 578   gtk_tree_path_free (path);
 579   if (free_s_path)
 580     gtk_tree_path_free (start_s_path);
 581 }
 582
 583 static void
 584 gtk_tree_model_sort_row_inserted (GtkTreeModel          *s_model,
 585                                   GtkTreePath           *s_path,
 586                                   GtkTreeIter           *s_iter,
 587                                   gpointer               data)
 588 {
 589   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 590   GtkTreePath *path;
 591   GtkTreeIter iter;
 592   GtkTreeIter real_s_iter;
 593
 594   gint i = 0;
 595
 596   gboolean free_s_path = FALSE;
 597
 598   SortElt *elt;
 599   SortLevel *level;
 600   SortLevel *parent_level = NULL;
 601
 602   parent_level = level = SORT_LEVEL (tree_model_sort->root);
 603
 604   g_return_if_fail (s_path != NULL || s_iter != NULL);
 605
 606   if (!s_path)
 607     {
 608       s_path = gtk_tree_model_get_path (s_model, s_iter);
 609       free_s_path = TRUE;
 610     }
 611
 612   if (!s_iter)
 613     gtk_tree_model_get_iter (s_model, &real_s_iter, s_path);
 614   else
 615     real_s_iter = *s_iter;
 616
 617   if (!tree_model_sort->root)
 618     {
 619       gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
 620
 621       /* the build level already put the inserted iter in the level,
 622          so no need to handle this signal anymore */
 623
 624       goto done_and_submit;
 625     }
 626
 627   /* find the parent level */
 628   while (i < gtk_tree_path_get_depth (s_path) - 1)
 629     {
 630       gint j;
 631
 632       if (!level)
 633         {
 634           /* level not yet build, we won't cover this signal */
 635           goto done;
 636         }
 637
 638       if (level->array->len < gtk_tree_path_get_indices (s_path)[i])
 639         {
 640           g_warning ("A node was inserted with a parent that's not in the tree.\n"
 641                      "This possibly means that a GtkTreeModel inserted a child node\n"
 642                      "before the parent was inserted.");
 643           goto done;
 644         }
 645
 646       elt = NULL;
 647       for (j = 0; j < level->array->len; j++)
 648         if (g_array_index (level->array, SortElt, j).offset == gtk_tree_path_get_indices (s_path)[i])
 649           {
 650             elt = &g_array_index (level->array, SortElt, j);
 651             break;
 652           }
 653
 654       g_return_if_fail (elt != NULL);
 655
 656       if (!elt->children)
 657         {
 658           GtkTreePath *tmppath;
 659           GtkTreeIter  tmpiter;
 660
 661           tmpiter.stamp = tree_model_sort->stamp;
 662           tmpiter.user_data = level;
 663           tmpiter.user_data2 = elt;
 664
 665           tmppath = gtk_tree_model_get_path (GTK_TREE_MODEL (data), &tmpiter);
 666           if (tmppath)
 667             {
 668               gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data),
 669                                                     tmppath,
 670                                                     &tmpiter);
 671               gtk_tree_path_free (tmppath);
 672             }
 673
 674           /* not covering this signal */
 675           goto done;
 676         }
 677
 678       level = elt->children;
 679       parent_level = level;
 680       i++;
 681     }
 682
 683   if (!parent_level)
 684     goto done;
 685
 686   if (!gtk_tree_model_sort_insert_value (tree_model_sort,
 687                                          parent_level,
 688                                          s_path,
 689                                          &real_s_iter))
 690     goto done;
 691
 692  done_and_submit:
 693   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
 694                                                               s_path,
 695                                                               FALSE);
 696
 697   if (!path)
 698     return;
 699
 700   gtk_tree_model_sort_increment_stamp (tree_model_sort);
 701
 702   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 703   gtk_tree_model_row_inserted (GTK_TREE_MODEL (data), path, &iter);
 704   gtk_tree_path_free (path);
 705
 706  done:
 707   if (free_s_path)
 708     gtk_tree_path_free (s_path);
 709
 710   return;
 711 }
 712
 713 static void
 714 gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel *s_model,
 715                                            GtkTreePath  *s_path,
 716                                            GtkTreeIter  *s_iter,
 717                                            gpointer      data)
 718 {
 719   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 720   GtkTreePath *path;
 721   GtkTreeIter iter;
 722
 723   g_return_if_fail (s_path != NULL && s_iter != NULL);
 724
 725   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
 726   if (path == NULL)
 727     return;
 728
 729   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 730   gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data), path, &iter);
 731
 732   gtk_tree_path_free (path);
 733 }
 734
 735 /* FIXME: I still have doubts if this works */
 736 static void
 737 gtk_tree_model_sort_row_deleted (GtkTreeModel *s_model,
 738                                  GtkTreePath  *s_path,
 739                                  gpointer      data)
 740 {
 741   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 742   GtkTreePath *path = NULL;
 743   SortElt *elt;
 744   SortLevel *level;
 745   GtkTreeIter iter;
 746   gint offset;
 747   gint i;
 748
 749   g_return_if_fail (s_path != NULL);
 750
 751   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
 752   if (path == NULL)
 753     return;
 754
 755   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 756
 757   level = SORT_LEVEL (iter.user_data);
 758   elt = SORT_ELT (iter.user_data2);
 759   offset = elt->offset;
 760
 761   /* we _need_ to emit ::row_deleted before we start unreffing the node
 762    * itself. This is because of the row refs, which start unreffing nodes
 763    * when we emit ::row_deleted
 764    */
 765   gtk_tree_model_row_deleted (GTK_TREE_MODEL (data), path);
 766
 767   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 768
 769   while (elt->ref_count > 0)
 770     gtk_tree_model_sort_real_unref_node (GTK_TREE_MODEL (data), &iter, FALSE);
 771
 772   if (level->ref_count == 0 && level != tree_model_sort->root)
 773     {
 774       /* This will prune the level, so I can just emit the signal and not worry
 775        * about cleaning this level up. */
 776       gtk_tree_model_sort_increment_stamp (tree_model_sort);
 777       gtk_tree_path_free (path);
 778       return;
 779     }
 780
 781   gtk_tree_model_sort_increment_stamp (tree_model_sort);
 782
 783   /* Remove the row */
 784   for (i = 0; i < level->array->len; i++)
 785     if (elt->offset == g_array_index (level->array, SortElt, i).offset)
 786       break;
 787
 788   g_array_remove_index (level->array, i);
 789
 790   /* update all offsets */
 791   for (i = 0; i < level->array->len; i++)
 792     {
 793       elt = & (g_array_index (level->array, SortElt, i));
 794       if (elt->offset > offset)
 795         elt->offset--;
 796       if (elt->children)
 797         elt->children->parent_elt = elt;
 798     }
 799
 800   gtk_tree_path_free (path);
 801 }
 802
 803 static void
 804 gtk_tree_model_sort_rows_reordered (GtkTreeModel *s_model,
 805                                     GtkTreePath  *s_path,
 806                                     GtkTreeIter  *s_iter,
 807                                     gint         *new_order,
 808                                     gpointer      data)
 809 {
 810   SortElt *elt;
 811   SortLevel *level;
 812   GtkTreeIter iter;
 813   gint *tmp_array;
 814   int i, j;
 815   GtkTreePath *path;
 816   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 817
 818   g_return_if_fail (new_order != NULL);
 819
 820   if (s_path == NULL || gtk_tree_path_get_indices (s_path) == NULL)
 821     {
 822       if (tree_model_sort->root == NULL)
 823         return;
 824       path = gtk_tree_path_new ();
 825       level = SORT_LEVEL (tree_model_sort->root);
 826     }
 827   else
 828     {
 829       path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
 830       if (path == NULL)
 831         return;
 832       gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 833
 834       level = SORT_LEVEL (iter.user_data);
 835       elt = SORT_ELT (iter.user_data2);
 836
 837       if (!elt->children)
 838         {
 839           gtk_tree_path_free (path);
 840           return;
 841         }
 842
 843       level = elt->children;
 844     }
 845
 846   if (level->array->len < 2)
 847     {
 848       gtk_tree_path_free (path);
 849       return;
 850     }
 851
 852   tmp_array = g_new (int, level->array->len);
 853   for (i = 0; i < level->array->len; i++)
 854     {
 855       for (j = 0; j < level->array->len; j++)
 856         {
 857           if (g_array_index (level->array, SortElt, i).offset == new_order[j])
 858             tmp_array[i] = j;
 859         }
 860     }
 861
 862   for (i = 0; i < level->array->len; i++)
 863     g_array_index (level->array, SortElt, i).offset = tmp_array[i];
 864   g_free (tmp_array);
 865
 866   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
 867       tree_model_sort->default_sort_func == NO_SORT_FUNC)
 868     {
 869
 870       gtk_tree_model_sort_sort_level (tree_model_sort, level,
 871                                       FALSE, FALSE);
 872       gtk_tree_model_sort_increment_stamp (tree_model_sort);
 873
 874       if (gtk_tree_path_get_depth (path))
 875         {
 876           gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort),
 877                                    &iter,
 878                                    path);
 879           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
 880                                          path, &iter, new_order);
 881         }
 882       else
 883         {
 884           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
 885                                          path, NULL, new_order);
 886         }
 887     }
 888
 889   gtk_tree_path_free (path);
 890 }
 891
 892 /* Fulfill our model requirements */
 893 static GtkTreeModelFlags
 894 gtk_tree_model_sort_get_flags (GtkTreeModel *tree_model)
 895 {
 896   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
 897
 898   return 0;
 899 }
 900
 901 static gint
 902 gtk_tree_model_sort_get_n_columns (GtkTreeModel *tree_model)
 903 {
 904   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
 905
 906   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
 907
 908   if (tree_model_sort->child_model == 0)
 909     return 0;
 910
 911   return gtk_tree_model_get_n_columns (tree_model_sort->child_model);
 912 }
 913
 914 static GType
 915 gtk_tree_model_sort_get_column_type (GtkTreeModel *tree_model,
 916                                      gint          index)
 917 {
 918   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), G_TYPE_INVALID);
 919   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, G_TYPE_INVALID);
 920
 921   return gtk_tree_model_get_column_type (GTK_TREE_MODEL_SORT (tree_model)->child_model, index);
 922 }
 923
 924 static gboolean
 925 gtk_tree_model_sort_get_iter (GtkTreeModel *tree_model,
 926                               GtkTreeIter  *iter,
 927                               GtkTreePath  *path)
 928 {
 929   GtkTreeModelSort *tree_model_sort;
 930   gint *indices;
 931   SortLevel *level;
 932   gint depth, i;
 933
 934   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
 935   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
 936
 937   tree_model_sort = (GtkTreeModelSort *) tree_model;
 938   indices = gtk_tree_path_get_indices (path);
 939
 940   if (tree_model_sort->root == NULL)
 941     gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
 942   level = SORT_LEVEL (tree_model_sort->root);
 943
 944   depth = gtk_tree_path_get_depth (path);
 945   if (depth == 0)
 946     return FALSE;
 947
 948   for (i = 0; i < depth - 1; i++)
 949     {
 950       if ((level == NULL) ||
 951           (indices[i] >= level->array->len))
 952         return FALSE;
 953
 954       if (g_array_index (level->array, SortElt, indices[i]).children == NULL)
 955         gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, indices[i]));
 956       level = g_array_index (level->array, SortElt, indices[i]).children;
 957     }
 958
 959   if (level == NULL)
 960     return FALSE;
 961   iter->stamp = tree_model_sort->stamp;
 962   iter->user_data = level;
 963   iter->user_data2 = &g_array_index (level->array, SortElt, indices[depth - 1]);
 964
 965   return TRUE;
 966 }
 967
 968 static GtkTreePath *
 969 gtk_tree_model_sort_get_path (GtkTreeModel *tree_model,
 970                               GtkTreeIter  *iter)
 971 {
 972   GtkTreePath *retval;
 973   SortLevel *level;
 974   SortElt *elt;
 975
 976   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
 977   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, NULL);
 978   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, NULL);
 979
 980   retval = gtk_tree_path_new ();
 981   level = iter->user_data;
 982   elt = iter->user_data2;
 983   while (level != NULL)
 984     {
 985       gtk_tree_path_prepend_index (retval, elt - (SortElt *)level->array->data);
 986
 987       elt = level->parent_elt;
 988       level = level->parent_level;
 989     }
 990
 991   return retval;
 992 }
 993
 994 static void
 995 gtk_tree_model_sort_get_value (GtkTreeModel *tree_model,
 996                                GtkTreeIter  *iter,
 997                                gint          column,
 998                                GValue       *value)
 999 {
1000   GtkTreeIter child_iter;
1001
1002   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1003   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1004   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1005
1006   GET_CHILD_ITER (tree_model, &child_iter, iter);
1007   gtk_tree_model_get_value (GTK_TREE_MODEL_SORT (tree_model)->child_model,
1008                             &child_iter, column, value);
1009 }
1010
1011 static gboolean
1012 gtk_tree_model_sort_iter_next (GtkTreeModel *tree_model,
1013                                GtkTreeIter  *iter)
1014 {
1015   SortLevel *level;
1016   SortElt *elt;
1017
1018   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1019   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1020   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, FALSE);
1021
1022   level = iter->user_data;
1023   elt = iter->user_data2;
1024
1025   if (elt - (SortElt *)level->array->data >= level->array->len - 1)
1026     {
1027       iter->stamp = 0;
1028       return FALSE;
1029     }
1030   iter->user_data2 = elt + 1;
1031
1032   return TRUE;
1033 }
1034
1035 static gboolean
1036 gtk_tree_model_sort_iter_children (GtkTreeModel *tree_model,
1037                                    GtkTreeIter  *iter,
1038                                    GtkTreeIter  *parent)
1039 {
1040   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1041   SortLevel *level;
1042
1043   iter->stamp = 0;
1044   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1045   g_return_val_if_fail (tree_model_sort->child_model != NULL, FALSE);
1046   if (parent) g_return_val_if_fail (tree_model_sort->stamp == parent->stamp, FALSE);
1047
1048   if (parent == NULL)
1049     {
1050       if (tree_model_sort->root == NULL)
1051         gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1052       if (tree_model_sort->root == NULL)
1053         return FALSE;
1054
1055       level = tree_model_sort->root;
1056       iter->stamp = tree_model_sort->stamp;
1057       iter->user_data = level;
1058       iter->user_data2 = level->array->data;
1059     }
1060   else
1061     {
1062       if (((SortElt *)parent->user_data2)->children == NULL)
1063         gtk_tree_model_sort_build_level (tree_model_sort,
1064                                          (SortLevel *)parent->user_data,
1065                                          (SortElt *)parent->user_data2);
1066       if (((SortElt *)parent->user_data2)->children == NULL)
1067         return FALSE;
1068       iter->stamp = tree_model_sort->stamp;
1069       iter->user_data = ((SortElt *)parent->user_data2)->children;
1070       iter->user_data2 = ((SortLevel *)iter->user_data)->array->data;
1071     }
1072
1073   return TRUE;
1074 }
1075
1076 static gboolean
1077 gtk_tree_model_sort_iter_has_child (GtkTreeModel *tree_model,
1078                                     GtkTreeIter  *iter)
1079 {
1080   GtkTreeIter child_iter;
1081
1082   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1083   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1084   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, FALSE);
1085
1086   GET_CHILD_ITER (tree_model, &child_iter, iter);
1087
1088   return gtk_tree_model_iter_has_child (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1089 }
1090
1091 static gint
1092 gtk_tree_model_sort_iter_n_children (GtkTreeModel *tree_model,
1093                                      GtkTreeIter  *iter)
1094 {
1095   GtkTreeIter child_iter;
1096
1097   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
1098   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, 0);
1099   if (iter) g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, 0);
1100
1101   if (iter == NULL)
1102     return gtk_tree_model_iter_n_children (GTK_TREE_MODEL_SORT (tree_model)->child_model, NULL);
1103
1104   GET_CHILD_ITER (tree_model, &child_iter, iter);
1105
1106   return gtk_tree_model_iter_n_children (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1107 }
1108
1109 static gboolean
1110 gtk_tree_model_sort_iter_nth_child (GtkTreeModel *tree_model,
1111                                     GtkTreeIter  *iter,
1112                                     GtkTreeIter  *parent,
1113                                     gint          n)
1114 {
1115   SortLevel *level;
1116   /* We have this for the iter == parent case */
1117   GtkTreeIter children;
1118
1119   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1120   if (parent) g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == parent->stamp, FALSE);
1121
1122   /* Use this instead of has_child to force us to build the level, if needed */
1123   if (gtk_tree_model_sort_iter_children (tree_model, &children, parent) == FALSE)
1124     {
1125       iter->stamp = 0;
1126       return FALSE;
1127     }
1128
1129   level = children.user_data;
1130   if (n >= level->array->len)
1131     {
1132       iter->stamp = 0;
1133       return FALSE;
1134     }
1135
1136   iter->stamp = GTK_TREE_MODEL_SORT (tree_model)->stamp;
1137   iter->user_data = level;
1138   iter->user_data2 = &g_array_index (level->array, SortElt, n);
1139
1140   return TRUE;
1141 }
1142
1143 static gboolean
1144 gtk_tree_model_sort_iter_parent (GtkTreeModel *tree_model,
1145                                  GtkTreeIter  *iter,
1146                                  GtkTreeIter  *child)
1147 {
1148   SortLevel *level;
1149
1150   iter->stamp = 0;
1151   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1152   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1153   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == child->stamp, FALSE);
1154
1155   level = child->user_data;
1156
1157   if (level->parent_level)
1158     {
1159       iter->stamp = GTK_TREE_MODEL_SORT (tree_model)->stamp;
1160       iter->user_data = level->parent_level;
1161       iter->user_data2 = level->parent_elt;
1162
1163       return TRUE;
1164     }
1165   return FALSE;
1166 }
1167
1168 static void
1169 gtk_tree_model_sort_ref_node (GtkTreeModel *tree_model,
1170                               GtkTreeIter  *iter)
1171 {
1172   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1173   GtkTreeIter child_iter;
1174   SortLevel *level;
1175   SortElt *elt;
1176
1177   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1178   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1179   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1180
1181   GET_CHILD_ITER (tree_model, &child_iter, iter);
1182
1183   gtk_tree_model_ref_node (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1184
1185   level = iter->user_data;
1186   elt = iter->user_data2;
1187
1188   elt->ref_count++;
1189   level->ref_count++;
1190   if (level->ref_count == 1)
1191     {
1192       SortLevel *parent_level = level->parent_level;
1193       SortElt *parent_elt = level->parent_elt;
1194       /* We were at zero -- time to decrement the zero_ref_count val */
1195       do
1196         {
1197           if (parent_elt)
1198             parent_elt->zero_ref_count--;
1199           else
1200             tree_model_sort->zero_ref_count--;
1201
1202           if (parent_level)
1203             {
1204               parent_elt = parent_level->parent_elt;
1205               parent_level = parent_level->parent_level;
1206             }
1207         }
1208       while (parent_level);
1209     }
1210 }
1211
1212 static void
1213 gtk_tree_model_sort_real_unref_node (GtkTreeModel *tree_model,
1214                                      GtkTreeIter  *iter,
1215                                      gboolean      propagate_unref)
1216 {
1217   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1218   GtkTreeIter child_iter;
1219   SortLevel *level;
1220   SortElt *elt;
1221
1222   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1223   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1224   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1225
1226   GET_CHILD_ITER (tree_model, &child_iter, iter);
1227
1228   if (propagate_unref)
1229     gtk_tree_model_unref_node (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1230
1231   level = iter->user_data;
1232   elt = iter->user_data2;
1233
1234   g_return_if_fail (elt->ref_count > 0);
1235
1236   elt->ref_count--;
1237   level->ref_count--;
1238
1239   if (level->ref_count == 0)
1240     {
1241       SortLevel *parent_level = level->parent_level;
1242       SortElt *parent_elt = level->parent_elt;
1243
1244       /* We are at zero -- time to increment the zero_ref_count val */
1245       while (parent_level)
1246         {
1247           parent_elt->zero_ref_count++;
1248
1249           parent_elt = parent_level->parent_elt;
1250           parent_level = parent_level->parent_level;
1251         }
1252       tree_model_sort->zero_ref_count++;
1253     }
1254 }
1255
1256 static void
1257 gtk_tree_model_sort_unref_node (GtkTreeModel *tree_model,
1258                                 GtkTreeIter  *iter)
1259 {
1260   gtk_tree_model_sort_real_unref_node (tree_model, iter, TRUE);
1261 }
1262
1263 /* Sortable interface */
1264 static gboolean
1265 gtk_tree_model_sort_get_sort_column_id (GtkTreeSortable *sortable,
1266                                         gint            *sort_column_id,
1267                                         GtkSortType     *order)
1268 {
1269   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1270
1271   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (sortable), FALSE);
1272
1273   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1274     return FALSE;
1275
1276   if (sort_column_id)
1277     *sort_column_id = tree_model_sort->sort_column_id;
1278   if (order)
1279     *order = tree_model_sort->order;
1280
1281   return TRUE;
1282 }
1283
1284 static void
1285 gtk_tree_model_sort_set_sort_column_id (GtkTreeSortable *sortable,
1286                                         gint             sort_column_id,
1287                                         GtkSortType      order)
1288 {
1289   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1290
1291   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1292
1293   if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1294     {
1295       GtkTreeDataSortHeader *header = NULL;
1296
1297       header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1298                                                sort_column_id);
1299
1300       /* we want to make sure that we have a function */
1301       g_return_if_fail (header != NULL);
1302       g_return_if_fail (header->func != NULL);
1303     }
1304   else
1305     g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1306
1307   if (tree_model_sort->sort_column_id == sort_column_id)
1308     {
1309       if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1310         {
1311           if (tree_model_sort->order == order)
1312             return;
1313         }
1314       else
1315         return;
1316     }
1317
1318   tree_model_sort->sort_column_id = sort_column_id;
1319   tree_model_sort->order = order;
1320
1321   gtk_tree_model_sort_sort (tree_model_sort);
1322
1323   gtk_tree_sortable_sort_column_changed (sortable);
1324 }
1325
1326 static void
1327 gtk_tree_model_sort_set_sort_func (GtkTreeSortable        *sortable,
1328                                    gint                    sort_column_id,
1329                                    GtkTreeIterCompareFunc  func,
1330                                    gpointer                data,
1331                                    GtkDestroyNotify        destroy)
1332 {
1333   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) sortable;
1334   GtkTreeDataSortHeader *header = NULL;
1335   GList *list;
1336
1337   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1338   g_return_if_fail (func != NULL);
1339
1340   for (list = tree_model_sort->sort_list; list; list = list->next)
1341     {
1342       GtkTreeDataSortHeader *list_header;
1343
1344       list_header = (GtkTreeDataSortHeader*) list->data;
1345       if (list_header->sort_column_id == sort_column_id)
1346         {
1347           header = list_header;
1348           break;
1349         }
1350     }
1351
1352   if (header == NULL)
1353     {
1354       header = g_new0 (GtkTreeDataSortHeader, 1);
1355       header->sort_column_id = sort_column_id;
1356       tree_model_sort->sort_list = g_list_append (tree_model_sort->sort_list,
1357                                                   header);
1358     }
1359
1360   if (header->destroy)
1361     {
1362       GtkDestroyNotify d = header->destroy;
1363
1364       header->destroy = NULL;
1365       d (header->data);
1366     }
1367
1368   header->func = func;
1369   header->data = data;
1370   header->destroy = destroy;
1371 }
1372
1373 static void
1374 gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable        *sortable,
1375                                            GtkTreeIterCompareFunc  func,
1376                                            gpointer                data,
1377                                            GtkDestroyNotify        destroy)
1378 {
1379   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1380
1381   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1382
1383   if (tree_model_sort->default_sort_destroy)
1384     {
1385       GtkDestroyNotify d = tree_model_sort->default_sort_destroy;
1386
1387       tree_model_sort->default_sort_destroy = NULL;
1388       d (tree_model_sort->default_sort_data);
1389     }
1390
1391   tree_model_sort->default_sort_func = func;
1392   tree_model_sort->default_sort_data = data;
1393   tree_model_sort->default_sort_destroy = destroy;
1394 }
1395
1396 static gboolean
1397 gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable *sortable)
1398 {
1399   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1400
1401   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (sortable), FALSE);
1402
1403   return (tree_model_sort->default_sort_func != NULL);
1404 }
1405
1406 /* sorting code - private */
1407 static gint
1408 gtk_tree_model_sort_compare_func (gconstpointer a,
1409                                   gconstpointer b,
1410                                   gpointer      user_data)
1411 {
1412   SortData *data = (SortData *)user_data;
1413   GtkTreeModelSort *tree_model_sort = data->tree_model_sort;
1414   SortTuple *sa = (SortTuple *)a;
1415   SortTuple *sb = (SortTuple *)b;
1416
1417   GtkTreeIter iter_a, iter_b;
1418   gint retval;
1419
1420   /* shortcut, if we've the same offsets here, they should be equal */
1421   if (sa->offset == sb->offset)
1422     return 0;
1423
1424   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1425     {
1426       iter_a = sa->elt->iter;
1427       iter_b = sb->elt->iter;
1428     }
1429   else
1430     {
1431       data->parent_path_indices [data->parent_path_depth-1] = sa->elt->offset;
1432       gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort->child_model), &iter_a, data->parent_path);
1433       data->parent_path_indices [data->parent_path_depth-1] = sb->elt->offset;
1434       gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort->child_model), &iter_b, data->parent_path);
1435     }
1436
1437   retval = (* data->sort_func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1438                                 &iter_a, &iter_b,
1439                                 data->sort_data);
1440
1441   if (tree_model_sort->order == GTK_SORT_DESCENDING)
1442     {
1443       if (retval > 0)
1444         retval = -1;
1445       else if (retval < 0)
1446         retval = 1;
1447     }
1448
1449   return retval;
1450 }
1451
1452 static gint
1453 gtk_tree_model_sort_offset_compare_func (gconstpointer a,
1454                                          gconstpointer b,
1455                                          gpointer      user_data)
1456 {
1457   gint retval;
1458
1459   SortTuple *sa = (SortTuple *)a;
1460   SortTuple *sb = (SortTuple *)b;
1461
1462   SortData *data = (SortData *)user_data;
1463
1464   if (sa->elt->offset < sb->elt->offset)
1465     retval = -1;
1466   else if (sa->elt->offset > sb->elt->offset)
1467     retval = 1;
1468   else
1469     retval = 0;
1470
1471   if (data->tree_model_sort->order == GTK_SORT_DESCENDING)
1472     {
1473       if (retval > 0)
1474         retval = -1;
1475       else if (retval < 0)
1476         retval = 1;
1477     }
1478
1479   return retval;
1480 }
1481
1482 static void
1483 gtk_tree_model_sort_sort_level (GtkTreeModelSort *tree_model_sort,
1484                                 SortLevel        *level,
1485                                 gboolean          recurse,
1486                                 gboolean          emit_reordered)
1487 {
1488   gint i;
1489   GArray *sort_array;
1490   GArray *new_array;
1491   gint *new_order;
1492
1493   GtkTreeIter iter;
1494   GtkTreePath *path;
1495
1496   SortData data;
1497
1498   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1499   g_return_if_fail (level != NULL);
1500
1501   if (level->array->len < 1 && !((SortElt *)level->array->data)->children)
1502     return;
1503
1504   /* Set up data */
1505   data.tree_model_sort = tree_model_sort;
1506   if (level->parent_elt)
1507     {
1508       data.parent_path = gtk_tree_model_sort_elt_get_path (level->parent_level,
1509                                                            level->parent_elt);
1510       gtk_tree_path_append_index (data.parent_path, 0);
1511     }
1512   else
1513     {
1514       data.parent_path = gtk_tree_path_new_first ();
1515     }
1516   data.parent_path_depth = gtk_tree_path_get_depth (data.parent_path);
1517   data.parent_path_indices = gtk_tree_path_get_indices (data.parent_path);
1518
1519   /* make the array to be sorted */
1520   sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), level->array->len);
1521   for (i = 0; i < level->array->len; i++)
1522     {
1523       SortTuple tuple;
1524
1525       tuple.elt = &g_array_index (level->array, SortElt, i);
1526       tuple.offset = i;
1527
1528       g_array_append_val (sort_array, tuple);
1529     }
1530
1531     if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1532       {
1533         GtkTreeDataSortHeader *header = NULL;
1534
1535         header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1536                                                  tree_model_sort->sort_column_id);
1537
1538         g_return_if_fail (header != NULL);
1539         g_return_if_fail (header->func != NULL);
1540
1541         data.sort_func = header->func;
1542         data.sort_data = header->data;
1543       }
1544     else
1545       {
1546         /* absolutely SHOULD NOT happen: */
1547         g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1548
1549         data.sort_func = tree_model_sort->default_sort_func;
1550         data.sort_data = tree_model_sort->default_sort_data;
1551       }
1552
1553   if (data.sort_func == NO_SORT_FUNC)
1554     g_array_sort_with_data (sort_array,
1555                             gtk_tree_model_sort_offset_compare_func,
1556                             &data);
1557   else
1558     g_array_sort_with_data (sort_array,
1559                             gtk_tree_model_sort_compare_func,
1560                             &data);
1561
1562   gtk_tree_path_free (data.parent_path);
1563
1564   new_array = g_array_sized_new (FALSE, FALSE, sizeof (SortElt), level->array->len);
1565   new_order = g_new (gint, level->array->len);
1566
1567   for (i = 0; i < level->array->len; i++)
1568     {
1569       SortElt *elt;
1570
1571       elt = g_array_index (sort_array, SortTuple, i).elt;
1572       new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
1573
1574       g_array_append_val (new_array, *elt);
1575       elt = &g_array_index (new_array, SortElt, i);
1576       if (elt->children)
1577         elt->children->parent_elt = elt;
1578     }
1579
1580   g_array_free (level->array, TRUE);
1581   level->array = new_array;
1582   g_array_free (sort_array, TRUE);
1583
1584   if (emit_reordered)
1585     {
1586       gtk_tree_model_sort_increment_stamp (tree_model_sort);
1587       if (level->parent_elt)
1588         {
1589           iter.stamp = tree_model_sort->stamp;
1590           iter.user_data = level->parent_level;
1591           iter.user_data2 = level->parent_elt;
1592
1593           path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort),
1594                                           &iter);
1595
1596           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1597                                          &iter, new_order);
1598         }
1599       else
1600         {
1601           /* toplevel list */
1602           path = gtk_tree_path_new ();
1603           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1604                                          NULL, new_order);
1605         }
1606
1607       gtk_tree_path_free (path);
1608     }
1609
1610   /* recurse, if possible */
1611   if (recurse)
1612     {
1613       for (i = 0; i < level->array->len; i++)
1614         {
1615           SortElt *elt = &g_array_index (level->array, SortElt, i);
1616
1617           if (elt->children)
1618             gtk_tree_model_sort_sort_level (tree_model_sort,
1619                                             elt->children,
1620                                             TRUE, emit_reordered);
1621         }
1622     }
1623
1624   g_free (new_order);
1625 }
1626
1627 static void
1628 gtk_tree_model_sort_sort (GtkTreeModelSort *tree_model_sort)
1629 {
1630   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1631
1632   if (!tree_model_sort->root)
1633     return;
1634
1635   if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1636     {
1637       GtkTreeDataSortHeader *header = NULL;
1638
1639       header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1640                                                tree_model_sort->sort_column_id);
1641
1642       /* we want to make sure that we have a function */
1643       g_return_if_fail (header != NULL);
1644       g_return_if_fail (header->func != NULL);
1645     }
1646   else
1647     g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1648
1649   gtk_tree_model_sort_sort_level (tree_model_sort, tree_model_sort->root,
1650                                   TRUE, TRUE);
1651 }
1652
1653 /* signal helpers */
1654 static gint
1655 gtk_tree_model_sort_level_find_insert (GtkTreeModelSort *tree_model_sort,
1656                                        SortLevel        *level,
1657                                        GtkTreeIter      *iter,
1658                                        gboolean          skip_sort_elt)
1659 {
1660   gint middle;
1661   gint cmp;
1662   SortElt *tmp_elt;
1663   GtkTreeIter tmp_iter;
1664
1665   GtkTreeIterCompareFunc func;
1666   gpointer data;
1667
1668   GtkTreePath *path;
1669
1670   if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1671     {
1672       GtkTreeDataSortHeader *header;
1673
1674       header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1675                                                tree_model_sort->sort_column_id);
1676
1677       g_return_val_if_fail (header != NULL, 0);
1678
1679       func = header->func;
1680       data = header->data;
1681     }
1682   else
1683     {
1684       func = tree_model_sort->default_sort_func;
1685       data = tree_model_sort->default_sort_data;
1686
1687       g_return_val_if_fail (func != NO_SORT_FUNC, 0);
1688     }
1689
1690   g_return_val_if_fail (func != NULL, 0);
1691
1692   for (middle = 0; middle < level->array->len; middle++)
1693     {
1694       tmp_elt = &(g_array_index (level->array, SortElt, middle));
1695
1696       if (!skip_sort_elt && SORT_ELT (iter->user_data2) == tmp_elt)
1697         continue;
1698
1699       path = gtk_tree_model_sort_elt_get_path (level, tmp_elt);
1700       gtk_tree_model_get_iter (tree_model_sort->child_model,
1701                                &tmp_iter, path);
1702       gtk_tree_path_free (path);
1703
1704       if (tree_model_sort->order == GTK_SORT_ASCENDING)
1705         cmp = (* func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1706                         &tmp_iter, iter, data);
1707       else
1708         cmp = (* func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1709                         iter, &tmp_iter, data);
1710
1711       if (cmp > 0)
1712         break;
1713     }
1714
1715   return middle;
1716 }
1717
1718 static gboolean
1719 gtk_tree_model_sort_insert_value (GtkTreeModelSort *tree_model_sort,
1720                                   SortLevel        *level,
1721                                   GtkTreePath      *s_path,
1722                                   GtkTreeIter      *s_iter)
1723 {
1724   gint offset, index, i;
1725
1726   SortElt elt;
1727   SortElt *tmp_elt;
1728
1729   offset = gtk_tree_path_get_indices (s_path)[gtk_tree_path_get_depth (s_path) - 1];
1730
1731   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1732     elt.iter = *s_iter;
1733   elt.offset = offset;
1734   elt.zero_ref_count = 0;
1735   elt.ref_count = 0;
1736   elt.children = NULL;
1737
1738   /* update all larger offsets */
1739   tmp_elt = SORT_ELT (level->array->data);
1740   for (i = 0; i < level->array->len; i++, tmp_elt++)
1741     if (tmp_elt->offset >= offset)
1742       tmp_elt->offset++;
1743
1744   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
1745       tree_model_sort->default_sort_func == NO_SORT_FUNC)
1746     index = offset;
1747   else
1748     index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
1749                                                    level, s_iter,
1750                                                    FALSE);
1751
1752   g_array_insert_vals (level->array, index, &elt, 1);
1753   tmp_elt = SORT_ELT (level->array->data);
1754   for (i = 0; i < level->array->len; i++, tmp_elt++)
1755     if (tmp_elt->children)
1756       tmp_elt->children->parent_elt = tmp_elt;
1757
1758   return TRUE;
1759 }
1760
1761 /* sort elt stuff */
1762 static GtkTreePath *
1763 gtk_tree_model_sort_elt_get_path (SortLevel *level,
1764                                   SortElt *elt)
1765 {
1766   SortLevel *walker = level;
1767   SortElt *walker2 = elt;
1768   GtkTreePath *path;
1769
1770   g_return_val_if_fail (level != NULL, NULL);
1771   g_return_val_if_fail (elt != NULL, NULL);
1772
1773   path = gtk_tree_path_new ();
1774
1775   while (walker)
1776     {
1777       gtk_tree_path_prepend_index (path, walker2->offset);
1778
1779       walker2 = walker->parent_elt;
1780       walker = walker->parent_level;
1781     }
1782
1783   return path;
1784 }
1785
1786 /**
1787  * gtk_tree_model_sort_set_model:
1788  * @tree_model_sort: The #GtkTreeModelSort.
1789  * @child_model: A #GtkTreeModel, or NULL.
1790  *
1791  * Sets the model of @tree_model_sort to be @model.  If @model is NULL, then the
1792  * old model is unset.  The sort function is unset as a result of this call.
1793  * The model will be in an unsorted state until a sort function is set.
1794  **/
1795 static void
1796 gtk_tree_model_sort_set_model (GtkTreeModelSort *tree_model_sort,
1797                                GtkTreeModel     *child_model)
1798 {
1799   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1800
1801   if (child_model)
1802     g_object_ref (child_model);
1803
1804   if (tree_model_sort->child_model)
1805     {
1806       g_signal_handler_disconnect (tree_model_sort->child_model,
1807                                    tree_model_sort->changed_id);
1808       g_signal_handler_disconnect (tree_model_sort->child_model,
1809                                    tree_model_sort->inserted_id);
1810       g_signal_handler_disconnect (tree_model_sort->child_model,
1811                                    tree_model_sort->has_child_toggled_id);
1812       g_signal_handler_disconnect (tree_model_sort->child_model,
1813                                    tree_model_sort->deleted_id);
1814       g_signal_handler_disconnect (tree_model_sort->child_model,
1815                                    tree_model_sort->reordered_id);
1816
1817       /* reset our state */
1818       if (tree_model_sort->root)
1819         gtk_tree_model_sort_free_level (tree_model_sort, tree_model_sort->root);
1820       tree_model_sort->root = NULL;
1821       _gtk_tree_data_list_header_free (tree_model_sort->sort_list);
1822       tree_model_sort->sort_list = NULL;
1823       g_object_unref (tree_model_sort->child_model);
1824     }
1825
1826   tree_model_sort->child_model = child_model;
1827
1828   if (child_model)
1829     {
1830       GType *types;
1831       gint i, n_columns;
1832
1833       tree_model_sort->changed_id =
1834         g_signal_connect (child_model, "row_changed",
1835                           G_CALLBACK (gtk_tree_model_sort_row_changed),
1836                           tree_model_sort);
1837       tree_model_sort->inserted_id =
1838         g_signal_connect (child_model, "row_inserted",
1839                           G_CALLBACK (gtk_tree_model_sort_row_inserted),
1840                           tree_model_sort);
1841       tree_model_sort->has_child_toggled_id =
1842         g_signal_connect (child_model, "row_has_child_toggled",
1843                           G_CALLBACK (gtk_tree_model_sort_row_has_child_toggled),
1844                           tree_model_sort);
1845       tree_model_sort->deleted_id =
1846         g_signal_connect (child_model, "row_deleted",
1847                           G_CALLBACK (gtk_tree_model_sort_row_deleted),
1848                           tree_model_sort);
1849       tree_model_sort->reordered_id =
1850         g_signal_connect (child_model, "rows_reordered",
1851                           G_CALLBACK (gtk_tree_model_sort_rows_reordered),
1852                           tree_model_sort);
1853
1854       tree_model_sort->child_flags = gtk_tree_model_get_flags (child_model);
1855       n_columns = gtk_tree_model_get_n_columns (child_model);
1856
1857       types = g_new (GType, n_columns);
1858       for (i = 0; i < n_columns; i++)
1859         types[i] = gtk_tree_model_get_column_type (child_model, i);
1860
1861       tree_model_sort->sort_list = _gtk_tree_data_list_header_new (n_columns, types);
1862       g_free (types);
1863
1864       tree_model_sort->default_sort_func = NO_SORT_FUNC;
1865       tree_model_sort->stamp = g_random_int ();
1866     }
1867 }
1868
1869 /**
1870  * gtk_tree_model_sort_get_model:
1871  * @tree_model: a #GtkTreeModelSort
1872  *
1873  * Returns the model the #GtkTreeModelSort is sorting.
1874  *
1875  * Return value: the "child model" being sorted
1876  **/
1877 GtkTreeModel *
1878 gtk_tree_model_sort_get_model (GtkTreeModelSort  *tree_model)
1879 {
1880   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
1881
1882   return tree_model->child_model;
1883 }
1884
1885
1886 static GtkTreePath *
1887 gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
1888                                                      GtkTreePath      *child_path,
1889                                                      gboolean          build_levels)
1890 {
1891   gint *child_indices;
1892   GtkTreePath *retval;
1893   SortLevel *level;
1894   gint i;
1895
1896   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
1897   g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
1898   g_return_val_if_fail (child_path != NULL, NULL);
1899
1900   retval = gtk_tree_path_new ();
1901   child_indices = gtk_tree_path_get_indices (child_path);
1902
1903   if (tree_model_sort->root == NULL && build_levels)
1904     gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1905   level = SORT_LEVEL (tree_model_sort->root);
1906
1907   for (i = 0; i < gtk_tree_path_get_depth (child_path); i++)
1908     {
1909       gint j;
1910       gboolean found_child = FALSE;
1911
1912       if (!level)
1913         {
1914           gtk_tree_path_free (retval);
1915           return NULL;
1916         }
1917
1918       if (child_indices[i] >= level->array->len)
1919         {
1920           gtk_tree_path_free (retval);
1921           return NULL;
1922         }
1923       for (j = 0; j < level->array->len; j++)
1924         {
1925           if ((g_array_index (level->array, SortElt, j)).offset == child_indices[i])
1926             {
1927               gtk_tree_path_append_index (retval, j);
1928               if (g_array_index (level->array, SortElt, j).children == NULL && build_levels)
1929                 {
1930                   gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, j));
1931                 }
1932               level = g_array_index (level->array, SortElt, j).children;
1933               found_child = TRUE;
1934               break;
1935             }
1936         }
1937       if (! found_child)
1938         {
1939           gtk_tree_path_free (retval);
1940           return NULL;
1941         }
1942     }
1943
1944   return retval;
1945 }
1946
1947
1948 /**
1949  * gtk_tree_model_sort_convert_child_path_to_path:
1950  * @tree_model_sort: A #GtkTreeModelSort
1951  * @child_path: A #GtkTreePath to convert
1952  *
1953  * Converts @child_path to a path relative to @tree_model_sort.  That is,
1954  * @child_path points to a path in the child model.  The returned path will
1955  * point to the same row in the sorted model.  If @child_path isn't a valid path
1956  * on the child model, then %NULL is returned.
1957  *
1958  * Return value: A newly allocated #GtkTreePath, or %NULL
1959  **/
1960 GtkTreePath *
1961 gtk_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
1962                                                 GtkTreePath      *child_path)
1963 {
1964   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
1965   g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
1966   g_return_val_if_fail (child_path != NULL, NULL);
1967
1968   return gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path, TRUE);
1969 }
1970
1971 /**
1972  * gtk_tree_model_sort_convert_child_iter_to_iter:
1973  * @tree_model_sort: A #GtkTreeModelSort
1974  * @sort_iter: An uninitialized #GtkTreeIter.
1975  * @child_iter: A valid #GtkTreeIter pointing to a row on the child model
1976  *
1977  * Sets @sort_iter to point to the row in @tree_model_sort that corresponds to
1978  * the row pointed at by @child_iter.
1979  **/
1980 void
1981 gtk_tree_model_sort_convert_child_iter_to_iter (GtkTreeModelSort *tree_model_sort,
1982                                                 GtkTreeIter      *sort_iter,
1983                                                 GtkTreeIter      *child_iter)
1984 {
1985   GtkTreePath *child_path, *path;
1986
1987   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1988   g_return_if_fail (tree_model_sort->child_model != NULL);
1989   g_return_if_fail (sort_iter != NULL);
1990   g_return_if_fail (child_iter != NULL);
1991
1992   sort_iter->stamp = 0;
1993
1994   child_path = gtk_tree_model_get_path (tree_model_sort->child_model, child_iter);
1995   g_return_if_fail (child_path != NULL);
1996
1997   path = gtk_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path);
1998   gtk_tree_path_free (child_path);
1999   g_return_if_fail (path != NULL);
2000
2001   gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort), sort_iter, path);
2002   gtk_tree_path_free (path);
2003 }
2004
2005 /**
2006  * gtk_tree_model_sort_convert_path_to_child_path:
2007  * @tree_model_sort: A #GtkTreeModelSort
2008  * @sorted_path: A #GtkTreePath to convert
2009  *
2010  * Converts @sorted_path to a path on the child model of @tree_model_sort.  That
2011  * is, @sorted_path points to a location in @tree_model_sort.  The returned path
2012  * will point to the same location in the model not being sorted.  If @sorted_path
2013  * does not point to a location in the child model, %NULL is returned.
2014  *
2015  * Return value: A newly allocated #GtkTreePath, or %NULL
2016  **/
2017 GtkTreePath *
2018 gtk_tree_model_sort_convert_path_to_child_path (GtkTreeModelSort *tree_model_sort,
2019                                                 GtkTreePath      *sorted_path)
2020 {
2021   gint *sorted_indices;
2022   GtkTreePath *retval;
2023   SortLevel *level;
2024   gint i;
2025
2026   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
2027   g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
2028   g_return_val_if_fail (sorted_path != NULL, NULL);
2029
2030   retval = gtk_tree_path_new ();
2031   sorted_indices = gtk_tree_path_get_indices (sorted_path);
2032   if (tree_model_sort->root == NULL)
2033     gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
2034   level = SORT_LEVEL (tree_model_sort->root);
2035
2036   for (i = 0; i < gtk_tree_path_get_depth (sorted_path); i++)
2037     {
2038       gint count = sorted_indices[i];
2039
2040       if ((level == NULL) ||
2041           (level->array->len <= count))
2042         {
2043           gtk_tree_path_free (retval);
2044           return NULL;
2045         }
2046
2047       if (g_array_index (level->array, SortElt, count).children == NULL)
2048         gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, count));
2049
2050       if (level == NULL)
2051         {
2052           gtk_tree_path_free (retval);
2053           break;
2054         }
2055
2056       gtk_tree_path_append_index (retval, g_array_index (level->array, SortElt, count).offset);
2057       level = g_array_index (level->array, SortElt, count).children;
2058     }
2059
2060   return retval;
2061 }
2062
2063 /**
2064  * gtk_tree_model_sort_convert_iter_to_child_iter:
2065  * @tree_model_sort: A #GtkTreeModelSort
2066  * @child_iter: An uninitialized #GtkTreeIter
2067  * @sorted_iter: A valid #GtkTreeIter pointing to a row on @tree_model_sort.
2068  *
2069  * Sets @child_iter to point to the row pointed to by @sorted_iter.
2070  **/
2071 void
2072 gtk_tree_model_sort_convert_iter_to_child_iter (GtkTreeModelSort *tree_model_sort,
2073                                                 GtkTreeIter      *child_iter,
2074                                                 GtkTreeIter      *sorted_iter)
2075 {
2076   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2077   g_return_if_fail (tree_model_sort->child_model != NULL);
2078   g_return_if_fail (child_iter != NULL);
2079   g_return_if_fail (sorted_iter != NULL);
2080   g_return_if_fail (sorted_iter->stamp == tree_model_sort->stamp);
2081
2082   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2083     {
2084       *child_iter = SORT_ELT (sorted_iter->user_data2)->iter;
2085     }
2086   else
2087     {
2088       GtkTreePath *path;
2089
2090       path = gtk_tree_model_sort_elt_get_path (sorted_iter->user_data,
2091                                                sorted_iter->user_data2);
2092       gtk_tree_model_get_iter (tree_model_sort->child_model, child_iter, path);
2093       gtk_tree_path_free (path);
2094     }
2095 }
2096
2097 static void
2098 gtk_tree_model_sort_build_level (GtkTreeModelSort *tree_model_sort,
2099                                  SortLevel        *parent_level,
2100                                  SortElt          *parent_elt)
2101 {
2102   GtkTreeIter iter;
2103   SortLevel *new_level;
2104   gint length = 0;
2105   gint i;
2106
2107   g_assert (tree_model_sort->child_model != NULL);
2108
2109   if (parent_level == NULL)
2110     {
2111       if (gtk_tree_model_get_iter_first (tree_model_sort->child_model, &iter) == FALSE)
2112         return;
2113       length = gtk_tree_model_iter_n_children (tree_model_sort->child_model, NULL);
2114     }
2115   else
2116     {
2117       GtkTreeIter parent_iter;
2118       GtkTreeIter child_parent_iter;
2119
2120       parent_iter.stamp = tree_model_sort->stamp;
2121       parent_iter.user_data = parent_level;
2122       parent_iter.user_data2 = parent_elt;
2123
2124       gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2125                                                       &child_parent_iter,
2126                                                       &parent_iter);
2127       if (gtk_tree_model_iter_children (tree_model_sort->child_model,
2128                                         &iter,
2129                                         &child_parent_iter) == FALSE)
2130         return;
2131
2132       /* stamp may have changed */
2133       gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2134                                                       &child_parent_iter,
2135                                                       &parent_iter);
2136
2137       length = gtk_tree_model_iter_n_children (tree_model_sort->child_model, &child_parent_iter);
2138     }
2139
2140   g_return_if_fail (length > 0);
2141
2142   new_level = g_new (SortLevel, 1);
2143   new_level->array = g_array_sized_new (FALSE, FALSE, sizeof (SortElt), length);
2144   new_level->ref_count = 0;
2145   new_level->parent_elt = parent_elt;
2146   new_level->parent_level = parent_level;
2147
2148   if (parent_elt)
2149     parent_elt->children = new_level;
2150   else
2151     tree_model_sort->root = new_level;
2152
2153   /* increase the count of zero ref_counts.*/
2154   while (parent_level)
2155     {
2156       parent_elt->zero_ref_count++;
2157
2158       parent_elt = parent_level->parent_elt;
2159       parent_level = parent_level->parent_level;
2160     }
2161   if (new_level != tree_model_sort->root)
2162     tree_model_sort->zero_ref_count++;
2163
2164   for (i = 0; i < length; i++)
2165     {
2166       SortElt sort_elt;
2167       sort_elt.offset = i;
2168       sort_elt.zero_ref_count = 0;
2169       sort_elt.ref_count = 0;
2170       sort_elt.children = NULL;
2171
2172       if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2173         {
2174           sort_elt.iter = iter;
2175           if (gtk_tree_model_iter_next (tree_model_sort->child_model, &iter) == FALSE &&
2176               i < length - 1)
2177             {
2178               g_warning ("There is a discrepency between the sort model and the child model.");
2179               return;
2180             }
2181         }
2182       g_array_append_val (new_level->array, sort_elt);
2183     }
2184
2185   /* sort level */
2186   gtk_tree_model_sort_sort_level (tree_model_sort, new_level,
2187                                   FALSE, FALSE);
2188 }
2189
2190 static void
2191 gtk_tree_model_sort_free_level (GtkTreeModelSort *tree_model_sort,
2192                                 SortLevel        *sort_level)
2193 {
2194   gint i;
2195
2196   g_assert (sort_level);
2197
2198   if (sort_level->ref_count == 0)
2199     {
2200       SortLevel *parent_level = sort_level->parent_level;
2201       SortElt *parent_elt = sort_level->parent_elt;
2202
2203       do
2204         {
2205           if (parent_elt)
2206             parent_elt->zero_ref_count--;
2207           else
2208             tree_model_sort->zero_ref_count--;
2209
2210           if (parent_level)
2211             {
2212               parent_elt = parent_level->parent_elt;
2213               parent_level = parent_level->parent_level;
2214             }
2215         }
2216       while (parent_level);
2217     }
2218
2219   for (i = 0; i < sort_level->array->len; i++)
2220     {
2221       if (g_array_index (sort_level->array, SortElt, i).children)
2222         gtk_tree_model_sort_free_level (tree_model_sort,
2223                                         SORT_LEVEL(g_array_index (sort_level->array, SortElt, i).children));
2224     }
2225
2226   if (sort_level->parent_elt)
2227     sort_level->parent_elt->children = NULL;
2228   else
2229     tree_model_sort->root = NULL;
2230
2231   g_array_free (sort_level->array, TRUE);
2232   sort_level->array = NULL;
2233
2234   g_free (sort_level);
2235   sort_level = NULL;
2236 }
2237
2238 static void
2239 gtk_tree_model_sort_increment_stamp (GtkTreeModelSort *tree_model_sort)
2240 {
2241   do
2242     {
2243       tree_model_sort->stamp++;
2244     }
2245   while (tree_model_sort->stamp == 0);
2246
2247   gtk_tree_model_sort_clear_cache (tree_model_sort);
2248 }
2249
2250 static void
2251 gtk_tree_model_sort_clear_cache_helper (GtkTreeModelSort *tree_model_sort,
2252                                         SortLevel        *level)
2253 {
2254   gint i;
2255
2256   g_assert (level != NULL);
2257
2258   for (i = 0; i < level->array->len; i++)
2259     {
2260       if (g_array_index (level->array, SortElt, i).zero_ref_count > 0)
2261         gtk_tree_model_sort_clear_cache_helper (tree_model_sort, g_array_index (level->array, SortElt, i).children);
2262     }
2263
2264   if (level->ref_count == 0 && level != tree_model_sort->root)
2265     gtk_tree_model_sort_free_level (tree_model_sort, level);
2266 }
2267
2268 /**
2269  * gtk_tree_model_sort_reset_default_sort_func:
2270  * @tree_model_sort: A #GtkTreeModelSort
2271  *
2272  * This resets the default sort function to be in the 'unsorted' state.  That
2273  * is, it is in the same order as the child model. It will re-sort the model
2274  * to be in the same order as the child model only if the #GtkTreeModelSort
2275  * is in 'unsorted' state.
2276  **/
2277 void
2278 gtk_tree_model_sort_reset_default_sort_func (GtkTreeModelSort *tree_model_sort)
2279 {
2280   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2281
2282   if (tree_model_sort->default_sort_destroy)
2283     {
2284       GtkDestroyNotify d = tree_model_sort->default_sort_destroy;
2285
2286       tree_model_sort->default_sort_destroy = NULL;
2287       d (tree_model_sort->default_sort_data);
2288     }
2289
2290   tree_model_sort->default_sort_func = NO_SORT_FUNC;
2291   tree_model_sort->default_sort_data = NULL;
2292   tree_model_sort->default_sort_destroy = NULL;
2293
2294   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2295     gtk_tree_model_sort_sort (tree_model_sort);
2296   tree_model_sort->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
2297 }
2298
2299 /**
2300  * gtk_tree_model_sort_clear_cache:
2301  * @tree_model_sort: A #GtkTreeModelSort
2302  *
2303  * This function should almost never be called.  It clears the @tree_model_sort
2304  * of any cached iterators that haven't been reffed with
2305  * gtk_tree_model_ref_node().  This might be useful if the child model being
2306  * sorted is static (and doesn't change often) and there has been a lot of
2307  * unreffed access to nodes.  As a side effect of this function, all unreffed
2308  * iters will be invalid.
2309  **/
2310 void
2311 gtk_tree_model_sort_clear_cache (GtkTreeModelSort *tree_model_sort)
2312 {
2313   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2314
2315   if (tree_model_sort->zero_ref_count)
2316     gtk_tree_model_sort_clear_cache_helper (tree_model_sort, (SortLevel *)tree_model_sort->root);
2317 }
2318
2319 static gboolean
2320 gtk_tree_model_sort_iter_is_valid_helper (GtkTreeIter *iter,
2321                                           SortLevel   *level)
2322 {
2323   gint i;
2324
2325   for (i = 0; i < level->array->len; i++)
2326     {
2327       SortElt *elt = &g_array_index (level->array, SortElt, i);
2328
2329       if (iter->user_data == level && iter->user_data2 == elt)
2330         return TRUE;
2331
2332       if (elt->children)
2333         if (gtk_tree_model_sort_iter_is_valid_helper (iter, elt->children))
2334           return TRUE;
2335     }
2336
2337   return FALSE;
2338 }
2339
2340 /**
2341  * gtk_tree_model_sort_iter_is_valid:
2342  * @tree_model_sort: A #GtkTreeModelSort.
2343  * @iter: A #GtkTreeIter.
2344  *
2345  * WARNING: This function is slow. Only use it for debugging and/or testing
2346  * purposes.
2347  *
2348  * Checks if the given iter is a valid iter for this #GtkTreeModelSort.
2349  *
2350  * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
2351  **/
2352 gboolean
2353 gtk_tree_model_sort_iter_is_valid (GtkTreeModelSort *tree_model_sort,
2354                                    GtkTreeIter      *iter)
2355 {
2356   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), FALSE);
2357   g_return_val_if_fail (iter != NULL, FALSE);
2358
2359   if (!VALID_ITER (iter, tree_model_sort))
2360     return FALSE;
2361
2362   return gtk_tree_model_sort_iter_is_valid_helper (iter,
2363                                                    tree_model_sort->root);
2364 }