-
Notifications
You must be signed in to change notification settings - Fork 0
/
asm_x86lib.c
240 lines (215 loc) · 4.74 KB
/
asm_x86lib.c
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
#include <assert.h>
#include <stdio.h>
#include <stdint.h>
#include <math.h>
#include <stdlib.h>
#include <inttypes.h>
FILE *rfp, *wfp;
extern uint64_t limm_count[1];
extern uint64_t exec_count[1];
extern uint64_t generic_count[1];
extern uint32_t regs[256];
extern uint32_t *mem_offset[1];
#define MEM_SIZE (1024*1024)
typedef union {
uint32_t i;
float f;
} Float;
uint32_t generic(uint32_t comm, uint32_t a1, uint32_t a2, uint32_t a3) {
switch(comm) {
case 0:
printf("generic cmd test (a1:%d, a2:%d, a3:%d)\n", a1, a2, a3);
return 123;
break;
case 901:
// int_of_float
{
Float f1;
f1.i = a2;
if ((int)f1.f != (int)a1) {
printf("assertion failed! a1:%d a2:%x f:%d\n", a1, a2, (int)f1.f);
assert(0);
}
}
break;
case 902:
// float_of_int
{
Float f1;
f1.f = (float)((double)((int)a2));
if (f1.i != a1 && f1.i - 1 != a1 && f1.i + 1 != a1) {
printf("assertion failed! a1:%x a2:%d f:%x\n", a1, a2, f1.i);
assert(0);
}
}
break;
default:
printf("undefined generic cmd called.\n");
}
return 0;
}
uint32_t *check(uint32_t *a, uint32_t b) {
if (a >= mem_offset[0] && a < mem_offset[0] + MEM_SIZE) {
return a;
}
printf("memcheck failed! tried to access %x at inst_%03X, but mem range is from %x to %x.", (uint32_t)a, b, (uint32_t)mem_offset[0], (uint32_t)(mem_offset[0] + MEM_SIZE));
fflush(stdout);
// 無理やりセグフォさせる
return 0;
}
uint32_t in() {
return getc(rfp);
}
void out(uint32_t a) {
putc(a&0xff,wfp);
fflush(wfp);
}
uint32_t cmpc(int32_t a, int32_t b, uint32_t c) {
if (a > b) {
return c & 4 ? 1 : 0;
} else if (a == b) {
return c & 2 ? 1 : 0;
}
return c & 1 ? 1 : 0;
}
void debug(int a) {
static int i = 0;
printf("%d eax: %d(0x%x)\n",i, a, a);
fflush(stdout);
i++;
}
void show(int a) {
static int i = 0;
printf("%d reg: %d(0x%x)\n",i, a, a);
fflush(stdout);
i++;
}
void showexec() {
static int i = 0;
printf("%d cur exec: %"PRIu64"\n",i, exec_count[0]);
fflush(stdout);
i++;
}
void trace(int a) {
printf("eip: 0x%x\n", a);
fflush(stdout);
}
#define FIFOMAX 1000000
typedef struct {
int i;
uint64_t buf[FIFOMAX];
} Fifo;
Fifo exec_fifo;
uint64_t section_exec = 0;
void setcurexec() {
if (exec_fifo.i >= FIFOMAX) {
printf("exec fifo overflowed\n");
exit(-1);
}
exec_fifo.buf[exec_fifo.i] = exec_count[0];
exec_fifo.i++;
}
void getexecdiff() {
static int i = 0;
exec_fifo.i--;
if (exec_fifo.i < 0) {
printf("exec fifo underflowed\n");
exit(-1);
}
uint64_t cnt = exec_count[0] - exec_fifo.buf[exec_fifo.i];
section_exec += cnt;
printf("%d exec cnts: %"PRIu64"\n",i, cnt);
i++;
}
uint32_t fadd(uint32_t a, uint32_t b) {
Float ra, rb, rt;
ra.i = a;
rb.i = b;
rt.f = ra.f + rb.f;
return rt.i;
}
uint32_t fsub(uint32_t a, uint32_t b) {
Float ra, rb, rt;
ra.i = a;
rb.i = b;
rt.f = ra.f - rb.f;
return rt.i;
}
uint32_t fmul(uint32_t a, uint32_t b) {
Float ra, rb, rt;
ra.i = a;
rb.i = b;
rt.f = ra.f * rb.f;
return rt.i;
}
uint32_t finv(uint32_t a, uint32_t b) {
Float ra, rt;
ra.i = a;
rt.f = 1.0 / ra.f;
return rt.i;
}
uint32_t faba(uint32_t a, uint32_t b) {
Float ra, rb, rt;
ra.i = a;
rb.i = b;
if (a == 0) {
rt.f = fabsf(rb.f);
} else if (b == 0) {
rt.f = fabsf(ra.f);
} else {
rt.f = fabsf(ra.f + rb.f);
}
return rt.i;
}
uint32_t fam(uint32_t a, uint32_t b, uint32_t c) {
Float ra, rb, rc, rt;
ra.i = a;
rb.i = b;
rc.i = c;
rt.f = ra.f * rb.f + rc.f;
return rt.i;
}
uint32_t fsqrt(uint32_t a) {
Float ra, rt;
ra.i = a;
rt.f = sqrtf(ra.f);
return rt.i;
}
int fcmpc(uint32_t a, uint32_t b, uint32_t c) {
Float ra, rb;
ra.i = a;
rb.i = b;
if (ra.f > rb.f) {
return c & 4 ? 1 : 0;
} else if (ra.f == rb.f) {
return c & 2 ? 1 : 0;
}
return c & 1 ? 1 : 0;
}
void min_caml_entry();
int main() {
int i;
if ((rfp = fopen("stdin", "r")) == NULL) {
fprintf(stderr, "%sのオープンに失敗しました。\n", "stdin");
return EXIT_FAILURE;
}
if ((wfp = fopen("stdout", "w")) == NULL) {
fprintf(stderr, "%sのオープンに失敗しました。\n", "stdout");
return EXIT_FAILURE;
}
exec_fifo.i = 0;
// メモリ空間(SRAM)は4MB
mem_offset[0] = malloc(sizeof(uint32_t)*MEM_SIZE);
printf("registers : 0x%x\n", (uint32_t)regs);
printf("memory space : 0x%x\n", (uint32_t)(mem_offset[0]));
fflush(stdout);
for (i = 0; i < 255; i++) {
regs[i] = 0;
}
min_caml_entry();
printf("limm_count:%f\n",limm_count[0]/100000000.0);
printf("generic_count:%"PRIu64"\n",generic_count[0]);
printf("section_exec_count:%f\n",section_exec/100000000.0);
printf("exec_count:%f\n",exec_count[0]/100000000.0);
return 0;
}