mirror of
https://github.com/rust-lang/rust-analyzer.git
synced 2025-09-28 12:54:58 +00:00
Implement proposed CallHierarchy feature
See: https://github.com/microsoft/vscode-languageserver-node/blob/master/protocol/src/protocol.callHierarchy.proposed.ts
This commit is contained in:
parent
928ecd069a
commit
1b19a8aa5e
11 changed files with 502 additions and 15 deletions
337
crates/ra_ide/src/call_hierarchy.rs
Normal file
337
crates/ra_ide/src/call_hierarchy.rs
Normal file
|
@ -0,0 +1,337 @@
|
|||
//! Entry point for call-hierarchy
|
||||
|
||||
use indexmap::IndexMap;
|
||||
|
||||
use hir::db::AstDatabase;
|
||||
use ra_syntax::{
|
||||
ast::{self, DocCommentsOwner},
|
||||
match_ast, AstNode, TextRange,
|
||||
};
|
||||
|
||||
use crate::{
|
||||
call_info::FnCallNode,
|
||||
db::RootDatabase,
|
||||
display::{ShortLabel, ToNav},
|
||||
expand::descend_into_macros,
|
||||
goto_definition, references, FilePosition, NavigationTarget, RangeInfo,
|
||||
};
|
||||
|
||||
#[derive(Default)]
|
||||
struct CallLocations {
|
||||
funcs: IndexMap<NavigationTarget, Vec<TextRange>>,
|
||||
}
|
||||
|
||||
impl CallLocations {
|
||||
pub fn add(&mut self, target: &NavigationTarget, range: TextRange) {
|
||||
self.funcs.entry(target.clone()).or_default().push(range);
|
||||
}
|
||||
|
||||
pub fn into_items(self) -> Vec<CallItem> {
|
||||
self.funcs.into_iter().map(|(target, ranges)| CallItem { target, ranges }).collect()
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone)]
|
||||
pub struct CallItem {
|
||||
pub target: NavigationTarget,
|
||||
pub ranges: Vec<TextRange>,
|
||||
}
|
||||
|
||||
impl CallItem {
|
||||
#[cfg(test)]
|
||||
pub(crate) fn assert_match(&self, expected: &str) {
|
||||
let actual = self.debug_render();
|
||||
test_utils::assert_eq_text!(expected.trim(), actual.trim(),);
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
pub(crate) fn debug_render(&self) -> String {
|
||||
format!("{} : {:?}", self.target.debug_render(), self.ranges)
|
||||
}
|
||||
}
|
||||
|
||||
pub(crate) fn call_hierarchy(
|
||||
db: &RootDatabase,
|
||||
position: FilePosition,
|
||||
) -> Option<RangeInfo<Vec<NavigationTarget>>> {
|
||||
goto_definition::goto_definition(db, position)
|
||||
}
|
||||
|
||||
pub(crate) fn incoming_calls(db: &RootDatabase, position: FilePosition) -> Option<Vec<CallItem>> {
|
||||
// 1. Find all refs
|
||||
// 2. Loop through refs and determine unique fndef. This will become our `from: CallHierarchyItem,` in the reply.
|
||||
// 3. Add ranges relative to the start of the fndef.
|
||||
let refs = references::find_all_refs(db, position, None)?;
|
||||
|
||||
let mut calls = CallLocations::default();
|
||||
|
||||
for reference in refs.info.references() {
|
||||
let file_id = reference.file_range.file_id;
|
||||
let file = db.parse_or_expand(file_id.into())?;
|
||||
let token = file.token_at_offset(reference.file_range.range.start()).next()?;
|
||||
let token = descend_into_macros(db, file_id, token);
|
||||
let syntax = token.value.parent();
|
||||
|
||||
// This target is the containing function
|
||||
if let Some(nav) = syntax.ancestors().find_map(|node| {
|
||||
match_ast! {
|
||||
match node {
|
||||
ast::FnDef(it) => {
|
||||
Some(NavigationTarget::from_named(
|
||||
db,
|
||||
token.with_value(&it),
|
||||
it.doc_comment_text(),
|
||||
it.short_label(),
|
||||
))
|
||||
},
|
||||
_ => { None },
|
||||
}
|
||||
}
|
||||
}) {
|
||||
let relative_range = reference.file_range.range;
|
||||
calls.add(&nav, relative_range);
|
||||
}
|
||||
}
|
||||
|
||||
Some(calls.into_items())
|
||||
}
|
||||
|
||||
pub(crate) fn outgoing_calls(db: &RootDatabase, position: FilePosition) -> Option<Vec<CallItem>> {
|
||||
let file_id = position.file_id;
|
||||
let file = db.parse_or_expand(file_id.into())?;
|
||||
let token = file.token_at_offset(position.offset).next()?;
|
||||
let token = descend_into_macros(db, file_id, token);
|
||||
let syntax = token.value.parent();
|
||||
|
||||
let mut calls = CallLocations::default();
|
||||
|
||||
syntax
|
||||
.descendants()
|
||||
.filter_map(|node| FnCallNode::with_node_exact(&node))
|
||||
.filter_map(|call_node| {
|
||||
let name_ref = call_node.name_ref()?;
|
||||
let name_ref = token.with_value(name_ref.syntax());
|
||||
|
||||
let analyzer = hir::SourceAnalyzer::new(db, name_ref, None);
|
||||
|
||||
if let Some(func_target) = match &call_node {
|
||||
FnCallNode::CallExpr(expr) => {
|
||||
//FIXME: Type::as_callable is broken
|
||||
let callable_def = analyzer.type_of(db, &expr.expr()?)?.as_callable()?;
|
||||
match callable_def {
|
||||
hir::CallableDef::FunctionId(it) => {
|
||||
let fn_def: hir::Function = it.into();
|
||||
let nav = fn_def.to_nav(db);
|
||||
Some(nav)
|
||||
}
|
||||
_ => None,
|
||||
}
|
||||
}
|
||||
FnCallNode::MethodCallExpr(expr) => {
|
||||
let function = analyzer.resolve_method_call(&expr)?;
|
||||
Some(function.to_nav(db))
|
||||
}
|
||||
FnCallNode::MacroCallExpr(expr) => {
|
||||
let macro_def = analyzer.resolve_macro_call(db, name_ref.with_value(&expr))?;
|
||||
Some(macro_def.to_nav(db))
|
||||
}
|
||||
} {
|
||||
Some((func_target.clone(), name_ref.value.text_range()))
|
||||
} else {
|
||||
None
|
||||
}
|
||||
})
|
||||
.for_each(|(nav, range)| calls.add(&nav, range));
|
||||
|
||||
Some(calls.into_items())
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use ra_db::FilePosition;
|
||||
|
||||
use crate::mock_analysis::analysis_and_position;
|
||||
|
||||
fn check_hierarchy(
|
||||
fixture: &str,
|
||||
expected: &str,
|
||||
expected_incoming: &[&str],
|
||||
expected_outgoing: &[&str],
|
||||
) {
|
||||
let (analysis, pos) = analysis_and_position(fixture);
|
||||
|
||||
let mut navs = analysis.call_hierarchy(pos).unwrap().unwrap().info;
|
||||
assert_eq!(navs.len(), 1);
|
||||
let nav = navs.pop().unwrap();
|
||||
nav.assert_match(expected);
|
||||
|
||||
let item_pos = FilePosition { file_id: nav.file_id(), offset: nav.range().start() };
|
||||
let incoming_calls = analysis.incoming_calls(item_pos).unwrap().unwrap();
|
||||
assert_eq!(incoming_calls.len(), expected_incoming.len());
|
||||
|
||||
for call in 0..incoming_calls.len() {
|
||||
incoming_calls[call].assert_match(expected_incoming[call]);
|
||||
}
|
||||
|
||||
let outgoing_calls = analysis.outgoing_calls(item_pos).unwrap().unwrap();
|
||||
assert_eq!(outgoing_calls.len(), expected_outgoing.len());
|
||||
|
||||
for call in 0..outgoing_calls.len() {
|
||||
outgoing_calls[call].assert_match(expected_outgoing[call]);
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_on_ref() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
fn callee() {}
|
||||
fn caller() {
|
||||
call<|>ee();
|
||||
}
|
||||
"#,
|
||||
"callee FN_DEF FileId(1) [0; 14) [3; 9)",
|
||||
&["caller FN_DEF FileId(1) [15; 44) [18; 24) : [[33; 39)]"],
|
||||
&[],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_on_def() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
fn call<|>ee() {}
|
||||
fn caller() {
|
||||
callee();
|
||||
}
|
||||
"#,
|
||||
"callee FN_DEF FileId(1) [0; 14) [3; 9)",
|
||||
&["caller FN_DEF FileId(1) [15; 44) [18; 24) : [[33; 39)]"],
|
||||
&[],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_in_same_fn() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
fn callee() {}
|
||||
fn caller() {
|
||||
call<|>ee();
|
||||
callee();
|
||||
}
|
||||
"#,
|
||||
"callee FN_DEF FileId(1) [0; 14) [3; 9)",
|
||||
&["caller FN_DEF FileId(1) [15; 58) [18; 24) : [[33; 39), [47; 53)]"],
|
||||
&[],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_in_different_fn() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
fn callee() {}
|
||||
fn caller1() {
|
||||
call<|>ee();
|
||||
}
|
||||
|
||||
fn caller2() {
|
||||
callee();
|
||||
}
|
||||
"#,
|
||||
"callee FN_DEF FileId(1) [0; 14) [3; 9)",
|
||||
&[
|
||||
"caller1 FN_DEF FileId(1) [15; 45) [18; 25) : [[34; 40)]",
|
||||
"caller2 FN_DEF FileId(1) [46; 76) [49; 56) : [[65; 71)]",
|
||||
],
|
||||
&[],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_in_different_files() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
mod foo;
|
||||
use foo::callee;
|
||||
|
||||
fn caller() {
|
||||
call<|>ee();
|
||||
}
|
||||
|
||||
//- /foo/mod.rs
|
||||
pub fn callee() {}
|
||||
"#,
|
||||
"callee FN_DEF FileId(2) [0; 18) [7; 13)",
|
||||
&["caller FN_DEF FileId(1) [26; 55) [29; 35) : [[44; 50)]"],
|
||||
&[],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_outgoing() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
fn callee() {}
|
||||
fn call<|>er() {
|
||||
callee();
|
||||
callee();
|
||||
}
|
||||
"#,
|
||||
"caller FN_DEF FileId(1) [15; 58) [18; 24)",
|
||||
&[],
|
||||
&["callee FN_DEF FileId(1) [0; 14) [3; 9) : [[33; 39), [47; 53)]"],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_outgoing_in_different_files() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
mod foo;
|
||||
use foo::callee;
|
||||
|
||||
fn call<|>er() {
|
||||
callee();
|
||||
}
|
||||
|
||||
//- /foo/mod.rs
|
||||
pub fn callee() {}
|
||||
"#,
|
||||
"caller FN_DEF FileId(1) [26; 55) [29; 35)",
|
||||
&[],
|
||||
&["callee FN_DEF FileId(2) [0; 18) [7; 13) : [[44; 50)]"],
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_call_hierarchy_incoming_outgoing() {
|
||||
check_hierarchy(
|
||||
r#"
|
||||
//- /lib.rs
|
||||
fn caller1() {
|
||||
call<|>er2();
|
||||
}
|
||||
|
||||
fn caller2() {
|
||||
caller3();
|
||||
}
|
||||
|
||||
fn caller3() {
|
||||
|
||||
}
|
||||
"#,
|
||||
"caller2 FN_DEF FileId(1) [32; 63) [35; 42)",
|
||||
&["caller1 FN_DEF FileId(1) [0; 31) [3; 10) : [[19; 26)]"],
|
||||
&["caller3 FN_DEF FileId(1) [64; 80) [67; 74) : [[51; 58)]"],
|
||||
);
|
||||
}
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue