Searched refs:kEntriesStart (Results 1 – 5 of 5) sorted by relevance
12387 entry = kEntriesStart; in AddToOptimizedCodeMapInternal()12410 DCHECK(entry < kEntriesStart); in AddToOptimizedCodeMapInternal()12412 for (int i = kEntriesStart; i < length; i += kEntryLength) { in AddToOptimizedCodeMapInternal()12420 if (entry < kEntriesStart) { in AddToOptimizedCodeMapInternal()12445 for (int i = kEntriesStart; i < new_code_map->length(); i += kEntryLength) { in AddToOptimizedCodeMapInternal()12478 int dst = kEntriesStart; in EvictFromOptimizedCodeMap()12480 for (int src = kEntriesStart; src < length; src += kEntryLength) { in EvictFromOptimizedCodeMap()12532 if (code_map->length() == kEntriesStart && in EvictFromOptimizedCodeMap()12543 DCHECK(shrink_by <= code_map->length() - kEntriesStart); in TrimOptimizedCodeMap()12547 if (code_map->length() == kEntriesStart && in TrimOptimizedCodeMap()[all …]
1986 Add<HConstant>(SharedFunctionInfo::kEntriesStart); in BuildInstallFromOptimizedCodeMap()
6537 static const int kEntriesStart = 1; variable6543 static const int kInitialLength = kEntriesStart + kEntryLength;
4471 3, ((optimized_code_map->length() - SharedFunctionInfo::kEntriesStart) / in TEST()4475 for (int i = SharedFunctionInfo::kEntriesStart; in TEST()4499 for (int i = SharedFunctionInfo::kEntriesStart; in TEST()
2835 factory->NewFixedArray(SharedFunctionInfo::kEntriesStart, TENURED); in CreateInitialObjects()2838 STATIC_ASSERT(SharedFunctionInfo::kEntriesStart == 1 && in CreateInitialObjects()