-
Notifications
You must be signed in to change notification settings - Fork 172
/
encode.cpp
370 lines (304 loc) · 8.96 KB
/
encode.cpp
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
/* Copyright (c) 2008-2012, Avian Contributors
Permission to use, copy, modify, and/or distribute this software
for any purpose with or without fee is hereby granted, provided
that the above copyright notice and this permission notice appear
in all copies.
There is NO WARRANTY for this software. See license.txt for
details. */
#include "avian/target.h"
#include "avian/alloc-vector.h"
#include <avian/util/abort.h>
#include <avian/util/math.h>
#include <avian/vm/codegen/assembler.h>
#include <avian/vm/codegen/promise.h>
#include "context.h"
#include "encode.h"
#include "registers.h"
#include "fixup.h"
using namespace avian::util;
namespace avian {
namespace codegen {
namespace x86 {
#define REX_W 0x48
#define REX_R 0x44
#define REX_X 0x42
#define REX_B 0x41
#define REX_NONE 0x40
void maybeRex(Context* c, unsigned size, int a, int index, int base, bool always) {
if (vm::TargetBytesPerWord == 8) {
uint8_t byte;
if (size == 8) {
byte = REX_W;
} else {
byte = REX_NONE;
}
if (a != lir::NoRegister and (a & 8)) byte |= REX_R;
if (index != lir::NoRegister and (index & 8)) byte |= REX_X;
if (base != lir::NoRegister and (base & 8)) byte |= REX_B;
if (always or byte != REX_NONE) c->code.append(byte);
}
}
void maybeRex(Context* c, unsigned size, lir::Register* a, lir::Register* b) {
maybeRex(c, size, a->low, lir::NoRegister, b->low, false);
}
void alwaysRex(Context* c, unsigned size, lir::Register* a, lir::Register* b) {
maybeRex(c, size, a->low, lir::NoRegister, b->low, true);
}
void maybeRex(Context* c, unsigned size, lir::Register* a) {
maybeRex(c, size, lir::NoRegister, lir::NoRegister, a->low, false);
}
void maybeRex(Context* c, unsigned size, lir::Register* a, lir::Memory* b) {
maybeRex(c, size, a->low, b->index, b->base, size == 1 and (a->low & 4));
}
void maybeRex(Context* c, unsigned size, lir::Memory* a) {
maybeRex(c, size, lir::NoRegister, a->index, a->base, false);
}
void modrm(Context* c, uint8_t mod, int a, int b) {
c->code.append(mod | (regCode(b) << 3) | regCode(a));
}
void modrm(Context* c, uint8_t mod, lir::Register* a, lir::Register* b) {
modrm(c, mod, a->low, b->low);
}
void sib(Context* c, unsigned scale, int index, int base) {
c->code.append((util::log(scale) << 6) | (regCode(index) << 3) | regCode(base));
}
void modrmSib(Context* c, int width, int a, int scale, int index, int base) {
if (index == lir::NoRegister) {
modrm(c, width, base, a);
if (regCode(base) == rsp) {
sib(c, 0x00, rsp, rsp);
}
} else {
modrm(c, width, rsp, a);
sib(c, scale, index, base);
}
}
void modrmSibImm(Context* c, int a, int scale, int index, int base, int offset) {
if (offset == 0 and regCode(base) != rbp) {
modrmSib(c, 0x00, a, scale, index, base);
} else if (vm::fitsInInt8(offset)) {
modrmSib(c, 0x40, a, scale, index, base);
c->code.append(offset);
} else {
modrmSib(c, 0x80, a, scale, index, base);
c->code.append4(offset);
}
}
void modrmSibImm(Context* c, lir::Register* a, lir::Memory* b) {
modrmSibImm(c, a->low, b->scale, b->index, b->base, b->offset);
}
void opcode(Context* c, uint8_t op) {
c->code.append(op);
}
void opcode(Context* c, uint8_t op1, uint8_t op2) {
c->code.append(op1);
c->code.append(op2);
}
void unconditional(Context* c, unsigned jump, lir::Constant* a) {
appendOffsetTask(c, a->value, offsetPromise(c), 5);
opcode(c, jump);
c->code.append4(0);
}
void conditional(Context* c, unsigned condition, lir::Constant* a) {
appendOffsetTask(c, a->value, offsetPromise(c), 6);
opcode(c, 0x0f, condition);
c->code.append4(0);
}
void sseMoveRR(Context* c, unsigned aSize, lir::Register* a,
unsigned bSize UNUSED, lir::Register* b)
{
assert(c, aSize >= 4);
assert(c, aSize == bSize);
if (isFloatReg(a) and isFloatReg(b)) {
if (aSize == 4) {
opcode(c, 0xf3);
maybeRex(c, 4, a, b);
opcode(c, 0x0f, 0x10);
modrm(c, 0xc0, a, b);
} else {
opcode(c, 0xf2);
maybeRex(c, 4, b, a);
opcode(c, 0x0f, 0x10);
modrm(c, 0xc0, a, b);
}
} else if (isFloatReg(a)) {
opcode(c, 0x66);
maybeRex(c, aSize, a, b);
opcode(c, 0x0f, 0x7e);
modrm(c, 0xc0, b, a);
} else {
opcode(c, 0x66);
maybeRex(c, aSize, b, a);
opcode(c, 0x0f, 0x6e);
modrm(c, 0xc0, a, b);
}
}
void sseMoveCR(Context* c, unsigned aSize, lir::Constant* a,
unsigned bSize, lir::Register* b)
{
assert(c, aSize <= vm::TargetBytesPerWord);
lir::Register tmp(c->client->acquireTemporary(GeneralRegisterMask));
moveCR2(c, aSize, a, aSize, &tmp, 0);
sseMoveRR(c, aSize, &tmp, bSize, b);
c->client->releaseTemporary(tmp.low);
}
void sseMoveMR(Context* c, unsigned aSize, lir::Memory* a,
unsigned bSize UNUSED, lir::Register* b)
{
assert(c, aSize >= 4);
if (vm::TargetBytesPerWord == 4 and aSize == 8) {
opcode(c, 0xf3);
opcode(c, 0x0f, 0x7e);
modrmSibImm(c, b, a);
} else {
opcode(c, 0x66);
maybeRex(c, aSize, b, a);
opcode(c, 0x0f, 0x6e);
modrmSibImm(c, b, a);
}
}
void sseMoveRM(Context* c, unsigned aSize, lir::Register* a,
UNUSED unsigned bSize, lir::Memory* b)
{
assert(c, aSize >= 4);
assert(c, aSize == bSize);
if (vm::TargetBytesPerWord == 4 and aSize == 8) {
opcode(c, 0x66);
opcode(c, 0x0f, 0xd6);
modrmSibImm(c, a, b);
} else {
opcode(c, 0x66);
maybeRex(c, aSize, a, b);
opcode(c, 0x0f, 0x7e);
modrmSibImm(c, a, b);
}
}
void branch(Context* c, lir::TernaryOperation op, lir::Constant* target) {
switch (op) {
case lir::JumpIfEqual:
conditional(c, 0x84, target);
break;
case lir::JumpIfNotEqual:
conditional(c, 0x85, target);
break;
case lir::JumpIfLess:
conditional(c, 0x8c, target);
break;
case lir::JumpIfGreater:
conditional(c, 0x8f, target);
break;
case lir::JumpIfLessOrEqual:
conditional(c, 0x8e, target);
break;
case lir::JumpIfGreaterOrEqual:
conditional(c, 0x8d, target);
break;
default:
abort(c);
}
}
void branchFloat(Context* c, lir::TernaryOperation op, lir::Constant* target) {
switch (op) {
case lir::JumpIfFloatEqual:
// jp past the je so we don't jump to the target if unordered:
c->code.append(0x7a);
c->code.append(6);
conditional(c, 0x84, target);
break;
case lir::JumpIfFloatNotEqual:
conditional(c, 0x85, target);
conditional(c, 0x8a, target);
break;
case lir::JumpIfFloatLess:
conditional(c, 0x82, target);
break;
case lir::JumpIfFloatGreater:
conditional(c, 0x87, target);
break;
case lir::JumpIfFloatLessOrEqual:
conditional(c, 0x86, target);
break;
case lir::JumpIfFloatGreaterOrEqual:
conditional(c, 0x83, target);
break;
case lir::JumpIfFloatLessOrUnordered:
conditional(c, 0x82, target);
conditional(c, 0x8a, target);
break;
case lir::JumpIfFloatGreaterOrUnordered:
conditional(c, 0x87, target);
conditional(c, 0x8a, target);
break;
case lir::JumpIfFloatLessOrEqualOrUnordered:
conditional(c, 0x86, target);
conditional(c, 0x8a, target);
break;
case lir::JumpIfFloatGreaterOrEqualOrUnordered:
conditional(c, 0x83, target);
conditional(c, 0x8a, target);
break;
default:
abort(c);
}
}
void floatRegOp(Context* c, unsigned aSize, lir::Register* a, unsigned bSize,
lir::Register* b, uint8_t op, uint8_t mod)
{
if (aSize == 4) {
opcode(c, 0xf3);
} else {
opcode(c, 0xf2);
}
maybeRex(c, bSize, b, a);
opcode(c, 0x0f, op);
modrm(c, mod, a, b);
}
void floatMemOp(Context* c, unsigned aSize, lir::Memory* a, unsigned bSize,
lir::Register* b, uint8_t op)
{
if (aSize == 4) {
opcode(c, 0xf3);
} else {
opcode(c, 0xf2);
}
maybeRex(c, bSize, b, a);
opcode(c, 0x0f, op);
modrmSibImm(c, b, a);
}
void moveCR(Context* c, unsigned aSize, lir::Constant* a,
unsigned bSize, lir::Register* b);
void moveCR2(Context* c, UNUSED unsigned aSize, lir::Constant* a,
UNUSED unsigned bSize, lir::Register* b, unsigned promiseOffset)
{
if (vm::TargetBytesPerWord == 4 and bSize == 8) {
int64_t v = a->value->value();
if (aSize == 4) {
v = static_cast<int32_t>(v);
}
ResolvedPromise high((v >> 32) & 0xFFFFFFFF);
lir::Constant ah(&high);
ResolvedPromise low(v & 0xFFFFFFFF);
lir::Constant al(&low);
lir::Register bh(b->high);
moveCR(c, 4, &al, 4, b);
moveCR(c, 4, &ah, 4, &bh);
} else {
maybeRex(c, vm::TargetBytesPerWord, b);
opcode(c, 0xb8 + regCode(b));
if (a->value->resolved()) {
int64_t v = a->value->value();
if (aSize == 4 and bSize == 8) {
v = static_cast<int32_t>(v);
}
c->code.appendTargetAddress(v);
} else {
expect(c, aSize == vm::TargetBytesPerWord);
appendImmediateTask
(c, a->value, offsetPromise(c), vm::TargetBytesPerWord, promiseOffset);
c->code.appendTargetAddress(static_cast<vm::target_uintptr_t>(0));
}
}
}
} // namespace x86
} // namespace codegen
} // namespace avian