oslib-win32.c 8.8 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
/*
 * os-win32.c
 *
 * Copyright (c) 2003-2008 Fabrice Bellard
 * Copyright (c) 2010 Red Hat, Inc.
 *
 * QEMU library functions for win32 which are shared between QEMU and
 * the QEMU tools.
 *
 * 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>
29 30
#include <glib.h>
#include <stdlib.h>
31
#include "config-host.h"
32
#include "sysemu/sysemu.h"
33
#include "qemu/main-loop.h"
34
#include "trace.h"
35
#include "qemu/sockets.h"
36

37 38 39
/* this must come after including "trace.h" */
#include <shlobj.h>

J
Jes Sorensen 已提交
40
void *qemu_oom_check(void *ptr)
41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
{
    if (ptr == NULL) {
        fprintf(stderr, "Failed to allocate memory: %lu\n", GetLastError());
        abort();
    }
    return ptr;
}

void *qemu_memalign(size_t alignment, size_t size)
{
    void *ptr;

    if (!size) {
        abort();
    }
J
Jes Sorensen 已提交
56
    ptr = qemu_oom_check(VirtualAlloc(NULL, size, MEM_COMMIT, PAGE_READWRITE));
57 58 59 60
    trace_qemu_memalign(alignment, size, ptr);
    return ptr;
}

61
void *qemu_anon_ram_alloc(size_t size)
62 63 64 65 66 67
{
    void *ptr;

    /* FIXME: this is not exactly optimal solution since VirtualAlloc
       has 64Kb granularity, but at least it guarantees us that the
       memory is page aligned. */
68
    ptr = VirtualAlloc(NULL, size, MEM_COMMIT, PAGE_READWRITE);
69
    trace_qemu_anon_ram_alloc(size, ptr);
70 71 72 73 74 75
    return ptr;
}

void qemu_vfree(void *ptr)
{
    trace_qemu_vfree(ptr);
76 77 78
    if (ptr) {
        VirtualFree(ptr, 0, MEM_RELEASE);
    }
79
}
80

81 82 83 84 85 86 87 88
void qemu_anon_ram_free(void *ptr, size_t size)
{
    trace_qemu_anon_ram_free(ptr, size);
    if (ptr) {
        VirtualFree(ptr, 0, MEM_RELEASE);
    }
}

89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112
/* FIXME: add proper locking */
struct tm *gmtime_r(const time_t *timep, struct tm *result)
{
    struct tm *p = gmtime(timep);
    memset(result, 0, sizeof(*result));
    if (p) {
        *result = *p;
        p = result;
    }
    return p;
}

/* FIXME: add proper locking */
struct tm *localtime_r(const time_t *timep, struct tm *result)
{
    struct tm *p = localtime(timep);
    memset(result, 0, sizeof(*result));
    if (p) {
        *result = *p;
        p = result;
    }
    return p;
}

113
void qemu_set_block(int fd)
P
Paolo Bonzini 已提交
114 115
{
    unsigned long opt = 0;
116
    WSAEventSelect(fd, NULL, 0);
P
Paolo Bonzini 已提交
117 118 119
    ioctlsocket(fd, FIONBIO, &opt);
}

120
void qemu_set_nonblock(int fd)
121 122 123
{
    unsigned long opt = 1;
    ioctlsocket(fd, FIONBIO, &opt);
124
    qemu_fd_register(fd);
125 126
}

127 128 129 130 131 132 133 134 135 136
int socket_set_fast_reuse(int fd)
{
    /* Enabling the reuse of an endpoint that was used by a socket still in
     * TIME_WAIT state is usually performed by setting SO_REUSEADDR. On Windows
     * fast reuse is the default and SO_REUSEADDR does strange things. So we
     * don't have to do anything here. More info can be found at:
     * http://msdn.microsoft.com/en-us/library/windows/desktop/ms740621.aspx */
    return 0;
}

137 138 139 140 141 142 143 144 145 146 147 148 149
int inet_aton(const char *cp, struct in_addr *ia)
{
    uint32_t addr = inet_addr(cp);
    if (addr == 0xffffffff) {
	return 0;
    }
    ia->s_addr = addr;
    return 1;
}

void qemu_set_cloexec(int fd)
{
}
150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169

/* Offset between 1/1/1601 and 1/1/1970 in 100 nanosec units */
#define _W32_FT_OFFSET (116444736000000000ULL)

int qemu_gettimeofday(qemu_timeval *tp)
{
  union {
    unsigned long long ns100; /*time since 1 Jan 1601 in 100ns units */
    FILETIME ft;
  }  _now;

  if(tp) {
      GetSystemTimeAsFileTime (&_now.ft);
      tp->tv_usec=(long)((_now.ns100 / 10ULL) % 1000000ULL );
      tp->tv_sec= (long)((_now.ns100 - _W32_FT_OFFSET) / 10000000ULL);
  }
  /* Always return 0 as per Open Group Base Specifications Issue 6.
     Do not set errno on error.  */
  return 0;
}
170 171 172 173 174

int qemu_get_thread_id(void)
{
    return GetCurrentThreadId();
}
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191

