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 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538
|
#include "stdafx.h"
#include "Asm.h"
#include "Params.h"
#include "../Listing.h"
#include "../TypeDesc.h"
#include "../Exception.h"
namespace code {
namespace x64 {
// Note: We intentionally overlap with the X86 implementation here.
const Reg ptrD = Reg(0x010);
const Reg ptrSi = Reg(0x011);
const Reg ptrDi = Reg(0x012);
const Reg ptr8 = Reg(0x020);
const Reg ptr9 = Reg(0x021);
const Reg ptr10 = Reg(0x022);
const Reg ptr11 = Reg(0x023);
const Reg ptr12 = Reg(0x024);
const Reg ptr13 = Reg(0x025);
const Reg ptr14 = Reg(0x026);
const Reg ptr15 = Reg(0x027);
const Reg dl = Reg(0x110);
const Reg sil = Reg(0x111);
const Reg dil = Reg(0x112);
const Reg r8l = Reg(0x120);
const Reg r9l = Reg(0x121);
const Reg r10l = Reg(0x122);
const Reg r11l = Reg(0x123);
const Reg r12l = Reg(0x124);
const Reg r13l = Reg(0x125);
const Reg r14l = Reg(0x126);
const Reg r15l = Reg(0x127);
const Reg edx = Reg(0x410);
const Reg esi = Reg(0x411);
const Reg edi = Reg(0x412);
const Reg rdx = Reg(0x810);
const Reg rsi = Reg(0x811);
const Reg rdi = Reg(0x812);
const Reg e8 = Reg(0x420);
const Reg e9 = Reg(0x421);
const Reg e10 = Reg(0x422);
const Reg e11 = Reg(0x423);
const Reg e12 = Reg(0x424);
const Reg e13 = Reg(0x425);
const Reg e14 = Reg(0x426);
const Reg e15 = Reg(0x427);
const Reg r8 = Reg(0x820);
const Reg r9 = Reg(0x821);
const Reg r10 = Reg(0x822);
const Reg r11 = Reg(0x823);
const Reg r12 = Reg(0x824);
const Reg r13 = Reg(0x825);
const Reg r14 = Reg(0x826);
const Reg r15 = Reg(0x827);
// Note: these intentionally overlap with the X86 implementation.
const Reg emm0 = Reg(0x428);
const Reg emm1 = Reg(0x429);
const Reg emm2 = Reg(0x42A);
const Reg emm3 = Reg(0x42B);
const Reg emm4 = Reg(0x42C);
const Reg emm5 = Reg(0x42D);
const Reg emm6 = Reg(0x42E);
const Reg emm7 = Reg(0x42F);
const Reg xmm0 = Reg(0x828);
const Reg xmm1 = Reg(0x829);
const Reg xmm2 = Reg(0x82A);
const Reg xmm3 = Reg(0x82B);
const Reg xmm4 = Reg(0x82C);
const Reg xmm5 = Reg(0x82D);
const Reg xmm6 = Reg(0x82E);
const Reg xmm7 = Reg(0x82F);
static const Reg pmm0 = Reg(0x028);
static const Reg pmm1 = Reg(0x029);
static const Reg pmm2 = Reg(0x02A);
static const Reg pmm3 = Reg(0x02B);
static const Reg pmm4 = Reg(0x02C);
static const Reg pmm5 = Reg(0x02D);
static const Reg pmm6 = Reg(0x02E);
static const Reg pmm7 = Reg(0x02F);
#define CASE_REG(name) case name: return S(#name)
const wchar *nameX64(Reg r) {
switch (r) {
CASE_REG(ptrD);
CASE_REG(ptrSi);
CASE_REG(ptrDi);
CASE_REG(ptr8);
CASE_REG(ptr9);
CASE_REG(ptr10);
CASE_REG(ptr11);
CASE_REG(ptr12);
CASE_REG(ptr13);
CASE_REG(ptr14);
CASE_REG(ptr15);
CASE_REG(dl);
CASE_REG(sil);
CASE_REG(dil);
CASE_REG(r8l);
CASE_REG(r9l);
CASE_REG(r10l);
CASE_REG(r11l);
CASE_REG(r12l);
CASE_REG(r13l);
CASE_REG(r14l);
CASE_REG(r15l);
CASE_REG(edx);
CASE_REG(esi);
CASE_REG(edi);
CASE_REG(rdx);
CASE_REG(rsi);
CASE_REG(rdi);
CASE_REG(e8);
CASE_REG(e9);
CASE_REG(e10);
CASE_REG(e11);
CASE_REG(e12);
CASE_REG(e13);
CASE_REG(e14);
CASE_REG(e15);
CASE_REG(r8);
CASE_REG(r9);
CASE_REG(r10);
CASE_REG(r11);
CASE_REG(r12);
CASE_REG(r13);
CASE_REG(r14);
CASE_REG(r15);
CASE_REG(emm0);
CASE_REG(emm1);
CASE_REG(emm2);
CASE_REG(emm3);
CASE_REG(emm4);
CASE_REG(emm5);
CASE_REG(emm6);
CASE_REG(emm7);
CASE_REG(xmm0);
CASE_REG(xmm1);
CASE_REG(xmm2);
CASE_REG(xmm3);
CASE_REG(xmm4);
CASE_REG(xmm5);
CASE_REG(xmm6);
CASE_REG(xmm7);
// Only for completeness.
CASE_REG(pmm0);
CASE_REG(pmm1);
CASE_REG(pmm2);
CASE_REG(pmm3);
CASE_REG(pmm4);
CASE_REG(pmm5);
CASE_REG(pmm6);
CASE_REG(pmm7);
default:
return null;
}
}
nat registerId(Reg r) {
switch (asSize(r, Size::sPtr)) {
case ptrA:
return 0;
case ptrC:
return 1;
case ptrB:
return 3;
case ptrStack:
return 4;
case ptrFrame:
return 5;
case ptrD:
return 2;
case ptrSi:
return 6;
case ptrDi:
return 7;
case ptr8:
return 8;
case ptr9:
return 9;
case ptr10:
return 10;
case ptr11:
return 11;
case ptr12:
return 12;
case ptr13:
return 13;
case ptr14:
return 14;
case ptr15:
return 15;
default:
if (fpRegister(r))
return fpRegisterId(r);
assert(false, L"Can not use " + ::toS(name(r)));
return 0;
}
}
bool fpRegister(const Operand &op) {
if (op.type() != opRegister)
return false;
else
return fpRegister(op.reg());
}
bool fpRegister(Reg r) {
Nat t = Nat(r) & 0xFF;
return t >= 0x28 && t <= 0x2F;
}
nat fpRegisterId(Reg r) {
assert(fpRegister(r));
return (Nat(r) & 0xF) - 8;
}
byte condOp(CondFlag c) {
switch (c) {
case ifAlways:
case ifNever:
assert(false);
break;
case ifOverflow:
return 0x0;
case ifNoOverflow:
return 0x1;
case ifEqual:
return 0x4;
case ifNotEqual:
return 0x5;
case ifBelow:
case ifFBelow:
return 0x2;
case ifBelowEqual:
case ifFBelowEqual:
return 0x6;
case ifAboveEqual:
case ifFAboveEqual:
return 0x3;
case ifAbove:
case ifFAbove:
return 0x7;
case ifLess:
return 0xC;
case ifLessEqual:
return 0xE;
case ifGreaterEqual:
return 0xD;
case ifGreater:
return 0xF;
}
assert(false, L"Missing jmpCond " + String(name(c)));
return 0;
}
bool singleByte(Word value) {
Long v(value);
return v >= -128 && v <= 127;
}
bool singleByte(Nat value) {
Int v(value);
return v >= -128 && v <= 127;
}
bool singleInt(Word value) {
const Long limit = Long(1) << Long(31);
Long v(value);
return v >= -limit && v < limit;
}
Reg unusedReg(RegSet *in) {
Reg r = unusedRegUnsafe(in);
if (r == noReg)
throw new (in) InvalidValue(S("We should never run out of registers on X86-64!"));
return r;
}
Reg unusedRegUnsafe(RegSet *in) {
static const Reg candidates[] = {
// Scratch registers:
ptr11, ptr10, ptr9, ptr8, ptrC, ptrD, ptrA,
// Registers that need preservation on Windows:
ptrSi, ptrDi,
// Registers that need preservation:
ptrB, ptr12, ptr13, ptr14, ptr15
};
for (nat i = 0; i < ARRAY_COUNT(candidates); i++) {
if (!in->has(candidates[i]))
return candidates[i];
}
return noReg;
}
Reg unusedFpReg(RegSet *in) {
static const Reg candidates[] = {
xmm0, xmm1, xmm2, xmm3, xmm4, xmm5, xmm6, xmm7
};
for (nat i = 0; i < ARRAY_COUNT(candidates); i++) {
if (!in->has(candidates[i]))
return candidates[i];
}
return noReg;
}
void put(Output *to, OpCode op) {
if (op.prefix)
to->putByte(op.prefix);
if (op.op1)
to->putByte(op.op1);
to->putByte(op.op2);
}
void put(Output *to, byte rex, OpCode op) {
if (op.prefix)
to->putByte(op.prefix);
to->putByte(rex);
if (op.op1)
to->putByte(op.op1);
to->putByte(op.op2);
}
// Construct and emit a SIB value. NOTE: 'scale' can not be an extended register since we do
// not emit the REX byte ourselves.
static void sib(Output *to, byte base, byte scaled = 0xFF, byte scale = 1) {
if (scaled == 0xFF)
scaled = 4; // no scaling
assert(scaled < 8);
static const byte scaleMap[9] = { 0xFF, 0, 1, 0xFF, 2, 0xFF, 0xFF, 0xFF, 3 };
scale = scaleMap[scale];
assert(scale <= 3);
to->putByte((scale << 6) | (scaled << 3) | base);
}
// Perform the dirty work of outputting the modrm bytes correctly.
static void modRm(Output *to, OpCode op, RmFlags flags, byte reg, byte mod, byte rm) {
// Transfer the fourth bit of 'reg' and 'rm' to the REX byte to see if it is needed.
byte rex = 0x40; // 0 1 0 0 W R X B
rex |= (reg & 0x8) >> 1;
rex |= (rm & 0x8) >> 3;
if (flags & rmWide)
rex |= 0x08;
bool emitRex = rex != 0x40;
if (flags & rmByte) {
// We want to use SIL, DIL, etc. instead of AH, BH, etc. We need to emit a REX
// byte in these cases, even though it does not have any bits set.
// Even though 'reg' does not always specify a register, it is OK to encode it anyway.
emitRex |= rm >= 0x4;
emitRex |= reg >= 0x4;
}
// Emit the op-code (optionally with a rex prefix where appropriate).
if (emitRex) {
put(to, rex, op);
} else {
put(to, op);
}
// Emit the modRm byte.
byte modrm = 0;
modrm |= (mod & 0x3) << 6;
modrm |= (reg & 0x7) << 3;
modrm |= (rm & 0x7) << 0;
to->putByte(modrm);
}
void modRm(Output *to, OpCode op, RmFlags flags, nat mode, const Operand &dest) {
switch (dest.type()) {
case opRegister:
modRm(to, op, flags, mode, 3, registerId(dest.reg()));
break;
case opReference:
modRm(to, op, flags, mode, 0, 5); // RIP relative addressing.
to->putObjRelative(dest.ref());
break;
case opObjReference:
modRm(to, op, flags, mode, 0, 5); // RIP relative addressing.
to->putObjRelative(dest.object());
break;
case opOffReference:
TODO(L"We could use RIP relative addressing, but we can probably assume that offsets are "
L"never more than 32-bit wide, so we should probably inline it here.");
assert(false, L"TODO!");
break;
case opRelativeLbl:
modRm(to, op, flags, mode, 0, 5); // RIP relative addressing.
to->putRelative(dest.label(), dest.offset().v64());
break;
case opRelative:
if (dest.reg() == noReg) {
// TODO: Remove this in one of the transforms!
assert(false, L"Absolute addresses are not supported on X86-64!");
} else if (dest.offsetRef().source()) {
// We need to allocate 4 bytes for the offset if it is dynamic.
nat reg = registerId(dest.reg());
modRm(to, op, flags, mode, 2, reg);
if ((reg & 0x7) == 4) {
// We need to emit a SIB byte as well.
sib(to, reg);
}
to->putInt(dest.offsetRef());
} else {
byte mod = 2;
nat reg = registerId(dest.reg());
if (dest.offset() == Offset(0)) {
if ((reg & 0x7) == 5) {
// We need to use disp8 for ebp and r13.
mod = 1;
} else {
mod = 0;
}
} else if (singleByte(nat(dest.offset().v64()))) {
mod = 1;
}
modRm(to, op, flags, mode, mod, reg);
if ((reg & 0x7) == 4) {
// We need to emit a SIB byte as well.
sib(to, reg);
}
if (mod == 1) {
to->putByte(Byte(dest.offset().v64()));
} else if (mod == 2) {
to->putInt(Nat(dest.offset().v64()));
}
}
break;
default:
// There are more modes we could support...
assert(false, L"This modRm mode is not implemented yet.");
break;
}
}
void modRm(Output *to, OpCode op, RmFlags flags, const Operand &dest, const Operand &src) {
assert(dest.type() == opRegister);
modRm(to, op, flags, registerId(dest.reg()), src);
}
void immRegInstr(Output *to, const ImmRegInstr &op, const Operand &dest, const Operand &src) {
RmFlags flags = wide(src);
switch (src.type()) {
case opConstant:
if (op.modeImm8 != 0xFF && singleByte(src.constant())) {
modRm(to, op.opImm8, flags, op.modeImm8, dest);
to->putByte(src.constant() & 0xFF);
} else {
modRm(to, op.opImm32, flags, op.modeImm32, dest);
to->putInt(Nat(src.constant()));
}
break;
case opOffReference:
// We assume that offsets are no more than 32 bits. If we're in 64-bit mode, it will
// sign extend anyway.
modRm(to, op.opImm32, flags, op.modeImm32, dest);
to->putInt(src.offsetRef());
break;
case opRegister:
modRm(to, op.opSrcReg, flags, registerId(src.reg()), dest);
break;
default:
if (dest.type() == opRegister) {
modRm(to, op.opDestReg, flags, registerId(dest.reg()), src);
} else {
assert(false, L"Operand types not supported.");
}
break;
}
}
void immRegInstr(Output *to, const ImmRegInstr8 &op, const Operand &dest, const Operand &src) {
switch (src.type()) {
case opConstant:
modRm(to, op.opImm, rmByte, op.modeImm, dest);
to->putByte(src.constant() & 0xFF);
break;
case opRegister:
modRm(to, op.opSrcReg, rmByte, registerId(src.reg()), dest);
break;
default:
if (dest.type() == opRegister) {
modRm(to, op.opDestReg, rmByte, registerId(dest.reg()), src);
} else {
assert(false, L"Operand types not supported.");
}
break;
}
}
void immRegInstr(Output *to, const ImmRegInstr8 &op8, const ImmRegInstr &op, const Operand &dest, const Operand &src) {
Size size = src.size();
if (size == Size::sInt || size == Size::sWord || size == Size::sPtr) {
immRegInstr(to, op, dest, src);
} else if (size == Size::sByte) {
immRegInstr(to, op8, dest, src);
} else {
assert(false, L"Operand size not supported: " + ::toS(size));
}
}
// Get a pointer-sized offset into whatever "operand" represents.
Operand opPtrOffset(Operand op, Nat offset) {
return opOffset(Size::sPtr, op, offset);
}
Operand opOffset(Size sz, Operand op, Nat offset) {
switch (op.type()) {
case opRelative:
return xRel(sz, op.reg(), op.offset() + Offset(offset));
case opVariable:
return xRel(sz, op.var(), op.offset() + Offset(offset));
case opRegister:
if (offset == 0)
return asSize(op.reg(), sz);
assert(false, L"Offset in registers are not supported.");
break;
default:
assert(false, L"Unsupported operand passed to 'opOffset'!");
}
return Operand();
}
}
}
|