| Index: src/mips/lithium-codegen-mips.cc
|
| diff --git a/src/mips/lithium-codegen-mips.cc b/src/mips/lithium-codegen-mips.cc
|
| index a096709cb818b43448b6e621f57108b2c5e492f4..565c2506ba5ef85a67dacf021568016424570e0a 100644
|
| --- a/src/mips/lithium-codegen-mips.cc
|
| +++ b/src/mips/lithium-codegen-mips.cc
|
| @@ -332,8 +332,7 @@ bool LCodeGen::GenerateDeoptJumpTable() {
|
| Assembler::BlockTrampolinePoolScope block_trampoline_pool(masm_);
|
| Label table_start;
|
| __ bind(&table_start);
|
| - Label needs_frame_not_call;
|
| - Label needs_frame_is_call;
|
| + Label needs_frame;
|
| for (int i = 0; i < deopt_jump_table_.length(); i++) {
|
| __ bind(&deopt_jump_table_[i].label);
|
| Address entry = deopt_jump_table_[i].address;
|
| @@ -346,43 +345,22 @@ bool LCodeGen::GenerateDeoptJumpTable() {
|
| }
|
| __ li(t9, Operand(ExternalReference::ForDeoptEntry(entry)));
|
| if (deopt_jump_table_[i].needs_frame) {
|
| - if (type == Deoptimizer::LAZY) {
|
| - if (needs_frame_is_call.is_bound()) {
|
| - __ Branch(&needs_frame_is_call);
|
| - } else {
|
| - __ bind(&needs_frame_is_call);
|
| - __ MultiPush(cp.bit() | fp.bit() | ra.bit());
|
| - // This variant of deopt can only be used with stubs. Since we don't
|
| - // have a function pointer to install in the stack frame that we're
|
| - // building, install a special marker there instead.
|
| - ASSERT(info()->IsStub());
|
| - __ li(scratch0(), Operand(Smi::FromInt(StackFrame::STUB)));
|
| - __ push(scratch0());
|
| - __ Addu(fp, sp, Operand(2 * kPointerSize));
|
| - __ Call(t9);
|
| - }
|
| + if (needs_frame.is_bound()) {
|
| + __ Branch(&needs_frame);
|
| } else {
|
| - if (needs_frame_not_call.is_bound()) {
|
| - __ Branch(&needs_frame_not_call);
|
| - } else {
|
| - __ bind(&needs_frame_not_call);
|
| - __ MultiPush(cp.bit() | fp.bit() | ra.bit());
|
| - // This variant of deopt can only be used with stubs. Since we don't
|
| - // have a function pointer to install in the stack frame that we're
|
| - // building, install a special marker there instead.
|
| - ASSERT(info()->IsStub());
|
| - __ li(scratch0(), Operand(Smi::FromInt(StackFrame::STUB)));
|
| - __ push(scratch0());
|
| - __ Addu(fp, sp, Operand(2 * kPointerSize));
|
| - __ Jump(t9);
|
| - }
|
| - }
|
| - } else {
|
| - if (type == Deoptimizer::LAZY) {
|
| + __ bind(&needs_frame);
|
| + __ MultiPush(cp.bit() | fp.bit() | ra.bit());
|
| + // This variant of deopt can only be used with stubs. Since we don't
|
| + // have a function pointer to install in the stack frame that we're
|
| + // building, install a special marker there instead.
|
| + ASSERT(info()->IsStub());
|
| + __ li(scratch0(), Operand(Smi::FromInt(StackFrame::STUB)));
|
| + __ push(scratch0());
|
| + __ Addu(fp, sp, Operand(2 * kPointerSize));
|
| __ Call(t9);
|
| - } else {
|
| - __ Jump(t9);
|
| }
|
| + } else {
|
| + __ Call(t9);
|
| }
|
| }
|
| __ RecordComment("]");
|
| @@ -766,7 +744,8 @@ void LCodeGen::DeoptimizeIf(Condition cc,
|
| if (FLAG_deopt_every_n_times == 1 &&
|
| !info()->IsStub() &&
|
| info()->opt_count() == id) {
|
| - __ Jump(entry, RelocInfo::RUNTIME_ENTRY);
|
| + ASSERT(frame_is_built_);
|
| + __ Call(entry, RelocInfo::RUNTIME_ENTRY);
|
| return;
|
| }
|
|
|
| @@ -780,13 +759,8 @@ void LCodeGen::DeoptimizeIf(Condition cc,
|
| }
|
|
|
| ASSERT(info()->IsStub() || frame_is_built_);
|
| - bool needs_lazy_deopt = info()->IsStub();
|
| if (cc == al && frame_is_built_) {
|
| - if (needs_lazy_deopt) {
|
| - __ Call(entry, RelocInfo::RUNTIME_ENTRY, cc, src1, src2);
|
| - } else {
|
| - __ Jump(entry, RelocInfo::RUNTIME_ENTRY, cc, src1, src2);
|
| - }
|
| + __ Call(entry, RelocInfo::RUNTIME_ENTRY, cc, src1, src2);
|
| } else {
|
| // We often have several deopts to the same entry, reuse the last
|
| // jump entry if this is the case.
|
| @@ -5298,80 +5272,6 @@ void LCodeGen::DoCheckPrototypeMaps(LCheckPrototypeMaps* instr) {
|
| }
|
|
|
|
|
| -void LCodeGen::DoAllocateObject(LAllocateObject* instr) {
|
| - class DeferredAllocateObject: public LDeferredCode {
|
| - public:
|
| - DeferredAllocateObject(LCodeGen* codegen, LAllocateObject* instr)
|
| - : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredAllocateObject(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| - private:
|
| - LAllocateObject* instr_;
|
| - };
|
| -
|
| - DeferredAllocateObject* deferred =
|
| - new(zone()) DeferredAllocateObject(this, instr);
|
| -
|
| - Register result = ToRegister(instr->result());
|
| - Register scratch = ToRegister(instr->temp());
|
| - Register scratch2 = ToRegister(instr->temp2());
|
| - Handle<JSFunction> constructor = instr->hydrogen()->constructor();
|
| - Handle<Map> initial_map = instr->hydrogen()->constructor_initial_map();
|
| - int instance_size = initial_map->instance_size();
|
| - ASSERT(initial_map->pre_allocated_property_fields() +
|
| - initial_map->unused_property_fields() -
|
| - initial_map->inobject_properties() == 0);
|
| -
|
| - __ Allocate(instance_size, result, scratch, scratch2, deferred->entry(),
|
| - TAG_OBJECT);
|
| -
|
| - __ bind(deferred->exit());
|
| - if (FLAG_debug_code) {
|
| - Label is_in_new_space;
|
| - __ JumpIfInNewSpace(result, scratch, &is_in_new_space);
|
| - __ Abort("Allocated object is not in new-space");
|
| - __ bind(&is_in_new_space);
|
| - }
|
| -
|
| - // Load the initial map.
|
| - Register map = scratch;
|
| - __ LoadHeapObject(map, constructor);
|
| - __ lw(map, FieldMemOperand(map, JSFunction::kPrototypeOrInitialMapOffset));
|
| -
|
| - // Initialize map and fields of the newly allocated object.
|
| - ASSERT(initial_map->instance_type() == JS_OBJECT_TYPE);
|
| - __ sw(map, FieldMemOperand(result, JSObject::kMapOffset));
|
| - __ LoadRoot(scratch, Heap::kEmptyFixedArrayRootIndex);
|
| - __ sw(scratch, FieldMemOperand(result, JSObject::kElementsOffset));
|
| - __ sw(scratch, FieldMemOperand(result, JSObject::kPropertiesOffset));
|
| - if (initial_map->inobject_properties() != 0) {
|
| - __ LoadRoot(scratch, Heap::kUndefinedValueRootIndex);
|
| - for (int i = 0; i < initial_map->inobject_properties(); i++) {
|
| - int property_offset = JSObject::kHeaderSize + i * kPointerSize;
|
| - __ sw(scratch, FieldMemOperand(result, property_offset));
|
| - }
|
| - }
|
| -}
|
| -
|
| -
|
| -void LCodeGen::DoDeferredAllocateObject(LAllocateObject* instr) {
|
| - Register result = ToRegister(instr->result());
|
| - Handle<Map> initial_map = instr->hydrogen()->constructor_initial_map();
|
| - int instance_size = initial_map->instance_size();
|
| -
|
| - // TODO(3095996): Get rid of this. For now, we need to make the
|
| - // result register contain a valid pointer because it is already
|
| - // contained in the register pointer map.
|
| - __ mov(result, zero_reg);
|
| -
|
| - PushSafepointRegistersScope scope(this, Safepoint::kWithRegisters);
|
| - __ li(a0, Operand(Smi::FromInt(instance_size)));
|
| - __ push(a0);
|
| - CallRuntimeFromDeferred(Runtime::kAllocateInNewSpace, 1, instr);
|
| - __ StoreToSafepointRegisterSlot(v0, result);
|
| -}
|
| -
|
| -
|
| void LCodeGen::DoAllocate(LAllocate* instr) {
|
| class DeferredAllocate: public LDeferredCode {
|
| public:
|
| @@ -5734,33 +5634,6 @@ void LCodeGen::DoDummyUse(LDummyUse* instr) {
|
| }
|
|
|
|
|
| -void LCodeGen::DoDeleteProperty(LDeleteProperty* instr) {
|
| - Register object = ToRegister(instr->object());
|
| - Register key = ToRegister(instr->key());
|
| - Register strict = scratch0();
|
| - __ li(strict, Operand(Smi::FromInt(strict_mode_flag())));
|
| - __ Push(object, key, strict);
|
| - ASSERT(instr->HasPointerMap());
|
| - LPointerMap* pointers = instr->pointer_map();
|
| - RecordPosition(pointers->position());
|
| - SafepointGenerator safepoint_generator(
|
| - this, pointers, Safepoint::kLazyDeopt);
|
| - __ InvokeBuiltin(Builtins::DELETE, CALL_FUNCTION, safepoint_generator);
|
| -}
|
| -
|
| -
|
| -void LCodeGen::DoIn(LIn* instr) {
|
| - Register obj = ToRegister(instr->object());
|
| - Register key = ToRegister(instr->key());
|
| - __ Push(key, obj);
|
| - ASSERT(instr->HasPointerMap());
|
| - LPointerMap* pointers = instr->pointer_map();
|
| - RecordPosition(pointers->position());
|
| - SafepointGenerator safepoint_generator(this, pointers, Safepoint::kLazyDeopt);
|
| - __ InvokeBuiltin(Builtins::IN, CALL_FUNCTION, safepoint_generator);
|
| -}
|
| -
|
| -
|
| void LCodeGen::DoDeferredStackCheck(LStackCheck* instr) {
|
| PushSafepointRegistersScope scope(this, Safepoint::kWithRegisters);
|
| __ CallRuntimeSaveDoubles(Runtime::kStackGuard);
|
|
|