1998-06-11 01:21:14 +02:00
|
|
|
/* 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 Library 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
|
|
|
|
* Library General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Library 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.
|
|
|
|
*/
|
|
|
|
#include <string.h>
|
|
|
|
#include "glib.h"
|
|
|
|
|
|
|
|
|
|
|
|
#define MIN_ARRAY_SIZE 16
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct _GRealArray GRealArray;
|
|
|
|
|
|
|
|
struct _GRealArray
|
|
|
|
{
|
|
|
|
guint8 *data;
|
|
|
|
guint len;
|
|
|
|
guint alloc;
|
|
|
|
guint zero_terminated;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static gint g_nearest_pow (gint num);
|
|
|
|
static void g_array_maybe_expand (GRealArray *array,
|
|
|
|
gint len);
|
|
|
|
|
|
|
|
|
|
|
|
static GMemChunk *array_mem_chunk = NULL;
|
|
|
|
|
|
|
|
|
|
|
|
GArray*
|
version bump to 1.1.3, binary age 0, interface age 0.
Sun Aug 16 20:28:27 1998 Tim Janik <timj@gtk.org>
* version bump to 1.1.3, binary age 0, interface age 0.
* glib.h: be nice to platforms that don't have gint64 and don't
issue #warning on every compilation. since glib doesn't require
gint64 itself, packages that need gint64 should test for this
themselves.
* glib.h:
* gutils.c: added a new function g_vsnprintf().
Fri Aug 14 16:41:53 1998 Tim Janik <timj@gtk.org>
* glib.h: added static inline functions for bit mask tests:
g_bit_nth_lsf, g_bit_nth_msf and g_bit_storage.
Fri Aug 13 14:23:37 1998 Tim Janik <timj@gtk.org>
* glib.h:
* gmessages.c:
revised the message handling system, which is now based on a new
mechanism g_log*. most of the assertment macros got adapted to
feature the new g_log() call with an additional specification of
the log level in a preprocessor macro G_LOG_DOMAIN. if G_LOG_DOMAIN
is undefined upon the includion of glib.h, it'll be defined with a
value of (NULL) and thus preserves the original bahaviour for
warning and error messages. the message handler setting functions
for g_warning, g_error and g_message are only provided for backwards
compatibility and might get removed somewhen.
* Makefile.am: feature the G_LOG_DOMAIN macro to set the log domain
to "GLib" upon compilation. we currently have to add this definition
to the DEFS variable.
* testglib.c: we need an ugly #undef G_LOG_DOMAIN at the start
of this file currently, since automake doesn't support per target
_CFLAGS yet.
* glib.h: changed some gints to gbooleans, made a few const corrections,
removed some superfluous G_STMT_START{}G_STMT_END wrappers, added some
in other required places.
* gnode.c:
(g_node_prepend):
(g_node_insert_before):
(g_node_insert):
(g_node_append_data):
(g_node_prepend_data):
(g_node_insert_data_before):
(g_node_insert_data):
(g_node_append):
return (node), so these macros/functions can be usefully chained with
g_node_new().
[GModule]
Fri Aug 14 02:24:39 1998 Tim Janik <timj@gtk.org>
* Makefile.am: feature the G_LOG_DOMAIN macro to set the log domain
to "GModule" upon compilation. we currently have to add this definition
to the DEFS variable.
* testgmodule.c: we need an ugly #undef G_LOG_DOMAIN at the start
of this file currently, since automake doesn't support per target
_CFLAGS yet.
1998-08-16 23:14:11 +02:00
|
|
|
g_array_new (gboolean zero_terminated)
|
1998-06-11 01:21:14 +02:00
|
|
|
{
|
|
|
|
GRealArray *array;
|
|
|
|
|
|
|
|
if (!array_mem_chunk)
|
|
|
|
array_mem_chunk = g_mem_chunk_new ("array mem chunk",
|
|
|
|
sizeof (GRealArray),
|
|
|
|
1024, G_ALLOC_AND_FREE);
|
|
|
|
|
|
|
|
array = g_chunk_new (GRealArray, array_mem_chunk);
|
|
|
|
|
|
|
|
array->data = NULL;
|
|
|
|
array->len = 0;
|
|
|
|
array->alloc = 0;
|
|
|
|
array->zero_terminated = (zero_terminated ? 1 : 0);
|
|
|
|
|
|
|
|
return (GArray*) array;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
version bump to 1.1.3, binary age 0, interface age 0.
Sun Aug 16 20:28:27 1998 Tim Janik <timj@gtk.org>
* version bump to 1.1.3, binary age 0, interface age 0.
* glib.h: be nice to platforms that don't have gint64 and don't
issue #warning on every compilation. since glib doesn't require
gint64 itself, packages that need gint64 should test for this
themselves.
* glib.h:
* gutils.c: added a new function g_vsnprintf().
Fri Aug 14 16:41:53 1998 Tim Janik <timj@gtk.org>
* glib.h: added static inline functions for bit mask tests:
g_bit_nth_lsf, g_bit_nth_msf and g_bit_storage.
Fri Aug 13 14:23:37 1998 Tim Janik <timj@gtk.org>
* glib.h:
* gmessages.c:
revised the message handling system, which is now based on a new
mechanism g_log*. most of the assertment macros got adapted to
feature the new g_log() call with an additional specification of
the log level in a preprocessor macro G_LOG_DOMAIN. if G_LOG_DOMAIN
is undefined upon the includion of glib.h, it'll be defined with a
value of (NULL) and thus preserves the original bahaviour for
warning and error messages. the message handler setting functions
for g_warning, g_error and g_message are only provided for backwards
compatibility and might get removed somewhen.
* Makefile.am: feature the G_LOG_DOMAIN macro to set the log domain
to "GLib" upon compilation. we currently have to add this definition
to the DEFS variable.
* testglib.c: we need an ugly #undef G_LOG_DOMAIN at the start
of this file currently, since automake doesn't support per target
_CFLAGS yet.
* glib.h: changed some gints to gbooleans, made a few const corrections,
removed some superfluous G_STMT_START{}G_STMT_END wrappers, added some
in other required places.
* gnode.c:
(g_node_prepend):
(g_node_insert_before):
(g_node_insert):
(g_node_append_data):
(g_node_prepend_data):
(g_node_insert_data_before):
(g_node_insert_data):
(g_node_append):
return (node), so these macros/functions can be usefully chained with
g_node_new().
[GModule]
Fri Aug 14 02:24:39 1998 Tim Janik <timj@gtk.org>
* Makefile.am: feature the G_LOG_DOMAIN macro to set the log domain
to "GModule" upon compilation. we currently have to add this definition
to the DEFS variable.
* testgmodule.c: we need an ugly #undef G_LOG_DOMAIN at the start
of this file currently, since automake doesn't support per target
_CFLAGS yet.
1998-08-16 23:14:11 +02:00
|
|
|
g_array_free (GArray *array,
|
|
|
|
gboolean free_segment)
|
1998-06-11 01:21:14 +02:00
|
|
|
{
|
|
|
|
if (free_segment)
|
|
|
|
g_free (array->data);
|
|
|
|
|
|
|
|
g_mem_chunk_free (array_mem_chunk, array);
|
|
|
|
}
|
|
|
|
|
|
|
|
GArray*
|
|
|
|
g_rarray_append (GArray *array,
|
|
|
|
gpointer data,
|
|
|
|
gint size)
|
|
|
|
{
|
|
|
|
g_array_maybe_expand ((GRealArray*) array, size);
|
|
|
|
|
|
|
|
memcpy (array->data + array->len, data, size);
|
|
|
|
|
|
|
|
array->len += size;
|
|
|
|
|
|
|
|
return array;
|
|
|
|
}
|
|
|
|
|
|
|
|
GArray*
|
|
|
|
g_rarray_prepend (GArray *array,
|
|
|
|
gpointer data,
|
|
|
|
gint size)
|
|
|
|
{
|
|
|
|
g_array_maybe_expand ((GRealArray*) array, size);
|
|
|
|
|
|
|
|
g_memmove (array->data + size, array->data, array->len);
|
|
|
|
memcpy (array->data, data, size);
|
|
|
|
|
|
|
|
array->len += size;
|
|
|
|
|
|
|
|
return array;
|
|
|
|
}
|
|
|
|
|
|
|
|
GArray*
|
|
|
|
g_rarray_truncate (GArray *array,
|
|
|
|
gint length,
|
|
|
|
gint size)
|
|
|
|
{
|
|
|
|
if (array->data)
|
|
|
|
memset (array->data + length * size, 0, size);
|
|
|
|
array->len = length * size;
|
|
|
|
return array;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static gint
|
|
|
|
g_nearest_pow (gint num)
|
|
|
|
{
|
|
|
|
gint n = 1;
|
|
|
|
|
|
|
|
while (n < num)
|
|
|
|
n <<= 1;
|
|
|
|
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
g_array_maybe_expand (GRealArray *array,
|
|
|
|
gint len)
|
|
|
|
{
|
|
|
|
guint old_alloc;
|
|
|
|
|
|
|
|
if ((array->len + len) > array->alloc)
|
|
|
|
{
|
|
|
|
old_alloc = array->alloc;
|
|
|
|
|
|
|
|
array->alloc = g_nearest_pow (array->len + array->zero_terminated + len);
|
|
|
|
array->alloc = MAX (array->alloc, MIN_ARRAY_SIZE);
|
|
|
|
array->data = g_realloc (array->data, array->alloc);
|
|
|
|
|
|
|
|
memset (array->data + old_alloc, 0, array->alloc - old_alloc);
|
|
|
|
}
|
|
|
|
}
|
1998-06-12 11:38:32 +02:00
|
|
|
|
|
|
|
/* Pointer Array
|
|
|
|
*/
|
|
|
|
|
|
|
|
typedef struct _GRealPtrArray GRealPtrArray;
|
|
|
|
|
|
|
|
struct _GRealPtrArray
|
|
|
|
{
|
|
|
|
gpointer *pdata;
|
|
|
|
guint len;
|
|
|
|
guint alloc;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void g_ptr_array_maybe_expand (GRealPtrArray *array,
|
|
|
|
gint len);
|
|
|
|
|
|
|
|
|
|
|
|
static GMemChunk *ptr_array_mem_chunk = NULL;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
GPtrArray*
|
|
|
|
g_ptr_array_new ()
|
|
|
|
{
|
|
|
|
GRealPtrArray *array;
|
|
|
|
|
|
|
|
if (!ptr_array_mem_chunk)
|
|
|
|
ptr_array_mem_chunk = g_mem_chunk_new ("array mem chunk",
|
|
|
|
sizeof (GRealPtrArray),
|
|
|
|
1024, G_ALLOC_AND_FREE);
|
|
|
|
|
|
|
|
array = g_chunk_new (GRealPtrArray, ptr_array_mem_chunk);
|
|
|
|
|
|
|
|
array->pdata = NULL;
|
|
|
|
array->len = 0;
|
|
|
|
array->alloc = 0;
|
|
|
|
|
|
|
|
return (GPtrArray*) array;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_ptr_array_free (GPtrArray *array,
|
|
|
|
gboolean free_segment)
|
|
|
|
{
|
|
|
|
g_return_if_fail (array);
|
|
|
|
|
|
|
|
if (free_segment)
|
|
|
|
g_free (array->pdata);
|
|
|
|
|
|
|
|
g_mem_chunk_free (ptr_array_mem_chunk, array);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
g_ptr_array_maybe_expand (GRealPtrArray *array,
|
|
|
|
gint len)
|
|
|
|
{
|
|
|
|
guint old_alloc;
|
|
|
|
|
|
|
|
if ((array->len + len) > array->alloc)
|
|
|
|
{
|
|
|
|
old_alloc = array->alloc;
|
|
|
|
|
|
|
|
array->alloc = g_nearest_pow (array->len + len);
|
|
|
|
array->alloc = MAX (array->alloc, MIN_ARRAY_SIZE);
|
|
|
|
if (array->pdata)
|
|
|
|
array->pdata = g_realloc (array->pdata, sizeof(gpointer) * array->alloc);
|
|
|
|
else
|
|
|
|
array->pdata = g_new0 (gpointer, array->alloc);
|
|
|
|
|
|
|
|
memset (array->pdata + old_alloc, 0, array->alloc - old_alloc);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_ptr_array_set_size (GPtrArray *farray,
|
|
|
|
gint length)
|
|
|
|
{
|
|
|
|
GRealPtrArray* array = (GRealPtrArray*) farray;
|
|
|
|
|
|
|
|
g_return_if_fail (array);
|
|
|
|
|
|
|
|
if (length > array->len)
|
|
|
|
g_ptr_array_maybe_expand (array, (length - array->len));
|
|
|
|
|
|
|
|
array->len = length;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_ptr_array_remove_index (GPtrArray* farray,
|
|
|
|
gint index)
|
|
|
|
{
|
|
|
|
GRealPtrArray* array = (GRealPtrArray*) farray;
|
|
|
|
|
|
|
|
g_return_if_fail (array);
|
|
|
|
|
1998-08-03 09:18:23 +02:00
|
|
|
g_return_if_fail (index < array->len);
|
1998-06-12 11:38:32 +02:00
|
|
|
|
|
|
|
array->pdata[index] = array->pdata[array->len - 1];
|
|
|
|
|
|
|
|
array->pdata[array->len - 1] = NULL;
|
|
|
|
|
|
|
|
array->len -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
gboolean
|
|
|
|
g_ptr_array_remove (GPtrArray* farray,
|
|
|
|
gpointer data)
|
|
|
|
{
|
|
|
|
GRealPtrArray* array = (GRealPtrArray*) farray;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
g_return_val_if_fail (array, FALSE);
|
|
|
|
|
|
|
|
for (i = 0; i < array->len; i += 1)
|
|
|
|
{
|
|
|
|
if (array->pdata[i] == data)
|
|
|
|
{
|
|
|
|
g_ptr_array_remove_index (farray, i);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_ptr_array_add (GPtrArray* farray,
|
|
|
|
gpointer data)
|
|
|
|
{
|
|
|
|
GRealPtrArray* array = (GRealPtrArray*) farray;
|
|
|
|
|
|
|
|
g_return_if_fail (array);
|
|
|
|
|
|
|
|
g_ptr_array_maybe_expand (array, 1);
|
|
|
|
|
|
|
|
array->pdata[array->len++] = data;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Byte arrays
|
|
|
|
*/
|
|
|
|
|
|
|
|
GByteArray* g_byte_array_new (void)
|
|
|
|
{
|
|
|
|
return (GByteArray*) g_array_new (FALSE);
|
|
|
|
}
|
|
|
|
|
|
|
|
void g_byte_array_free (GByteArray *array,
|
|
|
|
gint free_segment)
|
|
|
|
{
|
|
|
|
g_array_free ((GArray*) array, free_segment);
|
|
|
|
}
|
|
|
|
|
|
|
|
GByteArray* g_byte_array_append (GByteArray *array,
|
|
|
|
const guint8 *data,
|
|
|
|
guint len)
|
|
|
|
{
|
|
|
|
g_rarray_append ((GArray*) array, (guint8*)data, len);
|
|
|
|
|
|
|
|
return array;
|
|
|
|
}
|
|
|
|
|
|
|
|
GByteArray* g_byte_array_prepend (GByteArray *array,
|
|
|
|
const guint8 *data,
|
|
|
|
guint len)
|
|
|
|
{
|
|
|
|
g_rarray_prepend ((GArray*) array, (guint8*)data, len);
|
|
|
|
|
|
|
|
return array;
|
|
|
|
}
|
|
|
|
|
|
|
|
GByteArray* g_byte_array_truncate (GByteArray *array,
|
|
|
|
gint length)
|
|
|
|
{
|
|
|
|
g_rarray_truncate ((GArray*) array, length, 1);
|
|
|
|
|
|
|
|
return array;
|
|
|
|
}
|