CacheEntry 37 src/Solve.cpp map<Expr, CacheEntry, ExprCompare>::iterator iter = cache.find(e); CacheEntry 44 src/Solve.cpp CacheEntry entry = {new_e, uses_var}; CacheEntry 74 src/Solve.cpp map<Expr, CacheEntry, ExprCompare> cache; CacheEntry 77 src/Solve.cpp Scope<CacheEntry> scope; CacheEntry 703 src/Solve.cpp CacheEntry e = scope.get(op->name); CacheEntry 721 src/Solve.cpp CacheEntry e = {value, uses_var}; CacheEntry 84 src/runtime/cache.cpp CacheEntry *next; CacheEntry 85 src/runtime/cache.cpp CacheEntry *more_recent; CacheEntry 86 src/runtime/cache.cpp CacheEntry *less_recent; CacheEntry 109 src/runtime/cache.cpp CacheEntry *entry; CacheEntry 117 src/runtime/cache.cpp WEAK bool CacheEntry::init(const uint8_t *cache_key, size_t cache_key_size, CacheEntry 176 src/runtime/cache.cpp WEAK void CacheEntry::destroy() { CacheEntry 196 src/runtime/cache.cpp WEAK CacheEntry *cache_entries[kHashTableSize]; CacheEntry 198 src/runtime/cache.cpp WEAK CacheEntry *most_recently_used = NULL; CacheEntry 199 src/runtime/cache.cpp WEAK CacheEntry *least_recently_used = NULL; CacheEntry 212 src/runtime/cache.cpp CacheEntry *entry = cache_entries[i]; CacheEntry 227 src/runtime/cache.cpp CacheEntry *mru_chain = most_recently_used; CacheEntry 233 src/runtime/cache.cpp CacheEntry *lru_chain = least_recently_used; CacheEntry 260 src/runtime/cache.cpp CacheEntry *prune_candidate = least_recently_used; CacheEntry 263 src/runtime/cache.cpp CacheEntry *more_recent = prune_candidate->more_recent; CacheEntry 270 src/runtime/cache.cpp CacheEntry *prev_hash_entry = cache_entries[index]; CacheEntry 349 src/runtime/cache.cpp CacheEntry *entry = cache_entries[index]; CacheEntry 444 src/runtime/cache.cpp CacheEntry *entry = cache_entries[index]; CacheEntry 486 src/runtime/cache.cpp CacheEntry *new_entry = (CacheEntry *)halide_malloc(NULL, sizeof(CacheEntry)); CacheEntry 534 src/runtime/cache.cpp CacheEntry *entry = header->entry; CacheEntry 554 src/runtime/cache.cpp CacheEntry *entry = cache_entries[i]; CacheEntry 557 src/runtime/cache.cpp CacheEntry *next = entry->next;