1use rustc_ast as ast;
27use rustc_ast::visit::{self, Visitor};
28use rustc_data_structures::fx::{FxHashMap, FxIndexMap, FxIndexSet};
29use rustc_data_structures::unord::UnordSet;
30use rustc_errors::MultiSpan;
31use rustc_hir::def::{DefKind, Res};
32use rustc_session::lint::BuiltinLintDiag;
33use rustc_session::lint::builtin::{
34 MACRO_USE_EXTERN_CRATE, UNUSED_EXTERN_CRATES, UNUSED_IMPORTS, UNUSED_QUALIFICATIONS,
35};
36use rustc_span::{DUMMY_SP, Ident, Macros20NormalizedIdent, Span, kw};
37
38use crate::imports::{Import, ImportKind};
39use crate::{LexicalScopeBinding, NameBindingKind, Resolver, module_to_string};
40
41struct UnusedImport {
42 use_tree: ast::UseTree,
43 use_tree_id: ast::NodeId,
44 item_span: Span,
45 unused: UnordSet<ast::NodeId>,
46}
47
48impl UnusedImport {
49 fn add(&mut self, id: ast::NodeId) {
50 self.unused.insert(id);
51 }
52}
53
54struct UnusedImportCheckVisitor<'a, 'ra, 'tcx> {
55 r: &'a mut Resolver<'ra, 'tcx>,
56 unused_imports: FxIndexMap<ast::NodeId, UnusedImport>,
58 extern_crate_items: Vec<ExternCrateToLint>,
59 base_use_tree: Option<&'a ast::UseTree>,
60 base_id: ast::NodeId,
61 item_span: Span,
62}
63
64struct ExternCrateToLint {
65 id: ast::NodeId,
66 span: Span,
68 span_with_attributes: Span,
70 vis_span: Span,
72 has_attrs: bool,
74 ident: Ident,
76 renames: bool,
78}
79
80impl<'a, 'ra, 'tcx> UnusedImportCheckVisitor<'a, 'ra, 'tcx> {
81 fn check_import(&mut self, id: ast::NodeId) {
84 let used = self.r.used_imports.contains(&id);
85 let def_id = self.r.local_def_id(id);
86 if !used {
87 if self.r.maybe_unused_trait_imports.contains(&def_id) {
88 return;
90 }
91 self.unused_import(self.base_id).add(id);
92 } else {
93 self.r.maybe_unused_trait_imports.swap_remove(&def_id);
97 if let Some(i) = self.unused_imports.get_mut(&self.base_id) {
98 i.unused.remove(&id);
99 }
100 }
101 }
102
103 fn check_use_tree(&mut self, use_tree: &'a ast::UseTree, id: ast::NodeId) {
104 if self.r.effective_visibilities.is_exported(self.r.local_def_id(id)) {
105 self.check_import_as_underscore(use_tree, id);
106 return;
107 }
108
109 if let ast::UseTreeKind::Nested { ref items, .. } = use_tree.kind {
110 if items.is_empty() {
111 self.unused_import(self.base_id).add(id);
112 }
113 } else {
114 self.check_import(id);
115 }
116 }
117
118 fn unused_import(&mut self, id: ast::NodeId) -> &mut UnusedImport {
119 let use_tree_id = self.base_id;
120 let use_tree = self.base_use_tree.unwrap().clone();
121 let item_span = self.item_span;
122
123 self.unused_imports.entry(id).or_insert_with(|| UnusedImport {
124 use_tree,
125 use_tree_id,
126 item_span,
127 unused: Default::default(),
128 })
129 }
130
131 fn check_import_as_underscore(&mut self, item: &ast::UseTree, id: ast::NodeId) {
132 match item.kind {
133 ast::UseTreeKind::Simple(Some(ident)) => {
134 if ident.name == kw::Underscore
135 && !self.r.import_res_map.get(&id).is_some_and(|per_ns| {
136 matches!(
137 per_ns.type_ns,
138 Some(Res::Def(DefKind::Trait | DefKind::TraitAlias, _))
139 )
140 })
141 {
142 self.unused_import(self.base_id).add(id);
143 }
144 }
145 ast::UseTreeKind::Nested { ref items, .. } => self.check_imports_as_underscore(items),
146 _ => {}
147 }
148 }
149
150 fn check_imports_as_underscore(&mut self, items: &[(ast::UseTree, ast::NodeId)]) {
151 for (item, id) in items {
152 self.check_import_as_underscore(item, *id);
153 }
154 }
155
156 fn report_unused_extern_crate_items(
157 &mut self,
158 maybe_unused_extern_crates: FxHashMap<ast::NodeId, Span>,
159 ) {
160 let tcx = self.r.tcx();
161 for extern_crate in &self.extern_crate_items {
162 let warn_if_unused = !extern_crate.ident.name.as_str().starts_with('_');
163
164 if warn_if_unused {
167 if let Some(&span) = maybe_unused_extern_crates.get(&extern_crate.id) {
168 self.r.lint_buffer.buffer_lint(
169 UNUSED_EXTERN_CRATES,
170 extern_crate.id,
171 span,
172 crate::errors::UnusedExternCrate {
173 span: extern_crate.span,
174 removal_span: extern_crate.span_with_attributes,
175 },
176 );
177 continue;
178 }
179 }
180
181 if !tcx.sess.at_least_rust_2018() {
184 continue;
185 }
186
187 if extern_crate.has_attrs {
191 continue;
192 }
193
194 if extern_crate.renames {
198 continue;
199 }
200
201 if self
204 .r
205 .extern_prelude
206 .get(&Macros20NormalizedIdent::new(extern_crate.ident))
207 .is_none_or(|entry| entry.introduced_by_item())
208 {
209 continue;
210 }
211
212 let module = self
213 .r
214 .get_nearest_non_block_module(self.r.local_def_id(extern_crate.id).to_def_id());
215 if module.no_implicit_prelude {
216 continue;
220 }
221
222 let vis_span = extern_crate
223 .vis_span
224 .find_ancestor_inside(extern_crate.span)
225 .unwrap_or(extern_crate.vis_span);
226 let ident_span = extern_crate
227 .ident
228 .span
229 .find_ancestor_inside(extern_crate.span)
230 .unwrap_or(extern_crate.ident.span);
231
232 self.r.lint_buffer.buffer_lint(
233 UNUSED_EXTERN_CRATES,
234 extern_crate.id,
235 extern_crate.span,
236 crate::errors::ExternCrateNotIdiomatic {
237 span: vis_span.between(ident_span),
238 code: if vis_span.is_empty() { "use " } else { " use " },
239 },
240 );
241 }
242 }
243}
244
245impl<'a, 'ra, 'tcx> Visitor<'a> for UnusedImportCheckVisitor<'a, 'ra, 'tcx> {
246 fn visit_item(&mut self, item: &'a ast::Item) {
247 self.item_span = item.span_with_attributes();
248 match &item.kind {
249 ast::ItemKind::Use(..) if item.span.is_dummy() => return,
254 ast::ItemKind::Use(use_tree) => {
257 self.base_id = item.id;
258 self.base_use_tree = Some(use_tree);
259 self.check_use_tree(use_tree, item.id);
260 }
261 &ast::ItemKind::ExternCrate(orig_name, ident) => {
262 self.extern_crate_items.push(ExternCrateToLint {
263 id: item.id,
264 span: item.span,
265 vis_span: item.vis.span,
266 span_with_attributes: item.span_with_attributes(),
267 has_attrs: !item.attrs.is_empty(),
268 ident,
269 renames: orig_name.is_some(),
270 });
271 }
272 _ => {}
273 }
274
275 visit::walk_item(self, item);
276 }
277
278 fn visit_nested_use_tree(&mut self, use_tree: &'a ast::UseTree, id: ast::NodeId) {
279 self.check_use_tree(use_tree, id);
280 visit::walk_use_tree(self, use_tree);
281 }
282}
283
284enum UnusedSpanResult {
285 Used,
286 Unused { spans: Vec<Span>, remove: Span },
287 PartialUnused { spans: Vec<Span>, remove: Vec<Span> },
288}
289
290fn calc_unused_spans(
291 unused_import: &UnusedImport,
292 use_tree: &ast::UseTree,
293 use_tree_id: ast::NodeId,
294) -> UnusedSpanResult {
295 let full_span = if unused_import.use_tree.span == use_tree.span {
298 unused_import.item_span
299 } else {
300 use_tree.span
301 };
302 match use_tree.kind {
303 ast::UseTreeKind::Simple(..) | ast::UseTreeKind::Glob => {
304 if unused_import.unused.contains(&use_tree_id) {
305 UnusedSpanResult::Unused { spans: vec![use_tree.span], remove: full_span }
306 } else {
307 UnusedSpanResult::Used
308 }
309 }
310 ast::UseTreeKind::Nested { items: ref nested, span: tree_span } => {
311 if nested.is_empty() {
312 return UnusedSpanResult::Unused { spans: vec![use_tree.span], remove: full_span };
313 }
314
315 let mut unused_spans = Vec::new();
316 let mut to_remove = Vec::new();
317 let mut used_children = 0;
318 let mut contains_self = false;
319 let mut previous_unused = false;
320 for (pos, (use_tree, use_tree_id)) in nested.iter().enumerate() {
321 let remove = match calc_unused_spans(unused_import, use_tree, *use_tree_id) {
322 UnusedSpanResult::Used => {
323 used_children += 1;
324 None
325 }
326 UnusedSpanResult::Unused { mut spans, remove } => {
327 unused_spans.append(&mut spans);
328 Some(remove)
329 }
330 UnusedSpanResult::PartialUnused { mut spans, remove: mut to_remove_extra } => {
331 used_children += 1;
332 unused_spans.append(&mut spans);
333 to_remove.append(&mut to_remove_extra);
334 None
335 }
336 };
337 if let Some(remove) = remove {
338 let remove_span = if nested.len() == 1 {
339 remove
340 } else if pos == nested.len() - 1 || used_children > 0 {
341 nested[pos - 1].0.span.shrink_to_hi().to(use_tree.span)
344 } else {
345 use_tree.span.to(nested[pos + 1].0.span.shrink_to_lo())
347 };
348
349 if previous_unused && !to_remove.is_empty() {
352 let previous = to_remove.pop().unwrap();
353 to_remove.push(previous.to(remove_span));
354 } else {
355 to_remove.push(remove_span);
356 }
357 }
358 contains_self |= use_tree.prefix == kw::SelfLower
359 && matches!(use_tree.kind, ast::UseTreeKind::Simple(_))
360 && !unused_import.unused.contains(&use_tree_id);
361 previous_unused = remove.is_some();
362 }
363 if unused_spans.is_empty() {
364 UnusedSpanResult::Used
365 } else if used_children == 0 {
366 UnusedSpanResult::Unused { spans: unused_spans, remove: full_span }
367 } else {
368 if used_children == 1 && !contains_self {
380 to_remove.push(
382 tree_span.shrink_to_lo().to(nested.first().unwrap().0.span.shrink_to_lo()),
383 );
384 to_remove.push(
386 nested.last().unwrap().0.span.shrink_to_hi().to(tree_span.shrink_to_hi()),
387 );
388 }
389
390 UnusedSpanResult::PartialUnused { spans: unused_spans, remove: to_remove }
391 }
392 }
393 }
394}
395
396impl Resolver<'_, '_> {
397 pub(crate) fn check_unused(&mut self, krate: &ast::Crate) {
398 let tcx = self.tcx;
399 let mut maybe_unused_extern_crates = FxHashMap::default();
400
401 for import in self.potentially_unused_imports.iter() {
402 match import.kind {
403 _ if import.vis.is_public()
404 || import.span.is_dummy()
405 || self.import_use_map.contains_key(import) =>
406 {
407 if let ImportKind::MacroUse { .. } = import.kind {
408 if !import.span.is_dummy() {
409 self.lint_buffer.buffer_lint(
410 MACRO_USE_EXTERN_CRATE,
411 import.root_id,
412 import.span,
413 crate::errors::MacroUseDeprecated,
414 );
415 }
416 }
417 }
418 ImportKind::ExternCrate { id, .. } => {
419 let def_id = self.local_def_id(id);
420 if self.extern_crate_map.get(&def_id).is_none_or(|&cnum| {
421 !tcx.is_compiler_builtins(cnum)
422 && !tcx.is_panic_runtime(cnum)
423 && !tcx.has_global_allocator(cnum)
424 && !tcx.has_panic_handler(cnum)
425 && tcx.externally_implementable_items(cnum).is_empty()
426 }) {
427 maybe_unused_extern_crates.insert(id, import.span);
428 }
429 }
430 ImportKind::MacroUse { .. } => {
431 self.lint_buffer.buffer_lint(
432 UNUSED_IMPORTS,
433 import.root_id,
434 import.span,
435 crate::errors::UnusedMacroUse,
436 );
437 }
438 _ => {}
439 }
440 }
441
442 let mut visitor = UnusedImportCheckVisitor {
443 r: self,
444 unused_imports: Default::default(),
445 extern_crate_items: Default::default(),
446 base_use_tree: None,
447 base_id: ast::DUMMY_NODE_ID,
448 item_span: DUMMY_SP,
449 };
450 visit::walk_crate(&mut visitor, krate);
451
452 visitor.report_unused_extern_crate_items(maybe_unused_extern_crates);
453
454 for unused in visitor.unused_imports.values() {
455 let (spans, remove_spans) =
456 match calc_unused_spans(unused, &unused.use_tree, unused.use_tree_id) {
457 UnusedSpanResult::Used => continue,
458 UnusedSpanResult::Unused { spans, remove } => (spans, vec![remove]),
459 UnusedSpanResult::PartialUnused { spans, remove } => (spans, remove),
460 };
461
462 let ms = MultiSpan::from_spans(spans);
463
464 let mut span_snippets = ms
465 .primary_spans()
466 .iter()
467 .filter_map(|span| tcx.sess.source_map().span_to_snippet(*span).ok())
468 .map(|s| format!("`{s}`"))
469 .collect::<Vec<String>>();
470 span_snippets.sort();
471
472 let remove_whole_use = remove_spans.len() == 1 && remove_spans[0] == unused.item_span;
473 let num_to_remove = ms.primary_spans().len();
474
475 let test_module_span = if tcx.sess.is_test_crate() {
479 None
480 } else {
481 let parent_module = visitor.r.get_nearest_non_block_module(
482 visitor.r.local_def_id(unused.use_tree_id).to_def_id(),
483 );
484 match module_to_string(parent_module) {
485 Some(module)
486 if module == "test"
487 || module == "tests"
488 || module.starts_with("test_")
489 || module.starts_with("tests_")
490 || module.ends_with("_test")
491 || module.ends_with("_tests") =>
492 {
493 Some(parent_module.span)
494 }
495 _ => None,
496 }
497 };
498
499 visitor.r.lint_buffer.buffer_lint(
500 UNUSED_IMPORTS,
501 unused.use_tree_id,
502 ms,
503 BuiltinLintDiag::UnusedImports {
504 remove_whole_use,
505 num_to_remove,
506 remove_spans,
507 test_module_span,
508 span_snippets,
509 },
510 );
511 }
512
513 let unused_imports = visitor.unused_imports;
514 let mut check_redundant_imports = FxIndexSet::default();
515 for module in &self.local_modules {
516 for (_key, resolution) in self.resolutions(*module).borrow().iter() {
517 if let Some(binding) = resolution.borrow().best_binding()
518 && let NameBindingKind::Import { import, .. } = binding.kind
519 && let ImportKind::Single { id, .. } = import.kind
520 {
521 if let Some(unused_import) = unused_imports.get(&import.root_id)
522 && unused_import.unused.contains(&id)
523 {
524 continue;
525 }
526
527 check_redundant_imports.insert(import);
528 }
529 }
530 }
531
532 let mut redundant_imports = UnordSet::default();
533 for import in check_redundant_imports {
534 if self.check_for_redundant_imports(import)
535 && let Some(id) = import.id()
536 {
537 redundant_imports.insert(id);
538 }
539 }
540
541 for unn_qua in &self.potentially_unnecessary_qualifications {
545 if let LexicalScopeBinding::Item(name_binding) = unn_qua.binding
546 && let NameBindingKind::Import { import, .. } = name_binding.kind
547 && (is_unused_import(import, &unused_imports)
548 || is_redundant_import(import, &redundant_imports))
549 {
550 continue;
551 }
552
553 self.lint_buffer.buffer_lint(
554 UNUSED_QUALIFICATIONS,
555 unn_qua.node_id,
556 unn_qua.path_span,
557 BuiltinLintDiag::UnusedQualifications { removal_span: unn_qua.removal_span },
558 );
559 }
560
561 fn is_redundant_import(
562 import: Import<'_>,
563 redundant_imports: &UnordSet<ast::NodeId>,
564 ) -> bool {
565 if let Some(id) = import.id()
566 && redundant_imports.contains(&id)
567 {
568 return true;
569 }
570 false
571 }
572
573 fn is_unused_import(
574 import: Import<'_>,
575 unused_imports: &FxIndexMap<ast::NodeId, UnusedImport>,
576 ) -> bool {
577 if let Some(unused_import) = unused_imports.get(&import.root_id)
578 && let Some(id) = import.id()
579 && unused_import.unused.contains(&id)
580 {
581 return true;
582 }
583 false
584 }
585 }
586}