Searched refs:caches (Results 1 – 5 of 5) sorted by relevance
51 Set<Cache> caches = new HashSet<>(1); in getApproximateMemoryUsageByType() local52 caches.add(cache); in getApproximateMemoryUsageByType()53 Map<MemoryUsageType, Long> usage = MemoryUtil.getApproximateMemoryUsageByType(dbs, caches); in getApproximateMemoryUsageByType()67 usage = MemoryUtil.getApproximateMemoryUsageByType(dbs, caches); in getApproximateMemoryUsageByType()121 Set<Cache> caches = new HashSet<>(1); in getApproximateMemoryUsageByTypeMultiple() local122 caches.add(cache1); in getApproximateMemoryUsageByTypeMultiple()123 caches.add(cache2); in getApproximateMemoryUsageByTypeMultiple()131 Map<MemoryUsageType, Long> usage = MemoryUtil.getApproximateMemoryUsageByType(dbs, caches); in getApproximateMemoryUsageByTypeMultiple()
30 …sageType, Long> getApproximateMemoryUsageByType(final List<RocksDB> dbs, final Set<Cache> caches) { in getApproximateMemoryUsageByType() argument32 int cacheCount = (caches == null) ? 0 : caches.size(); in getApproximateMemoryUsageByType()45 for (Cache cache : caches) { in getApproximateMemoryUsageByType()
47 6. Deal with mutexes in LRU caches.48 …caches had exclusive mutexes within to protect writes to the LRU lists, which are done in both of …49 …caches. A table cache maintains list of SST table’s read handlers. Those handlers contain SST file…
27 The _CommitCache_ is a lock-free data structure that caches the recent commit entries. Looking up t…
4361 std::unordered_set<rocksdb_cache_t*> caches; member4378 consumers->caches.insert(cache); in rocksdb_memory_consumers_add_cache()4404 for (auto cache : consumers->caches) { in rocksdb_approximate_memory_usage_create()