2011-06-30 17:56:46 +02: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.
|
|
|
|
*/
|
|
|
|
|
2016-01-29 18:49:55 +01:00
|
|
|
#include "qemu/osdep.h"
|
2011-06-30 17:56:46 +02:00
|
|
|
#include "qemu-common.h"
|
2015-09-01 15:48:02 +02:00
|
|
|
#include "qemu/coroutine.h"
|
|
|
|
#include "qemu/coroutine_int.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/queue.h"
|
2011-06-30 17:56:46 +02:00
|
|
|
#include "trace.h"
|
|
|
|
|
|
|
|
void qemu_co_queue_init(CoQueue *queue)
|
|
|
|
{
|
2016-07-04 19:09:59 +02:00
|
|
|
QSIMPLEQ_INIT(&queue->entries);
|
2011-06-30 17:56:46 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void coroutine_fn qemu_co_queue_wait(CoQueue *queue)
|
|
|
|
{
|
|
|
|
Coroutine *self = qemu_coroutine_self();
|
2016-07-04 19:09:59 +02:00
|
|
|
QSIMPLEQ_INSERT_TAIL(&queue->entries, self, co_queue_next);
|
2011-06-30 17:56:46 +02:00
|
|
|
qemu_coroutine_yield();
|
|
|
|
assert(qemu_in_coroutine());
|
|
|
|
}
|
|
|
|
|
2013-05-17 15:51:26 +02:00
|
|
|
/**
|
|
|
|
* qemu_co_queue_run_restart:
|
|
|
|
*
|
|
|
|
* Enter each coroutine that was previously marked for restart by
|
|
|
|
* qemu_co_queue_next() or qemu_co_queue_restart_all(). This function is
|
|
|
|
* invoked by the core coroutine code when the current coroutine yields or
|
|
|
|
* terminates.
|
|
|
|
*/
|
|
|
|
void qemu_co_queue_run_restart(Coroutine *co)
|
|
|
|
{
|
|
|
|
Coroutine *next;
|
|
|
|
|
|
|
|
trace_qemu_co_queue_run_restart(co);
|
2016-07-04 19:09:59 +02:00
|
|
|
while ((next = QSIMPLEQ_FIRST(&co->co_queue_wakeup))) {
|
|
|
|
QSIMPLEQ_REMOVE_HEAD(&co->co_queue_wakeup, co_queue_next);
|
2013-05-17 15:51:26 +02:00
|
|
|
qemu_coroutine_enter(next, NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-07 13:41:50 +01:00
|
|
|
static bool qemu_co_queue_do_restart(CoQueue *queue, bool single)
|
2011-06-30 17:56:46 +02:00
|
|
|
{
|
2013-05-17 15:51:26 +02:00
|
|
|
Coroutine *self = qemu_coroutine_self();
|
2011-06-30 17:56:46 +02:00
|
|
|
Coroutine *next;
|
2013-03-07 13:41:50 +01:00
|
|
|
|
2016-07-04 19:09:59 +02:00
|
|
|
if (QSIMPLEQ_EMPTY(&queue->entries)) {
|
2013-03-07 13:41:50 +01:00
|
|
|
return false;
|
|
|
|
}
|
2011-06-30 17:56:46 +02:00
|
|
|
|
2016-07-04 19:09:59 +02:00
|
|
|
while ((next = QSIMPLEQ_FIRST(&queue->entries)) != NULL) {
|
|
|
|
QSIMPLEQ_REMOVE_HEAD(&queue->entries, co_queue_next);
|
|
|
|
QSIMPLEQ_INSERT_TAIL(&self->co_queue_wakeup, next, co_queue_next);
|
2011-06-30 17:56:46 +02:00
|
|
|
trace_qemu_co_queue_next(next);
|
2013-03-07 13:41:50 +01:00
|
|
|
if (single) {
|
|
|
|
break;
|
|
|
|
}
|
2011-06-30 17:56:46 +02:00
|
|
|
}
|
2013-03-07 13:41:50 +01:00
|
|
|
return true;
|
|
|
|
}
|
2011-06-30 17:56:46 +02:00
|
|
|
|
2013-07-26 22:39:22 +02:00
|
|
|
bool coroutine_fn qemu_co_queue_next(CoQueue *queue)
|
2013-03-07 13:41:50 +01:00
|
|
|
{
|
2013-07-26 22:39:22 +02:00
|
|
|
assert(qemu_in_coroutine());
|
2013-03-07 13:41:50 +01:00
|
|
|
return qemu_co_queue_do_restart(queue, true);
|
2011-06-30 17:56:46 +02:00
|
|
|
}
|
|
|
|
|
2013-07-26 22:39:22 +02:00
|
|
|
void coroutine_fn qemu_co_queue_restart_all(CoQueue *queue)
|
2011-11-17 14:40:26 +01:00
|
|
|
{
|
2013-07-26 22:39:22 +02:00
|
|
|
assert(qemu_in_coroutine());
|
2013-03-07 13:41:50 +01:00
|
|
|
qemu_co_queue_do_restart(queue, false);
|
2011-11-17 14:40:26 +01:00
|
|
|
}
|
|
|
|
|
2013-07-26 22:39:22 +02:00
|
|
|
bool qemu_co_enter_next(CoQueue *queue)
|
|
|
|
{
|
|
|
|
Coroutine *next;
|
|
|
|
|
2016-07-04 19:09:59 +02:00
|
|
|
next = QSIMPLEQ_FIRST(&queue->entries);
|
2013-07-26 22:39:22 +02:00
|
|
|
if (!next) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2016-07-04 19:09:59 +02:00
|
|
|
QSIMPLEQ_REMOVE_HEAD(&queue->entries, co_queue_next);
|
2013-07-26 22:39:22 +02:00
|
|
|
qemu_coroutine_enter(next, NULL);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-06-30 17:56:46 +02:00
|
|
|
bool qemu_co_queue_empty(CoQueue *queue)
|
|
|
|
{
|
2016-07-04 19:09:59 +02:00
|
|
|
return QSIMPLEQ_FIRST(&queue->entries) == NULL;
|
2011-06-30 17:56:46 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
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 08:32:51 +02: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 14:40:26 +01:00
|
|
|
qemu_co_queue_restart_all(&lock->queue);
|
2011-08-02 08:32:51 +02: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;
|
|
|
|
}
|