| Index: src/ic/s390/stub-cache-s390.cc
|
| diff --git a/src/ic/s390/stub-cache-s390.cc b/src/ic/s390/stub-cache-s390.cc
|
| index 66fd70f43ac294e7a7c78ae08cc21047df437fbb..69afc25624afc6d19a1186e44102d0ee9c1574e9 100644
|
| --- a/src/ic/s390/stub-cache-s390.cc
|
| +++ b/src/ic/s390/stub-cache-s390.cc
|
| @@ -15,7 +15,8 @@
|
| #define __ ACCESS_MASM(masm)
|
|
|
| static void ProbeTable(StubCache* stub_cache, MacroAssembler* masm,
|
| - StubCache::Table table, Register receiver, Register name,
|
| + Code::Flags flags, StubCache::Table table,
|
| + Register receiver, Register name,
|
| // Number of the cache entry, not scaled.
|
| Register offset, Register scratch, Register scratch2,
|
| Register offset_scratch) {
|
| @@ -69,10 +70,7 @@
|
| scratch2 = no_reg;
|
| __ LoadP(code, MemOperand(base_addr, value_off_addr - key_off_addr));
|
|
|
| -#ifdef DEBUG
|
| // Check that the flags match what we're looking for.
|
| - Code::Flags flags = Code::RemoveHolderFromFlags(
|
| - Code::ComputeHandlerFlags(stub_cache->ic_kind()));
|
| Register flags_reg = base_addr;
|
| base_addr = no_reg;
|
| __ LoadlW(flags_reg, FieldMemOperand(code, Code::kFlagsOffset));
|
| @@ -80,8 +78,9 @@
|
| DCHECK(!r0.is(flags_reg));
|
| __ AndP(flags_reg, flags_reg, Operand(~Code::kFlagsNotUsedInLookup));
|
| __ CmpLogicalP(flags_reg, Operand(flags));
|
| - __ Check(eq, kUnexpectedValue);
|
| + __ bne(&miss, Label::kNear);
|
|
|
| +#ifdef DEBUG
|
| if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) {
|
| __ b(&miss, Label::kNear);
|
| } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) {
|
| @@ -101,6 +100,9 @@
|
| void StubCache::GenerateProbe(MacroAssembler* masm, Register receiver,
|
| Register name, Register scratch, Register extra,
|
| Register extra2, Register extra3) {
|
| + Code::Flags flags =
|
| + Code::RemoveHolderFromFlags(Code::ComputeHandlerFlags(ic_kind_));
|
| +
|
| Label miss;
|
|
|
| #if V8_TARGET_ARCH_S390X
|
| @@ -151,22 +153,24 @@
|
| __ LoadlW(scratch, FieldMemOperand(name, Name::kHashFieldOffset));
|
| __ LoadP(ip, FieldMemOperand(receiver, HeapObject::kMapOffset));
|
| __ AddP(scratch, scratch, ip);
|
| + __ XorP(scratch, scratch, Operand(flags));
|
| // The mask omits the last two bits because they are not part of the hash.
|
| __ AndP(scratch, scratch,
|
| Operand((kPrimaryTableSize - 1) << kCacheIndexShift));
|
|
|
| // Probe the primary table.
|
| - ProbeTable(this, masm, kPrimary, receiver, name, scratch, extra, extra2,
|
| - extra3);
|
| + ProbeTable(this, masm, flags, kPrimary, receiver, name, scratch, extra,
|
| + extra2, extra3);
|
|
|
| // Primary miss: Compute hash for secondary probe.
|
| __ SubP(scratch, scratch, name);
|
| + __ AddP(scratch, scratch, Operand(flags));
|
| __ AndP(scratch, scratch,
|
| Operand((kSecondaryTableSize - 1) << kCacheIndexShift));
|
|
|
| // Probe the secondary table.
|
| - ProbeTable(this, masm, kSecondary, receiver, name, scratch, extra, extra2,
|
| - extra3);
|
| + ProbeTable(this, masm, flags, kSecondary, receiver, name, scratch, extra,
|
| + extra2, extra3);
|
|
|
| // Cache miss: Fall-through and let caller handle the miss by
|
| // entering the runtime system.
|
|
|