1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #ifndef V8_X64_MACRO_ASSEMBLER_X64_H_
6 #define V8_X64_MACRO_ASSEMBLER_X64_H_
8 #include "src/assembler.h"
9 #include "src/bailout-reason.h"
10 #include "src/frames.h"
11 #include "src/globals.h"
16 // Default scratch register used by MacroAssembler (and other code that needs
17 // a spare register). The register isn't callee save, and not used by the
18 // function calling convention.
19 const Register kScratchRegister = { 10 }; // r10.
20 const Register kSmiConstantRegister = { 12 }; // r12 (callee save).
21 const Register kRootRegister = { 13 }; // r13 (callee save).
22 // Value of smi in kSmiConstantRegister.
23 const int kSmiConstantRegisterValue = 1;
24 // Actual value of root register is offset from the root array's start
25 // to take advantage of negitive 8-bit displacement values.
26 const int kRootRegisterBias = 128;
28 // Convenience for platform-independent signatures.
29 typedef Operand MemOperand;
31 enum RememberedSetAction { EMIT_REMEMBERED_SET, OMIT_REMEMBERED_SET };
32 enum SmiCheck { INLINE_SMI_CHECK, OMIT_SMI_CHECK };
33 enum PointersToHereCheck {
34 kPointersToHereMaybeInteresting,
35 kPointersToHereAreAlwaysInteresting
38 enum SmiOperationConstraint {
39 PRESERVE_SOURCE_REGISTER,
40 BAILOUT_ON_NO_OVERFLOW,
45 STATIC_ASSERT(NUMBER_OF_CONSTRAINTS <= 8);
47 class SmiOperationExecutionMode : public EnumSet<SmiOperationConstraint, byte> {
49 SmiOperationExecutionMode() : EnumSet<SmiOperationConstraint, byte>(0) { }
50 explicit SmiOperationExecutionMode(byte bits)
51 : EnumSet<SmiOperationConstraint, byte>(bits) { }
55 bool AreAliased(Register reg1,
57 Register reg3 = no_reg,
58 Register reg4 = no_reg,
59 Register reg5 = no_reg,
60 Register reg6 = no_reg,
61 Register reg7 = no_reg,
62 Register reg8 = no_reg);
65 // Forward declaration.
69 SmiIndex(Register index_register, ScaleFactor scale)
70 : reg(index_register),
77 // MacroAssembler implements a collection of frequently used macros.
78 class MacroAssembler: public Assembler {
80 // The isolate parameter can be NULL if the macro assembler should
81 // not use isolate-dependent functionality. In this case, it's the
82 // responsibility of the caller to never invoke such function on the
84 MacroAssembler(Isolate* isolate, void* buffer, int size);
86 // Prevent the use of the RootArray during the lifetime of this
88 class NoRootArrayScope BASE_EMBEDDED {
90 explicit NoRootArrayScope(MacroAssembler* assembler)
91 : variable_(&assembler->root_array_available_),
92 old_value_(assembler->root_array_available_) {
93 assembler->root_array_available_ = false;
96 *variable_ = old_value_;
103 // Operand pointing to an external reference.
104 // May emit code to set up the scratch register. The operand is
105 // only guaranteed to be correct as long as the scratch register
107 // If the operand is used more than once, use a scratch register
108 // that is guaranteed not to be clobbered.
109 Operand ExternalOperand(ExternalReference reference,
110 Register scratch = kScratchRegister);
111 // Loads and stores the value of an external reference.
112 // Special case code for load and store to take advantage of
113 // load_rax/store_rax if possible/necessary.
114 // For other operations, just use:
115 // Operand operand = ExternalOperand(extref);
116 // operation(operand, ..);
117 void Load(Register destination, ExternalReference source);
118 void Store(ExternalReference destination, Register source);
119 // Loads the address of the external reference into the destination
121 void LoadAddress(Register destination, ExternalReference source);
122 // Returns the size of the code generated by LoadAddress.
123 // Used by CallSize(ExternalReference) to find the size of a call.
124 int LoadAddressSize(ExternalReference source);
125 // Pushes the address of the external reference onto the stack.
126 void PushAddress(ExternalReference source);
128 // Operations on roots in the root-array.
129 void LoadRoot(Register destination, Heap::RootListIndex index);
130 void StoreRoot(Register source, Heap::RootListIndex index);
131 // Load a root value where the index (or part of it) is variable.
132 // The variable_offset register is added to the fixed_offset value
133 // to get the index into the root-array.
134 void LoadRootIndexed(Register destination,
135 Register variable_offset,
137 void CompareRoot(Register with, Heap::RootListIndex index);
138 void CompareRoot(const Operand& with, Heap::RootListIndex index);
139 void PushRoot(Heap::RootListIndex index);
141 // These functions do not arrange the registers in any particular order so
142 // they are not useful for calls that can cause a GC. The caller can
143 // exclude up to 3 registers that do not need to be saved and restored.
144 void PushCallerSaved(SaveFPRegsMode fp_mode,
145 Register exclusion1 = no_reg,
146 Register exclusion2 = no_reg,
147 Register exclusion3 = no_reg);
148 void PopCallerSaved(SaveFPRegsMode fp_mode,
149 Register exclusion1 = no_reg,
150 Register exclusion2 = no_reg,
151 Register exclusion3 = no_reg);
153 // ---------------------------------------------------------------------------
157 enum RememberedSetFinalAction {
162 // Record in the remembered set the fact that we have a pointer to new space
163 // at the address pointed to by the addr register. Only works if addr is not
165 void RememberedSetHelper(Register object, // Used for debug code.
168 SaveFPRegsMode save_fp,
169 RememberedSetFinalAction and_then);
171 void CheckPageFlag(Register object,
175 Label* condition_met,
176 Label::Distance condition_met_distance = Label::kFar);
178 // Check if object is in new space. Jumps if the object is not in new space.
179 // The register scratch can be object itself, but scratch will be clobbered.
180 void JumpIfNotInNewSpace(Register object,
183 Label::Distance distance = Label::kFar) {
184 InNewSpace(object, scratch, not_equal, branch, distance);
187 // Check if object is in new space. Jumps if the object is in new space.
188 // The register scratch can be object itself, but it will be clobbered.
189 void JumpIfInNewSpace(Register object,
192 Label::Distance distance = Label::kFar) {
193 InNewSpace(object, scratch, equal, branch, distance);
196 // Check if an object has the black incremental marking color. Also uses rcx!
197 void JumpIfBlack(Register object,
201 Label::Distance on_black_distance = Label::kFar);
203 // Detects conservatively whether an object is data-only, i.e. it does need to
204 // be scanned by the garbage collector.
205 void JumpIfDataObject(Register value,
207 Label* not_data_object,
208 Label::Distance not_data_object_distance);
210 // Checks the color of an object. If the object is already grey or black
211 // then we just fall through, since it is already live. If it is white and
212 // we can determine that it doesn't need to be scanned, then we just mark it
213 // black and fall through. For the rest we jump to the label so the
214 // incremental marker can fix its assumptions.
215 void EnsureNotWhite(Register object,
218 Label* object_is_white_and_not_data,
219 Label::Distance distance);
221 // Notify the garbage collector that we wrote a pointer into an object.
222 // |object| is the object being stored into, |value| is the object being
223 // stored. value and scratch registers are clobbered by the operation.
224 // The offset is the offset from the start of the object, not the offset from
225 // the tagged HeapObject pointer. For use with FieldOperand(reg, off).
226 void RecordWriteField(
231 SaveFPRegsMode save_fp,
232 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
233 SmiCheck smi_check = INLINE_SMI_CHECK,
234 PointersToHereCheck pointers_to_here_check_for_value =
235 kPointersToHereMaybeInteresting);
237 // As above, but the offset has the tag presubtracted. For use with
238 // Operand(reg, off).
239 void RecordWriteContextSlot(
244 SaveFPRegsMode save_fp,
245 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
246 SmiCheck smi_check = INLINE_SMI_CHECK,
247 PointersToHereCheck pointers_to_here_check_for_value =
248 kPointersToHereMaybeInteresting) {
249 RecordWriteField(context,
250 offset + kHeapObjectTag,
254 remembered_set_action,
256 pointers_to_here_check_for_value);
259 // Notify the garbage collector that we wrote a pointer into a fixed array.
260 // |array| is the array being stored into, |value| is the
261 // object being stored. |index| is the array index represented as a non-smi.
262 // All registers are clobbered by the operation RecordWriteArray
263 // filters out smis so it does not update the write barrier if the
265 void RecordWriteArray(
269 SaveFPRegsMode save_fp,
270 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
271 SmiCheck smi_check = INLINE_SMI_CHECK,
272 PointersToHereCheck pointers_to_here_check_for_value =
273 kPointersToHereMaybeInteresting);
275 void RecordWriteForMap(
279 SaveFPRegsMode save_fp);
281 // For page containing |object| mark region covering |address|
282 // dirty. |object| is the object being stored into, |value| is the
283 // object being stored. The address and value registers are clobbered by the
284 // operation. RecordWrite filters out smis so it does not update
285 // the write barrier if the value is a smi.
290 SaveFPRegsMode save_fp,
291 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
292 SmiCheck smi_check = INLINE_SMI_CHECK,
293 PointersToHereCheck pointers_to_here_check_for_value =
294 kPointersToHereMaybeInteresting);
296 // ---------------------------------------------------------------------------
301 // Generates function and stub prologue code.
303 void Prologue(bool code_pre_aging);
305 // Enter specific kind of exit frame; either in normal or
306 // debug mode. Expects the number of arguments in register rax and
307 // sets up the number of arguments in register rdi and the pointer
308 // to the first argument in register rsi.
310 // Allocates arg_stack_space * kPointerSize memory (not GCed) on the stack
311 // accessible via StackSpaceOperand.
312 void EnterExitFrame(int arg_stack_space = 0, bool save_doubles = false);
314 // Enter specific kind of exit frame. Allocates arg_stack_space * kPointerSize
315 // memory (not GCed) on the stack accessible via StackSpaceOperand.
316 void EnterApiExitFrame(int arg_stack_space);
318 // Leave the current exit frame. Expects/provides the return value in
319 // register rax:rdx (untouched) and the pointer to the first
320 // argument in register rsi.
321 void LeaveExitFrame(bool save_doubles = false);
323 // Leave the current exit frame. Expects/provides the return value in
324 // register rax (untouched).
325 void LeaveApiExitFrame(bool restore_context);
327 // Push and pop the registers that can hold pointers.
328 void PushSafepointRegisters() { Pushad(); }
329 void PopSafepointRegisters() { Popad(); }
330 // Store the value in register src in the safepoint register stack
331 // slot for register dst.
332 void StoreToSafepointRegisterSlot(Register dst, const Immediate& imm);
333 void StoreToSafepointRegisterSlot(Register dst, Register src);
334 void LoadFromSafepointRegisterSlot(Register dst, Register src);
336 void InitializeRootRegister() {
337 ExternalReference roots_array_start =
338 ExternalReference::roots_array_start(isolate());
339 Move(kRootRegister, roots_array_start);
340 addp(kRootRegister, Immediate(kRootRegisterBias));
343 // ---------------------------------------------------------------------------
344 // JavaScript invokes
346 // Invoke the JavaScript function code by either calling or jumping.
347 void InvokeCode(Register code,
348 const ParameterCount& expected,
349 const ParameterCount& actual,
351 const CallWrapper& call_wrapper);
353 // Invoke the JavaScript function in the given register. Changes the
354 // current context to the context in the function before invoking.
355 void InvokeFunction(Register function,
356 const ParameterCount& actual,
358 const CallWrapper& call_wrapper);
360 void InvokeFunction(Register function,
361 const ParameterCount& expected,
362 const ParameterCount& actual,
364 const CallWrapper& call_wrapper);
366 void InvokeFunction(Handle<JSFunction> function,
367 const ParameterCount& expected,
368 const ParameterCount& actual,
370 const CallWrapper& call_wrapper);
372 // Invoke specified builtin JavaScript function. Adds an entry to
373 // the unresolved list if the name does not resolve.
374 void InvokeBuiltin(Builtins::JavaScript id,
376 const CallWrapper& call_wrapper = NullCallWrapper());
378 // Store the function for the given builtin in the target register.
379 void GetBuiltinFunction(Register target, Builtins::JavaScript id);
381 // Store the code object for the given builtin in the target register.
382 void GetBuiltinEntry(Register target, Builtins::JavaScript id);
385 // ---------------------------------------------------------------------------
386 // Smi tagging, untagging and operations on tagged smis.
388 // Support for constant splitting.
389 bool IsUnsafeInt(const int32_t x);
390 void SafeMove(Register dst, Smi* src);
391 void SafePush(Smi* src);
393 void InitializeSmiConstantRegister() {
394 Move(kSmiConstantRegister, Smi::FromInt(kSmiConstantRegisterValue),
395 Assembler::RelocInfoNone());
398 // Conversions between tagged smi values and non-tagged integer values.
400 // Tag an integer value. The result must be known to be a valid smi value.
401 // Only uses the low 32 bits of the src register. Sets the N and Z flags
402 // based on the value of the resulting smi.
403 void Integer32ToSmi(Register dst, Register src);
405 // Stores an integer32 value into a memory field that already holds a smi.
406 void Integer32ToSmiField(const Operand& dst, Register src);
408 // Adds constant to src and tags the result as a smi.
409 // Result must be a valid smi.
410 void Integer64PlusConstantToSmi(Register dst, Register src, int constant);
412 // Convert smi to 32-bit integer. I.e., not sign extended into
413 // high 32 bits of destination.
414 void SmiToInteger32(Register dst, Register src);
415 void SmiToInteger32(Register dst, const Operand& src);
417 // Convert smi to 64-bit integer (sign extended if necessary).
418 void SmiToInteger64(Register dst, Register src);
419 void SmiToInteger64(Register dst, const Operand& src);
421 // Multiply a positive smi's integer value by a power of two.
422 // Provides result as 64-bit integer value.
423 void PositiveSmiTimesPowerOfTwoToInteger64(Register dst,
427 // Divide a positive smi's integer value by a power of two.
428 // Provides result as 32-bit integer value.
429 void PositiveSmiDivPowerOfTwoToInteger32(Register dst,
433 // Perform the logical or of two smi values and return a smi value.
434 // If either argument is not a smi, jump to on_not_smis and retain
435 // the original values of source registers. The destination register
436 // may be changed if it's not one of the source registers.
437 void SmiOrIfSmis(Register dst,
441 Label::Distance near_jump = Label::kFar);
444 // Simple comparison of smis. Both sides must be known smis to use these,
445 // otherwise use Cmp.
446 void SmiCompare(Register smi1, Register smi2);
447 void SmiCompare(Register dst, Smi* src);
448 void SmiCompare(Register dst, const Operand& src);
449 void SmiCompare(const Operand& dst, Register src);
450 void SmiCompare(const Operand& dst, Smi* src);
451 // Compare the int32 in src register to the value of the smi stored at dst.
452 void SmiCompareInteger32(const Operand& dst, Register src);
453 // Sets sign and zero flags depending on value of smi in register.
454 void SmiTest(Register src);
456 // Functions performing a check on a known or potential smi. Returns
457 // a condition that is satisfied if the check is successful.
459 // Is the value a tagged smi.
460 Condition CheckSmi(Register src);
461 Condition CheckSmi(const Operand& src);
463 // Is the value a non-negative tagged smi.
464 Condition CheckNonNegativeSmi(Register src);
466 // Are both values tagged smis.
467 Condition CheckBothSmi(Register first, Register second);
469 // Are both values non-negative tagged smis.
470 Condition CheckBothNonNegativeSmi(Register first, Register second);
472 // Are either value a tagged smi.
473 Condition CheckEitherSmi(Register first,
475 Register scratch = kScratchRegister);
477 // Is the value the minimum smi value (since we are using
478 // two's complement numbers, negating the value is known to yield
480 Condition CheckIsMinSmi(Register src);
482 // Checks whether an 32-bit integer value is a valid for conversion
484 Condition CheckInteger32ValidSmiValue(Register src);
486 // Checks whether an 32-bit unsigned integer value is a valid for
487 // conversion to a smi.
488 Condition CheckUInteger32ValidSmiValue(Register src);
490 // Check whether src is a Smi, and set dst to zero if it is a smi,
491 // and to one if it isn't.
492 void CheckSmiToIndicator(Register dst, Register src);
493 void CheckSmiToIndicator(Register dst, const Operand& src);
495 // Test-and-jump functions. Typically combines a check function
496 // above with a conditional jump.
498 // Jump if the value can be represented by a smi.
499 void JumpIfValidSmiValue(Register src, Label* on_valid,
500 Label::Distance near_jump = Label::kFar);
502 // Jump if the value cannot be represented by a smi.
503 void JumpIfNotValidSmiValue(Register src, Label* on_invalid,
504 Label::Distance near_jump = Label::kFar);
506 // Jump if the unsigned integer value can be represented by a smi.
507 void JumpIfUIntValidSmiValue(Register src, Label* on_valid,
508 Label::Distance near_jump = Label::kFar);
510 // Jump if the unsigned integer value cannot be represented by a smi.
511 void JumpIfUIntNotValidSmiValue(Register src, Label* on_invalid,
512 Label::Distance near_jump = Label::kFar);
514 // Jump to label if the value is a tagged smi.
515 void JumpIfSmi(Register src,
517 Label::Distance near_jump = Label::kFar);
519 // Jump to label if the value is not a tagged smi.
520 void JumpIfNotSmi(Register src,
522 Label::Distance near_jump = Label::kFar);
524 // Jump to label if the value is not a non-negative tagged smi.
525 void JumpUnlessNonNegativeSmi(Register src,
527 Label::Distance near_jump = Label::kFar);
529 // Jump to label if the value, which must be a tagged smi, has value equal
531 void JumpIfSmiEqualsConstant(Register src,
534 Label::Distance near_jump = Label::kFar);
536 // Jump if either or both register are not smi values.
537 void JumpIfNotBothSmi(Register src1,
539 Label* on_not_both_smi,
540 Label::Distance near_jump = Label::kFar);
542 // Jump if either or both register are not non-negative smi values.
543 void JumpUnlessBothNonNegativeSmi(Register src1, Register src2,
544 Label* on_not_both_smi,
545 Label::Distance near_jump = Label::kFar);
547 // Operations on tagged smi values.
549 // Smis represent a subset of integers. The subset is always equivalent to
550 // a two's complement interpretation of a fixed number of bits.
552 // Add an integer constant to a tagged smi, giving a tagged smi as result.
553 // No overflow testing on the result is done.
554 void SmiAddConstant(Register dst, Register src, Smi* constant);
556 // Add an integer constant to a tagged smi, giving a tagged smi as result.
557 // No overflow testing on the result is done.
558 void SmiAddConstant(const Operand& dst, Smi* constant);
560 // Add an integer constant to a tagged smi, giving a tagged smi as result,
561 // or jumping to a label if the result cannot be represented by a smi.
562 void SmiAddConstant(Register dst,
565 SmiOperationExecutionMode mode,
566 Label* bailout_label,
567 Label::Distance near_jump = Label::kFar);
569 // Subtract an integer constant from a tagged smi, giving a tagged smi as
570 // result. No testing on the result is done. Sets the N and Z flags
571 // based on the value of the resulting integer.
572 void SmiSubConstant(Register dst, Register src, Smi* constant);
574 // Subtract an integer constant from a tagged smi, giving a tagged smi as
575 // result, or jumping to a label if the result cannot be represented by a smi.
576 void SmiSubConstant(Register dst,
579 SmiOperationExecutionMode mode,
580 Label* bailout_label,
581 Label::Distance near_jump = Label::kFar);
583 // Negating a smi can give a negative zero or too large positive value.
584 // NOTICE: This operation jumps on success, not failure!
585 void SmiNeg(Register dst,
587 Label* on_smi_result,
588 Label::Distance near_jump = Label::kFar);
590 // Adds smi values and return the result as a smi.
591 // If dst is src1, then src1 will be destroyed if the operation is
592 // successful, otherwise kept intact.
593 void SmiAdd(Register dst,
596 Label* on_not_smi_result,
597 Label::Distance near_jump = Label::kFar);
598 void SmiAdd(Register dst,
601 Label* on_not_smi_result,
602 Label::Distance near_jump = Label::kFar);
604 void SmiAdd(Register dst,
608 // Subtracts smi values and return the result as a smi.
609 // If dst is src1, then src1 will be destroyed if the operation is
610 // successful, otherwise kept intact.
611 void SmiSub(Register dst,
614 Label* on_not_smi_result,
615 Label::Distance near_jump = Label::kFar);
616 void SmiSub(Register dst,
619 Label* on_not_smi_result,
620 Label::Distance near_jump = Label::kFar);
622 void SmiSub(Register dst,
626 void SmiSub(Register dst,
628 const Operand& src2);
630 // Multiplies smi values and return the result as a smi,
632 // If dst is src1, then src1 will be destroyed, even if
633 // the operation is unsuccessful.
634 void SmiMul(Register dst,
637 Label* on_not_smi_result,
638 Label::Distance near_jump = Label::kFar);
640 // Divides one smi by another and returns the quotient.
641 // Clobbers rax and rdx registers.
642 void SmiDiv(Register dst,
645 Label* on_not_smi_result,
646 Label::Distance near_jump = Label::kFar);
648 // Divides one smi by another and returns the remainder.
649 // Clobbers rax and rdx registers.
650 void SmiMod(Register dst,
653 Label* on_not_smi_result,
654 Label::Distance near_jump = Label::kFar);
656 // Bitwise operations.
657 void SmiNot(Register dst, Register src);
658 void SmiAnd(Register dst, Register src1, Register src2);
659 void SmiOr(Register dst, Register src1, Register src2);
660 void SmiXor(Register dst, Register src1, Register src2);
661 void SmiAndConstant(Register dst, Register src1, Smi* constant);
662 void SmiOrConstant(Register dst, Register src1, Smi* constant);
663 void SmiXorConstant(Register dst, Register src1, Smi* constant);
665 void SmiShiftLeftConstant(Register dst,
668 Label* on_not_smi_result = NULL,
669 Label::Distance near_jump = Label::kFar);
670 void SmiShiftLogicalRightConstant(Register dst,
673 Label* on_not_smi_result,
674 Label::Distance near_jump = Label::kFar);
675 void SmiShiftArithmeticRightConstant(Register dst,
679 // Shifts a smi value to the left, and returns the result if that is a smi.
680 // Uses and clobbers rcx, so dst may not be rcx.
681 void SmiShiftLeft(Register dst,
684 Label* on_not_smi_result = NULL,
685 Label::Distance near_jump = Label::kFar);
686 // Shifts a smi value to the right, shifting in zero bits at the top, and
687 // returns the unsigned intepretation of the result if that is a smi.
688 // Uses and clobbers rcx, so dst may not be rcx.
689 void SmiShiftLogicalRight(Register dst,
692 Label* on_not_smi_result,
693 Label::Distance near_jump = Label::kFar);
694 // Shifts a smi value to the right, sign extending the top, and
695 // returns the signed intepretation of the result. That will always
696 // be a valid smi value, since it's numerically smaller than the
698 // Uses and clobbers rcx, so dst may not be rcx.
699 void SmiShiftArithmeticRight(Register dst,
703 // Specialized operations
705 // Select the non-smi register of two registers where exactly one is a
706 // smi. If neither are smis, jump to the failure label.
707 void SelectNonSmi(Register dst,
711 Label::Distance near_jump = Label::kFar);
713 // Converts, if necessary, a smi to a combination of number and
714 // multiplier to be used as a scaled index.
715 // The src register contains a *positive* smi value. The shift is the
716 // power of two to multiply the index value by (e.g.
717 // to index by smi-value * kPointerSize, pass the smi and kPointerSizeLog2).
718 // The returned index register may be either src or dst, depending
719 // on what is most efficient. If src and dst are different registers,
720 // src is always unchanged.
721 SmiIndex SmiToIndex(Register dst, Register src, int shift);
723 // Converts a positive smi to a negative index.
724 SmiIndex SmiToNegativeIndex(Register dst, Register src, int shift);
726 // Add the value of a smi in memory to an int32 register.
727 // Sets flags as a normal add.
728 void AddSmiField(Register dst, const Operand& src);
730 // Basic Smi operations.
731 void Move(Register dst, Smi* source) {
732 LoadSmiConstant(dst, source);
735 void Move(const Operand& dst, Smi* source) {
736 Register constant = GetSmiConstant(source);
742 // Save away a raw integer with pointer size on the stack as two integers
743 // masquerading as smis so that the garbage collector skips visiting them.
744 void PushRegisterAsTwoSmis(Register src, Register scratch = kScratchRegister);
745 // Reconstruct a raw integer with pointer size from two integers masquerading
746 // as smis on the top of stack.
747 void PopRegisterAsTwoSmis(Register dst, Register scratch = kScratchRegister);
749 void Test(const Operand& dst, Smi* source);
752 // ---------------------------------------------------------------------------
755 // Generate code to do a lookup in the number string cache. If the number in
756 // the register object is found in the cache the generated code falls through
757 // with the result in the result register. The object and the result register
758 // can be the same. If the number is not found in the cache the code jumps to
759 // the label not_found with only the content of register object unchanged.
760 void LookupNumberStringCache(Register object,
766 // If object is a string, its map is loaded into object_map.
767 void JumpIfNotString(Register object,
770 Label::Distance near_jump = Label::kFar);
773 void JumpIfNotBothSequentialOneByteStrings(
774 Register first_object, Register second_object, Register scratch1,
775 Register scratch2, Label* on_not_both_flat_one_byte,
776 Label::Distance near_jump = Label::kFar);
778 // Check whether the instance type represents a flat one-byte string. Jump
779 // to the label if not. If the instance type can be scratched specify same
780 // register for both instance type and scratch.
781 void JumpIfInstanceTypeIsNotSequentialOneByte(
782 Register instance_type, Register scratch,
783 Label* on_not_flat_one_byte_string,
784 Label::Distance near_jump = Label::kFar);
786 void JumpIfBothInstanceTypesAreNotSequentialOneByte(
787 Register first_object_instance_type, Register second_object_instance_type,
788 Register scratch1, Register scratch2, Label* on_fail,
789 Label::Distance near_jump = Label::kFar);
791 void EmitSeqStringSetCharCheck(Register string,
794 uint32_t encoding_mask);
796 // Checks if the given register or operand is a unique name
797 void JumpIfNotUniqueNameInstanceType(Register reg, Label* not_unique_name,
798 Label::Distance distance = Label::kFar);
799 void JumpIfNotUniqueNameInstanceType(Operand operand, Label* not_unique_name,
800 Label::Distance distance = Label::kFar);
802 // ---------------------------------------------------------------------------
803 // Macro instructions.
805 // Load/store with specific representation.
806 void Load(Register dst, const Operand& src, Representation r);
807 void Store(const Operand& dst, Register src, Representation r);
809 // Load a register with a long value as efficiently as possible.
810 void Set(Register dst, int64_t x);
811 void Set(const Operand& dst, intptr_t x);
813 // cvtsi2sd instruction only writes to the low 64-bit of dst register, which
814 // hinders register renaming and makes dependence chains longer. So we use
815 // xorps to clear the dst register before cvtsi2sd to solve this issue.
816 void Cvtlsi2sd(XMMRegister dst, Register src);
817 void Cvtlsi2sd(XMMRegister dst, const Operand& src);
819 // Move if the registers are not identical.
820 void Move(Register target, Register source);
822 // TestBit and Load SharedFunctionInfo special field.
823 void TestBitSharedFunctionInfoSpecialField(Register base,
826 void LoadSharedFunctionInfoSpecialField(Register dst,
831 void Move(Register dst, Handle<Object> source);
832 void Move(const Operand& dst, Handle<Object> source);
833 void Cmp(Register dst, Handle<Object> source);
834 void Cmp(const Operand& dst, Handle<Object> source);
835 void Cmp(Register dst, Smi* src);
836 void Cmp(const Operand& dst, Smi* src);
837 void Push(Handle<Object> source);
839 // Load a heap object and handle the case of new-space objects by
840 // indirecting via a global cell.
841 void MoveHeapObject(Register result, Handle<Object> object);
843 // Load a global cell into a register.
844 void LoadGlobalCell(Register dst, Handle<Cell> cell);
846 // Compare the given value and the value of weak cell.
847 void CmpWeakValue(Register value, Handle<WeakCell> cell, Register scratch);
849 void GetWeakValue(Register value, Handle<WeakCell> cell);
851 // Load the value of the weak cell in the value register. Branch to the given
852 // miss label if the weak cell was cleared.
853 void LoadWeakValue(Register value, Handle<WeakCell> cell, Label* miss);
855 // Emit code to discard a non-negative number of pointer-sized elements
856 // from the stack, clobbering only the rsp register.
857 void Drop(int stack_elements);
858 // Emit code to discard a positive number of pointer-sized elements
859 // from the stack under the return address which remains on the top,
860 // clobbering the rsp register.
861 void DropUnderReturnAddress(int stack_elements,
862 Register scratch = kScratchRegister);
864 void Call(Label* target) { call(target); }
865 void Push(Register src);
866 void Push(const Operand& src);
867 void PushQuad(const Operand& src);
868 void Push(Immediate value);
869 void PushImm32(int32_t imm32);
870 void Pop(Register dst);
871 void Pop(const Operand& dst);
872 void PopQuad(const Operand& dst);
873 void PushReturnAddressFrom(Register src) { pushq(src); }
874 void PopReturnAddressTo(Register dst) { popq(dst); }
875 void Move(Register dst, ExternalReference ext) {
876 movp(dst, reinterpret_cast<void*>(ext.address()),
877 RelocInfo::EXTERNAL_REFERENCE);
880 // Loads a pointer into a register with a relocation mode.
881 void Move(Register dst, void* ptr, RelocInfo::Mode rmode) {
882 // This method must not be used with heap object references. The stored
883 // address is not GC safe. Use the handle version instead.
884 DCHECK(rmode > RelocInfo::LAST_GCED_ENUM);
885 movp(dst, ptr, rmode);
888 void Move(Register dst, Handle<Object> value, RelocInfo::Mode rmode) {
889 AllowDeferredHandleDereference using_raw_address;
890 DCHECK(!RelocInfo::IsNone(rmode));
891 DCHECK(value->IsHeapObject());
892 DCHECK(!isolate()->heap()->InNewSpace(*value));
893 movp(dst, reinterpret_cast<void*>(value.location()), rmode);
896 void Move(XMMRegister dst, uint32_t src);
897 void Move(XMMRegister dst, uint64_t src);
898 void Move(XMMRegister dst, float src) { Move(dst, bit_cast<uint32_t>(src)); }
899 void Move(XMMRegister dst, double src) { Move(dst, bit_cast<uint64_t>(src)); }
902 void Jump(Address destination, RelocInfo::Mode rmode);
903 void Jump(ExternalReference ext);
904 void Jump(const Operand& op);
905 void Jump(Handle<Code> code_object, RelocInfo::Mode rmode);
907 void Call(Address destination, RelocInfo::Mode rmode);
908 void Call(ExternalReference ext);
909 void Call(const Operand& op);
910 void Call(Handle<Code> code_object,
911 RelocInfo::Mode rmode,
912 TypeFeedbackId ast_id = TypeFeedbackId::None());
914 // The size of the code generated for different call instructions.
915 int CallSize(Address destination) {
916 return kCallSequenceLength;
918 int CallSize(ExternalReference ext);
919 int CallSize(Handle<Code> code_object) {
920 // Code calls use 32-bit relative addressing.
921 return kShortCallInstructionLength;
923 int CallSize(Register target) {
924 // Opcode: REX_opt FF /2 m64
925 return (target.high_bit() != 0) ? 3 : 2;
927 int CallSize(const Operand& target) {
928 // Opcode: REX_opt FF /2 m64
929 return (target.requires_rex() ? 2 : 1) + target.operand_size();
932 // Emit call to the code we are currently generating.
934 Handle<Code> self(reinterpret_cast<Code**>(CodeObject().location()));
935 Call(self, RelocInfo::CODE_TARGET);
938 // Non-x64 instructions.
939 // Push/pop all general purpose registers.
940 // Does not push rsp/rbp nor any of the assembler's special purpose registers
941 // (kScratchRegister, kSmiConstantRegister, kRootRegister).
944 // Sets the stack as after performing Popad, without actually loading the
948 // Compare object type for heap object.
949 // Always use unsigned comparisons: above and below, not less and greater.
950 // Incoming register is heap_object and outgoing register is map.
951 // They may be the same register, and may be kScratchRegister.
952 void CmpObjectType(Register heap_object, InstanceType type, Register map);
954 // Compare instance type for map.
955 // Always use unsigned comparisons: above and below, not less and greater.
956 void CmpInstanceType(Register map, InstanceType type);
958 // Check if a map for a JSObject indicates that the object has fast elements.
959 // Jump to the specified label if it does not.
960 void CheckFastElements(Register map,
962 Label::Distance distance = Label::kFar);
964 // Check if a map for a JSObject indicates that the object can have both smi
965 // and HeapObject elements. Jump to the specified label if it does not.
966 void CheckFastObjectElements(Register map,
968 Label::Distance distance = Label::kFar);
970 // Check if a map for a JSObject indicates that the object has fast smi only
971 // elements. Jump to the specified label if it does not.
972 void CheckFastSmiElements(Register map,
974 Label::Distance distance = Label::kFar);
976 // Check to see if maybe_number can be stored as a double in
977 // FastDoubleElements. If it can, store it at the index specified by index in
978 // the FastDoubleElements array elements, otherwise jump to fail. Note that
979 // index must not be smi-tagged.
980 void StoreNumberToDoubleElements(Register maybe_number,
983 XMMRegister xmm_scratch,
985 int elements_offset = 0);
987 // Compare an object's map with the specified map.
988 void CompareMap(Register obj, Handle<Map> map);
990 // Check if the map of an object is equal to a specified map and branch to
991 // label if not. Skip the smi check if not required (object is known to be a
992 // heap object). If mode is ALLOW_ELEMENT_TRANSITION_MAPS, then also match
993 // against maps that are ElementsKind transition maps of the specified map.
994 void CheckMap(Register obj,
997 SmiCheckType smi_check_type);
999 // Check if the map of an object is equal to a specified weak map and branch
1000 // to a specified target if equal. Skip the smi check if not required
1001 // (object is known to be a heap object)
1002 void DispatchWeakMap(Register obj, Register scratch1, Register scratch2,
1003 Handle<WeakCell> cell, Handle<Code> success,
1004 SmiCheckType smi_check_type);
1006 // Check if the object in register heap_object is a string. Afterwards the
1007 // register map contains the object map and the register instance_type
1008 // contains the instance_type. The registers map and instance_type can be the
1009 // same in which case it contains the instance type afterwards. Either of the
1010 // registers map and instance_type can be the same as heap_object.
1011 Condition IsObjectStringType(Register heap_object,
1013 Register instance_type);
1015 // Check if the object in register heap_object is a name. Afterwards the
1016 // register map contains the object map and the register instance_type
1017 // contains the instance_type. The registers map and instance_type can be the
1018 // same in which case it contains the instance type afterwards. Either of the
1019 // registers map and instance_type can be the same as heap_object.
1020 Condition IsObjectNameType(Register heap_object,
1022 Register instance_type);
1024 // FCmp compares and pops the two values on top of the FPU stack.
1025 // The flag results are similar to integer cmp, but requires unsigned
1026 // jcc instructions (je, ja, jae, jb, jbe, je, and jz).
1029 void ClampUint8(Register reg);
1031 void ClampDoubleToUint8(XMMRegister input_reg,
1032 XMMRegister temp_xmm_reg,
1033 Register result_reg);
1035 void SlowTruncateToI(Register result_reg, Register input_reg,
1036 int offset = HeapNumber::kValueOffset - kHeapObjectTag);
1038 void TruncateHeapNumberToI(Register result_reg, Register input_reg);
1039 void TruncateDoubleToI(Register result_reg, XMMRegister input_reg);
1041 void DoubleToI(Register result_reg, XMMRegister input_reg,
1042 XMMRegister scratch, MinusZeroMode minus_zero_mode,
1043 Label* lost_precision, Label* is_nan, Label* minus_zero,
1044 Label::Distance dst = Label::kFar);
1046 void LoadUint32(XMMRegister dst, Register src);
1048 void LoadInstanceDescriptors(Register map, Register descriptors);
1049 void EnumLength(Register dst, Register map);
1050 void NumberOfOwnDescriptors(Register dst, Register map);
1051 void LoadAccessor(Register dst, Register holder, int accessor_index,
1052 AccessorComponent accessor);
1054 template<typename Field>
1055 void DecodeField(Register reg) {
1056 static const int shift = Field::kShift;
1057 static const int mask = Field::kMask >> Field::kShift;
1059 shrp(reg, Immediate(shift));
1061 andp(reg, Immediate(mask));
1064 template<typename Field>
1065 void DecodeFieldToSmi(Register reg) {
1066 if (SmiValuesAre32Bits()) {
1067 andp(reg, Immediate(Field::kMask));
1068 shlp(reg, Immediate(kSmiShift - Field::kShift));
1070 static const int shift = Field::kShift;
1071 static const int mask = (Field::kMask >> Field::kShift) << kSmiTagSize;
1072 DCHECK(SmiValuesAre31Bits());
1073 DCHECK(kSmiShift == kSmiTagSize);
1074 DCHECK((mask & 0x80000000u) == 0);
1075 if (shift < kSmiShift) {
1076 shlp(reg, Immediate(kSmiShift - shift));
1077 } else if (shift > kSmiShift) {
1078 sarp(reg, Immediate(shift - kSmiShift));
1080 andp(reg, Immediate(mask));
1084 // Abort execution if argument is not a number, enabled via --debug-code.
1085 void AssertNumber(Register object);
1087 // Abort execution if argument is a smi, enabled via --debug-code.
1088 void AssertNotSmi(Register object);
1090 // Abort execution if argument is not a smi, enabled via --debug-code.
1091 void AssertSmi(Register object);
1092 void AssertSmi(const Operand& object);
1094 // Abort execution if a 64 bit register containing a 32 bit payload does not
1095 // have zeros in the top 32 bits, enabled via --debug-code.
1096 void AssertZeroExtended(Register reg);
1098 // Abort execution if argument is not a string, enabled via --debug-code.
1099 void AssertString(Register object);
1101 // Abort execution if argument is not a name, enabled via --debug-code.
1102 void AssertName(Register object);
1104 // Abort execution if argument is not undefined or an AllocationSite, enabled
1105 // via --debug-code.
1106 void AssertUndefinedOrAllocationSite(Register object);
1108 // Abort execution if argument is not the root value with the given index,
1109 // enabled via --debug-code.
1110 void AssertRootValue(Register src,
1111 Heap::RootListIndex root_value_index,
1112 BailoutReason reason);
1114 // ---------------------------------------------------------------------------
1115 // Exception handling
1117 // Push a new try handler and link it into try handler chain.
1118 void PushTryHandler(StackHandler::Kind kind, int handler_index);
1120 // Unlink the stack handler on top of the stack from the try handler chain.
1121 void PopTryHandler();
1123 // Activate the top handler in the try hander chain and pass the
1125 void Throw(Register value);
1127 // Propagate an uncatchable exception out of the current JS stack.
1128 void ThrowUncatchable(Register value);
1130 // ---------------------------------------------------------------------------
1131 // Inline caching support
1133 // Generate code for checking access rights - used for security checks
1134 // on access to global objects across environments. The holder register
1135 // is left untouched, but the scratch register and kScratchRegister,
1136 // which must be different, are clobbered.
1137 void CheckAccessGlobalProxy(Register holder_reg,
1141 void GetNumberHash(Register r0, Register scratch);
1143 void LoadFromNumberDictionary(Label* miss,
1152 // ---------------------------------------------------------------------------
1153 // Allocation support
1155 // Allocate an object in new space or old pointer space. If the given space
1156 // is exhausted control continues at the gc_required label. The allocated
1157 // object is returned in result and end of the new object is returned in
1158 // result_end. The register scratch can be passed as no_reg in which case
1159 // an additional object reference will be added to the reloc info. The
1160 // returned pointers in result and result_end have not yet been tagged as
1161 // heap objects. If result_contains_top_on_entry is true the content of
1162 // result is known to be the allocation top on entry (could be result_end
1163 // from a previous call). If result_contains_top_on_entry is true scratch
1164 // should be no_reg as it is never used.
1165 void Allocate(int object_size,
1167 Register result_end,
1170 AllocationFlags flags);
1172 void Allocate(int header_size,
1173 ScaleFactor element_size,
1174 Register element_count,
1176 Register result_end,
1179 AllocationFlags flags);
1181 void Allocate(Register object_size,
1183 Register result_end,
1186 AllocationFlags flags);
1188 // Undo allocation in new space. The object passed and objects allocated after
1189 // it will no longer be allocated. Make sure that no pointers are left to the
1190 // object(s) no longer allocated as they would be invalid when allocation is
1192 void UndoAllocationInNewSpace(Register object);
1194 // Allocate a heap number in new space with undefined value. Returns
1195 // tagged pointer in result register, or jumps to gc_required if new
1197 void AllocateHeapNumber(Register result,
1200 MutableMode mode = IMMUTABLE);
1202 // Allocate a sequential string. All the header fields of the string object
1204 void AllocateTwoByteString(Register result,
1209 Label* gc_required);
1210 void AllocateOneByteString(Register result, Register length,
1211 Register scratch1, Register scratch2,
1212 Register scratch3, Label* gc_required);
1214 // Allocate a raw cons string object. Only the map field of the result is
1216 void AllocateTwoByteConsString(Register result,
1219 Label* gc_required);
1220 void AllocateOneByteConsString(Register result, Register scratch1,
1221 Register scratch2, Label* gc_required);
1223 // Allocate a raw sliced string object. Only the map field of the result is
1225 void AllocateTwoByteSlicedString(Register result,
1228 Label* gc_required);
1229 void AllocateOneByteSlicedString(Register result, Register scratch1,
1230 Register scratch2, Label* gc_required);
1232 // ---------------------------------------------------------------------------
1233 // Support functions.
1235 // Check if result is zero and op is negative.
1236 void NegativeZeroTest(Register result, Register op, Label* then_label);
1238 // Check if result is zero and op is negative in code using jump targets.
1239 void NegativeZeroTest(CodeGenerator* cgen,
1242 JumpTarget* then_target);
1244 // Check if result is zero and any of op1 and op2 are negative.
1245 // Register scratch is destroyed, and it must be different from op2.
1246 void NegativeZeroTest(Register result, Register op1, Register op2,
1247 Register scratch, Label* then_label);
1249 // Try to get function prototype of a function and puts the value in
1250 // the result register. Checks that the function really is a
1251 // function and jumps to the miss label if the fast checks fail. The
1252 // function register will be untouched; the other register may be
1254 void TryGetFunctionPrototype(Register function,
1257 bool miss_on_bound_function = false);
1259 // Picks out an array index from the hash field.
1261 // hash - holds the index's hash. Clobbered.
1262 // index - holds the overwritten index on exit.
1263 void IndexFromHash(Register hash, Register index);
1265 // Find the function context up the context chain.
1266 void LoadContext(Register dst, int context_chain_length);
1268 // Conditionally load the cached Array transitioned map of type
1269 // transitioned_kind from the native context if the map in register
1270 // map_in_out is the cached Array map in the native context of
1272 void LoadTransitionedArrayMapConditional(
1273 ElementsKind expected_kind,
1274 ElementsKind transitioned_kind,
1275 Register map_in_out,
1277 Label* no_map_match);
1279 // Load the global function with the given index.
1280 void LoadGlobalFunction(int index, Register function);
1282 // Load the initial map from the global function. The registers
1283 // function and map can be the same.
1284 void LoadGlobalFunctionInitialMap(Register function, Register map);
1286 // ---------------------------------------------------------------------------
1289 // Call a code stub.
1290 void CallStub(CodeStub* stub, TypeFeedbackId ast_id = TypeFeedbackId::None());
1292 // Tail call a code stub (jump).
1293 void TailCallStub(CodeStub* stub);
1295 // Return from a code stub after popping its arguments.
1296 void StubReturn(int argc);
1298 // Call a runtime routine.
1299 void CallRuntime(const Runtime::Function* f,
1301 SaveFPRegsMode save_doubles = kDontSaveFPRegs);
1303 // Call a runtime function and save the value of XMM registers.
1304 void CallRuntimeSaveDoubles(Runtime::FunctionId id) {
1305 const Runtime::Function* function = Runtime::FunctionForId(id);
1306 CallRuntime(function, function->nargs, kSaveFPRegs);
1309 // Convenience function: Same as above, but takes the fid instead.
1310 void CallRuntime(Runtime::FunctionId id,
1312 SaveFPRegsMode save_doubles = kDontSaveFPRegs) {
1313 CallRuntime(Runtime::FunctionForId(id), num_arguments, save_doubles);
1316 // Convenience function: call an external reference.
1317 void CallExternalReference(const ExternalReference& ext,
1320 // Tail call of a runtime routine (jump).
1321 // Like JumpToExternalReference, but also takes care of passing the number
1323 void TailCallExternalReference(const ExternalReference& ext,
1327 // Convenience function: tail call a runtime routine (jump).
1328 void TailCallRuntime(Runtime::FunctionId fid,
1332 // Jump to a runtime routine.
1333 void JumpToExternalReference(const ExternalReference& ext, int result_size);
1335 // Before calling a C-function from generated code, align arguments on stack.
1336 // After aligning the frame, arguments must be stored in rsp[0], rsp[8],
1337 // etc., not pushed. The argument count assumes all arguments are word sized.
1338 // The number of slots reserved for arguments depends on platform. On Windows
1339 // stack slots are reserved for the arguments passed in registers. On other
1340 // platforms stack slots are only reserved for the arguments actually passed
1342 void PrepareCallCFunction(int num_arguments);
1344 // Calls a C function and cleans up the space for arguments allocated
1345 // by PrepareCallCFunction. The called function is not allowed to trigger a
1346 // garbage collection, since that might move the code and invalidate the
1347 // return address (unless this is somehow accounted for by the called
1349 void CallCFunction(ExternalReference function, int num_arguments);
1350 void CallCFunction(Register function, int num_arguments);
1352 // Calculate the number of stack slots to reserve for arguments when calling a
1354 int ArgumentStackSlotsForCFunctionCall(int num_arguments);
1356 // ---------------------------------------------------------------------------
1361 // Return and drop arguments from stack, where the number of arguments
1362 // may be bigger than 2^16 - 1. Requires a scratch register.
1363 void Ret(int bytes_dropped, Register scratch);
1365 Handle<Object> CodeObject() {
1366 DCHECK(!code_object_.is_null());
1367 return code_object_;
1370 // Copy length bytes from source to destination.
1371 // Uses scratch register internally (if you have a low-eight register
1372 // free, do use it, otherwise kScratchRegister will be used).
1373 // The min_length is a minimum limit on the value that length will have.
1374 // The algorithm has some special cases that might be omitted if the string
1375 // is known to always be long.
1376 void CopyBytes(Register destination,
1380 Register scratch = kScratchRegister);
1382 // Initialize fields with filler values. Fields starting at |start_offset|
1383 // not including end_offset are overwritten with the value in |filler|. At
1384 // the end the loop, |start_offset| takes the value of |end_offset|.
1385 void InitializeFieldsWithFiller(Register start_offset,
1386 Register end_offset,
1390 // Emit code for a truncating division by a constant. The dividend register is
1391 // unchanged, the result is in rdx, and rax gets clobbered.
1392 void TruncatingDiv(Register dividend, int32_t divisor);
1394 // ---------------------------------------------------------------------------
1395 // StatsCounter support
1397 void SetCounter(StatsCounter* counter, int value);
1398 void IncrementCounter(StatsCounter* counter, int value);
1399 void DecrementCounter(StatsCounter* counter, int value);
1402 // ---------------------------------------------------------------------------
1405 // Calls Abort(msg) if the condition cc is not satisfied.
1406 // Use --debug_code to enable.
1407 void Assert(Condition cc, BailoutReason reason);
1409 void AssertFastElements(Register elements);
1411 // Like Assert(), but always enabled.
1412 void Check(Condition cc, BailoutReason reason);
1414 // Print a message to stdout and abort execution.
1415 void Abort(BailoutReason msg);
1417 // Check that the stack is aligned.
1418 void CheckStackAlignment();
1420 // Verify restrictions about code generated in stubs.
1421 void set_generating_stub(bool value) { generating_stub_ = value; }
1422 bool generating_stub() { return generating_stub_; }
1423 void set_has_frame(bool value) { has_frame_ = value; }
1424 bool has_frame() { return has_frame_; }
1425 inline bool AllowThisStubCall(CodeStub* stub);
1427 static int SafepointRegisterStackIndex(Register reg) {
1428 return SafepointRegisterStackIndex(reg.code());
1431 // Activation support.
1432 void EnterFrame(StackFrame::Type type);
1433 void EnterFrame(StackFrame::Type type, bool load_constant_pool_pointer_reg);
1434 void LeaveFrame(StackFrame::Type type);
1436 // Expects object in rax and returns map with validated enum cache
1437 // in rax. Assumes that any other register can be used as a scratch.
1438 void CheckEnumCache(Register null_value,
1439 Label* call_runtime);
1441 // AllocationMemento support. Arrays may have an associated
1442 // AllocationMemento object that can be checked for in order to pretransition
1444 // On entry, receiver_reg should point to the array object.
1445 // scratch_reg gets clobbered.
1446 // If allocation info is present, condition flags are set to equal.
1447 void TestJSArrayForAllocationMemento(Register receiver_reg,
1448 Register scratch_reg,
1449 Label* no_memento_found);
1451 void JumpIfJSArrayHasAllocationMemento(Register receiver_reg,
1452 Register scratch_reg,
1453 Label* memento_found) {
1454 Label no_memento_found;
1455 TestJSArrayForAllocationMemento(receiver_reg, scratch_reg,
1457 j(equal, memento_found);
1458 bind(&no_memento_found);
1461 // Jumps to found label if a prototype map has dictionary elements.
1462 void JumpIfDictionaryInPrototypeChain(Register object, Register scratch0,
1463 Register scratch1, Label* found);
1466 // Order general registers are pushed by Pushad.
1467 // rax, rcx, rdx, rbx, rsi, rdi, r8, r9, r11, r14, r15.
1468 static const int kSafepointPushRegisterIndices[Register::kNumRegisters];
1469 static const int kNumSafepointSavedRegisters = 11;
1470 static const int kSmiShift = kSmiTagSize + kSmiShiftSize;
1472 bool generating_stub_;
1474 bool root_array_available_;
1476 // Returns a register holding the smi value. The register MUST NOT be
1477 // modified. It may be the "smi 1 constant" register.
1478 Register GetSmiConstant(Smi* value);
1480 int64_t RootRegisterDelta(ExternalReference other);
1482 // Moves the smi value to the destination register.
1483 void LoadSmiConstant(Register dst, Smi* value);
1485 // This handle will be patched with the code object on installation.
1486 Handle<Object> code_object_;
1488 // Helper functions for generating invokes.
1489 void InvokePrologue(const ParameterCount& expected,
1490 const ParameterCount& actual,
1491 Handle<Code> code_constant,
1492 Register code_register,
1494 bool* definitely_mismatches,
1496 Label::Distance near_jump = Label::kFar,
1497 const CallWrapper& call_wrapper = NullCallWrapper());
1499 void EnterExitFramePrologue(bool save_rax);
1501 // Allocates arg_stack_space * kPointerSize memory (not GCed) on the stack
1502 // accessible via StackSpaceOperand.
1503 void EnterExitFrameEpilogue(int arg_stack_space, bool save_doubles);
1505 void LeaveExitFrameEpilogue(bool restore_context);
1507 // Allocation support helpers.
1508 // Loads the top of new-space into the result register.
1509 // Otherwise the address of the new-space top is loaded into scratch (if
1510 // scratch is valid), and the new-space top is loaded into result.
1511 void LoadAllocationTopHelper(Register result,
1513 AllocationFlags flags);
1515 void MakeSureDoubleAlignedHelper(Register result,
1518 AllocationFlags flags);
1520 // Update allocation top with value in result_end register.
1521 // If scratch is valid, it contains the address of the allocation top.
1522 void UpdateAllocationTopHelper(Register result_end,
1524 AllocationFlags flags);
1526 // Helper for implementing JumpIfNotInNewSpace and JumpIfInNewSpace.
1527 void InNewSpace(Register object,
1531 Label::Distance distance = Label::kFar);
1533 // Helper for finding the mark bits for an address. Afterwards, the
1534 // bitmap register points at the word with the mark bits and the mask
1535 // the position of the first bit. Uses rcx as scratch and leaves addr_reg
1537 inline void GetMarkBits(Register addr_reg,
1538 Register bitmap_reg,
1541 // Helper for throwing exceptions. Compute a handler address and jump to
1542 // it. See the implementation for register usage.
1543 void JumpToHandlerEntry();
1545 // Compute memory operands for safepoint stack slots.
1546 Operand SafepointRegisterSlot(Register reg);
1547 static int SafepointRegisterStackIndex(int reg_code) {
1548 return kNumSafepointRegisters - kSafepointPushRegisterIndices[reg_code] - 1;
1551 // Needs access to SafepointRegisterStackIndex for compiled frame
1553 friend class StandardFrame;
1557 // The code patcher is used to patch (typically) small parts of code e.g. for
1558 // debugging and other types of instrumentation. When using the code patcher
1559 // the exact number of bytes specified must be emitted. Is not legal to emit
1560 // relocation information. If any of these constraints are violated it causes
1564 CodePatcher(byte* address, int size);
1565 virtual ~CodePatcher();
1567 // Macro assembler to emit code.
1568 MacroAssembler* masm() { return &masm_; }
1571 byte* address_; // The address of the code being patched.
1572 int size_; // Number of bytes of the expected patch size.
1573 MacroAssembler masm_; // Macro assembler used to generate the code.
1577 // -----------------------------------------------------------------------------
1578 // Static helper functions.
1580 // Generate an Operand for loading a field from an object.
1581 inline Operand FieldOperand(Register object, int offset) {
1582 return Operand(object, offset - kHeapObjectTag);
1586 // Generate an Operand for loading an indexed field from an object.
1587 inline Operand FieldOperand(Register object,
1591 return Operand(object, index, scale, offset - kHeapObjectTag);
1595 inline Operand ContextOperand(Register context, int index) {
1596 return Operand(context, Context::SlotOffset(index));
1600 inline Operand GlobalObjectOperand() {
1601 return ContextOperand(rsi, Context::GLOBAL_OBJECT_INDEX);
1605 // Provides access to exit frame stack space (not GCed).
1606 inline Operand StackSpaceOperand(int index) {
1608 const int kShaddowSpace = 4;
1609 return Operand(rsp, (index + kShaddowSpace) * kPointerSize);
1611 return Operand(rsp, index * kPointerSize);
1616 inline Operand StackOperandForReturnAddress(int32_t disp) {
1617 return Operand(rsp, disp);
1621 #ifdef GENERATED_CODE_COVERAGE
1622 extern void LogGeneratedCodeCoverage(const char* file_line);
1623 #define CODE_COVERAGE_STRINGIFY(x) #x
1624 #define CODE_COVERAGE_TOSTRING(x) CODE_COVERAGE_STRINGIFY(x)
1625 #define __FILE_LINE__ __FILE__ ":" CODE_COVERAGE_TOSTRING(__LINE__)
1626 #define ACCESS_MASM(masm) { \
1627 Address x64_coverage_function = FUNCTION_ADDR(LogGeneratedCodeCoverage); \
1630 masm->Push(Immediate(reinterpret_cast<int>(&__FILE_LINE__))); \
1631 masm->Call(x64_coverage_function, RelocInfo::EXTERNAL_REFERENCE); \
1638 #define ACCESS_MASM(masm) masm->
1641 } } // namespace v8::internal
1643 #endif // V8_X64_MACRO_ASSEMBLER_X64_H_