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.
9 #include "src/base/bits.h"
10 #include "src/code-factory.h"
11 #include "src/code-stubs.h"
12 #include "src/codegen.h"
13 #include "src/deoptimizer.h"
14 #include "src/hydrogen-osr.h"
15 #include "src/ic/ic.h"
16 #include "src/ic/stub-cache.h"
17 #include "src/x87/lithium-codegen-x87.h"
23 // When invoking builtins, we need to record the safepoint in the middle of
24 // the invoke instruction sequence generated by the macro assembler.
25 class SafepointGenerator FINAL : public CallWrapper {
27 SafepointGenerator(LCodeGen* codegen,
28 LPointerMap* pointers,
29 Safepoint::DeoptMode mode)
33 virtual ~SafepointGenerator() {}
35 virtual void BeforeCall(int call_size) const OVERRIDE {}
37 virtual void AfterCall() const OVERRIDE {
38 codegen_->RecordSafepoint(pointers_, deopt_mode_);
43 LPointerMap* pointers_;
44 Safepoint::DeoptMode deopt_mode_;
50 bool LCodeGen::GenerateCode() {
51 LPhase phase("Z_Code generation", chunk());
55 // Open a frame scope to indicate that there is a frame on the stack. The
56 // MANUAL indicates that the scope shouldn't actually generate code to set up
57 // the frame (that is done in GeneratePrologue).
58 FrameScope frame_scope(masm_, StackFrame::MANUAL);
60 support_aligned_spilled_doubles_ = info()->IsOptimizing();
62 dynamic_frame_alignment_ = info()->IsOptimizing() &&
63 ((chunk()->num_double_slots() > 2 &&
64 !chunk()->graph()->is_recursive()) ||
65 !info()->osr_ast_id().IsNone());
67 return GeneratePrologue() &&
69 GenerateDeferredCode() &&
70 GenerateJumpTable() &&
71 GenerateSafepointTable();
75 void LCodeGen::FinishCode(Handle<Code> code) {
77 code->set_stack_slots(GetStackSlotCount());
78 code->set_safepoint_table_offset(safepoints_.GetCodeOffset());
79 if (code->is_optimized_code()) RegisterWeakObjectsInOptimizedCode(code);
80 PopulateDeoptimizationData(code);
81 if (!info()->IsStub()) {
82 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code);
88 void LCodeGen::MakeSureStackPagesMapped(int offset) {
89 const int kPageSize = 4 * KB;
90 for (offset -= kPageSize; offset > 0; offset -= kPageSize) {
91 __ mov(Operand(esp, offset), eax);
97 bool LCodeGen::GeneratePrologue() {
98 DCHECK(is_generating());
100 if (info()->IsOptimizing()) {
101 ProfileEntryHookStub::MaybeCallEntryHook(masm_);
104 if (strlen(FLAG_stop_at) > 0 &&
105 info_->function()->name()->IsUtf8EqualTo(CStrVector(FLAG_stop_at))) {
110 // Sloppy mode functions and builtins need to replace the receiver with the
111 // global proxy when called as functions (without an explicit receiver
113 if (info_->this_has_uses() &&
114 info_->strict_mode() == SLOPPY &&
115 !info_->is_native()) {
117 // +1 for return address.
118 int receiver_offset = (scope()->num_parameters() + 1) * kPointerSize;
119 __ mov(ecx, Operand(esp, receiver_offset));
121 __ cmp(ecx, isolate()->factory()->undefined_value());
122 __ j(not_equal, &ok, Label::kNear);
124 __ mov(ecx, GlobalObjectOperand());
125 __ mov(ecx, FieldOperand(ecx, GlobalObject::kGlobalProxyOffset));
127 __ mov(Operand(esp, receiver_offset), ecx);
132 if (support_aligned_spilled_doubles_ && dynamic_frame_alignment_) {
133 // Move state of dynamic frame alignment into edx.
134 __ Move(edx, Immediate(kNoAlignmentPadding));
136 Label do_not_pad, align_loop;
137 STATIC_ASSERT(kDoubleSize == 2 * kPointerSize);
138 // Align esp + 4 to a multiple of 2 * kPointerSize.
139 __ test(esp, Immediate(kPointerSize));
140 __ j(not_zero, &do_not_pad, Label::kNear);
141 __ push(Immediate(0));
143 __ mov(edx, Immediate(kAlignmentPaddingPushed));
144 // Copy arguments, receiver, and return address.
145 __ mov(ecx, Immediate(scope()->num_parameters() + 2));
147 __ bind(&align_loop);
148 __ mov(eax, Operand(ebx, 1 * kPointerSize));
149 __ mov(Operand(ebx, 0), eax);
150 __ add(Operand(ebx), Immediate(kPointerSize));
152 __ j(not_zero, &align_loop, Label::kNear);
153 __ mov(Operand(ebx, 0), Immediate(kAlignmentZapValue));
154 __ bind(&do_not_pad);
158 info()->set_prologue_offset(masm_->pc_offset());
159 if (NeedsEagerFrame()) {
160 DCHECK(!frame_is_built_);
161 frame_is_built_ = true;
162 if (info()->IsStub()) {
165 __ Prologue(info()->IsCodePreAgingActive());
167 info()->AddNoFrameRange(0, masm_->pc_offset());
170 if (info()->IsOptimizing() &&
171 dynamic_frame_alignment_ &&
173 __ test(esp, Immediate(kPointerSize));
174 __ Assert(zero, kFrameIsExpectedToBeAligned);
177 // Reserve space for the stack slots needed by the code.
178 int slots = GetStackSlotCount();
179 DCHECK(slots != 0 || !info()->IsOptimizing());
182 if (dynamic_frame_alignment_) {
185 __ push(Immediate(kNoAlignmentPadding));
188 if (FLAG_debug_code) {
189 __ sub(Operand(esp), Immediate(slots * kPointerSize));
191 MakeSureStackPagesMapped(slots * kPointerSize);
194 __ mov(Operand(eax), Immediate(slots));
197 __ mov(MemOperand(esp, eax, times_4, 0),
198 Immediate(kSlotsZapValue));
200 __ j(not_zero, &loop);
203 __ sub(Operand(esp), Immediate(slots * kPointerSize));
205 MakeSureStackPagesMapped(slots * kPointerSize);
209 if (support_aligned_spilled_doubles_) {
210 Comment(";;; Store dynamic frame alignment tag for spilled doubles");
211 // Store dynamic frame alignment state in the first local.
212 int offset = JavaScriptFrameConstants::kDynamicAlignmentStateOffset;
213 if (dynamic_frame_alignment_) {
214 __ mov(Operand(ebp, offset), edx);
216 __ mov(Operand(ebp, offset), Immediate(kNoAlignmentPadding));
222 // Possibly allocate a local context.
223 int heap_slots = info_->num_heap_slots() - Context::MIN_CONTEXT_SLOTS;
224 if (heap_slots > 0) {
225 Comment(";;; Allocate local context");
226 bool need_write_barrier = true;
227 // Argument to NewContext is the function, which is still in edi.
228 if (heap_slots <= FastNewContextStub::kMaximumSlots) {
229 FastNewContextStub stub(isolate(), heap_slots);
231 // Result of FastNewContextStub is always in new space.
232 need_write_barrier = false;
235 __ CallRuntime(Runtime::kNewFunctionContext, 1);
237 RecordSafepoint(Safepoint::kNoLazyDeopt);
238 // Context is returned in eax. It replaces the context passed to us.
239 // It's saved in the stack and kept live in esi.
241 __ mov(Operand(ebp, StandardFrameConstants::kContextOffset), eax);
243 // Copy parameters into context if necessary.
244 int num_parameters = scope()->num_parameters();
245 for (int i = 0; i < num_parameters; i++) {
246 Variable* var = scope()->parameter(i);
247 if (var->IsContextSlot()) {
248 int parameter_offset = StandardFrameConstants::kCallerSPOffset +
249 (num_parameters - 1 - i) * kPointerSize;
250 // Load parameter from stack.
251 __ mov(eax, Operand(ebp, parameter_offset));
252 // Store it in the context.
253 int context_offset = Context::SlotOffset(var->index());
254 __ mov(Operand(esi, context_offset), eax);
255 // Update the write barrier. This clobbers eax and ebx.
256 if (need_write_barrier) {
257 __ RecordWriteContextSlot(esi, context_offset, eax, ebx,
259 } else if (FLAG_debug_code) {
261 __ JumpIfInNewSpace(esi, eax, &done, Label::kNear);
262 __ Abort(kExpectedNewSpaceObject);
267 Comment(";;; End allocate local context");
270 // Initailize FPU state.
273 if (FLAG_trace && info()->IsOptimizing()) {
274 // We have not executed any compiled code yet, so esi still holds the
276 __ CallRuntime(Runtime::kTraceEnter, 0);
278 return !is_aborted();
282 void LCodeGen::GenerateOsrPrologue() {
283 // Generate the OSR entry prologue at the first unknown OSR value, or if there
284 // are none, at the OSR entrypoint instruction.
285 if (osr_pc_offset_ >= 0) return;
287 osr_pc_offset_ = masm()->pc_offset();
289 // Move state of dynamic frame alignment into edx.
290 __ Move(edx, Immediate(kNoAlignmentPadding));
292 if (support_aligned_spilled_doubles_ && dynamic_frame_alignment_) {
293 Label do_not_pad, align_loop;
294 // Align ebp + 4 to a multiple of 2 * kPointerSize.
295 __ test(ebp, Immediate(kPointerSize));
296 __ j(zero, &do_not_pad, Label::kNear);
297 __ push(Immediate(0));
299 __ mov(edx, Immediate(kAlignmentPaddingPushed));
301 // Move all parts of the frame over one word. The frame consists of:
302 // unoptimized frame slots, alignment state, context, frame pointer, return
303 // address, receiver, and the arguments.
304 __ mov(ecx, Immediate(scope()->num_parameters() +
305 5 + graph()->osr()->UnoptimizedFrameSlots()));
307 __ bind(&align_loop);
308 __ mov(eax, Operand(ebx, 1 * kPointerSize));
309 __ mov(Operand(ebx, 0), eax);
310 __ add(Operand(ebx), Immediate(kPointerSize));
312 __ j(not_zero, &align_loop, Label::kNear);
313 __ mov(Operand(ebx, 0), Immediate(kAlignmentZapValue));
314 __ sub(Operand(ebp), Immediate(kPointerSize));
315 __ bind(&do_not_pad);
318 // Save the first local, which is overwritten by the alignment state.
319 Operand alignment_loc = MemOperand(ebp, -3 * kPointerSize);
320 __ push(alignment_loc);
322 // Set the dynamic frame alignment state.
323 __ mov(alignment_loc, edx);
325 // Adjust the frame size, subsuming the unoptimized frame into the
327 int slots = GetStackSlotCount() - graph()->osr()->UnoptimizedFrameSlots();
329 __ sub(esp, Immediate((slots - 1) * kPointerSize));
331 // Initailize FPU state.
336 void LCodeGen::GenerateBodyInstructionPre(LInstruction* instr) {
337 if (instr->IsCall()) {
338 EnsureSpaceForLazyDeopt(Deoptimizer::patch_size());
340 if (!instr->IsLazyBailout() && !instr->IsGap()) {
341 safepoints_.BumpLastLazySafepointIndex();
343 FlushX87StackIfNecessary(instr);
347 void LCodeGen::GenerateBodyInstructionPost(LInstruction* instr) {
348 // When return from function call, FPU should be initialized again.
349 if (instr->IsCall() && instr->ClobbersDoubleRegisters(isolate())) {
350 bool double_result = instr->HasDoubleRegisterResult();
352 __ lea(esp, Operand(esp, -kDoubleSize));
353 __ fstp_d(Operand(esp, 0));
357 __ fld_d(Operand(esp, 0));
358 __ lea(esp, Operand(esp, kDoubleSize));
361 if (instr->IsGoto()) {
362 x87_stack_.LeavingBlock(current_block_, LGoto::cast(instr), this);
363 } else if (FLAG_debug_code && FLAG_enable_slow_asserts &&
364 !instr->IsGap() && !instr->IsReturn()) {
365 if (instr->ClobbersDoubleRegisters(isolate())) {
366 if (instr->HasDoubleRegisterResult()) {
367 DCHECK_EQ(1, x87_stack_.depth());
369 DCHECK_EQ(0, x87_stack_.depth());
372 __ VerifyX87StackDepth(x87_stack_.depth());
377 bool LCodeGen::GenerateJumpTable() {
379 if (jump_table_.length() > 0) {
380 Comment(";;; -------------------- Jump table --------------------");
382 for (int i = 0; i < jump_table_.length(); i++) {
383 Deoptimizer::JumpTableEntry* table_entry = &jump_table_[i];
384 __ bind(&table_entry->label);
385 Address entry = table_entry->address;
386 DeoptComment(table_entry->reason);
387 if (table_entry->needs_frame) {
388 DCHECK(!info()->saves_caller_doubles());
389 __ push(Immediate(ExternalReference::ForDeoptEntry(entry)));
390 if (needs_frame.is_bound()) {
391 __ jmp(&needs_frame);
393 __ bind(&needs_frame);
394 __ push(MemOperand(ebp, StandardFrameConstants::kContextOffset));
395 // This variant of deopt can only be used with stubs. Since we don't
396 // have a function pointer to install in the stack frame that we're
397 // building, install a special marker there instead.
398 DCHECK(info()->IsStub());
399 __ push(Immediate(Smi::FromInt(StackFrame::STUB)));
400 // Push a PC inside the function so that the deopt code can find where
401 // the deopt comes from. It doesn't have to be the precise return
402 // address of a "calling" LAZY deopt, it only has to be somewhere
403 // inside the code body.
404 Label push_approx_pc;
405 __ call(&push_approx_pc);
406 __ bind(&push_approx_pc);
407 // Push the continuation which was stashed were the ebp should
408 // be. Replace it with the saved ebp.
409 __ push(MemOperand(esp, 3 * kPointerSize));
410 __ mov(MemOperand(esp, 4 * kPointerSize), ebp);
411 __ lea(ebp, MemOperand(esp, 4 * kPointerSize));
412 __ ret(0); // Call the continuation without clobbering registers.
415 __ call(entry, RelocInfo::RUNTIME_ENTRY);
418 return !is_aborted();
422 bool LCodeGen::GenerateDeferredCode() {
423 DCHECK(is_generating());
424 if (deferred_.length() > 0) {
425 for (int i = 0; !is_aborted() && i < deferred_.length(); i++) {
426 LDeferredCode* code = deferred_[i];
427 X87Stack copy(code->x87_stack());
431 instructions_->at(code->instruction_index())->hydrogen_value();
432 RecordAndWritePosition(
433 chunk()->graph()->SourcePositionToScriptPosition(value->position()));
435 Comment(";;; <@%d,#%d> "
436 "-------------------- Deferred %s --------------------",
437 code->instruction_index(),
438 code->instr()->hydrogen_value()->id(),
439 code->instr()->Mnemonic());
440 __ bind(code->entry());
441 if (NeedsDeferredFrame()) {
442 Comment(";;; Build frame");
443 DCHECK(!frame_is_built_);
444 DCHECK(info()->IsStub());
445 frame_is_built_ = true;
446 // Build the frame in such a way that esi isn't trashed.
447 __ push(ebp); // Caller's frame pointer.
448 __ push(Operand(ebp, StandardFrameConstants::kContextOffset));
449 __ push(Immediate(Smi::FromInt(StackFrame::STUB)));
450 __ lea(ebp, Operand(esp, 2 * kPointerSize));
451 Comment(";;; Deferred code");
454 if (NeedsDeferredFrame()) {
455 __ bind(code->done());
456 Comment(";;; Destroy frame");
457 DCHECK(frame_is_built_);
458 frame_is_built_ = false;
462 __ jmp(code->exit());
466 // Deferred code is the last part of the instruction sequence. Mark
467 // the generated code as done unless we bailed out.
468 if (!is_aborted()) status_ = DONE;
469 return !is_aborted();
473 bool LCodeGen::GenerateSafepointTable() {
475 if (!info()->IsStub()) {
476 // For lazy deoptimization we need space to patch a call after every call.
477 // Ensure there is always space for such patching, even if the code ends
479 int target_offset = masm()->pc_offset() + Deoptimizer::patch_size();
480 while (masm()->pc_offset() < target_offset) {
484 safepoints_.Emit(masm(), GetStackSlotCount());
485 return !is_aborted();
489 Register LCodeGen::ToRegister(int index) const {
490 return Register::FromAllocationIndex(index);
494 X87Register LCodeGen::ToX87Register(int index) const {
495 return X87Register::FromAllocationIndex(index);
499 void LCodeGen::X87LoadForUsage(X87Register reg) {
500 DCHECK(x87_stack_.Contains(reg));
501 x87_stack_.Fxch(reg);
506 void LCodeGen::X87LoadForUsage(X87Register reg1, X87Register reg2) {
507 DCHECK(x87_stack_.Contains(reg1));
508 DCHECK(x87_stack_.Contains(reg2));
509 if (reg1.is(reg2) && x87_stack_.depth() == 1) {
510 __ fld(x87_stack_.st(reg1));
511 x87_stack_.push(reg1);
515 x87_stack_.Fxch(reg1, 1);
516 x87_stack_.Fxch(reg2);
523 int LCodeGen::X87Stack::GetLayout() {
524 int layout = stack_depth_;
525 for (int i = 0; i < stack_depth_; i++) {
526 layout |= (stack_[stack_depth_ - 1 - i].code() << ((i + 1) * 3));
533 void LCodeGen::X87Stack::Fxch(X87Register reg, int other_slot) {
535 DCHECK(Contains(reg) && stack_depth_ > other_slot);
536 int i = ArrayIndex(reg);
538 if (st != other_slot) {
539 int other_i = st2idx(other_slot);
540 X87Register other = stack_[other_i];
541 stack_[other_i] = reg;
545 } else if (other_slot == 0) {
556 int LCodeGen::X87Stack::st2idx(int pos) {
557 return stack_depth_ - pos - 1;
561 int LCodeGen::X87Stack::ArrayIndex(X87Register reg) {
562 for (int i = 0; i < stack_depth_; i++) {
563 if (stack_[i].is(reg)) return i;
570 bool LCodeGen::X87Stack::Contains(X87Register reg) {
571 for (int i = 0; i < stack_depth_; i++) {
572 if (stack_[i].is(reg)) return true;
578 void LCodeGen::X87Stack::Free(X87Register reg) {
580 DCHECK(Contains(reg));
581 int i = ArrayIndex(reg);
584 // keep track of how fstp(i) changes the order of elements
585 int tos_i = st2idx(0);
586 stack_[i] = stack_[tos_i];
593 void LCodeGen::X87Mov(X87Register dst, Operand src, X87OperandType opts) {
594 if (x87_stack_.Contains(dst)) {
595 x87_stack_.Fxch(dst);
598 x87_stack_.push(dst);
604 void LCodeGen::X87Mov(X87Register dst, X87Register src, X87OperandType opts) {
605 if (x87_stack_.Contains(dst)) {
606 x87_stack_.Fxch(dst);
609 // Push ST(i) onto the FPU register stack
610 __ fld(x87_stack_.st(src));
611 x87_stack_.push(dst);
613 // Push ST(i) onto the FPU register stack
614 __ fld(x87_stack_.st(src));
615 x87_stack_.push(dst);
620 void LCodeGen::X87Fld(Operand src, X87OperandType opts) {
621 DCHECK(!src.is_reg_only());
623 case kX87DoubleOperand:
626 case kX87FloatOperand:
638 void LCodeGen::X87Mov(Operand dst, X87Register src, X87OperandType opts) {
639 DCHECK(!dst.is_reg_only());
640 x87_stack_.Fxch(src);
642 case kX87DoubleOperand:
645 case kX87FloatOperand:
657 void LCodeGen::X87Stack::PrepareToWrite(X87Register reg) {
662 // Mark this register as the next register to write to
663 stack_[stack_depth_] = reg;
667 void LCodeGen::X87Stack::CommitWrite(X87Register reg) {
669 // Assert the reg is prepared to write, but not on the virtual stack yet
670 DCHECK(!Contains(reg) && stack_[stack_depth_].is(reg) &&
671 stack_depth_ < X87Register::kMaxNumAllocatableRegisters);
676 void LCodeGen::X87PrepareBinaryOp(
677 X87Register left, X87Register right, X87Register result) {
678 // You need to use DefineSameAsFirst for x87 instructions
679 DCHECK(result.is(left));
680 x87_stack_.Fxch(right, 1);
681 x87_stack_.Fxch(left);
685 void LCodeGen::X87Stack::FlushIfNecessary(LInstruction* instr, LCodeGen* cgen) {
686 if (stack_depth_ > 0 && instr->ClobbersDoubleRegisters(isolate())) {
687 bool double_inputs = instr->HasDoubleRegisterInput();
689 // Flush stack from tos down, since FreeX87() will mess with tos
690 for (int i = stack_depth_-1; i >= 0; i--) {
691 X87Register reg = stack_[i];
692 // Skip registers which contain the inputs for the next instruction
693 // when flushing the stack
694 if (double_inputs && instr->IsDoubleInput(reg, cgen)) {
698 if (i < stack_depth_-1) i++;
701 if (instr->IsReturn()) {
702 while (stack_depth_ > 0) {
706 if (FLAG_debug_code && FLAG_enable_slow_asserts) __ VerifyX87StackDepth(0);
711 void LCodeGen::X87Stack::LeavingBlock(int current_block_id, LGoto* goto_instr,
713 // For going to a joined block, an explicit LClobberDoubles is inserted before
714 // LGoto. Because all used x87 registers are spilled to stack slots. The
715 // ResolvePhis phase of register allocator could guarantee the two input's x87
716 // stacks have the same layout. So don't check stack_depth_ <= 1 here.
717 int goto_block_id = goto_instr->block_id();
718 if (current_block_id + 1 != goto_block_id) {
719 // If we have a value on the x87 stack on leaving a block, it must be a
720 // phi input. If the next block we compile is not the join block, we have
721 // to discard the stack state.
722 // Before discarding the stack state, we need to save it if the "goto block"
723 // has unreachable last predecessor when FLAG_unreachable_code_elimination.
724 if (FLAG_unreachable_code_elimination) {
725 int length = goto_instr->block()->predecessors()->length();
726 bool has_unreachable_last_predecessor = false;
727 for (int i = 0; i < length; i++) {
728 HBasicBlock* block = goto_instr->block()->predecessors()->at(i);
729 if (block->IsUnreachable() &&
730 (block->block_id() + 1) == goto_block_id) {
731 has_unreachable_last_predecessor = true;
734 if (has_unreachable_last_predecessor) {
735 if (cgen->x87_stack_map_.find(goto_block_id) ==
736 cgen->x87_stack_map_.end()) {
737 X87Stack* stack = new (cgen->zone()) X87Stack(*this);
738 cgen->x87_stack_map_.insert(std::make_pair(goto_block_id, stack));
743 // Discard the stack state.
749 void LCodeGen::EmitFlushX87ForDeopt() {
750 // The deoptimizer does not support X87 Registers. But as long as we
751 // deopt from a stub its not a problem, since we will re-materialize the
752 // original stub inputs, which can't be double registers.
753 // DCHECK(info()->IsStub());
754 if (FLAG_debug_code && FLAG_enable_slow_asserts) {
756 __ VerifyX87StackDepth(x87_stack_.depth());
760 // Flush X87 stack in the deoptimizer entry.
764 Register LCodeGen::ToRegister(LOperand* op) const {
765 DCHECK(op->IsRegister());
766 return ToRegister(op->index());
770 X87Register LCodeGen::ToX87Register(LOperand* op) const {
771 DCHECK(op->IsDoubleRegister());
772 return ToX87Register(op->index());
776 int32_t LCodeGen::ToInteger32(LConstantOperand* op) const {
777 return ToRepresentation(op, Representation::Integer32());
781 int32_t LCodeGen::ToRepresentation(LConstantOperand* op,
782 const Representation& r) const {
783 HConstant* constant = chunk_->LookupConstant(op);
784 int32_t value = constant->Integer32Value();
785 if (r.IsInteger32()) return value;
786 DCHECK(r.IsSmiOrTagged());
787 return reinterpret_cast<int32_t>(Smi::FromInt(value));
791 Handle<Object> LCodeGen::ToHandle(LConstantOperand* op) const {
792 HConstant* constant = chunk_->LookupConstant(op);
793 DCHECK(chunk_->LookupLiteralRepresentation(op).IsSmiOrTagged());
794 return constant->handle(isolate());
798 double LCodeGen::ToDouble(LConstantOperand* op) const {
799 HConstant* constant = chunk_->LookupConstant(op);
800 DCHECK(constant->HasDoubleValue());
801 return constant->DoubleValue();
805 ExternalReference LCodeGen::ToExternalReference(LConstantOperand* op) const {
806 HConstant* constant = chunk_->LookupConstant(op);
807 DCHECK(constant->HasExternalReferenceValue());
808 return constant->ExternalReferenceValue();
812 bool LCodeGen::IsInteger32(LConstantOperand* op) const {
813 return chunk_->LookupLiteralRepresentation(op).IsSmiOrInteger32();
817 bool LCodeGen::IsSmi(LConstantOperand* op) const {
818 return chunk_->LookupLiteralRepresentation(op).IsSmi();
822 static int ArgumentsOffsetWithoutFrame(int index) {
824 return -(index + 1) * kPointerSize + kPCOnStackSize;
828 Operand LCodeGen::ToOperand(LOperand* op) const {
829 if (op->IsRegister()) return Operand(ToRegister(op));
830 DCHECK(!op->IsDoubleRegister());
831 DCHECK(op->IsStackSlot() || op->IsDoubleStackSlot());
832 if (NeedsEagerFrame()) {
833 return Operand(ebp, StackSlotOffset(op->index()));
835 // Retrieve parameter without eager stack-frame relative to the
837 return Operand(esp, ArgumentsOffsetWithoutFrame(op->index()));
842 Operand LCodeGen::HighOperand(LOperand* op) {
843 DCHECK(op->IsDoubleStackSlot());
844 if (NeedsEagerFrame()) {
845 return Operand(ebp, StackSlotOffset(op->index()) + kPointerSize);
847 // Retrieve parameter without eager stack-frame relative to the
850 esp, ArgumentsOffsetWithoutFrame(op->index()) + kPointerSize);
855 void LCodeGen::WriteTranslation(LEnvironment* environment,
856 Translation* translation) {
857 if (environment == NULL) return;
859 // The translation includes one command per value in the environment.
860 int translation_size = environment->translation_size();
861 // The output frame height does not include the parameters.
862 int height = translation_size - environment->parameter_count();
864 WriteTranslation(environment->outer(), translation);
865 bool has_closure_id = !info()->closure().is_null() &&
866 !info()->closure().is_identical_to(environment->closure());
867 int closure_id = has_closure_id
868 ? DefineDeoptimizationLiteral(environment->closure())
869 : Translation::kSelfLiteralId;
870 switch (environment->frame_type()) {
872 translation->BeginJSFrame(environment->ast_id(), closure_id, height);
875 translation->BeginConstructStubFrame(closure_id, translation_size);
878 DCHECK(translation_size == 1);
880 translation->BeginGetterStubFrame(closure_id);
883 DCHECK(translation_size == 2);
885 translation->BeginSetterStubFrame(closure_id);
887 case ARGUMENTS_ADAPTOR:
888 translation->BeginArgumentsAdaptorFrame(closure_id, translation_size);
891 translation->BeginCompiledStubFrame();
897 int object_index = 0;
898 int dematerialized_index = 0;
899 for (int i = 0; i < translation_size; ++i) {
900 LOperand* value = environment->values()->at(i);
901 AddToTranslation(environment,
904 environment->HasTaggedValueAt(i),
905 environment->HasUint32ValueAt(i),
907 &dematerialized_index);
912 void LCodeGen::AddToTranslation(LEnvironment* environment,
913 Translation* translation,
917 int* object_index_pointer,
918 int* dematerialized_index_pointer) {
919 if (op == LEnvironment::materialization_marker()) {
920 int object_index = (*object_index_pointer)++;
921 if (environment->ObjectIsDuplicateAt(object_index)) {
922 int dupe_of = environment->ObjectDuplicateOfAt(object_index);
923 translation->DuplicateObject(dupe_of);
926 int object_length = environment->ObjectLengthAt(object_index);
927 if (environment->ObjectIsArgumentsAt(object_index)) {
928 translation->BeginArgumentsObject(object_length);
930 translation->BeginCapturedObject(object_length);
932 int dematerialized_index = *dematerialized_index_pointer;
933 int env_offset = environment->translation_size() + dematerialized_index;
934 *dematerialized_index_pointer += object_length;
935 for (int i = 0; i < object_length; ++i) {
936 LOperand* value = environment->values()->at(env_offset + i);
937 AddToTranslation(environment,
940 environment->HasTaggedValueAt(env_offset + i),
941 environment->HasUint32ValueAt(env_offset + i),
942 object_index_pointer,
943 dematerialized_index_pointer);
948 if (op->IsStackSlot()) {
950 translation->StoreStackSlot(op->index());
951 } else if (is_uint32) {
952 translation->StoreUint32StackSlot(op->index());
954 translation->StoreInt32StackSlot(op->index());
956 } else if (op->IsDoubleStackSlot()) {
957 translation->StoreDoubleStackSlot(op->index());
958 } else if (op->IsRegister()) {
959 Register reg = ToRegister(op);
961 translation->StoreRegister(reg);
962 } else if (is_uint32) {
963 translation->StoreUint32Register(reg);
965 translation->StoreInt32Register(reg);
967 } else if (op->IsDoubleRegister()) {
968 X87Register reg = ToX87Register(op);
969 translation->StoreDoubleRegister(reg);
970 } else if (op->IsConstantOperand()) {
971 HConstant* constant = chunk()->LookupConstant(LConstantOperand::cast(op));
972 int src_index = DefineDeoptimizationLiteral(constant->handle(isolate()));
973 translation->StoreLiteral(src_index);
980 void LCodeGen::CallCodeGeneric(Handle<Code> code,
981 RelocInfo::Mode mode,
983 SafepointMode safepoint_mode) {
984 DCHECK(instr != NULL);
986 RecordSafepointWithLazyDeopt(instr, safepoint_mode);
988 // Signal that we don't inline smi code before these stubs in the
989 // optimizing code generator.
990 if (code->kind() == Code::BINARY_OP_IC ||
991 code->kind() == Code::COMPARE_IC) {
997 void LCodeGen::CallCode(Handle<Code> code,
998 RelocInfo::Mode mode,
999 LInstruction* instr) {
1000 CallCodeGeneric(code, mode, instr, RECORD_SIMPLE_SAFEPOINT);
1004 void LCodeGen::CallRuntime(const Runtime::Function* fun, int argc,
1005 LInstruction* instr, SaveFPRegsMode save_doubles) {
1006 DCHECK(instr != NULL);
1007 DCHECK(instr->HasPointerMap());
1009 __ CallRuntime(fun, argc, save_doubles);
1011 RecordSafepointWithLazyDeopt(instr, RECORD_SIMPLE_SAFEPOINT);
1013 DCHECK(info()->is_calling());
1017 void LCodeGen::LoadContextFromDeferred(LOperand* context) {
1018 if (context->IsRegister()) {
1019 if (!ToRegister(context).is(esi)) {
1020 __ mov(esi, ToRegister(context));
1022 } else if (context->IsStackSlot()) {
1023 __ mov(esi, ToOperand(context));
1024 } else if (context->IsConstantOperand()) {
1025 HConstant* constant =
1026 chunk_->LookupConstant(LConstantOperand::cast(context));
1027 __ LoadObject(esi, Handle<Object>::cast(constant->handle(isolate())));
1033 void LCodeGen::CallRuntimeFromDeferred(Runtime::FunctionId id,
1035 LInstruction* instr,
1036 LOperand* context) {
1037 LoadContextFromDeferred(context);
1039 __ CallRuntimeSaveDoubles(id);
1040 RecordSafepointWithRegisters(
1041 instr->pointer_map(), argc, Safepoint::kNoLazyDeopt);
1043 DCHECK(info()->is_calling());
1047 void LCodeGen::RegisterEnvironmentForDeoptimization(
1048 LEnvironment* environment, Safepoint::DeoptMode mode) {
1049 environment->set_has_been_used();
1050 if (!environment->HasBeenRegistered()) {
1051 // Physical stack frame layout:
1052 // -x ............. -4 0 ..................................... y
1053 // [incoming arguments] [spill slots] [pushed outgoing arguments]
1055 // Layout of the environment:
1056 // 0 ..................................................... size-1
1057 // [parameters] [locals] [expression stack including arguments]
1059 // Layout of the translation:
1060 // 0 ........................................................ size - 1 + 4
1061 // [expression stack including arguments] [locals] [4 words] [parameters]
1062 // |>------------ translation_size ------------<|
1064 int frame_count = 0;
1065 int jsframe_count = 0;
1066 for (LEnvironment* e = environment; e != NULL; e = e->outer()) {
1068 if (e->frame_type() == JS_FUNCTION) {
1072 Translation translation(&translations_, frame_count, jsframe_count, zone());
1073 WriteTranslation(environment, &translation);
1074 int deoptimization_index = deoptimizations_.length();
1075 int pc_offset = masm()->pc_offset();
1076 environment->Register(deoptimization_index,
1077 translation.index(),
1078 (mode == Safepoint::kLazyDeopt) ? pc_offset : -1);
1079 deoptimizations_.Add(environment, zone());
1084 void LCodeGen::DeoptimizeIf(Condition cc, LInstruction* instr,
1086 Deoptimizer::BailoutType bailout_type) {
1087 LEnvironment* environment = instr->environment();
1088 RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt);
1089 DCHECK(environment->HasBeenRegistered());
1090 int id = environment->deoptimization_index();
1091 DCHECK(info()->IsOptimizing() || info()->IsStub());
1093 Deoptimizer::GetDeoptimizationEntry(isolate(), id, bailout_type);
1094 if (entry == NULL) {
1095 Abort(kBailoutWasNotPrepared);
1099 if (DeoptEveryNTimes()) {
1100 ExternalReference count = ExternalReference::stress_deopt_count(isolate());
1104 __ mov(eax, Operand::StaticVariable(count));
1105 __ sub(eax, Immediate(1));
1106 __ j(not_zero, &no_deopt, Label::kNear);
1107 if (FLAG_trap_on_deopt) __ int3();
1108 __ mov(eax, Immediate(FLAG_deopt_every_n_times));
1109 __ mov(Operand::StaticVariable(count), eax);
1112 DCHECK(frame_is_built_);
1113 // Put the x87 stack layout in TOS.
1114 if (x87_stack_.depth() > 0) EmitFlushX87ForDeopt();
1115 __ push(Immediate(x87_stack_.GetLayout()));
1116 __ fild_s(MemOperand(esp, 0));
1117 // Don't touch eflags.
1118 __ lea(esp, Operand(esp, kPointerSize));
1119 __ call(entry, RelocInfo::RUNTIME_ENTRY);
1121 __ mov(Operand::StaticVariable(count), eax);
1126 // Put the x87 stack layout in TOS, so that we can save x87 fp registers in
1127 // the correct location.
1130 if (cc != no_condition) __ j(NegateCondition(cc), &done, Label::kNear);
1131 if (x87_stack_.depth() > 0) EmitFlushX87ForDeopt();
1133 int x87_stack_layout = x87_stack_.GetLayout();
1134 __ push(Immediate(x87_stack_layout));
1135 __ fild_s(MemOperand(esp, 0));
1136 // Don't touch eflags.
1137 __ lea(esp, Operand(esp, kPointerSize));
1141 if (info()->ShouldTrapOnDeopt()) {
1143 if (cc != no_condition) __ j(NegateCondition(cc), &done, Label::kNear);
1148 Deoptimizer::Reason reason(instr->hydrogen_value()->position().raw(),
1149 instr->Mnemonic(), detail);
1150 DCHECK(info()->IsStub() || frame_is_built_);
1151 if (cc == no_condition && frame_is_built_) {
1152 DeoptComment(reason);
1153 __ call(entry, RelocInfo::RUNTIME_ENTRY);
1155 Deoptimizer::JumpTableEntry table_entry(entry, reason, bailout_type,
1157 // We often have several deopts to the same entry, reuse the last
1158 // jump entry if this is the case.
1159 if (jump_table_.is_empty() ||
1160 !table_entry.IsEquivalentTo(jump_table_.last())) {
1161 jump_table_.Add(table_entry, zone());
1163 if (cc == no_condition) {
1164 __ jmp(&jump_table_.last().label);
1166 __ j(cc, &jump_table_.last().label);
1172 void LCodeGen::DeoptimizeIf(Condition cc, LInstruction* instr,
1173 const char* detail) {
1174 Deoptimizer::BailoutType bailout_type = info()->IsStub()
1176 : Deoptimizer::EAGER;
1177 DeoptimizeIf(cc, instr, detail, bailout_type);
1181 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) {
1182 int length = deoptimizations_.length();
1183 if (length == 0) return;
1184 Handle<DeoptimizationInputData> data =
1185 DeoptimizationInputData::New(isolate(), length, TENURED);
1187 Handle<ByteArray> translations =
1188 translations_.CreateByteArray(isolate()->factory());
1189 data->SetTranslationByteArray(*translations);
1190 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_));
1191 data->SetOptimizationId(Smi::FromInt(info_->optimization_id()));
1192 if (info_->IsOptimizing()) {
1193 // Reference to shared function info does not change between phases.
1194 AllowDeferredHandleDereference allow_handle_dereference;
1195 data->SetSharedFunctionInfo(*info_->shared_info());
1197 data->SetSharedFunctionInfo(Smi::FromInt(0));
1200 Handle<FixedArray> literals =
1201 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED);
1202 { AllowDeferredHandleDereference copy_handles;
1203 for (int i = 0; i < deoptimization_literals_.length(); i++) {
1204 literals->set(i, *deoptimization_literals_[i]);
1206 data->SetLiteralArray(*literals);
1209 data->SetOsrAstId(Smi::FromInt(info_->osr_ast_id().ToInt()));
1210 data->SetOsrPcOffset(Smi::FromInt(osr_pc_offset_));
1212 // Populate the deoptimization entries.
1213 for (int i = 0; i < length; i++) {
1214 LEnvironment* env = deoptimizations_[i];
1215 data->SetAstId(i, env->ast_id());
1216 data->SetTranslationIndex(i, Smi::FromInt(env->translation_index()));
1217 data->SetArgumentsStackHeight(i,
1218 Smi::FromInt(env->arguments_stack_height()));
1219 data->SetPc(i, Smi::FromInt(env->pc_offset()));
1221 code->set_deoptimization_data(*data);
1225 int LCodeGen::DefineDeoptimizationLiteral(Handle<Object> literal) {
1226 int result = deoptimization_literals_.length();
1227 for (int i = 0; i < deoptimization_literals_.length(); ++i) {
1228 if (deoptimization_literals_[i].is_identical_to(literal)) return i;
1230 deoptimization_literals_.Add(literal, zone());
1235 void LCodeGen::PopulateDeoptimizationLiteralsWithInlinedFunctions() {
1236 DCHECK(deoptimization_literals_.length() == 0);
1238 const ZoneList<Handle<JSFunction> >* inlined_closures =
1239 chunk()->inlined_closures();
1241 for (int i = 0, length = inlined_closures->length();
1244 DefineDeoptimizationLiteral(inlined_closures->at(i));
1247 inlined_function_count_ = deoptimization_literals_.length();
1251 void LCodeGen::RecordSafepointWithLazyDeopt(
1252 LInstruction* instr, SafepointMode safepoint_mode) {
1253 if (safepoint_mode == RECORD_SIMPLE_SAFEPOINT) {
1254 RecordSafepoint(instr->pointer_map(), Safepoint::kLazyDeopt);
1256 DCHECK(safepoint_mode == RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS);
1257 RecordSafepointWithRegisters(
1258 instr->pointer_map(), 0, Safepoint::kLazyDeopt);
1263 void LCodeGen::RecordSafepoint(
1264 LPointerMap* pointers,
1265 Safepoint::Kind kind,
1267 Safepoint::DeoptMode deopt_mode) {
1268 DCHECK(kind == expected_safepoint_kind_);
1269 const ZoneList<LOperand*>* operands = pointers->GetNormalizedOperands();
1270 Safepoint safepoint =
1271 safepoints_.DefineSafepoint(masm(), kind, arguments, deopt_mode);
1272 for (int i = 0; i < operands->length(); i++) {
1273 LOperand* pointer = operands->at(i);
1274 if (pointer->IsStackSlot()) {
1275 safepoint.DefinePointerSlot(pointer->index(), zone());
1276 } else if (pointer->IsRegister() && (kind & Safepoint::kWithRegisters)) {
1277 safepoint.DefinePointerRegister(ToRegister(pointer), zone());
1283 void LCodeGen::RecordSafepoint(LPointerMap* pointers,
1284 Safepoint::DeoptMode mode) {
1285 RecordSafepoint(pointers, Safepoint::kSimple, 0, mode);
1289 void LCodeGen::RecordSafepoint(Safepoint::DeoptMode mode) {
1290 LPointerMap empty_pointers(zone());
1291 RecordSafepoint(&empty_pointers, mode);
1295 void LCodeGen::RecordSafepointWithRegisters(LPointerMap* pointers,
1297 Safepoint::DeoptMode mode) {
1298 RecordSafepoint(pointers, Safepoint::kWithRegisters, arguments, mode);
1302 void LCodeGen::RecordAndWritePosition(int position) {
1303 if (position == RelocInfo::kNoPosition) return;
1304 masm()->positions_recorder()->RecordPosition(position);
1305 masm()->positions_recorder()->WriteRecordedPositions();
1309 static const char* LabelType(LLabel* label) {
1310 if (label->is_loop_header()) return " (loop header)";
1311 if (label->is_osr_entry()) return " (OSR entry)";
1316 void LCodeGen::DoLabel(LLabel* label) {
1317 Comment(";;; <@%d,#%d> -------------------- B%d%s --------------------",
1318 current_instruction_,
1319 label->hydrogen_value()->id(),
1322 __ bind(label->label());
1323 current_block_ = label->block_id();
1324 if (label->block()->predecessors()->length() > 1) {
1325 // A join block's x87 stack is that of its last visited predecessor.
1326 // If the last visited predecessor block is unreachable, the stack state
1327 // will be wrong. In such case, use the x87 stack of reachable predecessor.
1328 X87StackMap::const_iterator it = x87_stack_map_.find(current_block_);
1329 // Restore x87 stack.
1330 if (it != x87_stack_map_.end()) {
1331 x87_stack_ = *(it->second);
1338 void LCodeGen::DoParallelMove(LParallelMove* move) {
1339 resolver_.Resolve(move);
1343 void LCodeGen::DoGap(LGap* gap) {
1344 for (int i = LGap::FIRST_INNER_POSITION;
1345 i <= LGap::LAST_INNER_POSITION;
1347 LGap::InnerPosition inner_pos = static_cast<LGap::InnerPosition>(i);
1348 LParallelMove* move = gap->GetParallelMove(inner_pos);
1349 if (move != NULL) DoParallelMove(move);
1354 void LCodeGen::DoInstructionGap(LInstructionGap* instr) {
1359 void LCodeGen::DoParameter(LParameter* instr) {
1364 void LCodeGen::DoCallStub(LCallStub* instr) {
1365 DCHECK(ToRegister(instr->context()).is(esi));
1366 DCHECK(ToRegister(instr->result()).is(eax));
1367 switch (instr->hydrogen()->major_key()) {
1368 case CodeStub::RegExpExec: {
1369 RegExpExecStub stub(isolate());
1370 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
1373 case CodeStub::SubString: {
1374 SubStringStub stub(isolate());
1375 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
1378 case CodeStub::StringCompare: {
1379 StringCompareStub stub(isolate());
1380 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
1389 void LCodeGen::DoUnknownOSRValue(LUnknownOSRValue* instr) {
1390 GenerateOsrPrologue();
1394 void LCodeGen::DoModByPowerOf2I(LModByPowerOf2I* instr) {
1395 Register dividend = ToRegister(instr->dividend());
1396 int32_t divisor = instr->divisor();
1397 DCHECK(dividend.is(ToRegister(instr->result())));
1399 // Theoretically, a variation of the branch-free code for integer division by
1400 // a power of 2 (calculating the remainder via an additional multiplication
1401 // (which gets simplified to an 'and') and subtraction) should be faster, and
1402 // this is exactly what GCC and clang emit. Nevertheless, benchmarks seem to
1403 // indicate that positive dividends are heavily favored, so the branching
1404 // version performs better.
1405 HMod* hmod = instr->hydrogen();
1406 int32_t mask = divisor < 0 ? -(divisor + 1) : (divisor - 1);
1407 Label dividend_is_not_negative, done;
1408 if (hmod->CheckFlag(HValue::kLeftCanBeNegative)) {
1409 __ test(dividend, dividend);
1410 __ j(not_sign, ÷nd_is_not_negative, Label::kNear);
1411 // Note that this is correct even for kMinInt operands.
1413 __ and_(dividend, mask);
1415 if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) {
1416 DeoptimizeIf(zero, instr, "minus zero");
1418 __ jmp(&done, Label::kNear);
1421 __ bind(÷nd_is_not_negative);
1422 __ and_(dividend, mask);
1427 void LCodeGen::DoModByConstI(LModByConstI* instr) {
1428 Register dividend = ToRegister(instr->dividend());
1429 int32_t divisor = instr->divisor();
1430 DCHECK(ToRegister(instr->result()).is(eax));
1433 DeoptimizeIf(no_condition, instr, "division by zero");
1437 __ TruncatingDiv(dividend, Abs(divisor));
1438 __ imul(edx, edx, Abs(divisor));
1439 __ mov(eax, dividend);
1442 // Check for negative zero.
1443 HMod* hmod = instr->hydrogen();
1444 if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) {
1445 Label remainder_not_zero;
1446 __ j(not_zero, &remainder_not_zero, Label::kNear);
1447 __ cmp(dividend, Immediate(0));
1448 DeoptimizeIf(less, instr, "minus zero");
1449 __ bind(&remainder_not_zero);
1454 void LCodeGen::DoModI(LModI* instr) {
1455 HMod* hmod = instr->hydrogen();
1457 Register left_reg = ToRegister(instr->left());
1458 DCHECK(left_reg.is(eax));
1459 Register right_reg = ToRegister(instr->right());
1460 DCHECK(!right_reg.is(eax));
1461 DCHECK(!right_reg.is(edx));
1462 Register result_reg = ToRegister(instr->result());
1463 DCHECK(result_reg.is(edx));
1466 // Check for x % 0, idiv would signal a divide error. We have to
1467 // deopt in this case because we can't return a NaN.
1468 if (hmod->CheckFlag(HValue::kCanBeDivByZero)) {
1469 __ test(right_reg, Operand(right_reg));
1470 DeoptimizeIf(zero, instr, "division by zero");
1473 // Check for kMinInt % -1, idiv would signal a divide error. We
1474 // have to deopt if we care about -0, because we can't return that.
1475 if (hmod->CheckFlag(HValue::kCanOverflow)) {
1476 Label no_overflow_possible;
1477 __ cmp(left_reg, kMinInt);
1478 __ j(not_equal, &no_overflow_possible, Label::kNear);
1479 __ cmp(right_reg, -1);
1480 if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) {
1481 DeoptimizeIf(equal, instr, "minus zero");
1483 __ j(not_equal, &no_overflow_possible, Label::kNear);
1484 __ Move(result_reg, Immediate(0));
1485 __ jmp(&done, Label::kNear);
1487 __ bind(&no_overflow_possible);
1490 // Sign extend dividend in eax into edx:eax.
1493 // If we care about -0, test if the dividend is <0 and the result is 0.
1494 if (hmod->CheckFlag(HValue::kBailoutOnMinusZero)) {
1495 Label positive_left;
1496 __ test(left_reg, Operand(left_reg));
1497 __ j(not_sign, &positive_left, Label::kNear);
1499 __ test(result_reg, Operand(result_reg));
1500 DeoptimizeIf(zero, instr, "minus zero");
1501 __ jmp(&done, Label::kNear);
1502 __ bind(&positive_left);
1509 void LCodeGen::DoDivByPowerOf2I(LDivByPowerOf2I* instr) {
1510 Register dividend = ToRegister(instr->dividend());
1511 int32_t divisor = instr->divisor();
1512 Register result = ToRegister(instr->result());
1513 DCHECK(divisor == kMinInt || base::bits::IsPowerOfTwo32(Abs(divisor)));
1514 DCHECK(!result.is(dividend));
1516 // Check for (0 / -x) that will produce negative zero.
1517 HDiv* hdiv = instr->hydrogen();
1518 if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) {
1519 __ test(dividend, dividend);
1520 DeoptimizeIf(zero, instr, "minus zero");
1522 // Check for (kMinInt / -1).
1523 if (hdiv->CheckFlag(HValue::kCanOverflow) && divisor == -1) {
1524 __ cmp(dividend, kMinInt);
1525 DeoptimizeIf(zero, instr, "overflow");
1527 // Deoptimize if remainder will not be 0.
1528 if (!hdiv->CheckFlag(HInstruction::kAllUsesTruncatingToInt32) &&
1529 divisor != 1 && divisor != -1) {
1530 int32_t mask = divisor < 0 ? -(divisor + 1) : (divisor - 1);
1531 __ test(dividend, Immediate(mask));
1532 DeoptimizeIf(not_zero, instr, "lost precision");
1534 __ Move(result, dividend);
1535 int32_t shift = WhichPowerOf2Abs(divisor);
1537 // The arithmetic shift is always OK, the 'if' is an optimization only.
1538 if (shift > 1) __ sar(result, 31);
1539 __ shr(result, 32 - shift);
1540 __ add(result, dividend);
1541 __ sar(result, shift);
1543 if (divisor < 0) __ neg(result);
1547 void LCodeGen::DoDivByConstI(LDivByConstI* instr) {
1548 Register dividend = ToRegister(instr->dividend());
1549 int32_t divisor = instr->divisor();
1550 DCHECK(ToRegister(instr->result()).is(edx));
1553 DeoptimizeIf(no_condition, instr, "division by zero");
1557 // Check for (0 / -x) that will produce negative zero.
1558 HDiv* hdiv = instr->hydrogen();
1559 if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) {
1560 __ test(dividend, dividend);
1561 DeoptimizeIf(zero, instr, "minus zero");
1564 __ TruncatingDiv(dividend, Abs(divisor));
1565 if (divisor < 0) __ neg(edx);
1567 if (!hdiv->CheckFlag(HInstruction::kAllUsesTruncatingToInt32)) {
1569 __ imul(eax, eax, divisor);
1570 __ sub(eax, dividend);
1571 DeoptimizeIf(not_equal, instr, "lost precision");
1576 // TODO(svenpanne) Refactor this to avoid code duplication with DoFlooringDivI.
1577 void LCodeGen::DoDivI(LDivI* instr) {
1578 HBinaryOperation* hdiv = instr->hydrogen();
1579 Register dividend = ToRegister(instr->dividend());
1580 Register divisor = ToRegister(instr->divisor());
1581 Register remainder = ToRegister(instr->temp());
1582 DCHECK(dividend.is(eax));
1583 DCHECK(remainder.is(edx));
1584 DCHECK(ToRegister(instr->result()).is(eax));
1585 DCHECK(!divisor.is(eax));
1586 DCHECK(!divisor.is(edx));
1589 if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) {
1590 __ test(divisor, divisor);
1591 DeoptimizeIf(zero, instr, "division by zero");
1594 // Check for (0 / -x) that will produce negative zero.
1595 if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero)) {
1596 Label dividend_not_zero;
1597 __ test(dividend, dividend);
1598 __ j(not_zero, ÷nd_not_zero, Label::kNear);
1599 __ test(divisor, divisor);
1600 DeoptimizeIf(sign, instr, "minus zero");
1601 __ bind(÷nd_not_zero);
1604 // Check for (kMinInt / -1).
1605 if (hdiv->CheckFlag(HValue::kCanOverflow)) {
1606 Label dividend_not_min_int;
1607 __ cmp(dividend, kMinInt);
1608 __ j(not_zero, ÷nd_not_min_int, Label::kNear);
1609 __ cmp(divisor, -1);
1610 DeoptimizeIf(zero, instr, "overflow");
1611 __ bind(÷nd_not_min_int);
1614 // Sign extend to edx (= remainder).
1618 if (!hdiv->CheckFlag(HValue::kAllUsesTruncatingToInt32)) {
1619 // Deoptimize if remainder is not 0.
1620 __ test(remainder, remainder);
1621 DeoptimizeIf(not_zero, instr, "lost precision");
1626 void LCodeGen::DoFlooringDivByPowerOf2I(LFlooringDivByPowerOf2I* instr) {
1627 Register dividend = ToRegister(instr->dividend());
1628 int32_t divisor = instr->divisor();
1629 DCHECK(dividend.is(ToRegister(instr->result())));
1631 // If the divisor is positive, things are easy: There can be no deopts and we
1632 // can simply do an arithmetic right shift.
1633 if (divisor == 1) return;
1634 int32_t shift = WhichPowerOf2Abs(divisor);
1636 __ sar(dividend, shift);
1640 // If the divisor is negative, we have to negate and handle edge cases.
1642 if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) {
1643 DeoptimizeIf(zero, instr, "minus zero");
1646 // Dividing by -1 is basically negation, unless we overflow.
1647 if (divisor == -1) {
1648 if (instr->hydrogen()->CheckFlag(HValue::kLeftCanBeMinInt)) {
1649 DeoptimizeIf(overflow, instr, "overflow");
1654 // If the negation could not overflow, simply shifting is OK.
1655 if (!instr->hydrogen()->CheckFlag(HValue::kLeftCanBeMinInt)) {
1656 __ sar(dividend, shift);
1660 Label not_kmin_int, done;
1661 __ j(no_overflow, ¬_kmin_int, Label::kNear);
1662 __ mov(dividend, Immediate(kMinInt / divisor));
1663 __ jmp(&done, Label::kNear);
1664 __ bind(¬_kmin_int);
1665 __ sar(dividend, shift);
1670 void LCodeGen::DoFlooringDivByConstI(LFlooringDivByConstI* instr) {
1671 Register dividend = ToRegister(instr->dividend());
1672 int32_t divisor = instr->divisor();
1673 DCHECK(ToRegister(instr->result()).is(edx));
1676 DeoptimizeIf(no_condition, instr, "division by zero");
1680 // Check for (0 / -x) that will produce negative zero.
1681 HMathFloorOfDiv* hdiv = instr->hydrogen();
1682 if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero) && divisor < 0) {
1683 __ test(dividend, dividend);
1684 DeoptimizeIf(zero, instr, "minus zero");
1687 // Easy case: We need no dynamic check for the dividend and the flooring
1688 // division is the same as the truncating division.
1689 if ((divisor > 0 && !hdiv->CheckFlag(HValue::kLeftCanBeNegative)) ||
1690 (divisor < 0 && !hdiv->CheckFlag(HValue::kLeftCanBePositive))) {
1691 __ TruncatingDiv(dividend, Abs(divisor));
1692 if (divisor < 0) __ neg(edx);
1696 // In the general case we may need to adjust before and after the truncating
1697 // division to get a flooring division.
1698 Register temp = ToRegister(instr->temp3());
1699 DCHECK(!temp.is(dividend) && !temp.is(eax) && !temp.is(edx));
1700 Label needs_adjustment, done;
1701 __ cmp(dividend, Immediate(0));
1702 __ j(divisor > 0 ? less : greater, &needs_adjustment, Label::kNear);
1703 __ TruncatingDiv(dividend, Abs(divisor));
1704 if (divisor < 0) __ neg(edx);
1705 __ jmp(&done, Label::kNear);
1706 __ bind(&needs_adjustment);
1707 __ lea(temp, Operand(dividend, divisor > 0 ? 1 : -1));
1708 __ TruncatingDiv(temp, Abs(divisor));
1709 if (divisor < 0) __ neg(edx);
1715 // TODO(svenpanne) Refactor this to avoid code duplication with DoDivI.
1716 void LCodeGen::DoFlooringDivI(LFlooringDivI* instr) {
1717 HBinaryOperation* hdiv = instr->hydrogen();
1718 Register dividend = ToRegister(instr->dividend());
1719 Register divisor = ToRegister(instr->divisor());
1720 Register remainder = ToRegister(instr->temp());
1721 Register result = ToRegister(instr->result());
1722 DCHECK(dividend.is(eax));
1723 DCHECK(remainder.is(edx));
1724 DCHECK(result.is(eax));
1725 DCHECK(!divisor.is(eax));
1726 DCHECK(!divisor.is(edx));
1729 if (hdiv->CheckFlag(HValue::kCanBeDivByZero)) {
1730 __ test(divisor, divisor);
1731 DeoptimizeIf(zero, instr, "division by zero");
1734 // Check for (0 / -x) that will produce negative zero.
1735 if (hdiv->CheckFlag(HValue::kBailoutOnMinusZero)) {
1736 Label dividend_not_zero;
1737 __ test(dividend, dividend);
1738 __ j(not_zero, ÷nd_not_zero, Label::kNear);
1739 __ test(divisor, divisor);
1740 DeoptimizeIf(sign, instr, "minus zero");
1741 __ bind(÷nd_not_zero);
1744 // Check for (kMinInt / -1).
1745 if (hdiv->CheckFlag(HValue::kCanOverflow)) {
1746 Label dividend_not_min_int;
1747 __ cmp(dividend, kMinInt);
1748 __ j(not_zero, ÷nd_not_min_int, Label::kNear);
1749 __ cmp(divisor, -1);
1750 DeoptimizeIf(zero, instr, "overflow");
1751 __ bind(÷nd_not_min_int);
1754 // Sign extend to edx (= remainder).
1759 __ test(remainder, remainder);
1760 __ j(zero, &done, Label::kNear);
1761 __ xor_(remainder, divisor);
1762 __ sar(remainder, 31);
1763 __ add(result, remainder);
1768 void LCodeGen::DoMulI(LMulI* instr) {
1769 Register left = ToRegister(instr->left());
1770 LOperand* right = instr->right();
1772 if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) {
1773 __ mov(ToRegister(instr->temp()), left);
1776 if (right->IsConstantOperand()) {
1777 // Try strength reductions on the multiplication.
1778 // All replacement instructions are at most as long as the imul
1779 // and have better latency.
1780 int constant = ToInteger32(LConstantOperand::cast(right));
1781 if (constant == -1) {
1783 } else if (constant == 0) {
1784 __ xor_(left, Operand(left));
1785 } else if (constant == 2) {
1786 __ add(left, Operand(left));
1787 } else if (!instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) {
1788 // If we know that the multiplication can't overflow, it's safe to
1789 // use instructions that don't set the overflow flag for the
1796 __ lea(left, Operand(left, left, times_2, 0));
1802 __ lea(left, Operand(left, left, times_4, 0));
1808 __ lea(left, Operand(left, left, times_8, 0));
1814 __ imul(left, left, constant);
1818 __ imul(left, left, constant);
1821 if (instr->hydrogen()->representation().IsSmi()) {
1824 __ imul(left, ToOperand(right));
1827 if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) {
1828 DeoptimizeIf(overflow, instr, "overflow");
1831 if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) {
1832 // Bail out if the result is supposed to be negative zero.
1834 __ test(left, Operand(left));
1835 __ j(not_zero, &done);
1836 if (right->IsConstantOperand()) {
1837 if (ToInteger32(LConstantOperand::cast(right)) < 0) {
1838 DeoptimizeIf(no_condition, instr, "minus zero");
1839 } else if (ToInteger32(LConstantOperand::cast(right)) == 0) {
1840 __ cmp(ToRegister(instr->temp()), Immediate(0));
1841 DeoptimizeIf(less, instr, "minus zero");
1844 // Test the non-zero operand for negative sign.
1845 __ or_(ToRegister(instr->temp()), ToOperand(right));
1846 DeoptimizeIf(sign, instr, "minus zero");
1853 void LCodeGen::DoBitI(LBitI* instr) {
1854 LOperand* left = instr->left();
1855 LOperand* right = instr->right();
1856 DCHECK(left->Equals(instr->result()));
1857 DCHECK(left->IsRegister());
1859 if (right->IsConstantOperand()) {
1860 int32_t right_operand =
1861 ToRepresentation(LConstantOperand::cast(right),
1862 instr->hydrogen()->representation());
1863 switch (instr->op()) {
1864 case Token::BIT_AND:
1865 __ and_(ToRegister(left), right_operand);
1868 __ or_(ToRegister(left), right_operand);
1870 case Token::BIT_XOR:
1871 if (right_operand == int32_t(~0)) {
1872 __ not_(ToRegister(left));
1874 __ xor_(ToRegister(left), right_operand);
1882 switch (instr->op()) {
1883 case Token::BIT_AND:
1884 __ and_(ToRegister(left), ToOperand(right));
1887 __ or_(ToRegister(left), ToOperand(right));
1889 case Token::BIT_XOR:
1890 __ xor_(ToRegister(left), ToOperand(right));
1900 void LCodeGen::DoShiftI(LShiftI* instr) {
1901 LOperand* left = instr->left();
1902 LOperand* right = instr->right();
1903 DCHECK(left->Equals(instr->result()));
1904 DCHECK(left->IsRegister());
1905 if (right->IsRegister()) {
1906 DCHECK(ToRegister(right).is(ecx));
1908 switch (instr->op()) {
1910 __ ror_cl(ToRegister(left));
1913 __ sar_cl(ToRegister(left));
1916 __ shr_cl(ToRegister(left));
1917 if (instr->can_deopt()) {
1918 __ test(ToRegister(left), ToRegister(left));
1919 DeoptimizeIf(sign, instr, "negative value");
1923 __ shl_cl(ToRegister(left));
1930 int value = ToInteger32(LConstantOperand::cast(right));
1931 uint8_t shift_count = static_cast<uint8_t>(value & 0x1F);
1932 switch (instr->op()) {
1934 if (shift_count == 0 && instr->can_deopt()) {
1935 __ test(ToRegister(left), ToRegister(left));
1936 DeoptimizeIf(sign, instr, "negative value");
1938 __ ror(ToRegister(left), shift_count);
1942 if (shift_count != 0) {
1943 __ sar(ToRegister(left), shift_count);
1947 if (shift_count != 0) {
1948 __ shr(ToRegister(left), shift_count);
1949 } else if (instr->can_deopt()) {
1950 __ test(ToRegister(left), ToRegister(left));
1951 DeoptimizeIf(sign, instr, "negative value");
1955 if (shift_count != 0) {
1956 if (instr->hydrogen_value()->representation().IsSmi() &&
1957 instr->can_deopt()) {
1958 if (shift_count != 1) {
1959 __ shl(ToRegister(left), shift_count - 1);
1961 __ SmiTag(ToRegister(left));
1962 DeoptimizeIf(overflow, instr, "overflow");
1964 __ shl(ToRegister(left), shift_count);
1976 void LCodeGen::DoSubI(LSubI* instr) {
1977 LOperand* left = instr->left();
1978 LOperand* right = instr->right();
1979 DCHECK(left->Equals(instr->result()));
1981 if (right->IsConstantOperand()) {
1982 __ sub(ToOperand(left),
1983 ToImmediate(right, instr->hydrogen()->representation()));
1985 __ sub(ToRegister(left), ToOperand(right));
1987 if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) {
1988 DeoptimizeIf(overflow, instr, "overflow");
1993 void LCodeGen::DoConstantI(LConstantI* instr) {
1994 __ Move(ToRegister(instr->result()), Immediate(instr->value()));
1998 void LCodeGen::DoConstantS(LConstantS* instr) {
1999 __ Move(ToRegister(instr->result()), Immediate(instr->value()));
2003 void LCodeGen::DoConstantD(LConstantD* instr) {
2004 double v = instr->value();
2005 uint64_t int_val = bit_cast<uint64_t, double>(v);
2006 int32_t lower = static_cast<int32_t>(int_val);
2007 int32_t upper = static_cast<int32_t>(int_val >> (kBitsPerInt));
2008 DCHECK(instr->result()->IsDoubleRegister());
2010 __ push(Immediate(upper));
2011 __ push(Immediate(lower));
2012 X87Register reg = ToX87Register(instr->result());
2013 X87Mov(reg, Operand(esp, 0));
2014 __ add(Operand(esp), Immediate(kDoubleSize));
2018 void LCodeGen::DoConstantE(LConstantE* instr) {
2019 __ lea(ToRegister(instr->result()), Operand::StaticVariable(instr->value()));
2023 void LCodeGen::DoConstantT(LConstantT* instr) {
2024 Register reg = ToRegister(instr->result());
2025 Handle<Object> object = instr->value(isolate());
2026 AllowDeferredHandleDereference smi_check;
2027 __ LoadObject(reg, object);
2031 void LCodeGen::DoMapEnumLength(LMapEnumLength* instr) {
2032 Register result = ToRegister(instr->result());
2033 Register map = ToRegister(instr->value());
2034 __ EnumLength(result, map);
2038 void LCodeGen::DoDateField(LDateField* instr) {
2039 Register object = ToRegister(instr->date());
2040 Register result = ToRegister(instr->result());
2041 Register scratch = ToRegister(instr->temp());
2042 Smi* index = instr->index();
2043 Label runtime, done;
2044 DCHECK(object.is(result));
2045 DCHECK(object.is(eax));
2047 __ test(object, Immediate(kSmiTagMask));
2048 DeoptimizeIf(zero, instr, "Smi");
2049 __ CmpObjectType(object, JS_DATE_TYPE, scratch);
2050 DeoptimizeIf(not_equal, instr, "not a date object");
2052 if (index->value() == 0) {
2053 __ mov(result, FieldOperand(object, JSDate::kValueOffset));
2055 if (index->value() < JSDate::kFirstUncachedField) {
2056 ExternalReference stamp = ExternalReference::date_cache_stamp(isolate());
2057 __ mov(scratch, Operand::StaticVariable(stamp));
2058 __ cmp(scratch, FieldOperand(object, JSDate::kCacheStampOffset));
2059 __ j(not_equal, &runtime, Label::kNear);
2060 __ mov(result, FieldOperand(object, JSDate::kValueOffset +
2061 kPointerSize * index->value()));
2062 __ jmp(&done, Label::kNear);
2065 __ PrepareCallCFunction(2, scratch);
2066 __ mov(Operand(esp, 0), object);
2067 __ mov(Operand(esp, 1 * kPointerSize), Immediate(index));
2068 __ CallCFunction(ExternalReference::get_date_field_function(isolate()), 2);
2074 Operand LCodeGen::BuildSeqStringOperand(Register string,
2076 String::Encoding encoding) {
2077 if (index->IsConstantOperand()) {
2078 int offset = ToRepresentation(LConstantOperand::cast(index),
2079 Representation::Integer32());
2080 if (encoding == String::TWO_BYTE_ENCODING) {
2081 offset *= kUC16Size;
2083 STATIC_ASSERT(kCharSize == 1);
2084 return FieldOperand(string, SeqString::kHeaderSize + offset);
2086 return FieldOperand(
2087 string, ToRegister(index),
2088 encoding == String::ONE_BYTE_ENCODING ? times_1 : times_2,
2089 SeqString::kHeaderSize);
2093 void LCodeGen::DoSeqStringGetChar(LSeqStringGetChar* instr) {
2094 String::Encoding encoding = instr->hydrogen()->encoding();
2095 Register result = ToRegister(instr->result());
2096 Register string = ToRegister(instr->string());
2098 if (FLAG_debug_code) {
2100 __ mov(string, FieldOperand(string, HeapObject::kMapOffset));
2101 __ movzx_b(string, FieldOperand(string, Map::kInstanceTypeOffset));
2103 __ and_(string, Immediate(kStringRepresentationMask | kStringEncodingMask));
2104 static const uint32_t one_byte_seq_type = kSeqStringTag | kOneByteStringTag;
2105 static const uint32_t two_byte_seq_type = kSeqStringTag | kTwoByteStringTag;
2106 __ cmp(string, Immediate(encoding == String::ONE_BYTE_ENCODING
2107 ? one_byte_seq_type : two_byte_seq_type));
2108 __ Check(equal, kUnexpectedStringType);
2112 Operand operand = BuildSeqStringOperand(string, instr->index(), encoding);
2113 if (encoding == String::ONE_BYTE_ENCODING) {
2114 __ movzx_b(result, operand);
2116 __ movzx_w(result, operand);
2121 void LCodeGen::DoSeqStringSetChar(LSeqStringSetChar* instr) {
2122 String::Encoding encoding = instr->hydrogen()->encoding();
2123 Register string = ToRegister(instr->string());
2125 if (FLAG_debug_code) {
2126 Register value = ToRegister(instr->value());
2127 Register index = ToRegister(instr->index());
2128 static const uint32_t one_byte_seq_type = kSeqStringTag | kOneByteStringTag;
2129 static const uint32_t two_byte_seq_type = kSeqStringTag | kTwoByteStringTag;
2131 instr->hydrogen()->encoding() == String::ONE_BYTE_ENCODING
2132 ? one_byte_seq_type : two_byte_seq_type;
2133 __ EmitSeqStringSetCharCheck(string, index, value, encoding_mask);
2136 Operand operand = BuildSeqStringOperand(string, instr->index(), encoding);
2137 if (instr->value()->IsConstantOperand()) {
2138 int value = ToRepresentation(LConstantOperand::cast(instr->value()),
2139 Representation::Integer32());
2140 DCHECK_LE(0, value);
2141 if (encoding == String::ONE_BYTE_ENCODING) {
2142 DCHECK_LE(value, String::kMaxOneByteCharCode);
2143 __ mov_b(operand, static_cast<int8_t>(value));
2145 DCHECK_LE(value, String::kMaxUtf16CodeUnit);
2146 __ mov_w(operand, static_cast<int16_t>(value));
2149 Register value = ToRegister(instr->value());
2150 if (encoding == String::ONE_BYTE_ENCODING) {
2151 __ mov_b(operand, value);
2153 __ mov_w(operand, value);
2159 void LCodeGen::DoAddI(LAddI* instr) {
2160 LOperand* left = instr->left();
2161 LOperand* right = instr->right();
2163 if (LAddI::UseLea(instr->hydrogen()) && !left->Equals(instr->result())) {
2164 if (right->IsConstantOperand()) {
2165 int32_t offset = ToRepresentation(LConstantOperand::cast(right),
2166 instr->hydrogen()->representation());
2167 __ lea(ToRegister(instr->result()), MemOperand(ToRegister(left), offset));
2169 Operand address(ToRegister(left), ToRegister(right), times_1, 0);
2170 __ lea(ToRegister(instr->result()), address);
2173 if (right->IsConstantOperand()) {
2174 __ add(ToOperand(left),
2175 ToImmediate(right, instr->hydrogen()->representation()));
2177 __ add(ToRegister(left), ToOperand(right));
2179 if (instr->hydrogen()->CheckFlag(HValue::kCanOverflow)) {
2180 DeoptimizeIf(overflow, instr, "overflow");
2186 void LCodeGen::DoMathMinMax(LMathMinMax* instr) {
2187 LOperand* left = instr->left();
2188 LOperand* right = instr->right();
2189 DCHECK(left->Equals(instr->result()));
2190 HMathMinMax::Operation operation = instr->hydrogen()->operation();
2191 if (instr->hydrogen()->representation().IsSmiOrInteger32()) {
2193 Condition condition = (operation == HMathMinMax::kMathMin)
2196 if (right->IsConstantOperand()) {
2197 Operand left_op = ToOperand(left);
2198 Immediate immediate = ToImmediate(LConstantOperand::cast(instr->right()),
2199 instr->hydrogen()->representation());
2200 __ cmp(left_op, immediate);
2201 __ j(condition, &return_left, Label::kNear);
2202 __ mov(left_op, immediate);
2204 Register left_reg = ToRegister(left);
2205 Operand right_op = ToOperand(right);
2206 __ cmp(left_reg, right_op);
2207 __ j(condition, &return_left, Label::kNear);
2208 __ mov(left_reg, right_op);
2210 __ bind(&return_left);
2212 DCHECK(instr->hydrogen()->representation().IsDouble());
2213 Label check_nan_left, check_zero, return_left, return_right;
2214 Condition condition = (operation == HMathMinMax::kMathMin) ? below : above;
2215 X87Register left_reg = ToX87Register(left);
2216 X87Register right_reg = ToX87Register(right);
2218 X87PrepareBinaryOp(left_reg, right_reg, ToX87Register(instr->result()));
2222 __ j(parity_even, &check_nan_left, Label::kNear); // At least one NaN.
2223 __ j(equal, &check_zero, Label::kNear); // left == right.
2224 __ j(condition, &return_left, Label::kNear);
2225 __ jmp(&return_right, Label::kNear);
2227 __ bind(&check_zero);
2231 __ j(not_equal, &return_left, Label::kNear); // left == right != 0.
2232 // At this point, both left and right are either 0 or -0.
2233 if (operation == HMathMinMax::kMathMin) {
2234 // Push st0 and st1 to stack, then pop them to temp registers and OR them,
2236 Register scratch_reg = ToRegister(instr->temp());
2239 __ sub(esp, Immediate(2 * kPointerSize));
2240 __ fstp_s(MemOperand(esp, 0));
2241 __ fstp_s(MemOperand(esp, kPointerSize));
2242 __ pop(scratch_reg);
2243 __ xor_(MemOperand(esp, 0), scratch_reg);
2244 X87Mov(left_reg, MemOperand(esp, 0), kX87FloatOperand);
2245 __ pop(scratch_reg); // restore esp
2247 // Since we operate on +0 and/or -0, addsd and andsd have the same effect.
2251 __ jmp(&return_left, Label::kNear);
2253 __ bind(&check_nan_left);
2256 __ FCmp(); // NaN check.
2257 __ j(parity_even, &return_left, Label::kNear); // left == NaN.
2259 __ bind(&return_right);
2261 X87Mov(left_reg, right_reg);
2263 __ bind(&return_left);
2268 void LCodeGen::DoArithmeticD(LArithmeticD* instr) {
2269 X87Register left = ToX87Register(instr->left());
2270 X87Register right = ToX87Register(instr->right());
2271 X87Register result = ToX87Register(instr->result());
2272 if (instr->op() != Token::MOD) {
2273 X87PrepareBinaryOp(left, right, result);
2275 switch (instr->op()) {
2289 // Pass two doubles as arguments on the stack.
2290 __ PrepareCallCFunction(4, eax);
2291 X87Mov(Operand(esp, 1 * kDoubleSize), right);
2292 X87Mov(Operand(esp, 0), left);
2294 DCHECK(left.is(result));
2295 X87PrepareToWrite(result);
2297 ExternalReference::mod_two_doubles_operation(isolate()),
2300 // Return value is in st(0) on ia32.
2301 X87CommitWrite(result);
2309 // Only always explicitly storing to memory to force the round-down for double
2311 __ lea(esp, Operand(esp, -kDoubleSize));
2312 __ fstp_d(Operand(esp, 0));
2313 __ fld_d(Operand(esp, 0));
2314 __ lea(esp, Operand(esp, kDoubleSize));
2318 void LCodeGen::DoArithmeticT(LArithmeticT* instr) {
2319 DCHECK(ToRegister(instr->context()).is(esi));
2320 DCHECK(ToRegister(instr->left()).is(edx));
2321 DCHECK(ToRegister(instr->right()).is(eax));
2322 DCHECK(ToRegister(instr->result()).is(eax));
2325 CodeFactory::BinaryOpIC(isolate(), instr->op(), NO_OVERWRITE).code();
2326 CallCode(code, RelocInfo::CODE_TARGET, instr);
2330 template<class InstrType>
2331 void LCodeGen::EmitBranch(InstrType instr, Condition cc) {
2332 int left_block = instr->TrueDestination(chunk_);
2333 int right_block = instr->FalseDestination(chunk_);
2335 int next_block = GetNextEmittedBlock();
2337 if (right_block == left_block || cc == no_condition) {
2338 EmitGoto(left_block);
2339 } else if (left_block == next_block) {
2340 __ j(NegateCondition(cc), chunk_->GetAssemblyLabel(right_block));
2341 } else if (right_block == next_block) {
2342 __ j(cc, chunk_->GetAssemblyLabel(left_block));
2344 __ j(cc, chunk_->GetAssemblyLabel(left_block));
2345 __ jmp(chunk_->GetAssemblyLabel(right_block));
2350 template<class InstrType>
2351 void LCodeGen::EmitFalseBranch(InstrType instr, Condition cc) {
2352 int false_block = instr->FalseDestination(chunk_);
2353 if (cc == no_condition) {
2354 __ jmp(chunk_->GetAssemblyLabel(false_block));
2356 __ j(cc, chunk_->GetAssemblyLabel(false_block));
2361 void LCodeGen::DoBranch(LBranch* instr) {
2362 Representation r = instr->hydrogen()->value()->representation();
2363 if (r.IsSmiOrInteger32()) {
2364 Register reg = ToRegister(instr->value());
2365 __ test(reg, Operand(reg));
2366 EmitBranch(instr, not_zero);
2367 } else if (r.IsDouble()) {
2368 X87Register reg = ToX87Register(instr->value());
2369 X87LoadForUsage(reg);
2372 EmitBranch(instr, not_zero);
2374 DCHECK(r.IsTagged());
2375 Register reg = ToRegister(instr->value());
2376 HType type = instr->hydrogen()->value()->type();
2377 if (type.IsBoolean()) {
2378 DCHECK(!info()->IsStub());
2379 __ cmp(reg, factory()->true_value());
2380 EmitBranch(instr, equal);
2381 } else if (type.IsSmi()) {
2382 DCHECK(!info()->IsStub());
2383 __ test(reg, Operand(reg));
2384 EmitBranch(instr, not_equal);
2385 } else if (type.IsJSArray()) {
2386 DCHECK(!info()->IsStub());
2387 EmitBranch(instr, no_condition);
2388 } else if (type.IsHeapNumber()) {
2390 } else if (type.IsString()) {
2391 DCHECK(!info()->IsStub());
2392 __ cmp(FieldOperand(reg, String::kLengthOffset), Immediate(0));
2393 EmitBranch(instr, not_equal);
2395 ToBooleanStub::Types expected = instr->hydrogen()->expected_input_types();
2396 if (expected.IsEmpty()) expected = ToBooleanStub::Types::Generic();
2398 if (expected.Contains(ToBooleanStub::UNDEFINED)) {
2399 // undefined -> false.
2400 __ cmp(reg, factory()->undefined_value());
2401 __ j(equal, instr->FalseLabel(chunk_));
2403 if (expected.Contains(ToBooleanStub::BOOLEAN)) {
2405 __ cmp(reg, factory()->true_value());
2406 __ j(equal, instr->TrueLabel(chunk_));
2408 __ cmp(reg, factory()->false_value());
2409 __ j(equal, instr->FalseLabel(chunk_));
2411 if (expected.Contains(ToBooleanStub::NULL_TYPE)) {
2413 __ cmp(reg, factory()->null_value());
2414 __ j(equal, instr->FalseLabel(chunk_));
2417 if (expected.Contains(ToBooleanStub::SMI)) {
2418 // Smis: 0 -> false, all other -> true.
2419 __ test(reg, Operand(reg));
2420 __ j(equal, instr->FalseLabel(chunk_));
2421 __ JumpIfSmi(reg, instr->TrueLabel(chunk_));
2422 } else if (expected.NeedsMap()) {
2423 // If we need a map later and have a Smi -> deopt.
2424 __ test(reg, Immediate(kSmiTagMask));
2425 DeoptimizeIf(zero, instr, "Smi");
2428 Register map = no_reg; // Keep the compiler happy.
2429 if (expected.NeedsMap()) {
2430 map = ToRegister(instr->temp());
2431 DCHECK(!map.is(reg));
2432 __ mov(map, FieldOperand(reg, HeapObject::kMapOffset));
2434 if (expected.CanBeUndetectable()) {
2435 // Undetectable -> false.
2436 __ test_b(FieldOperand(map, Map::kBitFieldOffset),
2437 1 << Map::kIsUndetectable);
2438 __ j(not_zero, instr->FalseLabel(chunk_));
2442 if (expected.Contains(ToBooleanStub::SPEC_OBJECT)) {
2443 // spec object -> true.
2444 __ CmpInstanceType(map, FIRST_SPEC_OBJECT_TYPE);
2445 __ j(above_equal, instr->TrueLabel(chunk_));
2448 if (expected.Contains(ToBooleanStub::STRING)) {
2449 // String value -> false iff empty.
2451 __ CmpInstanceType(map, FIRST_NONSTRING_TYPE);
2452 __ j(above_equal, ¬_string, Label::kNear);
2453 __ cmp(FieldOperand(reg, String::kLengthOffset), Immediate(0));
2454 __ j(not_zero, instr->TrueLabel(chunk_));
2455 __ jmp(instr->FalseLabel(chunk_));
2456 __ bind(¬_string);
2459 if (expected.Contains(ToBooleanStub::SYMBOL)) {
2460 // Symbol value -> true.
2461 __ CmpInstanceType(map, SYMBOL_TYPE);
2462 __ j(equal, instr->TrueLabel(chunk_));
2465 if (expected.Contains(ToBooleanStub::HEAP_NUMBER)) {
2466 // heap number -> false iff +0, -0, or NaN.
2467 Label not_heap_number;
2468 __ cmp(FieldOperand(reg, HeapObject::kMapOffset),
2469 factory()->heap_number_map());
2470 __ j(not_equal, ¬_heap_number, Label::kNear);
2472 __ fld_d(FieldOperand(reg, HeapNumber::kValueOffset));
2474 __ j(zero, instr->FalseLabel(chunk_));
2475 __ jmp(instr->TrueLabel(chunk_));
2476 __ bind(¬_heap_number);
2479 if (!expected.IsGeneric()) {
2480 // We've seen something for the first time -> deopt.
2481 // This can only happen if we are not generic already.
2482 DeoptimizeIf(no_condition, instr, "unexpected object");
2489 void LCodeGen::EmitGoto(int block) {
2490 if (!IsNextEmittedBlock(block)) {
2491 __ jmp(chunk_->GetAssemblyLabel(LookupDestination(block)));
2496 void LCodeGen::DoClobberDoubles(LClobberDoubles* instr) {
2500 void LCodeGen::DoGoto(LGoto* instr) {
2501 EmitGoto(instr->block_id());
2505 Condition LCodeGen::TokenToCondition(Token::Value op, bool is_unsigned) {
2506 Condition cond = no_condition;
2509 case Token::EQ_STRICT:
2513 case Token::NE_STRICT:
2517 cond = is_unsigned ? below : less;
2520 cond = is_unsigned ? above : greater;
2523 cond = is_unsigned ? below_equal : less_equal;
2526 cond = is_unsigned ? above_equal : greater_equal;
2529 case Token::INSTANCEOF:
2537 void LCodeGen::DoCompareNumericAndBranch(LCompareNumericAndBranch* instr) {
2538 LOperand* left = instr->left();
2539 LOperand* right = instr->right();
2541 instr->is_double() ||
2542 instr->hydrogen()->left()->CheckFlag(HInstruction::kUint32) ||
2543 instr->hydrogen()->right()->CheckFlag(HInstruction::kUint32);
2544 Condition cc = TokenToCondition(instr->op(), is_unsigned);
2546 if (left->IsConstantOperand() && right->IsConstantOperand()) {
2547 // We can statically evaluate the comparison.
2548 double left_val = ToDouble(LConstantOperand::cast(left));
2549 double right_val = ToDouble(LConstantOperand::cast(right));
2550 int next_block = EvalComparison(instr->op(), left_val, right_val) ?
2551 instr->TrueDestination(chunk_) : instr->FalseDestination(chunk_);
2552 EmitGoto(next_block);
2554 if (instr->is_double()) {
2555 X87LoadForUsage(ToX87Register(right), ToX87Register(left));
2557 // Don't base result on EFLAGS when a NaN is involved. Instead
2558 // jump to the false block.
2559 __ j(parity_even, instr->FalseLabel(chunk_));
2561 if (right->IsConstantOperand()) {
2562 __ cmp(ToOperand(left),
2563 ToImmediate(right, instr->hydrogen()->representation()));
2564 } else if (left->IsConstantOperand()) {
2565 __ cmp(ToOperand(right),
2566 ToImmediate(left, instr->hydrogen()->representation()));
2567 // We commuted the operands, so commute the condition.
2568 cc = CommuteCondition(cc);
2570 __ cmp(ToRegister(left), ToOperand(right));
2573 EmitBranch(instr, cc);
2578 void LCodeGen::DoCmpObjectEqAndBranch(LCmpObjectEqAndBranch* instr) {
2579 Register left = ToRegister(instr->left());
2581 if (instr->right()->IsConstantOperand()) {
2582 Handle<Object> right = ToHandle(LConstantOperand::cast(instr->right()));
2583 __ CmpObject(left, right);
2585 Operand right = ToOperand(instr->right());
2586 __ cmp(left, right);
2588 EmitBranch(instr, equal);
2592 void LCodeGen::DoCmpHoleAndBranch(LCmpHoleAndBranch* instr) {
2593 if (instr->hydrogen()->representation().IsTagged()) {
2594 Register input_reg = ToRegister(instr->object());
2595 __ cmp(input_reg, factory()->the_hole_value());
2596 EmitBranch(instr, equal);
2600 // Put the value to the top of stack
2601 X87Register src = ToX87Register(instr->object());
2602 X87LoadForUsage(src);
2607 __ j(parity_even, &ok, Label::kNear);
2609 EmitFalseBranch(instr, no_condition);
2613 __ sub(esp, Immediate(kDoubleSize));
2614 __ fstp_d(MemOperand(esp, 0));
2616 __ add(esp, Immediate(kDoubleSize));
2617 int offset = sizeof(kHoleNanUpper32);
2618 __ cmp(MemOperand(esp, -offset), Immediate(kHoleNanUpper32));
2619 EmitBranch(instr, equal);
2623 void LCodeGen::DoCompareMinusZeroAndBranch(LCompareMinusZeroAndBranch* instr) {
2624 Representation rep = instr->hydrogen()->value()->representation();
2625 DCHECK(!rep.IsInteger32());
2627 if (rep.IsDouble()) {
2628 X87Register input = ToX87Register(instr->value());
2629 X87LoadForUsage(input);
2631 EmitBranch(instr, equal);
2633 Register value = ToRegister(instr->value());
2634 Handle<Map> map = masm()->isolate()->factory()->heap_number_map();
2635 __ CheckMap(value, map, instr->FalseLabel(chunk()), DO_SMI_CHECK);
2636 __ cmp(FieldOperand(value, HeapNumber::kExponentOffset),
2638 EmitFalseBranch(instr, no_overflow);
2639 __ cmp(FieldOperand(value, HeapNumber::kMantissaOffset),
2640 Immediate(0x00000000));
2641 EmitBranch(instr, equal);
2646 Condition LCodeGen::EmitIsObject(Register input,
2648 Label* is_not_object,
2650 __ JumpIfSmi(input, is_not_object);
2652 __ cmp(input, isolate()->factory()->null_value());
2653 __ j(equal, is_object);
2655 __ mov(temp1, FieldOperand(input, HeapObject::kMapOffset));
2656 // Undetectable objects behave like undefined.
2657 __ test_b(FieldOperand(temp1, Map::kBitFieldOffset),
2658 1 << Map::kIsUndetectable);
2659 __ j(not_zero, is_not_object);
2661 __ movzx_b(temp1, FieldOperand(temp1, Map::kInstanceTypeOffset));
2662 __ cmp(temp1, FIRST_NONCALLABLE_SPEC_OBJECT_TYPE);
2663 __ j(below, is_not_object);
2664 __ cmp(temp1, LAST_NONCALLABLE_SPEC_OBJECT_TYPE);
2669 void LCodeGen::DoIsObjectAndBranch(LIsObjectAndBranch* instr) {
2670 Register reg = ToRegister(instr->value());
2671 Register temp = ToRegister(instr->temp());
2673 Condition true_cond = EmitIsObject(
2674 reg, temp, instr->FalseLabel(chunk_), instr->TrueLabel(chunk_));
2676 EmitBranch(instr, true_cond);
2680 Condition LCodeGen::EmitIsString(Register input,
2682 Label* is_not_string,
2683 SmiCheck check_needed = INLINE_SMI_CHECK) {
2684 if (check_needed == INLINE_SMI_CHECK) {
2685 __ JumpIfSmi(input, is_not_string);
2688 Condition cond = masm_->IsObjectStringType(input, temp1, temp1);
2694 void LCodeGen::DoIsStringAndBranch(LIsStringAndBranch* instr) {
2695 Register reg = ToRegister(instr->value());
2696 Register temp = ToRegister(instr->temp());
2698 SmiCheck check_needed =
2699 instr->hydrogen()->value()->type().IsHeapObject()
2700 ? OMIT_SMI_CHECK : INLINE_SMI_CHECK;
2702 Condition true_cond = EmitIsString(
2703 reg, temp, instr->FalseLabel(chunk_), check_needed);
2705 EmitBranch(instr, true_cond);
2709 void LCodeGen::DoIsSmiAndBranch(LIsSmiAndBranch* instr) {
2710 Operand input = ToOperand(instr->value());
2712 __ test(input, Immediate(kSmiTagMask));
2713 EmitBranch(instr, zero);
2717 void LCodeGen::DoIsUndetectableAndBranch(LIsUndetectableAndBranch* instr) {
2718 Register input = ToRegister(instr->value());
2719 Register temp = ToRegister(instr->temp());
2721 if (!instr->hydrogen()->value()->type().IsHeapObject()) {
2722 STATIC_ASSERT(kSmiTag == 0);
2723 __ JumpIfSmi(input, instr->FalseLabel(chunk_));
2725 __ mov(temp, FieldOperand(input, HeapObject::kMapOffset));
2726 __ test_b(FieldOperand(temp, Map::kBitFieldOffset),
2727 1 << Map::kIsUndetectable);
2728 EmitBranch(instr, not_zero);
2732 static Condition ComputeCompareCondition(Token::Value op) {
2734 case Token::EQ_STRICT:
2744 return greater_equal;
2747 return no_condition;
2752 void LCodeGen::DoStringCompareAndBranch(LStringCompareAndBranch* instr) {
2753 Token::Value op = instr->op();
2755 Handle<Code> ic = CodeFactory::CompareIC(isolate(), op).code();
2756 CallCode(ic, RelocInfo::CODE_TARGET, instr);
2758 Condition condition = ComputeCompareCondition(op);
2759 __ test(eax, Operand(eax));
2761 EmitBranch(instr, condition);
2765 static InstanceType TestType(HHasInstanceTypeAndBranch* instr) {
2766 InstanceType from = instr->from();
2767 InstanceType to = instr->to();
2768 if (from == FIRST_TYPE) return to;
2769 DCHECK(from == to || to == LAST_TYPE);
2774 static Condition BranchCondition(HHasInstanceTypeAndBranch* instr) {
2775 InstanceType from = instr->from();
2776 InstanceType to = instr->to();
2777 if (from == to) return equal;
2778 if (to == LAST_TYPE) return above_equal;
2779 if (from == FIRST_TYPE) return below_equal;
2785 void LCodeGen::DoHasInstanceTypeAndBranch(LHasInstanceTypeAndBranch* instr) {
2786 Register input = ToRegister(instr->value());
2787 Register temp = ToRegister(instr->temp());
2789 if (!instr->hydrogen()->value()->type().IsHeapObject()) {
2790 __ JumpIfSmi(input, instr->FalseLabel(chunk_));
2793 __ CmpObjectType(input, TestType(instr->hydrogen()), temp);
2794 EmitBranch(instr, BranchCondition(instr->hydrogen()));
2798 void LCodeGen::DoGetCachedArrayIndex(LGetCachedArrayIndex* instr) {
2799 Register input = ToRegister(instr->value());
2800 Register result = ToRegister(instr->result());
2802 __ AssertString(input);
2804 __ mov(result, FieldOperand(input, String::kHashFieldOffset));
2805 __ IndexFromHash(result, result);
2809 void LCodeGen::DoHasCachedArrayIndexAndBranch(
2810 LHasCachedArrayIndexAndBranch* instr) {
2811 Register input = ToRegister(instr->value());
2813 __ test(FieldOperand(input, String::kHashFieldOffset),
2814 Immediate(String::kContainsCachedArrayIndexMask));
2815 EmitBranch(instr, equal);
2819 // Branches to a label or falls through with the answer in the z flag. Trashes
2820 // the temp registers, but not the input.
2821 void LCodeGen::EmitClassOfTest(Label* is_true,
2823 Handle<String>class_name,
2827 DCHECK(!input.is(temp));
2828 DCHECK(!input.is(temp2));
2829 DCHECK(!temp.is(temp2));
2830 __ JumpIfSmi(input, is_false);
2832 if (String::Equals(isolate()->factory()->Function_string(), class_name)) {
2833 // Assuming the following assertions, we can use the same compares to test
2834 // for both being a function type and being in the object type range.
2835 STATIC_ASSERT(NUM_OF_CALLABLE_SPEC_OBJECT_TYPES == 2);
2836 STATIC_ASSERT(FIRST_NONCALLABLE_SPEC_OBJECT_TYPE ==
2837 FIRST_SPEC_OBJECT_TYPE + 1);
2838 STATIC_ASSERT(LAST_NONCALLABLE_SPEC_OBJECT_TYPE ==
2839 LAST_SPEC_OBJECT_TYPE - 1);
2840 STATIC_ASSERT(LAST_SPEC_OBJECT_TYPE == LAST_TYPE);
2841 __ CmpObjectType(input, FIRST_SPEC_OBJECT_TYPE, temp);
2842 __ j(below, is_false);
2843 __ j(equal, is_true);
2844 __ CmpInstanceType(temp, LAST_SPEC_OBJECT_TYPE);
2845 __ j(equal, is_true);
2847 // Faster code path to avoid two compares: subtract lower bound from the
2848 // actual type and do a signed compare with the width of the type range.
2849 __ mov(temp, FieldOperand(input, HeapObject::kMapOffset));
2850 __ movzx_b(temp2, FieldOperand(temp, Map::kInstanceTypeOffset));
2851 __ sub(Operand(temp2), Immediate(FIRST_NONCALLABLE_SPEC_OBJECT_TYPE));
2852 __ cmp(Operand(temp2), Immediate(LAST_NONCALLABLE_SPEC_OBJECT_TYPE -
2853 FIRST_NONCALLABLE_SPEC_OBJECT_TYPE));
2854 __ j(above, is_false);
2857 // Now we are in the FIRST-LAST_NONCALLABLE_SPEC_OBJECT_TYPE range.
2858 // Check if the constructor in the map is a function.
2859 __ mov(temp, FieldOperand(temp, Map::kConstructorOffset));
2860 // Objects with a non-function constructor have class 'Object'.
2861 __ CmpObjectType(temp, JS_FUNCTION_TYPE, temp2);
2862 if (String::Equals(class_name, isolate()->factory()->Object_string())) {
2863 __ j(not_equal, is_true);
2865 __ j(not_equal, is_false);
2868 // temp now contains the constructor function. Grab the
2869 // instance class name from there.
2870 __ mov(temp, FieldOperand(temp, JSFunction::kSharedFunctionInfoOffset));
2871 __ mov(temp, FieldOperand(temp,
2872 SharedFunctionInfo::kInstanceClassNameOffset));
2873 // The class name we are testing against is internalized since it's a literal.
2874 // The name in the constructor is internalized because of the way the context
2875 // is booted. This routine isn't expected to work for random API-created
2876 // classes and it doesn't have to because you can't access it with natives
2877 // syntax. Since both sides are internalized it is sufficient to use an
2878 // identity comparison.
2879 __ cmp(temp, class_name);
2880 // End with the answer in the z flag.
2884 void LCodeGen::DoClassOfTestAndBranch(LClassOfTestAndBranch* instr) {
2885 Register input = ToRegister(instr->value());
2886 Register temp = ToRegister(instr->temp());
2887 Register temp2 = ToRegister(instr->temp2());
2889 Handle<String> class_name = instr->hydrogen()->class_name();
2891 EmitClassOfTest(instr->TrueLabel(chunk_), instr->FalseLabel(chunk_),
2892 class_name, input, temp, temp2);
2894 EmitBranch(instr, equal);
2898 void LCodeGen::DoCmpMapAndBranch(LCmpMapAndBranch* instr) {
2899 Register reg = ToRegister(instr->value());
2900 __ cmp(FieldOperand(reg, HeapObject::kMapOffset), instr->map());
2901 EmitBranch(instr, equal);
2905 void LCodeGen::DoInstanceOf(LInstanceOf* instr) {
2906 // Object and function are in fixed registers defined by the stub.
2907 DCHECK(ToRegister(instr->context()).is(esi));
2908 InstanceofStub stub(isolate(), InstanceofStub::kArgsInRegisters);
2909 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
2911 Label true_value, done;
2912 __ test(eax, Operand(eax));
2913 __ j(zero, &true_value, Label::kNear);
2914 __ mov(ToRegister(instr->result()), factory()->false_value());
2915 __ jmp(&done, Label::kNear);
2916 __ bind(&true_value);
2917 __ mov(ToRegister(instr->result()), factory()->true_value());
2922 void LCodeGen::DoInstanceOfKnownGlobal(LInstanceOfKnownGlobal* instr) {
2923 class DeferredInstanceOfKnownGlobal FINAL : public LDeferredCode {
2925 DeferredInstanceOfKnownGlobal(LCodeGen* codegen,
2926 LInstanceOfKnownGlobal* instr,
2927 const X87Stack& x87_stack)
2928 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
2929 virtual void Generate() OVERRIDE {
2930 codegen()->DoDeferredInstanceOfKnownGlobal(instr_, &map_check_);
2932 virtual LInstruction* instr() OVERRIDE { return instr_; }
2933 Label* map_check() { return &map_check_; }
2935 LInstanceOfKnownGlobal* instr_;
2939 DeferredInstanceOfKnownGlobal* deferred;
2940 deferred = new(zone()) DeferredInstanceOfKnownGlobal(this, instr, x87_stack_);
2942 Label done, false_result;
2943 Register object = ToRegister(instr->value());
2944 Register temp = ToRegister(instr->temp());
2946 // A Smi is not an instance of anything.
2947 __ JumpIfSmi(object, &false_result, Label::kNear);
2949 // This is the inlined call site instanceof cache. The two occurences of the
2950 // hole value will be patched to the last map/result pair generated by the
2953 Register map = ToRegister(instr->temp());
2954 __ mov(map, FieldOperand(object, HeapObject::kMapOffset));
2955 __ bind(deferred->map_check()); // Label for calculating code patching.
2956 Handle<Cell> cache_cell = factory()->NewCell(factory()->the_hole_value());
2957 __ cmp(map, Operand::ForCell(cache_cell)); // Patched to cached map.
2958 __ j(not_equal, &cache_miss, Label::kNear);
2959 __ mov(eax, factory()->the_hole_value()); // Patched to either true or false.
2960 __ jmp(&done, Label::kNear);
2962 // The inlined call site cache did not match. Check for null and string
2963 // before calling the deferred code.
2964 __ bind(&cache_miss);
2965 // Null is not an instance of anything.
2966 __ cmp(object, factory()->null_value());
2967 __ j(equal, &false_result, Label::kNear);
2969 // String values are not instances of anything.
2970 Condition is_string = masm_->IsObjectStringType(object, temp, temp);
2971 __ j(is_string, &false_result, Label::kNear);
2973 // Go to the deferred code.
2974 __ jmp(deferred->entry());
2976 __ bind(&false_result);
2977 __ mov(ToRegister(instr->result()), factory()->false_value());
2979 // Here result has either true or false. Deferred code also produces true or
2981 __ bind(deferred->exit());
2986 void LCodeGen::DoDeferredInstanceOfKnownGlobal(LInstanceOfKnownGlobal* instr,
2988 PushSafepointRegistersScope scope(this);
2990 InstanceofStub::Flags flags = InstanceofStub::kNoFlags;
2991 flags = static_cast<InstanceofStub::Flags>(
2992 flags | InstanceofStub::kArgsInRegisters);
2993 flags = static_cast<InstanceofStub::Flags>(
2994 flags | InstanceofStub::kCallSiteInlineCheck);
2995 flags = static_cast<InstanceofStub::Flags>(
2996 flags | InstanceofStub::kReturnTrueFalseObject);
2997 InstanceofStub stub(isolate(), flags);
2999 // Get the temp register reserved by the instruction. This needs to be a
3000 // register which is pushed last by PushSafepointRegisters as top of the
3001 // stack is used to pass the offset to the location of the map check to
3003 Register temp = ToRegister(instr->temp());
3004 DCHECK(MacroAssembler::SafepointRegisterStackIndex(temp) == 0);
3005 __ LoadHeapObject(InstanceofStub::right(), instr->function());
3006 static const int kAdditionalDelta = 13;
3007 int delta = masm_->SizeOfCodeGeneratedSince(map_check) + kAdditionalDelta;
3008 __ mov(temp, Immediate(delta));
3009 __ StoreToSafepointRegisterSlot(temp, temp);
3010 CallCodeGeneric(stub.GetCode(),
3011 RelocInfo::CODE_TARGET,
3013 RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS);
3014 // Get the deoptimization index of the LLazyBailout-environment that
3015 // corresponds to this instruction.
3016 LEnvironment* env = instr->GetDeferredLazyDeoptimizationEnvironment();
3017 safepoints_.RecordLazyDeoptimizationIndex(env->deoptimization_index());
3019 // Put the result value into the eax slot and restore all registers.
3020 __ StoreToSafepointRegisterSlot(eax, eax);
3024 void LCodeGen::DoCmpT(LCmpT* instr) {
3025 Token::Value op = instr->op();
3027 Handle<Code> ic = CodeFactory::CompareIC(isolate(), op).code();
3028 CallCode(ic, RelocInfo::CODE_TARGET, instr);
3030 Condition condition = ComputeCompareCondition(op);
3031 Label true_value, done;
3032 __ test(eax, Operand(eax));
3033 __ j(condition, &true_value, Label::kNear);
3034 __ mov(ToRegister(instr->result()), factory()->false_value());
3035 __ jmp(&done, Label::kNear);
3036 __ bind(&true_value);
3037 __ mov(ToRegister(instr->result()), factory()->true_value());
3042 void LCodeGen::EmitReturn(LReturn* instr, bool dynamic_frame_alignment) {
3043 int extra_value_count = dynamic_frame_alignment ? 2 : 1;
3045 if (instr->has_constant_parameter_count()) {
3046 int parameter_count = ToInteger32(instr->constant_parameter_count());
3047 if (dynamic_frame_alignment && FLAG_debug_code) {
3049 (parameter_count + extra_value_count) * kPointerSize),
3050 Immediate(kAlignmentZapValue));
3051 __ Assert(equal, kExpectedAlignmentMarker);
3053 __ Ret((parameter_count + extra_value_count) * kPointerSize, ecx);
3055 Register reg = ToRegister(instr->parameter_count());
3056 // The argument count parameter is a smi
3058 Register return_addr_reg = reg.is(ecx) ? ebx : ecx;
3059 if (dynamic_frame_alignment && FLAG_debug_code) {
3060 DCHECK(extra_value_count == 2);
3061 __ cmp(Operand(esp, reg, times_pointer_size,
3062 extra_value_count * kPointerSize),
3063 Immediate(kAlignmentZapValue));
3064 __ Assert(equal, kExpectedAlignmentMarker);
3067 // emit code to restore stack based on instr->parameter_count()
3068 __ pop(return_addr_reg); // save return address
3069 if (dynamic_frame_alignment) {
3070 __ inc(reg); // 1 more for alignment
3072 __ shl(reg, kPointerSizeLog2);
3074 __ jmp(return_addr_reg);
3079 void LCodeGen::DoReturn(LReturn* instr) {
3080 if (FLAG_trace && info()->IsOptimizing()) {
3081 // Preserve the return value on the stack and rely on the runtime call
3082 // to return the value in the same register. We're leaving the code
3083 // managed by the register allocator and tearing down the frame, it's
3084 // safe to write to the context register.
3086 __ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
3087 __ CallRuntime(Runtime::kTraceExit, 1);
3089 if (dynamic_frame_alignment_) {
3090 // Fetch the state of the dynamic frame alignment.
3091 __ mov(edx, Operand(ebp,
3092 JavaScriptFrameConstants::kDynamicAlignmentStateOffset));
3094 int no_frame_start = -1;
3095 if (NeedsEagerFrame()) {
3098 no_frame_start = masm_->pc_offset();
3100 if (dynamic_frame_alignment_) {
3102 __ cmp(edx, Immediate(kNoAlignmentPadding));
3103 __ j(equal, &no_padding, Label::kNear);
3105 EmitReturn(instr, true);
3106 __ bind(&no_padding);
3109 EmitReturn(instr, false);
3110 if (no_frame_start != -1) {
3111 info()->AddNoFrameRange(no_frame_start, masm_->pc_offset());
3116 void LCodeGen::DoLoadGlobalCell(LLoadGlobalCell* instr) {
3117 Register result = ToRegister(instr->result());
3118 __ mov(result, Operand::ForCell(instr->hydrogen()->cell().handle()));
3119 if (instr->hydrogen()->RequiresHoleCheck()) {
3120 __ cmp(result, factory()->the_hole_value());
3121 DeoptimizeIf(equal, instr, "hole");
3127 void LCodeGen::EmitVectorLoadICRegisters(T* instr) {
3128 DCHECK(FLAG_vector_ics);
3129 Register vector = ToRegister(instr->temp_vector());
3130 DCHECK(vector.is(VectorLoadICDescriptor::VectorRegister()));
3131 __ mov(vector, instr->hydrogen()->feedback_vector());
3132 // No need to allocate this register.
3133 DCHECK(VectorLoadICDescriptor::SlotRegister().is(eax));
3134 __ mov(VectorLoadICDescriptor::SlotRegister(),
3135 Immediate(Smi::FromInt(instr->hydrogen()->slot())));
3139 void LCodeGen::DoLoadGlobalGeneric(LLoadGlobalGeneric* instr) {
3140 DCHECK(ToRegister(instr->context()).is(esi));
3141 DCHECK(ToRegister(instr->global_object())
3142 .is(LoadDescriptor::ReceiverRegister()));
3143 DCHECK(ToRegister(instr->result()).is(eax));
3145 __ mov(LoadDescriptor::NameRegister(), instr->name());
3146 if (FLAG_vector_ics) {
3147 EmitVectorLoadICRegisters<LLoadGlobalGeneric>(instr);
3149 ContextualMode mode = instr->for_typeof() ? NOT_CONTEXTUAL : CONTEXTUAL;
3150 Handle<Code> ic = CodeFactory::LoadIC(isolate(), mode).code();
3151 CallCode(ic, RelocInfo::CODE_TARGET, instr);
3155 void LCodeGen::DoStoreGlobalCell(LStoreGlobalCell* instr) {
3156 Register value = ToRegister(instr->value());
3157 Handle<PropertyCell> cell_handle = instr->hydrogen()->cell().handle();
3159 // If the cell we are storing to contains the hole it could have
3160 // been deleted from the property dictionary. In that case, we need
3161 // to update the property details in the property dictionary to mark
3162 // it as no longer deleted. We deoptimize in that case.
3163 if (instr->hydrogen()->RequiresHoleCheck()) {
3164 __ cmp(Operand::ForCell(cell_handle), factory()->the_hole_value());
3165 DeoptimizeIf(equal, instr, "hole");
3169 __ mov(Operand::ForCell(cell_handle), value);
3170 // Cells are always rescanned, so no write barrier here.
3174 void LCodeGen::DoLoadContextSlot(LLoadContextSlot* instr) {
3175 Register context = ToRegister(instr->context());
3176 Register result = ToRegister(instr->result());
3177 __ mov(result, ContextOperand(context, instr->slot_index()));
3179 if (instr->hydrogen()->RequiresHoleCheck()) {
3180 __ cmp(result, factory()->the_hole_value());
3181 if (instr->hydrogen()->DeoptimizesOnHole()) {
3182 DeoptimizeIf(equal, instr, "hole");
3185 __ j(not_equal, &is_not_hole, Label::kNear);
3186 __ mov(result, factory()->undefined_value());
3187 __ bind(&is_not_hole);
3193 void LCodeGen::DoStoreContextSlot(LStoreContextSlot* instr) {
3194 Register context = ToRegister(instr->context());
3195 Register value = ToRegister(instr->value());
3197 Label skip_assignment;
3199 Operand target = ContextOperand(context, instr->slot_index());
3200 if (instr->hydrogen()->RequiresHoleCheck()) {
3201 __ cmp(target, factory()->the_hole_value());
3202 if (instr->hydrogen()->DeoptimizesOnHole()) {
3203 DeoptimizeIf(equal, instr, "hole");
3205 __ j(not_equal, &skip_assignment, Label::kNear);
3209 __ mov(target, value);
3210 if (instr->hydrogen()->NeedsWriteBarrier()) {
3211 SmiCheck check_needed =
3212 instr->hydrogen()->value()->type().IsHeapObject()
3213 ? OMIT_SMI_CHECK : INLINE_SMI_CHECK;
3214 Register temp = ToRegister(instr->temp());
3215 int offset = Context::SlotOffset(instr->slot_index());
3216 __ RecordWriteContextSlot(context, offset, value, temp, kSaveFPRegs,
3217 EMIT_REMEMBERED_SET, check_needed);
3220 __ bind(&skip_assignment);
3224 void LCodeGen::DoLoadNamedField(LLoadNamedField* instr) {
3225 HObjectAccess access = instr->hydrogen()->access();
3226 int offset = access.offset();
3228 if (access.IsExternalMemory()) {
3229 Register result = ToRegister(instr->result());
3230 MemOperand operand = instr->object()->IsConstantOperand()
3231 ? MemOperand::StaticVariable(ToExternalReference(
3232 LConstantOperand::cast(instr->object())))
3233 : MemOperand(ToRegister(instr->object()), offset);
3234 __ Load(result, operand, access.representation());
3238 Register object = ToRegister(instr->object());
3239 if (instr->hydrogen()->representation().IsDouble()) {
3240 X87Mov(ToX87Register(instr->result()), FieldOperand(object, offset));
3244 Register result = ToRegister(instr->result());
3245 if (!access.IsInobject()) {
3246 __ mov(result, FieldOperand(object, JSObject::kPropertiesOffset));
3249 __ Load(result, FieldOperand(object, offset), access.representation());
3253 void LCodeGen::EmitPushTaggedOperand(LOperand* operand) {
3254 DCHECK(!operand->IsDoubleRegister());
3255 if (operand->IsConstantOperand()) {
3256 Handle<Object> object = ToHandle(LConstantOperand::cast(operand));
3257 AllowDeferredHandleDereference smi_check;
3258 if (object->IsSmi()) {
3259 __ Push(Handle<Smi>::cast(object));
3261 __ PushHeapObject(Handle<HeapObject>::cast(object));
3263 } else if (operand->IsRegister()) {
3264 __ push(ToRegister(operand));
3266 __ push(ToOperand(operand));
3271 void LCodeGen::DoLoadNamedGeneric(LLoadNamedGeneric* instr) {
3272 DCHECK(ToRegister(instr->context()).is(esi));
3273 DCHECK(ToRegister(instr->object()).is(LoadDescriptor::ReceiverRegister()));
3274 DCHECK(ToRegister(instr->result()).is(eax));
3276 __ mov(LoadDescriptor::NameRegister(), instr->name());
3277 if (FLAG_vector_ics) {
3278 EmitVectorLoadICRegisters<LLoadNamedGeneric>(instr);
3280 Handle<Code> ic = CodeFactory::LoadIC(isolate(), NOT_CONTEXTUAL).code();
3281 CallCode(ic, RelocInfo::CODE_TARGET, instr);
3285 void LCodeGen::DoLoadFunctionPrototype(LLoadFunctionPrototype* instr) {
3286 Register function = ToRegister(instr->function());
3287 Register temp = ToRegister(instr->temp());
3288 Register result = ToRegister(instr->result());
3290 // Get the prototype or initial map from the function.
3292 FieldOperand(function, JSFunction::kPrototypeOrInitialMapOffset));
3294 // Check that the function has a prototype or an initial map.
3295 __ cmp(Operand(result), Immediate(factory()->the_hole_value()));
3296 DeoptimizeIf(equal, instr, "hole");
3298 // If the function does not have an initial map, we're done.
3300 __ CmpObjectType(result, MAP_TYPE, temp);
3301 __ j(not_equal, &done, Label::kNear);
3303 // Get the prototype from the initial map.
3304 __ mov(result, FieldOperand(result, Map::kPrototypeOffset));
3311 void LCodeGen::DoLoadRoot(LLoadRoot* instr) {
3312 Register result = ToRegister(instr->result());
3313 __ LoadRoot(result, instr->index());
3317 void LCodeGen::DoAccessArgumentsAt(LAccessArgumentsAt* instr) {
3318 Register arguments = ToRegister(instr->arguments());
3319 Register result = ToRegister(instr->result());
3320 if (instr->length()->IsConstantOperand() &&
3321 instr->index()->IsConstantOperand()) {
3322 int const_index = ToInteger32(LConstantOperand::cast(instr->index()));
3323 int const_length = ToInteger32(LConstantOperand::cast(instr->length()));
3324 int index = (const_length - const_index) + 1;
3325 __ mov(result, Operand(arguments, index * kPointerSize));
3327 Register length = ToRegister(instr->length());
3328 Operand index = ToOperand(instr->index());
3329 // There are two words between the frame pointer and the last argument.
3330 // Subtracting from length accounts for one of them add one more.
3331 __ sub(length, index);
3332 __ mov(result, Operand(arguments, length, times_4, kPointerSize));
3337 void LCodeGen::DoLoadKeyedExternalArray(LLoadKeyed* instr) {
3338 ElementsKind elements_kind = instr->elements_kind();
3339 LOperand* key = instr->key();
3340 if (!key->IsConstantOperand() &&
3341 ExternalArrayOpRequiresTemp(instr->hydrogen()->key()->representation(),
3343 __ SmiUntag(ToRegister(key));
3345 Operand operand(BuildFastArrayOperand(
3348 instr->hydrogen()->key()->representation(),
3350 instr->base_offset()));
3351 if (elements_kind == EXTERNAL_FLOAT32_ELEMENTS ||
3352 elements_kind == FLOAT32_ELEMENTS) {
3353 X87Mov(ToX87Register(instr->result()), operand, kX87FloatOperand);
3354 } else if (elements_kind == EXTERNAL_FLOAT64_ELEMENTS ||
3355 elements_kind == FLOAT64_ELEMENTS) {
3356 X87Mov(ToX87Register(instr->result()), operand);
3358 Register result(ToRegister(instr->result()));
3359 switch (elements_kind) {
3360 case EXTERNAL_INT8_ELEMENTS:
3362 __ movsx_b(result, operand);
3364 case EXTERNAL_UINT8_CLAMPED_ELEMENTS:
3365 case EXTERNAL_UINT8_ELEMENTS:
3366 case UINT8_ELEMENTS:
3367 case UINT8_CLAMPED_ELEMENTS:
3368 __ movzx_b(result, operand);
3370 case EXTERNAL_INT16_ELEMENTS:
3371 case INT16_ELEMENTS:
3372 __ movsx_w(result, operand);
3374 case EXTERNAL_UINT16_ELEMENTS:
3375 case UINT16_ELEMENTS:
3376 __ movzx_w(result, operand);
3378 case EXTERNAL_INT32_ELEMENTS:
3379 case INT32_ELEMENTS:
3380 __ mov(result, operand);
3382 case EXTERNAL_UINT32_ELEMENTS:
3383 case UINT32_ELEMENTS:
3384 __ mov(result, operand);
3385 if (!instr->hydrogen()->CheckFlag(HInstruction::kUint32)) {
3386 __ test(result, Operand(result));
3387 DeoptimizeIf(negative, instr, "negative value");
3390 case EXTERNAL_FLOAT32_ELEMENTS:
3391 case EXTERNAL_FLOAT64_ELEMENTS:
3392 case FLOAT32_ELEMENTS:
3393 case FLOAT64_ELEMENTS:
3394 case FAST_SMI_ELEMENTS:
3396 case FAST_DOUBLE_ELEMENTS:
3397 case FAST_HOLEY_SMI_ELEMENTS:
3398 case FAST_HOLEY_ELEMENTS:
3399 case FAST_HOLEY_DOUBLE_ELEMENTS:
3400 case DICTIONARY_ELEMENTS:
3401 case SLOPPY_ARGUMENTS_ELEMENTS:
3409 void LCodeGen::DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr) {
3410 if (instr->hydrogen()->RequiresHoleCheck()) {
3411 Operand hole_check_operand = BuildFastArrayOperand(
3412 instr->elements(), instr->key(),
3413 instr->hydrogen()->key()->representation(),
3414 FAST_DOUBLE_ELEMENTS,
3415 instr->base_offset() + sizeof(kHoleNanLower32));
3416 __ cmp(hole_check_operand, Immediate(kHoleNanUpper32));
3417 DeoptimizeIf(equal, instr, "hole");
3420 Operand double_load_operand = BuildFastArrayOperand(
3423 instr->hydrogen()->key()->representation(),
3424 FAST_DOUBLE_ELEMENTS,
3425 instr->base_offset());
3426 X87Mov(ToX87Register(instr->result()), double_load_operand);
3430 void LCodeGen::DoLoadKeyedFixedArray(LLoadKeyed* instr) {
3431 Register result = ToRegister(instr->result());
3435 BuildFastArrayOperand(instr->elements(), instr->key(),
3436 instr->hydrogen()->key()->representation(),
3437 FAST_ELEMENTS, instr->base_offset()));
3439 // Check for the hole value.
3440 if (instr->hydrogen()->RequiresHoleCheck()) {
3441 if (IsFastSmiElementsKind(instr->hydrogen()->elements_kind())) {
3442 __ test(result, Immediate(kSmiTagMask));
3443 DeoptimizeIf(not_equal, instr, "not a Smi");
3445 __ cmp(result, factory()->the_hole_value());
3446 DeoptimizeIf(equal, instr, "hole");
3452 void LCodeGen::DoLoadKeyed(LLoadKeyed* instr) {
3453 if (instr->is_typed_elements()) {
3454 DoLoadKeyedExternalArray(instr);
3455 } else if (instr->hydrogen()->representation().IsDouble()) {
3456 DoLoadKeyedFixedDoubleArray(instr);
3458 DoLoadKeyedFixedArray(instr);
3463 Operand LCodeGen::BuildFastArrayOperand(
3464 LOperand* elements_pointer,
3466 Representation key_representation,
3467 ElementsKind elements_kind,
3468 uint32_t base_offset) {
3469 Register elements_pointer_reg = ToRegister(elements_pointer);
3470 int element_shift_size = ElementsKindToShiftSize(elements_kind);
3471 int shift_size = element_shift_size;
3472 if (key->IsConstantOperand()) {
3473 int constant_value = ToInteger32(LConstantOperand::cast(key));
3474 if (constant_value & 0xF0000000) {
3475 Abort(kArrayIndexConstantValueTooBig);
3477 return Operand(elements_pointer_reg,
3478 ((constant_value) << shift_size)
3481 // Take the tag bit into account while computing the shift size.
3482 if (key_representation.IsSmi() && (shift_size >= 1)) {
3483 shift_size -= kSmiTagSize;
3485 ScaleFactor scale_factor = static_cast<ScaleFactor>(shift_size);
3486 return Operand(elements_pointer_reg,
3494 void LCodeGen::DoLoadKeyedGeneric(LLoadKeyedGeneric* instr) {
3495 DCHECK(ToRegister(instr->context()).is(esi));
3496 DCHECK(ToRegister(instr->object()).is(LoadDescriptor::ReceiverRegister()));
3497 DCHECK(ToRegister(instr->key()).is(LoadDescriptor::NameRegister()));
3499 if (FLAG_vector_ics) {
3500 EmitVectorLoadICRegisters<LLoadKeyedGeneric>(instr);
3503 Handle<Code> ic = CodeFactory::KeyedLoadIC(isolate()).code();
3504 CallCode(ic, RelocInfo::CODE_TARGET, instr);
3508 void LCodeGen::DoArgumentsElements(LArgumentsElements* instr) {
3509 Register result = ToRegister(instr->result());
3511 if (instr->hydrogen()->from_inlined()) {
3512 __ lea(result, Operand(esp, -2 * kPointerSize));
3514 // Check for arguments adapter frame.
3515 Label done, adapted;
3516 __ mov(result, Operand(ebp, StandardFrameConstants::kCallerFPOffset));
3517 __ mov(result, Operand(result, StandardFrameConstants::kContextOffset));
3518 __ cmp(Operand(result),
3519 Immediate(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
3520 __ j(equal, &adapted, Label::kNear);
3522 // No arguments adaptor frame.
3523 __ mov(result, Operand(ebp));
3524 __ jmp(&done, Label::kNear);
3526 // Arguments adaptor frame present.
3528 __ mov(result, Operand(ebp, StandardFrameConstants::kCallerFPOffset));
3530 // Result is the frame pointer for the frame if not adapted and for the real
3531 // frame below the adaptor frame if adapted.
3537 void LCodeGen::DoArgumentsLength(LArgumentsLength* instr) {
3538 Operand elem = ToOperand(instr->elements());
3539 Register result = ToRegister(instr->result());
3543 // If no arguments adaptor frame the number of arguments is fixed.
3545 __ mov(result, Immediate(scope()->num_parameters()));
3546 __ j(equal, &done, Label::kNear);
3548 // Arguments adaptor frame present. Get argument length from there.
3549 __ mov(result, Operand(ebp, StandardFrameConstants::kCallerFPOffset));
3550 __ mov(result, Operand(result,
3551 ArgumentsAdaptorFrameConstants::kLengthOffset));
3552 __ SmiUntag(result);
3554 // Argument length is in result register.
3559 void LCodeGen::DoWrapReceiver(LWrapReceiver* instr) {
3560 Register receiver = ToRegister(instr->receiver());
3561 Register function = ToRegister(instr->function());
3563 // If the receiver is null or undefined, we have to pass the global
3564 // object as a receiver to normal functions. Values have to be
3565 // passed unchanged to builtins and strict-mode functions.
3566 Label receiver_ok, global_object;
3567 Label::Distance dist = DeoptEveryNTimes() ? Label::kFar : Label::kNear;
3568 Register scratch = ToRegister(instr->temp());
3570 if (!instr->hydrogen()->known_function()) {
3571 // Do not transform the receiver to object for strict mode
3574 FieldOperand(function, JSFunction::kSharedFunctionInfoOffset));
3575 __ test_b(FieldOperand(scratch, SharedFunctionInfo::kStrictModeByteOffset),
3576 1 << SharedFunctionInfo::kStrictModeBitWithinByte);
3577 __ j(not_equal, &receiver_ok, dist);
3579 // Do not transform the receiver to object for builtins.
3580 __ test_b(FieldOperand(scratch, SharedFunctionInfo::kNativeByteOffset),
3581 1 << SharedFunctionInfo::kNativeBitWithinByte);
3582 __ j(not_equal, &receiver_ok, dist);
3585 // Normal function. Replace undefined or null with global receiver.
3586 __ cmp(receiver, factory()->null_value());
3587 __ j(equal, &global_object, Label::kNear);
3588 __ cmp(receiver, factory()->undefined_value());
3589 __ j(equal, &global_object, Label::kNear);
3591 // The receiver should be a JS object.
3592 __ test(receiver, Immediate(kSmiTagMask));
3593 DeoptimizeIf(equal, instr, "Smi");
3594 __ CmpObjectType(receiver, FIRST_SPEC_OBJECT_TYPE, scratch);
3595 DeoptimizeIf(below, instr, "not a JavaScript object");
3597 __ jmp(&receiver_ok, Label::kNear);
3598 __ bind(&global_object);
3599 __ mov(receiver, FieldOperand(function, JSFunction::kContextOffset));
3600 const int global_offset = Context::SlotOffset(Context::GLOBAL_OBJECT_INDEX);
3601 __ mov(receiver, Operand(receiver, global_offset));
3602 const int proxy_offset = GlobalObject::kGlobalProxyOffset;
3603 __ mov(receiver, FieldOperand(receiver, proxy_offset));
3604 __ bind(&receiver_ok);
3608 void LCodeGen::DoApplyArguments(LApplyArguments* instr) {
3609 Register receiver = ToRegister(instr->receiver());
3610 Register function = ToRegister(instr->function());
3611 Register length = ToRegister(instr->length());
3612 Register elements = ToRegister(instr->elements());
3613 DCHECK(receiver.is(eax)); // Used for parameter count.
3614 DCHECK(function.is(edi)); // Required by InvokeFunction.
3615 DCHECK(ToRegister(instr->result()).is(eax));
3617 // Copy the arguments to this function possibly from the
3618 // adaptor frame below it.
3619 const uint32_t kArgumentsLimit = 1 * KB;
3620 __ cmp(length, kArgumentsLimit);
3621 DeoptimizeIf(above, instr, "too many arguments");
3624 __ mov(receiver, length);
3626 // Loop through the arguments pushing them onto the execution
3629 // length is a small non-negative integer, due to the test above.
3630 __ test(length, Operand(length));
3631 __ j(zero, &invoke, Label::kNear);
3633 __ push(Operand(elements, length, times_pointer_size, 1 * kPointerSize));
3635 __ j(not_zero, &loop);
3637 // Invoke the function.
3639 DCHECK(instr->HasPointerMap());
3640 LPointerMap* pointers = instr->pointer_map();
3641 SafepointGenerator safepoint_generator(
3642 this, pointers, Safepoint::kLazyDeopt);
3643 ParameterCount actual(eax);
3644 __ InvokeFunction(function, actual, CALL_FUNCTION, safepoint_generator);
3648 void LCodeGen::DoDebugBreak(LDebugBreak* instr) {
3653 void LCodeGen::DoPushArgument(LPushArgument* instr) {
3654 LOperand* argument = instr->value();
3655 EmitPushTaggedOperand(argument);
3659 void LCodeGen::DoDrop(LDrop* instr) {
3660 __ Drop(instr->count());
3664 void LCodeGen::DoThisFunction(LThisFunction* instr) {
3665 Register result = ToRegister(instr->result());
3666 __ mov(result, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
3670 void LCodeGen::DoContext(LContext* instr) {
3671 Register result = ToRegister(instr->result());
3672 if (info()->IsOptimizing()) {
3673 __ mov(result, Operand(ebp, StandardFrameConstants::kContextOffset));
3675 // If there is no frame, the context must be in esi.
3676 DCHECK(result.is(esi));
3681 void LCodeGen::DoDeclareGlobals(LDeclareGlobals* instr) {
3682 DCHECK(ToRegister(instr->context()).is(esi));
3683 __ push(esi); // The context is the first argument.
3684 __ push(Immediate(instr->hydrogen()->pairs()));
3685 __ push(Immediate(Smi::FromInt(instr->hydrogen()->flags())));
3686 CallRuntime(Runtime::kDeclareGlobals, 3, instr);
3690 void LCodeGen::CallKnownFunction(Handle<JSFunction> function,
3691 int formal_parameter_count,
3693 LInstruction* instr,
3694 EDIState edi_state) {
3695 bool dont_adapt_arguments =
3696 formal_parameter_count == SharedFunctionInfo::kDontAdaptArgumentsSentinel;
3697 bool can_invoke_directly =
3698 dont_adapt_arguments || formal_parameter_count == arity;
3700 if (can_invoke_directly) {
3701 if (edi_state == EDI_UNINITIALIZED) {
3702 __ LoadHeapObject(edi, function);
3706 __ mov(esi, FieldOperand(edi, JSFunction::kContextOffset));
3708 // Set eax to arguments count if adaption is not needed. Assumes that eax
3709 // is available to write to at this point.
3710 if (dont_adapt_arguments) {
3714 // Invoke function directly.
3715 if (function.is_identical_to(info()->closure())) {
3718 __ call(FieldOperand(edi, JSFunction::kCodeEntryOffset));
3720 RecordSafepointWithLazyDeopt(instr, RECORD_SIMPLE_SAFEPOINT);
3722 // We need to adapt arguments.
3723 LPointerMap* pointers = instr->pointer_map();
3724 SafepointGenerator generator(
3725 this, pointers, Safepoint::kLazyDeopt);
3726 ParameterCount count(arity);
3727 ParameterCount expected(formal_parameter_count);
3728 __ InvokeFunction(function, expected, count, CALL_FUNCTION, generator);
3733 void LCodeGen::DoTailCallThroughMegamorphicCache(
3734 LTailCallThroughMegamorphicCache* instr) {
3735 Register receiver = ToRegister(instr->receiver());
3736 Register name = ToRegister(instr->name());
3737 DCHECK(receiver.is(LoadDescriptor::ReceiverRegister()));
3738 DCHECK(name.is(LoadDescriptor::NameRegister()));
3740 Register scratch = ebx;
3741 Register extra = eax;
3742 DCHECK(!scratch.is(receiver) && !scratch.is(name));
3743 DCHECK(!extra.is(receiver) && !extra.is(name));
3745 // Important for the tail-call.
3746 bool must_teardown_frame = NeedsEagerFrame();
3748 // The probe will tail call to a handler if found.
3749 isolate()->stub_cache()->GenerateProbe(masm(), instr->hydrogen()->flags(),
3750 must_teardown_frame, receiver, name,
3753 // Tail call to miss if we ended up here.
3754 if (must_teardown_frame) __ leave();
3755 LoadIC::GenerateMiss(masm());
3759 void LCodeGen::DoCallWithDescriptor(LCallWithDescriptor* instr) {
3760 DCHECK(ToRegister(instr->result()).is(eax));
3762 LPointerMap* pointers = instr->pointer_map();
3763 SafepointGenerator generator(this, pointers, Safepoint::kLazyDeopt);
3765 if (instr->target()->IsConstantOperand()) {
3766 LConstantOperand* target = LConstantOperand::cast(instr->target());
3767 Handle<Code> code = Handle<Code>::cast(ToHandle(target));
3768 generator.BeforeCall(__ CallSize(code, RelocInfo::CODE_TARGET));
3769 __ call(code, RelocInfo::CODE_TARGET);
3771 DCHECK(instr->target()->IsRegister());
3772 Register target = ToRegister(instr->target());
3773 generator.BeforeCall(__ CallSize(Operand(target)));
3774 __ add(target, Immediate(Code::kHeaderSize - kHeapObjectTag));
3777 generator.AfterCall();
3781 void LCodeGen::DoCallJSFunction(LCallJSFunction* instr) {
3782 DCHECK(ToRegister(instr->function()).is(edi));
3783 DCHECK(ToRegister(instr->result()).is(eax));
3785 if (instr->hydrogen()->pass_argument_count()) {
3786 __ mov(eax, instr->arity());
3790 __ mov(esi, FieldOperand(edi, JSFunction::kContextOffset));
3792 bool is_self_call = false;
3793 if (instr->hydrogen()->function()->IsConstant()) {
3794 HConstant* fun_const = HConstant::cast(instr->hydrogen()->function());
3795 Handle<JSFunction> jsfun =
3796 Handle<JSFunction>::cast(fun_const->handle(isolate()));
3797 is_self_call = jsfun.is_identical_to(info()->closure());
3803 __ call(FieldOperand(edi, JSFunction::kCodeEntryOffset));
3806 RecordSafepointWithLazyDeopt(instr, RECORD_SIMPLE_SAFEPOINT);
3810 void LCodeGen::DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr) {
3811 Register input_reg = ToRegister(instr->value());
3812 __ cmp(FieldOperand(input_reg, HeapObject::kMapOffset),
3813 factory()->heap_number_map());
3814 DeoptimizeIf(not_equal, instr, "not a heap number");
3816 Label slow, allocated, done;
3817 Register tmp = input_reg.is(eax) ? ecx : eax;
3818 Register tmp2 = tmp.is(ecx) ? edx : input_reg.is(ecx) ? edx : ecx;
3820 // Preserve the value of all registers.
3821 PushSafepointRegistersScope scope(this);
3823 __ mov(tmp, FieldOperand(input_reg, HeapNumber::kExponentOffset));
3824 // Check the sign of the argument. If the argument is positive, just
3825 // return it. We do not need to patch the stack since |input| and
3826 // |result| are the same register and |input| will be restored
3827 // unchanged by popping safepoint registers.
3828 __ test(tmp, Immediate(HeapNumber::kSignMask));
3829 __ j(zero, &done, Label::kNear);
3831 __ AllocateHeapNumber(tmp, tmp2, no_reg, &slow);
3832 __ jmp(&allocated, Label::kNear);
3834 // Slow case: Call the runtime system to do the number allocation.
3836 CallRuntimeFromDeferred(Runtime::kAllocateHeapNumber, 0,
3837 instr, instr->context());
3838 // Set the pointer to the new heap number in tmp.
3839 if (!tmp.is(eax)) __ mov(tmp, eax);
3840 // Restore input_reg after call to runtime.
3841 __ LoadFromSafepointRegisterSlot(input_reg, input_reg);
3843 __ bind(&allocated);
3844 __ mov(tmp2, FieldOperand(input_reg, HeapNumber::kExponentOffset));
3845 __ and_(tmp2, ~HeapNumber::kSignMask);
3846 __ mov(FieldOperand(tmp, HeapNumber::kExponentOffset), tmp2);
3847 __ mov(tmp2, FieldOperand(input_reg, HeapNumber::kMantissaOffset));
3848 __ mov(FieldOperand(tmp, HeapNumber::kMantissaOffset), tmp2);
3849 __ StoreToSafepointRegisterSlot(input_reg, tmp);
3855 void LCodeGen::EmitIntegerMathAbs(LMathAbs* instr) {
3856 Register input_reg = ToRegister(instr->value());
3857 __ test(input_reg, Operand(input_reg));
3859 __ j(not_sign, &is_positive, Label::kNear);
3860 __ neg(input_reg); // Sets flags.
3861 DeoptimizeIf(negative, instr, "overflow");
3862 __ bind(&is_positive);
3866 void LCodeGen::DoMathAbs(LMathAbs* instr) {
3867 // Class for deferred case.
3868 class DeferredMathAbsTaggedHeapNumber FINAL : public LDeferredCode {
3870 DeferredMathAbsTaggedHeapNumber(LCodeGen* codegen,
3872 const X87Stack& x87_stack)
3873 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
3874 virtual void Generate() OVERRIDE {
3875 codegen()->DoDeferredMathAbsTaggedHeapNumber(instr_);
3877 virtual LInstruction* instr() OVERRIDE { return instr_; }
3882 DCHECK(instr->value()->Equals(instr->result()));
3883 Representation r = instr->hydrogen()->value()->representation();
3886 X87Register value = ToX87Register(instr->value());
3889 } else if (r.IsSmiOrInteger32()) {
3890 EmitIntegerMathAbs(instr);
3891 } else { // Tagged case.
3892 DeferredMathAbsTaggedHeapNumber* deferred =
3893 new(zone()) DeferredMathAbsTaggedHeapNumber(this, instr, x87_stack_);
3894 Register input_reg = ToRegister(instr->value());
3896 __ JumpIfNotSmi(input_reg, deferred->entry());
3897 EmitIntegerMathAbs(instr);
3898 __ bind(deferred->exit());
3903 void LCodeGen::DoMathFloor(LMathFloor* instr) {
3904 Register output_reg = ToRegister(instr->result());
3905 X87Register input_reg = ToX87Register(instr->value());
3908 Label not_minus_zero, done;
3909 // Deoptimize on unordered.
3913 DeoptimizeIf(parity_even, instr, "NaN");
3914 __ j(below, ¬_minus_zero, Label::kNear);
3916 if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) {
3917 // Check for negative zero.
3918 __ j(not_equal, ¬_minus_zero, Label::kNear);
3922 DeoptimizeIf(not_zero, instr, "minus zero");
3923 __ Move(output_reg, Immediate(0));
3924 __ jmp(&done, Label::kFar);
3928 // rc=01B, round down.
3929 __ bind(¬_minus_zero);
3931 __ X87SetRC(0x0400);
3932 __ sub(esp, Immediate(kPointerSize));
3933 __ fist_s(Operand(esp, 0));
3936 DeoptimizeIf(equal, instr, "overflow");
3938 __ X87SetRC(0x0000);
3943 void LCodeGen::DoMathRound(LMathRound* instr) {
3944 X87Register input_reg = ToX87Register(instr->value());
3945 Register result = ToRegister(instr->result());
3947 Label below_one_half, below_minus_one_half, done;
3949 ExternalReference one_half = ExternalReference::address_of_one_half();
3950 ExternalReference minus_one_half =
3951 ExternalReference::address_of_minus_one_half();
3953 __ fld_d(Operand::StaticVariable(one_half));
3956 __ j(carry, &below_one_half);
3958 // Use rounds towards zero, since 0.5 <= x, we use floor(0.5 + x)
3960 __ fadd_d(Operand::StaticVariable(one_half));
3961 // rc=11B, round toward zero.
3962 __ X87SetRC(0x0c00);
3963 __ sub(esp, Immediate(kPointerSize));
3964 // Clear exception bits.
3966 __ fistp_s(MemOperand(esp, 0));
3970 DeoptimizeIf(equal, instr, "conversion overflow");
3972 // Restore round mode.
3973 __ X87SetRC(0x0000);
3976 __ bind(&below_one_half);
3977 __ fld_d(Operand::StaticVariable(minus_one_half));
3980 __ j(carry, &below_minus_one_half);
3981 // We return 0 for the input range [+0, 0.5[, or [-0.5, 0.5[ if
3982 // we can ignore the difference between a result of -0 and +0.
3983 if (instr->hydrogen()->CheckFlag(HValue::kBailoutOnMinusZero)) {
3984 // If the sign is positive, we return +0.
3987 DeoptimizeIf(not_zero, instr, "minus zero");
3989 __ Move(result, Immediate(0));
3992 __ bind(&below_minus_one_half);
3994 __ fadd_d(Operand::StaticVariable(one_half));
3995 // rc=01B, round down.
3996 __ X87SetRC(0x0400);
3997 __ sub(esp, Immediate(kPointerSize));
3998 // Clear exception bits.
4000 __ fistp_s(MemOperand(esp, 0));
4004 DeoptimizeIf(equal, instr, "conversion overflow");
4006 // Restore round mode.
4007 __ X87SetRC(0x0000);
4013 void LCodeGen::DoMathFround(LMathFround* instr) {
4014 X87Register input_reg = ToX87Register(instr->value());
4016 __ sub(esp, Immediate(kPointerSize));
4017 __ fstp_s(MemOperand(esp, 0));
4018 X87Fld(MemOperand(esp, 0), kX87FloatOperand);
4019 __ add(esp, Immediate(kPointerSize));
4023 void LCodeGen::DoMathSqrt(LMathSqrt* instr) {
4024 X87Register input_reg = ToX87Register(instr->value());
4025 X87Register output_reg = ToX87Register(instr->result());
4026 DCHECK(output_reg.is(input_reg));
4033 void LCodeGen::DoMathPowHalf(LMathPowHalf* instr) {
4034 X87Register input_reg = ToX87Register(instr->value());
4035 DCHECK(ToX87Register(instr->result()).is(input_reg));
4037 // Note that according to ECMA-262 15.8.2.13:
4038 // Math.pow(-Infinity, 0.5) == Infinity
4039 // Math.sqrt(-Infinity) == NaN
4041 // Check base for -Infinity. C3 == 0, C2 == 1, C1 == 1 and C0 == 1
4045 __ and_(eax, Immediate(0x4700));
4046 __ cmp(eax, Immediate(0x0700));
4047 __ j(not_equal, &sqrt, Label::kNear);
4048 // If input is -Infinity, return Infinity.
4050 __ jmp(&done, Label::kNear);
4055 __ faddp(); // Convert -0 to +0.
4062 void LCodeGen::DoPower(LPower* instr) {
4063 Representation exponent_type = instr->hydrogen()->right()->representation();
4064 X87Register result = ToX87Register(instr->result());
4065 // Having marked this as a call, we can use any registers.
4066 X87Register base = ToX87Register(instr->left());
4067 ExternalReference one_half = ExternalReference::address_of_one_half();
4069 if (exponent_type.IsSmi()) {
4070 Register exponent = ToRegister(instr->right());
4071 X87LoadForUsage(base);
4072 __ SmiUntag(exponent);
4074 __ fild_s(MemOperand(esp, 0));
4076 } else if (exponent_type.IsTagged()) {
4077 Register exponent = ToRegister(instr->right());
4078 Register temp = exponent.is(ecx) ? eax : ecx;
4079 Label no_deopt, done;
4080 X87LoadForUsage(base);
4081 __ JumpIfSmi(exponent, &no_deopt);
4082 __ CmpObjectType(exponent, HEAP_NUMBER_TYPE, temp);
4083 DeoptimizeIf(not_equal, instr, "not a heap number");
4084 // Heap number(double)
4085 __ fld_d(FieldOperand(exponent, HeapNumber::kValueOffset));
4089 __ SmiUntag(exponent);
4091 __ fild_s(MemOperand(esp, 0));
4094 } else if (exponent_type.IsInteger32()) {
4095 Register exponent = ToRegister(instr->right());
4096 X87LoadForUsage(base);
4098 __ fild_s(MemOperand(esp, 0));
4101 DCHECK(exponent_type.IsDouble());
4102 X87Register exponent_double = ToX87Register(instr->right());
4103 X87LoadForUsage(base, exponent_double);
4106 // FP data stack {base, exponent(TOS)}.
4107 // Handle (exponent==+-0.5 && base == -0).
4111 X87Fld(Operand::StaticVariable(one_half), kX87DoubleOperand);
4113 __ j(parity_even, ¬_plus_0, Label::kNear); // NaN.
4114 __ j(not_equal, ¬_plus_0, Label::kNear);
4116 // FP data stack {base, exponent(TOS), zero}.
4118 __ bind(¬_plus_0);
4121 __ PrepareCallCFunction(4, eax);
4122 __ fstp_d(MemOperand(esp, kDoubleSize)); // Exponent value.
4123 __ fstp_d(MemOperand(esp, 0)); // Base value.
4124 X87PrepareToWrite(result);
4125 __ CallCFunction(ExternalReference::power_double_double_function(isolate()),
4127 // Return value is in st(0) on ia32.
4128 X87CommitWrite(result);
4133 void LCodeGen::DoMathLog(LMathLog* instr) {
4134 DCHECK(instr->value()->Equals(instr->result()));
4135 X87Register input_reg = ToX87Register(instr->value());
4138 Label positive, done, zero, nan_result;
4142 __ j(below, &nan_result, Label::kNear);
4143 __ j(equal, &zero, Label::kNear);
4151 __ jmp(&done, Label::kNear);
4153 __ bind(&nan_result);
4154 ExternalReference nan =
4155 ExternalReference::address_of_canonical_non_hole_nan();
4156 X87PrepareToWrite(input_reg);
4157 __ fld_d(Operand::StaticVariable(nan));
4158 X87CommitWrite(input_reg);
4159 __ jmp(&done, Label::kNear);
4162 ExternalReference ninf = ExternalReference::address_of_negative_infinity();
4163 X87PrepareToWrite(input_reg);
4164 __ fld_d(Operand::StaticVariable(ninf));
4165 X87CommitWrite(input_reg);
4171 void LCodeGen::DoMathClz32(LMathClz32* instr) {
4172 Register input = ToRegister(instr->value());
4173 Register result = ToRegister(instr->result());
4174 Label not_zero_input;
4175 __ bsr(result, input);
4177 __ j(not_zero, ¬_zero_input);
4178 __ Move(result, Immediate(63)); // 63^31 == 32
4180 __ bind(¬_zero_input);
4181 __ xor_(result, Immediate(31)); // for x in [0..31], 31^x == 31-x.
4185 void LCodeGen::DoMathExp(LMathExp* instr) {
4186 X87Register input = ToX87Register(instr->value());
4187 X87Register result_reg = ToX87Register(instr->result());
4188 Register temp_result = ToRegister(instr->temp1());
4189 Register temp = ToRegister(instr->temp2());
4190 Label slow, done, smi, finish;
4191 DCHECK(result_reg.is(input));
4193 // Store input into Heap number and call runtime function kMathExpRT.
4194 if (FLAG_inline_new) {
4195 __ AllocateHeapNumber(temp_result, temp, no_reg, &slow);
4196 __ jmp(&done, Label::kNear);
4199 // Slow case: Call the runtime system to do the number allocation.
4202 // TODO(3095996): Put a valid pointer value in the stack slot where the
4203 // result register is stored, as this register is in the pointer map, but
4204 // contains an integer value.
4205 __ Move(temp_result, Immediate(0));
4207 // Preserve the value of all registers.
4208 PushSafepointRegistersScope scope(this);
4210 __ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
4211 __ CallRuntimeSaveDoubles(Runtime::kAllocateHeapNumber);
4212 RecordSafepointWithRegisters(instr->pointer_map(), 0,
4213 Safepoint::kNoLazyDeopt);
4214 __ StoreToSafepointRegisterSlot(temp_result, eax);
4217 X87LoadForUsage(input);
4218 __ fstp_d(FieldOperand(temp_result, HeapNumber::kValueOffset));
4221 // Preserve the value of all registers.
4222 PushSafepointRegistersScope scope(this);
4224 __ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
4225 __ push(temp_result);
4226 __ CallRuntimeSaveDoubles(Runtime::kMathExpRT);
4227 RecordSafepointWithRegisters(instr->pointer_map(), 0,
4228 Safepoint::kNoLazyDeopt);
4229 __ StoreToSafepointRegisterSlot(temp_result, eax);
4231 X87PrepareToWrite(result_reg);
4232 // return value of MathExpRT is Smi or Heap Number.
4233 __ JumpIfSmi(temp_result, &smi);
4234 // Heap number(double)
4235 __ fld_d(FieldOperand(temp_result, HeapNumber::kValueOffset));
4239 __ SmiUntag(temp_result);
4240 __ push(temp_result);
4241 __ fild_s(MemOperand(esp, 0));
4242 __ pop(temp_result);
4244 X87CommitWrite(result_reg);
4248 void LCodeGen::DoInvokeFunction(LInvokeFunction* instr) {
4249 DCHECK(ToRegister(instr->context()).is(esi));
4250 DCHECK(ToRegister(instr->function()).is(edi));
4251 DCHECK(instr->HasPointerMap());
4253 Handle<JSFunction> known_function = instr->hydrogen()->known_function();
4254 if (known_function.is_null()) {
4255 LPointerMap* pointers = instr->pointer_map();
4256 SafepointGenerator generator(
4257 this, pointers, Safepoint::kLazyDeopt);
4258 ParameterCount count(instr->arity());
4259 __ InvokeFunction(edi, count, CALL_FUNCTION, generator);
4261 CallKnownFunction(known_function,
4262 instr->hydrogen()->formal_parameter_count(),
4265 EDI_CONTAINS_TARGET);
4270 void LCodeGen::DoCallFunction(LCallFunction* instr) {
4271 DCHECK(ToRegister(instr->context()).is(esi));
4272 DCHECK(ToRegister(instr->function()).is(edi));
4273 DCHECK(ToRegister(instr->result()).is(eax));
4275 int arity = instr->arity();
4276 CallFunctionStub stub(isolate(), arity, instr->hydrogen()->function_flags());
4277 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
4281 void LCodeGen::DoCallNew(LCallNew* instr) {
4282 DCHECK(ToRegister(instr->context()).is(esi));
4283 DCHECK(ToRegister(instr->constructor()).is(edi));
4284 DCHECK(ToRegister(instr->result()).is(eax));
4286 // No cell in ebx for construct type feedback in optimized code
4287 __ mov(ebx, isolate()->factory()->undefined_value());
4288 CallConstructStub stub(isolate(), NO_CALL_CONSTRUCTOR_FLAGS);
4289 __ Move(eax, Immediate(instr->arity()));
4290 CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr);
4294 void LCodeGen::DoCallNewArray(LCallNewArray* instr) {
4295 DCHECK(ToRegister(instr->context()).is(esi));
4296 DCHECK(ToRegister(instr->constructor()).is(edi));
4297 DCHECK(ToRegister(instr->result()).is(eax));
4299 __ Move(eax, Immediate(instr->arity()));
4300 __ mov(ebx, isolate()->factory()->undefined_value());
4301 ElementsKind kind = instr->hydrogen()->elements_kind();
4302 AllocationSiteOverrideMode override_mode =
4303 (AllocationSite::GetMode(kind) == TRACK_ALLOCATION_SITE)
4304 ? DISABLE_ALLOCATION_SITES
4307 if (instr->arity() == 0) {
4308 ArrayNoArgumentConstructorStub stub(isolate(), kind, override_mode);
4309 CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr);
4310 } else if (instr->arity() == 1) {
4312 if (IsFastPackedElementsKind(kind)) {
4314 // We might need a change here
4315 // look at the first argument
4316 __ mov(ecx, Operand(esp, 0));
4318 __ j(zero, &packed_case, Label::kNear);
4320 ElementsKind holey_kind = GetHoleyElementsKind(kind);
4321 ArraySingleArgumentConstructorStub stub(isolate(),
4324 CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr);
4325 __ jmp(&done, Label::kNear);
4326 __ bind(&packed_case);
4329 ArraySingleArgumentConstructorStub stub(isolate(), kind, override_mode);
4330 CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr);
4333 ArrayNArgumentsConstructorStub stub(isolate(), kind, override_mode);
4334 CallCode(stub.GetCode(), RelocInfo::CONSTRUCT_CALL, instr);
4339 void LCodeGen::DoCallRuntime(LCallRuntime* instr) {
4340 DCHECK(ToRegister(instr->context()).is(esi));
4341 CallRuntime(instr->function(), instr->arity(), instr, instr->save_doubles());
4345 void LCodeGen::DoStoreCodeEntry(LStoreCodeEntry* instr) {
4346 Register function = ToRegister(instr->function());
4347 Register code_object = ToRegister(instr->code_object());
4348 __ lea(code_object, FieldOperand(code_object, Code::kHeaderSize));
4349 __ mov(FieldOperand(function, JSFunction::kCodeEntryOffset), code_object);
4353 void LCodeGen::DoInnerAllocatedObject(LInnerAllocatedObject* instr) {
4354 Register result = ToRegister(instr->result());
4355 Register base = ToRegister(instr->base_object());
4356 if (instr->offset()->IsConstantOperand()) {
4357 LConstantOperand* offset = LConstantOperand::cast(instr->offset());
4358 __ lea(result, Operand(base, ToInteger32(offset)));
4360 Register offset = ToRegister(instr->offset());
4361 __ lea(result, Operand(base, offset, times_1, 0));
4366 void LCodeGen::DoStoreNamedField(LStoreNamedField* instr) {
4367 Representation representation = instr->hydrogen()->field_representation();
4369 HObjectAccess access = instr->hydrogen()->access();
4370 int offset = access.offset();
4372 if (access.IsExternalMemory()) {
4373 DCHECK(!instr->hydrogen()->NeedsWriteBarrier());
4374 MemOperand operand = instr->object()->IsConstantOperand()
4375 ? MemOperand::StaticVariable(
4376 ToExternalReference(LConstantOperand::cast(instr->object())))
4377 : MemOperand(ToRegister(instr->object()), offset);
4378 if (instr->value()->IsConstantOperand()) {
4379 LConstantOperand* operand_value = LConstantOperand::cast(instr->value());
4380 __ mov(operand, Immediate(ToInteger32(operand_value)));
4382 Register value = ToRegister(instr->value());
4383 __ Store(value, operand, representation);
4388 Register object = ToRegister(instr->object());
4389 __ AssertNotSmi(object);
4390 DCHECK(!representation.IsSmi() ||
4391 !instr->value()->IsConstantOperand() ||
4392 IsSmi(LConstantOperand::cast(instr->value())));
4393 if (representation.IsDouble()) {
4394 DCHECK(access.IsInobject());
4395 DCHECK(!instr->hydrogen()->has_transition());
4396 DCHECK(!instr->hydrogen()->NeedsWriteBarrier());
4397 X87Register value = ToX87Register(instr->value());
4398 X87Mov(FieldOperand(object, offset), value);
4402 if (instr->hydrogen()->has_transition()) {
4403 Handle<Map> transition = instr->hydrogen()->transition_map();
4404 AddDeprecationDependency(transition);
4405 __ mov(FieldOperand(object, HeapObject::kMapOffset), transition);
4406 if (instr->hydrogen()->NeedsWriteBarrierForMap()) {
4407 Register temp = ToRegister(instr->temp());
4408 Register temp_map = ToRegister(instr->temp_map());
4409 __ mov(temp_map, transition);
4410 __ mov(FieldOperand(object, HeapObject::kMapOffset), temp_map);
4411 // Update the write barrier for the map field.
4412 __ RecordWriteForMap(object, transition, temp_map, temp, kSaveFPRegs);
4417 Register write_register = object;
4418 if (!access.IsInobject()) {
4419 write_register = ToRegister(instr->temp());
4420 __ mov(write_register, FieldOperand(object, JSObject::kPropertiesOffset));
4423 MemOperand operand = FieldOperand(write_register, offset);
4424 if (instr->value()->IsConstantOperand()) {
4425 LConstantOperand* operand_value = LConstantOperand::cast(instr->value());
4426 if (operand_value->IsRegister()) {
4427 Register value = ToRegister(operand_value);
4428 __ Store(value, operand, representation);
4429 } else if (representation.IsInteger32()) {
4430 Immediate immediate = ToImmediate(operand_value, representation);
4431 DCHECK(!instr->hydrogen()->NeedsWriteBarrier());
4432 __ mov(operand, immediate);
4434 Handle<Object> handle_value = ToHandle(operand_value);
4435 DCHECK(!instr->hydrogen()->NeedsWriteBarrier());
4436 __ mov(operand, handle_value);
4439 Register value = ToRegister(instr->value());
4440 __ Store(value, operand, representation);
4443 if (instr->hydrogen()->NeedsWriteBarrier()) {
4444 Register value = ToRegister(instr->value());
4445 Register temp = access.IsInobject() ? ToRegister(instr->temp()) : object;
4446 // Update the write barrier for the object for in-object properties.
4447 __ RecordWriteField(write_register, offset, value, temp, kSaveFPRegs,
4448 EMIT_REMEMBERED_SET,
4449 instr->hydrogen()->SmiCheckForWriteBarrier(),
4450 instr->hydrogen()->PointersToHereCheckForValue());
4455 void LCodeGen::DoStoreNamedGeneric(LStoreNamedGeneric* instr) {
4456 DCHECK(ToRegister(instr->context()).is(esi));
4457 DCHECK(ToRegister(instr->object()).is(StoreDescriptor::ReceiverRegister()));
4458 DCHECK(ToRegister(instr->value()).is(StoreDescriptor::ValueRegister()));
4460 __ mov(StoreDescriptor::NameRegister(), instr->name());
4461 Handle<Code> ic = StoreIC::initialize_stub(isolate(), instr->strict_mode());
4462 CallCode(ic, RelocInfo::CODE_TARGET, instr);
4466 void LCodeGen::DoBoundsCheck(LBoundsCheck* instr) {
4467 Condition cc = instr->hydrogen()->allow_equality() ? above : above_equal;
4468 if (instr->index()->IsConstantOperand()) {
4469 __ cmp(ToOperand(instr->length()),
4470 ToImmediate(LConstantOperand::cast(instr->index()),
4471 instr->hydrogen()->length()->representation()));
4472 cc = CommuteCondition(cc);
4473 } else if (instr->length()->IsConstantOperand()) {
4474 __ cmp(ToOperand(instr->index()),
4475 ToImmediate(LConstantOperand::cast(instr->length()),
4476 instr->hydrogen()->index()->representation()));
4478 __ cmp(ToRegister(instr->index()), ToOperand(instr->length()));
4480 if (FLAG_debug_code && instr->hydrogen()->skip_check()) {
4482 __ j(NegateCondition(cc), &done, Label::kNear);
4486 DeoptimizeIf(cc, instr, "out of bounds");
4491 void LCodeGen::DoStoreKeyedExternalArray(LStoreKeyed* instr) {
4492 ElementsKind elements_kind = instr->elements_kind();
4493 LOperand* key = instr->key();
4494 if (!key->IsConstantOperand() &&
4495 ExternalArrayOpRequiresTemp(instr->hydrogen()->key()->representation(),
4497 __ SmiUntag(ToRegister(key));
4499 Operand operand(BuildFastArrayOperand(
4502 instr->hydrogen()->key()->representation(),
4504 instr->base_offset()));
4505 if (elements_kind == EXTERNAL_FLOAT32_ELEMENTS ||
4506 elements_kind == FLOAT32_ELEMENTS) {
4507 X87Mov(operand, ToX87Register(instr->value()), kX87FloatOperand);
4508 } else if (elements_kind == EXTERNAL_FLOAT64_ELEMENTS ||
4509 elements_kind == FLOAT64_ELEMENTS) {
4510 X87Mov(operand, ToX87Register(instr->value()));
4512 Register value = ToRegister(instr->value());
4513 switch (elements_kind) {
4514 case EXTERNAL_UINT8_CLAMPED_ELEMENTS:
4515 case EXTERNAL_UINT8_ELEMENTS:
4516 case EXTERNAL_INT8_ELEMENTS:
4517 case UINT8_ELEMENTS:
4519 case UINT8_CLAMPED_ELEMENTS:
4520 __ mov_b(operand, value);
4522 case EXTERNAL_INT16_ELEMENTS:
4523 case EXTERNAL_UINT16_ELEMENTS:
4524 case UINT16_ELEMENTS:
4525 case INT16_ELEMENTS:
4526 __ mov_w(operand, value);
4528 case EXTERNAL_INT32_ELEMENTS:
4529 case EXTERNAL_UINT32_ELEMENTS:
4530 case UINT32_ELEMENTS:
4531 case INT32_ELEMENTS:
4532 __ mov(operand, value);
4534 case EXTERNAL_FLOAT32_ELEMENTS:
4535 case EXTERNAL_FLOAT64_ELEMENTS:
4536 case FLOAT32_ELEMENTS:
4537 case FLOAT64_ELEMENTS:
4538 case FAST_SMI_ELEMENTS:
4540 case FAST_DOUBLE_ELEMENTS:
4541 case FAST_HOLEY_SMI_ELEMENTS:
4542 case FAST_HOLEY_ELEMENTS:
4543 case FAST_HOLEY_DOUBLE_ELEMENTS:
4544 case DICTIONARY_ELEMENTS:
4545 case SLOPPY_ARGUMENTS_ELEMENTS:
4553 void LCodeGen::DoStoreKeyedFixedDoubleArray(LStoreKeyed* instr) {
4554 ExternalReference canonical_nan_reference =
4555 ExternalReference::address_of_canonical_non_hole_nan();
4556 Operand double_store_operand = BuildFastArrayOperand(
4559 instr->hydrogen()->key()->representation(),
4560 FAST_DOUBLE_ELEMENTS,
4561 instr->base_offset());
4563 // Can't use SSE2 in the serializer
4564 if (instr->hydrogen()->IsConstantHoleStore()) {
4565 // This means we should store the (double) hole. No floating point
4566 // registers required.
4567 double nan_double = FixedDoubleArray::hole_nan_as_double();
4568 uint64_t int_val = bit_cast<uint64_t, double>(nan_double);
4569 int32_t lower = static_cast<int32_t>(int_val);
4570 int32_t upper = static_cast<int32_t>(int_val >> (kBitsPerInt));
4572 __ mov(double_store_operand, Immediate(lower));
4573 Operand double_store_operand2 = BuildFastArrayOperand(
4576 instr->hydrogen()->key()->representation(),
4577 FAST_DOUBLE_ELEMENTS,
4578 instr->base_offset() + kPointerSize);
4579 __ mov(double_store_operand2, Immediate(upper));
4581 Label no_special_nan_handling;
4582 X87Register value = ToX87Register(instr->value());
4585 if (instr->NeedsCanonicalization()) {
4590 __ j(parity_odd, &no_special_nan_handling, Label::kNear);
4591 __ sub(esp, Immediate(kDoubleSize));
4592 __ fst_d(MemOperand(esp, 0));
4593 __ cmp(MemOperand(esp, sizeof(kHoleNanLower32)),
4594 Immediate(kHoleNanUpper32));
4595 __ add(esp, Immediate(kDoubleSize));
4597 __ j(not_equal, &canonicalize, Label::kNear);
4598 __ jmp(&no_special_nan_handling, Label::kNear);
4599 __ bind(&canonicalize);
4601 __ fld_d(Operand::StaticVariable(canonical_nan_reference));
4604 __ bind(&no_special_nan_handling);
4605 __ fst_d(double_store_operand);
4610 void LCodeGen::DoStoreKeyedFixedArray(LStoreKeyed* instr) {
4611 Register elements = ToRegister(instr->elements());
4612 Register key = instr->key()->IsRegister() ? ToRegister(instr->key()) : no_reg;
4614 Operand operand = BuildFastArrayOperand(
4617 instr->hydrogen()->key()->representation(),
4619 instr->base_offset());
4620 if (instr->value()->IsRegister()) {
4621 __ mov(operand, ToRegister(instr->value()));
4623 LConstantOperand* operand_value = LConstantOperand::cast(instr->value());
4624 if (IsSmi(operand_value)) {
4625 Immediate immediate = ToImmediate(operand_value, Representation::Smi());
4626 __ mov(operand, immediate);
4628 DCHECK(!IsInteger32(operand_value));
4629 Handle<Object> handle_value = ToHandle(operand_value);
4630 __ mov(operand, handle_value);
4634 if (instr->hydrogen()->NeedsWriteBarrier()) {
4635 DCHECK(instr->value()->IsRegister());
4636 Register value = ToRegister(instr->value());
4637 DCHECK(!instr->key()->IsConstantOperand());
4638 SmiCheck check_needed =
4639 instr->hydrogen()->value()->type().IsHeapObject()
4640 ? OMIT_SMI_CHECK : INLINE_SMI_CHECK;
4641 // Compute address of modified element and store it into key register.
4642 __ lea(key, operand);
4643 __ RecordWrite(elements, key, value, kSaveFPRegs, EMIT_REMEMBERED_SET,
4645 instr->hydrogen()->PointersToHereCheckForValue());
4650 void LCodeGen::DoStoreKeyed(LStoreKeyed* instr) {
4651 // By cases...external, fast-double, fast
4652 if (instr->is_typed_elements()) {
4653 DoStoreKeyedExternalArray(instr);
4654 } else if (instr->hydrogen()->value()->representation().IsDouble()) {
4655 DoStoreKeyedFixedDoubleArray(instr);
4657 DoStoreKeyedFixedArray(instr);
4662 void LCodeGen::DoStoreKeyedGeneric(LStoreKeyedGeneric* instr) {
4663 DCHECK(ToRegister(instr->context()).is(esi));
4664 DCHECK(ToRegister(instr->object()).is(StoreDescriptor::ReceiverRegister()));
4665 DCHECK(ToRegister(instr->key()).is(StoreDescriptor::NameRegister()));
4666 DCHECK(ToRegister(instr->value()).is(StoreDescriptor::ValueRegister()));
4669 CodeFactory::KeyedStoreIC(isolate(), instr->strict_mode()).code();
4670 CallCode(ic, RelocInfo::CODE_TARGET, instr);
4674 void LCodeGen::DoTrapAllocationMemento(LTrapAllocationMemento* instr) {
4675 Register object = ToRegister(instr->object());
4676 Register temp = ToRegister(instr->temp());
4677 Label no_memento_found;
4678 __ TestJSArrayForAllocationMemento(object, temp, &no_memento_found);
4679 DeoptimizeIf(equal, instr, "memento found");
4680 __ bind(&no_memento_found);
4684 void LCodeGen::DoTransitionElementsKind(LTransitionElementsKind* instr) {
4685 Register object_reg = ToRegister(instr->object());
4687 Handle<Map> from_map = instr->original_map();
4688 Handle<Map> to_map = instr->transitioned_map();
4689 ElementsKind from_kind = instr->from_kind();
4690 ElementsKind to_kind = instr->to_kind();
4692 Label not_applicable;
4693 bool is_simple_map_transition =
4694 IsSimpleMapChangeTransition(from_kind, to_kind);
4695 Label::Distance branch_distance =
4696 is_simple_map_transition ? Label::kNear : Label::kFar;
4697 __ cmp(FieldOperand(object_reg, HeapObject::kMapOffset), from_map);
4698 __ j(not_equal, ¬_applicable, branch_distance);
4699 if (is_simple_map_transition) {
4700 Register new_map_reg = ToRegister(instr->new_map_temp());
4701 __ mov(FieldOperand(object_reg, HeapObject::kMapOffset),
4704 DCHECK_NE(instr->temp(), NULL);
4705 __ RecordWriteForMap(object_reg, to_map, new_map_reg,
4706 ToRegister(instr->temp()), kDontSaveFPRegs);
4708 DCHECK(ToRegister(instr->context()).is(esi));
4709 DCHECK(object_reg.is(eax));
4710 PushSafepointRegistersScope scope(this);
4711 __ mov(ebx, to_map);
4712 bool is_js_array = from_map->instance_type() == JS_ARRAY_TYPE;
4713 TransitionElementsKindStub stub(isolate(), from_kind, to_kind, is_js_array);
4715 RecordSafepointWithLazyDeopt(instr,
4716 RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS);
4718 __ bind(¬_applicable);
4722 void LCodeGen::DoStringCharCodeAt(LStringCharCodeAt* instr) {
4723 class DeferredStringCharCodeAt FINAL : public LDeferredCode {
4725 DeferredStringCharCodeAt(LCodeGen* codegen,
4726 LStringCharCodeAt* instr,
4727 const X87Stack& x87_stack)
4728 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
4729 virtual void Generate() OVERRIDE {
4730 codegen()->DoDeferredStringCharCodeAt(instr_);
4732 virtual LInstruction* instr() OVERRIDE { return instr_; }
4734 LStringCharCodeAt* instr_;
4737 DeferredStringCharCodeAt* deferred =
4738 new(zone()) DeferredStringCharCodeAt(this, instr, x87_stack_);
4740 StringCharLoadGenerator::Generate(masm(),
4742 ToRegister(instr->string()),
4743 ToRegister(instr->index()),
4744 ToRegister(instr->result()),
4746 __ bind(deferred->exit());
4750 void LCodeGen::DoDeferredStringCharCodeAt(LStringCharCodeAt* instr) {
4751 Register string = ToRegister(instr->string());
4752 Register result = ToRegister(instr->result());
4754 // TODO(3095996): Get rid of this. For now, we need to make the
4755 // result register contain a valid pointer because it is already
4756 // contained in the register pointer map.
4757 __ Move(result, Immediate(0));
4759 PushSafepointRegistersScope scope(this);
4761 // Push the index as a smi. This is safe because of the checks in
4762 // DoStringCharCodeAt above.
4763 STATIC_ASSERT(String::kMaxLength <= Smi::kMaxValue);
4764 if (instr->index()->IsConstantOperand()) {
4765 Immediate immediate = ToImmediate(LConstantOperand::cast(instr->index()),
4766 Representation::Smi());
4769 Register index = ToRegister(instr->index());
4773 CallRuntimeFromDeferred(Runtime::kStringCharCodeAtRT, 2,
4774 instr, instr->context());
4777 __ StoreToSafepointRegisterSlot(result, eax);
4781 void LCodeGen::DoStringCharFromCode(LStringCharFromCode* instr) {
4782 class DeferredStringCharFromCode FINAL : public LDeferredCode {
4784 DeferredStringCharFromCode(LCodeGen* codegen,
4785 LStringCharFromCode* instr,
4786 const X87Stack& x87_stack)
4787 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
4788 virtual void Generate() OVERRIDE {
4789 codegen()->DoDeferredStringCharFromCode(instr_);
4791 virtual LInstruction* instr() OVERRIDE { return instr_; }
4793 LStringCharFromCode* instr_;
4796 DeferredStringCharFromCode* deferred =
4797 new(zone()) DeferredStringCharFromCode(this, instr, x87_stack_);
4799 DCHECK(instr->hydrogen()->value()->representation().IsInteger32());
4800 Register char_code = ToRegister(instr->char_code());
4801 Register result = ToRegister(instr->result());
4802 DCHECK(!char_code.is(result));
4804 __ cmp(char_code, String::kMaxOneByteCharCode);
4805 __ j(above, deferred->entry());
4806 __ Move(result, Immediate(factory()->single_character_string_cache()));
4807 __ mov(result, FieldOperand(result,
4808 char_code, times_pointer_size,
4809 FixedArray::kHeaderSize));
4810 __ cmp(result, factory()->undefined_value());
4811 __ j(equal, deferred->entry());
4812 __ bind(deferred->exit());
4816 void LCodeGen::DoDeferredStringCharFromCode(LStringCharFromCode* instr) {
4817 Register char_code = ToRegister(instr->char_code());
4818 Register result = ToRegister(instr->result());
4820 // TODO(3095996): Get rid of this. For now, we need to make the
4821 // result register contain a valid pointer because it is already
4822 // contained in the register pointer map.
4823 __ Move(result, Immediate(0));
4825 PushSafepointRegistersScope scope(this);
4826 __ SmiTag(char_code);
4828 CallRuntimeFromDeferred(Runtime::kCharFromCode, 1, instr, instr->context());
4829 __ StoreToSafepointRegisterSlot(result, eax);
4833 void LCodeGen::DoStringAdd(LStringAdd* instr) {
4834 DCHECK(ToRegister(instr->context()).is(esi));
4835 DCHECK(ToRegister(instr->left()).is(edx));
4836 DCHECK(ToRegister(instr->right()).is(eax));
4837 StringAddStub stub(isolate(),
4838 instr->hydrogen()->flags(),
4839 instr->hydrogen()->pretenure_flag());
4840 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
4844 void LCodeGen::DoInteger32ToDouble(LInteger32ToDouble* instr) {
4845 LOperand* input = instr->value();
4846 LOperand* output = instr->result();
4847 DCHECK(input->IsRegister() || input->IsStackSlot());
4848 DCHECK(output->IsDoubleRegister());
4849 if (input->IsRegister()) {
4850 Register input_reg = ToRegister(input);
4852 X87Mov(ToX87Register(output), Operand(esp, 0), kX87IntOperand);
4855 X87Mov(ToX87Register(output), ToOperand(input), kX87IntOperand);
4860 void LCodeGen::DoUint32ToDouble(LUint32ToDouble* instr) {
4861 LOperand* input = instr->value();
4862 LOperand* output = instr->result();
4863 X87Register res = ToX87Register(output);
4864 X87PrepareToWrite(res);
4865 __ LoadUint32NoSSE2(ToRegister(input));
4866 X87CommitWrite(res);
4870 void LCodeGen::DoNumberTagI(LNumberTagI* instr) {
4871 class DeferredNumberTagI FINAL : public LDeferredCode {
4873 DeferredNumberTagI(LCodeGen* codegen,
4875 const X87Stack& x87_stack)
4876 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
4877 virtual void Generate() OVERRIDE {
4878 codegen()->DoDeferredNumberTagIU(instr_, instr_->value(), instr_->temp(),
4881 virtual LInstruction* instr() OVERRIDE { return instr_; }
4883 LNumberTagI* instr_;
4886 LOperand* input = instr->value();
4887 DCHECK(input->IsRegister() && input->Equals(instr->result()));
4888 Register reg = ToRegister(input);
4890 DeferredNumberTagI* deferred =
4891 new(zone()) DeferredNumberTagI(this, instr, x87_stack_);
4893 __ j(overflow, deferred->entry());
4894 __ bind(deferred->exit());
4898 void LCodeGen::DoNumberTagU(LNumberTagU* instr) {
4899 class DeferredNumberTagU FINAL : public LDeferredCode {
4901 DeferredNumberTagU(LCodeGen* codegen,
4903 const X87Stack& x87_stack)
4904 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
4905 virtual void Generate() OVERRIDE {
4906 codegen()->DoDeferredNumberTagIU(instr_, instr_->value(), instr_->temp(),
4909 virtual LInstruction* instr() OVERRIDE { return instr_; }
4911 LNumberTagU* instr_;
4914 LOperand* input = instr->value();
4915 DCHECK(input->IsRegister() && input->Equals(instr->result()));
4916 Register reg = ToRegister(input);
4918 DeferredNumberTagU* deferred =
4919 new(zone()) DeferredNumberTagU(this, instr, x87_stack_);
4920 __ cmp(reg, Immediate(Smi::kMaxValue));
4921 __ j(above, deferred->entry());
4923 __ bind(deferred->exit());
4927 void LCodeGen::DoDeferredNumberTagIU(LInstruction* instr,
4930 IntegerSignedness signedness) {
4932 Register reg = ToRegister(value);
4933 Register tmp = ToRegister(temp);
4935 if (signedness == SIGNED_INT32) {
4936 // There was overflow, so bits 30 and 31 of the original integer
4937 // disagree. Try to allocate a heap number in new space and store
4938 // the value in there. If that fails, call the runtime system.
4940 __ xor_(reg, 0x80000000);
4942 __ fild_s(Operand(esp, 0));
4945 // There's no fild variant for unsigned values, so zero-extend to a 64-bit
4947 __ push(Immediate(0));
4949 __ fild_d(Operand(esp, 0));
4954 if (FLAG_inline_new) {
4955 __ AllocateHeapNumber(reg, tmp, no_reg, &slow);
4956 __ jmp(&done, Label::kNear);
4959 // Slow case: Call the runtime system to do the number allocation.
4962 // TODO(3095996): Put a valid pointer value in the stack slot where the
4963 // result register is stored, as this register is in the pointer map, but
4964 // contains an integer value.
4965 __ Move(reg, Immediate(0));
4967 // Preserve the value of all registers.
4968 PushSafepointRegistersScope scope(this);
4970 // NumberTagI and NumberTagD use the context from the frame, rather than
4971 // the environment's HContext or HInlinedContext value.
4972 // They only call Runtime::kAllocateHeapNumber.
4973 // The corresponding HChange instructions are added in a phase that does
4974 // not have easy access to the local context.
4975 __ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
4976 __ CallRuntimeSaveDoubles(Runtime::kAllocateHeapNumber);
4977 RecordSafepointWithRegisters(
4978 instr->pointer_map(), 0, Safepoint::kNoLazyDeopt);
4979 __ StoreToSafepointRegisterSlot(reg, eax);
4983 __ fstp_d(FieldOperand(reg, HeapNumber::kValueOffset));
4987 void LCodeGen::DoNumberTagD(LNumberTagD* instr) {
4988 class DeferredNumberTagD FINAL : public LDeferredCode {
4990 DeferredNumberTagD(LCodeGen* codegen,
4992 const X87Stack& x87_stack)
4993 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
4994 virtual void Generate() OVERRIDE {
4995 codegen()->DoDeferredNumberTagD(instr_);
4997 virtual LInstruction* instr() OVERRIDE { return instr_; }
4999 LNumberTagD* instr_;
5002 Register reg = ToRegister(instr->result());
5004 // Put the value to the top of stack
5005 X87Register src = ToX87Register(instr->value());
5006 // Don't use X87LoadForUsage here, which is only used by Instruction which
5007 // clobbers fp registers.
5008 x87_stack_.Fxch(src);
5010 DeferredNumberTagD* deferred =
5011 new(zone()) DeferredNumberTagD(this, instr, x87_stack_);
5012 if (FLAG_inline_new) {
5013 Register tmp = ToRegister(instr->temp());
5014 __ AllocateHeapNumber(reg, tmp, no_reg, deferred->entry());
5016 __ jmp(deferred->entry());
5018 __ bind(deferred->exit());
5019 __ fst_d(FieldOperand(reg, HeapNumber::kValueOffset));
5023 void LCodeGen::DoDeferredNumberTagD(LNumberTagD* instr) {
5024 // TODO(3095996): Get rid of this. For now, we need to make the
5025 // result register contain a valid pointer because it is already
5026 // contained in the register pointer map.
5027 Register reg = ToRegister(instr->result());
5028 __ Move(reg, Immediate(0));
5030 PushSafepointRegistersScope scope(this);
5031 // NumberTagI and NumberTagD use the context from the frame, rather than
5032 // the environment's HContext or HInlinedContext value.
5033 // They only call Runtime::kAllocateHeapNumber.
5034 // The corresponding HChange instructions are added in a phase that does
5035 // not have easy access to the local context.
5036 __ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
5037 __ CallRuntimeSaveDoubles(Runtime::kAllocateHeapNumber);
5038 RecordSafepointWithRegisters(
5039 instr->pointer_map(), 0, Safepoint::kNoLazyDeopt);
5040 __ StoreToSafepointRegisterSlot(reg, eax);
5044 void LCodeGen::DoSmiTag(LSmiTag* instr) {
5045 HChange* hchange = instr->hydrogen();
5046 Register input = ToRegister(instr->value());
5047 if (hchange->CheckFlag(HValue::kCanOverflow) &&
5048 hchange->value()->CheckFlag(HValue::kUint32)) {
5049 __ test(input, Immediate(0xc0000000));
5050 DeoptimizeIf(not_zero, instr, "overflow");
5053 if (hchange->CheckFlag(HValue::kCanOverflow) &&
5054 !hchange->value()->CheckFlag(HValue::kUint32)) {
5055 DeoptimizeIf(overflow, instr, "overflow");
5060 void LCodeGen::DoSmiUntag(LSmiUntag* instr) {
5061 LOperand* input = instr->value();
5062 Register result = ToRegister(input);
5063 DCHECK(input->IsRegister() && input->Equals(instr->result()));
5064 if (instr->needs_check()) {
5065 __ test(result, Immediate(kSmiTagMask));
5066 DeoptimizeIf(not_zero, instr, "not a Smi");
5068 __ AssertSmi(result);
5070 __ SmiUntag(result);
5074 void LCodeGen::EmitNumberUntagDNoSSE2(LNumberUntagD* instr, Register input_reg,
5075 Register temp_reg, X87Register res_reg,
5076 NumberUntagDMode mode) {
5077 bool can_convert_undefined_to_nan =
5078 instr->hydrogen()->can_convert_undefined_to_nan();
5079 bool deoptimize_on_minus_zero = instr->hydrogen()->deoptimize_on_minus_zero();
5081 Label load_smi, done;
5083 X87PrepareToWrite(res_reg);
5084 if (mode == NUMBER_CANDIDATE_IS_ANY_TAGGED) {
5086 __ JumpIfSmi(input_reg, &load_smi);
5088 // Heap number map check.
5089 __ cmp(FieldOperand(input_reg, HeapObject::kMapOffset),
5090 factory()->heap_number_map());
5091 if (!can_convert_undefined_to_nan) {
5092 DeoptimizeIf(not_equal, instr, "not a heap number");
5094 Label heap_number, convert;
5095 __ j(equal, &heap_number);
5097 // Convert undefined (or hole) to NaN.
5098 __ cmp(input_reg, factory()->undefined_value());
5099 DeoptimizeIf(not_equal, instr, "not a heap number/undefined");
5102 ExternalReference nan =
5103 ExternalReference::address_of_canonical_non_hole_nan();
5104 __ fld_d(Operand::StaticVariable(nan));
5105 __ jmp(&done, Label::kNear);
5107 __ bind(&heap_number);
5109 // Heap number to x87 conversion.
5110 __ fld_d(FieldOperand(input_reg, HeapNumber::kValueOffset));
5111 if (deoptimize_on_minus_zero) {
5114 __ fld_d(FieldOperand(input_reg, HeapNumber::kValueOffset));
5115 __ j(not_zero, &done, Label::kNear);
5117 // Use general purpose registers to check if we have -0.0
5118 __ mov(temp_reg, FieldOperand(input_reg, HeapNumber::kExponentOffset));
5119 __ test(temp_reg, Immediate(HeapNumber::kSignMask));
5120 __ j(zero, &done, Label::kNear);
5122 // Pop FPU stack before deoptimizing.
5124 DeoptimizeIf(not_zero, instr, "minus zero");
5126 __ jmp(&done, Label::kNear);
5128 DCHECK(mode == NUMBER_CANDIDATE_IS_SMI);
5132 // Clobbering a temp is faster than re-tagging the
5133 // input register since we avoid dependencies.
5134 __ mov(temp_reg, input_reg);
5135 __ SmiUntag(temp_reg); // Untag smi before converting to float.
5137 __ fild_s(Operand(esp, 0));
5138 __ add(esp, Immediate(kPointerSize));
5140 X87CommitWrite(res_reg);
5144 void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr, Label* done) {
5145 Register input_reg = ToRegister(instr->value());
5147 // The input was optimistically untagged; revert it.
5148 STATIC_ASSERT(kSmiTagSize == 1);
5149 __ lea(input_reg, Operand(input_reg, times_2, kHeapObjectTag));
5151 if (instr->truncating()) {
5152 Label no_heap_number, check_bools, check_false;
5154 // Heap number map check.
5155 __ cmp(FieldOperand(input_reg, HeapObject::kMapOffset),
5156 factory()->heap_number_map());
5157 __ j(not_equal, &no_heap_number, Label::kNear);
5158 __ TruncateHeapNumberToI(input_reg, input_reg);
5161 __ bind(&no_heap_number);
5162 // Check for Oddballs. Undefined/False is converted to zero and True to one
5163 // for truncating conversions.
5164 __ cmp(input_reg, factory()->undefined_value());
5165 __ j(not_equal, &check_bools, Label::kNear);
5166 __ Move(input_reg, Immediate(0));
5169 __ bind(&check_bools);
5170 __ cmp(input_reg, factory()->true_value());
5171 __ j(not_equal, &check_false, Label::kNear);
5172 __ Move(input_reg, Immediate(1));
5175 __ bind(&check_false);
5176 __ cmp(input_reg, factory()->false_value());
5177 DeoptimizeIf(not_equal, instr, "not a heap number/undefined/true/false");
5178 __ Move(input_reg, Immediate(0));
5180 // TODO(olivf) Converting a number on the fpu is actually quite slow. We
5181 // should first try a fast conversion and then bailout to this slow case.
5182 __ cmp(FieldOperand(input_reg, HeapObject::kMapOffset),
5183 isolate()->factory()->heap_number_map());
5184 DeoptimizeIf(not_equal, instr, "not a heap number");
5186 __ sub(esp, Immediate(kPointerSize));
5187 __ fld_d(FieldOperand(input_reg, HeapNumber::kValueOffset));
5189 if (instr->hydrogen()->GetMinusZeroMode() == FAIL_ON_MINUS_ZERO) {
5190 Label no_precision_lost, not_nan, zero_check;
5193 __ fist_s(MemOperand(esp, 0));
5194 __ fild_s(MemOperand(esp, 0));
5198 __ j(equal, &no_precision_lost, Label::kNear);
5200 DeoptimizeIf(no_condition, instr, "lost precision");
5201 __ bind(&no_precision_lost);
5203 __ j(parity_odd, ¬_nan);
5205 DeoptimizeIf(no_condition, instr, "NaN");
5208 __ test(input_reg, Operand(input_reg));
5209 __ j(zero, &zero_check, Label::kNear);
5213 __ bind(&zero_check);
5214 // To check for minus zero, we load the value again as float, and check
5215 // if that is still 0.
5216 __ sub(esp, Immediate(kPointerSize));
5217 __ fstp_s(Operand(esp, 0));
5219 __ test(input_reg, Operand(input_reg));
5220 DeoptimizeIf(not_zero, instr, "minus zero");
5222 __ fist_s(MemOperand(esp, 0));
5223 __ fild_s(MemOperand(esp, 0));
5226 DeoptimizeIf(not_equal, instr, "lost precision");
5227 DeoptimizeIf(parity_even, instr, "NaN");
5233 void LCodeGen::DoTaggedToI(LTaggedToI* instr) {
5234 class DeferredTaggedToI FINAL : public LDeferredCode {
5236 DeferredTaggedToI(LCodeGen* codegen,
5238 const X87Stack& x87_stack)
5239 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
5240 virtual void Generate() OVERRIDE {
5241 codegen()->DoDeferredTaggedToI(instr_, done());
5243 virtual LInstruction* instr() OVERRIDE { return instr_; }
5248 LOperand* input = instr->value();
5249 DCHECK(input->IsRegister());
5250 Register input_reg = ToRegister(input);
5251 DCHECK(input_reg.is(ToRegister(instr->result())));
5253 if (instr->hydrogen()->value()->representation().IsSmi()) {
5254 __ SmiUntag(input_reg);
5256 DeferredTaggedToI* deferred =
5257 new(zone()) DeferredTaggedToI(this, instr, x87_stack_);
5258 // Optimistically untag the input.
5259 // If the input is a HeapObject, SmiUntag will set the carry flag.
5260 STATIC_ASSERT(kSmiTagSize == 1 && kSmiTag == 0);
5261 __ SmiUntag(input_reg);
5262 // Branch to deferred code if the input was tagged.
5263 // The deferred code will take care of restoring the tag.
5264 __ j(carry, deferred->entry());
5265 __ bind(deferred->exit());
5270 void LCodeGen::DoNumberUntagD(LNumberUntagD* instr) {
5271 LOperand* input = instr->value();
5272 DCHECK(input->IsRegister());
5273 LOperand* temp = instr->temp();
5274 DCHECK(temp->IsRegister());
5275 LOperand* result = instr->result();
5276 DCHECK(result->IsDoubleRegister());
5278 Register input_reg = ToRegister(input);
5279 Register temp_reg = ToRegister(temp);
5281 HValue* value = instr->hydrogen()->value();
5282 NumberUntagDMode mode = value->representation().IsSmi()
5283 ? NUMBER_CANDIDATE_IS_SMI : NUMBER_CANDIDATE_IS_ANY_TAGGED;
5285 EmitNumberUntagDNoSSE2(instr, input_reg, temp_reg, ToX87Register(result),
5290 void LCodeGen::DoDoubleToI(LDoubleToI* instr) {
5291 LOperand* input = instr->value();
5292 DCHECK(input->IsDoubleRegister());
5293 LOperand* result = instr->result();
5294 DCHECK(result->IsRegister());
5295 Register result_reg = ToRegister(result);
5297 if (instr->truncating()) {
5298 X87Register input_reg = ToX87Register(input);
5300 __ TruncateX87TOSToI(result_reg);
5302 Label lost_precision, is_nan, minus_zero, done;
5303 X87Register input_reg = ToX87Register(input);
5305 __ X87TOSToI(result_reg, instr->hydrogen()->GetMinusZeroMode(),
5306 &lost_precision, &is_nan, &minus_zero, Label::kNear);
5307 __ jmp(&done, Label::kNear);
5308 __ bind(&lost_precision);
5309 DeoptimizeIf(no_condition, instr, "lost precision");
5311 DeoptimizeIf(no_condition, instr, "NaN");
5312 __ bind(&minus_zero);
5313 DeoptimizeIf(no_condition, instr, "minus zero");
5319 void LCodeGen::DoDoubleToSmi(LDoubleToSmi* instr) {
5320 LOperand* input = instr->value();
5321 DCHECK(input->IsDoubleRegister());
5322 LOperand* result = instr->result();
5323 DCHECK(result->IsRegister());
5324 Register result_reg = ToRegister(result);
5326 Label lost_precision, is_nan, minus_zero, done;
5327 X87Register input_reg = ToX87Register(input);
5329 __ X87TOSToI(result_reg, instr->hydrogen()->GetMinusZeroMode(),
5330 &lost_precision, &is_nan, &minus_zero,
5331 DeoptEveryNTimes() ? Label::kFar : Label::kNear);
5332 __ jmp(&done, Label::kNear);
5333 __ bind(&lost_precision);
5334 DeoptimizeIf(no_condition, instr, "lost precision");
5336 DeoptimizeIf(no_condition, instr, "NaN");
5337 __ bind(&minus_zero);
5338 DeoptimizeIf(no_condition, instr, "minus zero");
5340 __ SmiTag(result_reg);
5341 DeoptimizeIf(overflow, instr, "overflow");
5345 void LCodeGen::DoCheckSmi(LCheckSmi* instr) {
5346 LOperand* input = instr->value();
5347 __ test(ToOperand(input), Immediate(kSmiTagMask));
5348 DeoptimizeIf(not_zero, instr, "not a Smi");
5352 void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) {
5353 if (!instr->hydrogen()->value()->type().IsHeapObject()) {
5354 LOperand* input = instr->value();
5355 __ test(ToOperand(input), Immediate(kSmiTagMask));
5356 DeoptimizeIf(zero, instr, "Smi");
5361 void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) {
5362 Register input = ToRegister(instr->value());
5363 Register temp = ToRegister(instr->temp());
5365 __ mov(temp, FieldOperand(input, HeapObject::kMapOffset));
5367 if (instr->hydrogen()->is_interval_check()) {
5370 instr->hydrogen()->GetCheckInterval(&first, &last);
5372 __ cmpb(FieldOperand(temp, Map::kInstanceTypeOffset),
5373 static_cast<int8_t>(first));
5375 // If there is only one type in the interval check for equality.
5376 if (first == last) {
5377 DeoptimizeIf(not_equal, instr, "wrong instance type");
5379 DeoptimizeIf(below, instr, "wrong instance type");
5380 // Omit check for the last type.
5381 if (last != LAST_TYPE) {
5382 __ cmpb(FieldOperand(temp, Map::kInstanceTypeOffset),
5383 static_cast<int8_t>(last));
5384 DeoptimizeIf(above, instr, "wrong instance type");
5390 instr->hydrogen()->GetCheckMaskAndTag(&mask, &tag);
5392 if (base::bits::IsPowerOfTwo32(mask)) {
5393 DCHECK(tag == 0 || base::bits::IsPowerOfTwo32(tag));
5394 __ test_b(FieldOperand(temp, Map::kInstanceTypeOffset), mask);
5395 DeoptimizeIf(tag == 0 ? not_zero : zero, instr, "wrong instance type");
5397 __ movzx_b(temp, FieldOperand(temp, Map::kInstanceTypeOffset));
5398 __ and_(temp, mask);
5400 DeoptimizeIf(not_equal, instr, "wrong instance type");
5406 void LCodeGen::DoCheckValue(LCheckValue* instr) {
5407 Handle<HeapObject> object = instr->hydrogen()->object().handle();
5408 if (instr->hydrogen()->object_in_new_space()) {
5409 Register reg = ToRegister(instr->value());
5410 Handle<Cell> cell = isolate()->factory()->NewCell(object);
5411 __ cmp(reg, Operand::ForCell(cell));
5413 Operand operand = ToOperand(instr->value());
5414 __ cmp(operand, object);
5416 DeoptimizeIf(not_equal, instr, "value mismatch");
5420 void LCodeGen::DoDeferredInstanceMigration(LCheckMaps* instr, Register object) {
5422 PushSafepointRegistersScope scope(this);
5425 __ CallRuntimeSaveDoubles(Runtime::kTryMigrateInstance);
5426 RecordSafepointWithRegisters(
5427 instr->pointer_map(), 1, Safepoint::kNoLazyDeopt);
5429 __ test(eax, Immediate(kSmiTagMask));
5431 DeoptimizeIf(zero, instr, "instance migration failed");
5435 void LCodeGen::DoCheckMaps(LCheckMaps* instr) {
5436 class DeferredCheckMaps FINAL : public LDeferredCode {
5438 DeferredCheckMaps(LCodeGen* codegen,
5441 const X87Stack& x87_stack)
5442 : LDeferredCode(codegen, x87_stack), instr_(instr), object_(object) {
5443 SetExit(check_maps());
5445 virtual void Generate() OVERRIDE {
5446 codegen()->DoDeferredInstanceMigration(instr_, object_);
5448 Label* check_maps() { return &check_maps_; }
5449 virtual LInstruction* instr() OVERRIDE { return instr_; }
5456 if (instr->hydrogen()->IsStabilityCheck()) {
5457 const UniqueSet<Map>* maps = instr->hydrogen()->maps();
5458 for (int i = 0; i < maps->size(); ++i) {
5459 AddStabilityDependency(maps->at(i).handle());
5464 LOperand* input = instr->value();
5465 DCHECK(input->IsRegister());
5466 Register reg = ToRegister(input);
5468 DeferredCheckMaps* deferred = NULL;
5469 if (instr->hydrogen()->HasMigrationTarget()) {
5470 deferred = new(zone()) DeferredCheckMaps(this, instr, reg, x87_stack_);
5471 __ bind(deferred->check_maps());
5474 const UniqueSet<Map>* maps = instr->hydrogen()->maps();
5476 for (int i = 0; i < maps->size() - 1; i++) {
5477 Handle<Map> map = maps->at(i).handle();
5478 __ CompareMap(reg, map);
5479 __ j(equal, &success, Label::kNear);
5482 Handle<Map> map = maps->at(maps->size() - 1).handle();
5483 __ CompareMap(reg, map);
5484 if (instr->hydrogen()->HasMigrationTarget()) {
5485 __ j(not_equal, deferred->entry());
5487 DeoptimizeIf(not_equal, instr, "wrong map");
5494 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) {
5495 X87Register value_reg = ToX87Register(instr->unclamped());
5496 Register result_reg = ToRegister(instr->result());
5498 __ ClampTOSToUint8(result_reg);
5502 void LCodeGen::DoClampIToUint8(LClampIToUint8* instr) {
5503 DCHECK(instr->unclamped()->Equals(instr->result()));
5504 Register value_reg = ToRegister(instr->result());
5505 __ ClampUint8(value_reg);
5509 void LCodeGen::DoClampTToUint8NoSSE2(LClampTToUint8NoSSE2* instr) {
5510 Register input_reg = ToRegister(instr->unclamped());
5511 Register result_reg = ToRegister(instr->result());
5512 Register scratch = ToRegister(instr->scratch());
5513 Register scratch2 = ToRegister(instr->scratch2());
5514 Register scratch3 = ToRegister(instr->scratch3());
5515 Label is_smi, done, heap_number, valid_exponent,
5516 largest_value, zero_result, maybe_nan_or_infinity;
5518 __ JumpIfSmi(input_reg, &is_smi);
5520 // Check for heap number
5521 __ cmp(FieldOperand(input_reg, HeapObject::kMapOffset),
5522 factory()->heap_number_map());
5523 __ j(equal, &heap_number, Label::kNear);
5525 // Check for undefined. Undefined is converted to zero for clamping
5527 __ cmp(input_reg, factory()->undefined_value());
5528 DeoptimizeIf(not_equal, instr, "not a heap number/undefined");
5529 __ jmp(&zero_result, Label::kNear);
5532 __ bind(&heap_number);
5534 // Surprisingly, all of the hand-crafted bit-manipulations below are much
5535 // faster than the x86 FPU built-in instruction, especially since "banker's
5536 // rounding" would be additionally very expensive
5538 // Get exponent word.
5539 __ mov(scratch, FieldOperand(input_reg, HeapNumber::kExponentOffset));
5540 __ mov(scratch3, FieldOperand(input_reg, HeapNumber::kMantissaOffset));
5542 // Test for negative values --> clamp to zero
5543 __ test(scratch, scratch);
5544 __ j(negative, &zero_result, Label::kNear);
5546 // Get exponent alone in scratch2.
5547 __ mov(scratch2, scratch);
5548 __ and_(scratch2, HeapNumber::kExponentMask);
5549 __ shr(scratch2, HeapNumber::kExponentShift);
5550 __ j(zero, &zero_result, Label::kNear);
5551 __ sub(scratch2, Immediate(HeapNumber::kExponentBias - 1));
5552 __ j(negative, &zero_result, Label::kNear);
5554 const uint32_t non_int8_exponent = 7;
5555 __ cmp(scratch2, Immediate(non_int8_exponent + 1));
5556 // If the exponent is too big, check for special values.
5557 __ j(greater, &maybe_nan_or_infinity, Label::kNear);
5559 __ bind(&valid_exponent);
5560 // Exponent word in scratch, exponent in scratch2. We know that 0 <= exponent
5561 // < 7. The shift bias is the number of bits to shift the mantissa such that
5562 // with an exponent of 7 such the that top-most one is in bit 30, allowing
5563 // detection the rounding overflow of a 255.5 to 256 (bit 31 goes from 0 to
5565 int shift_bias = (30 - HeapNumber::kExponentShift) - 7 - 1;
5566 __ lea(result_reg, MemOperand(scratch2, shift_bias));
5567 // Here result_reg (ecx) is the shift, scratch is the exponent word. Get the
5568 // top bits of the mantissa.
5569 __ and_(scratch, HeapNumber::kMantissaMask);
5570 // Put back the implicit 1 of the mantissa
5571 __ or_(scratch, 1 << HeapNumber::kExponentShift);
5572 // Shift up to round
5574 // Use "banker's rounding" to spec: If fractional part of number is 0.5, then
5575 // use the bit in the "ones" place and add it to the "halves" place, which has
5576 // the effect of rounding to even.
5577 __ mov(scratch2, scratch);
5578 const uint32_t one_half_bit_shift = 30 - sizeof(uint8_t) * 8;
5579 const uint32_t one_bit_shift = one_half_bit_shift + 1;
5580 __ and_(scratch2, Immediate((1 << one_bit_shift) - 1));
5581 __ cmp(scratch2, Immediate(1 << one_half_bit_shift));
5583 __ j(less, &no_round, Label::kNear);
5585 __ mov(scratch2, Immediate(1 << one_half_bit_shift));
5586 __ j(greater, &round_up, Label::kNear);
5587 __ test(scratch3, scratch3);
5588 __ j(not_zero, &round_up, Label::kNear);
5589 __ mov(scratch2, scratch);
5590 __ and_(scratch2, Immediate(1 << one_bit_shift));
5591 __ shr(scratch2, 1);
5593 __ add(scratch, scratch2);
5594 __ j(overflow, &largest_value, Label::kNear);
5596 __ shr(scratch, 23);
5597 __ mov(result_reg, scratch);
5598 __ jmp(&done, Label::kNear);
5600 __ bind(&maybe_nan_or_infinity);
5601 // Check for NaN/Infinity, all other values map to 255
5602 __ cmp(scratch2, Immediate(HeapNumber::kInfinityOrNanExponent + 1));
5603 __ j(not_equal, &largest_value, Label::kNear);
5605 // Check for NaN, which differs from Infinity in that at least one mantissa
5607 __ and_(scratch, HeapNumber::kMantissaMask);
5608 __ or_(scratch, FieldOperand(input_reg, HeapNumber::kMantissaOffset));
5609 __ j(not_zero, &zero_result, Label::kNear); // M!=0 --> NaN
5610 // Infinity -> Fall through to map to 255.
5612 __ bind(&largest_value);
5613 __ mov(result_reg, Immediate(255));
5614 __ jmp(&done, Label::kNear);
5616 __ bind(&zero_result);
5617 __ xor_(result_reg, result_reg);
5618 __ jmp(&done, Label::kNear);
5622 if (!input_reg.is(result_reg)) {
5623 __ mov(result_reg, input_reg);
5625 __ SmiUntag(result_reg);
5626 __ ClampUint8(result_reg);
5631 void LCodeGen::DoDoubleBits(LDoubleBits* instr) {
5632 X87Register value_reg = ToX87Register(instr->value());
5633 Register result_reg = ToRegister(instr->result());
5635 __ sub(esp, Immediate(kDoubleSize));
5636 __ fst_d(Operand(esp, 0));
5637 if (instr->hydrogen()->bits() == HDoubleBits::HIGH) {
5638 __ mov(result_reg, Operand(esp, kPointerSize));
5640 __ mov(result_reg, Operand(esp, 0));
5642 __ add(esp, Immediate(kDoubleSize));
5646 void LCodeGen::DoConstructDouble(LConstructDouble* instr) {
5647 Register hi_reg = ToRegister(instr->hi());
5648 Register lo_reg = ToRegister(instr->lo());
5649 X87Register result_reg = ToX87Register(instr->result());
5650 // Follow below pattern to write a x87 fp register.
5651 X87PrepareToWrite(result_reg);
5652 __ sub(esp, Immediate(kDoubleSize));
5653 __ mov(Operand(esp, 0), lo_reg);
5654 __ mov(Operand(esp, kPointerSize), hi_reg);
5655 __ fld_d(Operand(esp, 0));
5656 __ add(esp, Immediate(kDoubleSize));
5657 X87CommitWrite(result_reg);
5661 void LCodeGen::DoAllocate(LAllocate* instr) {
5662 class DeferredAllocate FINAL : public LDeferredCode {
5664 DeferredAllocate(LCodeGen* codegen,
5666 const X87Stack& x87_stack)
5667 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
5668 virtual void Generate() OVERRIDE {
5669 codegen()->DoDeferredAllocate(instr_);
5671 virtual LInstruction* instr() OVERRIDE { return instr_; }
5676 DeferredAllocate* deferred =
5677 new(zone()) DeferredAllocate(this, instr, x87_stack_);
5679 Register result = ToRegister(instr->result());
5680 Register temp = ToRegister(instr->temp());
5682 // Allocate memory for the object.
5683 AllocationFlags flags = TAG_OBJECT;
5684 if (instr->hydrogen()->MustAllocateDoubleAligned()) {
5685 flags = static_cast<AllocationFlags>(flags | DOUBLE_ALIGNMENT);
5687 if (instr->hydrogen()->IsOldPointerSpaceAllocation()) {
5688 DCHECK(!instr->hydrogen()->IsOldDataSpaceAllocation());
5689 DCHECK(!instr->hydrogen()->IsNewSpaceAllocation());
5690 flags = static_cast<AllocationFlags>(flags | PRETENURE_OLD_POINTER_SPACE);
5691 } else if (instr->hydrogen()->IsOldDataSpaceAllocation()) {
5692 DCHECK(!instr->hydrogen()->IsNewSpaceAllocation());
5693 flags = static_cast<AllocationFlags>(flags | PRETENURE_OLD_DATA_SPACE);
5696 if (instr->size()->IsConstantOperand()) {
5697 int32_t size = ToInteger32(LConstantOperand::cast(instr->size()));
5698 if (size <= Page::kMaxRegularHeapObjectSize) {
5699 __ Allocate(size, result, temp, no_reg, deferred->entry(), flags);
5701 __ jmp(deferred->entry());
5704 Register size = ToRegister(instr->size());
5705 __ Allocate(size, result, temp, no_reg, deferred->entry(), flags);
5708 __ bind(deferred->exit());
5710 if (instr->hydrogen()->MustPrefillWithFiller()) {
5711 if (instr->size()->IsConstantOperand()) {
5712 int32_t size = ToInteger32(LConstantOperand::cast(instr->size()));
5713 __ mov(temp, (size / kPointerSize) - 1);
5715 temp = ToRegister(instr->size());
5716 __ shr(temp, kPointerSizeLog2);
5721 __ mov(FieldOperand(result, temp, times_pointer_size, 0),
5722 isolate()->factory()->one_pointer_filler_map());
5724 __ j(not_zero, &loop);
5729 void LCodeGen::DoDeferredAllocate(LAllocate* instr) {
5730 Register result = ToRegister(instr->result());
5732 // TODO(3095996): Get rid of this. For now, we need to make the
5733 // result register contain a valid pointer because it is already
5734 // contained in the register pointer map.
5735 __ Move(result, Immediate(Smi::FromInt(0)));
5737 PushSafepointRegistersScope scope(this);
5738 if (instr->size()->IsRegister()) {
5739 Register size = ToRegister(instr->size());
5740 DCHECK(!size.is(result));
5741 __ SmiTag(ToRegister(instr->size()));
5744 int32_t size = ToInteger32(LConstantOperand::cast(instr->size()));
5745 if (size >= 0 && size <= Smi::kMaxValue) {
5746 __ push(Immediate(Smi::FromInt(size)));
5748 // We should never get here at runtime => abort
5754 int flags = AllocateDoubleAlignFlag::encode(
5755 instr->hydrogen()->MustAllocateDoubleAligned());
5756 if (instr->hydrogen()->IsOldPointerSpaceAllocation()) {
5757 DCHECK(!instr->hydrogen()->IsOldDataSpaceAllocation());
5758 DCHECK(!instr->hydrogen()->IsNewSpaceAllocation());
5759 flags = AllocateTargetSpace::update(flags, OLD_POINTER_SPACE);
5760 } else if (instr->hydrogen()->IsOldDataSpaceAllocation()) {
5761 DCHECK(!instr->hydrogen()->IsNewSpaceAllocation());
5762 flags = AllocateTargetSpace::update(flags, OLD_DATA_SPACE);
5764 flags = AllocateTargetSpace::update(flags, NEW_SPACE);
5766 __ push(Immediate(Smi::FromInt(flags)));
5768 CallRuntimeFromDeferred(
5769 Runtime::kAllocateInTargetSpace, 2, instr, instr->context());
5770 __ StoreToSafepointRegisterSlot(result, eax);
5774 void LCodeGen::DoToFastProperties(LToFastProperties* instr) {
5775 DCHECK(ToRegister(instr->value()).is(eax));
5777 CallRuntime(Runtime::kToFastProperties, 1, instr);
5781 void LCodeGen::DoRegExpLiteral(LRegExpLiteral* instr) {
5782 DCHECK(ToRegister(instr->context()).is(esi));
5784 // Registers will be used as follows:
5785 // ecx = literals array.
5786 // ebx = regexp literal.
5787 // eax = regexp literal clone.
5789 int literal_offset =
5790 FixedArray::OffsetOfElementAt(instr->hydrogen()->literal_index());
5791 __ LoadHeapObject(ecx, instr->hydrogen()->literals());
5792 __ mov(ebx, FieldOperand(ecx, literal_offset));
5793 __ cmp(ebx, factory()->undefined_value());
5794 __ j(not_equal, &materialized, Label::kNear);
5796 // Create regexp literal using runtime function
5797 // Result will be in eax.
5799 __ push(Immediate(Smi::FromInt(instr->hydrogen()->literal_index())));
5800 __ push(Immediate(instr->hydrogen()->pattern()));
5801 __ push(Immediate(instr->hydrogen()->flags()));
5802 CallRuntime(Runtime::kMaterializeRegExpLiteral, 4, instr);
5805 __ bind(&materialized);
5806 int size = JSRegExp::kSize + JSRegExp::kInObjectFieldCount * kPointerSize;
5807 Label allocated, runtime_allocate;
5808 __ Allocate(size, eax, ecx, edx, &runtime_allocate, TAG_OBJECT);
5809 __ jmp(&allocated, Label::kNear);
5811 __ bind(&runtime_allocate);
5813 __ push(Immediate(Smi::FromInt(size)));
5814 CallRuntime(Runtime::kAllocateInNewSpace, 1, instr);
5817 __ bind(&allocated);
5818 // Copy the content into the newly allocated memory.
5819 // (Unroll copy loop once for better throughput).
5820 for (int i = 0; i < size - kPointerSize; i += 2 * kPointerSize) {
5821 __ mov(edx, FieldOperand(ebx, i));
5822 __ mov(ecx, FieldOperand(ebx, i + kPointerSize));
5823 __ mov(FieldOperand(eax, i), edx);
5824 __ mov(FieldOperand(eax, i + kPointerSize), ecx);
5826 if ((size % (2 * kPointerSize)) != 0) {
5827 __ mov(edx, FieldOperand(ebx, size - kPointerSize));
5828 __ mov(FieldOperand(eax, size - kPointerSize), edx);
5833 void LCodeGen::DoFunctionLiteral(LFunctionLiteral* instr) {
5834 DCHECK(ToRegister(instr->context()).is(esi));
5835 // Use the fast case closure allocation code that allocates in new
5836 // space for nested functions that don't need literals cloning.
5837 bool pretenure = instr->hydrogen()->pretenure();
5838 if (!pretenure && instr->hydrogen()->has_no_literals()) {
5839 FastNewClosureStub stub(isolate(), instr->hydrogen()->strict_mode(),
5840 instr->hydrogen()->kind());
5841 __ mov(ebx, Immediate(instr->hydrogen()->shared_info()));
5842 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr);
5845 __ push(Immediate(instr->hydrogen()->shared_info()));
5846 __ push(Immediate(pretenure ? factory()->true_value()
5847 : factory()->false_value()));
5848 CallRuntime(Runtime::kNewClosure, 3, instr);
5853 void LCodeGen::DoTypeof(LTypeof* instr) {
5854 DCHECK(ToRegister(instr->context()).is(esi));
5855 LOperand* input = instr->value();
5856 EmitPushTaggedOperand(input);
5857 CallRuntime(Runtime::kTypeof, 1, instr);
5861 void LCodeGen::DoTypeofIsAndBranch(LTypeofIsAndBranch* instr) {
5862 Register input = ToRegister(instr->value());
5863 Condition final_branch_condition = EmitTypeofIs(instr, input);
5864 if (final_branch_condition != no_condition) {
5865 EmitBranch(instr, final_branch_condition);
5870 Condition LCodeGen::EmitTypeofIs(LTypeofIsAndBranch* instr, Register input) {
5871 Label* true_label = instr->TrueLabel(chunk_);
5872 Label* false_label = instr->FalseLabel(chunk_);
5873 Handle<String> type_name = instr->type_literal();
5874 int left_block = instr->TrueDestination(chunk_);
5875 int right_block = instr->FalseDestination(chunk_);
5876 int next_block = GetNextEmittedBlock();
5878 Label::Distance true_distance = left_block == next_block ? Label::kNear
5880 Label::Distance false_distance = right_block == next_block ? Label::kNear
5882 Condition final_branch_condition = no_condition;
5883 if (String::Equals(type_name, factory()->number_string())) {
5884 __ JumpIfSmi(input, true_label, true_distance);
5885 __ cmp(FieldOperand(input, HeapObject::kMapOffset),
5886 factory()->heap_number_map());
5887 final_branch_condition = equal;
5889 } else if (String::Equals(type_name, factory()->string_string())) {
5890 __ JumpIfSmi(input, false_label, false_distance);
5891 __ CmpObjectType(input, FIRST_NONSTRING_TYPE, input);
5892 __ j(above_equal, false_label, false_distance);
5893 __ test_b(FieldOperand(input, Map::kBitFieldOffset),
5894 1 << Map::kIsUndetectable);
5895 final_branch_condition = zero;
5897 } else if (String::Equals(type_name, factory()->symbol_string())) {
5898 __ JumpIfSmi(input, false_label, false_distance);
5899 __ CmpObjectType(input, SYMBOL_TYPE, input);
5900 final_branch_condition = equal;
5902 } else if (String::Equals(type_name, factory()->boolean_string())) {
5903 __ cmp(input, factory()->true_value());
5904 __ j(equal, true_label, true_distance);
5905 __ cmp(input, factory()->false_value());
5906 final_branch_condition = equal;
5908 } else if (String::Equals(type_name, factory()->undefined_string())) {
5909 __ cmp(input, factory()->undefined_value());
5910 __ j(equal, true_label, true_distance);
5911 __ JumpIfSmi(input, false_label, false_distance);
5912 // Check for undetectable objects => true.
5913 __ mov(input, FieldOperand(input, HeapObject::kMapOffset));
5914 __ test_b(FieldOperand(input, Map::kBitFieldOffset),
5915 1 << Map::kIsUndetectable);
5916 final_branch_condition = not_zero;
5918 } else if (String::Equals(type_name, factory()->function_string())) {
5919 STATIC_ASSERT(NUM_OF_CALLABLE_SPEC_OBJECT_TYPES == 2);
5920 __ JumpIfSmi(input, false_label, false_distance);
5921 __ CmpObjectType(input, JS_FUNCTION_TYPE, input);
5922 __ j(equal, true_label, true_distance);
5923 __ CmpInstanceType(input, JS_FUNCTION_PROXY_TYPE);
5924 final_branch_condition = equal;
5926 } else if (String::Equals(type_name, factory()->object_string())) {
5927 __ JumpIfSmi(input, false_label, false_distance);
5928 __ cmp(input, factory()->null_value());
5929 __ j(equal, true_label, true_distance);
5930 __ CmpObjectType(input, FIRST_NONCALLABLE_SPEC_OBJECT_TYPE, input);
5931 __ j(below, false_label, false_distance);
5932 __ CmpInstanceType(input, LAST_NONCALLABLE_SPEC_OBJECT_TYPE);
5933 __ j(above, false_label, false_distance);
5934 // Check for undetectable objects => false.
5935 __ test_b(FieldOperand(input, Map::kBitFieldOffset),
5936 1 << Map::kIsUndetectable);
5937 final_branch_condition = zero;
5940 __ jmp(false_label, false_distance);
5942 return final_branch_condition;
5946 void LCodeGen::DoIsConstructCallAndBranch(LIsConstructCallAndBranch* instr) {
5947 Register temp = ToRegister(instr->temp());
5949 EmitIsConstructCall(temp);
5950 EmitBranch(instr, equal);
5954 void LCodeGen::EmitIsConstructCall(Register temp) {
5955 // Get the frame pointer for the calling frame.
5956 __ mov(temp, Operand(ebp, StandardFrameConstants::kCallerFPOffset));
5958 // Skip the arguments adaptor frame if it exists.
5959 Label check_frame_marker;
5960 __ cmp(Operand(temp, StandardFrameConstants::kContextOffset),
5961 Immediate(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
5962 __ j(not_equal, &check_frame_marker, Label::kNear);
5963 __ mov(temp, Operand(temp, StandardFrameConstants::kCallerFPOffset));
5965 // Check the marker in the calling frame.
5966 __ bind(&check_frame_marker);
5967 __ cmp(Operand(temp, StandardFrameConstants::kMarkerOffset),
5968 Immediate(Smi::FromInt(StackFrame::CONSTRUCT)));
5972 void LCodeGen::EnsureSpaceForLazyDeopt(int space_needed) {
5973 if (!info()->IsStub()) {
5974 // Ensure that we have enough space after the previous lazy-bailout
5975 // instruction for patching the code here.
5976 int current_pc = masm()->pc_offset();
5977 if (current_pc < last_lazy_deopt_pc_ + space_needed) {
5978 int padding_size = last_lazy_deopt_pc_ + space_needed - current_pc;
5979 __ Nop(padding_size);
5982 last_lazy_deopt_pc_ = masm()->pc_offset();
5986 void LCodeGen::DoLazyBailout(LLazyBailout* instr) {
5987 last_lazy_deopt_pc_ = masm()->pc_offset();
5988 DCHECK(instr->HasEnvironment());
5989 LEnvironment* env = instr->environment();
5990 RegisterEnvironmentForDeoptimization(env, Safepoint::kLazyDeopt);
5991 safepoints_.RecordLazyDeoptimizationIndex(env->deoptimization_index());
5995 void LCodeGen::DoDeoptimize(LDeoptimize* instr) {
5996 Deoptimizer::BailoutType type = instr->hydrogen()->type();
5997 // TODO(danno): Stubs expect all deopts to be lazy for historical reasons (the
5998 // needed return address), even though the implementation of LAZY and EAGER is
5999 // now identical. When LAZY is eventually completely folded into EAGER, remove
6000 // the special case below.
6001 if (info()->IsStub() && type == Deoptimizer::EAGER) {
6002 type = Deoptimizer::LAZY;
6004 DeoptimizeIf(no_condition, instr, instr->hydrogen()->reason(), type);
6008 void LCodeGen::DoDummy(LDummy* instr) {
6009 // Nothing to see here, move on!
6013 void LCodeGen::DoDummyUse(LDummyUse* instr) {
6014 // Nothing to see here, move on!
6018 void LCodeGen::DoDeferredStackCheck(LStackCheck* instr) {
6019 PushSafepointRegistersScope scope(this);
6020 __ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
6021 __ CallRuntimeSaveDoubles(Runtime::kStackGuard);
6022 RecordSafepointWithLazyDeopt(
6023 instr, RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS);
6024 DCHECK(instr->HasEnvironment());
6025 LEnvironment* env = instr->environment();
6026 safepoints_.RecordLazyDeoptimizationIndex(env->deoptimization_index());
6030 void LCodeGen::DoStackCheck(LStackCheck* instr) {
6031 class DeferredStackCheck FINAL : public LDeferredCode {
6033 DeferredStackCheck(LCodeGen* codegen,
6035 const X87Stack& x87_stack)
6036 : LDeferredCode(codegen, x87_stack), instr_(instr) { }
6037 virtual void Generate() OVERRIDE {
6038 codegen()->DoDeferredStackCheck(instr_);
6040 virtual LInstruction* instr() OVERRIDE { return instr_; }
6042 LStackCheck* instr_;
6045 DCHECK(instr->HasEnvironment());
6046 LEnvironment* env = instr->environment();
6047 // There is no LLazyBailout instruction for stack-checks. We have to
6048 // prepare for lazy deoptimization explicitly here.
6049 if (instr->hydrogen()->is_function_entry()) {
6050 // Perform stack overflow check.
6052 ExternalReference stack_limit =
6053 ExternalReference::address_of_stack_limit(isolate());
6054 __ cmp(esp, Operand::StaticVariable(stack_limit));
6055 __ j(above_equal, &done, Label::kNear);
6057 DCHECK(instr->context()->IsRegister());
6058 DCHECK(ToRegister(instr->context()).is(esi));
6059 CallCode(isolate()->builtins()->StackCheck(),
6060 RelocInfo::CODE_TARGET,
6064 DCHECK(instr->hydrogen()->is_backwards_branch());
6065 // Perform stack overflow check if this goto needs it before jumping.
6066 DeferredStackCheck* deferred_stack_check =
6067 new(zone()) DeferredStackCheck(this, instr, x87_stack_);
6068 ExternalReference stack_limit =
6069 ExternalReference::address_of_stack_limit(isolate());
6070 __ cmp(esp, Operand::StaticVariable(stack_limit));
6071 __ j(below, deferred_stack_check->entry());
6072 EnsureSpaceForLazyDeopt(Deoptimizer::patch_size());
6073 __ bind(instr->done_label());
6074 deferred_stack_check->SetExit(instr->done_label());
6075 RegisterEnvironmentForDeoptimization(env, Safepoint::kLazyDeopt);
6076 // Don't record a deoptimization index for the safepoint here.
6077 // This will be done explicitly when emitting call and the safepoint in
6078 // the deferred code.
6083 void LCodeGen::DoOsrEntry(LOsrEntry* instr) {
6084 // This is a pseudo-instruction that ensures that the environment here is
6085 // properly registered for deoptimization and records the assembler's PC
6087 LEnvironment* environment = instr->environment();
6089 // If the environment were already registered, we would have no way of
6090 // backpatching it with the spill slot operands.
6091 DCHECK(!environment->HasBeenRegistered());
6092 RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt);
6094 GenerateOsrPrologue();
6098 void LCodeGen::DoForInPrepareMap(LForInPrepareMap* instr) {
6099 DCHECK(ToRegister(instr->context()).is(esi));
6100 __ cmp(eax, isolate()->factory()->undefined_value());
6101 DeoptimizeIf(equal, instr, "undefined");
6103 __ cmp(eax, isolate()->factory()->null_value());
6104 DeoptimizeIf(equal, instr, "null");
6106 __ test(eax, Immediate(kSmiTagMask));
6107 DeoptimizeIf(zero, instr, "Smi");
6109 STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE);
6110 __ CmpObjectType(eax, LAST_JS_PROXY_TYPE, ecx);
6111 DeoptimizeIf(below_equal, instr, "wrong instance type");
6113 Label use_cache, call_runtime;
6114 __ CheckEnumCache(&call_runtime);
6116 __ mov(eax, FieldOperand(eax, HeapObject::kMapOffset));
6117 __ jmp(&use_cache, Label::kNear);
6119 // Get the set of properties to enumerate.
6120 __ bind(&call_runtime);
6122 CallRuntime(Runtime::kGetPropertyNamesFast, 1, instr);
6124 __ cmp(FieldOperand(eax, HeapObject::kMapOffset),
6125 isolate()->factory()->meta_map());
6126 DeoptimizeIf(not_equal, instr, "wrong map");
6127 __ bind(&use_cache);
6131 void LCodeGen::DoForInCacheArray(LForInCacheArray* instr) {
6132 Register map = ToRegister(instr->map());
6133 Register result = ToRegister(instr->result());
6134 Label load_cache, done;
6135 __ EnumLength(result, map);
6136 __ cmp(result, Immediate(Smi::FromInt(0)));
6137 __ j(not_equal, &load_cache, Label::kNear);
6138 __ mov(result, isolate()->factory()->empty_fixed_array());
6139 __ jmp(&done, Label::kNear);
6141 __ bind(&load_cache);
6142 __ LoadInstanceDescriptors(map, result);
6144 FieldOperand(result, DescriptorArray::kEnumCacheOffset));
6146 FieldOperand(result, FixedArray::SizeFor(instr->idx())));
6148 __ test(result, result);
6149 DeoptimizeIf(equal, instr, "no cache");
6153 void LCodeGen::DoCheckMapValue(LCheckMapValue* instr) {
6154 Register object = ToRegister(instr->value());
6155 __ cmp(ToRegister(instr->map()),
6156 FieldOperand(object, HeapObject::kMapOffset));
6157 DeoptimizeIf(not_equal, instr, "wrong map");
6161 void LCodeGen::DoDeferredLoadMutableDouble(LLoadFieldByIndex* instr,
6164 PushSafepointRegistersScope scope(this);
6168 __ CallRuntimeSaveDoubles(Runtime::kLoadMutableDouble);
6169 RecordSafepointWithRegisters(
6170 instr->pointer_map(), 2, Safepoint::kNoLazyDeopt);
6171 __ StoreToSafepointRegisterSlot(object, eax);
6175 void LCodeGen::DoLoadFieldByIndex(LLoadFieldByIndex* instr) {
6176 class DeferredLoadMutableDouble FINAL : public LDeferredCode {
6178 DeferredLoadMutableDouble(LCodeGen* codegen,
6179 LLoadFieldByIndex* instr,
6182 const X87Stack& x87_stack)
6183 : LDeferredCode(codegen, x87_stack),
6188 virtual void Generate() OVERRIDE {
6189 codegen()->DoDeferredLoadMutableDouble(instr_, object_, index_);
6191 virtual LInstruction* instr() OVERRIDE { return instr_; }
6193 LLoadFieldByIndex* instr_;
6198 Register object = ToRegister(instr->object());
6199 Register index = ToRegister(instr->index());
6201 DeferredLoadMutableDouble* deferred;
6202 deferred = new(zone()) DeferredLoadMutableDouble(
6203 this, instr, object, index, x87_stack_);
6205 Label out_of_object, done;
6206 __ test(index, Immediate(Smi::FromInt(1)));
6207 __ j(not_zero, deferred->entry());
6211 __ cmp(index, Immediate(0));
6212 __ j(less, &out_of_object, Label::kNear);
6213 __ mov(object, FieldOperand(object,
6215 times_half_pointer_size,
6216 JSObject::kHeaderSize));
6217 __ jmp(&done, Label::kNear);
6219 __ bind(&out_of_object);
6220 __ mov(object, FieldOperand(object, JSObject::kPropertiesOffset));
6222 // Index is now equal to out of object property index plus 1.
6223 __ mov(object, FieldOperand(object,
6225 times_half_pointer_size,
6226 FixedArray::kHeaderSize - kPointerSize));
6227 __ bind(deferred->exit());
6232 void LCodeGen::DoStoreFrameContext(LStoreFrameContext* instr) {
6233 Register context = ToRegister(instr->context());
6234 __ mov(Operand(ebp, StandardFrameConstants::kContextOffset), context);
6238 void LCodeGen::DoAllocateBlockContext(LAllocateBlockContext* instr) {
6239 Handle<ScopeInfo> scope_info = instr->scope_info();
6240 __ Push(scope_info);
6241 __ push(ToRegister(instr->function()));
6242 CallRuntime(Runtime::kPushBlockContext, 2, instr);
6243 RecordSafepoint(Safepoint::kNoLazyDeopt);
6249 } } // namespace v8::internal
6251 #endif // V8_TARGET_ARCH_X87