spice-gtk/src/coroutine_ucontext.c
Frediano Ziglio 942bd130dd Allows to use Valgrind with ucontext coroutines
Changing stack is not usually instrumentation friendly.
Allows to enable the usage of Valgrind memcheck calling some
valgrind macros.

Signed-off-by: Frediano Ziglio <freddy77@gmail.com>
Acked-by: Marc-André Lureau <marcandre.lureau@redhat.com>
2020-08-22 09:25:07 +01:00

148 lines
3.4 KiB
C

/*
* GTK VNC Widget
*
* Copyright (C) 2006 Anthony Liguori <anthony@codemonkey.ws>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.0 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "config.h"
#include <glib.h>
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#include <sys/mman.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <spice/macros.h>
#ifdef HAVE_VALGRIND
#include <valgrind/valgrind.h>
#endif
#include "coroutine.h"
#ifndef MAP_ANONYMOUS
# define MAP_ANONYMOUS MAP_ANON
#endif
int coroutine_release(struct coroutine *co)
{
return cc_release(&co->cc);
}
static int _coroutine_release(struct continuation *cc)
{
struct coroutine *co = SPICE_CONTAINEROF(cc, struct coroutine, cc);
#ifdef HAVE_VALGRIND
VALGRIND_STACK_DEREGISTER(co->vg_stack);
#endif
munmap(co->cc.stack, co->cc.stack_size);
co->caller = NULL;
return 0;
}
static void coroutine_trampoline(struct continuation *cc)
{
struct coroutine *co = SPICE_CONTAINEROF(cc, struct coroutine, cc);
co->data = co->entry(co->data);
}
void coroutine_init(struct coroutine *co)
{
if (co->stack_size == 0)
co->stack_size = 16 << 20;
co->cc.stack_size = co->stack_size;
co->cc.stack = mmap(0, co->stack_size,
PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS,
-1, 0);
if (co->cc.stack == MAP_FAILED)
g_error("mmap(%" G_GSIZE_FORMAT ") failed: %s",
co->stack_size, g_strerror(errno));
#ifdef HAVE_VALGRIND
co->vg_stack = VALGRIND_STACK_REGISTER(co->cc.stack, co->cc.stack + co->stack_size);
#endif
co->cc.entry = coroutine_trampoline;
co->cc.release = _coroutine_release;
co->exited = 0;
cc_init(&co->cc);
}
static struct coroutine leader;
static struct coroutine *current = &leader;
struct coroutine *coroutine_self(void)
{
return current;
}
static void *coroutine_swap(struct coroutine *from, struct coroutine *to, void *arg)
{
int ret;
to->data = arg;
current = to;
ret = cc_swap(&from->cc, &to->cc);
if (ret == 0)
return from->data;
else if (ret == 1) {
coroutine_release(to);
current = from;
to->exited = 1;
return to->data;
}
return NULL;
}
void *coroutine_yieldto(struct coroutine *to, void *arg)
{
g_return_val_if_fail(!to->caller, NULL);
g_return_val_if_fail(!to->exited, NULL);
to->caller = coroutine_self();
return coroutine_swap(coroutine_self(), to, arg);
}
void *coroutine_yield(void *arg)
{
struct coroutine *to = coroutine_self()->caller;
if (!to) {
fprintf(stderr, "Co-routine is yielding to no one\n");
abort();
}
coroutine_self()->caller = NULL;
return coroutine_swap(coroutine_self(), to, arg);
}
gboolean coroutine_is_main(struct coroutine *co)
{
return (co == &leader);
}
/*
* Local variables:
* c-indent-level: 8
* c-basic-offset: 8
* tab-width: 8
* End:
*/