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 Library 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 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
22 #include <glibconfig.h>
29 /* glib provides definitions for the extrema of many
30 * of the standard types. These are:
47 #define G_MINFLOAT FLT_MIN
48 #define G_MAXFLOAT FLT_MAX
49 #define G_MINDOUBLE DBL_MIN
50 #define G_MAXDOUBLE DBL_MAX
56 #define G_MINFLOAT MINFLOAT
57 #define G_MAXFLOAT MAXFLOAT
58 #define G_MINDOUBLE MINDOUBLE
59 #define G_MAXDOUBLE MAXDOUBLE
61 #endif /* HAVE_VALUES_H */
68 #define G_MINSHORT SHRT_MIN
69 #define G_MAXSHORT SHRT_MAX
70 #define G_MININT INT_MIN
71 #define G_MAXINT INT_MAX
72 #define G_MINLONG LONG_MIN
73 #define G_MAXLONG LONG_MAX
79 #endif /* HAVE_FLOAT_H */
81 #define G_MINSHORT MINSHORT
82 #define G_MAXSHORT MAXSHORT
83 #define G_MININT MININT
84 #define G_MAXINT MAXINT
85 #define G_MINLONG MINLONG
86 #define G_MAXLONG MAXLONG
88 #endif /* HAVE_VALUES_H */
91 /* Provide definitions for some commonly used macros.
92 * Some of them are only provided if they haven't already
93 * been defined. It is assumed that if they are already
94 * defined then the current definition is correct.
97 #define NULL ((void*) 0)
105 #define TRUE (!FALSE)
109 #define MAX(a, b) (((a) > (b)) ? (a) : (b))
112 #define MIN(a, b) (((a) < (b)) ? (a) : (b))
115 #define ABS(a) (((a) < 0) ? -(a) : (a))
118 #define CLAMP(x, low, high) (((x) > (high)) ? (high) : (((x) < (low)) ? (low) : (x)))
121 /* Provide simple enum value macro wrappers that ease automated enum value
122 * stringification code.
124 #if !defined (G_CODE_GENERATION)
125 #define G_ENUM( EnumerationName ) EnumerationName
126 #define G_FLAGS( EnumerationName ) EnumerationName
127 #define G_NV( VALUE_NAME , value_nick, VALUE) VALUE_NAME = (VALUE)
128 #define G_SV( VALUE_NAME, value_nick ) VALUE_NAME
129 #else /* G_CODE_GENERATION */
130 #define G_ENUM( EnumerationName ) G_ENUM_E + EnumerationName +
131 #define G_FLAGS( EnumerationName ) G_ENUM_F + EnumerationName +
132 #define G_NV( VALUE_NAME , value_nick, VALUE) G_ENUM_V + VALUE_NAME + value_nick +
133 #define G_SV( VALUE_NAME, value_nick ) G_ENUM_V + VALUE_NAME + value_nick +
134 #endif /* G_CODE_GENERATION */
137 /* Provide simple macro statement wrappers (adapted from Perl):
138 * G_STMT_START { statements; } G_STMT_END;
139 * can be used as a single statement, as in
140 * if (x) G_STMT_START { ... } G_STMT_END; else ...
142 * For gcc we will wrap the statements within `({' and `})' braces.
143 * For SunOS they will be wrapped within `if (1)' and `else (void) 0',
144 * and otherwise within `do' and `while (0)'.
146 #if !(defined (G_STMT_START) && defined (G_STMT_END))
147 # if defined (__GNUC__) && !defined (__STRICT_ANSI__) && !defined (__cplusplus)
148 # define G_STMT_START (void)(
149 # define G_STMT_END )
151 # if (defined (sun) || defined (__sun__))
152 # define G_STMT_START if (1)
153 # define G_STMT_END else (void)0
155 # define G_STMT_START do
156 # define G_STMT_END while (0)
161 /* Provide macros to feature the GCC function attribute.
163 #if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ > 4)
164 #define G_GNUC_PRINTF( format_idx, arg_idx ) \
165 __attribute__((format (printf, format_idx, arg_idx)))
166 #define G_GNUC_SCANF( format_idx, arg_idx ) \
167 __attribute__((format (scanf, format_idx, arg_idx)))
168 #define G_GNUC_FORMAT( arg_idx ) \
169 __attribute__((format_arg (arg_idx)))
170 #define G_GNUC_NORETURN \
171 __attribute__((noreturn))
172 #define G_GNUC_CONST \
173 __attribute__((const))
174 #else /* !__GNUC__ */
175 #define G_GNUC_PRINTF( format_idx, arg_idx )
176 #define G_GNUC_SCANF( format_idx, arg_idx )
177 #define G_GNUC_FORMAT( arg_idx )
178 #define G_GNUC_NORETURN
180 #endif /* !__GNUC__ */
182 /* Hacker macro to place breakpoints for x86 machines.
183 * Actual use is strongly deprecated of course ;)
185 #if defined (__i386__)
186 #define G_BREAKPOINT() G_STMT_START{ __asm__ ("int $03"); }G_STMT_END
187 #else /* !__i386__ */
188 #define G_BREAKPOINT()
189 #endif /* __i386__ */
191 /* Wrap the __PRETTY_FUNCTION__ and __FUNCTION__ variables with macros,
192 * so we can refer to them as strings unconditionally.
195 #define G_GNUC_FUNCTION (__FUNCTION__)
196 #define G_GNUC_PRETTY_FUNCTION (__PRETTY_FUNCTION__)
197 #else /* !__GNUC__ */
198 #define G_GNUC_FUNCTION ("")
199 #define G_GNUC_PRETTY_FUNCTION ("")
200 #endif /* !__GNUC__ */
205 # define ATEXIT(proc) (atexit (proc))
206 # elif defined (HAVE_ON_EXIT)
207 # define ATEXIT(proc) (on_exit ((void (*)(int, void *))(proc), NULL))
212 /* Provide macros for easily allocating memory. The macros
213 * will cast the allocated memory to the specified type
214 * in order to avoid compiler warnings. (Makes the code neater).
219 #define g_new(type,count) ALLOC(type,count)
220 #define g_new0(type,count) CALLOC(type,count)
222 #else /* __DMALLOC_H__ */
224 #define g_new(type, count) \
225 ((type *) g_malloc ((unsigned) sizeof (type) * (count)))
226 #define g_new0(type, count) \
227 ((type *) g_malloc0 ((unsigned) sizeof (type) * (count)))
228 #endif /* __DMALLOC_H__ */
230 #define g_mem_chunk_create(type, pre_alloc, alloc_type) ( \
231 g_mem_chunk_new (#type " mem chunks (" #pre_alloc ")", \
233 sizeof (type) * (pre_alloc), \
236 #define g_chunk_new(type, chunk) ( \
237 (type *) g_mem_chunk_alloc (chunk) \
239 #define g_chunk_new0(type, chunk) ( \
240 (type *) memset (g_mem_chunk_alloc (chunk), 0, sizeof (type)) \
242 #define g_chunk_free(mem, mem_chunk) G_STMT_START { \
243 g_mem_chunk_free ((mem_chunk), (mem)); \
246 #define g_string(x) #x
249 /* Provide macros for error handling. The "assert" macros will
250 * exit on failure. The "return" macros will exit the current
251 * function. Two different definitions are given for the macros
252 * in order to support gcc's __PRETTY_FUNCTION__ capability.
255 #ifdef G_DISABLE_ASSERT
257 #define g_assert(expr)
258 #define g_assert_not_reached()
260 #else /* !G_DISABLE_ASSERT */
264 #define g_assert(expr) G_STMT_START{\
266 g_error ("file %s: line %d (%s): \"%s\"", \
269 __PRETTY_FUNCTION__, \
272 #define g_assert_not_reached() G_STMT_START{ \
273 g_error ("file %s: line %d (%s): \"should not be reached\"", \
276 __PRETTY_FUNCTION__); }G_STMT_END
278 #else /* !__GNUC__ */
280 #define g_assert(expr) G_STMT_START{\
282 g_error ("file %s: line %d: \"%s\"", \
287 #define g_assert_not_reached() G_STMT_START{ \
288 g_error ("file %s: line %d: \"should not be reached\"", \
290 __LINE__); }G_STMT_END
292 #endif /* __GNUC__ */
294 #endif /* G_DISABLE_ASSERT */
296 #ifdef G_DISABLE_CHECKS
298 #define g_return_if_fail(expr)
299 #define g_return_val_if_fail(expr,val)
301 #else /* !G_DISABLE_CHECKS */
305 #define g_return_if_fail(expr) G_STMT_START{ \
308 g_warning ("file %s: line %d (%s): assertion \"%s\" failed.", \
311 __PRETTY_FUNCTION__, \
316 #define g_return_val_if_fail(expr,val) G_STMT_START{ \
319 g_warning ("file %s: line %d (%s): assertion \"%s\" failed.", \
322 __PRETTY_FUNCTION__, \
327 #else /* !__GNUC__ */
329 #define g_return_if_fail(expr) G_STMT_START{ \
332 g_warning ("file %s: line %d: assertion. \"%s\" failed", \
339 #define g_return_val_if_fail(expr, val) G_STMT_START{ \
342 g_warning ("file %s: line %d: assertion \"%s\" failed.", \
349 #endif /* !__GNUC__ */
351 #endif /* G_DISABLE_CHECKS */
357 #endif /* __cplusplus */
359 /* Provide type definitions for commonly used types.
360 * These are useful because a "gint8" can be adjusted
361 * to be 1 byte (8 bits) on all platforms. Similarly and
362 * more importantly, "gint32" can be adjusted to be
363 * 4 bytes (32 bits) on all platforms.
367 typedef short gshort;
370 typedef gint gboolean;
372 typedef unsigned char guchar;
373 typedef unsigned short gushort;
374 typedef unsigned long gulong;
375 typedef unsigned int guint;
377 typedef float gfloat;
378 typedef double gdouble;
380 /* HAVE_LONG_DOUBLE doesn't work correctly on all platforms.
381 * Since gldouble isn't used anywhere, just disable it for now */
384 #ifdef HAVE_LONG_DOUBLE
385 typedef long double gldouble;
386 #else /* HAVE_LONG_DOUBLE */
387 typedef double gldouble;
388 #endif /* HAVE_LONG_DOUBLE */
391 typedef void* gpointer;
392 typedef const void *gconstpointer;
394 #if (SIZEOF_CHAR == 1)
395 typedef signed char gint8;
396 typedef unsigned char guint8;
397 #endif /* SIZEOF_CHAR */
400 #if (SIZEOF_SHORT == 2)
401 typedef signed short gint16;
402 typedef unsigned short guint16;
403 #endif /* SIZEOF_SHORT */
406 #if (SIZEOF_INT == 4)
407 typedef signed int gint32;
408 typedef unsigned int guint32;
409 #elif (SIZEOF_LONG == 4)
410 typedef signed long gint32;
411 typedef unsigned long guint32;
412 #endif /* SIZEOF_INT */
414 #if (SIZEOF_LONG == 8)
415 #define HAVE_GINT64 1
416 typedef signed long gint64;
417 typedef unsigned long guint64;
418 #elif (SIZEOF_LONG_LONG == 8)
419 #define HAVE_GINT64 1
420 typedef signed long long gint64;
421 typedef unsigned long long guint64;
428 /* Define macros for storing integers inside pointers */
430 #if (SIZEOF_INT == SIZEOF_VOID_P)
432 #define GPOINTER_TO_INT(p) ((gint)(p))
433 #define GPOINTER_TO_UINT(p) ((guint)(p))
435 #define GINT_TO_POINTER(i) ((gpointer)(i))
436 #define GUINT_TO_POINTER(u) ((gpointer)(u))
438 #elif (SIZEOF_LONG == SIZEOF_VOID_P)
440 #define GPOINTER_TO_INT(p) ((gint)(glong)(p))
441 #define GPOINTER_TO_UINT(p) ((guint)(gulong)(p))
443 #define GINT_TO_POINTER(i) ((gpointer)(glong)(i))
444 #define GUINT_TO_POINTER(u) ((gpointer)(gulong)(u))
447 /* This should never happen */
450 typedef gint32 gssize;
451 typedef guint32 gsize;
452 typedef guint32 GQuark;
453 typedef gint32 GTime;
455 typedef struct _GList GList;
456 typedef struct _GSList GSList;
457 typedef struct _GHashTable GHashTable;
458 typedef struct _GCache GCache;
459 typedef struct _GTree GTree;
460 typedef struct _GTimer GTimer;
461 typedef struct _GMemChunk GMemChunk;
462 typedef struct _GListAllocator GListAllocator;
463 typedef struct _GStringChunk GStringChunk;
464 typedef struct _GString GString;
465 typedef struct _GArray GArray;
466 typedef struct _GPtrArray GPtrArray;
467 typedef struct _GByteArray GByteArray;
468 typedef struct _GDebugKey GDebugKey;
469 typedef struct _GScannerConfig GScannerConfig;
470 typedef struct _GScanner GScanner;
471 typedef union _GValue GValue;
472 typedef struct _GCompletion GCompletion;
473 typedef struct _GRelation GRelation;
474 typedef struct _GTuples GTuples;
475 typedef struct _GNode GNode;
478 typedef void (*GFunc) (gpointer data,
480 typedef void (*GHFunc) (gpointer key,
483 typedef gpointer (*GCacheNewFunc) (gpointer key);
484 typedef gpointer (*GCacheDupFunc) (gpointer value);
485 typedef void (*GCacheDestroyFunc) (gpointer value);
486 typedef gint (*GTraverseFunc) (gpointer key,
489 typedef gboolean (*GNodeTraverseFunc) (GNode *node,
491 typedef void (*GNodeForeachFunc) (GNode *node,
493 typedef gint (*GSearchFunc) (gpointer key,
495 typedef void (*GErrorFunc) (gchar *str);
496 typedef void (*GWarningFunc) (gchar *str);
497 typedef void (*GPrintFunc) (gchar *str);
498 typedef void (*GScannerMsgFunc) (GScanner *scanner,
501 typedef void (*GDestroyNotify) (gpointer data);
503 typedef guint (*GHashFunc) (gconstpointer key);
504 typedef gint (*GCompareFunc) (gconstpointer a,
506 typedef gchar* (*GCompletionFunc) (gpointer);
556 struct _GCache { gint dummy; };
557 struct _GTree { gint dummy; };
558 struct _GTimer { gint dummy; };
559 struct _GMemChunk { gint dummy; };
560 struct _GListAllocator { gint dummy; };
561 struct _GStringChunk { gint dummy; };
573 G_TRAVERSE_LEAFS = 1 << 0,
574 G_TRAVERSE_NON_LEAFS = 1 << 1,
575 G_TRAVERSE_ALL = G_TRAVERSE_LEAFS | G_TRAVERSE_NON_LEAFS,
576 G_TRAVERSE_MASK = 0x03
579 /* Doubly linked lists
581 GList* g_list_alloc (void);
582 void g_list_free (GList *list);
583 void g_list_free_1 (GList *list);
584 GList* g_list_append (GList *list,
586 GList* g_list_prepend (GList *list,
588 GList* g_list_insert (GList *list,
591 GList* g_list_insert_sorted (GList *list,
594 GList* g_list_concat (GList *list1,
596 GList* g_list_remove (GList *list,
598 GList* g_list_remove_link (GList *list,
600 GList* g_list_reverse (GList *list);
601 GList* g_list_nth (GList *list,
603 GList* g_list_find (GList *list,
605 GList* g_list_find_custom (GList *list,
608 gint g_list_position (GList *list,
610 gint g_list_index (GList *list,
612 GList* g_list_last (GList *list);
613 GList* g_list_first (GList *list);
614 guint g_list_length (GList *list);
615 void g_list_foreach (GList *list,
618 gpointer g_list_nth_data (GList *list,
621 #define g_list_previous(list) ((list) ? (((GList *)(list))->prev) : NULL)
622 #define g_list_next(list) ((list) ? (((GList *)(list))->next) : NULL)
624 /* Singly linked lists
626 GSList* g_slist_alloc (void);
627 void g_slist_free (GSList *list);
628 void g_slist_free_1 (GSList *list);
629 GSList* g_slist_append (GSList *list,
631 GSList* g_slist_prepend (GSList *list,
633 GSList* g_slist_insert (GSList *list,
636 GSList* g_slist_insert_sorted (GSList *list,
639 GSList* g_slist_concat (GSList *list1,
641 GSList* g_slist_remove (GSList *list,
643 GSList* g_slist_remove_link (GSList *list,
645 GSList* g_slist_reverse (GSList *list);
646 GSList* g_slist_nth (GSList *list,
648 GSList* g_slist_find (GSList *list,
650 GSList* g_slist_find_custom (GSList *list,
653 gint g_slist_position (GSList *list,
655 gint g_slist_index (GSList *list,
657 GSList* g_slist_last (GSList *list);
658 guint g_slist_length (GSList *list);
659 void g_slist_foreach (GSList *list,
662 gpointer g_slist_nth_data (GSList *list,
665 #define g_slist_next(slist) ((slist) ? (((GSList *)(slist))->next) : NULL)
669 GListAllocator* g_list_allocator_new (void);
670 void g_list_allocator_free (GListAllocator* allocator);
671 GListAllocator* g_slist_set_allocator (GListAllocator* allocator);
672 GListAllocator* g_list_set_allocator (GListAllocator* allocator);
677 GHashTable* g_hash_table_new (GHashFunc hash_func,
678 GCompareFunc key_compare_func);
679 void g_hash_table_destroy (GHashTable *hash_table);
680 void g_hash_table_insert (GHashTable *hash_table,
683 void g_hash_table_remove (GHashTable *hash_table,
685 gpointer g_hash_table_lookup (GHashTable *hash_table,
687 gboolean g_hash_table_lookup_extended(GHashTable *hash_table,
688 gconstpointer lookup_key,
691 void g_hash_table_freeze (GHashTable *hash_table);
692 void g_hash_table_thaw (GHashTable *hash_table);
693 void g_hash_table_foreach (GHashTable *hash_table,
696 gint g_hash_table_size (GHashTable *hash_table);
701 GCache* g_cache_new (GCacheNewFunc value_new_func,
702 GCacheDestroyFunc value_destroy_func,
703 GCacheDupFunc key_dup_func,
704 GCacheDestroyFunc key_destroy_func,
705 GHashFunc hash_key_func,
706 GHashFunc hash_value_func,
707 GCompareFunc key_compare_func);
708 void g_cache_destroy (GCache *cache);
709 gpointer g_cache_insert (GCache *cache,
711 void g_cache_remove (GCache *cache,
713 void g_cache_key_foreach (GCache *cache,
716 void g_cache_value_foreach (GCache *cache,
721 /* Balanced binary trees
723 GTree* g_tree_new (GCompareFunc key_compare_func);
724 void g_tree_destroy (GTree *tree);
725 void g_tree_insert (GTree *tree,
728 void g_tree_remove (GTree *tree,
730 gpointer g_tree_lookup (GTree *tree,
732 void g_tree_traverse (GTree *tree,
733 GTraverseFunc traverse_func,
734 GTraverseType traverse_type,
736 gpointer g_tree_search (GTree *tree,
737 GSearchFunc search_func,
739 gint g_tree_height (GTree *tree);
740 gint g_tree_nnodes (GTree *tree);
744 /* N-way tree implementation
755 #define G_NODE_IS_ROOT(node) (((GNode*) (node))->parent == NULL && \
756 ((GNode*) (node))->prev == NULL && \
757 ((GNode*) (node))->next == NULL)
758 #define G_NODE_IS_LEAF(node) (((GNode*) (node))->children == NULL)
760 GNode* g_node_new (gpointer data);
761 void g_node_destroy (GNode *root);
762 void g_node_unlink (GNode *node);
763 void g_node_insert (GNode *parent,
766 void g_node_insert_before (GNode *parent,
769 void g_node_prepend (GNode *parent,
771 guint g_node_n_nodes (GNode *root,
772 GTraverseFlags flags);
773 GNode* g_node_get_root (GNode *node);
774 gboolean g_node_is_ancestor (GNode *node,
776 guint g_node_depth (GNode *node);
777 GNode* g_node_find (GNode *root,
779 GTraverseFlags flags,
782 /* convenience macros */
783 #define g_node_append(parent, node) G_STMT_START { \
784 g_node_insert_before ((parent), NULL, (node)); \
786 #define g_node_insert_data(parent, position, data) G_STMT_START { \
787 g_node_insert ((parent), (position), g_node_new ((data))); \
789 #define g_node_insert_data_before(parent, sibling, data) G_STMT_START { \
790 g_node_insert_before ((parent), (sibling), g_node_new ((data))); \
792 #define g_node_prepend_data(parent, data) G_STMT_START { \
793 g_node_prepend ((parent), g_node_new ((data))); \
795 #define g_node_append_data(parent, data) G_STMT_START { \
796 g_node_insert_before ((parent), NULL, g_node_new ((data))); \
799 /* traversal function, assumes that `node' is root
800 * (only traverses `node' and its subtree).
801 * this function is just a high level interface to
802 * low level traversal functions, optimized for speed.
804 void g_node_traverse (GNode *root,
806 GTraverseFlags flags,
808 GNodeTraverseFunc func,
811 /* return the maximum tree height starting with `node', this is an expensive
812 * operation, since we need to visit all nodes. this could be shortened by
813 * adding `guint height' to struct _GNode, but then again, this is not very
814 * often needed, and would make g_node_insert() more time consuming.
816 guint g_node_max_height (GNode *root);
818 void g_node_children_foreach (GNode *node,
819 GTraverseFlags flags,
820 GNodeForeachFunc func,
822 void g_node_reverse_children (GNode *node);
823 guint g_node_n_children (GNode *node);
824 GNode* g_node_nth_child (GNode *node,
826 GNode* g_node_last_child (GNode *node);
827 GNode* g_node_find_child (GNode *node,
828 GTraverseFlags flags,
830 gint g_node_child_position (GNode *node,
832 gint g_node_child_index (GNode *node,
835 GNode* g_node_first_sibling (GNode *node);
836 GNode* g_node_last_sibling (GNode *node);
838 #define g_node_prev_sibling(node) ((node) ? \
839 ((GNode*) (node))->prev : NULL)
840 #define g_node_next_sibling(node) ((node) ? \
841 ((GNode*) (node))->next : NULL)
842 #define g_node_first_child(node) ((node) ? \
843 ((GNode*) (node))->children : NULL)
852 #define g_malloc(size) (gpointer) MALLOC(size)
853 #define g_malloc0(size) (gpointer) CALLOC(char,size)
854 #define g_realloc(mem,size) (gpointer) REALLOC(mem,char,size)
855 #define g_free(mem) FREE(mem)
857 #else /* USE_DMALLOC */
859 gpointer g_malloc (gulong size);
860 gpointer g_malloc0 (gulong size);
861 gpointer g_realloc (gpointer mem,
863 void g_free (gpointer mem);
865 #endif /* USE_DMALLOC */
867 void g_mem_profile (void);
868 void g_mem_check (gpointer mem);
871 /* "g_mem_chunk_new" creates a new memory chunk.
872 * Memory chunks are used to allocate pieces of memory which are
873 * always the same size. Lists are a good example of such a data type.
874 * The memory chunk allocates and frees blocks of memory as needed.
875 * Just be sure to call "g_mem_chunk_free" and not "g_free" on data
876 * allocated in a mem chunk. ("g_free" will most likely cause a seg
877 * fault...somewhere).
879 * Oh yeah, GMemChunk is an opaque data type. (You don't really
880 * want to know what's going on inside do you?)
883 /* ALLOC_ONLY MemChunk's can only allocate memory. The free operation
884 * is interpreted as a no op. ALLOC_ONLY MemChunk's save 4 bytes per
885 * atom. (They are also useful for lists which use MemChunk to allocate
886 * memory but are also part of the MemChunk implementation).
887 * ALLOC_AND_FREE MemChunk's can allocate and free memory.
890 #define G_ALLOC_ONLY 1
891 #define G_ALLOC_AND_FREE 2
893 GMemChunk* g_mem_chunk_new (gchar *name,
897 void g_mem_chunk_destroy (GMemChunk *mem_chunk);
898 gpointer g_mem_chunk_alloc (GMemChunk *mem_chunk);
899 void g_mem_chunk_free (GMemChunk *mem_chunk,
901 void g_mem_chunk_clean (GMemChunk *mem_chunk);
902 void g_mem_chunk_reset (GMemChunk *mem_chunk);
903 void g_mem_chunk_print (GMemChunk *mem_chunk);
904 void g_mem_chunk_info (void);
906 /* Ah yes...we have a "g_blow_chunks" function.
907 * "g_blow_chunks" simply compresses all the chunks. This operation
908 * consists of freeing every memory area that should be freed (but
909 * which we haven't gotten around to doing yet). And, no,
910 * "g_blow_chunks" doesn't follow the naming scheme, but it is a
911 * much better name than "g_mem_chunk_clean_all" or something
914 void g_blow_chunks (void);
919 GTimer* g_timer_new (void);
920 void g_timer_destroy (GTimer *timer);
921 void g_timer_start (GTimer *timer);
922 void g_timer_stop (GTimer *timer);
923 void g_timer_reset (GTimer *timer);
924 gdouble g_timer_elapsed (GTimer *timer,
925 gulong *microseconds);
930 void g_error (const gchar *format, ...) G_GNUC_PRINTF (1, 2);
931 void g_warning (const gchar *format, ...) G_GNUC_PRINTF (1, 2);
932 void g_message (const gchar *format, ...) G_GNUC_PRINTF (1, 2);
933 void g_print (const gchar *format, ...) G_GNUC_PRINTF (1, 2);
936 /* String utility functions
938 #define G_STR_DELIMITERS "_-|> <."
939 void g_strdelimit (gchar *string,
940 const gchar *delimiters,
941 gchar new_delimiter);
942 gchar* g_strdup (const gchar *str);
943 gchar* g_strconcat (const gchar *string1,
944 ...); /* NULL terminated */
945 gdouble g_strtod (const gchar *nptr,
947 gchar* g_strerror (gint errnum);
948 gchar* g_strsignal (gint signum);
949 gint g_strcasecmp (const gchar *s1,
951 void g_strdown (gchar *string);
952 void g_strup (gchar *string);
953 void g_strreverse (gchar *string);
956 /* Retrive static info
958 gchar* g_get_user_name (void);
959 gchar* g_get_real_name (void);
960 gchar* g_get_home_dir (void);
961 gchar* g_get_tmp_dir (void);
962 gchar* g_get_prgname (void);
963 void g_set_prgname (const gchar *prgname);
966 /* Miscellaneous utility functions
968 guint g_parse_debug_string (const gchar *string,
971 gint g_snprintf (gchar *string,
974 ...) G_GNUC_PRINTF (3, 4);
975 gchar* g_basename (const gchar *file_name);
977 /* strings are newly allocated with g_malloc() */
978 gchar* g_dirname (const gchar *file_name);
979 gchar* g_get_current_dir (void);
982 /* We make the assumption that if memmove isn't available, then
983 * bcopy will do the job. This isn't safe everywhere. (bcopy can't
984 * necessarily handle overlapping copies) */
986 #define g_memmove memmove
988 #define g_memmove(a,b,c) bcopy((b), (a), (c))
993 GErrorFunc g_set_error_handler (GErrorFunc func);
994 GWarningFunc g_set_warning_handler (GWarningFunc func);
995 GPrintFunc g_set_message_handler (GPrintFunc func);
996 GPrintFunc g_set_print_handler (GPrintFunc func);
998 void g_debug (const gchar *progname);
999 void g_attach_process (const gchar *progname,
1001 void g_stack_trace (const gchar *progname,
1008 GStringChunk* g_string_chunk_new (gint size);
1009 void g_string_chunk_free (GStringChunk *chunk);
1010 gchar* g_string_chunk_insert (GStringChunk *chunk,
1011 const gchar *string);
1012 gchar* g_string_chunk_insert_const (GStringChunk *chunk,
1013 const gchar *string);
1017 GString* g_string_new (const gchar *init);
1018 GString* g_string_sized_new (guint dfl_size);
1019 void g_string_free (GString *string,
1021 GString* g_string_assign (GString *lval,
1023 GString* g_string_truncate (GString *string,
1025 GString* g_string_append (GString *string,
1027 GString* g_string_append_c (GString *string,
1029 GString* g_string_prepend (GString *string,
1031 GString* g_string_prepend_c (GString *string,
1033 GString* g_string_insert (GString *string,
1036 GString* g_string_insert_c (GString *string,
1039 GString* g_string_erase (GString *string,
1042 GString* g_string_down (GString *string);
1043 GString* g_string_up (GString *string);
1044 void g_string_sprintf (GString *string,
1045 const gchar *format,
1046 ...) G_GNUC_PRINTF (2, 3);
1047 void g_string_sprintfa (GString *string,
1048 const gchar *format,
1049 ...) G_GNUC_PRINTF (2, 3);
1053 #define g_array_length(array,type) \
1054 (((array)->len)/sizeof(type))
1055 #define g_array_append_val(array,type,val) \
1056 g_rarray_append (array, (gpointer) &val, sizeof (type))
1057 #define g_array_append_vals(array,type,vals,nvals) \
1058 g_rarray_append (array, (gpointer) vals, sizeof (type) * nvals)
1059 #define g_array_prepend_val(array,type,val) \
1060 g_rarray_prepend (array, (gpointer) &val, sizeof (type))
1061 #define g_array_prepend_vals(array,type,vals,nvals) \
1062 g_rarray_prepend (array, (gpointer) vals, sizeof (type) * nvals)
1063 #define g_array_truncate(array,type,length) \
1064 g_rarray_truncate (array, length, sizeof (type))
1065 #define g_array_index(array,type,index) \
1066 ((type*) array->data)[index]
1068 GArray* g_array_new (gint zero_terminated);
1069 void g_array_free (GArray *array,
1071 GArray* g_rarray_append (GArray *array,
1074 GArray* g_rarray_prepend (GArray *array,
1077 GArray* g_rarray_truncate (GArray *array,
1081 /* Resizable pointer array. This interface is much less complicated
1082 * than the above. Add appends appends a pointer. Remove fills any
1083 * cleared spot and shortens the array.
1086 #define g_ptr_array_index(array,index) (array->pdata)[index]
1088 GPtrArray* g_ptr_array_new (void);
1089 void g_ptr_array_free (GPtrArray *array,
1091 void g_ptr_array_set_size (GPtrArray *array,
1093 void g_ptr_array_remove_index (GPtrArray *array,
1095 gboolean g_ptr_array_remove (GPtrArray *array,
1097 void g_ptr_array_add (GPtrArray *array,
1100 /* Byte arrays, an array of guint8. Implemented as a GArray,
1104 GByteArray* g_byte_array_new (void);
1105 void g_byte_array_free (GByteArray *array,
1108 GByteArray* g_byte_array_append (GByteArray *array,
1112 GByteArray* g_byte_array_prepend (GByteArray *array,
1116 GByteArray* g_byte_array_truncate (GByteArray *array,
1122 gint g_str_equal (gconstpointer v,
1124 guint g_str_hash (gconstpointer v);
1126 gint g_int_equal (gconstpointer v,
1128 guint g_int_hash (gconstpointer v);
1130 /* This "hash" function will just return the key's adress as an
1131 * unsigned integer. Useful for hashing on plain adresses or
1132 * simple integer values.
1134 guint g_direct_hash (gconstpointer v);
1135 gint g_direct_equal (gconstpointer v,
1139 /* Quarks (string<->id association)
1141 GQuark g_quark_try_string (const gchar *string);
1142 GQuark g_quark_from_static_string (const gchar *string);
1143 GQuark g_quark_from_string (const gchar *string);
1144 gchar* g_quark_to_string (GQuark quark);
1146 /* Location Associated Data
1148 void g_dataset_destroy (gconstpointer dataset_location);
1149 gpointer g_dataset_id_get_data (gconstpointer dataset_location,
1151 void g_dataset_id_set_data_full (gconstpointer dataset_location,
1154 GDestroyNotify destroy_func);
1155 void g_dataset_id_set_destroy (gconstpointer dataset_location,
1157 GDestroyNotify destroy_func);
1159 #define g_dataset_id_set_data(l,k,d) G_STMT_START{g_dataset_id_set_data_full((l),(k),(d),NULL);}G_STMT_END
1160 #define g_dataset_id_remove_data(l,k) G_STMT_START{g_dataset_id_set_data((l),(k),NULL);}G_STMT_END
1161 #define g_dataset_get_data(l,k) (g_dataset_id_get_data((l),g_quark_try_string(k)))
1162 #define g_dataset_set_data_full(l,k,d,f) G_STMT_START{g_dataset_id_set_data_full((l),g_quark_from_string(k),(d),(f));}G_STMT_END
1163 #define g_dataset_set_destroy(l,k,f) G_STMT_START{g_dataset_id_set_destroy((l),g_quark_from_string(k),(f));}G_STMT_END
1164 #define g_dataset_set_data(l,k,d) G_STMT_START{g_dataset_set_data_full((l),(k),(d),NULL);}G_STMT_END
1165 #define g_dataset_remove_data(l,k) G_STMT_START{g_dataset_set_data((l),(k),NULL);}G_STMT_END
1168 /* GScanner: Flexible lexical scanner for general purpose.
1171 /* Character sets */
1172 #define G_CSET_A_2_Z "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
1173 #define G_CSET_a_2_z "abcdefghijklmnopqrstuvwxyz"
1174 #define G_CSET_LATINC "\300\301\302\303\304\305\306"\
1175 "\307\310\311\312\313\314\315\316\317\320"\
1176 "\321\322\323\324\325\326"\
1177 "\330\331\332\333\334\335\336"
1178 #define G_CSET_LATINS "\337\340\341\342\343\344\345\346"\
1179 "\347\350\351\352\353\354\355\356\357\360"\
1180 "\361\362\363\364\365\366"\
1181 "\370\371\372\373\374\375\376\377"
1188 G_ERR_UNEXP_EOF_IN_STRING,
1189 G_ERR_UNEXP_EOF_IN_COMMENT,
1190 G_ERR_NON_DIGIT_IN_CONST,
1193 G_ERR_FLOAT_MALFORMED
1201 G_TOKEN_LEFT_PAREN = '(',
1202 G_TOKEN_RIGHT_PAREN = ')',
1203 G_TOKEN_LEFT_CURLY = '{',
1204 G_TOKEN_RIGHT_CURLY = '}',
1205 G_TOKEN_LEFT_BRACE = '[',
1206 G_TOKEN_RIGHT_BRACE = ']',
1207 G_TOKEN_EQUAL_SIGN = '=',
1208 G_TOKEN_COMMA = ',',
1224 G_TOKEN_IDENTIFIER_NULL,
1226 G_TOKEN_COMMENT_SINGLE,
1227 G_TOKEN_COMMENT_MULTI,
1234 gchar *v_identifier;
1246 struct _GScannerConfig
1250 gchar *cset_skip_characters; /* default: " \t\n" */
1251 gchar *cset_identifier_first;
1252 gchar *cset_identifier_nth;
1253 gchar *cpair_comment_single; /* default: "#\n" */
1255 /* Should symbol lookup work case sensitive?
1257 guint case_sensitive : 1;
1259 /* Boolean values to be adjusted "on the fly"
1260 * to configure scanning behaviour.
1262 guint skip_comment_multi : 1; /* C like comment */
1263 guint skip_comment_single : 1; /* single line comment */
1264 guint scan_comment_multi : 1; /* scan multi line comments? */
1265 guint scan_identifier : 1;
1266 guint scan_identifier_1char : 1;
1267 guint scan_identifier_NULL : 1;
1268 guint scan_symbols : 1;
1269 guint scan_binary : 1;
1270 guint scan_octal : 1;
1271 guint scan_float : 1;
1272 guint scan_hex : 1; /* `0x0ff0' */
1273 guint scan_hex_dollar : 1; /* `$0ff0' */
1274 guint scan_string_sq : 1; /* string: 'anything' */
1275 guint scan_string_dq : 1; /* string: "\\-escapes!\n" */
1276 guint numbers_2_int : 1; /* bin, octal, hex => int */
1277 guint int_2_float : 1; /* int => G_TOKEN_FLOAT? */
1278 guint identifier_2_string : 1;
1279 guint char_2_token : 1; /* return G_TOKEN_CHAR? */
1280 guint symbol_2_token : 1;
1281 guint scope_0_fallback : 1; /* try scope 0 on lookups? */
1288 guint max_parse_errors;
1290 /* g_scanner_error() increments this field */
1293 /* name of input stream, featured by the default message handler */
1294 const gchar *input_name;
1296 /* data pointer for derived structures */
1297 gpointer derived_data;
1299 /* link into the scanner configuration */
1300 GScannerConfig *config;
1302 /* fields filled in after g_scanner_get_next_token() */
1308 /* fields filled in after g_scanner_peek_next_token() */
1309 GTokenType next_token;
1312 guint next_position;
1314 /* to be considered private */
1315 GHashTable *symbol_table;
1322 /* handler function for _warn and _error */
1323 GScannerMsgFunc msg_handler;
1326 GScanner* g_scanner_new (GScannerConfig *config_templ);
1327 void g_scanner_destroy (GScanner *scanner);
1328 void g_scanner_input_file (GScanner *scanner,
1330 void g_scanner_input_text (GScanner *scanner,
1333 GTokenType g_scanner_get_next_token (GScanner *scanner);
1334 GTokenType g_scanner_peek_next_token (GScanner *scanner);
1335 GTokenType g_scanner_cur_token (GScanner *scanner);
1336 GValue g_scanner_cur_value (GScanner *scanner);
1337 guint g_scanner_cur_line (GScanner *scanner);
1338 guint g_scanner_cur_position (GScanner *scanner);
1339 gboolean g_scanner_eof (GScanner *scanner);
1340 guint g_scanner_set_scope (GScanner *scanner,
1342 void g_scanner_scope_add_symbol (GScanner *scanner,
1344 const gchar *symbol,
1346 void g_scanner_scope_remove_symbol (GScanner *scanner,
1348 const gchar *symbol);
1349 gpointer g_scanner_scope_lookup_symbol (GScanner *scanner,
1351 const gchar *symbol);
1352 void g_scanner_scope_foreach_symbol (GScanner *scanner,
1355 gpointer func_data);
1356 gpointer g_scanner_lookup_symbol (GScanner *scanner,
1357 const gchar *symbol);
1358 void g_scanner_freeze_symbol_table (GScanner *scanner);
1359 void g_scanner_thaw_symbol_table (GScanner *scanner);
1360 void g_scanner_unexp_token (GScanner *scanner,
1361 GTokenType expected_token,
1362 const gchar *identifier_spec,
1363 const gchar *symbol_spec,
1364 const gchar *symbol_name,
1365 const gchar *message,
1367 void g_scanner_error (GScanner *scanner,
1368 const gchar *format,
1369 ...) G_GNUC_PRINTF (2,3);
1370 void g_scanner_warn (GScanner *scanner,
1371 const gchar *format,
1372 ...) G_GNUC_PRINTF (2,3);
1373 gint g_scanner_stat_mode (const gchar *filename);
1374 /* keep downward source compatibility */
1375 #define g_scanner_add_symbol( scanner, symbol, value ) G_STMT_START { \
1376 g_scanner_scope_add_symbol ((scanner), 0, (symbol), (value)); \
1378 #define g_scanner_remove_symbol( scanner, symbol ) G_STMT_START { \
1379 g_scanner_scope_remove_symbol ((scanner), 0, (symbol)); \
1381 #define g_scanner_foreach_symbol( scanner, func, data ) G_STMT_START { \
1382 g_scanner_scope_foreach_symbol ((scanner), 0, (func), (data)); \
1392 GCompletionFunc func;
1398 GCompletion* g_completion_new (GCompletionFunc func);
1399 void g_completion_add_items (GCompletion* cmp,
1401 void g_completion_remove_items (GCompletion* cmp,
1403 void g_completion_clear_items (GCompletion* cmp);
1404 GList* g_completion_complete (GCompletion* cmp,
1406 gchar** new_prefix);
1407 void g_completion_free (GCompletion* cmp);
1410 /* GRelation: Indexed Relations. Imagine a really simple table in a
1411 * database. Relations are not ordered. This data type is meant for
1412 * maintaining a N-way mapping.
1414 * g_relation_new() creates a relation with FIELDS fields
1416 * g_relation_destroy() frees all resources
1417 * g_tuples_destroy() frees the result of g_relation_select()
1419 * g_relation_index() indexes relation FIELD with the provided
1420 * equality and hash functions. this must be done before any
1421 * calls to insert are made.
1423 * g_relation_insert() inserts a new tuple. you are expected to
1424 * provide the right number of fields.
1426 * g_relation_delete() deletes all relations with KEY in FIELD
1427 * g_relation_select() returns ...
1428 * g_relation_count() counts ...
1431 GRelation* g_relation_new (gint fields);
1432 void g_relation_destroy (GRelation *relation);
1433 void g_relation_index (GRelation *relation,
1435 GHashFunc hash_func,
1436 GCompareFunc key_compare_func);
1437 void g_relation_insert (GRelation *relation,
1439 gint g_relation_delete (GRelation *relation,
1442 GTuples* g_relation_select (GRelation *relation,
1445 gint g_relation_count (GRelation *relation,
1448 gboolean g_relation_exists (GRelation *relation,
1450 void g_relation_print (GRelation *relation);
1452 void g_tuples_destroy (GTuples *tuples);
1453 gpointer g_tuples_index (GTuples *tuples,
1460 extern const guint glib_major_version;
1461 extern const guint glib_minor_version;
1462 extern const guint glib_micro_version;
1463 extern const guint glib_interface_age;
1464 extern const guint glib_binary_age;
1468 #endif /* __cplusplus */
1471 #endif /* __G_LIB_H__ */