Merge #10839
10839: fix: Fix mbe::Shift::new not accounting for non-ident token ids r=Veykril a=Veykril Fixes https://github.com/rust-analyzer/rust-analyzer/issues/9371 bors r+ Co-authored-by: Lukas Wirth <lukastw97@gmail.com>
This commit is contained in:
commit
a07e406d06
@ -27,7 +27,7 @@ struct $ident {
|
|||||||
f!(struct MyTraitMap2);
|
f!(struct MyTraitMap2);
|
||||||
"#,
|
"#,
|
||||||
expect![[r##"
|
expect![[r##"
|
||||||
// call ids will be shifted by Shift(27)
|
// call ids will be shifted by Shift(30)
|
||||||
// +tokenids
|
// +tokenids
|
||||||
macro_rules! f {#0
|
macro_rules! f {#0
|
||||||
(#1 struct#2 $#3ident#4:#5ident#6 )#1 =#7>#8 {#9
|
(#1 struct#2 $#3ident#4:#5ident#6 )#1 =#7>#8 {#9
|
||||||
@ -39,7 +39,7 @@ macro_rules! f {#0
|
|||||||
|
|
||||||
// // +tokenids
|
// // +tokenids
|
||||||
// f!(struct#1 MyTraitMap2#2);
|
// f!(struct#1 MyTraitMap2#2);
|
||||||
struct#10 MyTraitMap2#29 {#13
|
struct#10 MyTraitMap2#32 {#13
|
||||||
map#14:#15 ::std#18::collections#21::HashSet#24<#25(#26)#26>#27,#28
|
map#14:#15 ::std#18::collections#21::HashSet#24<#25(#26)#26>#27,#28
|
||||||
}#13
|
}#13
|
||||||
"##]],
|
"##]],
|
||||||
|
@ -279,6 +279,13 @@ pub fn is_attr_macro(&self, db: &dyn db::AstDatabase) -> bool {
|
|||||||
pub fn is_macro(self) -> bool {
|
pub fn is_macro(self) -> bool {
|
||||||
matches!(self.0, HirFileIdRepr::MacroFile(_))
|
matches!(self.0, HirFileIdRepr::MacroFile(_))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
pub fn macro_file(self) -> Option<MacroFile> {
|
||||||
|
match self.0 {
|
||||||
|
HirFileIdRepr::FileId(_) => None,
|
||||||
|
HirFileIdRepr::MacroFile(m) => Some(m),
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl MacroDefId {
|
impl MacroDefId {
|
||||||
@ -377,6 +384,8 @@ pub struct ExpansionInfo {
|
|||||||
|
|
||||||
macro_def: Arc<TokenExpander>,
|
macro_def: Arc<TokenExpander>,
|
||||||
macro_arg: Arc<(tt::Subtree, mbe::TokenMap)>,
|
macro_arg: Arc<(tt::Subtree, mbe::TokenMap)>,
|
||||||
|
/// A shift built from `macro_arg`'s subtree, relevant for attributes as the item is the macro arg
|
||||||
|
/// and as such we need to shift tokens if they are part of an attributes input instead of their item.
|
||||||
macro_arg_shift: mbe::Shift,
|
macro_arg_shift: mbe::Shift,
|
||||||
exp_map: Arc<mbe::TokenMap>,
|
exp_map: Arc<mbe::TokenMap>,
|
||||||
}
|
}
|
||||||
@ -390,6 +399,20 @@ pub fn call_node(&self) -> Option<InFile<SyntaxNode>> {
|
|||||||
Some(self.arg.with_value(self.arg.value.parent()?))
|
Some(self.arg.with_value(self.arg.value.parent()?))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Map a token down from macro input into the macro expansion.
|
||||||
|
///
|
||||||
|
/// The inner workings of this function differ slightly depending on the type of macro we are dealing with:
|
||||||
|
/// - declarative:
|
||||||
|
/// For declarative macros, we need to accommodate for the macro definition site(which acts as a second unchanging input)
|
||||||
|
/// , as tokens can mapped in and out of it.
|
||||||
|
/// To do this we shift all ids in the expansion by the maximum id of the definition site giving us an easy
|
||||||
|
/// way to map all the tokens.
|
||||||
|
/// - attribute:
|
||||||
|
/// Attributes have two different inputs, the input tokentree in the attribute node and the item
|
||||||
|
/// the attribute is annotating. Similarly as for declarative macros we need to do a shift here
|
||||||
|
/// as well. Currently this is done by shifting the attribute input by the maximum id of the item.
|
||||||
|
/// - function-like and derives:
|
||||||
|
/// Both of these only have one simple call site input so no special handling is required here.
|
||||||
pub fn map_token_down(
|
pub fn map_token_down(
|
||||||
&self,
|
&self,
|
||||||
db: &dyn db::AstDatabase,
|
db: &dyn db::AstDatabase,
|
||||||
@ -397,12 +420,10 @@ pub fn map_token_down(
|
|||||||
token: InFile<&SyntaxToken>,
|
token: InFile<&SyntaxToken>,
|
||||||
) -> Option<impl Iterator<Item = InFile<SyntaxToken>> + '_> {
|
) -> Option<impl Iterator<Item = InFile<SyntaxToken>> + '_> {
|
||||||
assert_eq!(token.file_id, self.arg.file_id);
|
assert_eq!(token.file_id, self.arg.file_id);
|
||||||
let token_id = if let Some(item) = item {
|
let token_id_in_attr_input = if let Some(item) = item {
|
||||||
// check if we are mapping down in an attribute input
|
// check if we are mapping down in an attribute input
|
||||||
let call_id = match self.expanded.file_id.0 {
|
// this is a special case as attributes can have two inputs
|
||||||
HirFileIdRepr::FileId(_) => return None,
|
let call_id = self.expanded.file_id.macro_file()?.macro_call_id;
|
||||||
HirFileIdRepr::MacroFile(macro_file) => macro_file.macro_call_id,
|
|
||||||
};
|
|
||||||
let loc = db.lookup_intern_macro_call(call_id);
|
let loc = db.lookup_intern_macro_call(call_id);
|
||||||
|
|
||||||
let token_range = token.value.text_range();
|
let token_range = token.value.text_range();
|
||||||
@ -415,9 +436,12 @@ pub fn map_token_down(
|
|||||||
{
|
{
|
||||||
let attr_input_start =
|
let attr_input_start =
|
||||||
token_tree.left_delimiter_token()?.text_range().start();
|
token_tree.left_delimiter_token()?.text_range().start();
|
||||||
let range = token.value.text_range().checked_sub(attr_input_start)?;
|
let relative_range =
|
||||||
let token_id =
|
token.value.text_range().checked_sub(attr_input_start)?;
|
||||||
self.macro_arg_shift.shift(attr_args.1.token_by_range(range)?);
|
// shift by the item's tree's max id
|
||||||
|
let token_id = self
|
||||||
|
.macro_arg_shift
|
||||||
|
.shift(attr_args.1.token_by_range(relative_range)?);
|
||||||
Some(token_id)
|
Some(token_id)
|
||||||
}
|
}
|
||||||
_ => None,
|
_ => None,
|
||||||
@ -429,12 +453,14 @@ pub fn map_token_down(
|
|||||||
None
|
None
|
||||||
};
|
};
|
||||||
|
|
||||||
let token_id = match token_id {
|
let token_id = match token_id_in_attr_input {
|
||||||
Some(token_id) => token_id,
|
Some(token_id) => token_id,
|
||||||
|
// the token is not inside an attribute's input so do the lookup in the macro_arg as ususal
|
||||||
None => {
|
None => {
|
||||||
let range =
|
let relative_range =
|
||||||
token.value.text_range().checked_sub(self.arg.value.text_range().start())?;
|
token.value.text_range().checked_sub(self.arg.value.text_range().start())?;
|
||||||
let token_id = self.macro_arg.1.token_by_range(range)?;
|
let token_id = self.macro_arg.1.token_by_range(relative_range)?;
|
||||||
|
// conditionally shift the id by a declaratives macro definition
|
||||||
self.macro_def.map_id_down(token_id)
|
self.macro_def.map_id_down(token_id)
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
@ -447,28 +473,33 @@ pub fn map_token_down(
|
|||||||
Some(tokens.map(move |token| self.expanded.with_value(token)))
|
Some(tokens.map(move |token| self.expanded.with_value(token)))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Map a token up out of the expansion it resides in into the arguments of the macro call of the expansion.
|
||||||
pub fn map_token_up(
|
pub fn map_token_up(
|
||||||
&self,
|
&self,
|
||||||
db: &dyn db::AstDatabase,
|
db: &dyn db::AstDatabase,
|
||||||
token: InFile<&SyntaxToken>,
|
token: InFile<&SyntaxToken>,
|
||||||
) -> Option<(InFile<SyntaxToken>, Origin)> {
|
) -> Option<(InFile<SyntaxToken>, Origin)> {
|
||||||
|
// Fetch the id through its text range,
|
||||||
let token_id = self.exp_map.token_by_range(token.value.text_range())?;
|
let token_id = self.exp_map.token_by_range(token.value.text_range())?;
|
||||||
|
// conditionally unshifting the id to accommodate for macro-rules def site
|
||||||
let (mut token_id, origin) = self.macro_def.map_id_up(token_id);
|
let (mut token_id, origin) = self.macro_def.map_id_up(token_id);
|
||||||
|
|
||||||
let call_id = match self.expanded.file_id.0 {
|
let call_id = self.expanded.file_id.macro_file()?.macro_call_id;
|
||||||
HirFileIdRepr::FileId(_) => return None,
|
|
||||||
HirFileIdRepr::MacroFile(macro_file) => macro_file.macro_call_id,
|
|
||||||
};
|
|
||||||
let loc = db.lookup_intern_macro_call(call_id);
|
let loc = db.lookup_intern_macro_call(call_id);
|
||||||
|
|
||||||
|
// Attributes are a bit special for us, they have two inputs, the input tokentree and the annotated item.
|
||||||
let (token_map, tt) = match &loc.kind {
|
let (token_map, tt) = match &loc.kind {
|
||||||
MacroCallKind::Attr { attr_args, .. } => match self.macro_arg_shift.unshift(token_id) {
|
MacroCallKind::Attr { attr_args: (_, arg_token_map), .. } => {
|
||||||
Some(unshifted) => {
|
// try unshifting the the token id, if unshifting fails, the token resides in the non-item attribute input
|
||||||
token_id = unshifted;
|
// note that the `TokenExpander::map_id_up` earlier only unshifts for declarative macros, so we don't double unshift with this
|
||||||
(&attr_args.1, self.attr_input_or_mac_def.clone()?.syntax().cloned())
|
match self.macro_arg_shift.unshift(token_id) {
|
||||||
|
Some(unshifted) => {
|
||||||
|
token_id = unshifted;
|
||||||
|
(arg_token_map, self.attr_input_or_mac_def.clone()?.syntax().cloned())
|
||||||
|
}
|
||||||
|
None => (&self.macro_arg.1, self.arg.clone()),
|
||||||
}
|
}
|
||||||
None => (&self.macro_arg.1, self.arg.clone()),
|
}
|
||||||
},
|
|
||||||
_ => match origin {
|
_ => match origin {
|
||||||
mbe::Origin::Call => (&self.macro_arg.1, self.arg.clone()),
|
mbe::Origin::Call => (&self.macro_arg.1, self.arg.clone()),
|
||||||
mbe::Origin::Def => match (&*self.macro_def, &self.attr_input_or_mac_def) {
|
mbe::Origin::Def => match (&*self.macro_def, &self.attr_input_or_mac_def) {
|
||||||
|
@ -120,12 +120,15 @@ fn max_id(subtree: &tt::Subtree) -> Option<u32> {
|
|||||||
_ => tree_id,
|
_ => tree_id,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
tt::TokenTree::Leaf(tt::Leaf::Ident(ident))
|
tt::TokenTree::Leaf(leaf) => {
|
||||||
if ident.id != tt::TokenId::unspecified() =>
|
let id = match leaf {
|
||||||
{
|
tt::Leaf::Literal(it) => it.id,
|
||||||
Some(ident.id.0)
|
tt::Leaf::Punct(it) => it.id,
|
||||||
|
tt::Leaf::Ident(it) => it.id,
|
||||||
|
};
|
||||||
|
|
||||||
|
(id != tt::TokenId::unspecified()).then(|| id.0)
|
||||||
}
|
}
|
||||||
_ => None,
|
|
||||||
})
|
})
|
||||||
.max()
|
.max()
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user