rust/compiler/rustc_query_system/src/query/caches.rs

188 lines
5.3 KiB
Rust
Raw Normal View History

use crate::dep_graph::DepNodeIndex;
2020-06-02 17:19:49 +00:00
use rustc_arena::TypedArena;
use rustc_data_structures::fx::FxHashMap;
use rustc_data_structures::sharded::{self, Sharded};
2020-03-27 17:46:25 +00:00
use rustc_data_structures::sync::WorkerLocal;
use std::default::Default;
use std::fmt::Debug;
use std::hash::Hash;
use std::marker::PhantomData;
pub trait CacheSelector<K, V> {
type Cache;
}
pub trait QueryStorage {
type Value: Debug;
type Stored: Clone;
/// Store a value without putting it in the cache.
/// This is meant to be used with cycle errors.
fn store_nocache(&self, value: Self::Value) -> Self::Stored;
}
pub trait QueryCache: QueryStorage + Sized {
type Key: Hash + Eq + Clone + Debug;
/// Checks if the query is already computed and in the cache.
/// It returns the shard index and a lock guard to the shard,
/// which will be used if the query is not in the cache and we need
/// to compute it.
fn lookup<R, OnHit>(
&self,
2020-10-23 20:34:32 +00:00
key: &Self::Key,
// `on_hit` can be called while holding a lock to the query state shard.
on_hit: OnHit,
) -> Result<R, ()>
where
2020-10-23 20:34:32 +00:00
OnHit: FnOnce(&Self::Stored, DepNodeIndex) -> R;
fn complete(&self, key: Self::Key, value: Self::Value, index: DepNodeIndex) -> Self::Stored;
fn iter(&self, f: &mut dyn FnMut(&Self::Key, &Self::Value, DepNodeIndex));
}
pub struct DefaultCacheSelector;
2020-03-24 22:46:47 +00:00
impl<K: Eq + Hash, V: Clone> CacheSelector<K, V> for DefaultCacheSelector {
type Cache = DefaultCache<K, V>;
}
pub struct DefaultCache<K, V> {
shards: Sharded<FxHashMap<K, (V, DepNodeIndex)>>,
}
impl<K, V> Default for DefaultCache<K, V> {
fn default() -> Self {
DefaultCache { shards: Default::default() }
}
}
impl<K: Eq + Hash, V: Clone + Debug> QueryStorage for DefaultCache<K, V> {
type Value = V;
type Stored = V;
2020-04-28 09:57:38 +00:00
#[inline]
fn store_nocache(&self, value: Self::Value) -> Self::Stored {
// We have no dedicated storage
value
}
}
impl<K, V> QueryCache for DefaultCache<K, V>
where
K: Eq + Hash + Clone + Debug,
V: Clone + Debug,
{
type Key = K;
#[inline(always)]
fn lookup<R, OnHit>(&self, key: &K, on_hit: OnHit) -> Result<R, ()>
where
OnHit: FnOnce(&V, DepNodeIndex) -> R,
{
let key_hash = sharded::make_hash(key);
let shard = sharded::get_shard_index_by_hash(key_hash);
let lock = self.shards.get_shard_by_index(shard).lock();
let result = lock.raw_entry().from_key_hashed_nocheck(key_hash, key);
2020-10-23 20:34:32 +00:00
if let Some((_, value)) = result {
let hit_result = on_hit(&value.0, value.1);
Ok(hit_result)
} else {
Err(())
2020-10-23 20:34:32 +00:00
}
}
#[inline]
fn complete(&self, key: K, value: V, index: DepNodeIndex) -> Self::Stored {
self.shards.get_shard_by_value(&key).lock().insert(key, (value.clone(), index));
value
}
fn iter(&self, f: &mut dyn FnMut(&Self::Key, &Self::Value, DepNodeIndex)) {
let shards = self.shards.lock_shards();
for shard in shards.iter() {
for (k, v) in shard.iter() {
f(k, &v.0, v.1);
}
}
}
}
2020-03-27 17:46:25 +00:00
pub struct ArenaCacheSelector<'tcx>(PhantomData<&'tcx ()>);
impl<'tcx, K: Eq + Hash, V: 'tcx> CacheSelector<K, V> for ArenaCacheSelector<'tcx> {
type Cache = ArenaCache<'tcx, K, V>;
}
pub struct ArenaCache<'tcx, K, V> {
2020-04-01 12:29:55 +00:00
arena: WorkerLocal<TypedArena<(V, DepNodeIndex)>>,
shards: Sharded<FxHashMap<K, &'tcx (V, DepNodeIndex)>>,
2020-03-27 17:46:25 +00:00
}
impl<'tcx, K, V> Default for ArenaCache<'tcx, K, V> {
fn default() -> Self {
ArenaCache {
arena: WorkerLocal::new(|_| TypedArena::default()),
shards: Default::default(),
}
2020-03-27 17:46:25 +00:00
}
}
impl<'tcx, K: Eq + Hash, V: Debug + 'tcx> QueryStorage for ArenaCache<'tcx, K, V> {
2020-03-27 17:46:25 +00:00
type Value = V;
type Stored = &'tcx V;
2020-04-28 09:57:38 +00:00
#[inline]
2020-03-27 17:46:25 +00:00
fn store_nocache(&self, value: Self::Value) -> Self::Stored {
let value = self.arena.alloc((value, DepNodeIndex::INVALID));
2020-04-01 12:29:55 +00:00
let value = unsafe { &*(&value.0 as *const _) };
&value
2020-03-27 17:46:25 +00:00
}
}
impl<'tcx, K, V: 'tcx> QueryCache for ArenaCache<'tcx, K, V>
where
K: Eq + Hash + Clone + Debug,
2021-01-04 15:55:50 +00:00
V: Debug,
{
2020-03-27 17:46:25 +00:00
type Key = K;
#[inline(always)]
fn lookup<R, OnHit>(&self, key: &K, on_hit: OnHit) -> Result<R, ()>
2020-03-27 17:46:25 +00:00
where
OnHit: FnOnce(&&'tcx V, DepNodeIndex) -> R,
{
let key_hash = sharded::make_hash(key);
let shard = sharded::get_shard_index_by_hash(key_hash);
let lock = self.shards.get_shard_by_index(shard).lock();
let result = lock.raw_entry().from_key_hashed_nocheck(key_hash, key);
2020-03-27 17:46:25 +00:00
if let Some((_, value)) = result {
2020-10-23 20:34:32 +00:00
let hit_result = on_hit(&&value.0, value.1);
Ok(hit_result)
2020-03-27 17:46:25 +00:00
} else {
Err(())
2020-03-27 17:46:25 +00:00
}
}
#[inline]
fn complete(&self, key: K, value: V, index: DepNodeIndex) -> Self::Stored {
2020-03-27 17:46:25 +00:00
let value = self.arena.alloc((value, index));
2020-04-01 12:29:55 +00:00
let value = unsafe { &*(value as *const _) };
self.shards.get_shard_by_value(&key).lock().insert(key, value);
2020-03-27 17:46:25 +00:00
&value.0
}
fn iter(&self, f: &mut dyn FnMut(&Self::Key, &Self::Value, DepNodeIndex)) {
let shards = self.shards.lock_shards();
for shard in shards.iter() {
for (k, v) in shard.iter() {
f(k, &v.0, v.1);
}
}
2020-03-27 17:46:25 +00:00
}
}