xref: /qemu/util/oslib-win32.c (revision 72ac97cd)
1 /*
2  * os-win32.c
3  *
4  * Copyright (c) 2003-2008 Fabrice Bellard
5  * Copyright (c) 2010 Red Hat, Inc.
6  *
7  * QEMU library functions for win32 which are shared between QEMU and
8  * the QEMU tools.
9  *
10  * Permission is hereby granted, free of charge, to any person obtaining a copy
11  * of this software and associated documentation files (the "Software"), to deal
12  * in the Software without restriction, including without limitation the rights
13  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
14  * copies of the Software, and to permit persons to whom the Software is
15  * furnished to do so, subject to the following conditions:
16  *
17  * The above copyright notice and this permission notice shall be included in
18  * all copies or substantial portions of the Software.
19  *
20  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
21  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
22  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
23  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
24  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
25  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
26  * THE SOFTWARE.
27  */
28 #include <windows.h>
29 #include <glib.h>
30 #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 /* this must come after including "trace.h" */
38 #include <shlobj.h>
39 
40 void *qemu_oom_check(void *ptr)
41 {
42     if (ptr == NULL) {
43         fprintf(stderr, "Failed to allocate memory: %lu\n", GetLastError());
44         abort();
45     }
46     return ptr;
47 }
48 
49 void *qemu_memalign(size_t alignment, size_t size)
50 {
51     void *ptr;
52 
53     if (!size) {
54         abort();
55     }
56     ptr = qemu_oom_check(VirtualAlloc(NULL, size, MEM_COMMIT, PAGE_READWRITE));
57     trace_qemu_memalign(alignment, size, ptr);
58     return ptr;
59 }
60 
61 void *qemu_anon_ram_alloc(size_t size)
62 {
63     void *ptr;
64 
65     /* FIXME: this is not exactly optimal solution since VirtualAlloc
66        has 64Kb granularity, but at least it guarantees us that the
67        memory is page aligned. */
68     ptr = VirtualAlloc(NULL, size, MEM_COMMIT, PAGE_READWRITE);
69     trace_qemu_anon_ram_alloc(size, ptr);
70     return ptr;
71 }
72 
73 void qemu_vfree(void *ptr)
74 {
75     trace_qemu_vfree(ptr);
76     if (ptr) {
77         VirtualFree(ptr, 0, MEM_RELEASE);
78     }
79 }
80 
81 void qemu_anon_ram_free(void *ptr, size_t size)
82 {
83     trace_qemu_anon_ram_free(ptr, size);
84     if (ptr) {
85         VirtualFree(ptr, 0, MEM_RELEASE);
86     }
87 }
88 
89 /* FIXME: add proper locking */
90 struct tm *gmtime_r(const time_t *timep, struct tm *result)
91 {
92     struct tm *p = gmtime(timep);
93     memset(result, 0, sizeof(*result));
94     if (p) {
95         *result = *p;
96         p = result;
97     }
98     return p;
99 }
100 
101 /* FIXME: add proper locking */
102 struct tm *localtime_r(const time_t *timep, struct tm *result)
103 {
104     struct tm *p = localtime(timep);
105     memset(result, 0, sizeof(*result));
106     if (p) {
107         *result = *p;
108         p = result;
109     }
110     return p;
111 }
112 
113 void qemu_set_block(int fd)
114 {
115     unsigned long opt = 0;
116     WSAEventSelect(fd, NULL, 0);
117     ioctlsocket(fd, FIONBIO, &opt);
118 }
119 
120 void qemu_set_nonblock(int fd)
121 {
122     unsigned long opt = 1;
123     ioctlsocket(fd, FIONBIO, &opt);
124     qemu_fd_register(fd);
125 }
126 
127 int socket_set_fast_reuse(int fd)
128 {
129     /* Enabling the reuse of an endpoint that was used by a socket still in
130      * TIME_WAIT state is usually performed by setting SO_REUSEADDR. On Windows
131      * fast reuse is the default and SO_REUSEADDR does strange things. So we
132      * don't have to do anything here. More info can be found at:
133      * http://msdn.microsoft.com/en-us/library/windows/desktop/ms740621.aspx */
134     return 0;
135 }
136 
137 int inet_aton(const char *cp, struct in_addr *ia)
138 {
139     uint32_t addr = inet_addr(cp);
140     if (addr == 0xffffffff) {
141 	return 0;
142     }
143     ia->s_addr = addr;
144     return 1;
145 }
146 
147 void qemu_set_cloexec(int fd)
148 {
149 }
150 
151 /* Offset between 1/1/1601 and 1/1/1970 in 100 nanosec units */
152 #define _W32_FT_OFFSET (116444736000000000ULL)
153 
154 int qemu_gettimeofday(qemu_timeval *tp)
155 {
156   union {
157     unsigned long long ns100; /*time since 1 Jan 1601 in 100ns units */
158     FILETIME ft;
159   }  _now;
160 
161   if(tp) {
162       GetSystemTimeAsFileTime (&_now.ft);
163       tp->tv_usec=(long)((_now.ns100 / 10ULL) % 1000000ULL );
164       tp->tv_sec= (long)((_now.ns100 - _W32_FT_OFFSET) / 10000000ULL);
165   }
166   /* Always return 0 as per Open Group Base Specifications Issue 6.
167      Do not set errno on error.  */
168   return 0;
169 }
170 
171 int qemu_get_thread_id(void)
172 {
173     return GetCurrentThreadId();
174 }
175 
176 char *
177 qemu_get_local_state_pathname(const char *relative_pathname)
178 {
179     HRESULT result;
180     char base_path[MAX_PATH+1] = "";
181 
182     result = SHGetFolderPath(NULL, CSIDL_COMMON_APPDATA, NULL,
183                              /* SHGFP_TYPE_CURRENT */ 0, base_path);
184     if (result != S_OK) {
185         /* misconfigured environment */
186         g_critical("CSIDL_COMMON_APPDATA unavailable: %ld", (long)result);
187         abort();
188     }
189     return g_strdup_printf("%s" G_DIR_SEPARATOR_S "%s", base_path,
190                            relative_pathname);
191 }
192 
193 void qemu_set_tty_echo(int fd, bool echo)
194 {
195     HANDLE handle = (HANDLE)_get_osfhandle(fd);
196     DWORD dwMode = 0;
197 
198     if (handle == INVALID_HANDLE_VALUE) {
199         return;
200     }
201 
202     GetConsoleMode(handle, &dwMode);
203 
204     if (echo) {
205         SetConsoleMode(handle, dwMode | ENABLE_ECHO_INPUT | ENABLE_LINE_INPUT);
206     } else {
207         SetConsoleMode(handle,
208                        dwMode & ~(ENABLE_ECHO_INPUT | ENABLE_LINE_INPUT));
209     }
210 }
211 
212 static char exec_dir[PATH_MAX];
213 
214 void qemu_init_exec_dir(const char *argv0)
215 {
216 
217     char *p;
218     char buf[MAX_PATH];
219     DWORD len;
220 
221     len = GetModuleFileName(NULL, buf, sizeof(buf) - 1);
222     if (len == 0) {
223         return;
224     }
225 
226     buf[len] = 0;
227     p = buf + len - 1;
228     while (p != buf && *p != '\\') {
229         p--;
230     }
231     *p = 0;
232     if (access(buf, R_OK) == 0) {
233         pstrcpy(exec_dir, sizeof(exec_dir), buf);
234     }
235 }
236 
237 char *qemu_get_exec_dir(void)
238 {
239     return g_strdup(exec_dir);
240 }
241 
242 /*
243  * g_poll has a problem on Windows when using
244  * timeouts < 10ms, in glib/gpoll.c:
245  *
246  * // If not, and we have a significant timeout, poll again with
247  * // timeout then. Note that this will return indication for only
248  * // one event, or only for messages. We ignore timeouts less than
249  * // ten milliseconds as they are mostly pointless on Windows, the
250  * // MsgWaitForMultipleObjectsEx() call will timeout right away
251  * // anyway.
252  *
253  * if (retval == 0 && (timeout == INFINITE || timeout >= 10))
254  *   retval = poll_rest (poll_msgs, handles, nhandles, fds, nfds, timeout);
255  *
256  * So whenever g_poll is called with timeout < 10ms it does
257  * a quick poll instead of wait, this causes significant performance
258  * degradation of QEMU, thus we should use WaitForMultipleObjectsEx
259  * directly
260  */
261 gint g_poll_fixed(GPollFD *fds, guint nfds, gint timeout)
262 {
263     guint i;
264     HANDLE handles[MAXIMUM_WAIT_OBJECTS];
265     gint nhandles = 0;
266     int num_completed = 0;
267 
268     for (i = 0; i < nfds; i++) {
269         gint j;
270 
271         if (fds[i].fd <= 0) {
272             continue;
273         }
274 
275         /* don't add same handle several times
276          */
277         for (j = 0; j < nhandles; j++) {
278             if (handles[j] == (HANDLE)fds[i].fd) {
279                 break;
280             }
281         }
282 
283         if (j == nhandles) {
284             if (nhandles == MAXIMUM_WAIT_OBJECTS) {
285                 fprintf(stderr, "Too many handles to wait for!\n");
286                 break;
287             } else {
288                 handles[nhandles++] = (HANDLE)fds[i].fd;
289             }
290         }
291     }
292 
293     for (i = 0; i < nfds; ++i) {
294         fds[i].revents = 0;
295     }
296 
297     if (timeout == -1) {
298         timeout = INFINITE;
299     }
300 
301     if (nhandles == 0) {
302         if (timeout == INFINITE) {
303             return -1;
304         } else {
305             SleepEx(timeout, TRUE);
306             return 0;
307         }
308     }
309 
310     while (1) {
311         DWORD res;
312         gint j;
313 
314         res = WaitForMultipleObjectsEx(nhandles, handles, FALSE,
315             timeout, TRUE);
316 
317         if (res == WAIT_FAILED) {
318             for (i = 0; i < nfds; ++i) {
319                 fds[i].revents = 0;
320             }
321 
322             return -1;
323         } else if ((res == WAIT_TIMEOUT) || (res == WAIT_IO_COMPLETION) ||
324                    ((int)res < (int)WAIT_OBJECT_0) ||
325                    (res >= (WAIT_OBJECT_0 + nhandles))) {
326             break;
327         }
328 
329         for (i = 0; i < nfds; ++i) {
330             if (handles[res - WAIT_OBJECT_0] == (HANDLE)fds[i].fd) {
331                 fds[i].revents = fds[i].events;
332             }
333         }
334 
335         ++num_completed;
336 
337         if (nhandles <= 1) {
338             break;
339         }
340 
341         /* poll the rest of the handles
342          */
343         for (j = res - WAIT_OBJECT_0 + 1; j < nhandles; j++) {
344             handles[j - 1] = handles[j];
345         }
346         --nhandles;
347 
348         timeout = 0;
349     }
350 
351     return num_completed;
352 }
353