// Copyright 2012 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "src/v8.h" #if V8_TARGET_ARCH_MIPS64 #include "src/codegen.h" #include "src/ic/ic.h" #include "src/ic/stub-cache.h" #include "src/interface-descriptors.h" namespace v8 { namespace internal { #define __ ACCESS_MASM(masm) static void ProbeTable(Isolate* isolate, MacroAssembler* masm, Code::Kind ic_kind, Code::Flags flags, bool leave_frame, StubCache::Table table, Register receiver, Register name, // Number of the cache entry, not scaled. Register offset, Register scratch, Register scratch2, Register offset_scratch) { ExternalReference key_offset(isolate->stub_cache()->key_reference(table)); ExternalReference value_offset(isolate->stub_cache()->value_reference(table)); ExternalReference map_offset(isolate->stub_cache()->map_reference(table)); uint64_t key_off_addr = reinterpret_cast(key_offset.address()); uint64_t value_off_addr = reinterpret_cast(value_offset.address()); uint64_t map_off_addr = reinterpret_cast(map_offset.address()); // Check the relative positions of the address fields. DCHECK(value_off_addr > key_off_addr); DCHECK((value_off_addr - key_off_addr) % 4 == 0); DCHECK((value_off_addr - key_off_addr) < (256 * 4)); DCHECK(map_off_addr > key_off_addr); DCHECK((map_off_addr - key_off_addr) % 4 == 0); DCHECK((map_off_addr - key_off_addr) < (256 * 4)); Label miss; Register base_addr = scratch; scratch = no_reg; // Multiply by 3 because there are 3 fields per entry (name, code, map). __ dsll(offset_scratch, offset, 1); __ Daddu(offset_scratch, offset_scratch, offset); // Calculate the base address of the entry. __ li(base_addr, Operand(key_offset)); __ dsll(at, offset_scratch, kPointerSizeLog2); __ Daddu(base_addr, base_addr, at); // Check that the key in the entry matches the name. __ ld(at, MemOperand(base_addr, 0)); __ Branch(&miss, ne, name, Operand(at)); // Check the map matches. __ ld(at, MemOperand(base_addr, static_cast(map_off_addr - key_off_addr))); __ ld(scratch2, FieldMemOperand(receiver, HeapObject::kMapOffset)); __ Branch(&miss, ne, at, Operand(scratch2)); // Get the code entry from the cache. Register code = scratch2; scratch2 = no_reg; __ ld(code, MemOperand(base_addr, static_cast(value_off_addr - key_off_addr))); // Check that the flags match what we're looking for. Register flags_reg = base_addr; base_addr = no_reg; __ lw(flags_reg, FieldMemOperand(code, Code::kFlagsOffset)); __ And(flags_reg, flags_reg, Operand(~Code::kFlagsNotUsedInLookup)); __ Branch(&miss, ne, flags_reg, Operand(flags)); #ifdef DEBUG if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { __ jmp(&miss); } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { __ jmp(&miss); } #endif if (leave_frame) __ LeaveFrame(StackFrame::INTERNAL); // Jump to the first instruction in the code stub. __ Daddu(at, code, Operand(Code::kHeaderSize - kHeapObjectTag)); __ Jump(at); // Miss: fall through. __ bind(&miss); } void StubCache::GenerateProbe(MacroAssembler* masm, Code::Kind ic_kind, Code::Flags flags, bool leave_frame, Register receiver, Register name, Register scratch, Register extra, Register extra2, Register extra3) { Isolate* isolate = masm->isolate(); Label miss; // Make sure that code is valid. The multiplying code relies on the // entry size being 12. // DCHECK(sizeof(Entry) == 12); // DCHECK(sizeof(Entry) == 3 * kPointerSize); // Make sure the flags does not name a specific type. DCHECK(Code::ExtractTypeFromFlags(flags) == 0); // Make sure that there are no register conflicts. DCHECK(!AreAliased(receiver, name, scratch, extra, extra2, extra3)); // Check register validity. DCHECK(!scratch.is(no_reg)); DCHECK(!extra.is(no_reg)); DCHECK(!extra2.is(no_reg)); DCHECK(!extra3.is(no_reg)); #ifdef DEBUG // If vector-based ics are in use, ensure that scratch, extra, extra2 and // extra3 don't conflict with the vector and slot registers, which need // to be preserved for a handler call or miss. if (IC::ICUseVector(ic_kind)) { Register vector = LoadWithVectorDescriptor::VectorRegister(); Register slot = LoadWithVectorDescriptor::SlotRegister(); DCHECK(!AreAliased(vector, slot, scratch, extra, extra2, extra3)); } #endif Counters* counters = masm->isolate()->counters(); __ IncrementCounter(counters->megamorphic_stub_cache_probes(), 1, extra2, extra3); // Check that the receiver isn't a smi. __ JumpIfSmi(receiver, &miss); // Get the map of the receiver and compute the hash. __ ld(scratch, FieldMemOperand(name, Name::kHashFieldOffset)); __ ld(at, FieldMemOperand(receiver, HeapObject::kMapOffset)); __ Daddu(scratch, scratch, at); uint64_t mask = kPrimaryTableSize - 1; // We shift out the last two bits because they are not part of the hash and // they are always 01 for maps. __ dsrl(scratch, scratch, kCacheIndexShift); __ Xor(scratch, scratch, Operand((flags >> kCacheIndexShift) & mask)); __ And(scratch, scratch, Operand(mask)); // Probe the primary table. ProbeTable(isolate, masm, ic_kind, flags, leave_frame, kPrimary, receiver, name, scratch, extra, extra2, extra3); // Primary miss: Compute hash for secondary probe. __ dsrl(at, name, kCacheIndexShift); __ Dsubu(scratch, scratch, at); uint64_t mask2 = kSecondaryTableSize - 1; __ Daddu(scratch, scratch, Operand((flags >> kCacheIndexShift) & mask2)); __ And(scratch, scratch, Operand(mask2)); // Probe the secondary table. ProbeTable(isolate, masm, ic_kind, flags, leave_frame, kSecondary, receiver, name, scratch, extra, extra2, extra3); // Cache miss: Fall-through and let caller handle the miss by // entering the runtime system. __ bind(&miss); __ IncrementCounter(counters->megamorphic_stub_cache_misses(), 1, extra2, extra3); } #undef __ } // namespace internal } // namespace v8 #endif // V8_TARGET_ARCH_MIPS64