4 * Copyright IBM, Corp. 2011
7 * Stefan Hajnoczi <stefanha@linux.vnet.ibm.com>
8 * Kevin Wolf <kwolf@redhat.com>
10 * This work is licensed under the terms of the GNU LGPL, version 2 or later.
11 * See the COPYING.LIB file in the top-level directory.
15 #include "qemu/osdep.h"
17 #include "qemu-common.h"
18 #include "qemu/thread.h"
19 #include "qemu/atomic.h"
20 #include "qemu/coroutine.h"
21 #include "qemu/coroutine_int.h"
27 /** Free list to speed up creation */
28 static QSLIST_HEAD(, Coroutine
) release_pool
= QSLIST_HEAD_INITIALIZER(pool
);
29 static unsigned int release_pool_size
;
30 static __thread
QSLIST_HEAD(, Coroutine
) alloc_pool
= QSLIST_HEAD_INITIALIZER(pool
);
31 static __thread
unsigned int alloc_pool_size
;
32 static __thread Notifier coroutine_pool_cleanup_notifier
;
34 static void coroutine_pool_cleanup(Notifier
*n
, void *value
)
39 QSLIST_FOREACH_SAFE(co
, &alloc_pool
, pool_next
, tmp
) {
40 QSLIST_REMOVE_HEAD(&alloc_pool
, pool_next
);
41 qemu_coroutine_delete(co
);
45 Coroutine
*qemu_coroutine_create(CoroutineEntry
*entry
)
49 if (CONFIG_COROUTINE_POOL
) {
50 co
= QSLIST_FIRST(&alloc_pool
);
52 if (release_pool_size
> POOL_BATCH_SIZE
) {
53 /* Slow path; a good place to register the destructor, too. */
54 if (!coroutine_pool_cleanup_notifier
.notify
) {
55 coroutine_pool_cleanup_notifier
.notify
= coroutine_pool_cleanup
;
56 qemu_thread_atexit_add(&coroutine_pool_cleanup_notifier
);
59 /* This is not exact; there could be a little skew between
60 * release_pool_size and the actual size of release_pool. But
61 * it is just a heuristic, it does not need to be perfect.
63 alloc_pool_size
= atomic_xchg(&release_pool_size
, 0);
64 QSLIST_MOVE_ATOMIC(&alloc_pool
, &release_pool
);
65 co
= QSLIST_FIRST(&alloc_pool
);
69 QSLIST_REMOVE_HEAD(&alloc_pool
, pool_next
);
75 co
= qemu_coroutine_new();
79 QTAILQ_INIT(&co
->co_queue_wakeup
);
83 static void coroutine_delete(Coroutine
*co
)
87 if (CONFIG_COROUTINE_POOL
) {
88 if (release_pool_size
< POOL_BATCH_SIZE
* 2) {
89 QSLIST_INSERT_HEAD_ATOMIC(&release_pool
, co
, pool_next
);
90 atomic_inc(&release_pool_size
);
93 if (alloc_pool_size
< POOL_BATCH_SIZE
) {
94 QSLIST_INSERT_HEAD(&alloc_pool
, co
, pool_next
);
100 qemu_coroutine_delete(co
);
103 void qemu_coroutine_enter(Coroutine
*co
, void *opaque
)
105 Coroutine
*self
= qemu_coroutine_self();
108 trace_qemu_coroutine_enter(self
, co
, opaque
);
111 fprintf(stderr
, "Co-routine re-entered recursively\n");
116 co
->entry_arg
= opaque
;
117 ret
= qemu_coroutine_switch(self
, co
, COROUTINE_ENTER
);
119 qemu_co_queue_run_restart(co
);
122 case COROUTINE_YIELD
:
124 case COROUTINE_TERMINATE
:
125 trace_qemu_coroutine_terminate(co
);
126 coroutine_delete(co
);
133 void coroutine_fn
qemu_coroutine_yield(void)
135 Coroutine
*self
= qemu_coroutine_self();
136 Coroutine
*to
= self
->caller
;
138 trace_qemu_coroutine_yield(self
, to
);
141 fprintf(stderr
, "Co-routine is yielding to no one\n");
146 qemu_coroutine_switch(self
, to
, COROUTINE_YIELD
);