[ic] Split megamorphic stub cache in two caches (for loads and for stores).

src/ic/stub-cache.h

 // 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.
 
 #ifndef V8_STUB_CACHE_H_
 #define V8_STUB_CACHE_H_
 
 #include "src/macro-assembler.h"
 
 namespace v8 {
@@ skipping 34 matching lines @@
   // Clear the lookup table (@ mark compact collection).
   void Clear();
   // Collect all maps that match the name and flags.
   void CollectMatchingMaps(SmallMapList* types, Handle<Name> name,
                            Code::Flags flags, Handle<Context> native_context,
                            Zone* zone);
   // Generate code for probing the stub cache table.
   // Arguments extra, extra2 and extra3 may be used to pass additional scratch
   // registers. Set to no_reg if not needed.
   // If leave_frame is true, then exit a frame before the tail call.
-  void GenerateProbe(MacroAssembler* masm, Code::Kind ic_kind,
-                     Code::Flags flags, Register receiver, Register name,
+  void GenerateProbe(MacroAssembler* masm, Register receiver, Register name,
                      Register scratch, Register extra, Register extra2 = no_reg,
                      Register extra3 = no_reg);
 
   enum Table { kPrimary, kSecondary };
 
   SCTableReference key_reference(StubCache::Table table) {
     return SCTableReference(
         reinterpret_cast<Address>(&first_entry(table)->key));
   }
 
@@ skipping 12 matching lines @@
       case StubCache::kPrimary:
         return StubCache::primary_;
       case StubCache::kSecondary:
         return StubCache::secondary_;
     }
     UNREACHABLE();
     return NULL;
   }
 
   Isolate* isolate() { return isolate_; }
+  Code::Kind ic_kind() const { return ic_kind_; }
 
   // Setting the entry size such that the index is shifted by Name::kHashShift
   // is convenient; shifting down the length field (to extract the hash code)
   // automatically discards the hash bit field.
   static const int kCacheIndexShift = Name::kHashShift;
 
   static const int kPrimaryTableBits = 11;
   static const int kPrimaryTableSize = (1 << kPrimaryTableBits);
   static const int kSecondaryTableBits = 9;
   static const int kSecondaryTableSize = (1 << kSecondaryTableBits);
 
   static int PrimaryOffsetForTesting(Name* name, Code::Flags flags, Map* map) {
     return PrimaryOffset(name, flags, map);
   }
 
   static int SecondaryOffsetForTesting(Name* name, Code::Flags flags,
                                        int seed) {
     return SecondaryOffset(name, flags, seed);
   }
 
   // The constructor is made public only for the purposes of testing.
-  explicit StubCache(Isolate* isolate);
+  StubCache(Isolate* isolate, Code::Kind ic_kind);
 
  private:
   // The stub cache has a primary and secondary level.  The two levels have
   // different hashing algorithms in order to avoid simultaneous collisions
   // in both caches.  Unlike a probing strategy (quadratic or otherwise) the
   // update strategy on updates is fairly clear and simple:  Any existing entry
   // in the primary cache is moved to the secondary cache, and secondary cache
   // entries are overwritten.
 
   // Hash algorithm for the primary table.  This algorithm is replicated in
@@ skipping 41 matching lines @@
   static Entry* entry(Entry* table, int offset) {
     const int multiplier = sizeof(*table) >> Name::kHashShift;
     return reinterpret_cast<Entry*>(reinterpret_cast<Address>(table) +
                                     offset * multiplier);
   }
 
  private:
   Entry primary_[kPrimaryTableSize];
   Entry secondary_[kSecondaryTableSize];
   Isolate* isolate_;
+  Code::Kind ic_kind_;
 
   friend class Isolate;
   friend class SCTableReference;
 
   DISALLOW_COPY_AND_ASSIGN(StubCache);
 };
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_STUB_CACHE_H_