Lines Matching defs:cache

5 #include "src/objects/compilation-cache-table.h"
8 #include "src/objects/compilation-cache-table-inl.h"
20 // The initial placeholder insertion of the eval cache survives this many GCs.
23 int SearchLiteralsMapEntry(CompilationCacheTable cache, int cache_entry,
27 Object obj = cache.get(cache_entry);
46 void AddToFeedbackCellsMap(Handle<CompilationCacheTable> cache, int cache_entry,
55 Object obj = cache->get(cache_entry);
66 entry = SearchLiteralsMapEntry(*cache, cache_entry, *native_context);
109 Object old_literals_map = cache->get(cache_entry);
111 cache->set(cache_entry, *new_literals_map);
115 FeedbackCell SearchLiteralsMap(CompilationCacheTable cache, int cache_entry,
118 int entry = SearchLiteralsMapEntry(cache, cache_entry, native_context);
120 WeakFixedArray literals_map = WeakFixedArray::cast(cache.get(cache_entry));
132 // StringSharedKeys are used as keys in the eval cache.
299 Handle<CompilationCacheTable> cache, Handle<String> src,
305 cache = EnsureCapacity(isolate, cache);
306 InternalIndex entry = cache->FindInsertionEntry(isolate, key.Hash());
307 cache->set(EntryToIndex(entry), *k);
308 cache->set(EntryToIndex(entry) + 1, *value);
309 cache->ElementAdded();
310 return cache;
314 Handle<CompilationCacheTable> cache, Handle<String> src,
326 InternalIndex entry = cache->FindEntry(isolate, &key);
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
334 AddToFeedbackCellsMap(cache, EntryToIndex(entry) + 2, native_context,
336 // Add hash again even on cache hit to avoid unnecessary cache delay in
342 cache = EnsureCapacity(isolate, cache);
343 InternalIndex entry = cache->FindInsertionEntry(isolate, key.Hash());
346 cache->set(EntryToIndex(entry), *k);
347 cache->set(EntryToIndex(entry) + 1, Smi::FromInt(kHashGenerations));
348 cache->ElementAdded();
349 return cache;
353 Isolate* isolate, Handle<CompilationCacheTable> cache, Handle<String> src,
356 cache = EnsureCapacity(isolate, cache);
357 InternalIndex entry = cache->FindInsertionEntry(isolate, key.Hash());
360 cache->set(EntryToIndex(entry), *value);
361 cache->set(EntryToIndex(entry) + 1, *value);
362 cache->ElementAdded();
363 return cache;
374 // The ageing mechanism for the initial dummy entry in the eval cache.