1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
19 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
20 * file for a list of people on the GLib Team. See the ChangeLog
21 * files for a list of changes. These files are distributed with
22 * GLib at ftp://ftp.gtk.org/pub/gtk/.
39 #include "gtestutils.h"
41 #include "gmessages.h"
48 * @short_description: arrays of arbitrary elements which grow
49 * automatically as elements are added
51 * Arrays are similar to standard C arrays, except that they grow
52 * automatically as elements are added.
54 * Array elements can be of any size (though all elements of one array
55 * are the same size), and the array can be automatically cleared to
56 * '0's and zero-terminated.
58 * To create a new array use g_array_new().
60 * To add elements to an array, use g_array_append_val(),
61 * g_array_append_vals(), g_array_prepend_val(), and
62 * g_array_prepend_vals().
64 * To access an element of an array, use g_array_index().
66 * To set the size of an array, use g_array_set_size().
68 * To free an array, use g_array_free().
70 * Here is an example that stores integers in a #GArray:
71 * |[<!-- language="C" -->
74 * /* We create a new array to store gint values.
75 * * We don't want it zero-terminated or cleared to 0's.
77 * garray = g_array_new (FALSE, FALSE, sizeof (gint));
78 * for (i = 0; i < 10000; i++)
79 * g_array_append_val (garray, i);
80 * for (i = 0; i < 10000; i++)
81 * if (g_array_index (garray, gint, i) != i)
82 * g_print ("ERROR: got %d instead of %d\n",
83 * g_array_index (garray, gint, i), i);
84 * g_array_free (garray, TRUE);
88 #define MIN_ARRAY_SIZE 16
90 typedef struct _GRealArray GRealArray;
94 * @data: a pointer to the element data. The data may be moved as
95 * elements are added to the #GArray.
96 * @len: the number of elements in the #GArray not including the
97 * possible terminating zero element.
99 * Contains the public fields of a GArray.
107 guint zero_terminated : 1;
110 GDestroyNotify clear_func;
116 * @t: the type of the elements
117 * @i: the index of the element to return
119 * Returns the element of a #GArray at the given index. The return
120 * value is cast to the given type.
122 * This example gets a pointer to an element in a #GArray:
123 * |[<!-- language="C" -->
124 * EDayViewEvent *event;
125 * /* This gets a pointer to the 4th element
126 * * in the array of EDayViewEvent structs.
128 * event = &g_array_index (events, EDayViewEvent, 3);
131 * Returns: the element of the #GArray at the index given by @i
134 #define g_array_elt_len(array,i) ((array)->elt_size * (i))
135 #define g_array_elt_pos(array,i) ((array)->data + g_array_elt_len((array),(i)))
136 #define g_array_elt_zero(array, pos, len) \
137 (memset (g_array_elt_pos ((array), pos), 0, g_array_elt_len ((array), len)))
138 #define g_array_zero_terminate(array) G_STMT_START{ \
139 if ((array)->zero_terminated) \
140 g_array_elt_zero ((array), (array)->len, 1); \
143 static guint g_nearest_pow (gint num) G_GNUC_CONST;
144 static void g_array_maybe_expand (GRealArray *array,
149 * @zero_terminated: %TRUE if the array should have an extra element at
150 * the end which is set to 0
151 * @clear_: %TRUE if #GArray elements should be automatically cleared
152 * to 0 when they are allocated
153 * @element_size: the size of each element in bytes
155 * Creates a new #GArray with a reference count of 1.
157 * Returns: the new #GArray
160 g_array_new (gboolean zero_terminated,
164 g_return_val_if_fail (elt_size > 0, NULL);
166 return g_array_sized_new (zero_terminated, clear, elt_size, 0);
171 * @zero_terminated: %TRUE if the array should have an extra element at
172 * the end with all bits cleared
173 * @clear_: %TRUE if all bits in the array should be cleared to 0 on
175 * @element_size: size of each element in the array
176 * @reserved_size: number of elements preallocated
178 * Creates a new #GArray with @reserved_size elements preallocated and
179 * a reference count of 1. This avoids frequent reallocation, if you
180 * are going to add many elements to the array. Note however that the
181 * size of the array is still 0.
183 * Returns: the new #GArray
186 g_array_sized_new (gboolean zero_terminated,
193 g_return_val_if_fail (elt_size > 0, NULL);
195 array = g_slice_new (GRealArray);
200 array->zero_terminated = (zero_terminated ? 1 : 0);
201 array->clear = (clear ? 1 : 0);
202 array->elt_size = elt_size;
203 array->ref_count = 1;
204 array->clear_func = NULL;
206 if (array->zero_terminated || reserved_size != 0)
208 g_array_maybe_expand (array, reserved_size);
209 g_array_zero_terminate(array);
212 return (GArray*) array;
216 * g_array_set_clear_func:
218 * @clear_func: a function to clear an element of @array
220 * Sets a function to clear an element of @array.
222 * The @clear_func will be called when an element in the array
223 * data segment is removed and when the array is freed and data
224 * segment is deallocated as well.
226 * Note that in contrast with other uses of #GDestroyNotify
227 * functions, @clear_func is expected to clear the contents of
228 * the array element it is given, but not free the element itself.
233 g_array_set_clear_func (GArray *array,
234 GDestroyNotify clear_func)
236 GRealArray *rarray = (GRealArray *) array;
238 g_return_if_fail (array != NULL);
240 rarray->clear_func = clear_func;
247 * Atomically increments the reference count of @array by one.
248 * This function is MT-safe and may be called from any thread.
250 * Returns: The passed in #GArray
255 g_array_ref (GArray *array)
257 GRealArray *rarray = (GRealArray*) array;
258 g_return_val_if_fail (array, NULL);
260 g_atomic_int_inc (&rarray->ref_count);
267 FREE_SEGMENT = 1 << 0,
268 PRESERVE_WRAPPER = 1 << 1
271 static gchar *array_free (GRealArray *, ArrayFreeFlags);
277 * Atomically decrements the reference count of @array by one. If the
278 * reference count drops to 0, all memory allocated by the array is
279 * released. This function is MT-safe and may be called from any
285 g_array_unref (GArray *array)
287 GRealArray *rarray = (GRealArray*) array;
288 g_return_if_fail (array);
290 if (g_atomic_int_dec_and_test (&rarray->ref_count))
291 array_free (rarray, FREE_SEGMENT);
295 * g_array_get_element_size:
298 * Gets the size of the elements in @array.
300 * Returns: Size of each element, in bytes
305 g_array_get_element_size (GArray *array)
307 GRealArray *rarray = (GRealArray*) array;
309 g_return_val_if_fail (array, 0);
311 return rarray->elt_size;
317 * @free_segment: if %TRUE the actual element data is freed as well
319 * Frees the memory allocated for the #GArray. If @free_segment is
320 * %TRUE it frees the memory block holding the elements as well and
321 * also each element if @array has a @element_free_func set. Pass
322 * %FALSE if you want to free the #GArray wrapper but preserve the
323 * underlying array for use elsewhere. If the reference count of @array
324 * is greater than one, the #GArray wrapper is preserved but the size
325 * of @array will be set to zero.
327 * If array elements contain dynamically-allocated memory, they should
328 * be freed separately.
330 * Returns: the element data if @free_segment is %FALSE, otherwise
331 * %NULL. The element data should be freed using g_free().
334 g_array_free (GArray *farray,
335 gboolean free_segment)
337 GRealArray *array = (GRealArray*) farray;
338 ArrayFreeFlags flags;
340 g_return_val_if_fail (array, NULL);
342 flags = (free_segment ? FREE_SEGMENT : 0);
344 /* if others are holding a reference, preserve the wrapper but do free/return the data */
345 if (!g_atomic_int_dec_and_test (&array->ref_count))
346 flags |= PRESERVE_WRAPPER;
348 return array_free (array, flags);
352 array_free (GRealArray *array,
353 ArrayFreeFlags flags)
357 if (flags & FREE_SEGMENT)
359 if (array->clear_func != NULL)
363 for (i = 0; i < array->len; i++)
364 array->clear_func (g_array_elt_pos (array, i));
367 g_free (array->data);
371 segment = (gchar*) array->data;
373 if (flags & PRESERVE_WRAPPER)
381 g_slice_free1 (sizeof (GRealArray), array);
388 * g_array_append_vals:
390 * @data: a pointer to the elements to append to the end of the array
391 * @len: the number of elements to append
393 * Adds @len elements onto the end of the array.
395 * Returns: the #GArray
398 * g_array_append_val:
400 * @v: the value to append to the #GArray
402 * Adds the value on to the end of the array. The array will grow in
403 * size automatically if necessary.
405 * g_array_append_val() is a macro which uses a reference to the value
406 * parameter @v. This means that you cannot use it with literal values
407 * such as "27". You must use variables.
409 * Returns: the #GArray
412 g_array_append_vals (GArray *farray,
416 GRealArray *array = (GRealArray*) farray;
418 g_return_val_if_fail (array, NULL);
420 g_array_maybe_expand (array, len);
422 memcpy (g_array_elt_pos (array, array->len), data,
423 g_array_elt_len (array, len));
427 g_array_zero_terminate (array);
433 * g_array_prepend_vals:
435 * @data: a pointer to the elements to prepend to the start of the array
436 * @len: the number of elements to prepend
438 * Adds @len elements onto the start of the array.
440 * This operation is slower than g_array_append_vals() since the
441 * existing elements in the array have to be moved to make space for
444 * Returns: the #GArray
447 * g_array_prepend_val:
449 * @v: the value to prepend to the #GArray
451 * Adds the value on to the start of the array. The array will grow in
452 * size automatically if necessary.
454 * This operation is slower than g_array_append_val() since the
455 * existing elements in the array have to be moved to make space for
458 * g_array_prepend_val() is a macro which uses a reference to the value
459 * parameter @v. This means that you cannot use it with literal values
460 * such as "27". You must use variables.
462 * Returns: the #GArray
465 g_array_prepend_vals (GArray *farray,
469 GRealArray *array = (GRealArray*) farray;
471 g_return_val_if_fail (array, NULL);
473 g_array_maybe_expand (array, len);
475 memmove (g_array_elt_pos (array, len), g_array_elt_pos (array, 0),
476 g_array_elt_len (array, array->len));
478 memcpy (g_array_elt_pos (array, 0), data, g_array_elt_len (array, len));
482 g_array_zero_terminate (array);
488 * g_array_insert_vals:
490 * @index_: the index to place the elements at
491 * @data: a pointer to the elements to insert
492 * @len: the number of elements to insert
494 * Inserts @len elements into a #GArray at the given index.
496 * Returns: the #GArray
499 * g_array_insert_val:
501 * @i: the index to place the element at
502 * @v: the value to insert into the array
504 * Inserts an element into an array at the given index.
506 * g_array_insert_val() is a macro which uses a reference to the value
507 * parameter @v. This means that you cannot use it with literal values
508 * such as "27". You must use variables.
510 * Returns: the #GArray
513 g_array_insert_vals (GArray *farray,
518 GRealArray *array = (GRealArray*) farray;
520 g_return_val_if_fail (array, NULL);
522 g_array_maybe_expand (array, len);
524 memmove (g_array_elt_pos (array, len + index_),
525 g_array_elt_pos (array, index_),
526 g_array_elt_len (array, array->len - index_));
528 memcpy (g_array_elt_pos (array, index_), data, g_array_elt_len (array, len));
532 g_array_zero_terminate (array);
540 * @length: the new size of the #GArray
542 * Sets the size of the array, expanding it if necessary. If the array
543 * was created with @clear_ set to %TRUE, the new elements are set to 0.
545 * Returns: the #GArray
548 g_array_set_size (GArray *farray,
551 GRealArray *array = (GRealArray*) farray;
553 g_return_val_if_fail (array, NULL);
555 if (length > array->len)
557 g_array_maybe_expand (array, length - array->len);
560 g_array_elt_zero (array, array->len, length - array->len);
562 else if (length < array->len)
563 g_array_remove_range (farray, length, array->len - length);
567 g_array_zero_terminate (array);
573 * g_array_remove_index:
575 * @index_: the index of the element to remove
577 * Removes the element at the given index from a #GArray. The following
578 * elements are moved down one place.
580 * Returns: the #GArray
583 g_array_remove_index (GArray *farray,
586 GRealArray* array = (GRealArray*) farray;
588 g_return_val_if_fail (array, NULL);
590 g_return_val_if_fail (index_ < array->len, NULL);
592 if (array->clear_func != NULL)
593 array->clear_func (g_array_elt_pos (array, index_));
595 if (index_ != array->len - 1)
596 memmove (g_array_elt_pos (array, index_),
597 g_array_elt_pos (array, index_ + 1),
598 g_array_elt_len (array, array->len - index_ - 1));
602 if (G_UNLIKELY (g_mem_gc_friendly))
603 g_array_elt_zero (array, array->len, 1);
605 g_array_zero_terminate (array);
611 * g_array_remove_index_fast:
613 * @index_: the index of the element to remove
615 * Removes the element at the given index from a #GArray. The last
616 * element in the array is used to fill in the space, so this function
617 * does not preserve the order of the #GArray. But it is faster than
618 * g_array_remove_index().
620 * Returns: the #GArray
623 g_array_remove_index_fast (GArray *farray,
626 GRealArray* array = (GRealArray*) farray;
628 g_return_val_if_fail (array, NULL);
630 g_return_val_if_fail (index_ < array->len, NULL);
632 if (array->clear_func != NULL)
633 array->clear_func (g_array_elt_pos (array, index_));
635 if (index_ != array->len - 1)
636 memcpy (g_array_elt_pos (array, index_),
637 g_array_elt_pos (array, array->len - 1),
638 g_array_elt_len (array, 1));
642 if (G_UNLIKELY (g_mem_gc_friendly))
643 g_array_elt_zero (array, array->len, 1);
645 g_array_zero_terminate (array);
651 * g_array_remove_range:
653 * @index_: the index of the first element to remove
654 * @length: the number of elements to remove
656 * Removes the given number of elements starting at the given index
657 * from a #GArray. The following elements are moved to close the gap.
659 * Returns: the #GArray
664 g_array_remove_range (GArray *farray,
668 GRealArray *array = (GRealArray*) farray;
670 g_return_val_if_fail (array, NULL);
671 g_return_val_if_fail (index_ < array->len, NULL);
672 g_return_val_if_fail (index_ + length <= array->len, NULL);
674 if (array->clear_func != NULL)
678 for (i = 0; i < length; i++)
679 array->clear_func (g_array_elt_pos (array, index_ + i));
682 if (index_ + length != array->len)
683 memmove (g_array_elt_pos (array, index_),
684 g_array_elt_pos (array, index_ + length),
685 (array->len - (index_ + length)) * array->elt_size);
687 array->len -= length;
688 if (G_UNLIKELY (g_mem_gc_friendly))
689 g_array_elt_zero (array, array->len, length);
691 g_array_zero_terminate (array);
699 * @compare_func: comparison function
701 * Sorts a #GArray using @compare_func which should be a qsort()-style
702 * comparison function (returns less than zero for first arg is less
703 * than second arg, zero for equal, greater zero if first arg is
704 * greater than second arg).
706 * This is guaranteed to be a stable sort since version 2.32.
709 g_array_sort (GArray *farray,
710 GCompareFunc compare_func)
712 GRealArray *array = (GRealArray*) farray;
714 g_return_if_fail (array != NULL);
716 /* Don't use qsort as we want a guaranteed stable sort */
717 g_qsort_with_data (array->data,
720 (GCompareDataFunc)compare_func,
725 * g_array_sort_with_data:
727 * @compare_func: comparison function
728 * @user_data: data to pass to @compare_func
730 * Like g_array_sort(), but the comparison function receives an extra
731 * user data argument.
733 * This is guaranteed to be a stable sort since version 2.32.
735 * There used to be a comment here about making the sort stable by
736 * using the addresses of the elements in the comparison function.
737 * This did not actually work, so any such code should be removed.
740 g_array_sort_with_data (GArray *farray,
741 GCompareDataFunc compare_func,
744 GRealArray *array = (GRealArray*) farray;
746 g_return_if_fail (array != NULL);
748 g_qsort_with_data (array->data,
755 /* Returns the smallest power of 2 greater than n, or n if
756 * such power does not fit in a guint
759 g_nearest_pow (gint num)
763 while (n < num && n > 0)
770 g_array_maybe_expand (GRealArray *array,
773 guint want_alloc = g_array_elt_len (array, array->len + len +
774 array->zero_terminated);
776 if (want_alloc > array->alloc)
778 want_alloc = g_nearest_pow (want_alloc);
779 want_alloc = MAX (want_alloc, MIN_ARRAY_SIZE);
781 array->data = g_realloc (array->data, want_alloc);
783 if (G_UNLIKELY (g_mem_gc_friendly))
784 memset (array->data + array->alloc, 0, want_alloc - array->alloc);
786 array->alloc = want_alloc;
791 * SECTION:arrays_pointer
792 * @title: Pointer Arrays
793 * @short_description: arrays of pointers to any type of data, which
794 * grow automatically as new elements are added
796 * Pointer Arrays are similar to Arrays but are used only for storing
799 * If you remove elements from the array, elements at the end of the
800 * array are moved into the space previously occupied by the removed
801 * element. This means that you should not rely on the index of particular
802 * elements remaining the same. You should also be careful when deleting
803 * elements while iterating over the array.
805 * To create a pointer array, use g_ptr_array_new().
807 * To add elements to a pointer array, use g_ptr_array_add().
809 * To remove elements from a pointer array, use g_ptr_array_remove(),
810 * g_ptr_array_remove_index() or g_ptr_array_remove_index_fast().
812 * To access an element of a pointer array, use g_ptr_array_index().
814 * To set the size of a pointer array, use g_ptr_array_set_size().
816 * To free a pointer array, use g_ptr_array_free().
818 * An example using a #GPtrArray:
819 * |[<!-- language="C" -->
821 * gchar *string1 = "one", *string2 = "two", *string3 = "three";
823 * gparray = g_ptr_array_new ();
824 * g_ptr_array_add (array, (gpointer) string1);
825 * g_ptr_array_add (array, (gpointer) string2);
826 * g_ptr_array_add (array, (gpointer) string3);
828 * if (g_ptr_array_index (array, 0) != (gpointer) string1)
829 * g_print ("ERROR: got %p instead of %p\n",
830 * g_ptr_array_index (array, 0), string1);
832 * g_ptr_array_free (array, TRUE);
836 typedef struct _GRealPtrArray GRealPtrArray;
840 * @pdata: points to the array of pointers, which may be moved when the
842 * @len: number of pointers in the array
844 * Contains the public fields of a pointer array.
846 struct _GRealPtrArray
852 GDestroyNotify element_free_func;
857 * @array: a #GPtrArray
858 * @index_: the index of the pointer to return
860 * Returns the pointer at the given index of the pointer array.
862 * This does not perform bounds checking on the given @index_,
863 * so you are responsible for checking it against the array length.
865 * Returns: the pointer at the given index
868 static void g_ptr_array_maybe_expand (GRealPtrArray *array,
874 * Creates a new #GPtrArray with a reference count of 1.
876 * Returns: the new #GPtrArray
879 g_ptr_array_new (void)
881 return g_ptr_array_sized_new (0);
885 * g_ptr_array_sized_new:
886 * @reserved_size: number of pointers preallocated
888 * Creates a new #GPtrArray with @reserved_size pointers preallocated
889 * and a reference count of 1. This avoids frequent reallocation, if
890 * you are going to add many pointers to the array. Note however that
891 * the size of the array is still 0.
893 * Returns: the new #GPtrArray
896 g_ptr_array_sized_new (guint reserved_size)
898 GRealPtrArray *array;
900 array = g_slice_new (GRealPtrArray);
905 array->ref_count = 1;
906 array->element_free_func = NULL;
908 if (reserved_size != 0)
909 g_ptr_array_maybe_expand (array, reserved_size);
911 return (GPtrArray*) array;
915 * g_ptr_array_new_with_free_func:
916 * @element_free_func: (allow-none): A function to free elements with
917 * destroy @array or %NULL
919 * Creates a new #GPtrArray with a reference count of 1 and use
920 * @element_free_func for freeing each element when the array is destroyed
921 * either via g_ptr_array_unref(), when g_ptr_array_free() is called with
922 * @free_segment set to %TRUE or when removing elements.
924 * Returns: A new #GPtrArray
929 g_ptr_array_new_with_free_func (GDestroyNotify element_free_func)
933 array = g_ptr_array_new ();
934 g_ptr_array_set_free_func (array, element_free_func);
940 * g_ptr_array_new_full:
941 * @reserved_size: number of pointers preallocated
942 * @element_free_func: (allow-none): A function to free elements with
943 * destroy @array or %NULL
945 * Creates a new #GPtrArray with @reserved_size pointers preallocated
946 * and a reference count of 1. This avoids frequent reallocation, if
947 * you are going to add many pointers to the array. Note however that
948 * the size of the array is still 0. It also set @element_free_func
949 * for freeing each element when the array is destroyed either via
950 * g_ptr_array_unref(), when g_ptr_array_free() is called with
951 * @free_segment set to %TRUE or when removing elements.
953 * Returns: A new #GPtrArray
958 g_ptr_array_new_full (guint reserved_size,
959 GDestroyNotify element_free_func)
963 array = g_ptr_array_sized_new (reserved_size);
964 g_ptr_array_set_free_func (array, element_free_func);
970 * g_ptr_array_set_free_func:
971 * @array: A #GPtrArray
972 * @element_free_func: (allow-none): A function to free elements with
973 * destroy @array or %NULL
975 * Sets a function for freeing each element when @array is destroyed
976 * either via g_ptr_array_unref(), when g_ptr_array_free() is called
977 * with @free_segment set to %TRUE or when removing elements.
982 g_ptr_array_set_free_func (GPtrArray *array,
983 GDestroyNotify element_free_func)
985 GRealPtrArray *rarray = (GRealPtrArray *)array;
987 g_return_if_fail (array);
989 rarray->element_free_func = element_free_func;
994 * @array: a #GPtrArray
996 * Atomically increments the reference count of @array by one.
997 * This function is thread-safe and may be called from any thread.
999 * Returns: The passed in #GPtrArray
1004 g_ptr_array_ref (GPtrArray *array)
1006 GRealPtrArray *rarray = (GRealPtrArray *)array;
1008 g_return_val_if_fail (array, NULL);
1010 g_atomic_int_inc (&rarray->ref_count);
1015 static gpointer *ptr_array_free (GPtrArray *, ArrayFreeFlags);
1018 * g_ptr_array_unref:
1019 * @array: A #GPtrArray
1021 * Atomically decrements the reference count of @array by one. If the
1022 * reference count drops to 0, the effect is the same as calling
1023 * g_ptr_array_free() with @free_segment set to %TRUE. This function
1024 * is MT-safe and may be called from any thread.
1029 g_ptr_array_unref (GPtrArray *array)
1031 GRealPtrArray *rarray = (GRealPtrArray *)array;
1033 g_return_if_fail (array);
1035 if (g_atomic_int_dec_and_test (&rarray->ref_count))
1036 ptr_array_free (array, FREE_SEGMENT);
1041 * @array: a #GPtrArray
1042 * @free_seg: if %TRUE the actual pointer array is freed as well
1044 * Frees the memory allocated for the #GPtrArray. If @free_seg is %TRUE
1045 * it frees the memory block holding the elements as well. Pass %FALSE
1046 * if you want to free the #GPtrArray wrapper but preserve the
1047 * underlying array for use elsewhere. If the reference count of @array
1048 * is greater than one, the #GPtrArray wrapper is preserved but the
1049 * size of @array will be set to zero.
1051 * If array contents point to dynamically-allocated memory, they should
1052 * be freed separately if @free_seg is %TRUE and no #GDestroyNotify
1053 * function has been set for @array.
1055 * Returns: the pointer array if @free_seg is %FALSE, otherwise %NULL.
1056 * The pointer array should be freed using g_free().
1059 g_ptr_array_free (GPtrArray *array,
1060 gboolean free_segment)
1062 GRealPtrArray *rarray = (GRealPtrArray *)array;
1063 ArrayFreeFlags flags;
1065 g_return_val_if_fail (rarray, NULL);
1067 flags = (free_segment ? FREE_SEGMENT : 0);
1069 /* if others are holding a reference, preserve the wrapper but
1070 * do free/return the data
1072 if (!g_atomic_int_dec_and_test (&rarray->ref_count))
1073 flags |= PRESERVE_WRAPPER;
1075 return ptr_array_free (array, flags);
1079 ptr_array_free (GPtrArray *array,
1080 ArrayFreeFlags flags)
1082 GRealPtrArray *rarray = (GRealPtrArray *)array;
1085 if (flags & FREE_SEGMENT)
1087 if (rarray->element_free_func != NULL)
1088 g_ptr_array_foreach (array, (GFunc) rarray->element_free_func, NULL);
1089 g_free (rarray->pdata);
1093 segment = rarray->pdata;
1095 if (flags & PRESERVE_WRAPPER)
1097 rarray->pdata = NULL;
1103 g_slice_free1 (sizeof (GRealPtrArray), rarray);
1110 g_ptr_array_maybe_expand (GRealPtrArray *array,
1113 if ((array->len + len) > array->alloc)
1115 guint old_alloc = array->alloc;
1116 array->alloc = g_nearest_pow (array->len + len);
1117 array->alloc = MAX (array->alloc, MIN_ARRAY_SIZE);
1118 array->pdata = g_realloc (array->pdata, sizeof (gpointer) * array->alloc);
1119 if (G_UNLIKELY (g_mem_gc_friendly))
1120 for ( ; old_alloc < array->alloc; old_alloc++)
1121 array->pdata [old_alloc] = NULL;
1126 * g_ptr_array_set_size:
1127 * @array: a #GPtrArray
1128 * @length: the new length of the pointer array
1130 * Sets the size of the array. When making the array larger,
1131 * newly-added elements will be set to %NULL. When making it smaller,
1132 * if @array has a non-%NULL #GDestroyNotify function then it will be
1133 * called for the removed elements.
1136 g_ptr_array_set_size (GPtrArray *array,
1139 GRealPtrArray *rarray = (GRealPtrArray *)array;
1141 g_return_if_fail (rarray);
1143 if (length > rarray->len)
1146 g_ptr_array_maybe_expand (rarray, (length - rarray->len));
1148 * memset (array->pdata + array->len, 0,
1149 * sizeof (gpointer) * (length - array->len));
1150 * to make it really portable. Remember (void*)NULL needn't be
1151 * bitwise zero. It of course is silly not to use memset (..,0,..).
1153 for (i = rarray->len; i < length; i++)
1154 rarray->pdata[i] = NULL;
1156 else if (length < rarray->len)
1157 g_ptr_array_remove_range (array, length, rarray->len - length);
1159 rarray->len = length;
1163 * g_ptr_array_remove_index:
1164 * @array: a #GPtrArray
1165 * @index_: the index of the pointer to remove
1167 * Removes the pointer at the given index from the pointer array.
1168 * The following elements are moved down one place. If @array has
1169 * a non-%NULL #GDestroyNotify function it is called for the removed
1172 * Returns: the pointer which was removed
1175 g_ptr_array_remove_index (GPtrArray *array,
1178 GRealPtrArray *rarray = (GRealPtrArray *)array;
1181 g_return_val_if_fail (rarray, NULL);
1183 g_return_val_if_fail (index_ < rarray->len, NULL);
1185 result = rarray->pdata[index_];
1187 if (rarray->element_free_func != NULL)
1188 rarray->element_free_func (rarray->pdata[index_]);
1190 if (index_ != rarray->len - 1)
1191 memmove (rarray->pdata + index_, rarray->pdata + index_ + 1,
1192 sizeof (gpointer) * (rarray->len - index_ - 1));
1196 if (G_UNLIKELY (g_mem_gc_friendly))
1197 rarray->pdata[rarray->len] = NULL;
1203 * g_ptr_array_remove_index_fast:
1204 * @array: a #GPtrArray
1205 * @index_: the index of the pointer to remove
1207 * Removes the pointer at the given index from the pointer array.
1208 * The last element in the array is used to fill in the space, so
1209 * this function does not preserve the order of the array. But it
1210 * is faster than g_ptr_array_remove_index(). If @array has a non-%NULL
1211 * #GDestroyNotify function it is called for the removed element.
1213 * Returns: the pointer which was removed
1216 g_ptr_array_remove_index_fast (GPtrArray *array,
1219 GRealPtrArray *rarray = (GRealPtrArray *)array;
1222 g_return_val_if_fail (rarray, NULL);
1224 g_return_val_if_fail (index_ < rarray->len, NULL);
1226 result = rarray->pdata[index_];
1228 if (rarray->element_free_func != NULL)
1229 rarray->element_free_func (rarray->pdata[index_]);
1231 if (index_ != rarray->len - 1)
1232 rarray->pdata[index_] = rarray->pdata[rarray->len - 1];
1236 if (G_UNLIKELY (g_mem_gc_friendly))
1237 rarray->pdata[rarray->len] = NULL;
1243 * g_ptr_array_remove_range:
1244 * @array: a @GPtrArray
1245 * @index_: the index of the first pointer to remove
1246 * @length: the number of pointers to remove
1248 * Removes the given number of pointers starting at the given index
1249 * from a #GPtrArray. The following elements are moved to close the
1250 * gap. If @array has a non-%NULL #GDestroyNotify function it is
1251 * called for the removed elements.
1253 * Returns: the @array
1258 g_ptr_array_remove_range (GPtrArray *array,
1262 GRealPtrArray *rarray = (GRealPtrArray *)array;
1265 g_return_val_if_fail (rarray != NULL, NULL);
1266 g_return_val_if_fail (index_ < rarray->len, NULL);
1267 g_return_val_if_fail (index_ + length <= rarray->len, NULL);
1269 if (rarray->element_free_func != NULL)
1271 for (n = index_; n < index_ + length; n++)
1272 rarray->element_free_func (rarray->pdata[n]);
1275 if (index_ + length != rarray->len)
1277 memmove (&rarray->pdata[index_],
1278 &rarray->pdata[index_ + length],
1279 (rarray->len - (index_ + length)) * sizeof (gpointer));
1282 rarray->len -= length;
1283 if (G_UNLIKELY (g_mem_gc_friendly))
1286 for (i = 0; i < length; i++)
1287 rarray->pdata[rarray->len + i] = NULL;
1294 * g_ptr_array_remove:
1295 * @array: a #GPtrArray
1296 * @data: the pointer to remove
1298 * Removes the first occurrence of the given pointer from the pointer
1299 * array. The following elements are moved down one place. If @array
1300 * has a non-%NULL #GDestroyNotify function it is called for the
1303 * It returns %TRUE if the pointer was removed, or %FALSE if the
1304 * pointer was not found.
1306 * Returns: %TRUE if the pointer is removed, %FALSE if the pointer
1307 * is not found in the array
1310 g_ptr_array_remove (GPtrArray *array,
1313 GRealPtrArray *rarray = (GRealPtrArray *)array;
1316 g_return_val_if_fail (array, FALSE);
1318 for (i = 0; i < array->len; i += 1)
1320 if (array->pdata[i] == data)
1322 g_ptr_array_remove_index (array, i);
1331 * g_ptr_array_remove_fast:
1332 * @array: a #GPtrArray
1333 * @data: the pointer to remove
1335 * Removes the first occurrence of the given pointer from the pointer
1336 * array. The last element in the array is used to fill in the space,
1337 * so this function does not preserve the order of the array. But it
1338 * is faster than g_ptr_array_remove(). If @array has a non-%NULL
1339 * #GDestroyNotify function it is called for the removed element.
1341 * It returns %TRUE if the pointer was removed, or %FALSE if the
1342 * pointer was not found.
1344 * Returns: %TRUE if the pointer was found in the array
1347 g_ptr_array_remove_fast (GPtrArray *array,
1350 GRealPtrArray *rarray = (GRealPtrArray *)array;
1353 g_return_val_if_fail (rarray, FALSE);
1355 for (i = 0; i < rarray->len; i += 1)
1357 if (rarray->pdata[i] == data)
1359 g_ptr_array_remove_index_fast (array, i);
1369 * @array: a #GPtrArray
1370 * @data: the pointer to add
1372 * Adds a pointer to the end of the pointer array. The array will grow
1373 * in size automatically if necessary.
1376 g_ptr_array_add (GPtrArray *array,
1379 GRealPtrArray *rarray = (GRealPtrArray *)array;
1381 g_return_if_fail (rarray);
1383 g_ptr_array_maybe_expand (rarray, 1);
1385 rarray->pdata[rarray->len++] = data;
1389 * g_ptr_array_insert:
1390 * @array: a #GPtrArray
1391 * @index_: the index to place the new element at, or -1 to append
1392 * @data: the pointer to add.
1394 * Inserts an element into the pointer array at the given index. The
1395 * array will grow in size automatically if necessary.
1400 g_ptr_array_insert (GPtrArray *array,
1404 GRealPtrArray *rarray = (GRealPtrArray *)array;
1406 g_return_if_fail (rarray);
1407 g_return_if_fail (index_ >= -1);
1408 g_return_if_fail (index_ <= (gint)rarray->len);
1410 g_ptr_array_maybe_expand (rarray, 1);
1413 index_ = rarray->len;
1415 if (index_ < rarray->len)
1416 memmove (&(rarray->pdata[index_ + 1]),
1417 &(rarray->pdata[index_]),
1418 (rarray->len - index_) * sizeof (gpointer));
1421 rarray->pdata[index_] = data;
1426 * @array: a #GPtrArray
1427 * @compare_func: comparison function
1429 * Sorts the array, using @compare_func which should be a qsort()-style
1430 * comparison function (returns less than zero for first arg is less
1431 * than second arg, zero for equal, greater than zero if irst arg is
1432 * greater than second arg).
1434 * Note that the comparison function for g_ptr_array_sort() doesn't
1435 * take the pointers from the array as arguments, it takes pointers to
1436 * the pointers in the array.
1438 * This is guaranteed to be a stable sort since version 2.32.
1441 g_ptr_array_sort (GPtrArray *array,
1442 GCompareFunc compare_func)
1444 g_return_if_fail (array != NULL);
1446 /* Don't use qsort as we want a guaranteed stable sort */
1447 g_qsort_with_data (array->pdata,
1450 (GCompareDataFunc)compare_func,
1455 * g_ptr_array_sort_with_data:
1456 * @array: a #GPtrArray
1457 * @compare_func: comparison function
1458 * @user_data: data to pass to @compare_func
1460 * Like g_ptr_array_sort(), but the comparison function has an extra
1461 * user data argument.
1463 * Note that the comparison function for g_ptr_array_sort_with_data()
1464 * doesn't take the pointers from the array as arguments, it takes
1465 * pointers to the pointers in the array.
1467 * This is guaranteed to be a stable sort since version 2.32.
1470 g_ptr_array_sort_with_data (GPtrArray *array,
1471 GCompareDataFunc compare_func,
1474 g_return_if_fail (array != NULL);
1476 g_qsort_with_data (array->pdata,
1484 * g_ptr_array_foreach:
1485 * @array: a #GPtrArray
1486 * @func: the function to call for each array element
1487 * @user_data: user data to pass to the function
1489 * Calls a function for each element of a #GPtrArray.
1494 g_ptr_array_foreach (GPtrArray *array,
1500 g_return_if_fail (array);
1502 for (i = 0; i < array->len; i++)
1503 (*func) (array->pdata[i], user_data);
1507 * SECTION:arrays_byte
1508 * @title: Byte Arrays
1509 * @short_description: arrays of bytes
1511 * #GByteArray is a mutable array of bytes based on #GArray, to provide arrays
1512 * of bytes which grow automatically as elements are added.
1514 * To create a new #GByteArray use g_byte_array_new(). To add elements to a
1515 * #GByteArray, use g_byte_array_append(), and g_byte_array_prepend().
1517 * To set the size of a #GByteArray, use g_byte_array_set_size().
1519 * To free a #GByteArray, use g_byte_array_free().
1521 * An example for using a #GByteArray:
1522 * |[<!-- language="C" -->
1523 * GByteArray *gbarray;
1526 * gbarray = g_byte_array_new ();
1527 * for (i = 0; i < 10000; i++)
1528 * g_byte_array_append (gbarray, (guint8*) "abcd", 4);
1530 * for (i = 0; i < 10000; i++)
1532 * g_assert (gbarray->data[4*i] == 'a');
1533 * g_assert (gbarray->data[4*i+1] == 'b');
1534 * g_assert (gbarray->data[4*i+2] == 'c');
1535 * g_assert (gbarray->data[4*i+3] == 'd');
1538 * g_byte_array_free (gbarray, TRUE);
1541 * See #GBytes if you are interested in an immutable object representing a
1542 * sequence of bytes.
1547 * @data: a pointer to the element data. The data may be moved as
1548 * elements are added to the #GByteArray
1549 * @len: the number of elements in the #GByteArray
1551 * Contains the public fields of a GByteArray.
1557 * Creates a new #GByteArray with a reference count of 1.
1559 * Returns: (transfer full): the new #GByteArray
1562 g_byte_array_new (void)
1564 return (GByteArray *)g_array_sized_new (FALSE, FALSE, 1, 0);
1568 * g_byte_array_new_take:
1569 * @data: (transfer full) (array length=len): byte data for the array
1570 * @len: length of @data
1572 * Create byte array containing the data. The data will be owned by the array
1573 * and will be freed with g_free(), i.e. it could be allocated using g_strdup().
1577 * Returns: (transfer full): a new #GByteArray
1580 g_byte_array_new_take (guint8 *data,
1586 array = g_byte_array_new ();
1587 real = (GRealArray *)array;
1588 g_assert (real->data == NULL);
1589 g_assert (real->len == 0);
1598 * g_byte_array_sized_new:
1599 * @reserved_size: number of bytes preallocated
1601 * Creates a new #GByteArray with @reserved_size bytes preallocated.
1602 * This avoids frequent reallocation, if you are going to add many
1603 * bytes to the array. Note however that the size of the array is still
1606 * Returns: the new #GByteArray
1609 g_byte_array_sized_new (guint reserved_size)
1611 return (GByteArray *)g_array_sized_new (FALSE, FALSE, 1, reserved_size);
1615 * g_byte_array_free:
1616 * @array: a #GByteArray
1617 * @free_segment: if %TRUE the actual byte data is freed as well
1619 * Frees the memory allocated by the #GByteArray. If @free_segment is
1620 * %TRUE it frees the actual byte data. If the reference count of
1621 * @array is greater than one, the #GByteArray wrapper is preserved but
1622 * the size of @array will be set to zero.
1624 * Returns: the element data if @free_segment is %FALSE, otherwise
1625 * %NULL. The element data should be freed using g_free().
1628 g_byte_array_free (GByteArray *array,
1629 gboolean free_segment)
1631 return (guint8 *)g_array_free ((GArray *)array, free_segment);
1635 * g_byte_array_free_to_bytes:
1636 * @array: (transfer full): a #GByteArray
1638 * Transfers the data from the #GByteArray into a new immutable #GBytes.
1640 * The #GByteArray is freed unless the reference count of @array is greater
1641 * than one, the #GByteArray wrapper is preserved but the size of @array
1642 * will be set to zero.
1644 * This is identical to using g_bytes_new_take() and g_byte_array_free()
1649 * Returns: (transfer full): a new immutable #GBytes representing same
1650 * byte data that was in the array
1653 g_byte_array_free_to_bytes (GByteArray *array)
1657 g_return_val_if_fail (array != NULL, NULL);
1659 length = array->len;
1660 return g_bytes_new_take (g_byte_array_free (array, FALSE), length);
1665 * @array: A #GByteArray
1667 * Atomically increments the reference count of @array by one.
1668 * This function is thread-safe and may be called from any thread.
1670 * Returns: The passed in #GByteArray
1675 g_byte_array_ref (GByteArray *array)
1677 return (GByteArray *)g_array_ref ((GArray *)array);
1681 * g_byte_array_unref:
1682 * @array: A #GByteArray
1684 * Atomically decrements the reference count of @array by one. If the
1685 * reference count drops to 0, all memory allocated by the array is
1686 * released. This function is thread-safe and may be called from any
1692 g_byte_array_unref (GByteArray *array)
1694 g_array_unref ((GArray *)array);
1698 * g_byte_array_append:
1699 * @array: a #GByteArray
1700 * @data: the byte data to be added
1701 * @len: the number of bytes to add
1703 * Adds the given bytes to the end of the #GByteArray.
1704 * The array will grow in size automatically if necessary.
1706 * Returns: the #GByteArray
1709 g_byte_array_append (GByteArray *array,
1713 g_array_append_vals ((GArray *)array, (guint8 *)data, len);
1719 * g_byte_array_prepend:
1720 * @array: a #GByteArray
1721 * @data: the byte data to be added
1722 * @len: the number of bytes to add
1724 * Adds the given data to the start of the #GByteArray.
1725 * The array will grow in size automatically if necessary.
1727 * Returns: the #GByteArray
1730 g_byte_array_prepend (GByteArray *array,
1734 g_array_prepend_vals ((GArray *)array, (guint8 *)data, len);
1740 * g_byte_array_set_size:
1741 * @array: a #GByteArray
1742 * @length: the new size of the #GByteArray
1744 * Sets the size of the #GByteArray, expanding it if necessary.
1746 * Returns: the #GByteArray
1749 g_byte_array_set_size (GByteArray *array,
1752 g_array_set_size ((GArray *)array, length);
1758 * g_byte_array_remove_index:
1759 * @array: a #GByteArray
1760 * @index_: the index of the byte to remove
1762 * Removes the byte at the given index from a #GByteArray.
1763 * The following bytes are moved down one place.
1765 * Returns: the #GByteArray
1768 g_byte_array_remove_index (GByteArray *array,
1771 g_array_remove_index ((GArray *)array, index_);
1777 * g_byte_array_remove_index_fast:
1778 * @array: a #GByteArray
1779 * @index_: the index of the byte to remove
1781 * Removes the byte at the given index from a #GByteArray. The last
1782 * element in the array is used to fill in the space, so this function
1783 * does not preserve the order of the #GByteArray. But it is faster
1784 * than g_byte_array_remove_index().
1786 * Returns: the #GByteArray
1789 g_byte_array_remove_index_fast (GByteArray *array,
1792 g_array_remove_index_fast ((GArray *)array, index_);
1798 * g_byte_array_remove_range:
1799 * @array: a @GByteArray
1800 * @index_: the index of the first byte to remove
1801 * @length: the number of bytes to remove
1803 * Removes the given number of bytes starting at the given index from a
1804 * #GByteArray. The following elements are moved to close the gap.
1806 * Returns: the #GByteArray
1811 g_byte_array_remove_range (GByteArray *array,
1815 g_return_val_if_fail (array, NULL);
1816 g_return_val_if_fail (index_ < array->len, NULL);
1817 g_return_val_if_fail (index_ + length <= array->len, NULL);
1819 return (GByteArray *)g_array_remove_range ((GArray *)array, index_, length);
1823 * g_byte_array_sort:
1824 * @array: a #GByteArray
1825 * @compare_func: comparison function
1827 * Sorts a byte array, using @compare_func which should be a
1828 * qsort()-style comparison function (returns less than zero for first
1829 * arg is less than second arg, zero for equal, greater than zero if
1830 * first arg is greater than second arg).
1832 * If two array elements compare equal, their order in the sorted array
1833 * is undefined. If you want equal elements to keep their order (i.e.
1834 * you want a stable sort) you can write a comparison function that,
1835 * if two elements would otherwise compare equal, compares them by
1839 g_byte_array_sort (GByteArray *array,
1840 GCompareFunc compare_func)
1842 g_array_sort ((GArray *)array, compare_func);
1846 * g_byte_array_sort_with_data:
1847 * @array: a #GByteArray
1848 * @compare_func: comparison function
1849 * @user_data: data to pass to @compare_func
1851 * Like g_byte_array_sort(), but the comparison function takes an extra
1852 * user data argument.
1855 g_byte_array_sort_with_data (GByteArray *array,
1856 GCompareDataFunc compare_func,
1859 g_array_sort_with_data ((GArray *)array, compare_func, user_data);