Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1 | // Copyright 2014 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. |
| 4 | |
| 5 | #include "src/v8.h" |
| 6 | |
| 7 | #if V8_TARGET_ARCH_PPC |
| 8 | |
| 9 | #include "src/codegen.h" |
| 10 | #include "src/ic/stub-cache.h" |
| 11 | |
| 12 | namespace v8 { |
| 13 | namespace internal { |
| 14 | |
| 15 | #define __ ACCESS_MASM(masm) |
| 16 | |
| 17 | |
| 18 | static void ProbeTable(Isolate* isolate, MacroAssembler* masm, |
| 19 | Code::Flags flags, bool leave_frame, |
| 20 | StubCache::Table table, Register receiver, Register name, |
| 21 | // Number of the cache entry, not scaled. |
| 22 | Register offset, Register scratch, Register scratch2, |
| 23 | Register offset_scratch) { |
| 24 | ExternalReference key_offset(isolate->stub_cache()->key_reference(table)); |
| 25 | ExternalReference value_offset(isolate->stub_cache()->value_reference(table)); |
| 26 | ExternalReference map_offset(isolate->stub_cache()->map_reference(table)); |
| 27 | |
| 28 | uintptr_t key_off_addr = reinterpret_cast<uintptr_t>(key_offset.address()); |
| 29 | uintptr_t value_off_addr = |
| 30 | reinterpret_cast<uintptr_t>(value_offset.address()); |
| 31 | uintptr_t map_off_addr = reinterpret_cast<uintptr_t>(map_offset.address()); |
| 32 | |
| 33 | // Check the relative positions of the address fields. |
| 34 | DCHECK(value_off_addr > key_off_addr); |
| 35 | DCHECK((value_off_addr - key_off_addr) % 4 == 0); |
| 36 | DCHECK((value_off_addr - key_off_addr) < (256 * 4)); |
| 37 | DCHECK(map_off_addr > key_off_addr); |
| 38 | DCHECK((map_off_addr - key_off_addr) % 4 == 0); |
| 39 | DCHECK((map_off_addr - key_off_addr) < (256 * 4)); |
| 40 | |
| 41 | Label miss; |
| 42 | Register base_addr = scratch; |
| 43 | scratch = no_reg; |
| 44 | |
| 45 | // Multiply by 3 because there are 3 fields per entry (name, code, map). |
| 46 | __ ShiftLeftImm(offset_scratch, offset, Operand(1)); |
| 47 | __ add(offset_scratch, offset, offset_scratch); |
| 48 | |
| 49 | // Calculate the base address of the entry. |
| 50 | __ mov(base_addr, Operand(key_offset)); |
| 51 | __ ShiftLeftImm(scratch2, offset_scratch, Operand(kPointerSizeLog2)); |
| 52 | __ add(base_addr, base_addr, scratch2); |
| 53 | |
| 54 | // Check that the key in the entry matches the name. |
| 55 | __ LoadP(ip, MemOperand(base_addr, 0)); |
| 56 | __ cmp(name, ip); |
| 57 | __ bne(&miss); |
| 58 | |
| 59 | // Check the map matches. |
| 60 | __ LoadP(ip, MemOperand(base_addr, map_off_addr - key_off_addr)); |
| 61 | __ LoadP(scratch2, FieldMemOperand(receiver, HeapObject::kMapOffset)); |
| 62 | __ cmp(ip, scratch2); |
| 63 | __ bne(&miss); |
| 64 | |
| 65 | // Get the code entry from the cache. |
| 66 | Register code = scratch2; |
| 67 | scratch2 = no_reg; |
| 68 | __ LoadP(code, MemOperand(base_addr, value_off_addr - key_off_addr)); |
| 69 | |
| 70 | // Check that the flags match what we're looking for. |
| 71 | Register flags_reg = base_addr; |
| 72 | base_addr = no_reg; |
| 73 | __ lwz(flags_reg, FieldMemOperand(code, Code::kFlagsOffset)); |
| 74 | |
| 75 | DCHECK(!r0.is(flags_reg)); |
| 76 | __ li(r0, Operand(Code::kFlagsNotUsedInLookup)); |
| 77 | __ andc(flags_reg, flags_reg, r0); |
| 78 | __ mov(r0, Operand(flags)); |
| 79 | __ cmpl(flags_reg, r0); |
| 80 | __ bne(&miss); |
| 81 | |
| 82 | #ifdef DEBUG |
| 83 | if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { |
| 84 | __ b(&miss); |
| 85 | } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { |
| 86 | __ b(&miss); |
| 87 | } |
| 88 | #endif |
| 89 | |
| 90 | if (leave_frame) __ LeaveFrame(StackFrame::INTERNAL); |
| 91 | |
| 92 | // Jump to the first instruction in the code stub. |
| 93 | __ addi(r0, code, Operand(Code::kHeaderSize - kHeapObjectTag)); |
| 94 | __ mtctr(r0); |
| 95 | __ bctr(); |
| 96 | |
| 97 | // Miss: fall through. |
| 98 | __ bind(&miss); |
| 99 | } |
| 100 | |
| 101 | |
| 102 | void StubCache::GenerateProbe(MacroAssembler* masm, Code::Flags flags, |
| 103 | bool leave_frame, Register receiver, |
| 104 | Register name, Register scratch, Register extra, |
| 105 | Register extra2, Register extra3) { |
| 106 | Isolate* isolate = masm->isolate(); |
| 107 | Label miss; |
| 108 | |
| 109 | #if V8_TARGET_ARCH_PPC64 |
| 110 | // Make sure that code is valid. The multiplying code relies on the |
| 111 | // entry size being 24. |
| 112 | DCHECK(sizeof(Entry) == 24); |
| 113 | #else |
| 114 | // Make sure that code is valid. The multiplying code relies on the |
| 115 | // entry size being 12. |
| 116 | DCHECK(sizeof(Entry) == 12); |
| 117 | #endif |
| 118 | |
| 119 | // Make sure the flags does not name a specific type. |
| 120 | DCHECK(Code::ExtractTypeFromFlags(flags) == 0); |
| 121 | |
| 122 | // Make sure that there are no register conflicts. |
| 123 | DCHECK(!scratch.is(receiver)); |
| 124 | DCHECK(!scratch.is(name)); |
| 125 | DCHECK(!extra.is(receiver)); |
| 126 | DCHECK(!extra.is(name)); |
| 127 | DCHECK(!extra.is(scratch)); |
| 128 | DCHECK(!extra2.is(receiver)); |
| 129 | DCHECK(!extra2.is(name)); |
| 130 | DCHECK(!extra2.is(scratch)); |
| 131 | DCHECK(!extra2.is(extra)); |
| 132 | |
| 133 | // Check scratch, extra and extra2 registers are valid. |
| 134 | DCHECK(!scratch.is(no_reg)); |
| 135 | DCHECK(!extra.is(no_reg)); |
| 136 | DCHECK(!extra2.is(no_reg)); |
| 137 | DCHECK(!extra3.is(no_reg)); |
| 138 | |
| 139 | Counters* counters = masm->isolate()->counters(); |
| 140 | __ IncrementCounter(counters->megamorphic_stub_cache_probes(), 1, extra2, |
| 141 | extra3); |
| 142 | |
| 143 | // Check that the receiver isn't a smi. |
| 144 | __ JumpIfSmi(receiver, &miss); |
| 145 | |
| 146 | // Get the map of the receiver and compute the hash. |
| 147 | __ lwz(scratch, FieldMemOperand(name, Name::kHashFieldOffset)); |
| 148 | __ LoadP(ip, FieldMemOperand(receiver, HeapObject::kMapOffset)); |
| 149 | __ add(scratch, scratch, ip); |
| 150 | #if V8_TARGET_ARCH_PPC64 |
| 151 | // Use only the low 32 bits of the map pointer. |
| 152 | __ rldicl(scratch, scratch, 0, 32); |
| 153 | #endif |
| 154 | uint32_t mask = kPrimaryTableSize - 1; |
| 155 | // We shift out the last two bits because they are not part of the hash and |
| 156 | // they are always 01 for maps. |
| 157 | __ ShiftRightImm(scratch, scratch, Operand(kCacheIndexShift)); |
| 158 | // Mask down the eor argument to the minimum to keep the immediate |
| 159 | // encodable. |
| 160 | __ xori(scratch, scratch, Operand((flags >> kCacheIndexShift) & mask)); |
| 161 | // Prefer and_ to ubfx here because ubfx takes 2 cycles. |
| 162 | __ andi(scratch, scratch, Operand(mask)); |
| 163 | |
| 164 | // Probe the primary table. |
| 165 | ProbeTable(isolate, masm, flags, leave_frame, kPrimary, receiver, name, |
| 166 | scratch, extra, extra2, extra3); |
| 167 | |
| 168 | // Primary miss: Compute hash for secondary probe. |
| 169 | __ ShiftRightImm(extra, name, Operand(kCacheIndexShift)); |
| 170 | __ sub(scratch, scratch, extra); |
| 171 | uint32_t mask2 = kSecondaryTableSize - 1; |
| 172 | __ addi(scratch, scratch, Operand((flags >> kCacheIndexShift) & mask2)); |
| 173 | __ andi(scratch, scratch, Operand(mask2)); |
| 174 | |
| 175 | // Probe the secondary table. |
| 176 | ProbeTable(isolate, masm, flags, leave_frame, kSecondary, receiver, name, |
| 177 | scratch, extra, extra2, extra3); |
| 178 | |
| 179 | // Cache miss: Fall-through and let caller handle the miss by |
| 180 | // entering the runtime system. |
| 181 | __ bind(&miss); |
| 182 | __ IncrementCounter(counters->megamorphic_stub_cache_misses(), 1, extra2, |
| 183 | extra3); |
| 184 | } |
| 185 | |
| 186 | |
| 187 | #undef __ |
| 188 | } |
| 189 | } // namespace v8::internal |
| 190 | |
| 191 | #endif // V8_TARGET_ARCH_PPC |