1 // Copyright (c) 1994-2006 Sun Microsystems Inc.
2 // All Rights Reserved.
4 // Redistribution and use in source and binary forms, with or without
5 // modification, are permitted provided that the following conditions are
8 // - Redistributions of source code must retain the above copyright notice,
9 // this list of conditions and the following disclaimer.
11 // - Redistribution in binary form must reproduce the above copyright
12 // notice, this list of conditions and the following disclaimer in the
13 // documentation and/or other materials provided with the distribution.
15 // - Neither the name of Sun Microsystems or the names of contributors may
16 // be used to endorse or promote products derived from this software without
17 // specific prior written permission.
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
20 // IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 // THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
26 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
27 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
28 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
29 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 // The original source code covered by the above license above has been
32 // modified significantly by Google Inc.
33 // Copyright 2011 the V8 project authors. All rights reserved.
35 // A light-weight IA32 Assembler.
37 #ifndef V8_X87_ASSEMBLER_X87_H_
38 #define V8_X87_ASSEMBLER_X87_H_
42 #include "src/assembler.h"
43 #include "src/isolate.h"
44 #include "src/serialize.h"
51 // 1) We would prefer to use an enum, but enum values are assignment-
52 // compatible with int, which has caused code-generation bugs.
54 // 2) We would prefer to use a class instead of a struct but we don't like
55 // the register initialization to depend on the particular initialization
56 // order (which appears to be different on OS X, Linux, and Windows for the
57 // installed versions of C++ we tried). Using a struct permits C-style
58 // "initialization". Also, the Register objects cannot be const as this
59 // forces initialization stubs in MSVC, making us dependent on initialization
62 // 3) By not using an enum, we are possibly preventing the compiler from
63 // doing certain constant folds, which may significantly reduce the
64 // code generated for some assembly instructions (because they boil down
65 // to a few constants). If this is a problem, we could change the code
66 // such that we use an enum in optimized mode, and the struct in debug
67 // mode. This way we get the compile-time error checking in debug mode
68 // and best performance in optimized code.
71 static const int kMaxNumAllocatableRegisters = 6;
72 static int NumAllocatableRegisters() {
73 return kMaxNumAllocatableRegisters;
75 static const int kNumRegisters = 8;
77 static inline const char* AllocationIndexToString(int index);
79 static inline int ToAllocationIndex(Register reg);
81 static inline Register FromAllocationIndex(int index);
83 static Register from_code(int code) {
85 DCHECK(code < kNumRegisters);
86 Register r = { code };
89 bool is_valid() const { return 0 <= code_ && code_ < kNumRegisters; }
90 bool is(Register reg) const { return code_ == reg.code_; }
91 // eax, ebx, ecx and edx are byte registers, the rest are not.
92 bool is_byte_register() const { return code_ <= 3; }
102 // Unfortunately we can't make this private in a struct.
106 const int kRegister_eax_Code = 0;
107 const int kRegister_ecx_Code = 1;
108 const int kRegister_edx_Code = 2;
109 const int kRegister_ebx_Code = 3;
110 const int kRegister_esp_Code = 4;
111 const int kRegister_ebp_Code = 5;
112 const int kRegister_esi_Code = 6;
113 const int kRegister_edi_Code = 7;
114 const int kRegister_no_reg_Code = -1;
116 const Register eax = { kRegister_eax_Code };
117 const Register ecx = { kRegister_ecx_Code };
118 const Register edx = { kRegister_edx_Code };
119 const Register ebx = { kRegister_ebx_Code };
120 const Register esp = { kRegister_esp_Code };
121 const Register ebp = { kRegister_ebp_Code };
122 const Register esi = { kRegister_esi_Code };
123 const Register edi = { kRegister_edi_Code };
124 const Register no_reg = { kRegister_no_reg_Code };
127 inline const char* Register::AllocationIndexToString(int index) {
128 DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
129 // This is the mapping of allocation indices to registers.
130 const char* const kNames[] = { "eax", "ecx", "edx", "ebx", "esi", "edi" };
131 return kNames[index];
135 inline int Register::ToAllocationIndex(Register reg) {
136 DCHECK(reg.is_valid() && !reg.is(esp) && !reg.is(ebp));
137 return (reg.code() >= 6) ? reg.code() - 2 : reg.code();
141 inline Register Register::FromAllocationIndex(int index) {
142 DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
143 return (index >= 4) ? from_code(index + 2) : from_code(index);
148 static const int kMaxNumAllocatableRegisters = 6;
149 static const int kMaxNumRegisters = 8;
150 static int NumAllocatableRegisters() {
151 return kMaxNumAllocatableRegisters;
155 // TODO(turbofan): Proper support for float32.
156 static int NumAllocatableAliasedRegisters() {
157 return NumAllocatableRegisters();
161 static int ToAllocationIndex(X87Register reg) {
165 static const char* AllocationIndexToString(int index) {
166 DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
167 const char* const names[] = {
168 "stX_0", "stX_1", "stX_2", "stX_3", "stX_4",
169 "stX_5", "stX_6", "stX_7"
174 static X87Register FromAllocationIndex(int index) {
175 DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
177 result.code_ = index;
181 bool is_valid() const {
182 return 0 <= code_ && code_ < kMaxNumRegisters;
190 bool is(X87Register reg) const {
191 return code_ == reg.code_;
198 typedef X87Register DoubleRegister;
201 const X87Register stX_0 = { 0 };
202 const X87Register stX_1 = { 1 };
203 const X87Register stX_2 = { 2 };
204 const X87Register stX_3 = { 3 };
205 const X87Register stX_4 = { 4 };
206 const X87Register stX_5 = { 5 };
207 const X87Register stX_6 = { 6 };
208 const X87Register stX_7 = { 7 };
212 // any value < 0 is considered no_condition
234 not_carry = above_equal,
236 not_zero = not_equal,
242 // Returns the equivalent of !cc.
243 // Negation of the default no_condition (-1) results in a non-default
244 // no_condition value (-2). As long as tests for no_condition check
245 // for condition < 0, this will work as expected.
246 inline Condition NegateCondition(Condition cc) {
247 return static_cast<Condition>(cc ^ 1);
251 // Commute a condition such that {a cond b == b cond' a}.
252 inline Condition CommuteCondition(Condition cc) {
269 return greater_equal;
276 // -----------------------------------------------------------------------------
277 // Machine instruction Immediates
279 class Immediate BASE_EMBEDDED {
281 inline explicit Immediate(int x);
282 inline explicit Immediate(const ExternalReference& ext);
283 inline explicit Immediate(Handle<Object> handle);
284 inline explicit Immediate(Smi* value);
285 inline explicit Immediate(Address addr);
287 static Immediate CodeRelativeOffset(Label* label) {
288 return Immediate(label);
291 bool is_zero() const { return x_ == 0 && RelocInfo::IsNone(rmode_); }
292 bool is_int8() const {
293 return -128 <= x_ && x_ < 128 && RelocInfo::IsNone(rmode_);
295 bool is_int16() const {
296 return -32768 <= x_ && x_ < 32768 && RelocInfo::IsNone(rmode_);
300 inline explicit Immediate(Label* value);
303 RelocInfo::Mode rmode_;
305 friend class Operand;
306 friend class Assembler;
307 friend class MacroAssembler;
311 // -----------------------------------------------------------------------------
312 // Machine instruction Operands
319 times_int_size = times_4,
320 times_half_pointer_size = times_2,
321 times_pointer_size = times_4,
322 times_twice_pointer_size = times_8
326 class Operand BASE_EMBEDDED {
329 INLINE(explicit Operand(Register reg));
332 INLINE(explicit Operand(int32_t disp, RelocInfo::Mode rmode));
335 INLINE(explicit Operand(Immediate imm));
338 explicit Operand(Register base, int32_t disp,
339 RelocInfo::Mode rmode = RelocInfo::NONE32);
341 // [base + index*scale + disp/r]
342 explicit Operand(Register base,
346 RelocInfo::Mode rmode = RelocInfo::NONE32);
348 // [index*scale + disp/r]
349 explicit Operand(Register index,
352 RelocInfo::Mode rmode = RelocInfo::NONE32);
354 static Operand JumpTable(Register index, ScaleFactor scale, Label* table) {
355 return Operand(index, scale, reinterpret_cast<int32_t>(table),
356 RelocInfo::INTERNAL_REFERENCE);
359 static Operand StaticVariable(const ExternalReference& ext) {
360 return Operand(reinterpret_cast<int32_t>(ext.address()),
361 RelocInfo::EXTERNAL_REFERENCE);
364 static Operand StaticArray(Register index,
366 const ExternalReference& arr) {
367 return Operand(index, scale, reinterpret_cast<int32_t>(arr.address()),
368 RelocInfo::EXTERNAL_REFERENCE);
371 static Operand ForCell(Handle<Cell> cell) {
372 AllowDeferredHandleDereference embedding_raw_address;
373 return Operand(reinterpret_cast<int32_t>(cell.location()),
377 static Operand ForRegisterPlusImmediate(Register base, Immediate imm) {
378 return Operand(base, imm.x_, imm.rmode_);
381 // Returns true if this Operand is a wrapper for the specified register.
382 bool is_reg(Register reg) const;
384 // Returns true if this Operand is a wrapper for one register.
385 bool is_reg_only() const;
387 // Asserts that this Operand is a wrapper for one register and returns the
389 Register reg() const;
392 // Set the ModRM byte without an encoded 'reg' register. The
393 // register is encoded later as part of the emit_operand operation.
394 inline void set_modrm(int mod, Register rm);
396 inline void set_sib(ScaleFactor scale, Register index, Register base);
397 inline void set_disp8(int8_t disp);
398 inline void set_dispr(int32_t disp, RelocInfo::Mode rmode);
401 // The number of bytes in buf_.
403 // Only valid if len_ > 4.
404 RelocInfo::Mode rmode_;
406 friend class Assembler;
407 friend class MacroAssembler;
411 // -----------------------------------------------------------------------------
412 // A Displacement describes the 32bit immediate field of an instruction which
413 // may be used together with a Label in order to refer to a yet unknown code
414 // position. Displacements stored in the instruction stream are used to describe
415 // the instruction and to chain a list of instructions using the same Label.
416 // A Displacement contains 2 different fields:
418 // next field: position of next displacement in the chain (0 = end of list)
419 // type field: instruction type
421 // A next value of null (0) indicates the end of a chain (note that there can
422 // be no displacement at position zero, because there is always at least one
423 // instruction byte before the displacement).
425 // Displacement _data field layout
427 // |31.....2|1......0|
430 class Displacement BASE_EMBEDDED {
432 enum Type { UNCONDITIONAL_JUMP, CODE_RELATIVE, OTHER, CODE_ABSOLUTE };
434 int data() const { return data_; }
435 Type type() const { return TypeField::decode(data_); }
436 void next(Label* L) const {
437 int n = NextField::decode(data_);
438 n > 0 ? L->link_to(n) : L->Unuse();
440 void link_to(Label* L) { init(L, type()); }
442 explicit Displacement(int data) { data_ = data; }
444 Displacement(Label* L, Type type) { init(L, type); }
447 PrintF("%s (%x) ", (type() == UNCONDITIONAL_JUMP ? "jmp" : "[other]"),
448 NextField::decode(data_));
454 class TypeField: public BitField<Type, 0, 2> {};
455 class NextField: public BitField<int, 2, 32-2> {};
457 void init(Label* L, Type type);
461 class Assembler : public AssemblerBase {
463 // We check before assembling an instruction that there is sufficient
464 // space to write an instruction and its relocation information.
465 // The relocation writer's position must be kGap bytes above the end of
466 // the generated instructions. This leaves enough space for the
467 // longest possible ia32 instruction, 15 bytes, and the longest possible
468 // relocation information encoding, RelocInfoWriter::kMaxLength == 16.
469 // (There is a 15 byte limit on ia32 instruction length that rules out some
470 // otherwise valid instructions.)
471 // This allows for a single, fast space check per instruction.
472 static const int kGap = 32;
475 // Create an assembler. Instructions and relocation information are emitted
476 // into a buffer, with the instructions starting from the beginning and the
477 // relocation information starting from the end of the buffer. See CodeDesc
478 // for a detailed comment on the layout (globals.h).
480 // If the provided buffer is NULL, the assembler allocates and grows its own
481 // buffer, and buffer_size determines the initial buffer size. The buffer is
482 // owned by the assembler and deallocated upon destruction of the assembler.
484 // If the provided buffer is not NULL, the assembler uses the provided buffer
485 // for code generation and assumes its size to be buffer_size. If the buffer
486 // is too small, a fatal error occurs. No deallocation of the buffer is done
487 // upon destruction of the assembler.
488 // TODO(vitalyr): the assembler does not need an isolate.
489 Assembler(Isolate* isolate, void* buffer, int buffer_size);
490 virtual ~Assembler() { }
492 // GetCode emits any pending (non-emitted) code and fills the descriptor
493 // desc. GetCode() is idempotent; it returns the same result if no other
494 // Assembler functions are invoked in between GetCode() calls.
495 void GetCode(CodeDesc* desc);
497 // Read/Modify the code target in the branch/call instruction at pc.
498 inline static Address target_address_at(Address pc,
499 ConstantPoolArray* constant_pool);
500 inline static void set_target_address_at(Address pc,
501 ConstantPoolArray* constant_pool,
503 ICacheFlushMode icache_flush_mode =
504 FLUSH_ICACHE_IF_NEEDED);
505 static inline Address target_address_at(Address pc, Code* code) {
506 ConstantPoolArray* constant_pool = code ? code->constant_pool() : NULL;
507 return target_address_at(pc, constant_pool);
509 static inline void set_target_address_at(Address pc,
512 ICacheFlushMode icache_flush_mode =
513 FLUSH_ICACHE_IF_NEEDED) {
514 ConstantPoolArray* constant_pool = code ? code->constant_pool() : NULL;
515 set_target_address_at(pc, constant_pool, target);
518 // Return the code target address at a call site from the return address
519 // of that call in the instruction stream.
520 inline static Address target_address_from_return_address(Address pc);
522 // Return the code target address of the patch debug break slot
523 inline static Address break_address_from_return_address(Address pc);
525 // This sets the branch destination (which is in the instruction on x86).
526 // This is for calls and branches within generated code.
527 inline static void deserialization_set_special_target_at(
528 Address instruction_payload, Code* code, Address target) {
529 set_target_address_at(instruction_payload, code, target);
532 static const int kSpecialTargetSize = kPointerSize;
534 // Distance between the address of the code target in the call instruction
535 // and the return address
536 static const int kCallTargetAddressOffset = kPointerSize;
537 // Distance between start of patched return sequence and the emitted address
539 static const int kPatchReturnSequenceAddressOffset = 1; // JMP imm32.
541 // Distance between start of patched debug break slot and the emitted address
543 static const int kPatchDebugBreakSlotAddressOffset = 1; // JMP imm32.
545 static const int kCallInstructionLength = 5;
546 static const int kPatchDebugBreakSlotReturnOffset = kPointerSize;
547 static const int kJSReturnSequenceLength = 6;
549 // The debug break slot must be able to contain a call instruction.
550 static const int kDebugBreakSlotLength = kCallInstructionLength;
552 // One byte opcode for test al, 0xXX.
553 static const byte kTestAlByte = 0xA8;
554 // One byte opcode for nop.
555 static const byte kNopByte = 0x90;
557 // One byte opcode for a short unconditional jump.
558 static const byte kJmpShortOpcode = 0xEB;
559 // One byte prefix for a short conditional jump.
560 static const byte kJccShortPrefix = 0x70;
561 static const byte kJncShortOpcode = kJccShortPrefix | not_carry;
562 static const byte kJcShortOpcode = kJccShortPrefix | carry;
563 static const byte kJnzShortOpcode = kJccShortPrefix | not_zero;
564 static const byte kJzShortOpcode = kJccShortPrefix | zero;
567 // ---------------------------------------------------------------------------
570 // - function names correspond one-to-one to ia32 instruction mnemonics
571 // - unless specified otherwise, instructions operate on 32bit operands
572 // - instructions on 8bit (byte) operands/registers have a trailing '_b'
573 // - instructions on 16bit (word) operands/registers have a trailing '_w'
574 // - naming conflicts with C++ keywords are resolved via a trailing '_'
576 // NOTE ON INTERFACE: Currently, the interface is not very consistent
577 // in the sense that some operations (e.g. mov()) can be called in more
578 // the one way to generate the same instruction: The Register argument
579 // can in some cases be replaced with an Operand(Register) argument.
580 // This should be cleaned up and made more orthogonal. The questions
581 // is: should we always use Operands instead of Registers where an
582 // Operand is possible, or should we have a Register (overloaded) form
583 // instead? We must be careful to make sure that the selected instruction
584 // is obvious from the parameters to avoid hard-to-find code generation
587 // Insert the smallest number of nop instructions
588 // possible to align the pc offset to a multiple
589 // of m. m must be a power of 2.
591 void Nop(int bytes = 1);
592 // Aligns code to something that's optimal for a jump target for the platform.
593 void CodeTargetAlign();
602 void push(const Immediate& x);
603 void push_imm32(int32_t imm32);
604 void push(Register src);
605 void push(const Operand& src);
607 void pop(Register dst);
608 void pop(const Operand& dst);
610 void enter(const Immediate& size);
614 void mov_b(Register dst, Register src) { mov_b(dst, Operand(src)); }
615 void mov_b(Register dst, const Operand& src);
616 void mov_b(Register dst, int8_t imm8) { mov_b(Operand(dst), imm8); }
617 void mov_b(const Operand& dst, int8_t imm8);
618 void mov_b(const Operand& dst, Register src);
620 void mov_w(Register dst, const Operand& src);
621 void mov_w(const Operand& dst, Register src);
622 void mov_w(const Operand& dst, int16_t imm16);
624 void mov(Register dst, int32_t imm32);
625 void mov(Register dst, const Immediate& x);
626 void mov(Register dst, Handle<Object> handle);
627 void mov(Register dst, const Operand& src);
628 void mov(Register dst, Register src);
629 void mov(const Operand& dst, const Immediate& x);
630 void mov(const Operand& dst, Handle<Object> handle);
631 void mov(const Operand& dst, Register src);
633 void movsx_b(Register dst, Register src) { movsx_b(dst, Operand(src)); }
634 void movsx_b(Register dst, const Operand& src);
636 void movsx_w(Register dst, Register src) { movsx_w(dst, Operand(src)); }
637 void movsx_w(Register dst, const Operand& src);
639 void movzx_b(Register dst, Register src) { movzx_b(dst, Operand(src)); }
640 void movzx_b(Register dst, const Operand& src);
642 void movzx_w(Register dst, Register src) { movzx_w(dst, Operand(src)); }
643 void movzx_w(Register dst, const Operand& src);
648 // Repetitive string instructions.
654 void xchg(Register dst, Register src);
655 void xchg(Register dst, const Operand& src);
658 void adc(Register dst, int32_t imm32);
659 void adc(Register dst, const Operand& src);
661 void add(Register dst, Register src) { add(dst, Operand(src)); }
662 void add(Register dst, const Operand& src);
663 void add(const Operand& dst, Register src);
664 void add(Register dst, const Immediate& imm) { add(Operand(dst), imm); }
665 void add(const Operand& dst, const Immediate& x);
667 void and_(Register dst, int32_t imm32);
668 void and_(Register dst, const Immediate& x);
669 void and_(Register dst, Register src) { and_(dst, Operand(src)); }
670 void and_(Register dst, const Operand& src);
671 void and_(const Operand& dst, Register src);
672 void and_(const Operand& dst, const Immediate& x);
674 void cmpb(Register reg, int8_t imm8) { cmpb(Operand(reg), imm8); }
675 void cmpb(const Operand& op, int8_t imm8);
676 void cmpb(Register reg, const Operand& op);
677 void cmpb(const Operand& op, Register reg);
678 void cmpb_al(const Operand& op);
679 void cmpw_ax(const Operand& op);
680 void cmpw(const Operand& op, Immediate imm16);
681 void cmp(Register reg, int32_t imm32);
682 void cmp(Register reg, Handle<Object> handle);
683 void cmp(Register reg0, Register reg1) { cmp(reg0, Operand(reg1)); }
684 void cmp(Register reg, const Operand& op);
685 void cmp(Register reg, const Immediate& imm) { cmp(Operand(reg), imm); }
686 void cmp(const Operand& op, const Immediate& imm);
687 void cmp(const Operand& op, Handle<Object> handle);
689 void dec_b(Register dst);
690 void dec_b(const Operand& dst);
692 void dec(Register dst);
693 void dec(const Operand& dst);
697 void idiv(Register src) { idiv(Operand(src)); }
698 void idiv(const Operand& src);
699 void div(Register src) { div(Operand(src)); }
700 void div(const Operand& src);
702 // Signed multiply instructions.
703 void imul(Register src); // edx:eax = eax * src.
704 void imul(Register dst, Register src) { imul(dst, Operand(src)); }
705 void imul(Register dst, const Operand& src); // dst = dst * src.
706 void imul(Register dst, Register src, int32_t imm32); // dst = src * imm32.
707 void imul(Register dst, const Operand& src, int32_t imm32);
709 void inc(Register dst);
710 void inc(const Operand& dst);
712 void lea(Register dst, const Operand& src);
714 // Unsigned multiply instruction.
715 void mul(Register src); // edx:eax = eax * reg.
717 void neg(Register dst);
718 void neg(const Operand& dst);
720 void not_(Register dst);
721 void not_(const Operand& dst);
723 void or_(Register dst, int32_t imm32);
724 void or_(Register dst, Register src) { or_(dst, Operand(src)); }
725 void or_(Register dst, const Operand& src);
726 void or_(const Operand& dst, Register src);
727 void or_(Register dst, const Immediate& imm) { or_(Operand(dst), imm); }
728 void or_(const Operand& dst, const Immediate& x);
730 void rcl(Register dst, uint8_t imm8);
731 void rcr(Register dst, uint8_t imm8);
733 void ror(Register dst, uint8_t imm8) { ror(Operand(dst), imm8); }
734 void ror(const Operand& dst, uint8_t imm8);
735 void ror_cl(Register dst) { ror_cl(Operand(dst)); }
736 void ror_cl(const Operand& dst);
738 void sar(Register dst, uint8_t imm8) { sar(Operand(dst), imm8); }
739 void sar(const Operand& dst, uint8_t imm8);
740 void sar_cl(Register dst) { sar_cl(Operand(dst)); }
741 void sar_cl(const Operand& dst);
743 void sbb(Register dst, const Operand& src);
745 void shld(Register dst, Register src) { shld(dst, Operand(src)); }
746 void shld(Register dst, const Operand& src);
748 void shl(Register dst, uint8_t imm8) { shl(Operand(dst), imm8); }
749 void shl(const Operand& dst, uint8_t imm8);
750 void shl_cl(Register dst) { shl_cl(Operand(dst)); }
751 void shl_cl(const Operand& dst);
753 void shrd(Register dst, Register src) { shrd(dst, Operand(src)); }
754 void shrd(Register dst, const Operand& src);
756 void shr(Register dst, uint8_t imm8) { shr(Operand(dst), imm8); }
757 void shr(const Operand& dst, uint8_t imm8);
758 void shr_cl(Register dst) { shr_cl(Operand(dst)); }
759 void shr_cl(const Operand& dst);
761 void sub(Register dst, const Immediate& imm) { sub(Operand(dst), imm); }
762 void sub(const Operand& dst, const Immediate& x);
763 void sub(Register dst, Register src) { sub(dst, Operand(src)); }
764 void sub(Register dst, const Operand& src);
765 void sub(const Operand& dst, Register src);
767 void test(Register reg, const Immediate& imm);
768 void test(Register reg0, Register reg1) { test(reg0, Operand(reg1)); }
769 void test(Register reg, const Operand& op);
770 void test_b(Register reg, const Operand& op);
771 void test(const Operand& op, const Immediate& imm);
772 void test_b(Register reg, uint8_t imm8);
773 void test_b(const Operand& op, uint8_t imm8);
775 void xor_(Register dst, int32_t imm32);
776 void xor_(Register dst, Register src) { xor_(dst, Operand(src)); }
777 void xor_(Register dst, const Operand& src);
778 void xor_(const Operand& dst, Register src);
779 void xor_(Register dst, const Immediate& imm) { xor_(Operand(dst), imm); }
780 void xor_(const Operand& dst, const Immediate& x);
783 void bt(const Operand& dst, Register src);
784 void bts(Register dst, Register src) { bts(Operand(dst), src); }
785 void bts(const Operand& dst, Register src);
786 void bsr(Register dst, Register src) { bsr(dst, Operand(src)); }
787 void bsr(Register dst, const Operand& src);
796 // Label operations & relative jumps (PPUM Appendix D)
798 // Takes a branch opcode (cc) and a label (L) and generates
799 // either a backward branch or a forward branch and links it
800 // to the label fixup chain. Usage:
802 // Label L; // unbound label
803 // j(cc, &L); // forward branch to unbound label
804 // bind(&L); // bind label to the current pc
805 // j(cc, &L); // backward branch to bound label
806 // bind(&L); // illegal: a label may be bound only once
808 // Note: The same Label can be used for forward and backward branches
809 // but it may be bound only once.
811 void bind(Label* L); // binds an unbound label L to the current code position
815 void call(byte* entry, RelocInfo::Mode rmode);
816 int CallSize(const Operand& adr);
817 void call(Register reg) { call(Operand(reg)); }
818 void call(const Operand& adr);
819 int CallSize(Handle<Code> code, RelocInfo::Mode mode);
820 void call(Handle<Code> code,
821 RelocInfo::Mode rmode,
822 TypeFeedbackId id = TypeFeedbackId::None());
825 // unconditional jump to L
826 void jmp(Label* L, Label::Distance distance = Label::kFar);
827 void jmp(byte* entry, RelocInfo::Mode rmode);
828 void jmp(Register reg) { jmp(Operand(reg)); }
829 void jmp(const Operand& adr);
830 void jmp(Handle<Code> code, RelocInfo::Mode rmode);
835 Label::Distance distance = Label::kFar);
836 void j(Condition cc, byte* entry, RelocInfo::Mode rmode);
837 void j(Condition cc, Handle<Code> code);
839 // Floating-point operations
848 void fld_s(const Operand& adr);
849 void fld_d(const Operand& adr);
851 void fstp_s(const Operand& adr);
852 void fst_s(const Operand& adr);
853 void fstp_d(const Operand& adr);
854 void fst_d(const Operand& adr);
856 void fild_s(const Operand& adr);
857 void fild_d(const Operand& adr);
859 void fist_s(const Operand& adr);
861 void fistp_s(const Operand& adr);
862 void fistp_d(const Operand& adr);
864 // The fisttp instructions require SSE3.
865 void fisttp_s(const Operand& adr);
866 void fisttp_d(const Operand& adr);
881 void fadd_d(const Operand& adr);
889 void fisub_s(const Operand& adr);
891 void faddp(int i = 1);
892 void fsubp(int i = 1);
893 void fsubrp(int i = 1);
894 void fmulp(int i = 1);
895 void fdivp(int i = 1);
899 void fxch(int i = 1);
901 void ffree(int i = 0);
911 void fldcw(const Operand& adr);
912 void fnstcw(const Operand& adr);
915 void fnsave(const Operand& adr);
916 void frstor(const Operand& adr);
921 void setcc(Condition cc, Register reg);
925 // TODO(lrn): Need SFENCE for movnt?
927 // Check the code size generated from label to here.
928 int SizeOfCodeGeneratedSince(Label* label) {
929 return pc_offset() - label->pos();
932 // Mark address of the ExitJSFrame code.
933 void RecordJSReturn();
935 // Mark address of a debug break slot.
936 void RecordDebugBreakSlot();
938 // Record a comment relocation entry that can be used by a disassembler.
939 // Use --code-comments to enable.
940 void RecordComment(const char* msg);
942 // Record a deoptimization reason that can be used by a log or cpu profiler.
943 // Use --trace-deopt to enable.
944 void RecordDeoptReason(const int reason, const int raw_position);
946 // Writes a single byte or word of data in the code stream. Used for
947 // inline tables, e.g., jump-tables.
948 void db(uint8_t data);
949 void dd(uint32_t data);
950 void dd(Label* label);
952 // Check if there is less than kGap bytes available in the buffer.
953 // If this is the case, we need to grow the buffer before emitting
954 // an instruction or relocation information.
955 inline bool buffer_overflow() const {
956 return pc_ >= reloc_info_writer.pos() - kGap;
959 // Get the number of bytes available in the buffer.
960 inline int available_space() const { return reloc_info_writer.pos() - pc_; }
962 static bool IsNop(Address addr);
964 PositionsRecorder* positions_recorder() { return &positions_recorder_; }
966 int relocation_writer_size() {
967 return (buffer_ + buffer_size_) - reloc_info_writer.pos();
970 // Avoid overflows for displacements etc.
971 static const int kMaximalBufferSize = 512*MB;
973 byte byte_at(int pos) { return buffer_[pos]; }
974 void set_byte_at(int pos, byte value) { buffer_[pos] = value; }
976 // Allocate a constant pool of the correct size for the generated code.
977 Handle<ConstantPoolArray> NewConstantPool(Isolate* isolate);
979 // Generate the constant pool for the generated code.
980 void PopulateConstantPool(ConstantPoolArray* constant_pool);
983 byte* addr_at(int pos) { return buffer_ + pos; }
987 uint32_t long_at(int pos) {
988 return *reinterpret_cast<uint32_t*>(addr_at(pos));
990 void long_at_put(int pos, uint32_t x) {
991 *reinterpret_cast<uint32_t*>(addr_at(pos)) = x;
996 inline void emit(uint32_t x);
997 inline void emit(Handle<Object> handle);
998 inline void emit(uint32_t x,
999 RelocInfo::Mode rmode,
1000 TypeFeedbackId id = TypeFeedbackId::None());
1001 inline void emit(Handle<Code> code,
1002 RelocInfo::Mode rmode,
1003 TypeFeedbackId id = TypeFeedbackId::None());
1004 inline void emit(const Immediate& x);
1005 inline void emit_w(const Immediate& x);
1007 // Emit the code-object-relative offset of the label's position
1008 inline void emit_code_relative_offset(Label* label);
1010 // instruction generation
1011 void emit_arith_b(int op1, int op2, Register dst, int imm8);
1013 // Emit a basic arithmetic instruction (i.e. first byte of the family is 0x81)
1014 // with a given destination expression and an immediate operand. It attempts
1015 // to use the shortest encoding possible.
1016 // sel specifies the /n in the modrm byte (see the Intel PRM).
1017 void emit_arith(int sel, Operand dst, const Immediate& x);
1019 void emit_operand(Register reg, const Operand& adr);
1021 void emit_label(Label* label);
1023 void emit_farith(int b1, int b2, int i);
1026 void print(Label* L);
1027 void bind_to(Label* L, int pos);
1030 inline Displacement disp_at(Label* L);
1031 inline void disp_at_put(Label* L, Displacement disp);
1032 inline void emit_disp(Label* L, Displacement::Type type);
1033 inline void emit_near_disp(Label* L);
1035 // record reloc info for current pc_
1036 void RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data = 0);
1038 friend class CodePatcher;
1039 friend class EnsureSpace;
1041 // Internal reference positions, required for (potential) patching in
1042 // GrowBuffer(); contains only those internal references whose labels
1043 // are already bound.
1044 std::deque<int> internal_reference_positions_;
1047 RelocInfoWriter reloc_info_writer;
1049 PositionsRecorder positions_recorder_;
1050 friend class PositionsRecorder;
1054 // Helper class that ensures that there is enough space for generating
1055 // instructions and relocation information. The constructor makes
1056 // sure that there is enough space and (in debug mode) the destructor
1057 // checks that we did not generate too much.
1058 class EnsureSpace BASE_EMBEDDED {
1060 explicit EnsureSpace(Assembler* assembler) : assembler_(assembler) {
1061 if (assembler_->buffer_overflow()) assembler_->GrowBuffer();
1063 space_before_ = assembler_->available_space();
1069 int bytes_generated = space_before_ - assembler_->available_space();
1070 DCHECK(bytes_generated < assembler_->kGap);
1075 Assembler* assembler_;
1081 } } // namespace v8::internal
1083 #endif // V8_X87_ASSEMBLER_X87_H_