1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * GAsyncQueue: asynchronous queue implementation, based on Gqueue.
5 * Copyright (C) 2000 Sebastian Wilhelmi; University of Karlsruhe
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the
19 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 * Boston, MA 02111-1307, USA.
38 guint waiting_threads;
43 GCompareDataFunc func;
50 * Creates a new asynchronous queue with the initial reference count of 1.
52 * Return value: the new #GAsyncQueue.
55 g_async_queue_new (void)
57 GAsyncQueue* retval = g_new (GAsyncQueue, 1);
58 retval->mutex = g_mutex_new ();
60 retval->queue = g_queue_new ();
61 retval->waiting_threads = 0;
62 retval->ref_count = 1;
68 * @queue: a #GAsyncQueue.
70 * Increases the reference count of the asynchronous @queue by 1. You
71 * do not need to hold the lock to call this function.
73 * Returns: the @queue that was passed in (since 2.6)
76 g_async_queue_ref (GAsyncQueue *queue)
78 g_return_val_if_fail (queue, NULL);
79 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
81 g_atomic_int_inc (&queue->ref_count);
87 * g_async_queue_ref_unlocked:
88 * @queue: a #GAsyncQueue.
90 * Increases the reference count of the asynchronous @queue by 1.
92 * @Deprecated: Since 2.8, reference counting is done atomically
93 * so g_async_queue_ref() can be used regardless of the @queue's
97 g_async_queue_ref_unlocked (GAsyncQueue *queue)
99 g_return_if_fail (queue);
100 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
102 g_atomic_int_inc (&queue->ref_count);
106 * g_async_queue_unref_and_unlock:
107 * @queue: a #GAsyncQueue.
109 * Decreases the reference count of the asynchronous @queue by 1 and
110 * releases the lock. This function must be called while holding the
111 * @queue's lock. If the reference count went to 0, the @queue will be
112 * destroyed and the memory allocated will be freed.
114 * @Deprecated: Since 2.8, reference counting is done atomically
115 * so g_async_queue_unref() can be used regardless of the @queue's
119 g_async_queue_unref_and_unlock (GAsyncQueue *queue)
121 g_return_if_fail (queue);
122 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
124 g_mutex_unlock (queue->mutex);
125 g_async_queue_unref (queue);
129 * g_async_queue_unref:
130 * @queue: a #GAsyncQueue.
132 * Decreases the reference count of the asynchronous @queue by 1. If
133 * the reference count went to 0, the @queue will be destroyed and the
134 * memory allocated will be freed. So you are not allowed to use the
135 * @queue afterwards, as it might have disappeared. You do not need to
136 * hold the lock to call this function.
139 g_async_queue_unref (GAsyncQueue *queue)
141 g_return_if_fail (queue);
142 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
144 if (g_atomic_int_dec_and_test (&queue->ref_count))
146 g_return_if_fail (queue->waiting_threads == 0);
147 g_mutex_free (queue->mutex);
149 g_cond_free (queue->cond);
150 g_queue_free (queue->queue);
156 * g_async_queue_lock:
157 * @queue: a #GAsyncQueue.
159 * Acquires the @queue's lock. After that you can only call the
160 * <function>g_async_queue_*_unlocked()</function> function variants on that
161 * @queue. Otherwise it will deadlock.
164 g_async_queue_lock (GAsyncQueue *queue)
166 g_return_if_fail (queue);
167 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
169 g_mutex_lock (queue->mutex);
173 * g_async_queue_unlock:
174 * @queue: a #GAsyncQueue.
176 * Releases the queue's lock.
179 g_async_queue_unlock (GAsyncQueue *queue)
181 g_return_if_fail (queue);
182 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
184 g_mutex_unlock (queue->mutex);
188 * g_async_queue_push:
189 * @queue: a #GAsyncQueue.
190 * @data: @data to push into the @queue.
192 * Pushes the @data into the @queue. @data must not be %NULL.
195 g_async_queue_push (GAsyncQueue* queue, gpointer data)
197 g_return_if_fail (queue);
198 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
199 g_return_if_fail (data);
201 g_mutex_lock (queue->mutex);
202 g_async_queue_push_unlocked (queue, data);
203 g_mutex_unlock (queue->mutex);
207 * g_async_queue_push_unlocked:
208 * @queue: a #GAsyncQueue.
209 * @data: @data to push into the @queue.
211 * Pushes the @data into the @queue. @data must not be %NULL. This
212 * function must be called while holding the @queue's lock.
215 g_async_queue_push_unlocked (GAsyncQueue* queue, gpointer data)
217 g_return_if_fail (queue);
218 g_return_if_fail (g_atomic_int_get (&queue->ref_count) > 0);
219 g_return_if_fail (data);
221 g_queue_push_head (queue->queue, data);
222 if (queue->waiting_threads > 0)
223 g_cond_signal (queue->cond);
227 * g_async_queue_push_sorted:
228 * @queue: a #GAsyncQueue
229 * @data: the @data to push into the @queue
230 * @func: the #GCompareDataFunc is used to sort @queue. This function
231 * is passed two elements of the @queue. The function should return
232 * 0 if they are equal, a negative value if the first element
233 * should be higher in the @queue or a positive value if the first
234 * element should be lower in the @queue than the second element.
235 * @user_data: user data passed to @func.
237 * Inserts @data into @queue using @func to determine the new
240 * This function requires that the @queue is sorted before pushing on
243 * This function will lock @queue before it sorts the queue and unlock
244 * it when it is finished.
246 * For an example of @func see g_async_queue_sort().
251 g_async_queue_push_sorted (GAsyncQueue *queue,
253 GCompareDataFunc func,
256 g_return_if_fail (queue != NULL);
258 g_mutex_lock (queue->mutex);
259 g_async_queue_push_sorted_unlocked (queue, data, func, user_data);
260 g_mutex_unlock (queue->mutex);
264 g_async_queue_invert_compare (gpointer v1,
268 return -sd->func (v1, v2, sd->user_data);
272 * g_async_queue_push_sorted_unlocked:
273 * @queue: a #GAsyncQueue
274 * @data: the @data to push into the @queue
275 * @func: the #GCompareDataFunc is used to sort @queue. This function
276 * is passed two elements of the @queue. The function should return
277 * 0 if they are equal, a negative value if the first element
278 * should be higher in the @queue or a positive value if the first
279 * element should be lower in the @queue than the second element.
280 * @user_data: user data passed to @func.
282 * Inserts @data into @queue using @func to determine the new
285 * This function requires that the @queue is sorted before pushing on
288 * This function is called while holding the @queue's lock.
290 * For an example of @func see g_async_queue_sort().
295 g_async_queue_push_sorted_unlocked (GAsyncQueue *queue,
297 GCompareDataFunc func,
302 g_return_if_fail (queue != NULL);
305 sd.user_data = user_data;
307 g_queue_insert_sorted (queue->queue,
309 (GCompareDataFunc)g_async_queue_invert_compare,
311 if (queue->waiting_threads > 0)
312 g_cond_signal (queue->cond);
316 g_async_queue_pop_intern_unlocked (GAsyncQueue *queue,
322 if (!g_queue_peek_tail_link (queue->queue))
328 queue->cond = g_cond_new ();
332 queue->waiting_threads++;
333 while (!g_queue_peek_tail_link (queue->queue))
334 g_cond_wait (queue->cond, queue->mutex);
335 queue->waiting_threads--;
339 queue->waiting_threads++;
340 while (!g_queue_peek_tail_link (queue->queue))
341 if (!g_cond_timed_wait (queue->cond, queue->mutex, end_time))
343 queue->waiting_threads--;
344 if (!g_queue_peek_tail_link (queue->queue))
349 retval = g_queue_pop_tail (queue->queue);
358 * @queue: a #GAsyncQueue.
360 * Pops data from the @queue. This function blocks until data become
363 * Return value: data from the queue.
366 g_async_queue_pop (GAsyncQueue* queue)
370 g_return_val_if_fail (queue, NULL);
371 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
373 g_mutex_lock (queue->mutex);
374 retval = g_async_queue_pop_intern_unlocked (queue, FALSE, NULL);
375 g_mutex_unlock (queue->mutex);
381 * g_async_queue_pop_unlocked:
382 * @queue: a #GAsyncQueue.
384 * Pops data from the @queue. This function blocks until data become
385 * available. This function must be called while holding the @queue's
388 * Return value: data from the queue.
391 g_async_queue_pop_unlocked (GAsyncQueue* queue)
393 g_return_val_if_fail (queue, NULL);
394 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
396 return g_async_queue_pop_intern_unlocked (queue, FALSE, NULL);
400 * g_async_queue_try_pop:
401 * @queue: a #GAsyncQueue.
403 * Tries to pop data from the @queue. If no data is available, %NULL is
406 * Return value: data from the queue or %NULL, when no data is
407 * available immediately.
410 g_async_queue_try_pop (GAsyncQueue* queue)
414 g_return_val_if_fail (queue, NULL);
415 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
417 g_mutex_lock (queue->mutex);
418 retval = g_async_queue_pop_intern_unlocked (queue, TRUE, NULL);
419 g_mutex_unlock (queue->mutex);
425 * g_async_queue_try_pop_unlocked:
426 * @queue: a #GAsyncQueue.
428 * Tries to pop data from the @queue. If no data is available, %NULL is
429 * returned. This function must be called while holding the @queue's
432 * Return value: data from the queue or %NULL, when no data is
433 * available immediately.
436 g_async_queue_try_pop_unlocked (GAsyncQueue* queue)
438 g_return_val_if_fail (queue, NULL);
439 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
441 return g_async_queue_pop_intern_unlocked (queue, TRUE, NULL);
445 * g_async_queue_timed_pop:
446 * @queue: a #GAsyncQueue.
447 * @end_time: a #GTimeVal, determining the final time.
449 * Pops data from the @queue. If no data is received before @end_time,
452 * To easily calculate @end_time a combination of g_get_current_time()
453 * and g_time_val_add() can be used.
455 * Return value: data from the queue or %NULL, when no data is
456 * received before @end_time.
459 g_async_queue_timed_pop (GAsyncQueue* queue, GTimeVal *end_time)
463 g_return_val_if_fail (queue, NULL);
464 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
466 g_mutex_lock (queue->mutex);
467 retval = g_async_queue_pop_intern_unlocked (queue, FALSE, end_time);
468 g_mutex_unlock (queue->mutex);
474 * g_async_queue_timed_pop_unlocked:
475 * @queue: a #GAsyncQueue.
476 * @end_time: a #GTimeVal, determining the final time.
478 * Pops data from the @queue. If no data is received before @end_time,
479 * %NULL is returned. This function must be called while holding the
482 * To easily calculate @end_time a combination of g_get_current_time()
483 * and g_time_val_add() can be used.
485 * Return value: data from the queue or %NULL, when no data is
486 * received before @end_time.
489 g_async_queue_timed_pop_unlocked (GAsyncQueue* queue, GTimeVal *end_time)
491 g_return_val_if_fail (queue, NULL);
492 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
494 return g_async_queue_pop_intern_unlocked (queue, FALSE, end_time);
498 * g_async_queue_length:
499 * @queue: a #GAsyncQueue.
501 * Returns the length of the queue, negative values mean waiting
502 * threads, positive values mean available entries in the
503 * @queue. Actually this function returns the number of data items in
504 * the queue minus the number of waiting threads. Thus a return value
505 * of 0 could mean 'n' entries in the queue and 'n' thread waiting.
506 * That can happen due to locking of the queue or due to
509 * Return value: the length of the @queue.
512 g_async_queue_length (GAsyncQueue* queue)
516 g_return_val_if_fail (queue, 0);
517 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, 0);
519 g_mutex_lock (queue->mutex);
520 retval = queue->queue->length - queue->waiting_threads;
521 g_mutex_unlock (queue->mutex);
527 * g_async_queue_length_unlocked:
528 * @queue: a #GAsyncQueue.
530 * Returns the length of the queue, negative values mean waiting
531 * threads, positive values mean available entries in the
532 * @queue. Actually this function returns the number of data items in
533 * the queue minus the number of waiting threads. Thus a return value
534 * of 0 could mean 'n' entries in the queue and 'n' thread waiting.
535 * That can happen due to locking of the queue or due to
536 * scheduling. This function must be called while holding the @queue's
539 * Return value: the length of the @queue.
542 g_async_queue_length_unlocked (GAsyncQueue* queue)
544 g_return_val_if_fail (queue, 0);
545 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, 0);
547 return queue->queue->length - queue->waiting_threads;
551 * g_async_queue_sort:
552 * @queue: a #GAsyncQueue
553 * @func: the #GCompareDataFunc is used to sort @queue. This
554 * function is passed two elements of the @queue. The function
555 * should return 0 if they are equal, a negative value if the
556 * first element should be higher in the @queue or a positive
557 * value if the first element should be lower in the @queue than
558 * the second element.
559 * @user_data: user data passed to @func
561 * Sorts @queue using @func.
563 * This function will lock @queue before it sorts the queue and unlock
564 * it when it is finished.
566 * If you were sorting a list of priority numbers to make sure the
567 * lowest priority would be at the top of the queue, you could use:
568 * <informalexample><programlisting>
572 * id1 = GPOINTER_TO_INT (element1);
573 * id2 = GPOINTER_TO_INT (element2);
575 * return (id1 > id2 ? +1 : id1 == id2 ? 0 : -1);
576 * </programlisting></informalexample>
581 g_async_queue_sort (GAsyncQueue *queue,
582 GCompareDataFunc func,
585 g_return_if_fail (queue != NULL);
586 g_return_if_fail (func != NULL);
588 g_mutex_lock (queue->mutex);
589 g_async_queue_sort_unlocked (queue, func, user_data);
590 g_mutex_unlock (queue->mutex);
594 * g_async_queue_sort_unlocked:
595 * @queue: a #GAsyncQueue
596 * @func: the #GCompareDataFunc is used to sort @queue. This
597 * function is passed two elements of the @queue. The function
598 * should return 0 if they are equal, a negative value if the
599 * first element should be higher in the @queue or a positive
600 * value if the first element should be lower in the @queue than
601 * the second element.
602 * @user_data: user data passed to @func
604 * Sorts @queue using @func.
606 * This function is called while holding the @queue's lock.
611 g_async_queue_sort_unlocked (GAsyncQueue *queue,
612 GCompareDataFunc func,
617 g_return_if_fail (queue != NULL);
618 g_return_if_fail (func != NULL);
621 sd.user_data = user_data;
623 g_queue_sort (queue->queue,
624 (GCompareDataFunc)g_async_queue_invert_compare,
633 _g_async_queue_get_mutex (GAsyncQueue* queue)
635 g_return_val_if_fail (queue, NULL);
636 g_return_val_if_fail (g_atomic_int_get (&queue->ref_count) > 0, NULL);
641 #define __G_ASYNCQUEUE_C__
642 #include "galiasdef.c"