1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * gthread.c: MT safety related functions
5 * Copyright 1998 Sebastian Wilhelmi; University of Karlsruhe
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2 of the License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with this library; if not, write to the
20 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
21 * Boston, MA 02111-1307, USA.
24 /* Prelude {{{1 ----------------------------------------------------------- */
27 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
28 * file for a list of people on the GLib Team. See the ChangeLog
29 * files for a list of changes. These files are distributed with
30 * GLib at ftp://ftp.gtk.org/pub/gtk/.
37 /* implement gthread.h's inline functions */
38 #define G_IMPLEMENT_INLINES 1
39 #define __G_THREAD_C__
44 #include "gthreadprivate.h"
45 #include "deprecated/gthread.h"
58 #endif /* G_OS_WIN32 */
64 #include "gtestutils.h"
69 * @short_description: portable support for threads, mutexes, locks,
70 * conditions and thread private data
71 * @see_also: #GThreadPool, #GAsyncQueue
73 * Threads act almost like processes, but unlike processes all threads
74 * of one process share the same memory. This is good, as it provides
75 * easy communication between the involved threads via this shared
76 * memory, and it is bad, because strange things (so called
77 * "Heisenbugs") might happen if the program is not carefully designed.
78 * In particular, due to the concurrent nature of threads, no
79 * assumptions on the order of execution of code running in different
80 * threads can be made, unless order is explicitly forced by the
81 * programmer through synchronization primitives.
83 * The aim of the thread-related functions in GLib is to provide a
84 * portable means for writing multi-threaded software. There are
85 * primitives for mutexes to protect the access to portions of memory
86 * (#GMutex, #GRecMutex and #GRWLock). There is a facility to use
87 * individual bits for locks (g_bit_lock()). There are primitives
88 * for condition variables to allow synchronization of threads (#GCond).
89 * There are primitives for thread-private data - data that every thread
90 * has a private instance of (#GPrivate, #GStaticPrivate). There are
91 * facilities for one-time initialization (#GOnce, g_once_init_enter()).
92 * Finally there are primitives to create and manage threads (#GThread).
94 * The threading system is initialized with g_thread_init().
95 * You may call any other glib functions in the main thread before
96 * g_thread_init() as long as g_thread_init() is not called from
97 * a GLib callback, or with any locks held. However, many libraries
98 * above GLib does not support late initialization of threads, so
99 * doing this should be avoided if possible.
101 * Please note that since version 2.24 the GObject initialization
102 * function g_type_init() initializes threads. Since 2.32, creating
103 * a mainloop will do so too. As a consequence, most applications,
104 * including those using GTK+ will run with threads enabled.
106 * After calling g_thread_init(), GLib is completely thread safe
107 * (all global data is automatically locked), but individual data
108 * structure instances are not automatically locked for performance
109 * reasons. So, for example you must coordinate accesses to the same
110 * #GHashTable from multiple threads. The two notable exceptions from
111 * this rule are #GMainLoop and #GAsyncQueue, which <emphasis>are</emphasis>
112 * threadsafe and need no further application-level locking to be
113 * accessed from multiple threads.
117 * G_THREADS_IMPL_POSIX:
119 * This macro is defined if POSIX style threads are used.
123 * G_THREADS_IMPL_WIN32:
125 * This macro is defined if Windows style threads are used.
128 /* G_LOCK Documentation {{{1 ---------------------------------------------- */
132 * @name: the name of the lock.
134 * The %G_LOCK_* macros provide a convenient interface to #GMutex
135 * with the advantage that they will expand to nothing in programs
136 * compiled against a thread-disabled GLib, saving code and memory
137 * there. #G_LOCK_DEFINE defines a lock. It can appear anywhere
138 * variable definitions may appear in programs, i.e. in the first block
139 * of a function or outside of functions. The @name parameter will be
140 * mangled to get the name of the #GMutex. This means that you
141 * can use names of existing variables as the parameter - e.g. the name
142 * of the variable you intent to protect with the lock. Look at our
143 * <function>give_me_next_number()</function> example using the
147 * <title>Using the %G_LOCK_* convenience macros</title>
149 * G_LOCK_DEFINE (current_number);
152 * give_me_next_number (void)
154 * static int current_number = 0;
157 * G_LOCK (current_number);
158 * ret_val = current_number = calc_next_number (current_number);
159 * G_UNLOCK (current_number);
168 * G_LOCK_DEFINE_STATIC:
169 * @name: the name of the lock.
171 * This works like #G_LOCK_DEFINE, but it creates a static object.
176 * @name: the name of the lock.
178 * This declares a lock, that is defined with #G_LOCK_DEFINE in another
184 * @name: the name of the lock.
186 * Works like g_mutex_lock(), but for a lock defined with
192 * @name: the name of the lock.
193 * @Returns: %TRUE, if the lock could be locked.
195 * Works like g_mutex_trylock(), but for a lock defined with
201 * @name: the name of the lock.
203 * Works like g_mutex_unlock(), but for a lock defined with
207 /* GMutex Documentation {{{1 ------------------------------------------ */
212 * The #GMutex struct is an opaque data structure to represent a mutex
213 * (mutual exclusion). It can be used to protect data against shared
214 * access. Take for example the following function:
217 * <title>A function which will not work in a threaded environment</title>
220 * give_me_next_number (void)
222 * static int current_number = 0;
224 * /<!-- -->* now do a very complicated calculation to calculate the new
225 * * number, this might for example be a random number generator
227 * current_number = calc_next_number (current_number);
229 * return current_number;
234 * It is easy to see that this won't work in a multi-threaded
235 * application. There current_number must be protected against shared
236 * access. A first naive implementation would be:
239 * <title>The wrong way to write a thread-safe function</title>
242 * give_me_next_number (void)
244 * static int current_number = 0;
246 * static GMutex * mutex = NULL;
248 * if (!mutex) mutex = g_mutex_new (<!-- -->);
250 * g_mutex_lock (mutex);
251 * ret_val = current_number = calc_next_number (current_number);
252 * g_mutex_unlock (mutex);
259 * This looks like it would work, but there is a race condition while
260 * constructing the mutex and this code cannot work reliable. Please do
261 * not use such constructs in your own programs! One working solution
265 * <title>A correct thread-safe function</title>
267 * static GMutex *give_me_next_number_mutex = NULL;
269 * /<!-- -->* this function must be called before any call to
270 * * give_me_next_number(<!-- -->)
272 * * it must be called exactly once.
275 * init_give_me_next_number (void)
277 * g_assert (give_me_next_number_mutex == NULL);
278 * give_me_next_number_mutex = g_mutex_new (<!-- -->);
282 * give_me_next_number (void)
284 * static int current_number = 0;
287 * g_mutex_lock (give_me_next_number_mutex);
288 * ret_val = current_number = calc_next_number (current_number);
289 * g_mutex_unlock (give_me_next_number_mutex);
296 * A statically initialized #GMutex provides an even simpler and safer
300 * <title>Using a statically allocated mutex</title>
303 * give_me_next_number (void)
305 * static GMutex mutex = G_MUTEX_INIT;
306 * static int current_number = 0;
309 * g_mutex_lock (&mutex);
310 * ret_val = current_number = calc_next_number (current_number);
311 * g_mutex_unlock (&mutex);
318 * A #GMutex should only be accessed via <function>g_mutex_</function>
325 * Initializer for statically allocated #GMutexes.
326 * Alternatively, g_mutex_init() can be used.
329 * GMutex mutex = G_MUTEX_INIT;
335 /* GRecMutex Documentation {{{1 -------------------------------------- */
340 * The GRecMutex struct is an opaque data structure to represent a
341 * recursive mutex. It is similar to a #GMutex with the difference
342 * that it is possible to lock a GRecMutex multiple times in the same
343 * thread without deadlock. When doing so, care has to be taken to
344 * unlock the recursive mutex as often as it has been locked.
346 * A GRecMutex should only be accessed with the
347 * <function>g_rec_mutex_</function> functions. Before a GRecMutex
348 * can be used, it has to be initialized with #G_REC_MUTEX_INIT or
349 * g_rec_mutex_init().
357 * Initializer for statically allocated #GRecMutexes.
358 * Alternatively, g_rec_mutex_init() can be used.
361 * GRecMutex mutex = G_REC_MUTEX_INIT;
367 /* GRWLock Documentation {{{1 ---------------------------------------- */
372 * The GRWLock struct is an opaque data structure to represent a
373 * reader-writer lock. It is similar to a #GMutex in that it allows
374 * multiple threads to coordinate access to a shared resource.
376 * The difference to a mutex is that a reader-writer lock discriminates
377 * between read-only ('reader') and full ('writer') access. While only
378 * one thread at a time is allowed write access (by holding the 'writer'
379 * lock via g_rw_lock_writer_lock()), multiple threads can gain
380 * simultaneous read-only access (by holding the 'reader' lock via
381 * g_rw_lock_reader_lock()).
384 * <title>An array with access functions</title>
386 * GRWLock lock = G_RW_LOCK_INIT;
390 * my_array_get (guint index)
392 * gpointer retval = NULL;
397 * g_rw_lock_reader_lock (&lock);
398 * if (index < array->len)
399 * retval = g_ptr_array_index (array, index);
400 * g_rw_lock_reader_unlock (&lock);
406 * my_array_set (guint index, gpointer data)
408 * g_rw_lock_writer_lock (&lock);
411 * array = g_ptr_array_new (<!-- -->);
413 * if (index >= array->len)
414 * g_ptr_array_set_size (array, index+1);
415 * g_ptr_array_index (array, index) = data;
417 * g_rw_lock_writer_unlock (&lock);
421 * This example shows an array which can be accessed by many readers
422 * (the <function>my_array_get()</function> function) simultaneously,
423 * whereas the writers (the <function>my_array_set()</function>
424 * function) will only be allowed once at a time and only if no readers
425 * currently access the array. This is because of the potentially
426 * dangerous resizing of the array. Using these functions is fully
427 * multi-thread safe now.
431 * A GRWLock should only be accessed with the
432 * <function>g_rw_lock_</function> functions. Before it can be used,
433 * it has to be initialized with #G_RW_LOCK_INIT or g_rw_lock_init().
441 * Initializer for statically allocated #GRWLocks.
442 * Alternatively, g_rw_lock_init_init() can be used.
445 * GRWLock lock = G_RW_LOCK_INIT;
451 /* GCond Documentation {{{1 ------------------------------------------ */
456 * The #GCond struct is an opaque data structure that represents a
457 * condition. Threads can block on a #GCond if they find a certain
458 * condition to be false. If other threads change the state of this
459 * condition they signal the #GCond, and that causes the waiting
460 * threads to be woken up.
464 * Using GCond to block a thread until a condition is satisfied
467 * GCond* data_cond = NULL; /<!-- -->* Must be initialized somewhere *<!-- -->/
468 * GMutex* data_mutex = NULL; /<!-- -->* Must be initialized somewhere *<!-- -->/
469 * gpointer current_data = NULL;
472 * push_data (gpointer data)
474 * g_mutex_lock (data_mutex);
475 * current_data = data;
476 * g_cond_signal (data_cond);
477 * g_mutex_unlock (data_mutex);
485 * g_mutex_lock (data_mutex);
486 * while (!current_data)
487 * g_cond_wait (data_cond, data_mutex);
488 * data = current_data;
489 * current_data = NULL;
490 * g_mutex_unlock (data_mutex);
497 * Whenever a thread calls pop_data() now, it will wait until
498 * current_data is non-%NULL, i.e. until some other thread
499 * has called push_data().
501 * <note><para>It is important to use the g_cond_wait() and
502 * g_cond_timed_wait() functions only inside a loop which checks for the
503 * condition to be true. It is not guaranteed that the waiting thread
504 * will find the condition fulfilled after it wakes up, even if the
505 * signaling thread left the condition in that state: another thread may
506 * have altered the condition before the waiting thread got the chance
507 * to be woken up, even if the condition itself is protected by a
508 * #GMutex, like above.</para></note>
510 * A #GCond should only be accessed via the <function>g_cond_</function>
517 * Initializer for statically allocated #GConds.
518 * Alternatively, g_cond_init() can be used.
521 * GCond cond = G_COND_INIT;
527 /* GPrivate Documentation {{{1 --------------------------------------- */
533 * #GStaticPrivate is a better choice for most uses.
536 * The #GPrivate struct is an opaque data structure to represent a
537 * thread private data key. Threads can thereby obtain and set a
538 * pointer which is private to the current thread. Take our
539 * <function>give_me_next_number(<!-- -->)</function> example from
540 * above. Suppose we don't want <literal>current_number</literal> to be
541 * shared between the threads, but instead to be private to each thread.
542 * This can be done as follows:
545 * <title>Using GPrivate for per-thread data</title>
547 * GPrivate* current_number_key = NULL; /<!-- -->* Must be initialized somewhere
548 * with g_private_new (g_free); *<!-- -->/
551 * give_me_next_number (void)
553 * int *current_number = g_private_get (current_number_key);
555 * if (!current_number)
557 * current_number = g_new (int, 1);
558 * *current_number = 0;
559 * g_private_set (current_number_key, current_number);
562 * *current_number = calc_next_number (*current_number);
564 * return *current_number;
569 * Here the pointer belonging to the key
570 * <literal>current_number_key</literal> is read. If it is %NULL, it has
571 * not been set yet. Then get memory for an integer value, assign this
572 * memory to the pointer and write the pointer back. Now we have an
573 * integer value that is private to the current thread.
575 * The #GPrivate struct should only be accessed via the
576 * <function>g_private_</function> functions.
579 /* GThread Documentation {{{1 ---------------------------------------- */
584 * The #GThread struct represents a running thread.
586 * Resources for a joinable thread are not fully released
587 * until g_thread_join() is called for that thread.
592 * @data: data passed to the thread
593 * @Returns: the return value of the thread, which will be returned by
596 * Specifies the type of the @func functions passed to
597 * g_thread_create() or g_thread_create_full().
601 * g_thread_supported:
603 * This macro returns %TRUE if the thread system is initialized,
604 * and %FALSE if it is not.
606 * For language bindings, g_thread_get_initialized() provides
607 * the same functionality as a function.
609 * Returns: %TRUE, if the thread system is initialized
612 /* GThreadError {{{1 ------------------------------------------------------- */
615 * @G_THREAD_ERROR_AGAIN: a thread couldn't be created due to resource
616 * shortage. Try again later.
618 * Possible errors of thread related functions.
624 * The error domain of the GLib thread subsystem.
627 g_thread_error_quark (void)
629 return g_quark_from_static_string ("g_thread_error");
632 /* Miscellaneous Structures {{{1 ------------------------------------------ */
634 typedef struct _GRealThread GRealThread;
638 GArray *private_data;
641 GSystemThread system_thread;
644 /* Local Data {{{1 -------------------------------------------------------- */
646 gboolean g_threads_got_initialized = FALSE;
647 GSystemThread zero_thread; /* This is initialized to all zero */
649 GMutex g_once_mutex = G_MUTEX_INIT;
650 static GCond g_once_cond = G_COND_INIT;
651 static GSList* g_once_init_list = NULL;
653 static GPrivate g_thread_specific_private;
654 static GRealThread *g_thread_all_threads = NULL;
655 static GSList *g_thread_free_indices = NULL;
657 G_LOCK_DEFINE_STATIC (g_thread);
659 /* Initialisation {{{1 ---------------------------------------------------- */
663 * @vtable: a function table of type #GThreadFunctions, that provides
664 * the entry points to the thread system to be used. Since 2.32,
665 * this parameter is ignored and should always be %NULL
667 * If you use GLib from more than one thread, you must initialize the
668 * thread system by calling g_thread_init().
670 * Since version 2.24, calling g_thread_init() multiple times is allowed,
671 * but nothing happens except for the first call.
673 * Since version 2.32, GLib does not support custom thread implementations
674 * anymore and the @vtable parameter is ignored and you should pass %NULL.
676 * <note><para>g_thread_init() must not be called directly or indirectly
677 * in a callback from GLib. Also no mutexes may be currently locked while
678 * calling g_thread_init().</para></note>
680 * <note><para>To use g_thread_init() in your program, you have to link
681 * with the libraries that the command <command>pkg-config --libs
682 * gthread-2.0</command> outputs. This is not the case for all the
683 * other thread-related functions of GLib. Those can be used without
684 * having to link with the thread libraries.</para></note>
687 static void g_thread_cleanup (gpointer data);
690 g_thread_init_glib (void)
692 static gboolean already_done;
693 GRealThread* main_thread;
700 /* We let the main thread (the one that calls g_thread_init) inherit
701 * the static_private data set before calling g_thread_init
703 main_thread = (GRealThread*) g_thread_self ();
705 /* setup the basic threading system */
706 g_threads_got_initialized = TRUE;
707 g_private_init (&g_thread_specific_private, g_thread_cleanup);
708 g_private_set (&g_thread_specific_private, main_thread);
709 g_system_thread_self (&main_thread->system_thread);
711 /* accomplish log system initialization to enable messaging */
712 _g_messages_thread_init_nomessage ();
716 * g_thread_get_initialized:
718 * Indicates if g_thread_init() has been called.
720 * Returns: %TRUE if threads have been initialized.
725 g_thread_get_initialized (void)
727 return g_thread_supported ();
730 /* GOnce {{{1 ------------------------------------------------------------- */
734 * @status: the status of the #GOnce
735 * @retval: the value returned by the call to the function, if @status
736 * is %G_ONCE_STATUS_READY
738 * A #GOnce struct controls a one-time initialization function. Any
739 * one-time initialization function must have its own unique #GOnce
748 * A #GOnce must be initialized with this macro before it can be used.
751 * GOnce my_once = G_ONCE_INIT;
759 * @G_ONCE_STATUS_NOTCALLED: the function has not been called yet.
760 * @G_ONCE_STATUS_PROGRESS: the function call is currently in progress.
761 * @G_ONCE_STATUS_READY: the function has been called.
763 * The possible statuses of a one-time initialization function
764 * controlled by a #GOnce struct.
771 * @once: a #GOnce structure
772 * @func: the #GThreadFunc function associated to @once. This function
773 * is called only once, regardless of the number of times it and
774 * its associated #GOnce struct are passed to g_once().
775 * @arg: data to be passed to @func
777 * The first call to this routine by a process with a given #GOnce
778 * struct calls @func with the given argument. Thereafter, subsequent
779 * calls to g_once() with the same #GOnce struct do not call @func
780 * again, but return the stored result of the first call. On return
781 * from g_once(), the status of @once will be %G_ONCE_STATUS_READY.
783 * For example, a mutex or a thread-specific data key must be created
784 * exactly once. In a threaded environment, calling g_once() ensures
785 * that the initialization is serialized across multiple threads.
787 * Calling g_once() recursively on the same #GOnce struct in
788 * @func will lead to a deadlock.
792 * get_debug_flags (void)
794 * static GOnce my_once = G_ONCE_INIT;
796 * g_once (&my_once, parse_debug_flags, NULL);
798 * return my_once.retval;
805 g_once_impl (GOnce *once,
809 g_mutex_lock (&g_once_mutex);
811 while (once->status == G_ONCE_STATUS_PROGRESS)
812 g_cond_wait (&g_once_cond, &g_once_mutex);
814 if (once->status != G_ONCE_STATUS_READY)
816 once->status = G_ONCE_STATUS_PROGRESS;
817 g_mutex_unlock (&g_once_mutex);
819 once->retval = func (arg);
821 g_mutex_lock (&g_once_mutex);
822 once->status = G_ONCE_STATUS_READY;
823 g_cond_broadcast (&g_once_cond);
826 g_mutex_unlock (&g_once_mutex);
833 * @value_location: location of a static initializable variable
836 * Function to be called when starting a critical initialization
837 * section. The argument @value_location must point to a static
838 * 0-initialized variable that will be set to a value other than 0 at
839 * the end of the initialization section. In combination with
840 * g_once_init_leave() and the unique address @value_location, it can
841 * be ensured that an initialization section will be executed only once
842 * during a program's life time, and that concurrent threads are
843 * blocked until initialization completed. To be used in constructs
847 * static gsize initialization_value = 0;
849 * if (g_once_init_enter (&initialization_value))
851 * gsize setup_value = 42; /** initialization code here **/
853 * g_once_init_leave (&initialization_value, setup_value);
856 * /** use initialization_value here **/
859 * Returns: %TRUE if the initialization section should be entered,
860 * %FALSE and blocks otherwise
865 g_once_init_enter_impl (volatile gsize *value_location)
867 gboolean need_init = FALSE;
868 g_mutex_lock (&g_once_mutex);
869 if (g_atomic_pointer_get (value_location) == NULL)
871 if (!g_slist_find (g_once_init_list, (void*) value_location))
874 g_once_init_list = g_slist_prepend (g_once_init_list, (void*) value_location);
878 g_cond_wait (&g_once_cond, &g_once_mutex);
879 while (g_slist_find (g_once_init_list, (void*) value_location));
881 g_mutex_unlock (&g_once_mutex);
887 * @value_location: location of a static initializable variable
889 * @initialization_value: new non-0 value for *@value_location
891 * Counterpart to g_once_init_enter(). Expects a location of a static
892 * 0-initialized initialization variable, and an initialization value
893 * other than 0. Sets the variable to the initialization value, and
894 * releases concurrent threads blocking in g_once_init_enter() on this
895 * initialization variable.
900 g_once_init_leave (volatile gsize *value_location,
901 gsize initialization_value)
903 g_return_if_fail (g_atomic_pointer_get (value_location) == NULL);
904 g_return_if_fail (initialization_value != 0);
905 g_return_if_fail (g_once_init_list != NULL);
907 g_atomic_pointer_set (value_location, initialization_value);
908 g_mutex_lock (&g_once_mutex);
909 g_once_init_list = g_slist_remove (g_once_init_list, (void*) value_location);
910 g_cond_broadcast (&g_once_cond);
911 g_mutex_unlock (&g_once_mutex);
914 /* GStaticPrivate {{{1 ---------------------------------------------------- */
916 typedef struct _GStaticPrivateNode GStaticPrivateNode;
917 struct _GStaticPrivateNode
920 GDestroyNotify destroy;
921 GStaticPrivate *owner;
927 * A #GStaticPrivate works almost like a #GPrivate, but it has one
928 * significant advantage. It doesn't need to be created at run-time
929 * like a #GPrivate, but can be defined at compile-time. This is
930 * similar to the difference between #GMutex and #GStaticMutex. Now
931 * look at our <function>give_me_next_number()</function> example with
935 * <title>Using GStaticPrivate for per-thread data</title>
938 * give_me_next_number (<!-- -->)
940 * static GStaticPrivate current_number_key = G_STATIC_PRIVATE_INIT;
941 * int *current_number = g_static_private_get (&current_number_key);
943 * if (!current_number)
945 * current_number = g_new (int,1);
946 * *current_number = 0;
947 * g_static_private_set (&current_number_key, current_number, g_free);
950 * *current_number = calc_next_number (*current_number);
952 * return *current_number;
959 * G_STATIC_PRIVATE_INIT:
961 * Every #GStaticPrivate must be initialized with this macro, before it
965 * GStaticPrivate my_private = G_STATIC_PRIVATE_INIT;
970 * g_static_private_init:
971 * @private_key: a #GStaticPrivate to be initialized
973 * Initializes @private_key. Alternatively you can initialize it with
974 * #G_STATIC_PRIVATE_INIT.
977 g_static_private_init (GStaticPrivate *private_key)
979 private_key->index = 0;
983 * g_static_private_get:
984 * @private_key: a #GStaticPrivate
986 * Works like g_private_get() only for a #GStaticPrivate.
988 * This function works even if g_thread_init() has not yet been called.
990 * Returns: the corresponding pointer
993 g_static_private_get (GStaticPrivate *private_key)
995 GRealThread *self = (GRealThread*) g_thread_self ();
999 array = self->private_data;
1001 if (array && private_key->index != 0 && private_key->index <= array->len)
1003 GStaticPrivateNode *node;
1005 node = &g_array_index (array, GStaticPrivateNode, private_key->index - 1);
1006 if (G_UNLIKELY (node->owner != private_key))
1009 node->destroy (node->data);
1010 node->destroy = NULL;
1022 * g_static_private_set:
1023 * @private_key: a #GStaticPrivate
1024 * @data: the new pointer
1025 * @notify: a function to be called with the pointer whenever the
1026 * current thread ends or sets this pointer again
1028 * Sets the pointer keyed to @private_key for the current thread and
1029 * the function @notify to be called with that pointer (%NULL or
1030 * non-%NULL), whenever the pointer is set again or whenever the
1031 * current thread ends.
1033 * This function works even if g_thread_init() has not yet been called.
1034 * If g_thread_init() is called later, the @data keyed to @private_key
1035 * will be inherited only by the main thread, i.e. the one that called
1038 * <note><para>@notify is used quite differently from @destructor in
1039 * g_private_new().</para></note>
1042 g_static_private_set (GStaticPrivate *private_key,
1044 GDestroyNotify notify)
1046 GRealThread *self = (GRealThread*) g_thread_self ();
1048 static guint next_index = 0;
1049 GStaticPrivateNode *node;
1051 if (!private_key->index)
1055 if (!private_key->index)
1057 if (g_thread_free_indices)
1059 private_key->index = GPOINTER_TO_UINT (g_thread_free_indices->data);
1060 g_thread_free_indices = g_slist_delete_link (g_thread_free_indices,
1061 g_thread_free_indices);
1064 private_key->index = ++next_index;
1067 G_UNLOCK (g_thread);
1070 array = self->private_data;
1073 array = g_array_new (FALSE, TRUE, sizeof (GStaticPrivateNode));
1074 self->private_data = array;
1077 if (private_key->index > array->len)
1078 g_array_set_size (array, private_key->index);
1080 node = &g_array_index (array, GStaticPrivateNode, private_key->index - 1);
1083 node->destroy (node->data);
1086 node->destroy = notify;
1087 node->owner = private_key;
1091 * g_static_private_free:
1092 * @private_key: a #GStaticPrivate to be freed
1094 * Releases all resources allocated to @private_key.
1096 * You don't have to call this functions for a #GStaticPrivate with an
1097 * unbounded lifetime, i.e. objects declared 'static', but if you have
1098 * a #GStaticPrivate as a member of a structure and the structure is
1099 * freed, you should also free the #GStaticPrivate.
1102 g_static_private_free (GStaticPrivate *private_key)
1104 guint idx = private_key->index;
1109 private_key->index = 0;
1112 g_thread_free_indices = g_slist_prepend (g_thread_free_indices,
1113 GUINT_TO_POINTER (idx));
1114 G_UNLOCK (g_thread);
1117 /* GThread {{{1 -------------------------------------------------------- */
1120 g_thread_cleanup (gpointer data)
1124 GRealThread* thread = data;
1127 array = thread->private_data;
1128 thread->private_data = NULL;
1134 for (i = 0; i < array->len; i++ )
1136 GStaticPrivateNode *node = &g_array_index (array, GStaticPrivateNode, i);
1138 node->destroy (node->data);
1140 g_array_free (array, TRUE);
1143 /* We only free the thread structure if it isn't joinable.
1144 * If it is, the structure is freed in g_thread_join()
1146 if (!thread->thread.joinable)
1151 for (t = g_thread_all_threads, p = NULL; t; p = t, t = t->next)
1158 g_thread_all_threads = t->next;
1162 G_UNLOCK (g_thread);
1164 /* Just to make sure, this isn't used any more */
1165 g_system_thread_assign (thread->system_thread, zero_thread);
1172 g_thread_create_proxy (gpointer data)
1174 GRealThread* thread = data;
1178 /* This has to happen before G_LOCK, as that might call g_thread_self */
1179 g_private_set (&g_thread_specific_private, data);
1181 /* The lock makes sure that thread->system_thread is written,
1182 * before thread->thread.func is called. See g_thread_create().
1185 G_UNLOCK (g_thread);
1187 thread->retval = thread->thread.func (thread->thread.data);
1194 * @func: a function to execute in the new thread
1195 * @data: an argument to supply to the new thread
1196 * @joinable: should this thread be joinable?
1197 * @error: return location for error, or %NULL
1199 * This function creates a new thread.
1201 * If @joinable is %TRUE, you can wait for this threads termination
1202 * calling g_thread_join(). Otherwise the thread will just disappear
1203 * when it terminates.
1205 * The new thread executes the function @func with the argument @data.
1206 * If the thread was created successfully, it is returned.
1208 * @error can be %NULL to ignore errors, or non-%NULL to report errors.
1209 * The error is set, if and only if the function returns %NULL.
1211 * Returns: the new #GThread on success
1214 g_thread_create (GThreadFunc func,
1219 return g_thread_create_with_stack_size (func, data, joinable, 0, error);
1223 * g_thread_create_with_stack_size:
1224 * @func: a function to execute in the new thread
1225 * @data: an argument to supply to the new thread
1226 * @joinable: should this thread be joinable?
1227 * @stack_size: a stack size for the new thread
1228 * @error: return location for error
1230 * This function creates a new thread. If the underlying thread
1231 * implementation supports it, the thread gets a stack size of
1232 * @stack_size or the default value for the current platform, if
1235 * If @joinable is %TRUE, you can wait for this threads termination
1236 * calling g_thread_join(). Otherwise the thread will just disappear
1237 * when it terminates.
1239 * The new thread executes the function @func with the argument @data.
1240 * If the thread was created successfully, it is returned.
1242 * @error can be %NULL to ignore errors, or non-%NULL to report errors.
1243 * The error is set, if and only if the function returns %NULL.
1245 * <note><para>Only use g_thread_create_with_stack_size() if you
1246 * really can't use g_thread_create() instead. g_thread_create()
1247 * does not take @stack_size, as it should only be used in cases
1248 * in which it is unavoidable.</para></note>
1250 * Returns: the new #GThread on success
1255 g_thread_create_with_stack_size (GThreadFunc func,
1261 GRealThread* result;
1262 GError *local_error = NULL;
1263 g_return_val_if_fail (func, NULL);
1265 result = g_new0 (GRealThread, 1);
1267 result->thread.joinable = joinable;
1268 result->thread.func = func;
1269 result->thread.data = data;
1270 result->private_data = NULL;
1272 g_system_thread_create (g_thread_create_proxy, result,
1273 stack_size, joinable,
1274 &result->system_thread, &local_error);
1277 result->next = g_thread_all_threads;
1278 g_thread_all_threads = result;
1280 G_UNLOCK (g_thread);
1284 g_propagate_error (error, local_error);
1289 return (GThread*) result;
1294 * @retval: the return value of this thread
1296 * Exits the current thread. If another thread is waiting for that
1297 * thread using g_thread_join() and the current thread is joinable, the
1298 * waiting thread will be woken up and get @retval as the return value
1299 * of g_thread_join(). If the current thread is not joinable, @retval
1300 * is ignored. Calling
1303 * g_thread_exit (retval);
1306 * is equivalent to returning @retval from the function @func, as given
1307 * to g_thread_create().
1309 * <note><para>Never call g_thread_exit() from within a thread of a
1310 * #GThreadPool, as that will mess up the bookkeeping and lead to funny
1311 * and unwanted results.</para></note>
1314 g_thread_exit (gpointer retval)
1316 GRealThread* real = (GRealThread*) g_thread_self ();
1317 real->retval = retval;
1319 g_system_thread_exit ();
1324 * @thread: a #GThread to be waited for
1326 * Waits until @thread finishes, i.e. the function @func, as given to
1327 * g_thread_create(), returns or g_thread_exit() is called by @thread.
1328 * All resources of @thread including the #GThread struct are released.
1329 * @thread must have been created with @joinable=%TRUE in
1330 * g_thread_create(). The value returned by @func or given to
1331 * g_thread_exit() by @thread is returned by this function.
1333 * Returns: the return value of the thread
1336 g_thread_join (GThread* thread)
1338 GRealThread* real = (GRealThread*) thread;
1342 g_return_val_if_fail (thread, NULL);
1343 g_return_val_if_fail (thread->joinable, NULL);
1344 g_return_val_if_fail (!g_system_thread_equal (&real->system_thread, &zero_thread), NULL);
1346 g_system_thread_join (&real->system_thread);
1348 retval = real->retval;
1351 for (t = g_thread_all_threads, p = NULL; t; p = t, t = t->next)
1353 if (t == (GRealThread*) thread)
1358 g_thread_all_threads = t->next;
1362 G_UNLOCK (g_thread);
1364 /* Just to make sure, this isn't used any more */
1365 thread->joinable = 0;
1366 g_system_thread_assign (real->system_thread, zero_thread);
1368 /* the thread structure for non-joinable threads is freed upon
1369 * thread end. We free the memory here. This will leave a loose end,
1370 * if a joinable thread is not joined.
1380 * This functions returns the #GThread corresponding to the calling
1383 * Returns: the current thread
1386 g_thread_self (void)
1388 GRealThread* thread = g_private_get (&g_thread_specific_private);
1392 /* If no thread data is available, provide and set one.
1393 * This can happen for the main thread and for threads
1394 * that are not created by GLib.
1396 thread = g_new0 (GRealThread, 1);
1397 thread->thread.joinable = FALSE; /* This is a safe guess */
1398 thread->thread.func = NULL;
1399 thread->thread.data = NULL;
1400 thread->private_data = NULL;
1402 g_system_thread_self (&thread->system_thread);
1404 g_private_set (&g_thread_specific_private, thread);
1407 thread->next = g_thread_all_threads;
1408 g_thread_all_threads = thread;
1409 G_UNLOCK (g_thread);
1412 return (GThread*)thread;
1417 * @thread_func: function to call for all #GThread structures
1418 * @user_data: second argument to @thread_func
1420 * Call @thread_func on all existing #GThread structures.
1421 * Note that threads may decide to exit while @thread_func is
1422 * running, so without intimate knowledge about the lifetime of
1423 * foreign threads, @thread_func shouldn't access the GThread*
1424 * pointer passed in as first argument. However, @thread_func will
1425 * not be called for threads which are known to have exited already.
1427 * Due to thread lifetime checks, this function has an execution complexity
1428 * which is quadratic in the number of existing threads.
1433 g_thread_foreach (GFunc thread_func,
1436 GSList *slist = NULL;
1437 GRealThread *thread;
1438 g_return_if_fail (thread_func != NULL);
1439 /* snapshot the list of threads for iteration */
1441 for (thread = g_thread_all_threads; thread; thread = thread->next)
1442 slist = g_slist_prepend (slist, thread);
1443 G_UNLOCK (g_thread);
1444 /* walk the list, skipping non-existent threads */
1447 GSList *node = slist;
1449 /* check whether the current thread still exists */
1451 for (thread = g_thread_all_threads; thread; thread = thread->next)
1452 if (thread == node->data)
1454 G_UNLOCK (g_thread);
1456 thread_func (thread, user_data);
1457 g_slist_free_1 (node);
1461 /* GMutex {{{1 ------------------------------------------------------ */
1466 * Allocated and initializes a new #GMutex.
1468 * Returns: a newly allocated #GMutex. Use g_mutex_free() to free
1475 mutex = g_slice_new (GMutex);
1476 g_mutex_init (mutex);
1485 * Destroys a @mutex that has been created with g_mutex_new().
1487 * Calling g_mutex_free() on a locked mutex may result
1488 * in undefined behaviour.
1491 g_mutex_free (GMutex *mutex)
1493 g_mutex_clear (mutex);
1494 g_slice_free (GMutex, mutex);
1497 /* GCond {{{1 ------------------------------------------------------ */
1502 * Allocates and initializes a new #GCond.
1504 * Returns: a newly allocated #GCond. Free with g_cond_free()
1511 cond = g_slice_new (GCond);
1521 * Destroys a #GCond that has been created with g_cond_new().
1524 g_cond_free (GCond *cond)
1526 g_cond_clear (cond);
1527 g_slice_free (GCond, cond);
1530 /* GPrivate {{{1 ------------------------------------------------------ */
1534 * @destructor: a function to destroy the data keyed to
1535 * the #GPrivate when a thread ends
1537 * Creates a new #GPrivate. If @destructor is non-%NULL, it is a
1538 * pointer to a destructor function. Whenever a thread ends and the
1539 * corresponding pointer keyed to this instance of #GPrivate is
1540 * non-%NULL, the destructor is called with this pointer as the
1544 * #GStaticPrivate is a better choice for most uses.
1547 * <note><para>@destructor is used quite differently from @notify in
1548 * g_static_private_set().</para></note>
1550 * <note><para>A #GPrivate cannot be freed. Reuse it instead, if you
1551 * can, to avoid shortage, or use #GStaticPrivate.</para></note>
1553 * <note><para>This function will abort if g_thread_init() has not been
1554 * called yet.</para></note>
1556 * Returns: a newly allocated #GPrivate
1559 g_private_new (GDestroyNotify notify)
1563 key = g_slice_new (GPrivate);
1564 g_private_init (key, notify);
1569 /* vim: set foldmethod=marker: */