os-win32.c

   1 /*
   2  * os-win32.c
   3  *
   4  * Copyright (c) 2003-2008 Fabrice Bellard
   5  * Copyright (c) 2010 Red Hat, Inc.
   6  *
   7  * Permission is hereby granted, free of charge, to any person obtaining a copy
   8  * of this software and associated documentation files (the "Software"), to deal
   9  * in the Software without restriction, including without limitation the rights
  10  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  11  * copies of the Software, and to permit persons to whom the Software is
  12  * furnished to do so, subject to the following conditions:
  13  *
  14  * The above copyright notice and this permission notice shall be included in
  15  * all copies or substantial portions of the Software.
  16  *
  17  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  18  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  20  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  21  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  22  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  23  * THE SOFTWARE.
  24  */
  25 #include <windows.h>
  26 #include <unistd.h>
  27 #include <fcntl.h>
  28 #include <signal.h>
  29 #include <time.h>
  30 #include <errno.h>
  31 #include <sys/time.h>
  32 #include "config-host.h"
  33 #include "sysemu.h"
  34
  35 /***********************************************************/
  36 /* Polling handling */
  37
  38 typedef struct PollingEntry {
  39     PollingFunc *func;
  40     void *opaque;
  41     struct PollingEntry *next;
  42 } PollingEntry;
  43
  44 static PollingEntry *first_polling_entry;
  45
  46 int qemu_add_polling_cb(PollingFunc *func, void *opaque)
  47 {
  48     PollingEntry **ppe, *pe;
  49     pe = qemu_mallocz(sizeof(PollingEntry));
  50     pe->func = func;
  51     pe->opaque = opaque;
  52     for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);
  53     *ppe = pe;
  54     return 0;
  55 }
  56
  57 void qemu_del_polling_cb(PollingFunc *func, void *opaque)
  58 {
  59     PollingEntry **ppe, *pe;
  60     for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next) {
  61         pe = *ppe;
  62         if (pe->func == func && pe->opaque == opaque) {
  63             *ppe = pe->next;
  64             qemu_free(pe);
  65             break;
  66         }
  67     }
  68 }
  69
  70 /***********************************************************/
  71 /* Wait objects support */
  72 typedef struct WaitObjects {
  73     int num;
  74     HANDLE events[MAXIMUM_WAIT_OBJECTS + 1];
  75     WaitObjectFunc *func[MAXIMUM_WAIT_OBJECTS + 1];
  76     void *opaque[MAXIMUM_WAIT_OBJECTS + 1];
  77 } WaitObjects;
  78
  79 static WaitObjects wait_objects = {0};
  80
  81 int qemu_add_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
  82 {
  83     WaitObjects *w = &wait_objects;
  84
  85     if (w->num >= MAXIMUM_WAIT_OBJECTS)
  86         return -1;
  87     w->events[w->num] = handle;
  88     w->func[w->num] = func;
  89     w->opaque[w->num] = opaque;
  90     w->num++;
  91     return 0;
  92 }
  93
  94 void qemu_del_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
  95 {
  96     int i, found;
  97     WaitObjects *w = &wait_objects;
  98
  99     found = 0;
 100     for (i = 0; i < w->num; i++) {
 101         if (w->events[i] == handle)
 102             found = 1;
 103         if (found) {
 104             w->events[i] = w->events[i + 1];
 105             w->func[i] = w->func[i + 1];
 106             w->opaque[i] = w->opaque[i + 1];
 107         }
 108     }
 109     if (found)
 110         w->num--;
 111 }