提交 5841c687 编写于 作者: J John Kåre Alsaker

Improve query cycle error message

上级 21f6e55c
......@@ -31,6 +31,7 @@ pub(super) enum QueryResult<'tcx, T> {
/// A span and a query key
#[derive(Clone, Debug)]
pub struct QueryInfo<'tcx> {
/// The span for a reason this query was required
pub span: Span,
pub query: Query<'tcx>,
}
......@@ -73,13 +74,22 @@ pub(super) fn await<'lcx>(
cycle.insert(0, job.info.clone());
if &*job as *const _ == self as *const _ {
break;
// This is the end of the cycle
// The span entry we included was for the usage
// of the cycle itself, and not part of the cycle
// Replace it with the span which caused the cycle to form
cycle[0].span = span;
// Find out why the cycle itself was used
let usage = job.parent.as_ref().map(|parent| {
(job.info.span, parent.info.query.clone())
});
return Err(CycleError { usage, cycle });
}
current_job = job.parent.clone();
}
Err(CycleError { span, cycle })
panic!("did not find a cycle")
}
/// Signals to waiters that the query is complete.
......
......@@ -64,8 +64,8 @@ fn get_cache_internal<'a>(tcx: TyCtxt<'a, 'tcx, 'tcx>)
#[derive(Clone)]
pub(super) struct CycleError<'tcx> {
/// The span of the reason the first query in `cycle` ran the last query in `cycle`
pub(super) span: Span,
/// The query and related span which uses the cycle
pub(super) usage: Option<(Span, Query<'tcx>)>,
pub(super) cycle: Vec<QueryInfo<'tcx>>,
}
......@@ -81,7 +81,7 @@ pub(super) enum TryGetLock<'a, 'tcx: 'a, T, D: QueryDescription<'tcx> + 'a> {
}
impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
pub(super) fn report_cycle(self, CycleError { span, cycle: stack }: CycleError<'gcx>)
pub(super) fn report_cycle(self, CycleError { usage, cycle: stack }: CycleError<'gcx>)
-> DiagnosticBuilder<'a>
{
assert!(!stack.is_empty());
......@@ -95,23 +95,27 @@ pub(super) fn report_cycle(self, CycleError { span, cycle: stack }: CycleError<'
// (And cycle errors around impls tend to occur during the
// collect/coherence phases anyhow.)
item_path::with_forced_impl_filename_line(|| {
let span = fix_span(span, &stack.first().unwrap().query);
let mut err =
struct_span_err!(self.sess, span, E0391,
"cyclic dependency detected");
err.span_label(span, "cyclic reference");
err.span_note(fix_span(stack[0].span, &stack[0].query),
&format!("the cycle begins when {}...", stack[0].query.describe(self)));
for &QueryInfo { span, ref query, .. } in &stack[1..] {
err.span_note(fix_span(span, query),
&format!("...which then requires {}...", query.describe(self)));
let span = fix_span(stack[1 % stack.len()].span, &stack[0].query);
let mut err = struct_span_err!(self.sess,
span,
E0391,
"cycle detected when {}",
stack[0].query.describe(self));
for i in 1..stack.len() {
let query = &stack[i].query;
let span = fix_span(stack[(i + 1) % stack.len()].span, query);
err.span_note(span, &format!("...which requires {}...", query.describe(self)));
}
err.note(&format!("...which then again requires {}, completing the cycle.",
err.note(&format!("...which again requires {}, completing the cycle",
stack[0].query.describe(self)));
if let Some((span, query)) = usage {
err.span_note(fix_span(span, &query),
&format!("cycle used when {}", query.describe(self)));
}
return err
})
}
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册