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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
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
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
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
|
/*
* QEMU low level functions
*
* Copyright (c) 2003 Fabrice Bellard
*
* 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 <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include "cpu.h"
#if defined(__i386__) && !defined(CONFIG_SOFTMMU) && !defined(CONFIG_USER_ONLY)
#include <sys/mman.h>
#include <sys/ipc.h>
/* When not using soft mmu, libc independant functions are needed for
the CPU core because it needs to use alternates stacks and
libc/thread incompatibles settings */
#include <linux/unistd.h>
#define QEMU_SYSCALL0(name) \
{ \
long __res; \
__asm__ volatile ("int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name)); \
return __res; \
}
#define QEMU_SYSCALL1(name,arg1) \
{ \
long __res; \
__asm__ volatile ("int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name),"b" ((long)(arg1))); \
return __res; \
}
#define QEMU_SYSCALL2(name,arg1,arg2) \
{ \
long __res; \
__asm__ volatile ("int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2))); \
return __res; \
}
#define QEMU_SYSCALL3(name,arg1,arg2,arg3) \
{ \
long __res; \
__asm__ volatile ("int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \
"d" ((long)(arg3))); \
return __res; \
}
#define QEMU_SYSCALL4(name,arg1,arg2,arg3,arg4) \
{ \
long __res; \
__asm__ volatile ("int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \
"d" ((long)(arg3)),"S" ((long)(arg4))); \
return __res; \
}
#define QEMU_SYSCALL5(name,arg1,arg2,arg3,arg4,arg5) \
{ \
long __res; \
__asm__ volatile ("int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \
"d" ((long)(arg3)),"S" ((long)(arg4)),"D" ((long)(arg5))); \
return __res; \
}
#define QEMU_SYSCALL6(name,arg1,arg2,arg3,arg4,arg5,arg6) \
{ \
long __res; \
__asm__ volatile ("push %%ebp ; movl %%eax,%%ebp ; movl %1,%%eax ; int $0x80 ; pop %%ebp" \
: "=a" (__res) \
: "i" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \
"d" ((long)(arg3)),"S" ((long)(arg4)),"D" ((long)(arg5)), \
"0" ((long)(arg6))); \
return __res; \
}
int qemu_write(int fd, const void *buf, size_t n)
{
QEMU_SYSCALL3(write, fd, buf, n);
}
/****************************************************************/
/* shmat replacement */
int qemu_ipc(int call, unsigned long first,
unsigned long second, unsigned long third,
void *ptr, unsigned long fifth)
{
QEMU_SYSCALL6(ipc, call, first, second, third, ptr, fifth);
}
#define SHMAT 21
/* we must define shmat so that a specific address will be used when
mapping the X11 ximage */
void *shmat(int shmid, const void *shmaddr, int shmflg)
{
void *ptr;
int ret;
/* we give an address in the right memory area */
if (!shmaddr)
shmaddr = get_mmap_addr(8192 * 1024);
ret = qemu_ipc(SHMAT, shmid, shmflg, (unsigned long)&ptr, (void *)shmaddr, 0);
if (ret < 0)
return NULL;
return ptr;
}
/****************************************************************/
/* sigaction bypassing the threads */
static int kernel_sigaction(int signum, const struct qemu_sigaction *act,
struct qemu_sigaction *oldact,
int sigsetsize)
{
QEMU_SYSCALL4(rt_sigaction, signum, act, oldact, sigsetsize);
}
int qemu_sigaction(int signum, const struct qemu_sigaction *act,
struct qemu_sigaction *oldact)
{
return kernel_sigaction(signum, act, oldact, 8);
}
/****************************************************************/
/* memory allocation */
//#define DEBUG_MALLOC
#define MALLOC_BASE 0xab000000
#define PHYS_RAM_BASE 0xac000000
#define MALLOC_ALIGN 16
#define BLOCK_HEADER_SIZE 16
typedef struct MemoryBlock {
struct MemoryBlock *next;
unsigned long size; /* size of block, including header */
} MemoryBlock;
static MemoryBlock *first_free_block;
static unsigned long malloc_addr = MALLOC_BASE;
static void *malloc_get_space(size_t size)
{
void *ptr;
size = TARGET_PAGE_ALIGN(size);
ptr = mmap((void *)malloc_addr, size,
PROT_WRITE | PROT_READ,
MAP_PRIVATE | MAP_FIXED | MAP_ANON, -1, 0);
if (ptr == MAP_FAILED)
return NULL;
malloc_addr += size;
return ptr;
}
void *qemu_malloc(size_t size)
{
MemoryBlock *mb, *mb1, **pmb;
void *ptr;
size_t size1, area_size;
if (size == 0)
return NULL;
size = (size + BLOCK_HEADER_SIZE + MALLOC_ALIGN - 1) & ~(MALLOC_ALIGN - 1);
pmb = &first_free_block;
for(;;) {
mb = *pmb;
if (mb == NULL)
break;
if (size <= mb->size)
goto found;
pmb = &mb->next;
}
/* no big enough blocks found: get new space */
area_size = TARGET_PAGE_ALIGN(size);
mb = malloc_get_space(area_size);
if (!mb)
return NULL;
size1 = area_size - size;
if (size1 > 0) {
/* create a new free block */
mb1 = (MemoryBlock *)((uint8_t *)mb + size);
mb1->next = NULL;
mb1->size = size1;
*pmb = mb1;
}
goto the_end;
found:
/* a free block was found: use it */
size1 = mb->size - size;
if (size1 > 0) {
/* create a new free block */
mb1 = (MemoryBlock *)((uint8_t *)mb + size);
mb1->next = mb->next;
mb1->size = size1;
*pmb = mb1;
} else {
/* suppress the first block */
*pmb = mb->next;
}
the_end:
mb->size = size;
mb->next = NULL;
ptr = ((uint8_t *)mb + BLOCK_HEADER_SIZE);
#ifdef DEBUG_MALLOC
qemu_printf("malloc: size=0x%x ptr=0x%lx\n", size, (unsigned long)ptr);
#endif
return ptr;
}
void qemu_free(void *ptr)
{
MemoryBlock *mb;
if (!ptr)
return;
mb = (MemoryBlock *)((uint8_t *)ptr - BLOCK_HEADER_SIZE);
mb->next = first_free_block;
first_free_block = mb;
}
/****************************************************************/
/* virtual memory allocation */
unsigned long mmap_addr = PHYS_RAM_BASE;
void *get_mmap_addr(unsigned long size)
{
unsigned long addr;
addr = mmap_addr;
mmap_addr += ((size + 4095) & ~4095) + 4096;
return (void *)addr;
}
#else
int qemu_write(int fd, const void *buf, size_t n)
{
int ret;
ret = write(fd, buf, n);
if (ret < 0)
return -errno;
else
return ret;
}
void *get_mmap_addr(unsigned long size)
{
return NULL;
}
void qemu_free(void *ptr)
{
free(ptr);
}
void *qemu_malloc(size_t size)
{
return malloc(size);
}
#endif
void *qemu_mallocz(size_t size)
{
void *ptr;
ptr = qemu_malloc(size);
if (!ptr)
return NULL;
memset(ptr, 0, size);
return ptr;
}
char *qemu_strdup(const char *str)
{
char *ptr;
ptr = qemu_malloc(strlen(str) + 1);
if (!ptr)
return NULL;
strcpy(ptr, str);
return ptr;
}
/****************************************************************/
/* printf support */
static inline int qemu_isdigit(int c)
{
return c >= '0' && c <= '9';
}
#define OUTCHAR(c) (buflen > 0? (--buflen, *buf++ = (c)): 0)
/* from BSD ppp sources */
int qemu_vsnprintf(char *buf, int buflen, const char *fmt, va_list args)
{
int c, i, n;
int width, prec, fillch;
int base, len, neg;
unsigned long val = 0;
const char *f;
char *str, *buf0;
char num[32];
static const char hexchars[] = "0123456789abcdef";
buf0 = buf;
--buflen;
while (buflen > 0) {
for (f = fmt; *f != '%' && *f != 0; ++f)
;
if (f > fmt) {
len = f - fmt;
if (len > buflen)
len = buflen;
memcpy(buf, fmt, len);
buf += len;
buflen -= len;
fmt = f;
}
if (*fmt == 0)
break;
c = *++fmt;
width = prec = 0;
fillch = ' ';
if (c == '0') {
fillch = '0';
c = *++fmt;
}
if (c == '*') {
width = va_arg(args, int);
c = *++fmt;
} else {
while (qemu_isdigit(c)) {
width = width * 10 + c - '0';
c = *++fmt;
}
}
if (c == '.') {
c = *++fmt;
if (c == '*') {
prec = va_arg(args, int);
c = *++fmt;
} else {
while (qemu_isdigit(c)) {
prec = prec * 10 + c - '0';
c = *++fmt;
}
}
}
/* modifiers */
switch(c) {
case 'l':
c = *++fmt;
break;
default:
break;
}
str = 0;
base = 0;
neg = 0;
++fmt;
switch (c) {
case 'd':
i = va_arg(args, int);
if (i < 0) {
neg = 1;
val = -i;
} else
val = i;
base = 10;
break;
case 'o':
val = va_arg(args, unsigned int);
base = 8;
break;
case 'x':
case 'X':
val = va_arg(args, unsigned int);
base = 16;
break;
case 'p':
val = (unsigned long) va_arg(args, void *);
base = 16;
neg = 2;
break;
case 's':
str = va_arg(args, char *);
break;
case 'c':
num[0] = va_arg(args, int);
num[1] = 0;
str = num;
break;
default:
*buf++ = '%';
if (c != '%')
--fmt; /* so %z outputs %z etc. */
--buflen;
continue;
}
if (base != 0) {
str = num + sizeof(num);
*--str = 0;
while (str > num + neg) {
*--str = hexchars[val % base];
val = val / base;
if (--prec <= 0 && val == 0)
break;
}
switch (neg) {
case 1:
*--str = '-';
break;
case 2:
*--str = 'x';
*--str = '0';
break;
}
len = num + sizeof(num) - 1 - str;
} else {
len = strlen(str);
if (prec > 0 && len > prec)
len = prec;
}
if (width > 0) {
if (width > buflen)
width = buflen;
if ((n = width - len) > 0) {
buflen -= n;
for (; n > 0; --n)
*buf++ = fillch;
}
}
if (len > buflen)
len = buflen;
memcpy(buf, str, len);
buf += len;
buflen -= len;
}
*buf = 0;
return buf - buf0;
}
void qemu_vprintf(const char *fmt, va_list ap)
{
char buf[1024];
int len;
len = qemu_vsnprintf(buf, sizeof(buf), fmt, ap);
qemu_write(1, buf, len);
}
void qemu_printf(const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
qemu_vprintf(fmt, ap);
va_end(ap);
}
|