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().
71 * <title>Using a #GArray to store #gint values</title>
75 * /<!-- -->* We create a new array to store gint values.
76 * 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);
89 #define MIN_ARRAY_SIZE 16
91 typedef struct _GRealArray GRealArray;
95 * @data: a pointer to the element data. The data may be moved as
96 * elements are added to the #GArray.
97 * @len: the number of elements in the #GArray not including the
98 * possible terminating zero element.
100 * Contains the public fields of a #GArray.
108 guint zero_terminated : 1;
111 GDestroyNotify clear_func;
117 * @t: the type of the elements
118 * @i: the index of the element to return
120 * Returns the element of a #GArray at the given index. The return
121 * value is cast to the given type.
124 * <title>Getting a pointer to an element in a #GArray</title>
126 * EDayViewEvent *event;
127 * /<!-- -->* This gets a pointer to the 4th element
128 * in the array of EDayViewEvent structs. *<!-- -->/
129 * event = &g_array_index (events, EDayViewEvent, 3);
133 * Returns: the element of the #GArray at the index given by @i
136 #define g_array_elt_len(array,i) ((array)->elt_size * (i))
137 #define g_array_elt_pos(array,i) ((array)->data + g_array_elt_len((array),(i)))
138 #define g_array_elt_zero(array, pos, len) \
139 (memset (g_array_elt_pos ((array), pos), 0, g_array_elt_len ((array), len)))
140 #define g_array_zero_terminate(array) G_STMT_START{ \
141 if ((array)->zero_terminated) \
142 g_array_elt_zero ((array), (array)->len, 1); \
145 static guint g_nearest_pow (gint num) G_GNUC_CONST;
146 static void g_array_maybe_expand (GRealArray *array,
151 * @zero_terminated: %TRUE if the array should have an extra element at
152 * the end which is set to 0
153 * @clear_: %TRUE if #GArray elements should be automatically cleared
154 * to 0 when they are allocated
155 * @element_size: the size of each element in bytes
157 * Creates a new #GArray with a reference count of 1.
159 * Returns: the new #GArray
162 g_array_new (gboolean zero_terminated,
166 g_return_val_if_fail (elt_size > 0, NULL);
168 return g_array_sized_new (zero_terminated, clear, elt_size, 0);
173 * @zero_terminated: %TRUE if the array should have an extra element at
174 * the end with all bits cleared
175 * @clear_: %TRUE if all bits in the array should be cleared to 0 on
177 * @element_size: size of each element in the array
178 * @reserved_size: number of elements preallocated
180 * Creates a new #GArray with @reserved_size elements preallocated and
181 * a reference count of 1. This avoids frequent reallocation, if you
182 * are going to add many elements to the array. Note however that the
183 * size of the array is still 0.
185 * Returns: the new #GArray
188 g_array_sized_new (gboolean zero_terminated,
195 g_return_val_if_fail (elt_size > 0, NULL);
197 array = g_slice_new (GRealArray);
202 array->zero_terminated = (zero_terminated ? 1 : 0);
203 array->clear = (clear ? 1 : 0);
204 array->elt_size = elt_size;
205 array->ref_count = 1;
206 array->clear_func = NULL;
208 if (array->zero_terminated || reserved_size != 0)
210 g_array_maybe_expand (array, reserved_size);
211 g_array_zero_terminate(array);
214 return (GArray*) array;
218 * g_array_set_clear_func:
220 * @clear_func: a function to clear an element of @array
222 * Sets a function to clear an element of @array.
224 * The @clear_func will be called when an element in the array
225 * data segment is removed and when the array is freed and data
226 * segment is deallocated as well.
228 * Note that in contrast with other uses of #GDestroyNotify
229 * functions, @clear_func is expected to clear the contents of
230 * the array element it is given, but not free the element itself.
235 g_array_set_clear_func (GArray *array,
236 GDestroyNotify clear_func)
238 GRealArray *rarray = (GRealArray *) array;
240 g_return_if_fail (array != NULL);
242 rarray->clear_func = clear_func;
249 * Atomically increments the reference count of @array by one.
250 * This function is MT-safe and may be called from any thread.
252 * Returns: The passed in #GArray
257 g_array_ref (GArray *array)
259 GRealArray *rarray = (GRealArray*) array;
260 g_return_val_if_fail (array, NULL);
262 g_atomic_int_inc (&rarray->ref_count);
269 FREE_SEGMENT = 1 << 0,
270 PRESERVE_WRAPPER = 1 << 1
273 static gchar *array_free (GRealArray *, ArrayFreeFlags);
279 * Atomically decrements the reference count of @array by one. If the
280 * reference count drops to 0, all memory allocated by the array is
281 * released. This function is MT-safe and may be called from any
287 g_array_unref (GArray *array)
289 GRealArray *rarray = (GRealArray*) array;
290 g_return_if_fail (array);
292 if (g_atomic_int_dec_and_test (&rarray->ref_count))
293 array_free (rarray, FREE_SEGMENT);
297 * g_array_get_element_size:
300 * Gets the size of the elements in @array.
302 * Returns: Size of each element, in bytes
307 g_array_get_element_size (GArray *array)
309 GRealArray *rarray = (GRealArray*) array;
311 g_return_val_if_fail (array, 0);
313 return rarray->elt_size;
319 * @free_segment: if %TRUE the actual element data is freed as well
321 * Frees the memory allocated for the #GArray. If @free_segment is
322 * %TRUE it frees the memory block holding the elements as well and
323 * also each element if @array has a @element_free_func set. Pass
324 * %FALSE if you want to free the #GArray wrapper but preserve the
325 * underlying array for use elsewhere. If the reference count of @array
326 * is greater than one, the #GArray wrapper is preserved but the size
327 * of @array will be set to zero.
329 * If array elements contain dynamically-allocated memory, they should
330 * be freed separately.
332 * Returns: the element data if @free_segment is %FALSE, otherwise
333 * %NULL. The element data should be freed using g_free().
336 g_array_free (GArray *farray,
337 gboolean free_segment)
339 GRealArray *array = (GRealArray*) farray;
340 ArrayFreeFlags flags;
342 g_return_val_if_fail (array, NULL);
344 flags = (free_segment ? FREE_SEGMENT : 0);
346 /* if others are holding a reference, preserve the wrapper but do free/return the data */
347 if (!g_atomic_int_dec_and_test (&array->ref_count))
348 flags |= PRESERVE_WRAPPER;
350 return array_free (array, flags);
354 array_free (GRealArray *array,
355 ArrayFreeFlags flags)
359 if (flags & FREE_SEGMENT)
361 if (array->clear_func != NULL)
365 for (i = 0; i < array->len; i++)
366 array->clear_func (g_array_elt_pos (array, i));
369 g_free (array->data);
373 segment = (gchar*) array->data;
375 if (flags & PRESERVE_WRAPPER)
383 g_slice_free1 (sizeof (GRealArray), array);
390 * g_array_append_vals:
392 * @data: a pointer to the elements to append to the end of the array
393 * @len: the number of elements to append
395 * Adds @len elements onto the end of the array.
397 * Returns: the #GArray
400 * g_array_append_val:
402 * @v: the value to append to the #GArray
404 * Adds the value on to the end of the array. The array will grow in
405 * size automatically if necessary.
407 * g_array_append_val() is a macro which uses a reference to the value
408 * parameter @v. This means that you cannot use it with literal values
409 * such as "27". You must use variables.
411 * Returns: the #GArray
414 g_array_append_vals (GArray *farray,
418 GRealArray *array = (GRealArray*) farray;
420 g_return_val_if_fail (array, NULL);
422 g_array_maybe_expand (array, len);
424 memcpy (g_array_elt_pos (array, array->len), data,
425 g_array_elt_len (array, len));
429 g_array_zero_terminate (array);
435 * g_array_prepend_vals:
437 * @data: a pointer to the elements to prepend to the start of the array
438 * @len: the number of elements to prepend
440 * Adds @len elements onto the start of the array.
442 * This operation is slower than g_array_append_vals() since the
443 * existing elements in the array have to be moved to make space for
446 * Returns: the #GArray
449 * g_array_prepend_val:
451 * @v: the value to prepend to the #GArray
453 * Adds the value on to the start of the array. The array will grow in
454 * size automatically if necessary.
456 * This operation is slower than g_array_append_val() since the
457 * existing elements in the array have to be moved to make space for
460 * g_array_prepend_val() is a macro which uses a reference to the value
461 * parameter @v. This means that you cannot use it with literal values
462 * such as "27". You must use variables.
464 * Returns: the #GArray
467 g_array_prepend_vals (GArray *farray,
471 GRealArray *array = (GRealArray*) farray;
473 g_return_val_if_fail (array, NULL);
475 g_array_maybe_expand (array, len);
477 memmove (g_array_elt_pos (array, len), g_array_elt_pos (array, 0),
478 g_array_elt_len (array, array->len));
480 memcpy (g_array_elt_pos (array, 0), data, g_array_elt_len (array, len));
484 g_array_zero_terminate (array);
490 * g_array_insert_vals:
492 * @index_: the index to place the elements at
493 * @data: a pointer to the elements to insert
494 * @len: the number of elements to insert
496 * Inserts @len elements into a #GArray at the given index.
498 * Returns: the #GArray
501 * g_array_insert_val:
503 * @i: the index to place the element at
504 * @v: the value to insert into the array
506 * Inserts an element into an array at the given index.
508 * g_array_insert_val() is a macro which uses a reference to the value
509 * parameter @v. This means that you cannot use it with literal values
510 * such as "27". You must use variables.
512 * Returns: the #GArray
515 g_array_insert_vals (GArray *farray,
520 GRealArray *array = (GRealArray*) farray;
522 g_return_val_if_fail (array, NULL);
524 g_array_maybe_expand (array, len);
526 memmove (g_array_elt_pos (array, len + index_),
527 g_array_elt_pos (array, index_),
528 g_array_elt_len (array, array->len - index_));
530 memcpy (g_array_elt_pos (array, index_), data, g_array_elt_len (array, len));
534 g_array_zero_terminate (array);
542 * @length: the new size of the #GArray
544 * Sets the size of the array, expanding it if necessary. If the array
545 * was created with @clear_ set to %TRUE, the new elements are set to 0.
547 * Returns: the #GArray
550 g_array_set_size (GArray *farray,
553 GRealArray *array = (GRealArray*) farray;
555 g_return_val_if_fail (array, NULL);
557 if (length > array->len)
559 g_array_maybe_expand (array, length - array->len);
562 g_array_elt_zero (array, array->len, length - array->len);
564 else if (length < array->len)
565 g_array_remove_range (farray, length, array->len - length);
569 g_array_zero_terminate (array);
575 * g_array_remove_index:
577 * @index_: the index of the element to remove
579 * Removes the element at the given index from a #GArray. The following
580 * elements are moved down one place.
582 * Returns: the #GArray
585 g_array_remove_index (GArray *farray,
588 GRealArray* array = (GRealArray*) farray;
590 g_return_val_if_fail (array, NULL);
592 g_return_val_if_fail (index_ < array->len, NULL);
594 if (array->clear_func != NULL)
595 array->clear_func (g_array_elt_pos (array, index_));
597 if (index_ != array->len - 1)
598 memmove (g_array_elt_pos (array, index_),
599 g_array_elt_pos (array, index_ + 1),
600 g_array_elt_len (array, array->len - index_ - 1));
604 if (G_UNLIKELY (g_mem_gc_friendly))
605 g_array_elt_zero (array, array->len, 1);
607 g_array_zero_terminate (array);
613 * g_array_remove_index_fast:
615 * @index_: the index of the element to remove
617 * Removes the element at the given index from a #GArray. The last
618 * element in the array is used to fill in the space, so this function
619 * does not preserve the order of the #GArray. But it is faster than
620 * g_array_remove_index().
622 * Returns: the #GArray
625 g_array_remove_index_fast (GArray *farray,
628 GRealArray* array = (GRealArray*) farray;
630 g_return_val_if_fail (array, NULL);
632 g_return_val_if_fail (index_ < array->len, NULL);
634 if (array->clear_func != NULL)
635 array->clear_func (g_array_elt_pos (array, index_));
637 if (index_ != array->len - 1)
638 memcpy (g_array_elt_pos (array, index_),
639 g_array_elt_pos (array, array->len - 1),
640 g_array_elt_len (array, 1));
644 if (G_UNLIKELY (g_mem_gc_friendly))
645 g_array_elt_zero (array, array->len, 1);
647 g_array_zero_terminate (array);
653 * g_array_remove_range:
655 * @index_: the index of the first element to remove
656 * @length: the number of elements to remove
658 * Removes the given number of elements starting at the given index
659 * from a #GArray. The following elements are moved to close the gap.
661 * Returns: the #GArray
666 g_array_remove_range (GArray *farray,
670 GRealArray *array = (GRealArray*) farray;
672 g_return_val_if_fail (array, NULL);
673 g_return_val_if_fail (index_ < array->len, NULL);
674 g_return_val_if_fail (index_ + length <= array->len, NULL);
676 if (array->clear_func != NULL)
680 for (i = 0; i < length; i++)
681 array->clear_func (g_array_elt_pos (array, index_ + i));
684 if (index_ + length != array->len)
685 memmove (g_array_elt_pos (array, index_),
686 g_array_elt_pos (array, index_ + length),
687 (array->len - (index_ + length)) * array->elt_size);
689 array->len -= length;
690 if (G_UNLIKELY (g_mem_gc_friendly))
691 g_array_elt_zero (array, array->len, length);
693 g_array_zero_terminate (array);
701 * @compare_func: comparison function
703 * Sorts a #GArray using @compare_func which should be a qsort()-style
704 * comparison function (returns less than zero for first arg is less
705 * than second arg, zero for equal, greater zero if first arg is
706 * greater than second arg).
708 * This is guaranteed to be a stable sort since version 2.32.
711 g_array_sort (GArray *farray,
712 GCompareFunc compare_func)
714 GRealArray *array = (GRealArray*) farray;
716 g_return_if_fail (array != NULL);
718 /* Don't use qsort as we want a guaranteed stable sort */
719 g_qsort_with_data (array->data,
722 (GCompareDataFunc)compare_func,
727 * g_array_sort_with_data:
729 * @compare_func: comparison function
730 * @user_data: data to pass to @compare_func
732 * Like g_array_sort(), but the comparison function receives an extra
733 * user data argument.
735 * This is guaranteed to be a stable sort since version 2.32.
737 * There used to be a comment here about making the sort stable by
738 * using the addresses of the elements in the comparison function.
739 * This did not actually work, so any such code should be removed.
742 g_array_sort_with_data (GArray *farray,
743 GCompareDataFunc compare_func,
746 GRealArray *array = (GRealArray*) farray;
748 g_return_if_fail (array != NULL);
750 g_qsort_with_data (array->data,
757 /* Returns the smallest power of 2 greater than n, or n if
758 * such power does not fit in a guint
761 g_nearest_pow (gint num)
765 while (n < num && n > 0)
772 g_array_maybe_expand (GRealArray *array,
775 guint want_alloc = g_array_elt_len (array, array->len + len +
776 array->zero_terminated);
778 if (want_alloc > array->alloc)
780 want_alloc = g_nearest_pow (want_alloc);
781 want_alloc = MAX (want_alloc, MIN_ARRAY_SIZE);
783 array->data = g_realloc (array->data, want_alloc);
785 if (G_UNLIKELY (g_mem_gc_friendly))
786 memset (array->data + array->alloc, 0, want_alloc - array->alloc);
788 array->alloc = want_alloc;
793 * SECTION:arrays_pointer
794 * @title: Pointer Arrays
795 * @short_description: arrays of pointers to any type of data, which
796 * grow automatically as new elements are added
798 * Pointer Arrays are similar to Arrays but are used only for storing
801 * If you remove elements from the array, elements at the end of the
802 * array are moved into the space previously occupied by the removed
803 * element. This means that you should not rely on the index of particular
804 * elements remaining the same. You should also be careful when deleting
805 * elements while iterating over the array.
807 * To create a pointer array, use g_ptr_array_new().
809 * To add elements to a pointer array, use g_ptr_array_add().
811 * To remove elements from a pointer array, use g_ptr_array_remove(),
812 * g_ptr_array_remove_index() or g_ptr_array_remove_index_fast().
814 * To access an element of a pointer array, use g_ptr_array_index().
816 * To set the size of a pointer array, use g_ptr_array_set_size().
818 * To free a pointer array, use g_ptr_array_free().
821 * <title>Using a #GPtrArray</title>
823 * GPtrArray *gparray;
824 * gchar *string1 = "one", *string2 = "two", *string3 = "three";
826 * gparray = g_ptr_array_new (<!-- -->);
827 * g_ptr_array_add (gparray, (gpointer) string1);
828 * g_ptr_array_add (gparray, (gpointer) string2);
829 * g_ptr_array_add (gparray, (gpointer) string3);
831 * if (g_ptr_array_index (gparray, 0) != (gpointer) string1)
832 * g_print ("ERROR: got %p instead of %p\n",
833 * g_ptr_array_index (gparray, 0), string1);
835 * g_ptr_array_free (gparray, TRUE);
840 typedef struct _GRealPtrArray GRealPtrArray;
844 * @pdata: points to the array of pointers, which may be moved when the
846 * @len: number of pointers in the array
848 * Contains the public fields of a pointer array.
850 struct _GRealPtrArray
856 GDestroyNotify element_free_func;
861 * @array: a #GPtrArray
862 * @index_: the index of the pointer to return
864 * Returns the pointer at the given index of the pointer array.
866 * This does not perform bounds checking on the given @index_,
867 * so you are responsible for checking it against the array length.
869 * Returns: the pointer at the given index
872 static void g_ptr_array_maybe_expand (GRealPtrArray *array,
878 * Creates a new #GPtrArray with a reference count of 1.
880 * Returns: the new #GPtrArray
883 g_ptr_array_new (void)
885 return g_ptr_array_sized_new (0);
889 * g_ptr_array_sized_new:
890 * @reserved_size: number of pointers preallocated
892 * Creates a new #GPtrArray with @reserved_size pointers preallocated
893 * and a reference count of 1. This avoids frequent reallocation, if
894 * you are going to add many pointers to the array. Note however that
895 * the size of the array is still 0.
897 * Returns: the new #GPtrArray
900 g_ptr_array_sized_new (guint reserved_size)
902 GRealPtrArray *array = g_slice_new (GRealPtrArray);
907 array->ref_count = 1;
908 array->element_free_func = NULL;
910 if (reserved_size != 0)
911 g_ptr_array_maybe_expand (array, reserved_size);
913 return (GPtrArray*) array;
917 * g_ptr_array_new_with_free_func:
918 * @element_free_func: (allow-none): A function to free elements with
919 * destroy @array or %NULL
921 * Creates a new #GPtrArray with a reference count of 1 and use
922 * @element_free_func for freeing each element when the array is destroyed
923 * either via g_ptr_array_unref(), when g_ptr_array_free() is called with
924 * @free_segment set to %TRUE or when removing elements.
926 * Returns: A new #GPtrArray
931 g_ptr_array_new_with_free_func (GDestroyNotify element_free_func)
935 array = g_ptr_array_new ();
936 g_ptr_array_set_free_func (array, element_free_func);
941 * g_ptr_array_new_full:
942 * @reserved_size: number of pointers preallocated
943 * @element_free_func: (allow-none): A function to free elements with
944 * destroy @array or %NULL
946 * Creates a new #GPtrArray with @reserved_size pointers preallocated
947 * and a reference count of 1. This avoids frequent reallocation, if
948 * you are going to add many pointers to the array. Note however that
949 * the size of the array is still 0. It also set @element_free_func
950 * for freeing each element when the array is destroyed either via
951 * g_ptr_array_unref(), when g_ptr_array_free() is called with
952 * @free_segment set to %TRUE or when removing elements.
954 * Returns: A new #GPtrArray
959 g_ptr_array_new_full (guint reserved_size,
960 GDestroyNotify element_free_func)
964 array = g_ptr_array_sized_new (reserved_size);
965 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;
1032 g_return_if_fail (array);
1034 if (g_atomic_int_dec_and_test (&rarray->ref_count))
1035 ptr_array_free (array, FREE_SEGMENT);
1040 * @array: a #GPtrArray
1041 * @free_seg: if %TRUE the actual pointer array is freed as well
1043 * Frees the memory allocated for the #GPtrArray. If @free_seg is %TRUE
1044 * it frees the memory block holding the elements as well. Pass %FALSE
1045 * if you want to free the #GPtrArray wrapper but preserve the
1046 * underlying array for use elsewhere. If the reference count of @array
1047 * is greater than one, the #GPtrArray wrapper is preserved but the
1048 * size of @array will be set to zero.
1050 * If array contents point to dynamically-allocated memory, they should
1051 * be freed separately if @free_seg is %TRUE and no #GDestroyNotify
1052 * function has been set for @array.
1054 * Returns: the pointer array if @free_seg is %FALSE, otherwise %NULL.
1055 * The pointer array should be freed using g_free().
1058 g_ptr_array_free (GPtrArray *farray,
1059 gboolean free_segment)
1061 GRealPtrArray *array = (GRealPtrArray*) farray;
1062 ArrayFreeFlags flags;
1064 g_return_val_if_fail (array, NULL);
1066 flags = (free_segment ? FREE_SEGMENT : 0);
1068 /* if others are holding a reference, preserve the wrapper but
1069 * do free/return the data
1071 if (!g_atomic_int_dec_and_test (&array->ref_count))
1072 flags |= PRESERVE_WRAPPER;
1074 return ptr_array_free (farray, flags);
1078 ptr_array_free (GPtrArray *farray,
1079 ArrayFreeFlags flags)
1081 GRealPtrArray *array = (GRealPtrArray*) farray;
1084 if (flags & FREE_SEGMENT)
1086 if (array->element_free_func != NULL)
1087 g_ptr_array_foreach (farray, (GFunc) array->element_free_func, NULL);
1088 g_free (array->pdata);
1092 segment = array->pdata;
1094 if (flags & PRESERVE_WRAPPER)
1096 array->pdata = NULL;
1102 g_slice_free1 (sizeof (GRealPtrArray), array);
1109 g_ptr_array_maybe_expand (GRealPtrArray *array,
1112 if ((array->len + len) > array->alloc)
1114 guint old_alloc = array->alloc;
1115 array->alloc = g_nearest_pow (array->len + len);
1116 array->alloc = MAX (array->alloc, MIN_ARRAY_SIZE);
1117 array->pdata = g_realloc (array->pdata, sizeof (gpointer) * array->alloc);
1118 if (G_UNLIKELY (g_mem_gc_friendly))
1119 for ( ; old_alloc < array->alloc; old_alloc++)
1120 array->pdata [old_alloc] = NULL;
1125 * g_ptr_array_set_size:
1126 * @array: a #GPtrArray
1127 * @length: the new length of the pointer array
1129 * Sets the size of the array. When making the array larger,
1130 * newly-added elements will be set to %NULL. When making it smaller,
1131 * if @array has a non-%NULL #GDestroyNotify function then it will be
1132 * called for the removed elements.
1135 g_ptr_array_set_size (GPtrArray *farray,
1138 GRealPtrArray* array = (GRealPtrArray*) farray;
1140 g_return_if_fail (array);
1142 if (length > array->len)
1145 g_ptr_array_maybe_expand (array, (length - array->len));
1147 * memset (array->pdata + array->len, 0,
1148 * sizeof (gpointer) * (length - array->len));
1149 * to make it really portable. Remember (void*)NULL needn't be
1150 * bitwise zero. It of course is silly not to use memset (..,0,..).
1152 for (i = array->len; i < length; i++)
1153 array->pdata[i] = NULL;
1155 else if (length < array->len)
1156 g_ptr_array_remove_range (farray, length, array->len - length);
1158 array->len = length;
1162 * g_ptr_array_remove_index:
1163 * @array: a #GPtrArray
1164 * @index_: the index of the pointer to remove
1166 * Removes the pointer at the given index from the pointer array.
1167 * The following elements are moved down one place. If @array has
1168 * a non-%NULL #GDestroyNotify function it is called for the removed
1171 * Returns: the pointer which was removed
1174 g_ptr_array_remove_index (GPtrArray *farray,
1177 GRealPtrArray* array = (GRealPtrArray*) farray;
1180 g_return_val_if_fail (array, NULL);
1182 g_return_val_if_fail (index_ < array->len, NULL);
1184 result = array->pdata[index_];
1186 if (array->element_free_func != NULL)
1187 array->element_free_func (array->pdata[index_]);
1189 if (index_ != array->len - 1)
1190 memmove (array->pdata + index_, array->pdata + index_ + 1,
1191 sizeof (gpointer) * (array->len - index_ - 1));
1195 if (G_UNLIKELY (g_mem_gc_friendly))
1196 array->pdata[array->len] = NULL;
1202 * g_ptr_array_remove_index_fast:
1203 * @array: a #GPtrArray
1204 * @index_: the index of the pointer to remove
1206 * Removes the pointer at the given index from the pointer array.
1207 * The last element in the array is used to fill in the space, so
1208 * this function does not preserve the order of the array. But it
1209 * is faster than g_ptr_array_remove_index(). If @array has a non-%NULL
1210 * #GDestroyNotify function it is called for the removed element.
1212 * Returns: the pointer which was removed
1215 g_ptr_array_remove_index_fast (GPtrArray *farray,
1218 GRealPtrArray* array = (GRealPtrArray*) farray;
1221 g_return_val_if_fail (array, NULL);
1223 g_return_val_if_fail (index_ < array->len, NULL);
1225 result = array->pdata[index_];
1227 if (array->element_free_func != NULL)
1228 array->element_free_func (array->pdata[index_]);
1230 if (index_ != array->len - 1)
1231 array->pdata[index_] = array->pdata[array->len - 1];
1235 if (G_UNLIKELY (g_mem_gc_friendly))
1236 array->pdata[array->len] = NULL;
1242 * g_ptr_array_remove_range:
1243 * @array: a @GPtrArray
1244 * @index_: the index of the first pointer to remove
1245 * @length: the number of pointers to remove
1247 * Removes the given number of pointers starting at the given index
1248 * from a #GPtrArray. The following elements are moved to close the
1249 * gap. If @array has a non-%NULL #GDestroyNotify function it is called
1250 * for the removed elements.
1252 * Returns: the @array
1257 g_ptr_array_remove_range (GPtrArray *farray,
1261 GRealPtrArray* array = (GRealPtrArray*) farray;
1264 g_return_val_if_fail (array != NULL, NULL);
1265 g_return_val_if_fail (index_ < array->len, NULL);
1266 g_return_val_if_fail (index_ + length <= array->len, NULL);
1268 if (array->element_free_func != NULL)
1270 for (n = index_; n < index_ + length; n++)
1271 array->element_free_func (array->pdata[n]);
1274 if (index_ + length != array->len)
1276 memmove (&array->pdata[index_],
1277 &array->pdata[index_ + length],
1278 (array->len - (index_ + length)) * sizeof (gpointer));
1281 array->len -= length;
1282 if (G_UNLIKELY (g_mem_gc_friendly))
1285 for (i = 0; i < length; i++)
1286 array->pdata[array->len + i] = NULL;
1293 * g_ptr_array_remove:
1294 * @array: a #GPtrArray
1295 * @data: the pointer to remove
1297 * Removes the first occurrence of the given pointer from the pointer
1298 * array. The following elements are moved down one place. If @array
1299 * has a non-%NULL #GDestroyNotify function it is called for the
1302 * It returns %TRUE if the pointer was removed, or %FALSE if the
1303 * pointer was not found.
1305 * Returns: %TRUE if the pointer is removed, %FALSE if the pointer
1306 * is not found in the array
1309 g_ptr_array_remove (GPtrArray *farray,
1312 GRealPtrArray* array = (GRealPtrArray*) farray;
1315 g_return_val_if_fail (array, FALSE);
1317 for (i = 0; i < array->len; i += 1)
1319 if (array->pdata[i] == data)
1321 g_ptr_array_remove_index (farray, i);
1330 * g_ptr_array_remove_fast:
1331 * @array: a #GPtrArray
1332 * @data: the pointer to remove
1334 * Removes the first occurrence of the given pointer from the pointer
1335 * array. The last element in the array is used to fill in the space,
1336 * so this function does not preserve the order of the array. But it
1337 * is faster than g_ptr_array_remove(). If @array has a non-%NULL
1338 * #GDestroyNotify function it is called for the removed element.
1340 * It returns %TRUE if the pointer was removed, or %FALSE if the
1341 * pointer was not found.
1343 * Returns: %TRUE if the pointer was found in the array
1346 g_ptr_array_remove_fast (GPtrArray *farray,
1349 GRealPtrArray* array = (GRealPtrArray*) farray;
1352 g_return_val_if_fail (array, FALSE);
1354 for (i = 0; i < array->len; i += 1)
1356 if (array->pdata[i] == data)
1358 g_ptr_array_remove_index_fast (farray, i);
1368 * @array: a #GPtrArray
1369 * @data: the pointer to add
1371 * Adds a pointer to the end of the pointer array. The array will grow
1372 * in size automatically if necessary.
1375 g_ptr_array_add (GPtrArray *farray,
1378 GRealPtrArray* array = (GRealPtrArray*) farray;
1380 g_return_if_fail (array);
1382 g_ptr_array_maybe_expand (array, 1);
1384 array->pdata[array->len++] = data;
1388 * g_ptr_array_insert:
1389 * @array: a #GPtrArray
1390 * @index_: the index to place the new element at, or -1 to append
1391 * @data: the pointer to add.
1393 * Inserts an element into the pointer array at the given index. The
1394 * array will grow in size automatically if necessary.
1399 g_ptr_array_insert (GPtrArray *farray,
1403 GRealPtrArray* array = (GRealPtrArray*) farray;
1405 g_return_if_fail (array);
1406 g_return_if_fail (index_ >= -1);
1407 g_return_if_fail (index_ <= (gint)array->len);
1409 g_ptr_array_maybe_expand (array, 1);
1412 index_ = array->len;
1414 if (index_ < array->len)
1415 memmove (&(array->pdata[index_ + 1]),
1416 &(array->pdata[index_]),
1417 (array->len - index_) * sizeof (gpointer));
1420 array->pdata[index_] = data;
1425 * @array: a #GPtrArray
1426 * @compare_func: comparison function
1428 * Sorts the array, using @compare_func which should be a qsort()-style
1429 * comparison function (returns less than zero for first arg is less
1430 * than second arg, zero for equal, greater than zero if irst arg is
1431 * greater than second arg).
1433 * Note that the comparison function for g_ptr_array_sort() doesn't
1434 * take the pointers from the array as arguments, it takes pointers to
1435 * the pointers in the array.
1437 * This is guaranteed to be a stable sort since version 2.32.
1440 g_ptr_array_sort (GPtrArray *array,
1441 GCompareFunc compare_func)
1443 g_return_if_fail (array != NULL);
1445 /* Don't use qsort as we want a guaranteed stable sort */
1446 g_qsort_with_data (array->pdata,
1449 (GCompareDataFunc)compare_func,
1454 * g_ptr_array_sort_with_data:
1455 * @array: a #GPtrArray
1456 * @compare_func: comparison function
1457 * @user_data: data to pass to @compare_func
1459 * Like g_ptr_array_sort(), but the comparison function has an extra
1460 * user data argument.
1462 * Note that the comparison function for g_ptr_array_sort_with_data()
1463 * doesn't take the pointers from the array as arguments, it takes
1464 * pointers to the pointers in the array.
1466 * This is guaranteed to be a stable sort since version 2.32.
1469 g_ptr_array_sort_with_data (GPtrArray *array,
1470 GCompareDataFunc compare_func,
1473 g_return_if_fail (array != NULL);
1475 g_qsort_with_data (array->pdata,
1483 * g_ptr_array_foreach:
1484 * @array: a #GPtrArray
1485 * @func: the function to call for each array element
1486 * @user_data: user data to pass to the function
1488 * Calls a function for each element of a #GPtrArray.
1493 g_ptr_array_foreach (GPtrArray *array,
1499 g_return_if_fail (array);
1501 for (i = 0; i < array->len; i++)
1502 (*func) (array->pdata[i], user_data);
1506 * SECTION:arrays_byte
1507 * @title: Byte Arrays
1508 * @short_description: arrays of bytes
1510 * #GByteArray is a mutable array of bytes based on #GArray, to provide arrays
1511 * of bytes which grow automatically as elements are added.
1513 * To create a new #GByteArray use g_byte_array_new(). To add elements to a
1514 * #GByteArray, use g_byte_array_append(), and g_byte_array_prepend().
1516 * To set the size of a #GByteArray, use g_byte_array_set_size().
1518 * To free a #GByteArray, use g_byte_array_free().
1521 * <title>Using a #GByteArray</title>
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);
1542 * See #GBytes if you are interested in an immutable object representing a
1543 * sequence of bytes.
1548 * @data: a pointer to the element data. The data may be moved as
1549 * elements are added to the #GByteArray
1550 * @len: the number of elements in the #GByteArray
1552 * The #GByteArray-struct allows access to the public fields of
1559 * Creates a new #GByteArray with a reference count of 1.
1561 * Returns: (transfer full): the new #GByteArray
1564 g_byte_array_new (void)
1566 return (GByteArray*) g_array_sized_new (FALSE, FALSE, 1, 0);
1570 * g_byte_array_new_take:
1571 * @data: (transfer full) (array length=len): byte data for the array
1572 * @len: length of @data
1574 * Create byte array containing the data. The data will be owned by the array
1575 * and will be freed with g_free(), i.e. it could be allocated using g_strdup().
1579 * Returns: (transfer full): a new #GByteArray
1582 g_byte_array_new_take (guint8 *data,
1588 array = g_byte_array_new ();
1589 real = (GRealArray *)array;
1590 g_assert (real->data == NULL);
1591 g_assert (real->len == 0);
1600 * g_byte_array_sized_new:
1601 * @reserved_size: number of bytes preallocated
1603 * Creates a new #GByteArray with @reserved_size bytes preallocated.
1604 * This avoids frequent reallocation, if you are going to add many
1605 * bytes to the array. Note however that the size of the array is still
1608 * Returns: the new #GByteArray
1611 g_byte_array_sized_new (guint reserved_size)
1613 return (GByteArray*) g_array_sized_new (FALSE, FALSE, 1, reserved_size);
1617 * g_byte_array_free:
1618 * @array: a #GByteArray
1619 * @free_segment: if %TRUE the actual byte data is freed as well
1621 * Frees the memory allocated by the #GByteArray. If @free_segment is
1622 * %TRUE it frees the actual byte data. If the reference count of
1623 * @array is greater than one, the #GByteArray wrapper is preserved but
1624 * the size of @array will be set to zero.
1626 * Returns: the element data if @free_segment is %FALSE, otherwise
1627 * %NULL. The element data should be freed using g_free().
1630 g_byte_array_free (GByteArray *array,
1631 gboolean free_segment)
1633 return (guint8*) g_array_free ((GArray*) array, free_segment);
1637 * g_byte_array_free_to_bytes:
1638 * @array: (transfer full): a #GByteArray
1640 * Transfers the data from the #GByteArray into a new immutable #GBytes.
1642 * The #GByteArray is freed unless the reference count of @array is greater
1643 * than one, the #GByteArray wrapper is preserved but the size of @array
1644 * will be set to zero.
1646 * This is identical to using g_bytes_new_take() and g_byte_array_free()
1651 * Returns: (transfer full): a new immutable #GBytes representing same
1652 * byte data that was in the array
1655 g_byte_array_free_to_bytes (GByteArray *array)
1659 g_return_val_if_fail (array != NULL, NULL);
1661 length = array->len;
1662 return g_bytes_new_take (g_byte_array_free (array, FALSE), length);
1667 * @array: A #GByteArray
1669 * Atomically increments the reference count of @array by one. This
1670 * function is MT-safe and may be called from any thread.
1672 * Returns: The passed in #GByteArray
1677 g_byte_array_ref (GByteArray *array)
1679 return (GByteArray *) g_array_ref ((GArray *) array);
1683 * g_byte_array_unref:
1684 * @array: A #GByteArray
1686 * Atomically decrements the reference count of @array by one. If the
1687 * reference count drops to 0, all memory allocated by the array is
1688 * released. This function is MT-safe and may be called from any
1694 g_byte_array_unref (GByteArray *array)
1696 g_array_unref ((GArray *) array);
1700 * g_byte_array_append:
1701 * @array: a #GByteArray
1702 * @data: the byte data to be added
1703 * @len: the number of bytes to add
1705 * Adds the given bytes to the end of the #GByteArray. The array will
1706 * grow in size automatically if necessary.
1708 * Returns: the #GByteArray
1711 g_byte_array_append (GByteArray *array,
1715 g_array_append_vals ((GArray*) array, (guint8*)data, len);
1721 * g_byte_array_prepend:
1722 * @array: a #GByteArray
1723 * @data: the byte data to be added
1724 * @len: the number of bytes to add
1726 * Adds the given data to the start of the #GByteArray. The array will
1727 * grow in size automatically if necessary.
1729 * Returns: the #GByteArray
1732 g_byte_array_prepend (GByteArray *array,
1736 g_array_prepend_vals ((GArray*) array, (guint8*)data, len);
1742 * g_byte_array_set_size:
1743 * @array: a #GByteArray
1744 * @length: the new size of the #GByteArray
1746 * Sets the size of the #GByteArray, expanding it if necessary.
1748 * Returns: the #GByteArray
1751 g_byte_array_set_size (GByteArray *array,
1754 g_array_set_size ((GArray*) array, length);
1760 * g_byte_array_remove_index:
1761 * @array: a #GByteArray
1762 * @index_: the index of the byte to remove
1764 * Removes the byte at the given index from a #GByteArray. The
1765 * following bytes are moved down one place.
1767 * Returns: the #GByteArray
1770 g_byte_array_remove_index (GByteArray *array,
1773 g_array_remove_index ((GArray*) array, index_);
1779 * g_byte_array_remove_index_fast:
1780 * @array: a #GByteArray
1781 * @index_: the index of the byte to remove
1783 * Removes the byte at the given index from a #GByteArray. The last
1784 * element in the array is used to fill in the space, so this function
1785 * does not preserve the order of the #GByteArray. But it is faster
1786 * than g_byte_array_remove_index().
1788 * Returns: the #GByteArray
1791 g_byte_array_remove_index_fast (GByteArray *array,
1794 g_array_remove_index_fast ((GArray*) array, index_);
1800 * g_byte_array_remove_range:
1801 * @array: a @GByteArray
1802 * @index_: the index of the first byte to remove
1803 * @length: the number of bytes to remove
1805 * Removes the given number of bytes starting at the given index from a
1806 * #GByteArray. The following elements are moved to close the gap.
1808 * Returns: the #GByteArray
1813 g_byte_array_remove_range (GByteArray *array,
1817 g_return_val_if_fail (array, NULL);
1818 g_return_val_if_fail (index_ < array->len, NULL);
1819 g_return_val_if_fail (index_ + length <= array->len, NULL);
1821 return (GByteArray *)g_array_remove_range ((GArray*) array, index_, length);
1825 * g_byte_array_sort:
1826 * @array: a #GByteArray
1827 * @compare_func: comparison function
1829 * Sorts a byte array, using @compare_func which should be a
1830 * qsort()-style comparison function (returns less than zero for first
1831 * arg is less than second arg, zero for equal, greater than zero if
1832 * first arg is greater than second arg).
1834 * If two array elements compare equal, their order in the sorted array
1835 * is undefined. If you want equal elements to keep their order (i.e.
1836 * you want a stable sort) you can write a comparison function that,
1837 * if two elements would otherwise compare equal, compares them by
1841 g_byte_array_sort (GByteArray *array,
1842 GCompareFunc compare_func)
1844 g_array_sort ((GArray *) array, compare_func);
1848 * g_byte_array_sort_with_data:
1849 * @array: a #GByteArray
1850 * @compare_func: comparison function
1851 * @user_data: data to pass to @compare_func
1853 * Like g_byte_array_sort(), but the comparison function takes an extra
1854 * user data argument.
1857 g_byte_array_sort_with_data (GByteArray *array,
1858 GCompareDataFunc compare_func,
1861 g_array_sort_with_data ((GArray *) array, compare_func, user_data);