f16ba00de9
Introduce an API for some shared splittable resource, like memory. It's going to be used by backup. Backup uses both read/write io and copy_range. copy_range may consume memory implictly, so the new API is abstract: it doesn't allocate any real memory but only hands out tickets. The idea is that we have some total amount of something and callers should wait in coroutine queue if there is not enough of the resource at the moment. Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> Reviewed-by: Max Reitz <mreitz@redhat.com> Message-id: 20191022111805.3432-5-vsementsov@virtuozzo.com Signed-off-by: Max Reitz <mreitz@redhat.com>
77 lines
2.2 KiB
C
77 lines
2.2 KiB
C
/*
|
|
* Helper functionality for distributing a fixed total amount of
|
|
* an abstract resource among multiple coroutines.
|
|
*
|
|
* Copyright (c) 2019 Virtuozzo International GmbH
|
|
*
|
|
* 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/osdep.h"
|
|
#include "qemu/coroutine.h"
|
|
#include "qemu/co-shared-resource.h"
|
|
|
|
struct SharedResource {
|
|
uint64_t total;
|
|
uint64_t available;
|
|
|
|
CoQueue queue;
|
|
};
|
|
|
|
SharedResource *shres_create(uint64_t total)
|
|
{
|
|
SharedResource *s = g_new0(SharedResource, 1);
|
|
|
|
s->total = s->available = total;
|
|
qemu_co_queue_init(&s->queue);
|
|
|
|
return s;
|
|
}
|
|
|
|
void shres_destroy(SharedResource *s)
|
|
{
|
|
assert(s->available == s->total);
|
|
g_free(s);
|
|
}
|
|
|
|
bool co_try_get_from_shres(SharedResource *s, uint64_t n)
|
|
{
|
|
if (s->available >= n) {
|
|
s->available -= n;
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
void coroutine_fn co_get_from_shres(SharedResource *s, uint64_t n)
|
|
{
|
|
assert(n <= s->total);
|
|
while (!co_try_get_from_shres(s, n)) {
|
|
qemu_co_queue_wait(&s->queue, NULL);
|
|
}
|
|
}
|
|
|
|
void coroutine_fn co_put_to_shres(SharedResource *s, uint64_t n)
|
|
{
|
|
assert(s->total - s->available >= n);
|
|
s->available += n;
|
|
qemu_co_queue_restart_all(&s->queue);
|
|
}
|