char *
qemu_get_local_state_pathname(const char *relative_pathname)
{
    HRESULT result;
    char base_path[MAX_PATH+1] = "";

    result = SHGetFolderPath(NULL, CSIDL_COMMON_APPDATA, NULL,
                             /* SHGFP_TYPE_CURRENT */ 0, base_path);
    if (result != S_OK) {
        /* misconfigured environment */
        g_critical("CSIDL_COMMON_APPDATA unavailable: %ld", (long)result);
        abort();
    }
    return g_strdup_printf("%s" G_DIR_SEPARATOR_S "%s", base_path,
                           relative_pathname);
}
S
Stefan Hajnoczi 已提交
192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210

void qemu_set_tty_echo(int fd, bool echo)
{
    HANDLE handle = (HANDLE)_get_osfhandle(fd);
    DWORD dwMode = 0;

    if (handle == INVALID_HANDLE_VALUE) {
        return;
    }

    GetConsoleMode(handle, &dwMode);

    if (echo) {
        SetConsoleMode(handle, dwMode | ENABLE_ECHO_INPUT | ENABLE_LINE_INPUT);
    } else {
        SetConsoleMode(handle,
                       dwMode & ~(ENABLE_ECHO_INPUT | ENABLE_LINE_INPUT));
    }
}
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240

static char exec_dir[PATH_MAX];

void qemu_init_exec_dir(const char *argv0)
{

    char *p;
    char buf[MAX_PATH];
    DWORD len;

    len = GetModuleFileName(NULL, buf, sizeof(buf) - 1);
    if (len == 0) {
        return;
    }

    buf[len] = 0;
    p = buf + len - 1;
    while (p != buf && *p != '\\') {
        p--;
    }
    *p = 0;
    if (access(buf, R_OK) == 0) {
        pstrcpy(exec_dir, sizeof(exec_dir), buf);
    }
}

char *qemu_get_exec_dir(void)
{
    return g_strdup(exec_dir);
}
241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352

/*
 * g_poll has a problem on Windows when using
 * timeouts < 10ms, in glib/gpoll.c:
 *
 * // If not, and we have a significant timeout, poll again with
 * // timeout then. Note that this will return indication for only
 * // one event, or only for messages. We ignore timeouts less than
 * // ten milliseconds as they are mostly pointless on Windows, the
 * // MsgWaitForMultipleObjectsEx() call will timeout right away
 * // anyway.
 *
 * if (retval == 0 && (timeout == INFINITE || timeout >= 10))
 *   retval = poll_rest (poll_msgs, handles, nhandles, fds, nfds, timeout);
 *
 * So whenever g_poll is called with timeout < 10ms it does
 * a quick poll instead of wait, this causes significant performance
 * degradation of QEMU, thus we should use WaitForMultipleObjectsEx
 * directly
 */
gint g_poll_fixed(GPollFD *fds, guint nfds, gint timeout)
{
    guint i;
    HANDLE handles[MAXIMUM_WAIT_OBJECTS];
    gint nhandles = 0;
    int num_completed = 0;

    for (i = 0; i < nfds; i++) {
        gint j;

        if (fds[i].fd <= 0) {
            continue;
        }

        /* don't add same handle several times
         */
        for (j = 0; j < nhandles; j++) {
            if (handles[j] == (HANDLE)fds[i].fd) {
                break;
            }
        }

        if (j == nhandles) {
            if (nhandles == MAXIMUM_WAIT_OBJECTS) {
                fprintf(stderr, "Too many handles to wait for!\n");
                break;
            } else {
                handles[nhandles++] = (HANDLE)fds[i].fd;
            }
        }
    }

    for (i = 0; i < nfds; ++i) {
        fds[i].revents = 0;
    }

    if (timeout == -1) {
        timeout = INFINITE;
    }

    if (nhandles == 0) {
        if (timeout == INFINITE) {
            return -1;
        } else {
            SleepEx(timeout, TRUE);
            return 0;
        }
    }

    while (1) {
        DWORD res;
        gint j;

        res = WaitForMultipleObjectsEx(nhandles, handles, FALSE,
            timeout, TRUE);

        if (res == WAIT_FAILED) {
            for (i = 0; i < nfds; ++i) {
                fds[i].revents = 0;
            }

            return -1;
        } else if ((res == WAIT_TIMEOUT) || (res == WAIT_IO_COMPLETION) ||
                   ((int)res < (int)WAIT_OBJECT_0) ||
                   (res >= (WAIT_OBJECT_0 + nhandles))) {
            break;
        }

        for (i = 0; i < nfds; ++i) {
            if (handles[res - WAIT_OBJECT_0] == (HANDLE)fds[i].fd) {
                fds[i].revents = fds[i].events;
            }
        }

        ++num_completed;

        if (nhandles <= 1) {
            break;
        }

        /* poll the rest of the handles
         */
        for (j = res - WAIT_OBJECT_0 + 1; j < nhandles; j++) {
            handles[j - 1] = handles[j];
        }
        --nhandles;

        timeout = 0;
    }

    return num_completed;
}