rust/crates/ra_analysis/src/imp.rs

537 lines
18 KiB
Rust
Raw Normal View History

2018-08-29 10:23:57 -05:00
use std::{
collections::VecDeque,
fmt,
hash::{Hash, Hasher},
2018-09-15 15:19:41 -05:00
iter,
sync::Arc,
2018-08-29 10:23:57 -05:00
};
use ra_editor::{self, find_node_at_offset, resolve_local_name, FileSymbol, LineIndex, LocalEdit};
2018-09-16 04:54:24 -05:00
use ra_syntax::{
ast::{self, ArgListOwner, Expr, NameOwner},
AstNode, File, SmolStr,
2018-08-29 10:23:57 -05:00
SyntaxKind::*,
SyntaxNodeRef, TextRange, TextUnit,
2018-08-29 10:23:57 -05:00
};
use relative_path::RelativePath;
use rustc_hash::FxHashSet;
2018-08-29 10:23:57 -05:00
2018-10-15 12:15:53 -05:00
use crate::{
descriptors::{FnDescriptor, ModuleTreeDescriptor, Problem},
roots::{ReadonlySourceRoot, SourceRoot, WritableSourceRoot},
2018-10-20 14:09:12 -05:00
CrateGraph, CrateId, Diagnostic, FileId, FileResolver, FileSystemEdit, Position,
2018-10-20 13:52:49 -05:00
Query, SourceChange, SourceFileEdit, Cancelable,
2018-08-29 10:23:57 -05:00
};
2018-09-10 04:57:40 -05:00
#[derive(Clone, Debug)]
pub(crate) struct FileResolverImp {
inner: Arc<FileResolver>,
2018-09-10 04:57:40 -05:00
}
2018-10-15 13:54:12 -05:00
impl PartialEq for FileResolverImp {
fn eq(&self, other: &FileResolverImp) -> bool {
self.inner() == other.inner()
}
}
impl Eq for FileResolverImp {}
2018-10-15 13:54:12 -05:00
impl Hash for FileResolverImp {
fn hash<H: Hasher>(&self, hasher: &mut H) {
self.inner().hash(hasher);
}
}
2018-09-10 04:57:40 -05:00
impl FileResolverImp {
pub(crate) fn new(inner: Arc<FileResolver>) -> FileResolverImp {
FileResolverImp { inner }
}
pub(crate) fn file_stem(&self, file_id: FileId) -> String {
self.inner.file_stem(file_id)
}
pub(crate) fn resolve(&self, file_id: FileId, path: &RelativePath) -> Option<FileId> {
self.inner.resolve(file_id, path)
}
2018-10-15 13:54:12 -05:00
fn inner(&self) -> *const FileResolver {
&*self.inner
}
2018-09-10 04:57:40 -05:00
}
impl Default for FileResolverImp {
fn default() -> FileResolverImp {
#[derive(Debug)]
struct DummyResolver;
impl FileResolver for DummyResolver {
fn file_stem(&self, _file_: FileId) -> String {
panic!("file resolver not set")
}
fn resolve(
&self,
_file_id: FileId,
_path: &::relative_path::RelativePath,
) -> Option<FileId> {
2018-09-10 04:57:40 -05:00
panic!("file resolver not set")
}
}
FileResolverImp {
inner: Arc::new(DummyResolver),
}
2018-09-10 04:57:40 -05:00
}
}
2018-08-30 04:51:46 -05:00
#[derive(Debug)]
pub(crate) struct AnalysisHostImpl {
data: WorldData,
2018-08-30 04:51:46 -05:00
}
impl AnalysisHostImpl {
pub fn new() -> AnalysisHostImpl {
AnalysisHostImpl {
2018-10-15 14:29:24 -05:00
data: WorldData::default(),
2018-08-30 04:51:46 -05:00
}
}
2018-09-10 04:57:40 -05:00
pub fn analysis(&self) -> AnalysisImpl {
2018-08-30 04:51:46 -05:00
AnalysisImpl {
2018-08-30 05:12:49 -05:00
data: self.data.clone(),
2018-08-30 04:51:46 -05:00
}
}
pub fn change_files(&mut self, changes: &mut dyn Iterator<Item = (FileId, Option<String>)>) {
self.data_mut().root.apply_changes(changes, None);
2018-08-30 04:51:46 -05:00
}
2018-09-10 04:57:40 -05:00
pub fn set_file_resolver(&mut self, resolver: FileResolverImp) {
2018-10-15 14:05:21 -05:00
self.data_mut()
.root
.apply_changes(&mut iter::empty(), Some(resolver));
2018-09-10 04:57:40 -05:00
}
2018-08-31 11:14:08 -05:00
pub fn set_crate_graph(&mut self, graph: CrateGraph) {
let mut visited = FxHashSet::default();
2018-08-31 11:14:08 -05:00
for &file_id in graph.crate_roots.values() {
if !visited.insert(file_id) {
panic!("duplicate crate root: {:?}", file_id);
}
}
self.data_mut().crate_graph = graph;
}
2018-09-03 13:26:59 -05:00
pub fn add_library(&mut self, root: ReadonlySourceRoot) {
self.data_mut().libs.push(Arc::new(root));
2018-09-03 11:46:30 -05:00
}
2018-08-30 04:51:46 -05:00
fn data_mut(&mut self) -> &mut WorldData {
2018-10-15 14:29:24 -05:00
&mut self.data
2018-08-30 04:51:46 -05:00
}
}
2018-08-29 10:23:57 -05:00
pub(crate) struct AnalysisImpl {
2018-10-15 14:29:24 -05:00
data: WorldData,
2018-08-29 10:23:57 -05:00
}
impl fmt::Debug for AnalysisImpl {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
2018-10-15 14:29:24 -05:00
self.data.fmt(f)
2018-08-29 10:23:57 -05:00
}
}
impl AnalysisImpl {
2018-09-03 11:46:30 -05:00
fn root(&self, file_id: FileId) -> &SourceRoot {
if self.data.root.contains(file_id) {
2018-10-15 14:05:21 -05:00
return &self.data.root;
2018-09-03 11:46:30 -05:00
}
&**self
.data
.libs
.iter()
.find(|it| it.contains(file_id))
.unwrap()
2018-09-03 11:46:30 -05:00
}
2018-09-15 15:19:41 -05:00
pub fn file_syntax(&self, file_id: FileId) -> File {
2018-09-03 11:46:30 -05:00
self.root(file_id).syntax(file_id)
2018-08-29 10:23:57 -05:00
}
2018-09-15 15:19:41 -05:00
pub fn file_line_index(&self, file_id: FileId) -> Arc<LineIndex> {
2018-09-03 11:46:30 -05:00
self.root(file_id).lines(file_id)
2018-08-29 10:23:57 -05:00
}
2018-10-20 14:02:41 -05:00
pub fn world_symbols(&self, query: Query) -> Vec<(FileId, FileSymbol)> {
2018-09-03 11:46:30 -05:00
let mut buf = Vec::new();
if query.libs {
self.data.libs.iter().for_each(|it| it.symbols(&mut buf));
2018-09-03 11:46:30 -05:00
} else {
self.data.root.symbols(&mut buf);
}
2018-10-20 14:02:41 -05:00
query.search(&buf)
2018-08-29 10:23:57 -05:00
}
2018-10-20 13:52:49 -05:00
pub fn parent_module(&self, file_id: FileId) -> Cancelable<Vec<(FileId, FileSymbol)>> {
2018-09-03 21:09:39 -05:00
let root = self.root(file_id);
2018-09-15 12:29:22 -05:00
let module_tree = root.module_tree();
2018-10-20 13:52:49 -05:00
let res = module_tree
.parent_modules(file_id)
2018-09-15 12:29:22 -05:00
.iter()
.map(|link| {
let file_id = link.owner(&module_tree);
let syntax = root.syntax(file_id);
let decl = link.bind_source(&module_tree, syntax.ast());
2018-08-29 10:23:57 -05:00
let sym = FileSymbol {
2018-09-15 12:29:22 -05:00
name: link.name(&module_tree),
node_range: decl.syntax().range(),
2018-08-29 10:23:57 -05:00
kind: MODULE,
};
2018-09-15 12:29:22 -05:00
(file_id, sym)
2018-08-29 10:23:57 -05:00
})
2018-10-20 13:52:49 -05:00
.collect();
Ok(res)
2018-08-29 10:23:57 -05:00
}
2018-09-03 11:46:30 -05:00
pub fn crate_for(&self, file_id: FileId) -> Vec<CrateId> {
2018-09-15 12:29:22 -05:00
let module_tree = self.root(file_id).module_tree();
2018-08-31 11:14:08 -05:00
let crate_graph = &self.data.crate_graph;
let mut res = Vec::new();
let mut work = VecDeque::new();
2018-09-03 11:46:30 -05:00
work.push_back(file_id);
let mut visited = FxHashSet::default();
2018-08-31 11:14:08 -05:00
while let Some(id) = work.pop_front() {
if let Some(crate_id) = crate_graph.crate_id_for_crate_root(id) {
res.push(crate_id);
continue;
}
2018-09-15 12:29:22 -05:00
let parents = module_tree
.parent_modules(id)
2018-08-31 11:14:08 -05:00
.into_iter()
2018-09-15 12:29:22 -05:00
.map(|link| link.owner(&module_tree))
2018-08-31 11:14:08 -05:00
.filter(|&id| visited.insert(id));
work.extend(parents);
}
res
}
2018-09-02 08:36:03 -05:00
pub fn crate_root(&self, crate_id: CrateId) -> FileId {
self.data.crate_graph.crate_roots[&crate_id]
}
2018-08-29 10:23:57 -05:00
pub fn approximately_resolve_symbol(
&self,
2018-09-03 11:46:30 -05:00
file_id: FileId,
2018-08-29 10:23:57 -05:00
offset: TextUnit,
) -> Vec<(FileId, FileSymbol)> {
2018-09-03 11:46:30 -05:00
let root = self.root(file_id);
2018-09-15 12:29:22 -05:00
let module_tree = root.module_tree();
2018-09-03 11:46:30 -05:00
let file = root.syntax(file_id);
2018-08-29 10:23:57 -05:00
let syntax = file.syntax();
if let Some(name_ref) = find_node_at_offset::<ast::NameRef>(syntax, offset) {
// First try to resolve the symbol locally
2018-10-06 11:02:15 -05:00
if let Some((name, range)) = resolve_local_name(&file, offset, name_ref) {
let mut vec = vec![];
vec.push((
file_id,
FileSymbol {
name,
node_range: range,
kind: NAME,
},
));
return vec;
} else {
// If that fails try the index based approach.
2018-10-20 14:02:41 -05:00
return self.index_resolve(name_ref);
}
2018-08-29 10:23:57 -05:00
}
if let Some(name) = find_node_at_offset::<ast::Name>(syntax, offset) {
if let Some(module) = name.syntax().parent().and_then(ast::Module::cast) {
if module.has_semi() {
2018-09-15 12:29:22 -05:00
let file_ids = self.resolve_module(&*module_tree, file_id, module);
2018-08-29 10:23:57 -05:00
let res = file_ids
.into_iter()
.map(|id| {
let name = module
.name()
.map(|n| n.text())
.unwrap_or_else(|| SmolStr::new(""));
let symbol = FileSymbol {
name,
node_range: TextRange::offset_len(0.into(), 0.into()),
kind: MODULE,
};
(id, symbol)
})
.collect();
2018-08-29 10:23:57 -05:00
return res;
}
}
}
vec![]
}
2018-10-20 14:02:41 -05:00
pub fn find_all_refs(&self, file_id: FileId, offset: TextUnit) -> Vec<(FileId, TextRange)> {
let root = self.root(file_id);
let file = root.syntax(file_id);
let syntax = file.syntax();
let mut ret = vec![];
// Find the symbol we are looking for
if let Some(name_ref) = find_node_at_offset::<ast::NameRef>(syntax, offset) {
// We are only handing local references for now
if let Some(resolved) = resolve_local_name(&file, offset, name_ref) {
ret.push((file_id, resolved.1));
if let Some(fn_def) = find_node_at_offset::<ast::FnDef>(syntax, offset) {
let refs : Vec<_> = fn_def.syntax().descendants()
.filter_map(ast::NameRef::cast)
.filter(|n: &ast::NameRef| resolve_local_name(&file, n.syntax().range().start(), *n) == Some(resolved.clone()))
.collect();
for r in refs {
ret.push((file_id, r.syntax().range()));
}
}
}
}
ret
}
2018-08-29 10:23:57 -05:00
pub fn diagnostics(&self, file_id: FileId) -> Vec<Diagnostic> {
2018-09-03 11:46:30 -05:00
let root = self.root(file_id);
let module_tree = root.module_tree();
2018-09-03 11:46:30 -05:00
let syntax = root.syntax(file_id);
2018-09-16 04:54:24 -05:00
let mut res = ra_editor::diagnostics(&syntax)
2018-08-29 10:23:57 -05:00
.into_iter()
.map(|d| Diagnostic {
range: d.range,
message: d.msg,
fix: None,
})
2018-08-29 10:23:57 -05:00
.collect::<Vec<_>>();
2018-09-15 12:29:22 -05:00
for (name_node, problem) in module_tree.problems(file_id, syntax.ast()) {
let diag = match problem {
Problem::UnresolvedModule { candidate } => {
let create_file = FileSystemEdit::CreateFile {
anchor: file_id,
path: candidate.clone(),
};
let fix = SourceChange {
label: "create module".to_string(),
source_file_edits: Vec::new(),
file_system_edits: vec![create_file],
cursor_position: None,
};
Diagnostic {
range: name_node.syntax().range(),
message: "unresolved module".to_string(),
fix: Some(fix),
2018-08-29 10:23:57 -05:00
}
2018-09-15 12:29:22 -05:00
}
Problem::NotDirOwner { move_to, candidate } => {
let move_file = FileSystemEdit::MoveFile {
file: file_id,
path: move_to.clone(),
};
let create_file = FileSystemEdit::CreateFile {
anchor: file_id,
path: move_to.join(candidate),
};
2018-09-15 12:29:22 -05:00
let fix = SourceChange {
label: "move file and create module".to_string(),
source_file_edits: Vec::new(),
file_system_edits: vec![move_file, create_file],
cursor_position: None,
};
Diagnostic {
range: name_node.syntax().range(),
message: "can't declare module at this location".to_string(),
fix: Some(fix),
2018-08-29 10:23:57 -05:00
}
2018-09-15 12:29:22 -05:00
}
};
res.push(diag)
}
2018-08-29 10:23:57 -05:00
res
}
2018-09-05 16:59:07 -05:00
pub fn assists(&self, file_id: FileId, range: TextRange) -> Vec<SourceChange> {
2018-08-29 10:23:57 -05:00
let file = self.file_syntax(file_id);
2018-09-05 16:59:07 -05:00
let offset = range.start();
2018-08-29 10:23:57 -05:00
let actions = vec![
(
"flip comma",
ra_editor::flip_comma(&file, offset).map(|f| f()),
),
(
"add `#[derive]`",
ra_editor::add_derive(&file, offset).map(|f| f()),
),
2018-09-16 04:54:24 -05:00
("add impl", ra_editor::add_impl(&file, offset).map(|f| f())),
(
"introduce variable",
ra_editor::introduce_variable(&file, range).map(|f| f()),
),
2018-08-29 10:23:57 -05:00
];
actions
.into_iter()
2018-08-30 08:27:09 -05:00
.filter_map(|(name, local_edit)| {
Some(SourceChange::from_local_edit(file_id, name, local_edit?))
2018-08-30 08:27:09 -05:00
})
.collect()
2018-08-29 10:23:57 -05:00
}
pub fn resolve_callable(
&self,
file_id: FileId,
offset: TextUnit,
) -> Option<(FnDescriptor, Option<usize>)> {
let root = self.root(file_id);
let file = root.syntax(file_id);
let syntax = file.syntax();
// Find the calling expression and it's NameRef
let calling_node = FnCallNode::with_node(syntax, offset)?;
let name_ref = calling_node.name_ref()?;
// Resolve the function's NameRef (NOTE: this isn't entirely accurate).
2018-10-20 14:02:41 -05:00
let file_symbols = self.index_resolve(name_ref);
for (_, fs) in file_symbols {
if fs.kind == FN_DEF {
if let Some(fn_def) = find_node_at_offset(syntax, fs.node_range.start()) {
if let Some(descriptor) = FnDescriptor::new(fn_def) {
// If we have a calling expression let's find which argument we are on
let mut current_parameter = None;
let num_params = descriptor.params.len();
let has_self = fn_def.param_list().and_then(|l| l.self_param()).is_some();
if num_params == 1 {
if !has_self {
current_parameter = Some(1);
}
} else if num_params > 1 {
// Count how many parameters into the call we are.
// TODO: This is best effort for now and should be fixed at some point.
// It may be better to see where we are in the arg_list and then check
// where offset is in that list (or beyond).
// Revisit this after we get documentation comments in.
if let Some(ref arg_list) = calling_node.arg_list() {
let start = arg_list.syntax().range().start();
let range_search = TextRange::from_to(start, offset);
let mut commas: usize = arg_list
.syntax()
.text()
.slice(range_search)
.to_string()
.matches(",")
.count();
// If we have a method call eat the first param since it's just self.
if has_self {
commas = commas + 1;
}
current_parameter = Some(commas);
}
}
return Some((descriptor, current_parameter));
}
}
}
}
None
}
2018-10-20 14:02:41 -05:00
fn index_resolve(&self, name_ref: ast::NameRef) -> Vec<(FileId, FileSymbol)> {
2018-08-29 10:23:57 -05:00
let name = name_ref.text();
let mut query = Query::new(name.to_string());
query.exact();
query.limit(4);
2018-10-20 14:02:41 -05:00
self.world_symbols(query)
2018-08-29 10:23:57 -05:00
}
fn resolve_module(
&self,
module_tree: &ModuleTreeDescriptor,
file_id: FileId,
module: ast::Module,
) -> Vec<FileId> {
2018-08-29 10:23:57 -05:00
let name = match module.name() {
Some(name) => name.text(),
None => return Vec::new(),
};
2018-09-15 12:29:22 -05:00
module_tree.child_module_by_name(file_id, name.as_str())
2018-08-29 10:23:57 -05:00
}
}
2018-09-10 04:57:40 -05:00
#[derive(Default, Clone, Debug)]
2018-08-30 05:12:49 -05:00
struct WorldData {
2018-08-31 11:14:08 -05:00
crate_graph: CrateGraph,
2018-10-15 14:05:21 -05:00
root: WritableSourceRoot,
2018-09-03 13:03:37 -05:00
libs: Vec<Arc<ReadonlySourceRoot>>,
2018-08-29 10:23:57 -05:00
}
2018-08-30 04:34:31 -05:00
impl SourceChange {
pub(crate) fn from_local_edit(file_id: FileId, label: &str, edit: LocalEdit) -> SourceChange {
let file_edit = SourceFileEdit {
file_id,
edits: edit.edit.into_atoms(),
};
SourceChange {
label: label.to_string(),
source_file_edits: vec![file_edit],
file_system_edits: vec![],
cursor_position: edit
.cursor_position
.map(|offset| Position { offset, file_id }),
2018-08-30 04:34:31 -05:00
}
}
}
2018-08-31 11:14:08 -05:00
impl CrateGraph {
fn crate_id_for_crate_root(&self, file_id: FileId) -> Option<CrateId> {
let (&crate_id, _) = self
.crate_roots
2018-08-31 11:14:08 -05:00
.iter()
.find(|(_crate_id, &root_id)| root_id == file_id)?;
Some(crate_id)
}
}
enum FnCallNode<'a> {
CallExpr(ast::CallExpr<'a>),
MethodCallExpr(ast::MethodCallExpr<'a>),
}
impl<'a> FnCallNode<'a> {
pub fn with_node(syntax: SyntaxNodeRef, offset: TextUnit) -> Option<FnCallNode> {
if let Some(expr) = find_node_at_offset::<ast::CallExpr>(syntax, offset) {
return Some(FnCallNode::CallExpr(expr));
}
if let Some(expr) = find_node_at_offset::<ast::MethodCallExpr>(syntax, offset) {
return Some(FnCallNode::MethodCallExpr(expr));
}
None
}
pub fn name_ref(&self) -> Option<ast::NameRef> {
match *self {
FnCallNode::CallExpr(call_expr) => Some(match call_expr.expr()? {
Expr::PathExpr(path_expr) => path_expr.path()?.segment()?.name_ref()?,
_ => return None,
}),
FnCallNode::MethodCallExpr(call_expr) => call_expr
.syntax()
.children()
.filter_map(ast::NameRef::cast)
.nth(0),
}
}
pub fn arg_list(&self) -> Option<ast::ArgList> {
match *self {
FnCallNode::CallExpr(expr) => expr.arg_list(),
FnCallNode::MethodCallExpr(expr) => expr.arg_list(),
}
}
2018-10-15 12:15:53 -05:00
}