| Index: src/ic/mips64/ic-mips64.cc
|
| diff --git a/src/ic/mips64/ic-mips64.cc b/src/ic/mips64/ic-mips64.cc
|
| index 57efa350c85b6a277692766f3a5887e41f156993..41f90f2b7492a8b5753862ac33e8421153f79eda 100644
|
| --- a/src/ic/mips64/ic-mips64.cc
|
| +++ b/src/ic/mips64/ic-mips64.cc
|
| @@ -198,279 +198,6 @@ void KeyedLoadIC::GenerateRuntimeGetProperty(MacroAssembler* masm) {
|
| __ TailCallRuntime(Runtime::kKeyedGetProperty);
|
| }
|
|
|
| -static void KeyedStoreGenerateMegamorphicHelper(
|
| - MacroAssembler* masm, Label* fast_object, Label* fast_double, Label* slow,
|
| - KeyedStoreCheckMap check_map, KeyedStoreIncrementLength increment_length,
|
| - Register value, Register key, Register receiver, Register receiver_map,
|
| - Register elements_map, Register elements) {
|
| - Label transition_smi_elements;
|
| - Label finish_object_store, non_double_value, transition_double_elements;
|
| - Label fast_double_without_map_check;
|
| -
|
| - // Fast case: Do the store, could be either Object or double.
|
| - __ bind(fast_object);
|
| - Register scratch = a4;
|
| - Register scratch2 = t0;
|
| - Register address = a5;
|
| - DCHECK(!AreAliased(value, key, receiver, receiver_map, elements_map, elements,
|
| - scratch, scratch2, address));
|
| -
|
| - if (check_map == kCheckMap) {
|
| - __ ld(elements_map, FieldMemOperand(elements, HeapObject::kMapOffset));
|
| - __ Branch(fast_double, ne, elements_map,
|
| - Operand(masm->isolate()->factory()->fixed_array_map()));
|
| - }
|
| -
|
| - // HOLECHECK: guards "A[i] = V"
|
| - // We have to go to the runtime if the current value is the hole because
|
| - // there may be a callback on the element.
|
| - Label holecheck_passed1;
|
| - __ Daddu(address, elements, FixedArray::kHeaderSize - kHeapObjectTag);
|
| - __ SmiScale(at, key, kPointerSizeLog2);
|
| - __ daddu(address, address, at);
|
| - __ ld(scratch, MemOperand(address));
|
| -
|
| - __ Branch(&holecheck_passed1, ne, scratch,
|
| - Operand(masm->isolate()->factory()->the_hole_value()));
|
| - __ JumpIfDictionaryInPrototypeChain(receiver, elements_map, scratch, slow);
|
| -
|
| - __ bind(&holecheck_passed1);
|
| -
|
| - // Smi stores don't require further checks.
|
| - Label non_smi_value;
|
| - __ JumpIfNotSmi(value, &non_smi_value);
|
| -
|
| - if (increment_length == kIncrementLength) {
|
| - // Add 1 to receiver->length.
|
| - __ Daddu(scratch, key, Operand(Smi::FromInt(1)));
|
| - __ sd(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - }
|
| - // It's irrelevant whether array is smi-only or not when writing a smi.
|
| - __ Daddu(address, elements,
|
| - Operand(FixedArray::kHeaderSize - kHeapObjectTag));
|
| - __ SmiScale(scratch, key, kPointerSizeLog2);
|
| - __ Daddu(address, address, scratch);
|
| - __ sd(value, MemOperand(address));
|
| - __ Ret(USE_DELAY_SLOT);
|
| - __ Move(v0, value); // Ensure the stub returns correct value.
|
| -
|
| - __ bind(&non_smi_value);
|
| - // Escape to elements kind transition case.
|
| - __ CheckFastObjectElements(receiver_map, scratch, &transition_smi_elements);
|
| -
|
| - // Fast elements array, store the value to the elements backing store.
|
| - __ bind(&finish_object_store);
|
| - if (increment_length == kIncrementLength) {
|
| - // Add 1 to receiver->length.
|
| - __ Daddu(scratch, key, Operand(Smi::FromInt(1)));
|
| - __ sd(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - }
|
| - __ Daddu(address, elements,
|
| - Operand(FixedArray::kHeaderSize - kHeapObjectTag));
|
| - __ SmiScale(scratch, key, kPointerSizeLog2);
|
| - __ Daddu(address, address, scratch);
|
| - __ sd(value, MemOperand(address));
|
| - // Update write barrier for the elements array address.
|
| - __ mov(scratch, value); // Preserve the value which is returned.
|
| - __ RecordWrite(elements, address, scratch, kRAHasNotBeenSaved,
|
| - kDontSaveFPRegs, EMIT_REMEMBERED_SET, OMIT_SMI_CHECK);
|
| - __ Ret(USE_DELAY_SLOT);
|
| - __ Move(v0, value); // Ensure the stub returns correct value.
|
| -
|
| - __ bind(fast_double);
|
| - if (check_map == kCheckMap) {
|
| - // Check for fast double array case. If this fails, call through to the
|
| - // runtime.
|
| - __ LoadRoot(at, Heap::kFixedDoubleArrayMapRootIndex);
|
| - __ Branch(slow, ne, elements_map, Operand(at));
|
| - }
|
| -
|
| - // HOLECHECK: guards "A[i] double hole?"
|
| - // We have to see if the double version of the hole is present. If so
|
| - // go to the runtime.
|
| - __ Daddu(address, elements,
|
| - Operand(FixedDoubleArray::kHeaderSize + Register::kExponentOffset -
|
| - kHeapObjectTag));
|
| - __ SmiScale(at, key, kPointerSizeLog2);
|
| - __ daddu(address, address, at);
|
| - __ lw(scratch, MemOperand(address));
|
| - __ Branch(&fast_double_without_map_check, ne, scratch,
|
| - Operand(static_cast<int32_t>(kHoleNanUpper32)));
|
| - __ JumpIfDictionaryInPrototypeChain(receiver, elements_map, scratch, slow);
|
| -
|
| - __ bind(&fast_double_without_map_check);
|
| - __ StoreNumberToDoubleElements(value, key, elements, scratch, scratch2,
|
| - &transition_double_elements);
|
| - if (increment_length == kIncrementLength) {
|
| - // Add 1 to receiver->length.
|
| - __ Daddu(scratch, key, Operand(Smi::FromInt(1)));
|
| - __ sd(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - }
|
| - __ Ret(USE_DELAY_SLOT);
|
| - __ Move(v0, value); // Ensure the stub returns correct value.
|
| -
|
| - __ bind(&transition_smi_elements);
|
| - // Transition the array appropriately depending on the value type.
|
| - __ ld(scratch, FieldMemOperand(value, HeapObject::kMapOffset));
|
| - __ LoadRoot(at, Heap::kHeapNumberMapRootIndex);
|
| - __ Branch(&non_double_value, ne, scratch, Operand(at));
|
| -
|
| - // Value is a double. Transition FAST_SMI_ELEMENTS ->
|
| - // FAST_DOUBLE_ELEMENTS and complete the store.
|
| - __ LoadTransitionedArrayMapConditional(
|
| - FAST_SMI_ELEMENTS, FAST_DOUBLE_ELEMENTS, receiver_map, scratch, slow);
|
| - AllocationSiteMode mode =
|
| - AllocationSite::GetMode(FAST_SMI_ELEMENTS, FAST_DOUBLE_ELEMENTS);
|
| - ElementsTransitionGenerator::GenerateSmiToDouble(masm, receiver, key, value,
|
| - receiver_map, mode, slow);
|
| - __ ld(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
|
| - __ jmp(&fast_double_without_map_check);
|
| -
|
| - __ bind(&non_double_value);
|
| - // Value is not a double, FAST_SMI_ELEMENTS -> FAST_ELEMENTS
|
| - __ LoadTransitionedArrayMapConditional(FAST_SMI_ELEMENTS, FAST_ELEMENTS,
|
| - receiver_map, scratch, slow);
|
| - mode = AllocationSite::GetMode(FAST_SMI_ELEMENTS, FAST_ELEMENTS);
|
| - ElementsTransitionGenerator::GenerateMapChangeElementsTransition(
|
| - masm, receiver, key, value, receiver_map, mode, slow);
|
| - __ ld(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
|
| - __ jmp(&finish_object_store);
|
| -
|
| - __ bind(&transition_double_elements);
|
| - // Elements are FAST_DOUBLE_ELEMENTS, but value is an Object that's not a
|
| - // HeapNumber. Make sure that the receiver is a Array with FAST_ELEMENTS and
|
| - // transition array from FAST_DOUBLE_ELEMENTS to FAST_ELEMENTS
|
| - __ LoadTransitionedArrayMapConditional(FAST_DOUBLE_ELEMENTS, FAST_ELEMENTS,
|
| - receiver_map, scratch, slow);
|
| - mode = AllocationSite::GetMode(FAST_DOUBLE_ELEMENTS, FAST_ELEMENTS);
|
| - ElementsTransitionGenerator::GenerateDoubleToObject(
|
| - masm, receiver, key, value, receiver_map, mode, slow);
|
| - __ ld(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
|
| - __ jmp(&finish_object_store);
|
| -}
|
| -
|
| -
|
| -void KeyedStoreIC::GenerateMegamorphic(MacroAssembler* masm,
|
| - LanguageMode language_mode) {
|
| - // ---------- S t a t e --------------
|
| - // -- a0 : value
|
| - // -- a1 : key
|
| - // -- a2 : receiver
|
| - // -- ra : return address
|
| - // -----------------------------------
|
| - Label slow, fast_object, fast_object_grow;
|
| - Label fast_double, fast_double_grow;
|
| - Label array, extra, check_if_double_array, maybe_name_key, miss;
|
| -
|
| - // Register usage.
|
| - Register value = StoreDescriptor::ValueRegister();
|
| - Register key = StoreDescriptor::NameRegister();
|
| - Register receiver = StoreDescriptor::ReceiverRegister();
|
| - DCHECK(value.is(a0));
|
| - Register receiver_map = a3;
|
| - Register elements_map = a6;
|
| - Register elements = a7; // Elements array of the receiver.
|
| - // a4 and a5 are used as general scratch registers.
|
| -
|
| - // Check that the key is a smi.
|
| - __ JumpIfNotSmi(key, &maybe_name_key);
|
| - // Check that the object isn't a smi.
|
| - __ JumpIfSmi(receiver, &slow);
|
| - // Get the map of the object.
|
| - __ ld(receiver_map, FieldMemOperand(receiver, HeapObject::kMapOffset));
|
| - // Check that the receiver does not require access checks.
|
| - // The generic stub does not perform map checks.
|
| - __ lbu(a4, FieldMemOperand(receiver_map, Map::kBitFieldOffset));
|
| - __ And(a4, a4, Operand(1 << Map::kIsAccessCheckNeeded));
|
| - __ Branch(&slow, ne, a4, Operand(zero_reg));
|
| - // Check if the object is a JS array or not.
|
| - __ lbu(a4, FieldMemOperand(receiver_map, Map::kInstanceTypeOffset));
|
| - __ Branch(&array, eq, a4, Operand(JS_ARRAY_TYPE));
|
| - // Check that the object is some kind of JSObject.
|
| - __ Branch(&slow, lt, a4, Operand(FIRST_JS_OBJECT_TYPE));
|
| -
|
| - // Object case: Check key against length in the elements array.
|
| - __ ld(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
|
| - // Check array bounds. Both the key and the length of FixedArray are smis.
|
| - __ ld(a4, FieldMemOperand(elements, FixedArray::kLengthOffset));
|
| - __ Branch(&fast_object, lo, key, Operand(a4));
|
| -
|
| - // Slow case, handle jump to runtime.
|
| - __ bind(&slow);
|
| - // Entry registers are intact.
|
| - // a0: value.
|
| - // a1: key.
|
| - // a2: receiver.
|
| - PropertyICCompiler::GenerateRuntimeSetProperty(masm, language_mode);
|
| - // Never returns to here.
|
| -
|
| - __ bind(&maybe_name_key);
|
| - __ ld(a4, FieldMemOperand(key, HeapObject::kMapOffset));
|
| - __ lb(a4, FieldMemOperand(a4, Map::kInstanceTypeOffset));
|
| - __ JumpIfNotUniqueNameInstanceType(a4, &slow);
|
| -
|
| - // The handlers in the stub cache expect a vector and slot. Since we won't
|
| - // change the IC from any downstream misses, a dummy vector can be used.
|
| - Register vector = StoreWithVectorDescriptor::VectorRegister();
|
| - Register slot = StoreWithVectorDescriptor::SlotRegister();
|
| -
|
| - DCHECK(!AreAliased(vector, slot, a5, a6, a7, t0));
|
| - Handle<TypeFeedbackVector> dummy_vector =
|
| - TypeFeedbackVector::DummyVector(masm->isolate());
|
| - int slot_index = dummy_vector->GetIndex(
|
| - FeedbackVectorSlot(TypeFeedbackVector::kDummyKeyedStoreICSlot));
|
| - __ LoadRoot(vector, Heap::kDummyVectorRootIndex);
|
| - __ li(slot, Operand(Smi::FromInt(slot_index)));
|
| -
|
| - masm->isolate()->store_stub_cache()->GenerateProbe(masm, receiver, key, a5,
|
| - a6, a7, t0);
|
| - // Cache miss.
|
| - __ Branch(&miss);
|
| -
|
| - // Extra capacity case: Check if there is extra capacity to
|
| - // perform the store and update the length. Used for adding one
|
| - // element to the array by writing to array[array.length].
|
| - __ bind(&extra);
|
| - // Condition code from comparing key and array length is still available.
|
| - // Only support writing to array[array.length].
|
| - __ Branch(&slow, ne, key, Operand(a4));
|
| - // Check for room in the elements backing store.
|
| - // Both the key and the length of FixedArray are smis.
|
| - __ ld(a4, FieldMemOperand(elements, FixedArray::kLengthOffset));
|
| - __ Branch(&slow, hs, key, Operand(a4));
|
| - __ ld(elements_map, FieldMemOperand(elements, HeapObject::kMapOffset));
|
| - __ Branch(&check_if_double_array, ne, elements_map,
|
| - Heap::kFixedArrayMapRootIndex);
|
| -
|
| - __ jmp(&fast_object_grow);
|
| -
|
| - __ bind(&check_if_double_array);
|
| - __ Branch(&slow, ne, elements_map, Heap::kFixedDoubleArrayMapRootIndex);
|
| - __ jmp(&fast_double_grow);
|
| -
|
| - // Array case: Get the length and the elements array from the JS
|
| - // array. Check that the array is in fast mode (and writable); if it
|
| - // is the length is always a smi.
|
| - __ bind(&array);
|
| - __ ld(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
|
| -
|
| - // Check the key against the length in the array.
|
| - __ ld(a4, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - __ Branch(&extra, hs, key, Operand(a4));
|
| -
|
| - KeyedStoreGenerateMegamorphicHelper(
|
| - masm, &fast_object, &fast_double, &slow, kCheckMap, kDontIncrementLength,
|
| - value, key, receiver, receiver_map, elements_map, elements);
|
| - KeyedStoreGenerateMegamorphicHelper(masm, &fast_object_grow,
|
| - &fast_double_grow, &slow, kDontCheckMap,
|
| - kIncrementLength, value, key, receiver,
|
| - receiver_map, elements_map, elements);
|
| -
|
| - __ bind(&miss);
|
| - GenerateMiss(masm);
|
| -}
|
| -
|
| -
|
| static void StoreIC_PushArgs(MacroAssembler* masm) {
|
| __ Push(StoreWithVectorDescriptor::ValueRegister(),
|
| StoreWithVectorDescriptor::SlotRegister(),
|
|
|