| /* GLIB - Library of useful routines for C programming |
| * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald |
| * |
| * This library is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU Lesser General Public |
| * License as published by the Free Software Foundation; either |
| * version 2 of the License, or (at your option) any later version. |
| * |
| * This library is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * Lesser General Public License for more details. |
| * |
| * You should have received a copy of the GNU Lesser General Public |
| * License along with this library; if not, write to the |
| * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| * Boston, MA 02111-1307, USA. |
| */ |
| |
| /* |
| * Modified by the GLib Team and others 1997-2000. See the AUTHORS |
| * file for a list of people on the GLib Team. See the ChangeLog |
| * files for a list of changes. These files are distributed with |
| * GLib at ftp://ftp.gtk.org/pub/gtk/. |
| */ |
| |
| /* |
| * MT safe |
| */ |
| |
| #include "config.h" |
| |
| #include "glib.h" |
| #include "galias.h" |
| |
| |
| void g_list_push_allocator (gpointer dummy) { /* present for binary compat only */ } |
| void g_list_pop_allocator (void) { /* present for binary compat only */ } |
| |
| #define _g_list_alloc() g_slice_new (GList) |
| #define _g_list_alloc0() g_slice_new0 (GList) |
| #define _g_list_free1(list) g_slice_free (GList, list) |
| |
| GList* |
| g_list_alloc (void) |
| { |
| return _g_list_alloc0 (); |
| } |
| |
| void |
| g_list_free (GList *list) |
| { |
| g_slice_free_chain (GList, list, next); |
| } |
| |
| void |
| g_list_free_1 (GList *list) |
| { |
| _g_list_free1 (list); |
| } |
| |
| GList* |
| g_list_append (GList *list, |
| gpointer data) |
| { |
| GList *new_list; |
| GList *last; |
| |
| new_list = _g_list_alloc (); |
| new_list->data = data; |
| new_list->next = NULL; |
| |
| if (list) |
| { |
| last = g_list_last (list); |
| /* g_assert (last != NULL); */ |
| last->next = new_list; |
| new_list->prev = last; |
| |
| return list; |
| } |
| else |
| { |
| new_list->prev = NULL; |
| return new_list; |
| } |
| } |
| |
| GList* |
| g_list_prepend (GList *list, |
| gpointer data) |
| { |
| GList *new_list; |
| |
| new_list = _g_list_alloc (); |
| new_list->data = data; |
| new_list->next = list; |
| |
| if (list) |
| { |
| new_list->prev = list->prev; |
| if (list->prev) |
| list->prev->next = new_list; |
| list->prev = new_list; |
| } |
| else |
| new_list->prev = NULL; |
| |
| return new_list; |
| } |
| |
| GList* |
| g_list_insert (GList *list, |
| gpointer data, |
| gint position) |
| { |
| GList *new_list; |
| GList *tmp_list; |
| |
| if (position < 0) |
| return g_list_append (list, data); |
| else if (position == 0) |
| return g_list_prepend (list, data); |
| |
| tmp_list = g_list_nth (list, position); |
| if (!tmp_list) |
| return g_list_append (list, data); |
| |
| new_list = _g_list_alloc (); |
| new_list->data = data; |
| new_list->prev = tmp_list->prev; |
| if (tmp_list->prev) |
| tmp_list->prev->next = new_list; |
| new_list->next = tmp_list; |
| tmp_list->prev = new_list; |
| |
| if (tmp_list == list) |
| return new_list; |
| else |
| return list; |
| } |
| |
| GList* |
| g_list_insert_before (GList *list, |
| GList *sibling, |
| gpointer data) |
| { |
| if (!list) |
| { |
| list = g_list_alloc (); |
| list->data = data; |
| g_return_val_if_fail (sibling == NULL, list); |
| return list; |
| } |
| else if (sibling) |
| { |
| GList *node; |
| |
| node = _g_list_alloc (); |
| node->data = data; |
| node->prev = sibling->prev; |
| node->next = sibling; |
| sibling->prev = node; |
| if (node->prev) |
| { |
| node->prev->next = node; |
| return list; |
| } |
| else |
| { |
| g_return_val_if_fail (sibling == list, node); |
| return node; |
| } |
| } |
| else |
| { |
| GList *last; |
| |
| last = list; |
| while (last->next) |
| last = last->next; |
| |
| last->next = _g_list_alloc (); |
| last->next->data = data; |
| last->next->prev = last; |
| last->next->next = NULL; |
| |
| return list; |
| } |
| } |
| |
| GList * |
| g_list_concat (GList *list1, GList *list2) |
| { |
| GList *tmp_list; |
| |
| if (list2) |
| { |
| tmp_list = g_list_last (list1); |
| if (tmp_list) |
| tmp_list->next = list2; |
| else |
| list1 = list2; |
| list2->prev = tmp_list; |
| } |
| |
| return list1; |
| } |
| |
| GList* |
| g_list_remove (GList *list, |
| gconstpointer data) |
| { |
| GList *tmp; |
| |
| tmp = list; |
| while (tmp) |
| { |
| if (tmp->data != data) |
| tmp = tmp->next; |
| else |
| { |
| if (tmp->prev) |
| tmp->prev->next = tmp->next; |
| if (tmp->next) |
| tmp->next->prev = tmp->prev; |
| |
| if (list == tmp) |
| list = list->next; |
| |
| _g_list_free1 (tmp); |
| |
| break; |
| } |
| } |
| return list; |
| } |
| |
| GList* |
| g_list_remove_all (GList *list, |
| gconstpointer data) |
| { |
| GList *tmp = list; |
| |
| while (tmp) |
| { |
| if (tmp->data != data) |
| tmp = tmp->next; |
| else |
| { |
| GList *next = tmp->next; |
| |
| if (tmp->prev) |
| tmp->prev->next = next; |
| else |
| list = next; |
| if (next) |
| next->prev = tmp->prev; |
| |
| _g_list_free1 (tmp); |
| tmp = next; |
| } |
| } |
| return list; |
| } |
| |
| static inline GList* |
| _g_list_remove_link (GList *list, |
| GList *link) |
| { |
| if (link) |
| { |
| if (link->prev) |
| link->prev->next = link->next; |
| if (link->next) |
| link->next->prev = link->prev; |
| |
| if (link == list) |
| list = list->next; |
| |
| link->next = NULL; |
| link->prev = NULL; |
| } |
| |
| return list; |
| } |
| |
| GList* |
| g_list_remove_link (GList *list, |
| GList *link) |
| { |
| return _g_list_remove_link (list, link); |
| } |
| |
| GList* |
| g_list_delete_link (GList *list, |
| GList *link) |
| { |
| list = _g_list_remove_link (list, link); |
| _g_list_free1 (link); |
| |
| return list; |
| } |
| |
| GList* |
| g_list_copy (GList *list) |
| { |
| GList *new_list = NULL; |
| |
| if (list) |
| { |
| GList *last; |
| |
| new_list = _g_list_alloc (); |
| new_list->data = list->data; |
| new_list->prev = NULL; |
| last = new_list; |
| list = list->next; |
| while (list) |
| { |
| last->next = _g_list_alloc (); |
| last->next->prev = last; |
| last = last->next; |
| last->data = list->data; |
| list = list->next; |
| } |
| last->next = NULL; |
| } |
| |
| return new_list; |
| } |
| |
| GList* |
| g_list_reverse (GList *list) |
| { |
| GList *last; |
| |
| last = NULL; |
| while (list) |
| { |
| last = list; |
| list = last->next; |
| last->next = last->prev; |
| last->prev = list; |
| } |
| |
| return last; |
| } |
| |
| GList* |
| g_list_nth (GList *list, |
| guint n) |
| { |
| while ((n-- > 0) && list) |
| list = list->next; |
| |
| return list; |
| } |
| |
| GList* |
| g_list_nth_prev (GList *list, |
| guint n) |
| { |
| while ((n-- > 0) && list) |
| list = list->prev; |
| |
| return list; |
| } |
| |
| gpointer |
| g_list_nth_data (GList *list, |
| guint n) |
| { |
| while ((n-- > 0) && list) |
| list = list->next; |
| |
| return list ? list->data : NULL; |
| } |
| |
| GList* |
| g_list_find (GList *list, |
| gconstpointer data) |
| { |
| while (list) |
| { |
| if (list->data == data) |
| break; |
| list = list->next; |
| } |
| |
| return list; |
| } |
| |
| GList* |
| g_list_find_custom (GList *list, |
| gconstpointer data, |
| GCompareFunc func) |
| { |
| g_return_val_if_fail (func != NULL, list); |
| |
| while (list) |
| { |
| if (! func (list->data, data)) |
| return list; |
| list = list->next; |
| } |
| |
| return NULL; |
| } |
| |
| |
| gint |
| g_list_position (GList *list, |
| GList *link) |
| { |
| gint i; |
| |
| i = 0; |
| while (list) |
| { |
| if (list == link) |
| return i; |
| i++; |
| list = list->next; |
| } |
| |
| return -1; |
| } |
| |
| gint |
| g_list_index (GList *list, |
| gconstpointer data) |
| { |
| gint i; |
| |
| i = 0; |
| while (list) |
| { |
| if (list->data == data) |
| return i; |
| i++; |
| list = list->next; |
| } |
| |
| return -1; |
| } |
| |
| GList* |
| g_list_last (GList *list) |
| { |
| if (list) |
| { |
| while (list->next) |
| list = list->next; |
| } |
| |
| return list; |
| } |
| |
| GList* |
| g_list_first (GList *list) |
| { |
| if (list) |
| { |
| while (list->prev) |
| list = list->prev; |
| } |
| |
| return list; |
| } |
| |
| guint |
| g_list_length (GList *list) |
| { |
| guint length; |
| |
| length = 0; |
| while (list) |
| { |
| length++; |
| list = list->next; |
| } |
| |
| return length; |
| } |
| |
| void |
| g_list_foreach (GList *list, |
| GFunc func, |
| gpointer user_data) |
| { |
| while (list) |
| { |
| GList *next = list->next; |
| (*func) (list->data, user_data); |
| list = next; |
| } |
| } |
| |
| static GList* |
| g_list_insert_sorted_real (GList *list, |
| gpointer data, |
| GFunc func, |
| gpointer user_data) |
| { |
| GList *tmp_list = list; |
| GList *new_list; |
| gint cmp; |
| |
| g_return_val_if_fail (func != NULL, list); |
| |
| if (!list) |
| { |
| new_list = _g_list_alloc0 (); |
| new_list->data = data; |
| return new_list; |
| } |
| |
| cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data); |
| |
| while ((tmp_list->next) && (cmp > 0)) |
| { |
| tmp_list = tmp_list->next; |
| |
| cmp = ((GCompareDataFunc) func) (data, tmp_list->data, user_data); |
| } |
| |
| new_list = _g_list_alloc0 (); |
| new_list->data = data; |
| |
| if ((!tmp_list->next) && (cmp > 0)) |
| { |
| tmp_list->next = new_list; |
| new_list->prev = tmp_list; |
| return list; |
| } |
| |
| if (tmp_list->prev) |
| { |
| tmp_list->prev->next = new_list; |
| new_list->prev = tmp_list->prev; |
| } |
| new_list->next = tmp_list; |
| tmp_list->prev = new_list; |
| |
| if (tmp_list == list) |
| return new_list; |
| else |
| return list; |
| } |
| |
| GList* |
| g_list_insert_sorted (GList *list, |
| gpointer data, |
| GCompareFunc func) |
| { |
| return g_list_insert_sorted_real (list, data, (GFunc) func, NULL); |
| } |
| |
| GList* |
| g_list_insert_sorted_with_data (GList *list, |
| gpointer data, |
| GCompareDataFunc func, |
| gpointer user_data) |
| { |
| return g_list_insert_sorted_real (list, data, (GFunc) func, user_data); |
| } |
| |
| static GList * |
| g_list_sort_merge (GList *l1, |
| GList *l2, |
| GFunc compare_func, |
| gpointer user_data) |
| { |
| GList list, *l, *lprev; |
| gint cmp; |
| |
| l = &list; |
| lprev = NULL; |
| |
| while (l1 && l2) |
| { |
| cmp = ((GCompareDataFunc) compare_func) (l1->data, l2->data, user_data); |
| |
| if (cmp <= 0) |
| { |
| l->next = l1; |
| l1 = l1->next; |
| } |
| else |
| { |
| l->next = l2; |
| l2 = l2->next; |
| } |
| l = l->next; |
| l->prev = lprev; |
| lprev = l; |
| } |
| l->next = l1 ? l1 : l2; |
| l->next->prev = l; |
| |
| return list.next; |
| } |
| |
| static GList* |
| g_list_sort_real (GList *list, |
| GFunc compare_func, |
| gpointer user_data) |
| { |
| GList *l1, *l2; |
| |
| if (!list) |
| return NULL; |
| if (!list->next) |
| return list; |
| |
| l1 = list; |
| l2 = list->next; |
| |
| while ((l2 = l2->next) != NULL) |
| { |
| if ((l2 = l2->next) == NULL) |
| break; |
| l1 = l1->next; |
| } |
| l2 = l1->next; |
| l1->next = NULL; |
| |
| return g_list_sort_merge (g_list_sort_real (list, compare_func, user_data), |
| g_list_sort_real (l2, compare_func, user_data), |
| compare_func, |
| user_data); |
| } |
| |
| GList * |
| g_list_sort (GList *list, |
| GCompareFunc compare_func) |
| { |
| return g_list_sort_real (list, (GFunc) compare_func, NULL); |
| |
| } |
| |
| GList * |
| g_list_sort_with_data (GList *list, |
| GCompareDataFunc compare_func, |
| gpointer user_data) |
| { |
| return g_list_sort_real (list, (GFunc) compare_func, user_data); |
| } |
| |
| #define __G_LIST_C__ |
| #include "galiasdef.c" |