2011-06-30 15:56:46 +00:00
|
|
|
/*
|
|
|
|
* coroutine queues and locks
|
|
|
|
*
|
|
|
|
* Copyright (c) 2011 Kevin Wolf <kwolf@redhat.com>
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "qemu-common.h"
|
2012-12-17 17:19:44 +00:00
|
|
|
#include "block/coroutine.h"
|
|
|
|
#include "block/coroutine_int.h"
|
2012-12-17 17:20:00 +00:00
|
|
|
#include "qemu/queue.h"
|
2012-12-17 17:19:44 +00:00
|
|
|
#include "block/aio.h"
|
2011-06-30 15:56:46 +00:00
|
|
|
#include "trace.h"
|
|
|
|
|
2013-03-07 12:41:50 +00:00
|
|
|
/* Coroutines are awoken from a BH to allow the current coroutine to complete
|
|
|
|
* its flow of execution. The BH may run after the CoQueue has been destroyed,
|
|
|
|
* so keep BH data in a separate heap-allocated struct.
|
|
|
|
*/
|
|
|
|
typedef struct {
|
|
|
|
QEMUBH *bh;
|
|
|
|
QTAILQ_HEAD(, Coroutine) entries;
|
|
|
|
} CoQueueNextData;
|
2011-06-30 15:56:46 +00:00
|
|
|
|
|
|
|
static void qemu_co_queue_next_bh(void *opaque)
|
|
|
|
{
|
2013-03-07 12:41:50 +00:00
|
|
|
CoQueueNextData *data = opaque;
|
2011-06-30 15:56:46 +00:00
|
|
|
Coroutine *next;
|
|
|
|
|
|
|
|
trace_qemu_co_queue_next_bh();
|
2013-03-07 12:41:50 +00:00
|
|
|
while ((next = QTAILQ_FIRST(&data->entries))) {
|
|
|
|
QTAILQ_REMOVE(&data->entries, next, co_queue_next);
|
2011-06-30 15:56:46 +00:00
|
|
|
qemu_coroutine_enter(next, NULL);
|
|
|
|
}
|
2013-03-07 12:41:50 +00:00
|
|
|
|
|
|
|
qemu_bh_delete(data->bh);
|
|
|
|
g_slice_free(CoQueueNextData, data);
|
2011-06-30 15:56:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_co_queue_init(CoQueue *queue)
|
|
|
|
{
|
|
|
|
QTAILQ_INIT(&queue->entries);
|
2011-07-13 13:42:52 +00:00
|
|
|
|
2013-03-07 12:41:50 +00:00
|
|
|
/* This will be exposed to callers once there are multiple AioContexts */
|
|
|
|
queue->ctx = qemu_get_aio_context();
|
2011-06-30 15:56:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void coroutine_fn qemu_co_queue_wait(CoQueue *queue)
|
|
|
|
{
|
|
|
|
Coroutine *self = qemu_coroutine_self();
|
|
|
|
QTAILQ_INSERT_TAIL(&queue->entries, self, co_queue_next);
|
|
|
|
qemu_coroutine_yield();
|
|
|
|
assert(qemu_in_coroutine());
|
|
|
|
}
|
|
|
|
|
2011-11-03 08:57:26 +00:00
|
|
|
void coroutine_fn qemu_co_queue_wait_insert_head(CoQueue *queue)
|
|
|
|
{
|
|
|
|
Coroutine *self = qemu_coroutine_self();
|
|
|
|
QTAILQ_INSERT_HEAD(&queue->entries, self, co_queue_next);
|
|
|
|
qemu_coroutine_yield();
|
|
|
|
assert(qemu_in_coroutine());
|
|
|
|
}
|
|
|
|
|
2013-03-07 12:41:50 +00:00
|
|
|
static bool qemu_co_queue_do_restart(CoQueue *queue, bool single)
|
2011-06-30 15:56:46 +00:00
|
|
|
{
|
|
|
|
Coroutine *next;
|
2013-03-07 12:41:50 +00:00
|
|
|
CoQueueNextData *data;
|
|
|
|
|
|
|
|
if (QTAILQ_EMPTY(&queue->entries)) {
|
|
|
|
return false;
|
|
|
|
}
|
2011-06-30 15:56:46 +00:00
|
|
|
|
2013-03-07 12:41:50 +00:00
|
|
|
data = g_slice_new(CoQueueNextData);
|
|
|
|
data->bh = aio_bh_new(queue->ctx, qemu_co_queue_next_bh, data);
|
|
|
|
QTAILQ_INIT(&data->entries);
|
|
|
|
qemu_bh_schedule(data->bh);
|
|
|
|
|
|
|
|
while ((next = QTAILQ_FIRST(&queue->entries)) != NULL) {
|
2011-06-30 15:56:46 +00:00
|
|
|
QTAILQ_REMOVE(&queue->entries, next, co_queue_next);
|
2013-03-07 12:41:50 +00:00
|
|
|
QTAILQ_INSERT_TAIL(&data->entries, next, co_queue_next);
|
2011-06-30 15:56:46 +00:00
|
|
|
trace_qemu_co_queue_next(next);
|
2013-03-07 12:41:50 +00:00
|
|
|
if (single) {
|
|
|
|
break;
|
|
|
|
}
|
2011-06-30 15:56:46 +00:00
|
|
|
}
|
2013-03-07 12:41:50 +00:00
|
|
|
return true;
|
|
|
|
}
|
2011-06-30 15:56:46 +00:00
|
|
|
|
2013-03-07 12:41:50 +00:00
|
|
|
bool qemu_co_queue_next(CoQueue *queue)
|
|
|
|
{
|
|
|
|
return qemu_co_queue_do_restart(queue, true);
|
2011-06-30 15:56:46 +00:00
|
|
|
}
|
|
|
|
|
2011-11-17 13:40:26 +00:00
|
|
|
void qemu_co_queue_restart_all(CoQueue *queue)
|
|
|
|
{
|
2013-03-07 12:41:50 +00:00
|
|
|
qemu_co_queue_do_restart(queue, false);
|
2011-11-17 13:40:26 +00:00
|
|
|
}
|
|
|
|
|
2011-06-30 15:56:46 +00:00
|
|
|
bool qemu_co_queue_empty(CoQueue *queue)
|
|
|
|
{
|
|
|
|
return (QTAILQ_FIRST(&queue->entries) == NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_co_mutex_init(CoMutex *mutex)
|
|
|
|
{
|
|
|
|
memset(mutex, 0, sizeof(*mutex));
|
|
|
|
qemu_co_queue_init(&mutex->queue);
|
|
|
|
}
|
|
|
|
|
|
|
|
void coroutine_fn qemu_co_mutex_lock(CoMutex *mutex)
|
|
|
|
{
|
|
|
|
Coroutine *self = qemu_coroutine_self();
|
|
|
|
|
|
|
|
trace_qemu_co_mutex_lock_entry(mutex, self);
|
|
|
|
|
|
|
|
while (mutex->locked) {
|
|
|
|
qemu_co_queue_wait(&mutex->queue);
|
|
|
|
}
|
|
|
|
|
|
|
|
mutex->locked = true;
|
|
|
|
|
|
|
|
trace_qemu_co_mutex_lock_return(mutex, self);
|
|
|
|
}
|
|
|
|
|
|
|
|
void coroutine_fn qemu_co_mutex_unlock(CoMutex *mutex)
|
|
|
|
{
|
|
|
|
Coroutine *self = qemu_coroutine_self();
|
|
|
|
|
|
|
|
trace_qemu_co_mutex_unlock_entry(mutex, self);
|
|
|
|
|
|
|
|
assert(mutex->locked == true);
|
|
|
|
assert(qemu_in_coroutine());
|
|
|
|
|
|
|
|
mutex->locked = false;
|
|
|
|
qemu_co_queue_next(&mutex->queue);
|
|
|
|
|
|
|
|
trace_qemu_co_mutex_unlock_return(mutex, self);
|
|
|
|
}
|
2011-08-02 06:32:51 +00:00
|
|
|
|
|
|
|
void qemu_co_rwlock_init(CoRwlock *lock)
|
|
|
|
{
|
|
|
|
memset(lock, 0, sizeof(*lock));
|
|
|
|
qemu_co_queue_init(&lock->queue);
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_co_rwlock_rdlock(CoRwlock *lock)
|
|
|
|
{
|
|
|
|
while (lock->writer) {
|
|
|
|
qemu_co_queue_wait(&lock->queue);
|
|
|
|
}
|
|
|
|
lock->reader++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_co_rwlock_unlock(CoRwlock *lock)
|
|
|
|
{
|
|
|
|
assert(qemu_in_coroutine());
|
|
|
|
if (lock->writer) {
|
|
|
|
lock->writer = false;
|
2011-11-17 13:40:26 +00:00
|
|
|
qemu_co_queue_restart_all(&lock->queue);
|
2011-08-02 06:32:51 +00:00
|
|
|
} else {
|
|
|
|
lock->reader--;
|
|
|
|
assert(lock->reader >= 0);
|
|
|
|
/* Wakeup only one waiting writer */
|
|
|
|
if (!lock->reader) {
|
|
|
|
qemu_co_queue_next(&lock->queue);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_co_rwlock_wrlock(CoRwlock *lock)
|
|
|
|
{
|
|
|
|
while (lock->writer || lock->reader) {
|
|
|
|
qemu_co_queue_wait(&lock->queue);
|
|
|
|
}
|
|
|
|
lock->writer = true;
|
|
|
|
}
|