pub mod node_ext;
pub mod rust_doc;
-use std::collections::VecDeque;
+use std::{collections::VecDeque, iter};
use base_db::FileId;
use either::Either;
-use hir::{ItemInNs, MacroDef, ModuleDef, Name, Semantics};
+use hir::{ItemInNs, MacroDef, ModuleDef, Name, PathResolution, Semantics};
+use itertools::Itertools;
use syntax::{
- ast::{self, make, LoopBodyOwner},
- AstNode, Direction, SyntaxElement, SyntaxKind, SyntaxToken, TokenAtOffset, WalkEvent, T,
+ ast::{self, make, HasLoopBody, Ident},
+ AstNode, AstToken, Direction, SyntaxElement, SyntaxKind, SyntaxToken, TokenAtOffset, WalkEvent,
+ T,
};
use crate::RootDatabase;
}
}
-/// Resolves the path at the cursor token as a derive macro if it inside a token tree of a derive attribute.
-pub fn try_resolve_derive_input_at(
+/// Parses and returns the derive path at the cursor position in the given attribute, if it is a derive.
+/// This special case is required because the derive macro is a compiler builtin that discards the input derives.
+///
+/// The returned path is synthesized from TokenTree tokens and as such cannot be used with the [`Semantics`].
+pub fn get_path_in_derive_attr(
sema: &hir::Semantics<RootDatabase>,
- derive_attr: &ast::Attr,
- cursor: &SyntaxToken,
-) -> Option<MacroDef> {
- use itertools::Itertools;
- if cursor.kind() != T![ident] {
+ attr: &ast::Attr,
+ cursor: &Ident,
+) -> Option<ast::Path> {
+ let cursor = cursor.syntax();
+ let path = attr.path()?;
+ let tt = attr.token_tree()?;
+ if !tt.syntax().text_range().contains_range(cursor.text_range()) {
return None;
}
- let tt = match derive_attr.as_simple_call() {
- Some((name, tt))
- if name == "derive" && tt.syntax().text_range().contains_range(cursor.text_range()) =>
- {
- tt
- }
- _ => return None,
- };
- let tokens: Vec<_> = cursor
+ let scope = sema.scope(attr.syntax());
+ let resolved_attr = sema.resolve_path(&path)?;
+ let derive = FamousDefs(sema, scope.krate()).core_macros_builtin_derive()?;
+ if PathResolution::Macro(derive) != resolved_attr {
+ return None;
+ }
+
+ let first = cursor
.siblings_with_tokens(Direction::Prev)
- .flat_map(SyntaxElement::into_token)
+ .filter_map(SyntaxElement::into_token)
.take_while(|tok| tok.kind() != T!['('] && tok.kind() != T![,])
- .collect();
- let path = ast::Path::parse(&tokens.into_iter().rev().join("")).ok()?;
- match sema.scope(tt.syntax()).speculative_resolve(&path) {
- Some(hir::PathResolution::Macro(makro)) if makro.kind() == hir::MacroKind::Derive => {
- Some(makro)
- }
- _ => None,
+ .last()?;
+ let path_tokens = first
+ .siblings_with_tokens(Direction::Next)
+ .filter_map(SyntaxElement::into_token)
+ .take_while(|tok| tok != cursor);
+
+ ast::Path::parse(&path_tokens.chain(iter::once(cursor.clone())).join("")).ok()
+}
+
+/// Parses and resolves the path at the cursor position in the given attribute, if it is a derive.
+/// This special case is required because the derive macro is a compiler builtin that discards the input derives.
+pub fn try_resolve_derive_input(
+ sema: &hir::Semantics<RootDatabase>,
+ attr: &ast::Attr,
+ cursor: &Ident,
+) -> Option<PathResolution> {
+ let path = get_path_in_derive_attr(sema, attr, cursor)?;
+ let scope = sema.scope(attr.syntax());
+ // FIXME: This double resolve shouldn't be necessary
+ // It's only here so we prefer macros over other namespaces
+ match scope.speculative_resolve_as_mac(&path) {
+ Some(mac) if mac.kind() == hir::MacroKind::Derive => Some(PathResolution::Macro(mac)),
+ Some(_) => return None,
+ None => scope
+ .speculative_resolve(&path)
+ .filter(|res| matches!(res, PathResolution::Def(ModuleDef::Module(_)))),
}
}
pub fn for_each_tail_expr(expr: &ast::Expr, cb: &mut dyn FnMut(&ast::Expr)) {
match expr {
ast::Expr::BlockExpr(b) => {
- if let Some(e) = b.tail_expr() {
- for_each_tail_expr(&e, cb);
- }
- }
- ast::Expr::EffectExpr(e) => match e.effect() {
- ast::Effect::Label(label) => {
- for_each_break_expr(Some(label), e.block_expr(), &mut |b| {
- cb(&ast::Expr::BreakExpr(b))
- });
- if let Some(b) = e.block_expr() {
- for_each_tail_expr(&ast::Expr::BlockExpr(b), cb);
+ match b.modifier() {
+ Some(
+ ast::BlockModifier::Async(_)
+ | ast::BlockModifier::Try(_)
+ | ast::BlockModifier::Const(_),
+ ) => return cb(expr),
+
+ Some(ast::BlockModifier::Label(label)) => {
+ for_each_break_expr(Some(label), b.stmt_list(), &mut |b| {
+ cb(&ast::Expr::BreakExpr(b))
+ });
}
+ Some(ast::BlockModifier::Unsafe(_)) => (),
+ None => (),
}
- ast::Effect::Unsafe(_) => {
- if let Some(e) = e.block_expr().and_then(|b| b.tail_expr()) {
+ if let Some(stmt_list) = b.stmt_list() {
+ if let Some(e) = stmt_list.tail_expr() {
for_each_tail_expr(&e, cb);
}
}
- ast::Effect::Async(_) | ast::Effect::Try(_) | ast::Effect::Const(_) => cb(expr),
- },
+ }
ast::Expr::IfExpr(if_) => {
let mut if_ = if_.clone();
loop {
}
}
ast::Expr::LoopExpr(l) => {
- for_each_break_expr(l.label(), l.loop_body(), &mut |b| cb(&ast::Expr::BreakExpr(b)))
+ for_each_break_expr(l.label(), l.loop_body().and_then(|it| it.stmt_list()), &mut |b| {
+ cb(&ast::Expr::BreakExpr(b))
+ })
}
ast::Expr::MatchExpr(m) => {
if let Some(arms) = m.match_arm_list() {
/// Calls `cb` on each break expr inside of `body` that is applicable for the given label.
pub fn for_each_break_expr(
label: Option<ast::Label>,
- body: Option<ast::BlockExpr>,
+ body: Option<ast::StmtList>,
cb: &mut dyn FnMut(ast::BreakExpr),
) {
let label = label.and_then(|lbl| lbl.lifetime());
ast::Expr::LoopExpr(_) | ast::Expr::WhileExpr(_) | ast::Expr::ForExpr(_) => {
depth += 1
}
- ast::Expr::EffectExpr(e) if e.label().is_some() => depth += 1,
+ ast::Expr::BlockExpr(e) if e.label().is_some() => depth += 1,
ast::Expr::BreakExpr(b)
if (depth == 0 && b.lifetime().is_none()) || eq_label(b.lifetime()) =>
{
ast::Expr::LoopExpr(_) | ast::Expr::WhileExpr(_) | ast::Expr::ForExpr(_) => {
depth -= 1
}
- ast::Expr::EffectExpr(e) if e.label().is_some() => depth -= 1,
+ ast::Expr::BlockExpr(e) if e.label().is_some() => depth -= 1,
_ => (),
},
}