Lines Matching refs:entry
53 int entry;
63 entry = 0;
66 entry = SearchLiteralsMapEntry(*cache, cache_entry, *native_context);
67 if (entry >= 0) {
68 // Just set the code of the entry.
69 old_literals_map->Set(entry + kLiteralLiteralsOffset,
74 // Can we reuse an entry?
75 DCHECK_LT(entry, 0);
80 entry = i;
85 if (entry < 0) {
86 // Copy old optimized code map and append one new entry.
89 entry = old_literals_map->length();
93 new_literals_map->Set(entry + kLiteralContextOffset,
95 new_literals_map->Set(entry + kLiteralLiteralsOffset,
118 int entry = SearchLiteralsMapEntry(cache, cache_entry, native_context);
119 if (entry >= 0) {
121 DCHECK_LE(entry + kLiteralEntryLength, literals_map.length());
122 MaybeObject object = literals_map.Get(entry + kLiteralLiteralsOffset);
252 InternalIndex entry = table->FindEntry(isolate, &key);
253 if (entry.is_not_found()) return MaybeHandle<SharedFunctionInfo>();
254 int index = EntryToIndex(entry);
274 InternalIndex entry = table->FindEntry(isolate, &key);
275 if (entry.is_not_found()) return empty_result;
277 int index = EntryToIndex(entry);
293 InternalIndex entry = FindEntry(isolate, &key);
294 if (entry.is_not_found()) return isolate->factory()->undefined_value();
295 return Handle<Object>(get(EntryToIndex(entry) + 1), isolate);
306 InternalIndex entry = cache->FindInsertionEntry(isolate, key.Hash());
307 cache->set(EntryToIndex(entry), *k);
308 cache->set(EntryToIndex(entry) + 1, *value);
326 InternalIndex entry = cache->FindEntry(isolate, &key);
327 if (entry.is_found()) {
328 cache->set(EntryToIndex(entry), *k);
329 cache->set(EntryToIndex(entry) + 1, *value);
331 // entry, but it won't change the cache array. Therefore EntryToIndex
332 // and entry remains correct.
334 AddToFeedbackCellsMap(cache, EntryToIndex(entry) + 2, native_context,
341 // Create a dummy entry to mark that this key has already been inserted once.
343 InternalIndex entry = cache->FindInsertionEntry(isolate, key.Hash());
346 cache->set(EntryToIndex(entry), *k);
347 cache->set(EntryToIndex(entry) + 1, Smi::FromInt(kHashGenerations));
357 InternalIndex entry = cache->FindInsertionEntry(isolate, key.Hash());
360 cache->set(EntryToIndex(entry), *value);
361 cache->set(EntryToIndex(entry) + 1, *value);
368 for (InternalIndex entry : IterateEntries()) {
369 const int entry_index = EntryToIndex(entry);
374 // The ageing mechanism for the initial dummy entry in the eval cache.
376 // counting down from kHashGenerations. On reaching zero, the entry is
401 for (InternalIndex entry : IterateEntries()) {
402 int entry_index = EntryToIndex(entry);