//! FIXME: write short doc here mod classify; mod name_definition; mod rename; mod search_scope; use once_cell::unsync::Lazy; use ra_db::{SourceDatabase, SourceDatabaseExt}; use ra_syntax::{algo::find_node_at_offset, ast, AstNode, SourceFile, SyntaxNode, TextUnit}; use crate::{db::RootDatabase, FileId, FilePosition, FileRange, NavigationTarget, RangeInfo}; pub(crate) use self::{ classify::{classify_name, classify_name_ref}, name_definition::{NameDefinition, NameKind}, rename::rename, }; #[derive(Debug, Clone)] pub struct ReferenceSearchResult { declaration: NavigationTarget, references: Vec, } impl ReferenceSearchResult { pub fn declaration(&self) -> &NavigationTarget { &self.declaration } pub fn references(&self) -> &[FileRange] { &self.references } /// Total number of references /// At least 1 since all valid references should /// Have a declaration pub fn len(&self) -> usize { self.references.len() + 1 } } // allow turning ReferenceSearchResult into an iterator // over FileRanges impl IntoIterator for ReferenceSearchResult { type Item = FileRange; type IntoIter = std::vec::IntoIter; fn into_iter(mut self) -> Self::IntoIter { let mut v = Vec::with_capacity(self.len()); v.push(FileRange { file_id: self.declaration.file_id(), range: self.declaration.range() }); v.append(&mut self.references); v.into_iter() } } pub(crate) fn find_all_refs( db: &RootDatabase, position: FilePosition, ) -> Option> { let parse = db.parse(position.file_id); let syntax = parse.tree().syntax().clone(); let RangeInfo { range, info: (name, def) } = find_name(db, &syntax, position)?; let declaration = match def.kind { NameKind::Macro(mac) => NavigationTarget::from_macro_def(db, mac), NameKind::Field(field) => NavigationTarget::from_field(db, field), NameKind::AssocItem(assoc) => NavigationTarget::from_assoc_item(db, assoc), NameKind::Def(def) => NavigationTarget::from_def(db, def)?, NameKind::SelfType(ref ty) => match ty.as_adt() { Some((def_id, _)) => NavigationTarget::from_adt_def(db, def_id), None => return None, }, NameKind::Pat((_, pat)) => NavigationTarget::from_pat(db, position.file_id, pat), NameKind::SelfParam(par) => NavigationTarget::from_self_param(position.file_id, par), NameKind::GenericParam(_) => return None, }; let references = process_definition(db, def, name); Some(RangeInfo::new(range, ReferenceSearchResult { declaration, references })) } fn find_name<'a>( db: &RootDatabase, syntax: &SyntaxNode, position: FilePosition, ) -> Option> { if let Some(name) = find_node_at_offset::(&syntax, position.offset) { let def = classify_name(db, position.file_id, &name)?; let range = name.syntax().text_range(); return Some(RangeInfo::new(range, (name.text().to_string(), def))); } let name_ref = find_node_at_offset::(&syntax, position.offset)?; let def = classify_name_ref(db, position.file_id, &name_ref)?; let range = name_ref.syntax().text_range(); Some(RangeInfo::new(range, (name_ref.text().to_string(), def))) } fn process_definition(db: &RootDatabase, def: NameDefinition, name: String) -> Vec { let pat = name.as_str(); let scope = def.scope(db).files; let mut refs = vec![]; let is_match = |file_id: FileId, name_ref: &ast::NameRef| -> bool { let classified = classify_name_ref(db, file_id, &name_ref); if let Some(d) = classified { d == def } else { false } }; for (file_id, text_range) in scope { let text = db.file_text(file_id); let parse = Lazy::new(|| SourceFile::parse(&text)); for (idx, _) in text.match_indices(pat) { let offset = TextUnit::from_usize(idx); if let Some(name_ref) = find_node_at_offset::(parse.tree().syntax(), offset) { let range = name_ref.syntax().text_range(); if let Some(text_range) = text_range { if range.is_subrange(&text_range) && is_match(file_id, &name_ref) { refs.push(FileRange { file_id, range }); } } else if is_match(file_id, &name_ref) { refs.push(FileRange { file_id, range }); } } } } return refs; } #[cfg(test)] mod tests { use crate::{ mock_analysis::analysis_and_position, mock_analysis::single_file_with_position, ReferenceSearchResult, }; #[test] fn test_find_all_refs_for_local() { let code = r#" fn main() { let mut i = 1; let j = 1; i = i<|> + j; { i = 0; } i = 5; }"#; let refs = get_all_refs(code); assert_eq!(refs.len(), 5); } #[test] fn test_find_all_refs_for_param_inside() { let code = r#" fn foo(i : u32) -> u32 { i<|> }"#; let refs = get_all_refs(code); assert_eq!(refs.len(), 2); } #[test] fn test_find_all_refs_for_fn_param() { let code = r#" fn foo(i<|> : u32) -> u32 { i }"#; let refs = get_all_refs(code); assert_eq!(refs.len(), 2); } #[test] fn test_find_all_refs_field_name() { let code = r#" //- /lib.rs struct Foo { pub spam<|>: u32, } fn main(s: Foo) { let f = s.spam; } "#; let refs = get_all_refs(code); assert_eq!(refs.len(), 2); } #[test] fn test_find_all_refs_impl_item_name() { let code = r#" //- /lib.rs struct Foo; impl Foo { fn f<|>(&self) { } } "#; let refs = get_all_refs(code); assert_eq!(refs.len(), 1); } #[test] fn test_find_all_refs_enum_var_name() { let code = r#" //- /lib.rs enum Foo { A, B<|>, C, } "#; let refs = get_all_refs(code); assert_eq!(refs.len(), 1); } #[test] fn test_find_all_refs_modules() { let code = r#" //- /lib.rs pub mod foo; pub mod bar; fn f() { let i = foo::Foo { n: 5 }; } //- /foo.rs use crate::bar; pub struct Foo { pub n: u32, } fn f() { let i = bar::Bar { n: 5 }; } //- /bar.rs use crate::foo; pub struct Bar { pub n: u32, } fn f() { let i = foo::Foo<|> { n: 5 }; } "#; let (analysis, pos) = analysis_and_position(code); let refs = analysis.find_all_refs(pos).unwrap().unwrap(); assert_eq!(refs.len(), 3); } fn get_all_refs(text: &str) -> ReferenceSearchResult { let (analysis, position) = single_file_with_position(text); analysis.find_all_refs(position).unwrap().unwrap() } }