Index: src/ic/mips64/handler-compiler-mips64.cc |
diff --git a/src/ic/mips64/handler-compiler-mips64.cc b/src/ic/mips64/handler-compiler-mips64.cc |
index b7759142965656730cb914f3005b7cc406659eac..8251b2ab9eac03910ac72ad956ba0158cee43d58 100644 |
--- a/src/ic/mips64/handler-compiler-mips64.cc |
+++ b/src/ic/mips64/handler-compiler-mips64.cc |
@@ -321,185 +321,42 @@ void NamedStoreHandlerCompiler::GenerateRestoreName(Label* label, |
} |
-// Generate StoreTransition code, value is passed in a0 register. |
-// After executing generated code, the receiver_reg and name_reg |
-// may be clobbered. |
-void NamedStoreHandlerCompiler::GenerateStoreTransition( |
- Handle<Map> transition, Handle<Name> name, Register receiver_reg, |
- Register storage_reg, Register value_reg, Register scratch1, |
- Register scratch2, Register scratch3, Label* miss_label, Label* slow) { |
- // a0 : value. |
- Label exit; |
- |
- int descriptor = transition->LastAdded(); |
- DescriptorArray* descriptors = transition->instance_descriptors(); |
- PropertyDetails details = descriptors->GetDetails(descriptor); |
- Representation representation = details.representation(); |
- DCHECK(!representation.IsNone()); |
- |
- if (details.type() == CONSTANT) { |
- Handle<Object> constant(descriptors->GetValue(descriptor), isolate()); |
- __ li(scratch1, constant); |
- __ Branch(miss_label, ne, value_reg, Operand(scratch1)); |
- } else if (representation.IsSmi()) { |
- __ JumpIfNotSmi(value_reg, miss_label); |
- } else if (representation.IsHeapObject()) { |
- __ JumpIfSmi(value_reg, miss_label); |
- HeapType* field_type = descriptors->GetFieldType(descriptor); |
- HeapType::Iterator<Map> it = field_type->Classes(); |
- Handle<Map> current; |
- if (!it.Done()) { |
- __ ld(scratch1, FieldMemOperand(value_reg, HeapObject::kMapOffset)); |
- Label do_store; |
- while (true) { |
- // Do the CompareMap() directly within the Branch() functions. |
- current = it.Current(); |
- it.Advance(); |
- if (it.Done()) { |
- __ Branch(miss_label, ne, scratch1, Operand(current)); |
- break; |
- } |
- __ Branch(&do_store, eq, scratch1, Operand(current)); |
- } |
- __ bind(&do_store); |
- } |
- } else if (representation.IsDouble()) { |
- Label do_store, heap_number; |
- __ LoadRoot(scratch3, Heap::kMutableHeapNumberMapRootIndex); |
- __ AllocateHeapNumber(storage_reg, scratch1, scratch2, scratch3, slow, |
- TAG_RESULT, MUTABLE); |
- |
- __ JumpIfNotSmi(value_reg, &heap_number); |
- __ SmiUntag(scratch1, value_reg); |
- __ mtc1(scratch1, f6); |
- __ cvt_d_w(f4, f6); |
- __ jmp(&do_store); |
- |
- __ bind(&heap_number); |
- __ CheckMap(value_reg, scratch1, Heap::kHeapNumberMapRootIndex, miss_label, |
- DONT_DO_SMI_CHECK); |
- __ ldc1(f4, FieldMemOperand(value_reg, HeapNumber::kValueOffset)); |
- |
- __ bind(&do_store); |
- __ sdc1(f4, FieldMemOperand(storage_reg, HeapNumber::kValueOffset)); |
- } |
- |
- // Stub never generated for objects that require access checks. |
- DCHECK(!transition->is_access_check_needed()); |
- |
- // Perform map transition for the receiver if necessary. |
- if (details.type() == FIELD && |
- Map::cast(transition->GetBackPointer())->unused_property_fields() == 0) { |
- // The properties must be extended before we can store the value. |
- __ li(ExtendStorageDescriptor::NameRegister(), Operand(name)); |
- __ li(ExtendStorageDescriptor::MapRegister(), Operand(transition)); |
- |
- ExtendStorageStub stub(isolate(), |
- FieldIndex::ForDescriptor(*transition, descriptor), |
- representation); |
- GenerateTailCall(masm(), stub.GetCode()); |
- return; |
- } |
- |
- // Update the map of the object. |
- __ li(scratch1, Operand(transition)); |
- __ sd(scratch1, FieldMemOperand(receiver_reg, HeapObject::kMapOffset)); |
- |
- // Update the write barrier for the map field. |
- __ RecordWriteField(receiver_reg, HeapObject::kMapOffset, scratch1, scratch2, |
- kRAHasNotBeenSaved, kDontSaveFPRegs, OMIT_REMEMBERED_SET, |
- OMIT_SMI_CHECK); |
- |
- if (details.type() == CONSTANT) { |
- DCHECK(value_reg.is(a0)); |
- __ Ret(USE_DELAY_SLOT); |
- __ mov(v0, a0); |
- return; |
- } |
- |
- int index = transition->instance_descriptors()->GetFieldIndex( |
- transition->LastAdded()); |
- |
- // Adjust for the number of properties stored in the object. Even in the |
- // face of a transition we can use the old map here because the size of the |
- // object and the number of in-object properties is not going to change. |
- index -= transition->inobject_properties(); |
- |
- // TODO(verwaest): Share this code as a code stub. |
- SmiCheck smi_check = |
- representation.IsTagged() ? INLINE_SMI_CHECK : OMIT_SMI_CHECK; |
- if (index < 0) { |
- // Set the property straight into the object. |
- int offset = transition->instance_size() + (index * kPointerSize); |
- if (representation.IsDouble()) { |
- __ sd(storage_reg, FieldMemOperand(receiver_reg, offset)); |
- } else { |
- __ sd(value_reg, FieldMemOperand(receiver_reg, offset)); |
- } |
- |
- if (!representation.IsSmi()) { |
- // Update the write barrier for the array address. |
- if (!representation.IsDouble()) { |
- __ mov(storage_reg, value_reg); |
- } |
- __ RecordWriteField(receiver_reg, offset, storage_reg, scratch1, |
- kRAHasNotBeenSaved, kDontSaveFPRegs, |
- EMIT_REMEMBERED_SET, smi_check); |
- } |
- } else { |
- // Write to the properties array. |
- int offset = index * kPointerSize + FixedArray::kHeaderSize; |
- // Get the properties array |
- __ ld(scratch1, FieldMemOperand(receiver_reg, JSObject::kPropertiesOffset)); |
- if (representation.IsDouble()) { |
- __ sd(storage_reg, FieldMemOperand(scratch1, offset)); |
- } else { |
- __ sd(value_reg, FieldMemOperand(scratch1, offset)); |
- } |
+void NamedStoreHandlerCompiler::GenerateRestoreNameAndMap( |
+ Handle<Name> name, Handle<Map> transition) { |
+ __ li(this->name(), Operand(name)); |
+ __ li(StoreTransitionDescriptor::MapRegister(), Operand(transition)); |
+} |
- if (!representation.IsSmi()) { |
- // Update the write barrier for the array address. |
- if (!representation.IsDouble()) { |
- __ mov(storage_reg, value_reg); |
- } |
- __ RecordWriteField(scratch1, offset, storage_reg, receiver_reg, |
- kRAHasNotBeenSaved, kDontSaveFPRegs, |
- EMIT_REMEMBERED_SET, smi_check); |
- } |
- } |
- // Return the value (register v0). |
- DCHECK(value_reg.is(a0)); |
- __ bind(&exit); |
- __ Ret(USE_DELAY_SLOT); |
- __ mov(v0, a0); |
+void NamedStoreHandlerCompiler::GenerateConstantCheck(Object* constant, |
+ Register value_reg, |
+ Label* miss_label) { |
+ __ li(scratch1(), handle(constant, isolate())); |
+ __ Branch(miss_label, ne, value_reg, Operand(scratch1())); |
} |
-void NamedStoreHandlerCompiler::GenerateStoreField(LookupIterator* lookup, |
- Register value_reg, |
- Label* miss_label) { |
- DCHECK(lookup->representation().IsHeapObject()); |
+void NamedStoreHandlerCompiler::GenerateFieldTypeChecks(HeapType* field_type, |
+ Register value_reg, |
+ Label* miss_label) { |
__ JumpIfSmi(value_reg, miss_label); |
- HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); |
- __ ld(scratch1(), FieldMemOperand(value_reg, HeapObject::kMapOffset)); |
- Label do_store; |
- Handle<Map> current; |
- while (true) { |
- // Do the CompareMap() directly within the Branch() functions. |
- current = it.Current(); |
- it.Advance(); |
- if (it.Done()) { |
- __ Branch(miss_label, ne, scratch1(), Operand(current)); |
- break; |
+ HeapType::Iterator<Map> it = field_type->Classes(); |
+ if (!it.Done()) { |
+ __ ld(scratch1(), FieldMemOperand(value_reg, HeapObject::kMapOffset)); |
+ Label do_store; |
+ Handle<Map> current; |
+ while (true) { |
+ // Do the CompareMap() directly within the Branch() functions. |
+ current = it.Current(); |
+ it.Advance(); |
+ if (it.Done()) { |
+ __ Branch(miss_label, ne, scratch1(), Operand(current)); |
+ break; |
+ } |
+ __ Branch(&do_store, eq, scratch1(), Operand(current)); |
} |
- __ Branch(&do_store, eq, scratch1(), Operand(current)); |
+ __ bind(&do_store); |
} |
- __ bind(&do_store); |
- |
- StoreFieldStub stub(isolate(), lookup->GetFieldIndex(), |
- lookup->representation()); |
- GenerateTailCall(masm(), stub.GetCode()); |
} |