1 //! The implementation of the query system itself. This defines the macros that
2 //! generate the actual methods on tcx which find and execute the provider,
3 //! manage the caches, and so forth.
5 use crate::dep_graph::{DepNodeIndex, DepNode, DepKind, SerializedDepNodeIndex};
7 use crate::ty::{TyCtxt};
8 use crate::ty::query::Query;
9 use crate::ty::query::config::{QueryConfig, QueryDescription};
10 use crate::ty::query::job::{QueryJob, QueryResult, QueryInfo};
11 use crate::ty::item_path;
13 use crate::util::common::{profq_msg, ProfileQueriesMsg, QueryMsg};
15 use errors::DiagnosticBuilder;
17 use errors::Diagnostic;
18 use errors::FatalError;
19 use rustc_data_structures::fx::{FxHashMap};
20 use rustc_data_structures::sync::{Lrc, Lock};
21 use rustc_data_structures::thin_vec::ThinVec;
24 use std::collections::hash_map::Entry;
26 use syntax::source_map::DUMMY_SP;
28 pub struct QueryCache<'tcx, D: QueryConfig<'tcx> + ?Sized> {
29 pub(super) results: FxHashMap<D::Key, QueryValue<D::Value>>,
30 pub(super) active: FxHashMap<D::Key, QueryResult<'tcx>>,
31 #[cfg(debug_assertions)]
32 pub(super) cache_hits: usize,
35 pub(super) struct QueryValue<T> {
37 pub(super) index: DepNodeIndex,
40 impl<T> QueryValue<T> {
41 pub(super) fn new(value: T,
42 dep_node_index: DepNodeIndex)
46 index: dep_node_index,
51 impl<'tcx, M: QueryConfig<'tcx>> Default for QueryCache<'tcx, M> {
52 fn default() -> QueryCache<'tcx, M> {
54 results: FxHashMap::default(),
55 active: FxHashMap::default(),
56 #[cfg(debug_assertions)]
62 // If enabled, send a message to the profile-queries thread
63 macro_rules! profq_msg {
64 ($tcx:expr, $msg:expr) => {
65 if cfg!(debug_assertions) {
66 if $tcx.sess.profile_queries() {
67 profq_msg($tcx.sess, $msg)
73 // If enabled, format a key using its debug string, which can be
74 // expensive to compute (in terms of time).
75 macro_rules! profq_query_msg {
76 ($query:expr, $tcx:expr, $key:expr) => {{
77 let msg = if cfg!(debug_assertions) {
78 if $tcx.sess.profile_queries_and_keys() {
79 Some(format!("{:?}", $key))
89 /// A type representing the responsibility to execute the job in the `job` field.
90 /// This will poison the relevant query if dropped.
91 pub(super) struct JobOwner<'a, 'tcx: 'a, Q: QueryDescription<'tcx> + 'a> {
92 cache: &'a Lock<QueryCache<'tcx, Q>>,
94 job: Lrc<QueryJob<'tcx>>,
97 impl<'a, 'tcx, Q: QueryDescription<'tcx>> JobOwner<'a, 'tcx, Q> {
98 /// Either gets a JobOwner corresponding the query, allowing us to
99 /// start executing the query, or it returns with the result of the query.
100 /// If the query is executing elsewhere, this will wait for it.
101 /// If the query panicked, this will silently panic.
103 /// This function is inlined because that results in a noticeable speedup
104 /// for some compile-time benchmarks.
106 pub(super) fn try_get(
107 tcx: TyCtxt<'a, 'tcx, '_>,
110 ) -> TryGetJob<'a, 'tcx, Q> {
111 let cache = Q::query_cache(tcx);
113 let mut lock = cache.borrow_mut();
114 if let Some(value) = lock.results.get(key) {
115 profq_msg!(tcx, ProfileQueriesMsg::CacheHit);
116 tcx.sess.profiler(|p| p.record_query_hit(Q::NAME, Q::CATEGORY));
117 let result = Ok((value.value.clone(), value.index));
118 #[cfg(debug_assertions)]
120 lock.cache_hits += 1;
122 return TryGetJob::JobCompleted(result);
124 let job = match lock.active.entry((*key).clone()) {
125 Entry::Occupied(entry) => {
127 QueryResult::Started(ref job) => job.clone(),
128 QueryResult::Poisoned => FatalError.raise(),
131 Entry::Vacant(entry) => {
132 // No job entry for this query. Return a new one to be started later
133 return tls::with_related_context(tcx, |icx| {
134 // Create the `parent` variable before `info`. This allows LLVM
135 // to elide the move of `info`
136 let parent = icx.query.clone();
137 let info = QueryInfo {
139 query: Q::query(key.clone()),
141 let job = Lrc::new(QueryJob::new(info, parent));
142 let owner = JobOwner {
147 entry.insert(QueryResult::Started(job));
148 TryGetJob::NotYetStarted(owner)
154 // If we are single-threaded we know that we have cycle error,
155 // so we just turn the errror
156 #[cfg(not(parallel_compiler))]
157 return job.cycle_error(tcx, span);
159 // With parallel queries we might just have to wait on some other
161 #[cfg(parallel_compiler)]
163 if let Err(cycle) = job.r#await(tcx, span) {
164 return TryGetJob::JobCompleted(Err(cycle));
170 /// Completes the query by updating the query cache with the `result`,
171 /// signals the waiter and forgets the JobOwner, so it won't poison the query
173 pub(super) fn complete(self, result: &Q::Value, dep_node_index: DepNodeIndex) {
174 // We can move out of `self` here because we `mem::forget` it below
175 let key = unsafe { ptr::read(&self.key) };
176 let job = unsafe { ptr::read(&self.job) };
177 let cache = self.cache;
179 // Forget ourself so our destructor won't poison the query
182 let value = QueryValue::new(result.clone(), dep_node_index);
184 let mut lock = cache.borrow_mut();
185 lock.active.remove(&key);
186 lock.results.insert(key, value);
189 job.signal_complete();
192 /// Executes a job by changing the ImplicitCtxt to point to the
193 /// new query job while it executes. It returns the diagnostics
194 /// captured during execution and the actual result.
196 pub(super) fn start<'lcx, F, R>(
198 tcx: TyCtxt<'_, 'tcx, 'lcx>,
199 diagnostics: Option<&Lock<ThinVec<Diagnostic>>>,
203 F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'lcx>) -> R
205 // The TyCtxt stored in TLS has the same global interner lifetime
206 // as `tcx`, so we use `with_related_context` to relate the 'gcx lifetimes
207 // when accessing the ImplicitCtxt
208 tls::with_related_context(tcx, move |current_icx| {
209 // Update the ImplicitCtxt to point to our new query job
210 let new_icx = tls::ImplicitCtxt {
211 tcx: tcx.global_tcx(),
212 query: Some(self.job.clone()),
214 layout_depth: current_icx.layout_depth,
215 task_deps: current_icx.task_deps,
218 // Use the ImplicitCtxt while we execute the query
219 tls::enter_context(&new_icx, |_| {
228 fn with_diagnostics<F, R>(f: F) -> (R, ThinVec<Diagnostic>)
230 F: FnOnce(Option<&Lock<ThinVec<Diagnostic>>>) -> R
232 let diagnostics = Lock::new(ThinVec::new());
233 let result = f(Some(&diagnostics));
234 (result, diagnostics.into_inner())
237 impl<'a, 'tcx, Q: QueryDescription<'tcx>> Drop for JobOwner<'a, 'tcx, Q> {
241 // Poison the query so jobs waiting on it panic
242 self.cache.borrow_mut().active.insert(self.key.clone(), QueryResult::Poisoned);
243 // Also signal the completion of the job, so waiters
244 // will continue execution
245 self.job.signal_complete();
250 pub struct CycleError<'tcx> {
251 /// The query and related span which uses the cycle
252 pub(super) usage: Option<(Span, Query<'tcx>)>,
253 pub(super) cycle: Vec<QueryInfo<'tcx>>,
256 /// The result of `try_get_lock`
257 pub(super) enum TryGetJob<'a, 'tcx: 'a, D: QueryDescription<'tcx> + 'a> {
258 /// The query is not yet started. Contains a guard to the cache eventually used to start it.
259 NotYetStarted(JobOwner<'a, 'tcx, D>),
261 /// The query was already completed.
262 /// Returns the result of the query and its dep node index
263 /// if it succeeded or a cycle error if it failed
264 JobCompleted(Result<(D::Value, DepNodeIndex), Box<CycleError<'tcx>>>),
267 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
270 pub(super) fn report_cycle(
272 box CycleError { usage, cycle: stack }: Box<CycleError<'gcx>>
273 ) -> Box<DiagnosticBuilder<'a>>
275 assert!(!stack.is_empty());
277 let fix_span = |span: Span, query: &Query<'gcx>| {
278 self.sess.source_map().def_span(query.default_span(self, span))
281 // Disable naming impls with types in this path, since that
282 // sometimes cycles itself, leading to extra cycle errors.
283 // (And cycle errors around impls tend to occur during the
284 // collect/coherence phases anyhow.)
285 item_path::with_forced_impl_filename_line(|| {
286 let span = fix_span(stack[1 % stack.len()].span, &stack[0].query);
287 let mut err = struct_span_err!(self.sess,
290 "cycle detected when {}",
291 stack[0].query.describe(self));
293 for i in 1..stack.len() {
294 let query = &stack[i].query;
295 let span = fix_span(stack[(i + 1) % stack.len()].span, query);
296 err.span_note(span, &format!("...which requires {}...", query.describe(self)));
299 err.note(&format!("...which again requires {}, completing the cycle",
300 stack[0].query.describe(self)));
302 if let Some((span, query)) = usage {
303 err.span_note(fix_span(span, &query),
304 &format!("cycle used when {}", query.describe(self)));
311 pub fn try_print_query_stack() {
312 eprintln!("query stack during panic:");
314 tls::with_context_opt(|icx| {
315 if let Some(icx) = icx {
316 let mut current_query = icx.query.clone();
319 while let Some(query) = current_query {
320 let mut db = DiagnosticBuilder::new(icx.tcx.sess.diagnostic(),
322 &format!("#{} [{}] {}",
324 query.info.query.name(),
325 query.info.query.describe(icx.tcx)));
326 db.set_span(icx.tcx.sess.source_map().def_span(query.info.span));
327 icx.tcx.sess.diagnostic().force_print_db(db);
329 current_query = query.parent.clone();
335 eprintln!("end of query stack");
339 fn try_get_with<Q: QueryDescription<'gcx>>(
343 -> Result<Q::Value, Box<CycleError<'gcx>>>
345 debug!("ty::queries::{}::try_get_with(key={:?}, span={:?})",
351 ProfileQueriesMsg::QueryBegin(
353 profq_query_msg!(Q::NAME, self, key),
357 let job = match JobOwner::try_get(self, span, &key) {
358 TryGetJob::NotYetStarted(job) => job,
359 TryGetJob::JobCompleted(result) => {
360 return result.map(|(v, index)| {
361 self.dep_graph.read_index(index);
367 // Fast path for when incr. comp. is off. `to_dep_node` is
368 // expensive for some DepKinds.
369 if !self.dep_graph.is_fully_enabled() {
370 let null_dep_node = DepNode::new_no_params(crate::dep_graph::DepKind::Null);
371 return Ok(self.force_query_with_job::<Q>(key, job, null_dep_node).0);
374 let dep_node = Q::to_dep_node(self, &key);
376 if dep_node.kind.is_anon() {
377 profq_msg!(self, ProfileQueriesMsg::ProviderBegin);
378 self.sess.profiler(|p| p.start_query(Q::NAME, Q::CATEGORY));
380 let ((result, dep_node_index), diagnostics) = with_diagnostics(|diagnostics| {
381 job.start(self, diagnostics, |tcx| {
382 tcx.dep_graph.with_anon_task(dep_node.kind, || {
383 Q::compute(tcx.global_tcx(), key)
388 self.sess.profiler(|p| p.end_query(Q::NAME, Q::CATEGORY));
389 profq_msg!(self, ProfileQueriesMsg::ProviderEnd);
391 self.dep_graph.read_index(dep_node_index);
393 if unlikely!(!diagnostics.is_empty()) {
394 self.queries.on_disk_cache
395 .store_diagnostics_for_anon_node(dep_node_index, diagnostics);
398 job.complete(&result, dep_node_index);
403 if !dep_node.kind.is_input() {
404 if let Some((prev_dep_node_index,
405 dep_node_index)) = self.dep_graph.try_mark_green_and_read(self,
407 return Ok(self.load_from_disk_and_cache_in_memory::<Q>(
417 let (result, dep_node_index) = self.force_query_with_job::<Q>(key, job, dep_node);
418 self.dep_graph.read_index(dep_node_index);
422 fn load_from_disk_and_cache_in_memory<Q: QueryDescription<'gcx>>(
425 job: JobOwner<'a, 'gcx, Q>,
426 prev_dep_node_index: SerializedDepNodeIndex,
427 dep_node_index: DepNodeIndex,
431 // Note this function can be called concurrently from the same query
432 // We must ensure that this is handled correctly
434 debug_assert!(self.dep_graph.is_green(dep_node));
436 // First we try to load the result from the on-disk cache
437 let result = if Q::cache_on_disk(self.global_tcx(), key.clone()) &&
438 self.sess.opts.debugging_opts.incremental_queries {
439 let result = Q::try_load_from_disk(self.global_tcx(), prev_dep_node_index);
441 // We always expect to find a cached result for things that
442 // can be forced from DepNode.
443 debug_assert!(!dep_node.kind.can_reconstruct_query_key() ||
445 "Missing on-disk cache entry for {:?}",
449 // Some things are never cached on disk.
453 let result = if let Some(result) = result {
454 profq_msg!(self, ProfileQueriesMsg::CacheHit);
455 self.sess.profiler(|p| p.record_query_hit(Q::NAME, Q::CATEGORY));
459 // We could not load a result from the on-disk cache, so
462 self.sess.profiler(|p| p.start_query(Q::NAME, Q::CATEGORY));
464 // The diagnostics for this query have already been
465 // promoted to the current session during
466 // try_mark_green(), so we can ignore them here.
467 let result = job.start(self, None, |tcx| {
468 // The dep-graph for this computation is already in
470 tcx.dep_graph.with_ignore(|| {
475 self.sess.profiler(|p| p.end_query(Q::NAME, Q::CATEGORY));
479 // If -Zincremental-verify-ich is specified, re-hash results from
480 // the cache and make sure that they have the expected fingerprint.
481 if unlikely!(self.sess.opts.debugging_opts.incremental_verify_ich) {
482 self.incremental_verify_ich::<Q>(&result, dep_node, dep_node_index);
485 if unlikely!(self.sess.opts.debugging_opts.query_dep_graph) {
486 self.dep_graph.mark_loaded_from_cache(dep_node_index, true);
489 job.complete(&result, dep_node_index);
496 fn incremental_verify_ich<Q: QueryDescription<'gcx>>(
500 dep_node_index: DepNodeIndex,
502 use crate::ich::Fingerprint;
504 assert!(Some(self.dep_graph.fingerprint_of(dep_node_index)) ==
505 self.dep_graph.prev_fingerprint_of(dep_node),
506 "Fingerprint for green query instance not loaded \
507 from cache: {:?}", dep_node);
509 debug!("BEGIN verify_ich({:?})", dep_node);
510 let mut hcx = self.create_stable_hashing_context();
512 let new_hash = Q::hash_result(&mut hcx, result).unwrap_or(Fingerprint::ZERO);
513 debug!("END verify_ich({:?})", dep_node);
515 let old_hash = self.dep_graph.fingerprint_of(dep_node_index);
517 assert!(new_hash == old_hash, "Found unstable fingerprints \
518 for {:?}", dep_node);
522 fn force_query_with_job<Q: QueryDescription<'gcx>>(
525 job: JobOwner<'_, 'gcx, Q>,
527 -> (Q::Value, DepNodeIndex) {
528 // If the following assertion triggers, it can have two reasons:
529 // 1. Something is wrong with DepNode creation, either here or
530 // in DepGraph::try_mark_green()
531 // 2. Two distinct query keys get mapped to the same DepNode
532 // (see for example #48923)
533 assert!(!self.dep_graph.dep_node_exists(&dep_node),
534 "Forcing query with already existing DepNode.\n\
539 profq_msg!(self, ProfileQueriesMsg::ProviderBegin);
540 self.sess.profiler(|p| p.start_query(Q::NAME, Q::CATEGORY));
542 let ((result, dep_node_index), diagnostics) = with_diagnostics(|diagnostics| {
543 job.start(self, diagnostics, |tcx| {
544 if dep_node.kind.is_eval_always() {
545 tcx.dep_graph.with_eval_always_task(dep_node,
551 tcx.dep_graph.with_task(dep_node,
560 self.sess.profiler(|p| p.end_query(Q::NAME, Q::CATEGORY));
561 profq_msg!(self, ProfileQueriesMsg::ProviderEnd);
563 if unlikely!(self.sess.opts.debugging_opts.query_dep_graph) {
564 self.dep_graph.mark_loaded_from_cache(dep_node_index, false);
567 if dep_node.kind != crate::dep_graph::DepKind::Null {
568 if unlikely!(!diagnostics.is_empty()) {
569 self.queries.on_disk_cache
570 .store_diagnostics(dep_node_index, diagnostics);
574 job.complete(&result, dep_node_index);
576 (result, dep_node_index)
579 /// Ensure that either this query has all green inputs or been executed.
580 /// Executing query::ensure(D) is considered a read of the dep-node D.
582 /// This function is particularly useful when executing passes for their
583 /// side-effects -- e.g., in order to report errors for erroneous programs.
585 /// Note: The optimization is only available during incr. comp.
586 pub(super) fn ensure_query<Q: QueryDescription<'gcx>>(self, key: Q::Key) -> () {
587 let dep_node = Q::to_dep_node(self, &key);
589 // Ensuring an "input" or anonymous query makes no sense
590 assert!(!dep_node.kind.is_anon());
591 assert!(!dep_node.kind.is_input());
592 if self.dep_graph.try_mark_green_and_read(self, &dep_node).is_none() {
593 // A None return from `try_mark_green_and_read` means that this is either
594 // a new dep node or that the dep node has already been marked red.
595 // Either way, we can't call `dep_graph.read()` as we don't have the
596 // DepNodeIndex. We must invoke the query itself. The performance cost
597 // this introduces should be negligible as we'll immediately hit the
598 // in-memory cache, or another query down the line will.
600 let _ = self.get_query::<Q>(DUMMY_SP, key);
602 profq_msg!(self, ProfileQueriesMsg::CacheHit);
603 self.sess.profiler(|p| p.record_query_hit(Q::NAME, Q::CATEGORY));
608 fn force_query<Q: QueryDescription<'gcx>>(
616 ProfileQueriesMsg::QueryBegin(span.data(), profq_query_msg!(Q::NAME, self, key))
619 // We may be concurrently trying both execute and force a query
620 // Ensure that only one of them runs the query
621 let job = match JobOwner::try_get(self, span, &key) {
622 TryGetJob::NotYetStarted(job) => job,
623 TryGetJob::JobCompleted(result) => {
624 if let Err(e) = result {
625 self.report_cycle(e).emit();
630 self.force_query_with_job::<Q>(key, job, dep_node);
633 pub(super) fn try_get_query<Q: QueryDescription<'gcx>>(
637 ) -> Result<Q::Value, Box<DiagnosticBuilder<'a>>> {
638 match self.try_get_with::<Q>(span, key) {
640 Err(e) => Err(self.report_cycle(e)),
644 // FIXME: Try uninlining this
646 pub(super) fn get_query<Q: QueryDescription<'gcx>>(
651 self.try_get_with::<Q>(span, key).unwrap_or_else(|e| {
652 self.emit_error::<Q>(e)
658 fn emit_error<Q: QueryDescription<'gcx>>(
660 e: Box<CycleError<'gcx>>,
662 self.report_cycle(e).emit();
663 Q::handle_cycle_error(self)
667 macro_rules! handle_cycle_error {
668 ([][$this: expr]) => {{
669 Value::from_cycle_error($this.global_tcx())
671 ([fatal_cycle$(, $modifiers:ident)*][$this:expr]) => {{
672 $this.sess.abort_if_errors();
675 ([$other:ident$(, $modifiers:ident)*][$($args:tt)*]) => {
676 handle_cycle_error!([$($modifiers),*][$($args)*])
680 macro_rules! hash_result {
681 ([][$hcx:expr, $result:expr]) => {{
682 dep_graph::hash_result($hcx, &$result)
684 ([no_hash$(, $modifiers:ident)*][$hcx:expr, $result:expr]) => {{
687 ([$other:ident$(, $modifiers:ident)*][$($args:tt)*]) => {
688 hash_result!([$($modifiers),*][$($args)*])
692 macro_rules! define_queries {
693 (<$tcx:tt> $($category:tt {
694 $($(#[$attr:meta])* [$($modifiers:tt)*] fn $name:ident: $node:ident($K:ty) -> $V:ty,)*
696 define_queries_inner! { <$tcx>
697 $($( $(#[$attr])* category<$category> [$($modifiers)*] fn $name: $node($K) -> $V,)*)*
702 macro_rules! define_queries_inner {
704 $($(#[$attr:meta])* category<$category:tt>
705 [$($modifiers:tt)*] fn $name:ident: $node:ident($K:ty) -> $V:ty,)*) => {
708 #[cfg(parallel_compiler)]
709 use ty::query::job::QueryResult;
710 use rustc_data_structures::sync::Lock;
712 rustc_data_structures::stable_hasher::HashStable,
713 rustc_data_structures::stable_hasher::StableHasherResult,
714 rustc_data_structures::stable_hasher::StableHasher,
715 ich::StableHashingContext
717 use crate::util::profiling::ProfileCategory;
719 define_queries_struct! {
721 input: ($(([$($modifiers)*] [$($attr)*] [$name]))*)
724 impl<$tcx> Queries<$tcx> {
726 providers: IndexVec<CrateNum, Providers<$tcx>>,
727 fallback_extern_providers: Providers<$tcx>,
728 on_disk_cache: OnDiskCache<'tcx>,
732 fallback_extern_providers: Box::new(fallback_extern_providers),
734 $($name: Default::default()),*
738 pub fn record_computed_queries(&self, sess: &Session) {
741 p.record_computed_queries(
742 <queries::$name<'_> as QueryConfig<'_>>::NAME,
743 <queries::$name<'_> as QueryConfig<'_>>::CATEGORY,
744 self.$name.lock().results.len()
750 #[cfg(parallel_compiler)]
751 pub fn collect_active_jobs(&self) -> Vec<Lrc<QueryJob<$tcx>>> {
752 let mut jobs = Vec::new();
754 // We use try_lock here since we are only called from the
755 // deadlock handler, and this shouldn't be locked
758 self.$name.try_lock().unwrap().active.values().filter_map(|v|
759 if let QueryResult::Started(ref job) = *v {
771 pub fn print_stats(&self) {
772 let mut queries = Vec::new();
779 key_type: &'static str,
781 value_type: &'static str,
785 fn stats<'tcx, Q: QueryConfig<'tcx>>(
787 map: &QueryCache<'tcx, Q>
791 #[cfg(debug_assertions)]
792 cache_hits: map.cache_hits,
793 #[cfg(not(debug_assertions))]
795 key_size: mem::size_of::<Q::Key>(),
796 key_type: unsafe { type_name::<Q::Key>() },
797 value_size: mem::size_of::<Q::Value>(),
798 value_type: unsafe { type_name::<Q::Value>() },
799 entry_count: map.results.len(),
804 queries.push(stats::<queries::$name<'_>>(
810 if cfg!(debug_assertions) {
811 let hits: usize = queries.iter().map(|s| s.cache_hits).sum();
812 let results: usize = queries.iter().map(|s| s.entry_count).sum();
813 println!("\nQuery cache hit rate: {}", hits as f64 / (hits + results) as f64);
816 let mut query_key_sizes = queries.clone();
817 query_key_sizes.sort_by_key(|q| q.key_size);
818 println!("\nLarge query keys:");
819 for q in query_key_sizes.iter().rev()
820 .filter(|q| q.key_size > 8) {
822 " {} - {} x {} - {}",
830 let mut query_value_sizes = queries.clone();
831 query_value_sizes.sort_by_key(|q| q.value_size);
832 println!("\nLarge query values:");
833 for q in query_value_sizes.iter().rev()
834 .filter(|q| q.value_size > 8) {
836 " {} - {} x {} - {}",
844 if cfg!(debug_assertions) {
845 let mut query_cache_hits = queries.clone();
846 query_cache_hits.sort_by_key(|q| q.cache_hits);
847 println!("\nQuery cache hits:");
848 for q in query_cache_hits.iter().rev() {
853 q.cache_hits as f64 / (q.cache_hits + q.entry_count) as f64
858 let mut query_value_count = queries.clone();
859 query_value_count.sort_by_key(|q| q.entry_count);
860 println!("\nQuery value count:");
861 for q in query_value_count.iter().rev() {
862 println!(" {} - {}", q.name, q.entry_count);
867 #[allow(nonstandard_style)]
868 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
869 pub enum Query<$tcx> {
870 $($(#[$attr])* $name($K)),*
873 impl<$tcx> Query<$tcx> {
874 pub fn name(&self) -> &'static str {
876 $(Query::$name(_) => stringify!($name),)*
880 pub fn describe(&self, tcx: TyCtxt<'_, '_, '_>) -> Cow<'static, str> {
881 let (r, name) = match *self {
882 $(Query::$name(key) => {
883 (queries::$name::describe(tcx, key), stringify!($name))
886 if tcx.sess.verbose() {
887 format!("{} [{}]", r, name).into()
893 // FIXME(eddyb) Get more valid Span's on queries.
894 pub fn default_span(&self, tcx: TyCtxt<'_, $tcx, '_>, span: Span) -> Span {
895 if !span.is_dummy() {
898 // The def_span query is used to calculate default_span,
899 // so exit to avoid infinite recursion
900 if let Query::def_span(..) = *self {
904 $(Query::$name(key) => key.default_span(tcx),)*
909 impl<'a, $tcx> HashStable<StableHashingContext<'a>> for Query<$tcx> {
910 fn hash_stable<W: StableHasherResult>(&self,
911 hcx: &mut StableHashingContext<'a>,
912 hasher: &mut StableHasher<W>) {
913 mem::discriminant(self).hash_stable(hcx, hasher);
915 $(Query::$name(key) => key.hash_stable(hcx, hasher),)*
921 use std::marker::PhantomData;
923 $(#[allow(nonstandard_style)]
924 pub struct $name<$tcx> {
925 data: PhantomData<&$tcx ()>
929 // This module and the functions in it exist only to provide a
930 // predictable symbol name prefix for query providers. This is helpful
931 // for analyzing queries in profilers.
932 pub(super) mod __query_compute {
934 pub fn $name<F: FnOnce() -> R, R>(f: F) -> R {
939 $(impl<$tcx> QueryConfig<$tcx> for queries::$name<$tcx> {
943 const NAME: &'static str = stringify!($name);
944 const CATEGORY: ProfileCategory = $category;
947 impl<$tcx> QueryAccessors<$tcx> for queries::$name<$tcx> {
949 fn query(key: Self::Key) -> Query<'tcx> {
954 fn query_cache<'a>(tcx: TyCtxt<'a, $tcx, '_>) -> &'a Lock<QueryCache<$tcx, Self>> {
960 fn to_dep_node(tcx: TyCtxt<'_, $tcx, '_>, key: &Self::Key) -> DepNode {
961 use crate::dep_graph::DepConstructor::*;
963 DepNode::new(tcx, $node(*key))
967 fn compute(tcx: TyCtxt<'_, 'tcx, '_>, key: Self::Key) -> Self::Value {
968 __query_compute::$name(move || {
969 let provider = tcx.queries.providers.get(key.query_crate())
970 // HACK(eddyb) it's possible crates may be loaded after
971 // the query engine is created, and because crate loading
972 // is not yet integrated with the query engine, such crates
973 // would be missing appropriate entries in `providers`.
974 .unwrap_or(&tcx.queries.fallback_extern_providers)
976 provider(tcx.global_tcx(), key)
981 _hcx: &mut StableHashingContext<'_>,
982 _result: &Self::Value
983 ) -> Option<Fingerprint> {
984 hash_result!([$($modifiers)*][_hcx, _result])
987 fn handle_cycle_error(tcx: TyCtxt<'_, 'tcx, '_>) -> Self::Value {
988 handle_cycle_error!([$($modifiers)*][tcx])
992 #[derive(Copy, Clone)]
993 pub struct TyCtxtEnsure<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
994 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
997 impl<'a, $tcx, 'lcx> TyCtxtEnsure<'a, $tcx, 'lcx> {
1000 pub fn $name(self, key: $K) {
1001 self.tcx.ensure_query::<queries::$name<'_>>(key)
1005 #[derive(Copy, Clone)]
1006 pub struct TyCtxtAt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1007 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1011 impl<'a, 'gcx, 'tcx> Deref for TyCtxtAt<'a, 'gcx, 'tcx> {
1012 type Target = TyCtxt<'a, 'gcx, 'tcx>;
1014 fn deref(&self) -> &Self::Target {
1019 impl<'a, $tcx, 'lcx> TyCtxt<'a, $tcx, 'lcx> {
1020 /// Returns a transparent wrapper for `TyCtxt`, which ensures queries
1021 /// are executed instead of just returing their results.
1023 pub fn ensure(self) -> TyCtxtEnsure<'a, $tcx, 'lcx> {
1029 /// Returns a transparent wrapper for `TyCtxt` which uses
1030 /// `span` as the location of queries performed through it.
1032 pub fn at(self, span: Span) -> TyCtxtAt<'a, $tcx, 'lcx> {
1041 pub fn $name(self, key: $K) -> $V {
1042 self.at(DUMMY_SP).$name(key)
1046 impl<'a, $tcx, 'lcx> TyCtxtAt<'a, $tcx, 'lcx> {
1049 pub fn $name(self, key: $K) -> $V {
1050 self.tcx.get_query::<queries::$name<'_>>(self.span, key)
1054 define_provider_struct! {
1056 input: ($(([$($modifiers)*] [$name] [$K] [$V]))*)
1059 impl<$tcx> Copy for Providers<$tcx> {}
1060 impl<$tcx> Clone for Providers<$tcx> {
1061 fn clone(&self) -> Self { *self }
1066 macro_rules! define_queries_struct {
1068 input: ($(([$($modifiers:tt)*] [$($attr:tt)*] [$name:ident]))*)) => {
1069 pub struct Queries<$tcx> {
1070 /// This provides access to the incrimental comilation on-disk cache for query results.
1071 /// Do not access this directly. It is only meant to be used by
1072 /// `DepGraph::try_mark_green()` and the query infrastructure.
1073 pub(crate) on_disk_cache: OnDiskCache<'tcx>,
1075 providers: IndexVec<CrateNum, Providers<$tcx>>,
1076 fallback_extern_providers: Box<Providers<$tcx>>,
1078 $($(#[$attr])* $name: Lock<QueryCache<$tcx, queries::$name<$tcx>>>,)*
1083 macro_rules! define_provider_struct {
1085 input: ($(([$($modifiers:tt)*] [$name:ident] [$K:ty] [$R:ty]))*)) => {
1086 pub struct Providers<$tcx> {
1087 $(pub $name: for<'a> fn(TyCtxt<'a, $tcx, $tcx>, $K) -> $R,)*
1090 impl<$tcx> Default for Providers<$tcx> {
1091 fn default() -> Self {
1092 $(fn $name<'a, $tcx>(_: TyCtxt<'a, $tcx, $tcx>, key: $K) -> $R {
1093 bug!("tcx.{}({:?}) unsupported by its crate",
1094 stringify!($name), key);
1096 Providers { $($name),* }
1103 /// The red/green evaluation system will try to mark a specific DepNode in the
1104 /// dependency graph as green by recursively trying to mark the dependencies of
1105 /// that DepNode as green. While doing so, it will sometimes encounter a DepNode
1106 /// where we don't know if it is red or green and we therefore actually have
1107 /// to recompute its value in order to find out. Since the only piece of
1108 /// information that we have at that point is the DepNode we are trying to
1109 /// re-evaluate, we need some way to re-run a query from just that. This is what
1110 /// `force_from_dep_node()` implements.
1112 /// In the general case, a DepNode consists of a DepKind and an opaque
1113 /// GUID/fingerprint that will uniquely identify the node. This GUID/fingerprint
1114 /// is usually constructed by computing a stable hash of the query-key that the
1115 /// DepNode corresponds to. Consequently, it is not in general possible to go
1116 /// back from hash to query-key (since hash functions are not reversible). For
1117 /// this reason `force_from_dep_node()` is expected to fail from time to time
1118 /// because we just cannot find out, from the DepNode alone, what the
1119 /// corresponding query-key is and therefore cannot re-run the query.
1121 /// The system deals with this case letting `try_mark_green` fail which forces
1122 /// the root query to be re-evaluated.
1124 /// Now, if force_from_dep_node() would always fail, it would be pretty useless.
1125 /// Fortunately, we can use some contextual information that will allow us to
1126 /// reconstruct query-keys for certain kinds of `DepNode`s. In particular, we
1127 /// enforce by construction that the GUID/fingerprint of certain `DepNode`s is a
1128 /// valid `DefPathHash`. Since we also always build a huge table that maps every
1129 /// `DefPathHash` in the current codebase to the corresponding `DefId`, we have
1130 /// everything we need to re-run the query.
1132 /// Take the `mir_validated` query as an example. Like many other queries, it
1133 /// just has a single parameter: the `DefId` of the item it will compute the
1134 /// validated MIR for. Now, when we call `force_from_dep_node()` on a `DepNode`
1135 /// with kind `MirValidated`, we know that the GUID/fingerprint of the `DepNode`
1136 /// is actually a `DefPathHash`, and can therefore just look up the corresponding
1137 /// `DefId` in `tcx.def_path_hash_to_def_id`.
1139 /// When you implement a new query, it will likely have a corresponding new
1140 /// `DepKind`, and you'll have to support it here in `force_from_dep_node()`. As
1141 /// a rule of thumb, if your query takes a `DefId` or `DefIndex` as sole parameter,
1142 /// then `force_from_dep_node()` should not fail for it. Otherwise, you can just
1143 /// add it to the "We don't have enough information to reconstruct..." group in
1144 /// the match below.
1145 pub fn force_from_dep_node<'a, 'gcx, 'lcx>(tcx: TyCtxt<'a, 'gcx, 'lcx>,
1148 use crate::hir::def_id::LOCAL_CRATE;
1150 // We must avoid ever having to call force_from_dep_node() for a
1151 // DepNode::CodegenUnit:
1152 // Since we cannot reconstruct the query key of a DepNode::CodegenUnit, we
1153 // would always end up having to evaluate the first caller of the
1154 // `codegen_unit` query that *is* reconstructible. This might very well be
1155 // the `compile_codegen_unit` query, thus re-codegenning the whole CGU just
1156 // to re-trigger calling the `codegen_unit` query with the right key. At
1157 // that point we would already have re-done all the work we are trying to
1158 // avoid doing in the first place.
1159 // The solution is simple: Just explicitly call the `codegen_unit` query for
1160 // each CGU, right after partitioning. This way `try_mark_green` will always
1161 // hit the cache instead of having to go through `force_from_dep_node`.
1162 // This assertion makes sure, we actually keep applying the solution above.
1163 debug_assert!(dep_node.kind != DepKind::CodegenUnit,
1164 "calling force_from_dep_node() on DepKind::CodegenUnit");
1166 if !dep_node.kind.can_reconstruct_query_key() {
1170 macro_rules! def_id {
1172 if let Some(def_id) = dep_node.extract_def_id(tcx) {
1175 // return from the whole function
1181 macro_rules! krate {
1182 () => { (def_id!()).krate }
1185 macro_rules! force {
1186 ($query:ident, $key:expr) => {
1188 tcx.force_query::<crate::ty::query::queries::$query<'_>>($key, DUMMY_SP, *dep_node);
1193 // FIXME(#45015): We should try move this boilerplate code into a macro
1195 match dep_node.kind {
1196 // These are inputs that are expected to be pre-allocated and that
1197 // should therefore always be red or green already
1198 DepKind::AllLocalTraitImpls |
1200 DepKind::CrateMetadata |
1204 // This are anonymous nodes
1205 DepKind::TraitSelect |
1207 // We don't have enough information to reconstruct the query key of
1212 DepKind::NeedsDrop |
1214 DepKind::ConstEval |
1215 DepKind::ConstEvalRaw |
1216 DepKind::InstanceSymbolName |
1218 DepKind::BorrowCheckKrate |
1219 DepKind::Specializes |
1220 DepKind::ImplementationsOfTrait |
1221 DepKind::TypeParamPredicates |
1222 DepKind::CodegenUnit |
1223 DepKind::CompileCodegenUnit |
1224 DepKind::FulfillObligation |
1225 DepKind::VtableMethods |
1226 DepKind::EraseRegionsTy |
1227 DepKind::NormalizeProjectionTy |
1228 DepKind::NormalizeTyAfterErasingRegions |
1229 DepKind::ImpliedOutlivesBounds |
1230 DepKind::DropckOutlives |
1231 DepKind::EvaluateObligation |
1232 DepKind::EvaluateGoal |
1233 DepKind::TypeOpAscribeUserType |
1235 DepKind::TypeOpSubtype |
1236 DepKind::TypeOpProvePredicate |
1237 DepKind::TypeOpNormalizeTy |
1238 DepKind::TypeOpNormalizePredicate |
1239 DepKind::TypeOpNormalizePolyFnSig |
1240 DepKind::TypeOpNormalizeFnSig |
1241 DepKind::SubstituteNormalizeAndTestPredicates |
1242 DepKind::MethodAutoderefSteps |
1243 DepKind::InstanceDefSizeEstimate |
1244 DepKind::ProgramClausesForEnv |
1246 // This one should never occur in this context
1248 bug!("force_from_dep_node() - Encountered {:?}", dep_node)
1251 // These are not queries
1252 DepKind::CoherenceCheckTrait |
1253 DepKind::ItemVarianceConstraints => {
1257 DepKind::RegionScopeTree => { force!(region_scope_tree, def_id!()); }
1259 DepKind::Coherence => { force!(crate_inherent_impls, LOCAL_CRATE); }
1260 DepKind::CoherenceInherentImplOverlapCheck => {
1261 force!(crate_inherent_impls_overlap_check, LOCAL_CRATE)
1263 DepKind::PrivacyAccessLevels => { force!(privacy_access_levels, LOCAL_CRATE); }
1264 DepKind::MirBuilt => { force!(mir_built, def_id!()); }
1265 DepKind::MirConstQualif => { force!(mir_const_qualif, def_id!()); }
1266 DepKind::MirConst => { force!(mir_const, def_id!()); }
1267 DepKind::MirValidated => { force!(mir_validated, def_id!()); }
1268 DepKind::MirOptimized => { force!(optimized_mir, def_id!()); }
1270 DepKind::BorrowCheck => { force!(borrowck, def_id!()); }
1271 DepKind::MirBorrowCheck => { force!(mir_borrowck, def_id!()); }
1272 DepKind::UnsafetyCheckResult => { force!(unsafety_check_result, def_id!()); }
1273 DepKind::UnsafeDeriveOnReprPacked => { force!(unsafe_derive_on_repr_packed, def_id!()); }
1274 DepKind::CheckModAttrs => { force!(check_mod_attrs, def_id!()); }
1275 DepKind::CheckModLoops => { force!(check_mod_loops, def_id!()); }
1276 DepKind::CheckModUnstableApiUsage => { force!(check_mod_unstable_api_usage, def_id!()); }
1277 DepKind::CheckModItemTypes => { force!(check_mod_item_types, def_id!()); }
1278 DepKind::CheckModPrivacy => { force!(check_mod_privacy, def_id!()); }
1279 DepKind::CheckModIntrinsics => { force!(check_mod_intrinsics, def_id!()); }
1280 DepKind::CheckModLiveness => { force!(check_mod_liveness, def_id!()); }
1281 DepKind::CheckModImplWf => { force!(check_mod_impl_wf, def_id!()); }
1282 DepKind::CollectModItemTypes => { force!(collect_mod_item_types, def_id!()); }
1283 DepKind::Reachability => { force!(reachable_set, LOCAL_CRATE); }
1284 DepKind::MirKeys => { force!(mir_keys, LOCAL_CRATE); }
1285 DepKind::CrateVariances => { force!(crate_variances, LOCAL_CRATE); }
1286 DepKind::AssociatedItems => { force!(associated_item, def_id!()); }
1287 DepKind::TypeOfItem => { force!(type_of, def_id!()); }
1288 DepKind::GenericsOfItem => { force!(generics_of, def_id!()); }
1289 DepKind::PredicatesOfItem => { force!(predicates_of, def_id!()); }
1290 DepKind::PredicatesDefinedOnItem => { force!(predicates_defined_on, def_id!()); }
1291 DepKind::ExplicitPredicatesOfItem => { force!(explicit_predicates_of, def_id!()); }
1292 DepKind::InferredOutlivesOf => { force!(inferred_outlives_of, def_id!()); }
1293 DepKind::InferredOutlivesCrate => { force!(inferred_outlives_crate, LOCAL_CRATE); }
1294 DepKind::SuperPredicatesOfItem => { force!(super_predicates_of, def_id!()); }
1295 DepKind::TraitDefOfItem => { force!(trait_def, def_id!()); }
1296 DepKind::AdtDefOfItem => { force!(adt_def, def_id!()); }
1297 DepKind::ImplTraitRef => { force!(impl_trait_ref, def_id!()); }
1298 DepKind::ImplPolarity => { force!(impl_polarity, def_id!()); }
1299 DepKind::Issue33140SelfTy => { force!(issue33140_self_ty, def_id!()); }
1300 DepKind::FnSignature => { force!(fn_sig, def_id!()); }
1301 DepKind::CoerceUnsizedInfo => { force!(coerce_unsized_info, def_id!()); }
1302 DepKind::ItemVariances => { force!(variances_of, def_id!()); }
1303 DepKind::IsConstFn => { force!(is_const_fn_raw, def_id!()); }
1304 DepKind::IsPromotableConstFn => { force!(is_promotable_const_fn, def_id!()); }
1305 DepKind::IsForeignItem => { force!(is_foreign_item, def_id!()); }
1306 DepKind::SizedConstraint => { force!(adt_sized_constraint, def_id!()); }
1307 DepKind::DtorckConstraint => { force!(adt_dtorck_constraint, def_id!()); }
1308 DepKind::AdtDestructor => { force!(adt_destructor, def_id!()); }
1309 DepKind::AssociatedItemDefIds => { force!(associated_item_def_ids, def_id!()); }
1310 DepKind::InherentImpls => { force!(inherent_impls, def_id!()); }
1311 DepKind::TypeckBodiesKrate => { force!(typeck_item_bodies, LOCAL_CRATE); }
1312 DepKind::TypeckTables => { force!(typeck_tables_of, def_id!()); }
1313 DepKind::UsedTraitImports => { force!(used_trait_imports, def_id!()); }
1314 DepKind::HasTypeckTables => { force!(has_typeck_tables, def_id!()); }
1315 DepKind::SymbolName => { force!(def_symbol_name, def_id!()); }
1316 DepKind::SpecializationGraph => { force!(specialization_graph_of, def_id!()); }
1317 DepKind::ObjectSafety => { force!(is_object_safe, def_id!()); }
1318 DepKind::TraitImpls => { force!(trait_impls_of, def_id!()); }
1319 DepKind::CheckMatch => { force!(check_match, def_id!()); }
1321 DepKind::ParamEnv => { force!(param_env, def_id!()); }
1322 DepKind::Environment => { force!(environment, def_id!()); }
1323 DepKind::DescribeDef => { force!(describe_def, def_id!()); }
1324 DepKind::DefSpan => { force!(def_span, def_id!()); }
1325 DepKind::LookupStability => { force!(lookup_stability, def_id!()); }
1326 DepKind::LookupDeprecationEntry => {
1327 force!(lookup_deprecation_entry, def_id!());
1329 DepKind::ConstIsRvaluePromotableToStatic => {
1330 force!(const_is_rvalue_promotable_to_static, def_id!());
1332 DepKind::RvaluePromotableMap => { force!(rvalue_promotable_map, def_id!()); }
1333 DepKind::ImplParent => { force!(impl_parent, def_id!()); }
1334 DepKind::TraitOfItem => { force!(trait_of_item, def_id!()); }
1335 DepKind::IsReachableNonGeneric => { force!(is_reachable_non_generic, def_id!()); }
1336 DepKind::IsUnreachableLocalDefinition => {
1337 force!(is_unreachable_local_definition, def_id!());
1339 DepKind::IsMirAvailable => { force!(is_mir_available, def_id!()); }
1340 DepKind::ItemAttrs => { force!(item_attrs, def_id!()); }
1341 DepKind::CodegenFnAttrs => { force!(codegen_fn_attrs, def_id!()); }
1342 DepKind::FnArgNames => { force!(fn_arg_names, def_id!()); }
1343 DepKind::RenderedConst => { force!(rendered_const, def_id!()); }
1344 DepKind::DylibDepFormats => { force!(dylib_dependency_formats, krate!()); }
1345 DepKind::IsPanicRuntime => { force!(is_panic_runtime, krate!()); }
1346 DepKind::IsCompilerBuiltins => { force!(is_compiler_builtins, krate!()); }
1347 DepKind::HasGlobalAllocator => { force!(has_global_allocator, krate!()); }
1348 DepKind::HasPanicHandler => { force!(has_panic_handler, krate!()); }
1349 DepKind::ExternCrate => { force!(extern_crate, def_id!()); }
1350 DepKind::LintLevels => { force!(lint_levels, LOCAL_CRATE); }
1351 DepKind::InScopeTraits => { force!(in_scope_traits_map, def_id!().index); }
1352 DepKind::ModuleExports => { force!(module_exports, def_id!()); }
1353 DepKind::IsSanitizerRuntime => { force!(is_sanitizer_runtime, krate!()); }
1354 DepKind::IsProfilerRuntime => { force!(is_profiler_runtime, krate!()); }
1355 DepKind::GetPanicStrategy => { force!(panic_strategy, krate!()); }
1356 DepKind::IsNoBuiltins => { force!(is_no_builtins, krate!()); }
1357 DepKind::ImplDefaultness => { force!(impl_defaultness, def_id!()); }
1358 DepKind::CheckItemWellFormed => { force!(check_item_well_formed, def_id!()); }
1359 DepKind::CheckTraitItemWellFormed => { force!(check_trait_item_well_formed, def_id!()); }
1360 DepKind::CheckImplItemWellFormed => { force!(check_impl_item_well_formed, def_id!()); }
1361 DepKind::ReachableNonGenerics => { force!(reachable_non_generics, krate!()); }
1362 DepKind::NativeLibraries => { force!(native_libraries, krate!()); }
1363 DepKind::EntryFn => { force!(entry_fn, krate!()); }
1364 DepKind::PluginRegistrarFn => { force!(plugin_registrar_fn, krate!()); }
1365 DepKind::ProcMacroDeclsStatic => { force!(proc_macro_decls_static, krate!()); }
1366 DepKind::CrateDisambiguator => { force!(crate_disambiguator, krate!()); }
1367 DepKind::CrateHash => { force!(crate_hash, krate!()); }
1368 DepKind::OriginalCrateName => { force!(original_crate_name, krate!()); }
1369 DepKind::ExtraFileName => { force!(extra_filename, krate!()); }
1371 DepKind::AllTraitImplementations => {
1372 force!(all_trait_implementations, krate!());
1375 DepKind::DllimportForeignItems => {
1376 force!(dllimport_foreign_items, krate!());
1378 DepKind::IsDllimportForeignItem => {
1379 force!(is_dllimport_foreign_item, def_id!());
1381 DepKind::IsStaticallyIncludedForeignItem => {
1382 force!(is_statically_included_foreign_item, def_id!());
1384 DepKind::NativeLibraryKind => { force!(native_library_kind, def_id!()); }
1385 DepKind::LinkArgs => { force!(link_args, LOCAL_CRATE); }
1387 DepKind::ResolveLifetimes => { force!(resolve_lifetimes, krate!()); }
1388 DepKind::NamedRegion => { force!(named_region_map, def_id!().index); }
1389 DepKind::IsLateBound => { force!(is_late_bound_map, def_id!().index); }
1390 DepKind::ObjectLifetimeDefaults => {
1391 force!(object_lifetime_defaults_map, def_id!().index);
1394 DepKind::Visibility => { force!(visibility, def_id!()); }
1395 DepKind::DepKind => { force!(dep_kind, krate!()); }
1396 DepKind::CrateName => { force!(crate_name, krate!()); }
1397 DepKind::ItemChildren => { force!(item_children, def_id!()); }
1398 DepKind::ExternModStmtCnum => { force!(extern_mod_stmt_cnum, def_id!()); }
1399 DepKind::GetLibFeatures => { force!(get_lib_features, LOCAL_CRATE); }
1400 DepKind::DefinedLibFeatures => { force!(defined_lib_features, krate!()); }
1401 DepKind::GetLangItems => { force!(get_lang_items, LOCAL_CRATE); }
1402 DepKind::DefinedLangItems => { force!(defined_lang_items, krate!()); }
1403 DepKind::MissingLangItems => { force!(missing_lang_items, krate!()); }
1404 DepKind::VisibleParentMap => { force!(visible_parent_map, LOCAL_CRATE); }
1405 DepKind::MissingExternCrateItem => {
1406 force!(missing_extern_crate_item, krate!());
1408 DepKind::UsedCrateSource => { force!(used_crate_source, krate!()); }
1409 DepKind::PostorderCnums => { force!(postorder_cnums, LOCAL_CRATE); }
1411 DepKind::Freevars => { force!(freevars, def_id!()); }
1412 DepKind::MaybeUnusedTraitImport => {
1413 force!(maybe_unused_trait_import, def_id!());
1415 DepKind::NamesImportedByGlobUse => { force!(names_imported_by_glob_use, def_id!()); }
1416 DepKind::MaybeUnusedExternCrates => { force!(maybe_unused_extern_crates, LOCAL_CRATE); }
1417 DepKind::StabilityIndex => { force!(stability_index, LOCAL_CRATE); }
1418 DepKind::AllTraits => { force!(all_traits, LOCAL_CRATE); }
1419 DepKind::AllCrateNums => { force!(all_crate_nums, LOCAL_CRATE); }
1420 DepKind::ExportedSymbols => { force!(exported_symbols, krate!()); }
1421 DepKind::CollectAndPartitionMonoItems => {
1422 force!(collect_and_partition_mono_items, LOCAL_CRATE);
1424 DepKind::IsCodegenedItem => { force!(is_codegened_item, def_id!()); }
1425 DepKind::OutputFilenames => { force!(output_filenames, LOCAL_CRATE); }
1427 DepKind::TargetFeaturesWhitelist => { force!(target_features_whitelist, LOCAL_CRATE); }
1429 DepKind::Features => { force!(features_query, LOCAL_CRATE); }
1431 DepKind::ProgramClausesFor => { force!(program_clauses_for, def_id!()); }
1432 DepKind::WasmImportModuleMap => { force!(wasm_import_module_map, krate!()); }
1433 DepKind::ForeignModules => { force!(foreign_modules, krate!()); }
1435 DepKind::UpstreamMonomorphizations => {
1436 force!(upstream_monomorphizations, krate!());
1438 DepKind::UpstreamMonomorphizationsFor => {
1439 force!(upstream_monomorphizations_for, def_id!());
1441 DepKind::BackendOptimizationLevel => {
1442 force!(backend_optimization_level, krate!());
1450 // FIXME(#45015): Another piece of boilerplate code that could be generated in
1451 // a combined define_dep_nodes!()/define_queries!() macro.
1452 macro_rules! impl_load_from_cache {
1453 ($($dep_kind:ident => $query_name:ident,)*) => {
1455 // Check whether the query invocation corresponding to the given
1456 // DepNode is eligible for on-disk-caching.
1457 pub fn cache_on_disk(&self, tcx: TyCtxt<'_, '_, '_>) -> bool {
1458 use crate::ty::query::queries;
1459 use crate::ty::query::QueryDescription;
1462 $(DepKind::$dep_kind => {
1463 let def_id = self.extract_def_id(tcx).unwrap();
1464 queries::$query_name::cache_on_disk(tcx.global_tcx(), def_id)
1470 // This is method will execute the query corresponding to the given
1471 // DepNode. It is only expected to work for DepNodes where the
1472 // above `cache_on_disk` methods returns true.
1473 // Also, as a sanity check, it expects that the corresponding query
1474 // invocation has been marked as green already.
1475 pub fn load_from_on_disk_cache(&self, tcx: TyCtxt<'_, '_, '_>) {
1477 $(DepKind::$dep_kind => {
1478 debug_assert!(tcx.dep_graph
1480 .map(|c| c.is_green())
1483 let def_id = self.extract_def_id(tcx).unwrap();
1484 let _ = tcx.$query_name(def_id);
1495 impl_load_from_cache!(
1496 TypeckTables => typeck_tables_of,
1497 MirOptimized => optimized_mir,
1498 UnsafetyCheckResult => unsafety_check_result,
1499 BorrowCheck => borrowck,
1500 MirBorrowCheck => mir_borrowck,
1501 MirConstQualif => mir_const_qualif,
1502 SymbolName => def_symbol_name,
1503 ConstIsRvaluePromotableToStatic => const_is_rvalue_promotable_to_static,
1504 CheckMatch => check_match,
1505 TypeOfItem => type_of,
1506 GenericsOfItem => generics_of,
1507 PredicatesOfItem => predicates_of,
1508 UsedTraitImports => used_trait_imports,
1509 CodegenFnAttrs => codegen_fn_attrs,
1510 SpecializationGraph => specialization_graph_of,