Searched refs:kEntryLength (Results 1 – 5 of 5) sorted by relevance
1362 DCHECK(field_offset >= 0 && field_offset < SharedFunctionInfo::kEntryLength); in LoadFromOptimizedCodeMap()1409 Add<HConstant>(SharedFunctionInfo::kEntryLength); in BuildInstallFromOptimizedCodeMap()1840 int probe_base = probe * KeyedLookupCache::kEntryLength; in BuildCodeStub()
9176 STATIC_ASSERT(kEntryLength == 4); in AddToOptimizedCodeMap()9192 old_code_map, old_length + kEntryLength); in AddToOptimizedCodeMap()9206 for (int i = kEntriesStart; i < new_code_map->length(); i += kEntryLength) { in AddToOptimizedCodeMap()9263 for (int src = kEntriesStart; src < length; src += kEntryLength) { in EvictFromOptimizedCodeMap()9289 dst += kEntryLength; in EvictFromOptimizedCodeMap()9302 DCHECK(shrink_by % kEntryLength == 0); in TrimOptimizedCodeMap()9991 for (int i = kEntriesStart; i < length; i += kEntryLength) { in SearchOptimizedCodeMap()
6626 static const int kEntryLength = 4; variable6627 static const int kInitialLength = kEntriesStart + kEntryLength;
1104 STATIC_ASSERT(SharedFunctionInfo::kEntryLength == 4); in ProcessOptimizedCodeMaps()1117 i += SharedFunctionInfo::kEntryLength) { in ProcessOptimizedCodeMaps()1123 for (int j = 0; j < SharedFunctionInfo::kEntryLength; j++) { in ProcessOptimizedCodeMaps()
2258 static const int kEntryLength = 2; variable