1 //! Structural Search Replace
3 //! Allows searching the AST for code that matches one or more patterns and then replacing that code
4 //! based on a template.
6 // Feature: Structural Search and Replace
8 // Search and replace with named wildcards that will match any expression, type, path, pattern or item.
9 // The syntax for a structural search replace command is `<search_pattern> ==>> <replace_pattern>`.
10 // A `$<name>` placeholder in the search pattern will match any AST node and `$<name>` will reference it in the replacement.
11 // Within a macro call, a placeholder will match up until whatever token follows the placeholder.
13 // All paths in both the search pattern and the replacement template must resolve in the context
14 // in which this command is invoked. Paths in the search pattern will then match the code if they
15 // resolve to the same item, even if they're written differently. For example if we invoke the
16 // command in the module `foo` with a pattern of `Bar`, then code in the parent module that refers
17 // to `foo::Bar` will match.
19 // Paths in the replacement template will be rendered appropriately for the context in which the
20 // replacement occurs. For example if our replacement template is `foo::Bar` and we match some
21 // code in the `foo` module, we'll insert just `Bar`.
23 // Inherent method calls should generally be written in UFCS form. e.g. `foo::Bar::baz($s, $a)` will
24 // match `$s.baz($a)`, provided the method call `baz` resolves to the method `foo::Bar::baz`. When a
25 // placeholder is the receiver of a method call in the search pattern (e.g. `$s.foo()`), but not in
26 // the replacement template (e.g. `bar($s)`), then *, & and &mut will be added as needed to mirror
27 // whatever autoderef and autoref was happening implicitly in the matched code.
29 // The scope of the search / replace will be restricted to the current selection if any, otherwise
30 // it will apply to the whole workspace.
32 // Placeholders may be given constraints by writing them as `${<name>:<constraint1>:<constraint2>...}`.
34 // Supported constraints:
37 // | Constraint | Restricts placeholder
39 // | kind(literal) | Is a literal (e.g. `42` or `"forty two"`)
40 // | not(a) | Negates the constraint `a`
43 // Available via the command `rust-analyzer.ssr`.
46 // // Using structural search replace command [foo($a, $b) ==>> ($a).foo($b)]
49 // String::from(foo(y + 5, z))
52 // String::from((y + 5).foo(z))
56 // | Editor | Action Name
58 // | VS Code | **Rust Analyzer: Structural Search Replace**
61 // Also available as an assist, by writing a comment containing the structural
62 // search and replace rule. You will only see the assist if the comment can
63 // be parsed as a valid structural search and replace rule.
66 // // Place the cursor on the line below to see the assist 💡.
67 // // foo($a, $b) ==>> ($a).foo($b)
82 use crate::errors::bail;
83 pub use crate::errors::SsrError;
84 pub use crate::from_comment::ssr_from_comment;
85 pub use crate::matching::Match;
86 use crate::matching::MatchFailureReason;
88 use ide_db::base_db::{FileId, FilePosition, FileRange};
89 use resolving::ResolvedRule;
90 use rustc_hash::FxHashMap;
91 use syntax::{ast, AstNode, SyntaxNode, TextRange};
92 use text_edit::TextEdit;
94 // A structured search replace rule. Create by calling `parse` on a str.
97 /// A structured pattern that we're searching for.
98 pattern: parsing::RawPattern,
99 /// What we'll replace it with.
100 template: parsing::RawPattern,
101 parsed_rules: Vec<parsing::ParsedRule>,
105 pub struct SsrPattern {
106 parsed_rules: Vec<parsing::ParsedRule>,
109 #[derive(Debug, Default)]
110 pub struct SsrMatches {
111 pub matches: Vec<Match>,
114 /// Searches a crate for pattern matches and possibly replaces them with something else.
115 pub struct MatchFinder<'db> {
116 /// Our source of information about the user's code.
117 sema: Semantics<'db, ide_db::RootDatabase>,
118 rules: Vec<ResolvedRule>,
119 resolution_scope: resolving::ResolutionScope<'db>,
120 restrict_ranges: Vec<FileRange>,
123 impl<'db> MatchFinder<'db> {
124 /// Constructs a new instance where names will be looked up as if they appeared at
125 /// `lookup_context`.
127 db: &'db ide_db::RootDatabase,
128 lookup_context: FilePosition,
129 mut restrict_ranges: Vec<FileRange>,
130 ) -> MatchFinder<'db> {
131 restrict_ranges.retain(|range| !range.range.is_empty());
132 let sema = Semantics::new(db);
133 let resolution_scope = resolving::ResolutionScope::new(&sema, lookup_context);
134 MatchFinder { sema, rules: Vec::new(), resolution_scope, restrict_ranges }
137 /// Constructs an instance using the start of the first file in `db` as the lookup context.
138 pub fn at_first_file(db: &'db ide_db::RootDatabase) -> Result<MatchFinder<'db>, SsrError> {
139 use ide_db::base_db::SourceDatabaseExt;
140 use ide_db::symbol_index::SymbolsDatabase;
141 if let Some(first_file_id) =
142 db.local_roots().iter().next().and_then(|root| db.source_root(*root).iter().next())
144 Ok(MatchFinder::in_context(
146 FilePosition { file_id: first_file_id, offset: 0.into() },
150 bail!("No files to search");
154 /// Adds a rule to be applied. The order in which rules are added matters. Earlier rules take
155 /// precedence. If a node is matched by an earlier rule, then later rules won't be permitted to
157 pub fn add_rule(&mut self, rule: SsrRule) -> Result<(), SsrError> {
158 for parsed_rule in rule.parsed_rules {
159 self.rules.push(ResolvedRule::new(
161 &self.resolution_scope,
168 /// Finds matches for all added rules and returns edits for all found matches.
169 pub fn edits(&self) -> FxHashMap<FileId, TextEdit> {
170 use ide_db::base_db::SourceDatabaseExt;
171 let mut matches_by_file = FxHashMap::default();
172 for m in self.matches().matches {
174 .entry(m.range.file_id)
175 .or_insert_with(SsrMatches::default)
181 .map(|(file_id, matches)| {
184 replacing::matches_to_edit(
186 &self.sema.db.file_text(file_id),
194 /// Adds a search pattern. For use if you intend to only call `find_matches_in_file`. If you
195 /// intend to do replacement, use `add_rule` instead.
196 pub fn add_search_pattern(&mut self, pattern: SsrPattern) -> Result<(), SsrError> {
197 for parsed_rule in pattern.parsed_rules {
198 self.rules.push(ResolvedRule::new(
200 &self.resolution_scope,
207 /// Returns matches for all added rules.
208 pub fn matches(&self) -> SsrMatches {
209 let mut matches = Vec::new();
210 let mut usage_cache = search::UsageCache::default();
211 for rule in &self.rules {
212 self.find_matches_for_rule(rule, &mut usage_cache, &mut matches);
214 nester::nest_and_remove_collisions(matches, &self.sema)
217 /// Finds all nodes in `file_id` whose text is exactly equal to `snippet` and attempts to match
218 /// them, while recording reasons why they don't match. This API is useful for command
219 /// line-based debugging where providing a range is difficult.
220 pub fn debug_where_text_equal(&self, file_id: FileId, snippet: &str) -> Vec<MatchDebugInfo> {
221 use ide_db::base_db::SourceDatabaseExt;
222 let file = self.sema.parse(file_id);
223 let mut res = Vec::new();
224 let file_text = self.sema.db.file_text(file_id);
225 let mut remaining_text = file_text.as_str();
227 let len = snippet.len() as u32;
228 while let Some(offset) = remaining_text.find(snippet) {
229 let start = base + offset as u32;
230 let end = start + len;
231 self.output_debug_for_nodes_at_range(
233 FileRange { file_id, range: TextRange::new(start.into(), end.into()) },
237 remaining_text = &remaining_text[offset + snippet.len()..];
243 fn output_debug_for_nodes_at_range(
247 restrict_range: &Option<FileRange>,
248 out: &mut Vec<MatchDebugInfo>,
250 for node in node.children() {
251 let node_range = self.sema.original_range(&node);
252 if node_range.file_id != range.file_id || !node_range.range.contains_range(range.range)
256 if node_range.range == range.range {
257 for rule in &self.rules {
258 // For now we ignore rules that have a different kind than our node, otherwise
259 // we get lots of noise. If at some point we add support for restricting rules
260 // to a particular kind of thing (e.g. only match type references), then we can
261 // relax this. We special-case expressions, since function calls can match
263 if rule.pattern.node.kind() != node.kind()
264 && !(ast::Expr::can_cast(rule.pattern.node.kind())
265 && ast::Expr::can_cast(node.kind()))
269 out.push(MatchDebugInfo {
270 matched: matching::get_match(true, rule, &node, restrict_range, &self.sema)
271 .map_err(|e| MatchFailureReason {
272 reason: e.reason.unwrap_or_else(|| {
273 "Match failed, but no reason was given".to_owned()
276 pattern: rule.pattern.node.clone(),
280 } else if let Some(macro_call) = ast::MacroCall::cast(node.clone()) {
281 if let Some(expanded) = self.sema.expand(¯o_call) {
282 if let Some(tt) = macro_call.token_tree() {
283 self.output_debug_for_nodes_at_range(
286 &Some(self.sema.original_range(tt.syntax())),
292 self.output_debug_for_nodes_at_range(&node, range, restrict_range, out);
297 pub struct MatchDebugInfo {
299 /// Our search pattern parsed as an expression or item, etc
301 matched: Result<Match, MatchFailureReason>,
304 impl std::fmt::Debug for MatchDebugInfo {
305 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
306 match &self.matched {
307 Ok(_) => writeln!(f, "Node matched")?,
308 Err(reason) => writeln!(f, "Node failed to match because: {}", reason.reason)?,
312 "============ AST ===========\n\
316 writeln!(f, "========= PATTERN ==========")?;
317 writeln!(f, "{:#?}", self.pattern)?;
318 writeln!(f, "============================")?;
324 /// Returns `self` with any nested matches removed and made into top-level matches.
325 pub fn flattened(self) -> SsrMatches {
326 let mut out = SsrMatches::default();
327 self.flatten_into(&mut out);
331 fn flatten_into(self, out: &mut SsrMatches) {
332 for mut m in self.matches {
333 for p in m.placeholder_values.values_mut() {
334 std::mem::take(&mut p.inner_matches).flatten_into(out);
342 pub fn matched_text(&self) -> String {
343 self.matched_node.text().to_string()
347 impl std::error::Error for SsrError {}
350 impl MatchDebugInfo {
351 pub(crate) fn match_failure_reason(&self) -> Option<&str> {
352 self.matched.as_ref().err().map(|r| r.reason.as_str())