rustc_resolve: ignore uniform_paths canaries that resolve to an import of the same crate.

This commit is contained in:
Eduard-Mihai Burtescu 2018-09-10 08:47:40 +03:00
parent 0a33de04cf
commit d5da94a3b1
4 changed files with 72 additions and 43 deletions

View File

@ -199,22 +199,6 @@ impl<'a, 'cl> Resolver<'a, 'cl> {
if emit_uniform_paths_canary { if emit_uniform_paths_canary {
let source = prefix_start.unwrap(); let source = prefix_start.unwrap();
// HACK(eddyb) For `use x::{self, ...};`, use the ID of the
// `self` nested import for the canary. This allows the
// ambiguity reporting scope to ignore false positives
// in the same way it does for `use x;` (by comparing IDs).
let mut canary_id = id;
if let ast::UseTreeKind::Nested(ref items) = use_tree.kind {
for &(ref use_tree, id) in items {
if let ast::UseTreeKind::Simple(..) = use_tree.kind {
if use_tree.ident().name == keywords::SelfValue.name() {
canary_id = id;
break;
}
}
}
}
// Helper closure to emit a canary with the given base path. // Helper closure to emit a canary with the given base path.
let emit = |this: &mut Self, base: Option<Ident>| { let emit = |this: &mut Self, base: Option<Ident>| {
let subclass = SingleImport { let subclass = SingleImport {
@ -234,7 +218,7 @@ impl<'a, 'cl> Resolver<'a, 'cl> {
base.into_iter().collect(), base.into_iter().collect(),
subclass.clone(), subclass.clone(),
source.span, source.span,
canary_id, id,
root_use_tree.span, root_use_tree.span,
root_id, root_id,
ty::Visibility::Invisible, ty::Visibility::Invisible,

View File

@ -620,9 +620,9 @@ impl<'a, 'b:'a, 'c: 'b> ImportResolver<'a, 'b, 'c> {
} }
#[derive(Default)] #[derive(Default)]
struct UniformPathsCanaryResult { struct UniformPathsCanaryResult<'a> {
module_scope: Option<Span>, module_scope: Option<&'a NameBinding<'a>>,
block_scopes: Vec<Span>, block_scopes: Vec<&'a NameBinding<'a>>,
} }
// Collect all tripped `uniform_paths` canaries separately. // Collect all tripped `uniform_paths` canaries separately.
let mut uniform_paths_canaries: BTreeMap< let mut uniform_paths_canaries: BTreeMap<
@ -661,20 +661,12 @@ impl<'a, 'b:'a, 'c: 'b> ImportResolver<'a, 'b, 'c> {
self.per_ns(|_, ns| { self.per_ns(|_, ns| {
if let Some(result) = result[ns].get().ok() { if let Some(result) = result[ns].get().ok() {
if let NameBindingKind::Import { directive, .. } = result.kind {
// Skip canaries that resolve to the import itself.
// These come from `use crate_name;`, which isn't really
// ambiguous, as the import can't actually shadow itself.
if directive.id == import.id {
return;
}
}
if has_explicit_self { if has_explicit_self {
// There should only be one `self::x` (module-scoped) canary. // There should only be one `self::x` (module-scoped) canary.
assert_eq!(canary_results[ns].module_scope, None); assert!(canary_results[ns].module_scope.is_none());
canary_results[ns].module_scope = Some(result.span); canary_results[ns].module_scope = Some(result);
} else { } else {
canary_results[ns].block_scopes.push(result.span); canary_results[ns].block_scopes.push(result);
} }
} }
}); });
@ -708,16 +700,36 @@ impl<'a, 'b:'a, 'c: 'b> ImportResolver<'a, 'b, 'c> {
let uniform_paths_feature = self.session.features_untracked().uniform_paths; let uniform_paths_feature = self.session.features_untracked().uniform_paths;
for ((span, _), (name, results)) in uniform_paths_canaries { for ((span, _), (name, results)) in uniform_paths_canaries {
self.per_ns(|this, ns| { self.per_ns(|this, ns| {
let results = &results[ns]; let external_crate = if ns == TypeNS && this.extern_prelude.contains(&name) {
let crate_id =
this.crate_loader.process_path_extern(name, span);
Some(DefId { krate: crate_id, index: CRATE_DEF_INDEX })
} else {
None
};
let result_filter = |result: &&NameBinding| {
// Ignore canaries that resolve to an import of the same crate.
// That is, we allow `use crate_name; use crate_name::foo;`.
if let Some(def_id) = external_crate {
if let Some(module) = result.module() {
if module.normal_ancestor_id == def_id {
return false;
}
}
}
let has_external_crate = true
ns == TypeNS && this.extern_prelude.contains(&name); };
let module_scope = results[ns].module_scope.filter(result_filter);
let block_scopes = || {
results[ns].block_scopes.iter().cloned().filter(result_filter)
};
// An ambiguity requires more than one possible resolution. // An ambiguity requires more than one possible resolution.
let possible_resultions = let possible_resultions =
(has_external_crate as usize) + (external_crate.is_some() as usize) +
(results.module_scope.is_some() as usize) + (module_scope.is_some() as usize) +
(!results.block_scopes.is_empty() as usize); (block_scopes().next().is_some() as usize);
if possible_resultions <= 1 { if possible_resultions <= 1 {
return; return;
} }
@ -727,26 +739,26 @@ impl<'a, 'b:'a, 'c: 'b> ImportResolver<'a, 'b, 'c> {
let msg = format!("`{}` import is ambiguous", name); let msg = format!("`{}` import is ambiguous", name);
let mut err = this.session.struct_span_err(span, &msg); let mut err = this.session.struct_span_err(span, &msg);
let mut suggestion_choices = String::new(); let mut suggestion_choices = String::new();
if has_external_crate { if external_crate.is_some() {
write!(suggestion_choices, "`::{}`", name); write!(suggestion_choices, "`::{}`", name);
err.span_label(span, err.span_label(span,
format!("can refer to external crate `::{}`", name)); format!("can refer to external crate `::{}`", name));
} }
if let Some(span) = results.module_scope { if let Some(result) = module_scope {
if !suggestion_choices.is_empty() { if !suggestion_choices.is_empty() {
suggestion_choices.push_str(" or "); suggestion_choices.push_str(" or ");
} }
write!(suggestion_choices, "`self::{}`", name); write!(suggestion_choices, "`self::{}`", name);
if uniform_paths_feature { if uniform_paths_feature {
err.span_label(span, err.span_label(result.span,
format!("can refer to `self::{}`", name)); format!("can refer to `self::{}`", name));
} else { } else {
err.span_label(span, err.span_label(result.span,
format!("may refer to `self::{}` in the future", name)); format!("may refer to `self::{}` in the future", name));
} }
} }
for &span in &results.block_scopes { for result in block_scopes() {
err.span_label(span, err.span_label(result.span,
format!("shadowed by block-scoped `{}`", name)); format!("shadowed by block-scoped `{}`", name));
} }
err.help(&format!("write {} explicitly instead", suggestion_choices)); err.help(&format!("write {} explicitly instead", suggestion_choices));

View File

@ -0,0 +1,30 @@
// Copyright 2018 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
// run-pass
// edition:2018
use std;
use std::io;
mod foo {
pub use std as my_std;
}
mod bar {
pub use std::{self};
}
fn main() {
io::stdout();
self::std::io::stdout();
foo::my_std::io::stdout();
bar::std::io::stdout();
}

View File

@ -8,11 +8,13 @@
// option. This file may not be copied, modified, or distributed // option. This file may not be copied, modified, or distributed
// except according to those terms. // except according to those terms.
// run-pass
// edition:2018 // edition:2018
#![feature(uniform_paths)] #![feature(uniform_paths)]
use std; use std;
use std::io;
mod foo { mod foo {
pub use std as my_std; pub use std as my_std;
@ -23,6 +25,7 @@ mod bar {
} }
fn main() { fn main() {
io::stdout();
self::std::io::stdout(); self::std::io::stdout();
foo::my_std::io::stdout(); foo::my_std::io::stdout();
bar::std::io::stdout(); bar::std::io::stdout();