Lines Matching defs:cache
5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
10 * that this cache can directly cover, the cache will become less effective if
11 * locality of reference is low, but the consequence is merely cache misses
14 * The L1 direct mapped cache offers consistent and low cost on cache hit.
16 * combining with a L2 LRU cache, which requires linear search and re-ordering
17 * on access but suffers no collision. Note that, the cache will itself suffer
18 * cache misses if made overly large, plus the cost of linear search in the LRU
19 * cache.
42 /* Direct mapped cache. */
43 rtree_ctx_cache_elm_t cache[RTREE_CTX_NCACHE];
44 /* L2 LRU cache. */
Indexes created Tue Apr 14 00:22:26 UTC 2026