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_X87_MACRO_ASSEMBLER_X87_H_
6 #define V8_X87_MACRO_ASSEMBLER_X87_H_
8 #include "src/assembler.h"
9 #include "src/bailout-reason.h"
10 #include "src/frames.h"
11 #include "src/globals.h"
16 // Convenience for platform-independent signatures. We do not normally
17 // distinguish memory operands from other operands on ia32.
18 typedef Operand MemOperand;
20 enum RememberedSetAction { EMIT_REMEMBERED_SET, OMIT_REMEMBERED_SET };
21 enum SmiCheck { INLINE_SMI_CHECK, OMIT_SMI_CHECK };
22 enum PointersToHereCheck {
23 kPointersToHereMaybeInteresting,
24 kPointersToHereAreAlwaysInteresting
28 enum RegisterValueType {
29 REGISTER_VALUE_IS_SMI,
30 REGISTER_VALUE_IS_INT32
35 bool AreAliased(Register reg1,
37 Register reg3 = no_reg,
38 Register reg4 = no_reg,
39 Register reg5 = no_reg,
40 Register reg6 = no_reg,
41 Register reg7 = no_reg,
42 Register reg8 = no_reg);
46 // MacroAssembler implements a collection of frequently used macros.
47 class MacroAssembler: public Assembler {
49 // The isolate parameter can be NULL if the macro assembler should
50 // not use isolate-dependent functionality. In this case, it's the
51 // responsibility of the caller to never invoke such function on the
53 MacroAssembler(Isolate* isolate, void* buffer, int size);
55 void Load(Register dst, const Operand& src, Representation r);
56 void Store(Register src, const Operand& dst, Representation r);
58 // Operations on roots in the root-array.
59 void LoadRoot(Register destination, Heap::RootListIndex index);
60 void StoreRoot(Register source, Register scratch, Heap::RootListIndex index);
61 void CompareRoot(Register with, Register scratch, Heap::RootListIndex index);
62 // These methods can only be used with constant roots (i.e. non-writable
63 // and not in new space).
64 void CompareRoot(Register with, Heap::RootListIndex index);
65 void CompareRoot(const Operand& with, Heap::RootListIndex index);
67 // ---------------------------------------------------------------------------
69 enum RememberedSetFinalAction {
74 // Record in the remembered set the fact that we have a pointer to new space
75 // at the address pointed to by the addr register. Only works if addr is not
77 void RememberedSetHelper(Register object, // Used for debug code.
78 Register addr, Register scratch,
79 SaveFPRegsMode save_fp,
80 RememberedSetFinalAction and_then);
82 void CheckPageFlag(Register object,
87 Label::Distance condition_met_distance = Label::kFar);
89 void CheckPageFlagForMap(
94 Label::Distance condition_met_distance = Label::kFar);
96 // Check if object is in new space. Jumps if the object is not in new space.
97 // The register scratch can be object itself, but scratch will be clobbered.
98 void JumpIfNotInNewSpace(Register object,
101 Label::Distance distance = Label::kFar) {
102 InNewSpace(object, scratch, zero, branch, distance);
105 // Check if object is in new space. Jumps if the object is in new space.
106 // The register scratch can be object itself, but it will be clobbered.
107 void JumpIfInNewSpace(Register object,
110 Label::Distance distance = Label::kFar) {
111 InNewSpace(object, scratch, not_zero, branch, distance);
114 // Check if an object has a given incremental marking color. Also uses ecx!
115 void HasColor(Register object,
119 Label::Distance has_color_distance,
123 void JumpIfBlack(Register object,
127 Label::Distance on_black_distance = Label::kFar);
129 // Checks the color of an object. If the object is already grey or black
130 // then we just fall through, since it is already live. If it is white and
131 // we can determine that it doesn't need to be scanned, then we just mark it
132 // black and fall through. For the rest we jump to the label so the
133 // incremental marker can fix its assumptions.
134 void EnsureNotWhite(Register object,
137 Label* object_is_white_and_not_data,
138 Label::Distance distance);
140 // Notify the garbage collector that we wrote a pointer into an object.
141 // |object| is the object being stored into, |value| is the object being
142 // stored. value and scratch registers are clobbered by the operation.
143 // The offset is the offset from the start of the object, not the offset from
144 // the tagged HeapObject pointer. For use with FieldOperand(reg, off).
145 void RecordWriteField(
146 Register object, int offset, Register value, Register scratch,
147 SaveFPRegsMode save_fp,
148 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
149 SmiCheck smi_check = INLINE_SMI_CHECK,
150 PointersToHereCheck pointers_to_here_check_for_value =
151 kPointersToHereMaybeInteresting);
153 // As above, but the offset has the tag presubtracted. For use with
154 // Operand(reg, off).
155 void RecordWriteContextSlot(
156 Register context, int offset, Register value, Register scratch,
157 SaveFPRegsMode save_fp,
158 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
159 SmiCheck smi_check = INLINE_SMI_CHECK,
160 PointersToHereCheck pointers_to_here_check_for_value =
161 kPointersToHereMaybeInteresting) {
162 RecordWriteField(context, offset + kHeapObjectTag, value, scratch, save_fp,
163 remembered_set_action, smi_check,
164 pointers_to_here_check_for_value);
167 // Notify the garbage collector that we wrote a pointer into a fixed array.
168 // |array| is the array being stored into, |value| is the
169 // object being stored. |index| is the array index represented as a
170 // Smi. All registers are clobbered by the operation RecordWriteArray
171 // filters out smis so it does not update the write barrier if the
173 void RecordWriteArray(
174 Register array, Register value, Register index, SaveFPRegsMode save_fp,
175 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
176 SmiCheck smi_check = INLINE_SMI_CHECK,
177 PointersToHereCheck pointers_to_here_check_for_value =
178 kPointersToHereMaybeInteresting);
180 // For page containing |object| mark region covering |address|
181 // dirty. |object| is the object being stored into, |value| is the
182 // object being stored. The address and value registers are clobbered by the
183 // operation. RecordWrite filters out smis so it does not update the
184 // write barrier if the value is a smi.
186 Register object, Register address, Register value, SaveFPRegsMode save_fp,
187 RememberedSetAction remembered_set_action = EMIT_REMEMBERED_SET,
188 SmiCheck smi_check = INLINE_SMI_CHECK,
189 PointersToHereCheck pointers_to_here_check_for_value =
190 kPointersToHereMaybeInteresting);
192 // For page containing |object| mark the region covering the object's map
193 // dirty. |object| is the object being stored into, |map| is the Map object
195 void RecordWriteForMap(Register object, Handle<Map> map, Register scratch1,
196 Register scratch2, SaveFPRegsMode save_fp);
198 // ---------------------------------------------------------------------------
203 // Generates function and stub prologue code.
205 void Prologue(bool code_pre_aging);
207 // Enter specific kind of exit frame. Expects the number of
208 // arguments in register eax and sets up the number of arguments in
209 // register edi and the pointer to the first argument in register
211 void EnterExitFrame(bool save_doubles);
213 void EnterApiExitFrame(int argc);
215 // Leave the current exit frame. Expects the return value in
216 // register eax:edx (untouched) and the pointer to the first
217 // argument in register esi.
218 void LeaveExitFrame(bool save_doubles);
220 // Leave the current exit frame. Expects the return value in
221 // register eax (untouched).
222 void LeaveApiExitFrame(bool restore_context);
224 // Find the function context up the context chain.
225 void LoadContext(Register dst, int context_chain_length);
227 // Conditionally load the cached Array transitioned map of type
228 // transitioned_kind from the native context if the map in register
229 // map_in_out is the cached Array map in the native context of
231 void LoadTransitionedArrayMapConditional(
232 ElementsKind expected_kind,
233 ElementsKind transitioned_kind,
236 Label* no_map_match);
238 // Load the global function with the given index.
239 void LoadGlobalFunction(int index, Register function);
241 // Load the initial map from the global function. The registers
242 // function and map can be the same.
243 void LoadGlobalFunctionInitialMap(Register function, Register map);
245 // Push and pop the registers that can hold pointers.
246 void PushSafepointRegisters() { pushad(); }
247 void PopSafepointRegisters() { popad(); }
248 // Store the value in register/immediate src in the safepoint
249 // register stack slot for register dst.
250 void StoreToSafepointRegisterSlot(Register dst, Register src);
251 void StoreToSafepointRegisterSlot(Register dst, Immediate src);
252 void LoadFromSafepointRegisterSlot(Register dst, Register src);
254 void LoadHeapObject(Register result, Handle<HeapObject> object);
255 void CmpHeapObject(Register reg, Handle<HeapObject> object);
256 void PushHeapObject(Handle<HeapObject> object);
258 void LoadObject(Register result, Handle<Object> object) {
259 AllowDeferredHandleDereference heap_object_check;
260 if (object->IsHeapObject()) {
261 LoadHeapObject(result, Handle<HeapObject>::cast(object));
263 Move(result, Immediate(object));
267 void CmpObject(Register reg, Handle<Object> object) {
268 AllowDeferredHandleDereference heap_object_check;
269 if (object->IsHeapObject()) {
270 CmpHeapObject(reg, Handle<HeapObject>::cast(object));
272 cmp(reg, Immediate(object));
276 void CmpWeakValue(Register value, Handle<WeakCell> cell, Register scratch);
277 void GetWeakValue(Register value, Handle<WeakCell> cell);
278 void LoadWeakValue(Register value, Handle<WeakCell> cell, Label* miss);
280 // ---------------------------------------------------------------------------
281 // JavaScript invokes
283 // Invoke the JavaScript function code by either calling or jumping.
284 void InvokeCode(Register code,
285 const ParameterCount& expected,
286 const ParameterCount& actual,
288 const CallWrapper& call_wrapper) {
289 InvokeCode(Operand(code), expected, actual, flag, call_wrapper);
292 void InvokeCode(const Operand& code,
293 const ParameterCount& expected,
294 const ParameterCount& actual,
296 const CallWrapper& call_wrapper);
298 // Invoke the JavaScript function in the given register. Changes the
299 // current context to the context in the function before invoking.
300 void InvokeFunction(Register function,
301 const ParameterCount& actual,
303 const CallWrapper& call_wrapper);
305 void InvokeFunction(Register function,
306 const ParameterCount& expected,
307 const ParameterCount& actual,
309 const CallWrapper& call_wrapper);
311 void InvokeFunction(Handle<JSFunction> function,
312 const ParameterCount& expected,
313 const ParameterCount& actual,
315 const CallWrapper& call_wrapper);
317 // Invoke specified builtin JavaScript function. Adds an entry to
318 // the unresolved list if the name does not resolve.
319 void InvokeBuiltin(Builtins::JavaScript id,
321 const CallWrapper& call_wrapper = NullCallWrapper());
323 // Store the function for the given builtin in the target register.
324 void GetBuiltinFunction(Register target, Builtins::JavaScript id);
326 // Store the code object for the given builtin in the target register.
327 void GetBuiltinEntry(Register target, Builtins::JavaScript id);
329 // Expression support
330 // Support for constant splitting.
331 bool IsUnsafeImmediate(const Immediate& x);
332 void SafeMove(Register dst, const Immediate& x);
333 void SafePush(const Immediate& x);
335 // Compare object type for heap object.
336 // Incoming register is heap_object and outgoing register is map.
337 void CmpObjectType(Register heap_object, InstanceType type, Register map);
339 // Compare instance type for map.
340 void CmpInstanceType(Register map, InstanceType type);
342 // Check if a map for a JSObject indicates that the object has fast elements.
343 // Jump to the specified label if it does not.
344 void CheckFastElements(Register map,
346 Label::Distance distance = Label::kFar);
348 // Check if a map for a JSObject indicates that the object can have both smi
349 // and HeapObject elements. Jump to the specified label if it does not.
350 void CheckFastObjectElements(Register map,
352 Label::Distance distance = Label::kFar);
354 // Check if a map for a JSObject indicates that the object has fast smi only
355 // elements. Jump to the specified label if it does not.
356 void CheckFastSmiElements(Register map,
358 Label::Distance distance = Label::kFar);
360 // Check to see if maybe_number can be stored as a double in
361 // FastDoubleElements. If it can, store it at the index specified by key in
362 // the FastDoubleElements array elements, otherwise jump to fail.
363 void StoreNumberToDoubleElements(Register maybe_number,
370 // Compare an object's map with the specified map.
371 void CompareMap(Register obj, Handle<Map> map);
373 // Check if the map of an object is equal to a specified map and branch to
374 // label if not. Skip the smi check if not required (object is known to be a
375 // heap object). If mode is ALLOW_ELEMENT_TRANSITION_MAPS, then also match
376 // against maps that are ElementsKind transition maps of the specified map.
377 void CheckMap(Register obj,
380 SmiCheckType smi_check_type);
382 // Check if the map of an object is equal to a specified weak map and branch
383 // to a specified target if equal. Skip the smi check if not required
384 // (object is known to be a heap object)
385 void DispatchWeakMap(Register obj, Register scratch1, Register scratch2,
386 Handle<WeakCell> cell, Handle<Code> success,
387 SmiCheckType smi_check_type);
389 // Check if the object in register heap_object is a string. Afterwards the
390 // register map contains the object map and the register instance_type
391 // contains the instance_type. The registers map and instance_type can be the
392 // same in which case it contains the instance type afterwards. Either of the
393 // registers map and instance_type can be the same as heap_object.
394 Condition IsObjectStringType(Register heap_object,
396 Register instance_type);
398 // Check if the object in register heap_object is a name. Afterwards the
399 // register map contains the object map and the register instance_type
400 // contains the instance_type. The registers map and instance_type can be the
401 // same in which case it contains the instance type afterwards. Either of the
402 // registers map and instance_type can be the same as heap_object.
403 Condition IsObjectNameType(Register heap_object,
405 Register instance_type);
407 // Check if a heap object's type is in the JSObject range, not including
408 // JSFunction. The object's map will be loaded in the map register.
409 // Any or all of the three registers may be the same.
410 // The contents of the scratch register will always be overwritten.
411 void IsObjectJSObjectType(Register heap_object,
416 // The contents of the scratch register will be overwritten.
417 void IsInstanceJSObjectType(Register map, Register scratch, Label* fail);
419 // FCmp is similar to integer cmp, but requires unsigned
420 // jcc instructions (je, ja, jae, jb, jbe, je, and jz).
422 void FXamMinusZero();
425 void X87SetRC(int rc);
426 void X87SetFPUCW(int cw);
428 void ClampUint8(Register reg);
429 void ClampTOSToUint8(Register result_reg);
431 void SlowTruncateToI(Register result_reg, Register input_reg,
432 int offset = HeapNumber::kValueOffset - kHeapObjectTag);
434 void TruncateHeapNumberToI(Register result_reg, Register input_reg);
435 void TruncateX87TOSToI(Register result_reg);
437 void X87TOSToI(Register result_reg, MinusZeroMode minus_zero_mode,
438 Label* lost_precision, Label* is_nan, Label* minus_zero,
439 Label::Distance dst = Label::kFar);
441 // Smi tagging support.
442 void SmiTag(Register reg) {
443 STATIC_ASSERT(kSmiTag == 0);
444 STATIC_ASSERT(kSmiTagSize == 1);
447 void SmiUntag(Register reg) {
448 sar(reg, kSmiTagSize);
451 // Modifies the register even if it does not contain a Smi!
452 void SmiUntag(Register reg, Label* is_smi) {
453 STATIC_ASSERT(kSmiTagSize == 1);
454 sar(reg, kSmiTagSize);
455 STATIC_ASSERT(kSmiTag == 0);
456 j(not_carry, is_smi);
459 void LoadUint32NoSSE2(Register src) {
460 LoadUint32NoSSE2(Operand(src));
462 void LoadUint32NoSSE2(const Operand& src);
464 // Jump the register contains a smi.
465 inline void JumpIfSmi(Register value,
467 Label::Distance distance = Label::kFar) {
468 test(value, Immediate(kSmiTagMask));
469 j(zero, smi_label, distance);
471 // Jump if the operand is a smi.
472 inline void JumpIfSmi(Operand value,
474 Label::Distance distance = Label::kFar) {
475 test(value, Immediate(kSmiTagMask));
476 j(zero, smi_label, distance);
478 // Jump if register contain a non-smi.
479 inline void JumpIfNotSmi(Register value,
480 Label* not_smi_label,
481 Label::Distance distance = Label::kFar) {
482 test(value, Immediate(kSmiTagMask));
483 j(not_zero, not_smi_label, distance);
486 void LoadInstanceDescriptors(Register map, Register descriptors);
487 void EnumLength(Register dst, Register map);
488 void NumberOfOwnDescriptors(Register dst, Register map);
489 void LoadAccessor(Register dst, Register holder, int accessor_index,
490 AccessorComponent accessor);
492 template<typename Field>
493 void DecodeField(Register reg) {
494 static const int shift = Field::kShift;
495 static const int mask = Field::kMask >> Field::kShift;
499 and_(reg, Immediate(mask));
502 template<typename Field>
503 void DecodeFieldToSmi(Register reg) {
504 static const int shift = Field::kShift;
505 static const int mask = (Field::kMask >> Field::kShift) << kSmiTagSize;
506 STATIC_ASSERT((mask & (0x80000000u >> (kSmiTagSize - 1))) == 0);
507 STATIC_ASSERT(kSmiTag == 0);
508 if (shift < kSmiTagSize) {
509 shl(reg, kSmiTagSize - shift);
510 } else if (shift > kSmiTagSize) {
511 sar(reg, shift - kSmiTagSize);
513 and_(reg, Immediate(mask));
516 // Abort execution if argument is not a number, enabled via --debug-code.
517 void AssertNumber(Register object);
519 // Abort execution if argument is not a smi, enabled via --debug-code.
520 void AssertSmi(Register object);
522 // Abort execution if argument is a smi, enabled via --debug-code.
523 void AssertNotSmi(Register object);
525 // Abort execution if argument is not a string, enabled via --debug-code.
526 void AssertString(Register object);
528 // Abort execution if argument is not a name, enabled via --debug-code.
529 void AssertName(Register object);
531 // Abort execution if argument is not undefined or an AllocationSite, enabled
533 void AssertUndefinedOrAllocationSite(Register object);
535 // ---------------------------------------------------------------------------
536 // Exception handling
538 // Push a new stack handler and link it into stack handler chain.
539 void PushStackHandler();
541 // Unlink the stack handler on top of the stack from the stack handler chain.
542 void PopStackHandler();
544 // ---------------------------------------------------------------------------
545 // Inline caching support
547 // Generate code for checking access rights - used for security checks
548 // on access to global objects across environments. The holder register
549 // is left untouched, but the scratch register is clobbered.
550 void CheckAccessGlobalProxy(Register holder_reg,
555 void GetNumberHash(Register r0, Register scratch);
557 void LoadFromNumberDictionary(Label* miss,
566 // ---------------------------------------------------------------------------
567 // Allocation support
569 // Allocate an object in new space or old space. If the given space
570 // is exhausted control continues at the gc_required label. The allocated
571 // object is returned in result and end of the new object is returned in
572 // result_end. The register scratch can be passed as no_reg in which case
573 // an additional object reference will be added to the reloc info. The
574 // returned pointers in result and result_end have not yet been tagged as
575 // heap objects. If result_contains_top_on_entry is true the content of
576 // result is known to be the allocation top on entry (could be result_end
577 // from a previous call). If result_contains_top_on_entry is true scratch
578 // should be no_reg as it is never used.
579 void Allocate(int object_size,
584 AllocationFlags flags);
586 void Allocate(int header_size,
587 ScaleFactor element_size,
588 Register element_count,
589 RegisterValueType element_count_type,
594 AllocationFlags flags);
596 void Allocate(Register object_size,
601 AllocationFlags flags);
603 // Allocate a heap number in new space with undefined value. The
604 // register scratch2 can be passed as no_reg; the others must be
605 // valid registers. Returns tagged pointer in result register, or
606 // jumps to gc_required if new space is full.
607 void AllocateHeapNumber(Register result,
611 MutableMode mode = IMMUTABLE);
613 // Allocate a sequential string. All the header fields of the string object
615 void AllocateTwoByteString(Register result,
621 void AllocateOneByteString(Register result, Register length,
622 Register scratch1, Register scratch2,
623 Register scratch3, Label* gc_required);
624 void AllocateOneByteString(Register result, int length, Register scratch1,
625 Register scratch2, Label* gc_required);
627 // Allocate a raw cons string object. Only the map field of the result is
629 void AllocateTwoByteConsString(Register result,
633 void AllocateOneByteConsString(Register result, Register scratch1,
634 Register scratch2, Label* gc_required);
636 // Allocate a raw sliced string object. Only the map field of the result is
638 void AllocateTwoByteSlicedString(Register result,
642 void AllocateOneByteSlicedString(Register result, Register scratch1,
643 Register scratch2, Label* gc_required);
645 // Copy memory, byte-by-byte, from source to destination. Not optimized for
646 // long or aligned copies.
647 // The contents of index and scratch are destroyed.
648 void CopyBytes(Register source,
649 Register destination,
653 // Initialize fields with filler values. Fields starting at |start_offset|
654 // not including end_offset are overwritten with the value in |filler|. At
655 // the end the loop, |start_offset| takes the value of |end_offset|.
656 void InitializeFieldsWithFiller(Register start_offset,
660 // ---------------------------------------------------------------------------
661 // Support functions.
663 // Check a boolean-bit of a Smi field.
664 void BooleanBitTest(Register object, int field_offset, int bit_index);
666 // Check if result is zero and op is negative.
667 void NegativeZeroTest(Register result, Register op, Label* then_label);
669 // Check if result is zero and any of op1 and op2 are negative.
670 // Register scratch is destroyed, and it must be different from op2.
671 void NegativeZeroTest(Register result, Register op1, Register op2,
672 Register scratch, Label* then_label);
674 // Machine code version of Map::GetConstructor().
675 // |temp| holds |result|'s map when done.
676 void GetMapConstructor(Register result, Register map, Register temp);
678 // Try to get function prototype of a function and puts the value in
679 // the result register. Checks that the function really is a
680 // function and jumps to the miss label if the fast checks fail. The
681 // function register will be untouched; the other registers may be
683 void TryGetFunctionPrototype(Register function,
687 bool miss_on_bound_function = false);
689 // Picks out an array index from the hash field.
691 // hash - holds the index's hash. Clobbered.
692 // index - holds the overwritten index on exit.
693 void IndexFromHash(Register hash, Register index);
695 // ---------------------------------------------------------------------------
698 // Call a code stub. Generate the code if necessary.
699 void CallStub(CodeStub* stub, TypeFeedbackId ast_id = TypeFeedbackId::None());
701 // Tail call a code stub (jump). Generate the code if necessary.
702 void TailCallStub(CodeStub* stub);
704 // Return from a code stub after popping its arguments.
705 void StubReturn(int argc);
707 // Call a runtime routine.
708 void CallRuntime(const Runtime::Function* f, int num_arguments,
709 SaveFPRegsMode save_doubles = kDontSaveFPRegs);
710 void CallRuntimeSaveDoubles(Runtime::FunctionId id) {
711 const Runtime::Function* function = Runtime::FunctionForId(id);
712 CallRuntime(function, function->nargs, kSaveFPRegs);
715 // Convenience function: Same as above, but takes the fid instead.
716 void CallRuntime(Runtime::FunctionId id, int num_arguments,
717 SaveFPRegsMode save_doubles = kDontSaveFPRegs) {
718 CallRuntime(Runtime::FunctionForId(id), num_arguments, save_doubles);
721 // Convenience function: call an external reference.
722 void CallExternalReference(ExternalReference ref, int num_arguments);
724 // Tail call of a runtime routine (jump).
725 // Like JumpToExternalReference, but also takes care of passing the number
727 void TailCallExternalReference(const ExternalReference& ext,
731 // Convenience function: tail call a runtime routine (jump).
732 void TailCallRuntime(Runtime::FunctionId fid,
736 // Before calling a C-function from generated code, align arguments on stack.
737 // After aligning the frame, arguments must be stored in esp[0], esp[4],
738 // etc., not pushed. The argument count assumes all arguments are word sized.
739 // Some compilers/platforms require the stack to be aligned when calling
741 // Needs a scratch register to do some arithmetic. This register will be
743 void PrepareCallCFunction(int num_arguments, Register scratch);
745 // Calls a C function and cleans up the space for arguments allocated
746 // by PrepareCallCFunction. The called function is not allowed to trigger a
747 // garbage collection, since that might move the code and invalidate the
748 // return address (unless this is somehow accounted for by the called
750 void CallCFunction(ExternalReference function, int num_arguments);
751 void CallCFunction(Register function, int num_arguments);
753 // Jump to a runtime routine.
754 void JumpToExternalReference(const ExternalReference& ext);
756 // ---------------------------------------------------------------------------
761 // Return and drop arguments from stack, where the number of arguments
762 // may be bigger than 2^16 - 1. Requires a scratch register.
763 void Ret(int bytes_dropped, Register scratch);
765 // Emit code to discard a non-negative number of pointer-sized elements
766 // from the stack, clobbering only the esp register.
767 void Drop(int element_count);
769 void Call(Label* target) { call(target); }
770 void Push(Register src) { push(src); }
771 void Pop(Register dst) { pop(dst); }
773 void Lzcnt(Register dst, Register src) { Lzcnt(dst, Operand(src)); }
774 void Lzcnt(Register dst, const Operand& src);
776 // Emit call to the code we are currently generating.
778 Handle<Code> self(reinterpret_cast<Code**>(CodeObject().location()));
779 call(self, RelocInfo::CODE_TARGET);
782 // Move if the registers are not identical.
783 void Move(Register target, Register source);
785 // Move a constant into a destination using the most efficient encoding.
786 void Move(Register dst, const Immediate& x);
787 void Move(const Operand& dst, const Immediate& x);
789 // Push a handle value.
790 void Push(Handle<Object> handle) { push(Immediate(handle)); }
791 void Push(Smi* smi) { Push(Handle<Smi>(smi, isolate())); }
793 Handle<Object> CodeObject() {
794 DCHECK(!code_object_.is_null());
798 // Insert code to verify that the x87 stack has the specified depth (0-7)
799 void VerifyX87StackDepth(uint32_t depth);
801 // Emit code for a truncating division by a constant. The dividend register is
802 // unchanged, the result is in edx, and eax gets clobbered.
803 void TruncatingDiv(Register dividend, int32_t divisor);
805 // ---------------------------------------------------------------------------
806 // StatsCounter support
808 void SetCounter(StatsCounter* counter, int value);
809 void IncrementCounter(StatsCounter* counter, int value);
810 void DecrementCounter(StatsCounter* counter, int value);
811 void IncrementCounter(Condition cc, StatsCounter* counter, int value);
812 void DecrementCounter(Condition cc, StatsCounter* counter, int value);
815 // ---------------------------------------------------------------------------
818 // Calls Abort(msg) if the condition cc is not satisfied.
819 // Use --debug_code to enable.
820 void Assert(Condition cc, BailoutReason reason);
822 void AssertFastElements(Register elements);
824 // Like Assert(), but always enabled.
825 void Check(Condition cc, BailoutReason reason);
827 // Print a message to stdout and abort execution.
828 void Abort(BailoutReason reason);
830 // Check that the stack is aligned.
831 void CheckStackAlignment();
833 // Verify restrictions about code generated in stubs.
834 void set_generating_stub(bool value) { generating_stub_ = value; }
835 bool generating_stub() { return generating_stub_; }
836 void set_has_frame(bool value) { has_frame_ = value; }
837 bool has_frame() { return has_frame_; }
838 inline bool AllowThisStubCall(CodeStub* stub);
840 // ---------------------------------------------------------------------------
843 // Generate code to do a lookup in the number string cache. If the number in
844 // the register object is found in the cache the generated code falls through
845 // with the result in the result register. The object and the result register
846 // can be the same. If the number is not found in the cache the code jumps to
847 // the label not_found with only the content of register object unchanged.
848 void LookupNumberStringCache(Register object,
854 // Check whether the instance type represents a flat one-byte string. Jump to
855 // the label if not. If the instance type can be scratched specify same
856 // register for both instance type and scratch.
857 void JumpIfInstanceTypeIsNotSequentialOneByte(
858 Register instance_type, Register scratch,
859 Label* on_not_flat_one_byte_string);
861 // Checks if both objects are sequential one-byte strings, and jumps to label
863 void JumpIfNotBothSequentialOneByteStrings(
864 Register object1, Register object2, Register scratch1, Register scratch2,
865 Label* on_not_flat_one_byte_strings);
867 // Checks if the given register or operand is a unique name
868 void JumpIfNotUniqueNameInstanceType(Register reg, Label* not_unique_name,
869 Label::Distance distance = Label::kFar) {
870 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance);
873 void JumpIfNotUniqueNameInstanceType(Operand operand, Label* not_unique_name,
874 Label::Distance distance = Label::kFar);
876 void EmitSeqStringSetCharCheck(Register string,
879 uint32_t encoding_mask);
881 static int SafepointRegisterStackIndex(Register reg) {
882 return SafepointRegisterStackIndex(reg.code());
885 // Activation support.
886 void EnterFrame(StackFrame::Type type);
887 void EnterFrame(StackFrame::Type type, bool load_constant_pool_pointer_reg);
888 void LeaveFrame(StackFrame::Type type);
890 // Expects object in eax and returns map with validated enum cache
891 // in eax. Assumes that any other register can be used as a scratch.
892 void CheckEnumCache(Label* call_runtime);
894 // AllocationMemento support. Arrays may have an associated
895 // AllocationMemento object that can be checked for in order to pretransition
897 // On entry, receiver_reg should point to the array object.
898 // scratch_reg gets clobbered.
899 // If allocation info is present, conditional code is set to equal.
900 void TestJSArrayForAllocationMemento(Register receiver_reg,
901 Register scratch_reg,
902 Label* no_memento_found);
904 void JumpIfJSArrayHasAllocationMemento(Register receiver_reg,
905 Register scratch_reg,
906 Label* memento_found) {
907 Label no_memento_found;
908 TestJSArrayForAllocationMemento(receiver_reg, scratch_reg,
910 j(equal, memento_found);
911 bind(&no_memento_found);
914 // Jumps to found label if a prototype map has dictionary elements.
915 void JumpIfDictionaryInPrototypeChain(Register object, Register scratch0,
916 Register scratch1, Label* found);
919 bool generating_stub_;
921 // This handle will be patched with the code object on installation.
922 Handle<Object> code_object_;
924 // Helper functions for generating invokes.
925 void InvokePrologue(const ParameterCount& expected,
926 const ParameterCount& actual,
927 Handle<Code> code_constant,
928 const Operand& code_operand,
930 bool* definitely_mismatches,
932 Label::Distance done_distance,
933 const CallWrapper& call_wrapper = NullCallWrapper());
935 void EnterExitFramePrologue();
936 void EnterExitFrameEpilogue(int argc, bool save_doubles);
938 void LeaveExitFrameEpilogue(bool restore_context);
940 // Allocation support helpers.
941 void LoadAllocationTopHelper(Register result,
943 AllocationFlags flags);
945 void UpdateAllocationTopHelper(Register result_end,
947 AllocationFlags flags);
949 // Helper for implementing JumpIfNotInNewSpace and JumpIfInNewSpace.
950 void InNewSpace(Register object,
953 Label* condition_met,
954 Label::Distance condition_met_distance = Label::kFar);
956 // Helper for finding the mark bits for an address. Afterwards, the
957 // bitmap register points at the word with the mark bits and the mask
958 // the position of the first bit. Uses ecx as scratch and leaves addr_reg
960 inline void GetMarkBits(Register addr_reg,
964 // Compute memory operands for safepoint stack slots.
965 Operand SafepointRegisterSlot(Register reg);
966 static int SafepointRegisterStackIndex(int reg_code);
968 // Needs access to SafepointRegisterStackIndex for compiled frame
970 friend class StandardFrame;
974 // The code patcher is used to patch (typically) small parts of code e.g. for
975 // debugging and other types of instrumentation. When using the code patcher
976 // the exact number of bytes specified must be emitted. Is not legal to emit
977 // relocation information. If any of these constraints are violated it causes
981 CodePatcher(byte* address, int size);
984 // Macro assembler to emit code.
985 MacroAssembler* masm() { return &masm_; }
988 byte* address_; // The address of the code being patched.
989 int size_; // Number of bytes of the expected patch size.
990 MacroAssembler masm_; // Macro assembler used to generate the code.
994 // -----------------------------------------------------------------------------
995 // Static helper functions.
997 // Generate an Operand for loading a field from an object.
998 inline Operand FieldOperand(Register object, int offset) {
999 return Operand(object, offset - kHeapObjectTag);
1003 // Generate an Operand for loading an indexed field from an object.
1004 inline Operand FieldOperand(Register object,
1008 return Operand(object, index, scale, offset - kHeapObjectTag);
1012 inline Operand FixedArrayElementOperand(Register array,
1013 Register index_as_smi,
1014 int additional_offset = 0) {
1015 int offset = FixedArray::kHeaderSize + additional_offset * kPointerSize;
1016 return FieldOperand(array, index_as_smi, times_half_pointer_size, offset);
1020 inline Operand ContextOperand(Register context, int index) {
1021 return Operand(context, Context::SlotOffset(index));
1025 inline Operand ContextOperand(Register context, Register index) {
1026 return Operand(context, index, times_pointer_size, Context::SlotOffset(0));
1030 inline Operand GlobalObjectOperand() {
1031 return ContextOperand(esi, Context::GLOBAL_OBJECT_INDEX);
1035 #ifdef GENERATED_CODE_COVERAGE
1036 extern void LogGeneratedCodeCoverage(const char* file_line);
1037 #define CODE_COVERAGE_STRINGIFY(x) #x
1038 #define CODE_COVERAGE_TOSTRING(x) CODE_COVERAGE_STRINGIFY(x)
1039 #define __FILE_LINE__ __FILE__ ":" CODE_COVERAGE_TOSTRING(__LINE__)
1040 #define ACCESS_MASM(masm) { \
1041 byte* ia32_coverage_function = \
1042 reinterpret_cast<byte*>(FUNCTION_ADDR(LogGeneratedCodeCoverage)); \
1045 masm->push(Immediate(reinterpret_cast<int>(&__FILE_LINE__))); \
1046 masm->call(ia32_coverage_function, RelocInfo::RUNTIME_ENTRY); \
1053 #define ACCESS_MASM(masm) masm->
1057 } } // namespace v8::internal
1059 #endif // V8_X87_MACRO_ASSEMBLER_X87_H_