bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 1 | /* |
| 2 | * QEMU low level functions |
| 3 | * |
| 4 | * Copyright (c) 2003 Fabrice Bellard |
| 5 | * |
| 6 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
| 7 | * of this software and associated documentation files (the "Software"), to deal |
| 8 | * in the Software without restriction, including without limitation the rights |
| 9 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
| 10 | * copies of the Software, and to permit persons to whom the Software is |
| 11 | * furnished to do so, subject to the following conditions: |
| 12 | * |
| 13 | * The above copyright notice and this permission notice shall be included in |
| 14 | * all copies or substantial portions of the Software. |
| 15 | * |
| 16 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 17 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 18 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL |
| 19 | * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 20 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| 21 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
| 22 | * THE SOFTWARE. |
| 23 | */ |
| 24 | #include <stdlib.h> |
| 25 | #include <stdio.h> |
| 26 | #include <stdarg.h> |
| 27 | #include <string.h> |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 28 | #include <errno.h> |
| 29 | #include <unistd.h> |
| 30 | |
| 31 | #include "cpu.h" |
| 32 | |
| 33 | #if defined(__i386__) && !defined(CONFIG_SOFTMMU) && !defined(CONFIG_USER_ONLY) |
| 34 | |
bellard | 67b915a | 2004-03-31 23:37:16 +0000 | [diff] [blame] | 35 | #include <sys/mman.h> |
| 36 | #include <sys/ipc.h> |
| 37 | |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 38 | /* When not using soft mmu, libc independant functions are needed for |
| 39 | the CPU core because it needs to use alternates stacks and |
| 40 | libc/thread incompatibles settings */ |
| 41 | |
| 42 | #include <linux/unistd.h> |
| 43 | |
| 44 | #define QEMU_SYSCALL0(name) \ |
| 45 | { \ |
| 46 | long __res; \ |
| 47 | __asm__ volatile ("int $0x80" \ |
| 48 | : "=a" (__res) \ |
| 49 | : "0" (__NR_##name)); \ |
| 50 | return __res; \ |
| 51 | } |
| 52 | |
| 53 | #define QEMU_SYSCALL1(name,arg1) \ |
| 54 | { \ |
| 55 | long __res; \ |
| 56 | __asm__ volatile ("int $0x80" \ |
| 57 | : "=a" (__res) \ |
| 58 | : "0" (__NR_##name),"b" ((long)(arg1))); \ |
| 59 | return __res; \ |
| 60 | } |
| 61 | |
| 62 | #define QEMU_SYSCALL2(name,arg1,arg2) \ |
| 63 | { \ |
| 64 | long __res; \ |
| 65 | __asm__ volatile ("int $0x80" \ |
| 66 | : "=a" (__res) \ |
| 67 | : "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2))); \ |
| 68 | return __res; \ |
| 69 | } |
| 70 | |
| 71 | #define QEMU_SYSCALL3(name,arg1,arg2,arg3) \ |
| 72 | { \ |
| 73 | long __res; \ |
| 74 | __asm__ volatile ("int $0x80" \ |
| 75 | : "=a" (__res) \ |
| 76 | : "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \ |
| 77 | "d" ((long)(arg3))); \ |
| 78 | return __res; \ |
| 79 | } |
| 80 | |
| 81 | #define QEMU_SYSCALL4(name,arg1,arg2,arg3,arg4) \ |
| 82 | { \ |
| 83 | long __res; \ |
| 84 | __asm__ volatile ("int $0x80" \ |
| 85 | : "=a" (__res) \ |
| 86 | : "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \ |
| 87 | "d" ((long)(arg3)),"S" ((long)(arg4))); \ |
| 88 | return __res; \ |
| 89 | } |
| 90 | |
| 91 | #define QEMU_SYSCALL5(name,arg1,arg2,arg3,arg4,arg5) \ |
| 92 | { \ |
| 93 | long __res; \ |
| 94 | __asm__ volatile ("int $0x80" \ |
| 95 | : "=a" (__res) \ |
| 96 | : "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \ |
| 97 | "d" ((long)(arg3)),"S" ((long)(arg4)),"D" ((long)(arg5))); \ |
| 98 | return __res; \ |
| 99 | } |
| 100 | |
| 101 | #define QEMU_SYSCALL6(name,arg1,arg2,arg3,arg4,arg5,arg6) \ |
| 102 | { \ |
| 103 | long __res; \ |
| 104 | __asm__ volatile ("push %%ebp ; movl %%eax,%%ebp ; movl %1,%%eax ; int $0x80 ; pop %%ebp" \ |
| 105 | : "=a" (__res) \ |
| 106 | : "i" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \ |
| 107 | "d" ((long)(arg3)),"S" ((long)(arg4)),"D" ((long)(arg5)), \ |
| 108 | "0" ((long)(arg6))); \ |
| 109 | return __res; \ |
| 110 | } |
| 111 | |
| 112 | int qemu_write(int fd, const void *buf, size_t n) |
| 113 | { |
| 114 | QEMU_SYSCALL3(write, fd, buf, n); |
| 115 | } |
| 116 | |
| 117 | |
| 118 | |
| 119 | /****************************************************************/ |
| 120 | /* shmat replacement */ |
| 121 | |
| 122 | int qemu_ipc(int call, unsigned long first, |
| 123 | unsigned long second, unsigned long third, |
| 124 | void *ptr, unsigned long fifth) |
| 125 | { |
| 126 | QEMU_SYSCALL6(ipc, call, first, second, third, ptr, fifth); |
| 127 | } |
| 128 | |
| 129 | #define SHMAT 21 |
| 130 | |
| 131 | /* we must define shmat so that a specific address will be used when |
| 132 | mapping the X11 ximage */ |
| 133 | void *shmat(int shmid, const void *shmaddr, int shmflg) |
| 134 | { |
| 135 | void *ptr; |
| 136 | int ret; |
| 137 | /* we give an address in the right memory area */ |
| 138 | if (!shmaddr) |
| 139 | shmaddr = get_mmap_addr(8192 * 1024); |
| 140 | ret = qemu_ipc(SHMAT, shmid, shmflg, (unsigned long)&ptr, (void *)shmaddr, 0); |
| 141 | if (ret < 0) |
| 142 | return NULL; |
| 143 | return ptr; |
| 144 | } |
| 145 | |
| 146 | /****************************************************************/ |
bellard | d2bfb39 | 2004-08-03 22:09:30 +0000 | [diff] [blame] | 147 | /* sigaction bypassing the threads */ |
| 148 | |
| 149 | static int kernel_sigaction(int signum, const struct qemu_sigaction *act, |
| 150 | struct qemu_sigaction *oldact, |
| 151 | int sigsetsize) |
| 152 | { |
| 153 | QEMU_SYSCALL4(rt_sigaction, signum, act, oldact, sigsetsize); |
| 154 | } |
| 155 | |
| 156 | int qemu_sigaction(int signum, const struct qemu_sigaction *act, |
| 157 | struct qemu_sigaction *oldact) |
| 158 | { |
| 159 | return kernel_sigaction(signum, act, oldact, 8); |
| 160 | } |
| 161 | |
| 162 | /****************************************************************/ |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 163 | /* memory allocation */ |
| 164 | |
| 165 | //#define DEBUG_MALLOC |
| 166 | |
| 167 | #define MALLOC_BASE 0xab000000 |
| 168 | #define PHYS_RAM_BASE 0xac000000 |
| 169 | |
| 170 | #define MALLOC_ALIGN 16 |
| 171 | #define BLOCK_HEADER_SIZE 16 |
| 172 | |
| 173 | typedef struct MemoryBlock { |
| 174 | struct MemoryBlock *next; |
| 175 | unsigned long size; /* size of block, including header */ |
| 176 | } MemoryBlock; |
| 177 | |
| 178 | static MemoryBlock *first_free_block; |
| 179 | static unsigned long malloc_addr = MALLOC_BASE; |
| 180 | |
| 181 | static void *malloc_get_space(size_t size) |
| 182 | { |
| 183 | void *ptr; |
| 184 | size = TARGET_PAGE_ALIGN(size); |
| 185 | ptr = mmap((void *)malloc_addr, size, |
| 186 | PROT_WRITE | PROT_READ, |
| 187 | MAP_PRIVATE | MAP_FIXED | MAP_ANON, -1, 0); |
| 188 | if (ptr == MAP_FAILED) |
| 189 | return NULL; |
| 190 | malloc_addr += size; |
| 191 | return ptr; |
| 192 | } |
| 193 | |
| 194 | void *qemu_malloc(size_t size) |
| 195 | { |
| 196 | MemoryBlock *mb, *mb1, **pmb; |
| 197 | void *ptr; |
| 198 | size_t size1, area_size; |
| 199 | |
| 200 | if (size == 0) |
| 201 | return NULL; |
| 202 | |
| 203 | size = (size + BLOCK_HEADER_SIZE + MALLOC_ALIGN - 1) & ~(MALLOC_ALIGN - 1); |
| 204 | pmb = &first_free_block; |
| 205 | for(;;) { |
| 206 | mb = *pmb; |
| 207 | if (mb == NULL) |
| 208 | break; |
| 209 | if (size <= mb->size) |
| 210 | goto found; |
| 211 | pmb = &mb->next; |
| 212 | } |
| 213 | /* no big enough blocks found: get new space */ |
| 214 | area_size = TARGET_PAGE_ALIGN(size); |
| 215 | mb = malloc_get_space(area_size); |
| 216 | if (!mb) |
| 217 | return NULL; |
| 218 | size1 = area_size - size; |
| 219 | if (size1 > 0) { |
| 220 | /* create a new free block */ |
| 221 | mb1 = (MemoryBlock *)((uint8_t *)mb + size); |
| 222 | mb1->next = NULL; |
| 223 | mb1->size = size1; |
| 224 | *pmb = mb1; |
| 225 | } |
| 226 | goto the_end; |
| 227 | found: |
| 228 | /* a free block was found: use it */ |
| 229 | size1 = mb->size - size; |
| 230 | if (size1 > 0) { |
| 231 | /* create a new free block */ |
| 232 | mb1 = (MemoryBlock *)((uint8_t *)mb + size); |
| 233 | mb1->next = mb->next; |
| 234 | mb1->size = size1; |
| 235 | *pmb = mb1; |
| 236 | } else { |
| 237 | /* suppress the first block */ |
| 238 | *pmb = mb->next; |
| 239 | } |
| 240 | the_end: |
| 241 | mb->size = size; |
| 242 | mb->next = NULL; |
| 243 | ptr = ((uint8_t *)mb + BLOCK_HEADER_SIZE); |
| 244 | #ifdef DEBUG_MALLOC |
| 245 | qemu_printf("malloc: size=0x%x ptr=0x%lx\n", size, (unsigned long)ptr); |
| 246 | #endif |
| 247 | return ptr; |
| 248 | } |
| 249 | |
| 250 | void qemu_free(void *ptr) |
| 251 | { |
| 252 | MemoryBlock *mb; |
| 253 | |
bellard | 57c3072 | 2004-04-04 20:36:29 +0000 | [diff] [blame] | 254 | if (!ptr) |
| 255 | return; |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 256 | mb = (MemoryBlock *)((uint8_t *)ptr - BLOCK_HEADER_SIZE); |
| 257 | mb->next = first_free_block; |
| 258 | first_free_block = mb; |
| 259 | } |
| 260 | |
| 261 | /****************************************************************/ |
| 262 | /* virtual memory allocation */ |
| 263 | |
| 264 | unsigned long mmap_addr = PHYS_RAM_BASE; |
| 265 | |
| 266 | void *get_mmap_addr(unsigned long size) |
| 267 | { |
| 268 | unsigned long addr; |
| 269 | addr = mmap_addr; |
| 270 | mmap_addr += ((size + 4095) & ~4095) + 4096; |
| 271 | return (void *)addr; |
| 272 | } |
| 273 | |
| 274 | #else |
| 275 | |
bellard | 6e4255f | 2005-04-17 18:33:47 +0000 | [diff] [blame^] | 276 | #ifdef _WIN32 |
| 277 | #include <windows.h> |
| 278 | #elif defined(_BSD) |
bellard | 194884d | 2005-02-21 20:10:36 +0000 | [diff] [blame] | 279 | #include <stdlib.h> |
| 280 | #else |
bellard | 49b470e | 2005-02-10 21:59:25 +0000 | [diff] [blame] | 281 | #include <malloc.h> |
bellard | 194884d | 2005-02-21 20:10:36 +0000 | [diff] [blame] | 282 | #endif |
bellard | 49b470e | 2005-02-10 21:59:25 +0000 | [diff] [blame] | 283 | |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 284 | int qemu_write(int fd, const void *buf, size_t n) |
| 285 | { |
| 286 | int ret; |
| 287 | ret = write(fd, buf, n); |
| 288 | if (ret < 0) |
| 289 | return -errno; |
| 290 | else |
| 291 | return ret; |
| 292 | } |
| 293 | |
| 294 | void *get_mmap_addr(unsigned long size) |
| 295 | { |
| 296 | return NULL; |
| 297 | } |
| 298 | |
| 299 | void qemu_free(void *ptr) |
| 300 | { |
| 301 | free(ptr); |
| 302 | } |
| 303 | |
| 304 | void *qemu_malloc(size_t size) |
| 305 | { |
| 306 | return malloc(size); |
| 307 | } |
| 308 | |
bellard | 6e4255f | 2005-04-17 18:33:47 +0000 | [diff] [blame^] | 309 | #if defined(_WIN32) |
| 310 | |
| 311 | void *qemu_vmalloc(size_t size) |
| 312 | { |
| 313 | /* FIXME: this is not exactly optimal solution since VirtualAlloc |
| 314 | has 64Kb granularity, but at least it guarantees us that the |
| 315 | memory is page aligned. */ |
| 316 | return VirtualAlloc(NULL, size, MEM_COMMIT, PAGE_READWRITE); |
| 317 | } |
| 318 | |
| 319 | void qemu_vfree(void *ptr) |
| 320 | { |
| 321 | VirtualFree(ptr, 0, MEM_RELEASE); |
| 322 | } |
| 323 | |
| 324 | #elif defined(USE_KQEMU) |
bellard | 49b470e | 2005-02-10 21:59:25 +0000 | [diff] [blame] | 325 | |
| 326 | #include <sys/mman.h> |
| 327 | #include <fcntl.h> |
| 328 | |
| 329 | void *qemu_vmalloc(size_t size) |
| 330 | { |
| 331 | static int phys_ram_fd = -1; |
| 332 | static int phys_ram_size = 0; |
| 333 | const char *tmpdir; |
| 334 | char phys_ram_file[1024]; |
| 335 | void *ptr; |
| 336 | |
| 337 | if (phys_ram_fd < 0) { |
| 338 | tmpdir = getenv("QEMU_TMPDIR"); |
| 339 | if (!tmpdir) |
| 340 | tmpdir = "/dev/shm"; |
| 341 | snprintf(phys_ram_file, sizeof(phys_ram_file), "%s/qemuXXXXXX", |
| 342 | tmpdir); |
| 343 | if (mkstemp(phys_ram_file) < 0) { |
| 344 | fprintf(stderr, |
| 345 | "warning: could not create temporary file in '%s'.\n" |
| 346 | "Use QEMU_TMPDIR to select a directory in a tmpfs filesystem.\n" |
| 347 | "Using '/tmp' as fallback.\n", |
| 348 | tmpdir); |
| 349 | snprintf(phys_ram_file, sizeof(phys_ram_file), "%s/qemuXXXXXX", |
| 350 | "/tmp"); |
| 351 | if (mkstemp(phys_ram_file) < 0) { |
| 352 | fprintf(stderr, "Could not create temporary memory file '%s'\n", |
| 353 | phys_ram_file); |
| 354 | exit(1); |
| 355 | } |
| 356 | } |
| 357 | phys_ram_fd = open(phys_ram_file, O_CREAT | O_TRUNC | O_RDWR, 0600); |
| 358 | if (phys_ram_fd < 0) { |
| 359 | fprintf(stderr, "Could not open temporary memory file '%s'\n", |
| 360 | phys_ram_file); |
| 361 | exit(1); |
| 362 | } |
| 363 | unlink(phys_ram_file); |
| 364 | } |
| 365 | size = (size + 4095) & ~4095; |
| 366 | ftruncate(phys_ram_fd, phys_ram_size + size); |
| 367 | ptr = mmap(NULL, |
| 368 | size, |
| 369 | PROT_WRITE | PROT_READ, MAP_SHARED, |
| 370 | phys_ram_fd, phys_ram_size); |
| 371 | if (ptr == MAP_FAILED) { |
| 372 | fprintf(stderr, "Could not map physical memory\n"); |
| 373 | exit(1); |
| 374 | } |
| 375 | phys_ram_size += size; |
| 376 | return ptr; |
| 377 | } |
| 378 | |
| 379 | void qemu_vfree(void *ptr) |
| 380 | { |
| 381 | /* may be useful some day, but currently we do not need to free */ |
| 382 | } |
| 383 | |
| 384 | #else |
| 385 | |
| 386 | /* alloc shared memory pages */ |
| 387 | void *qemu_vmalloc(size_t size) |
| 388 | { |
| 389 | #ifdef _BSD |
| 390 | return valloc(size); |
| 391 | #else |
| 392 | return memalign(4096, size); |
| 393 | #endif |
| 394 | } |
| 395 | |
| 396 | void qemu_vfree(void *ptr) |
| 397 | { |
| 398 | free(ptr); |
| 399 | } |
| 400 | |
| 401 | #endif |
| 402 | |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 403 | #endif |
| 404 | |
bellard | 07d8986 | 2004-03-14 21:41:12 +0000 | [diff] [blame] | 405 | void *qemu_mallocz(size_t size) |
| 406 | { |
| 407 | void *ptr; |
| 408 | ptr = qemu_malloc(size); |
| 409 | if (!ptr) |
| 410 | return NULL; |
| 411 | memset(ptr, 0, size); |
| 412 | return ptr; |
| 413 | } |
| 414 | |
bellard | 2571929 | 2004-07-14 17:21:57 +0000 | [diff] [blame] | 415 | char *qemu_strdup(const char *str) |
| 416 | { |
| 417 | char *ptr; |
| 418 | ptr = qemu_malloc(strlen(str) + 1); |
| 419 | if (!ptr) |
| 420 | return NULL; |
| 421 | strcpy(ptr, str); |
| 422 | return ptr; |
| 423 | } |
| 424 | |
bellard | ea88812 | 2004-02-16 22:12:40 +0000 | [diff] [blame] | 425 | /****************************************************************/ |
| 426 | /* printf support */ |
| 427 | |
| 428 | static inline int qemu_isdigit(int c) |
| 429 | { |
| 430 | return c >= '0' && c <= '9'; |
| 431 | } |
| 432 | |
| 433 | #define OUTCHAR(c) (buflen > 0? (--buflen, *buf++ = (c)): 0) |
| 434 | |
| 435 | /* from BSD ppp sources */ |
| 436 | int qemu_vsnprintf(char *buf, int buflen, const char *fmt, va_list args) |
| 437 | { |
| 438 | int c, i, n; |
| 439 | int width, prec, fillch; |
| 440 | int base, len, neg; |
| 441 | unsigned long val = 0; |
| 442 | const char *f; |
| 443 | char *str, *buf0; |
| 444 | char num[32]; |
| 445 | static const char hexchars[] = "0123456789abcdef"; |
| 446 | |
| 447 | buf0 = buf; |
| 448 | --buflen; |
| 449 | while (buflen > 0) { |
| 450 | for (f = fmt; *f != '%' && *f != 0; ++f) |
| 451 | ; |
| 452 | if (f > fmt) { |
| 453 | len = f - fmt; |
| 454 | if (len > buflen) |
| 455 | len = buflen; |
| 456 | memcpy(buf, fmt, len); |
| 457 | buf += len; |
| 458 | buflen -= len; |
| 459 | fmt = f; |
| 460 | } |
| 461 | if (*fmt == 0) |
| 462 | break; |
| 463 | c = *++fmt; |
| 464 | width = prec = 0; |
| 465 | fillch = ' '; |
| 466 | if (c == '0') { |
| 467 | fillch = '0'; |
| 468 | c = *++fmt; |
| 469 | } |
| 470 | if (c == '*') { |
| 471 | width = va_arg(args, int); |
| 472 | c = *++fmt; |
| 473 | } else { |
| 474 | while (qemu_isdigit(c)) { |
| 475 | width = width * 10 + c - '0'; |
| 476 | c = *++fmt; |
| 477 | } |
| 478 | } |
| 479 | if (c == '.') { |
| 480 | c = *++fmt; |
| 481 | if (c == '*') { |
| 482 | prec = va_arg(args, int); |
| 483 | c = *++fmt; |
| 484 | } else { |
| 485 | while (qemu_isdigit(c)) { |
| 486 | prec = prec * 10 + c - '0'; |
| 487 | c = *++fmt; |
| 488 | } |
| 489 | } |
| 490 | } |
| 491 | /* modifiers */ |
| 492 | switch(c) { |
| 493 | case 'l': |
| 494 | c = *++fmt; |
| 495 | break; |
| 496 | default: |
| 497 | break; |
| 498 | } |
| 499 | str = 0; |
| 500 | base = 0; |
| 501 | neg = 0; |
| 502 | ++fmt; |
| 503 | switch (c) { |
| 504 | case 'd': |
| 505 | i = va_arg(args, int); |
| 506 | if (i < 0) { |
| 507 | neg = 1; |
| 508 | val = -i; |
| 509 | } else |
| 510 | val = i; |
| 511 | base = 10; |
| 512 | break; |
| 513 | case 'o': |
| 514 | val = va_arg(args, unsigned int); |
| 515 | base = 8; |
| 516 | break; |
| 517 | case 'x': |
| 518 | case 'X': |
| 519 | val = va_arg(args, unsigned int); |
| 520 | base = 16; |
| 521 | break; |
| 522 | case 'p': |
| 523 | val = (unsigned long) va_arg(args, void *); |
| 524 | base = 16; |
| 525 | neg = 2; |
| 526 | break; |
| 527 | case 's': |
| 528 | str = va_arg(args, char *); |
| 529 | break; |
| 530 | case 'c': |
| 531 | num[0] = va_arg(args, int); |
| 532 | num[1] = 0; |
| 533 | str = num; |
| 534 | break; |
| 535 | default: |
| 536 | *buf++ = '%'; |
| 537 | if (c != '%') |
| 538 | --fmt; /* so %z outputs %z etc. */ |
| 539 | --buflen; |
| 540 | continue; |
| 541 | } |
| 542 | if (base != 0) { |
| 543 | str = num + sizeof(num); |
| 544 | *--str = 0; |
| 545 | while (str > num + neg) { |
| 546 | *--str = hexchars[val % base]; |
| 547 | val = val / base; |
| 548 | if (--prec <= 0 && val == 0) |
| 549 | break; |
| 550 | } |
| 551 | switch (neg) { |
| 552 | case 1: |
| 553 | *--str = '-'; |
| 554 | break; |
| 555 | case 2: |
| 556 | *--str = 'x'; |
| 557 | *--str = '0'; |
| 558 | break; |
| 559 | } |
| 560 | len = num + sizeof(num) - 1 - str; |
| 561 | } else { |
| 562 | len = strlen(str); |
| 563 | if (prec > 0 && len > prec) |
| 564 | len = prec; |
| 565 | } |
| 566 | if (width > 0) { |
| 567 | if (width > buflen) |
| 568 | width = buflen; |
| 569 | if ((n = width - len) > 0) { |
| 570 | buflen -= n; |
| 571 | for (; n > 0; --n) |
| 572 | *buf++ = fillch; |
| 573 | } |
| 574 | } |
| 575 | if (len > buflen) |
| 576 | len = buflen; |
| 577 | memcpy(buf, str, len); |
| 578 | buf += len; |
| 579 | buflen -= len; |
| 580 | } |
| 581 | *buf = 0; |
| 582 | return buf - buf0; |
| 583 | } |
| 584 | |
| 585 | void qemu_vprintf(const char *fmt, va_list ap) |
| 586 | { |
| 587 | char buf[1024]; |
| 588 | int len; |
| 589 | |
| 590 | len = qemu_vsnprintf(buf, sizeof(buf), fmt, ap); |
| 591 | qemu_write(1, buf, len); |
| 592 | } |
| 593 | |
| 594 | void qemu_printf(const char *fmt, ...) |
| 595 | { |
| 596 | va_list ap; |
| 597 | va_start(ap, fmt); |
| 598 | qemu_vprintf(fmt, ap); |
| 599 | va_end(ap); |
| 600 | } |
| 601 | |