Lines Matching full:cache
17 * Mutex-free cache for key1+key2=value.
29 * One entry in the cache. We store two keys (e.g. the classes that are
42 * One cache.
44 * Thought: we might be able to save a few cycles by storing the cache
54 /* cache stats; note we don't guarantee atomic increments for these */
55 int trivial; /* cache access not required */
57 int hits; /* found entry in cache */
63 * Do a cache lookup. We need to be able to read and write entries
68 * to just ignore the cache and do the full computation.
135 * Compute the result and update the cache. We really want this \
148 * Allocate a cache.
153 * Free a cache.
155 void dvmFreeAtomicCache(AtomicCache* cache);
158 * Update a cache entry.
