(&self, key: QueryCacheKey, mut entry: QueryResultEntry)
| 341 | } |
| 342 | |
| 343 | fn insert_l1(&self, key: QueryCacheKey, mut entry: QueryResultEntry) { |
| 344 | entry.metadata.level = CacheLevel::L1; |
| 345 | let size = entry.size_bytes(); |
| 346 | |
| 347 | // Evict if necessary |
| 348 | self.evict_l1_if_needed(size); |
| 349 | |
| 350 | { |
| 351 | let mut l1_cache = self.l1_cache.write().unwrap(); |
| 352 | l1_cache.insert(key.clone(), entry); |
| 353 | } |
| 354 | |
| 355 | { |
| 356 | let mut l1_lru = self.l1_lru.write().unwrap(); |
| 357 | l1_lru.access(&key); |
| 358 | } |
| 359 | |
| 360 | { |
| 361 | let mut current_memory = self.l1_current_memory.write().unwrap(); |
| 362 | *current_memory += size; |
| 363 | } |
| 364 | } |
| 365 | |
| 366 | fn insert_l2(&self, key: QueryCacheKey, mut entry: QueryResultEntry) { |
| 367 | entry.metadata.level = CacheLevel::L2; |
no test coverage detected