Archipelago » qemu

/*

 * os-win32.c

 *

 * Copyright (c) 2003-2008 Fabrice Bellard

 * Copyright (c) 2010 Red Hat, Inc.

 *

 * 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 <windows.h>

#include <unistd.h>

#include <fcntl.h>

#include <signal.h>

#include <time.h>

#include <errno.h>

#include <sys/time.h>

#include "config-host.h"

#include "sysemu.h"

/***********************************************************/

/* Polling handling */

typedef struct PollingEntry {

    PollingFunc *func;

    void *opaque;

    struct PollingEntry *next;

} PollingEntry;

static PollingEntry *first_polling_entry;

int qemu_add_polling_cb(PollingFunc *func, void *opaque)

{

    PollingEntry **ppe, *pe;

    pe = qemu_mallocz(sizeof(PollingEntry));

    pe->func = func;

    pe->opaque = opaque;

    for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);

    *ppe = pe;

    return 0;

}

void qemu_del_polling_cb(PollingFunc *func, void *opaque)

{

    PollingEntry **ppe, *pe;

    for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next) {

        pe = *ppe;

        if (pe->func == func && pe->opaque == opaque) {

            *ppe = pe->next;

            qemu_free(pe);

            break;

        }

    }

}

/***********************************************************/

/* Wait objects support */

typedef struct WaitObjects {

    int num;

    HANDLE events[MAXIMUM_WAIT_OBJECTS + 1];

    WaitObjectFunc *func[MAXIMUM_WAIT_OBJECTS + 1];

    void *opaque[MAXIMUM_WAIT_OBJECTS + 1];

} WaitObjects;

static WaitObjects wait_objects = {0};

int qemu_add_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)

{

    WaitObjects *w = &wait_objects;

    if (w->num >= MAXIMUM_WAIT_OBJECTS)

        return -1;

    w->events[w->num] = handle;

    w->func[w->num] = func;

    w->opaque[w->num] = opaque;

    w->num++;

    return 0;

}

void qemu_del_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)

{

    int i, found;

    WaitObjects *w = &wait_objects;

    found = 0;

    for (i = 0; i < w->num; i++) {

        if (w->events[i] == handle)

            found = 1;

        if (found) {

            w->events[i] = w->events[i + 1];

            w->func[i] = w->func[i + 1];

            w->opaque[i] = w->opaque[i + 1];

        }

    }

    if (found)

        w->num--;

}