1 //! HIR walker for walking the contents of nodes.
3 //! Here are the three available patterns for the visitor strategy,
4 //! in roughly the order of desirability:
6 //! 1. **Shallow visit**: Get a simple callback for every item (or item-like thing) in the HIR.
7 //! - Example: find all items with a `#[foo]` attribute on them.
8 //! - How: Use the `hir_crate_items` or `hir_module_items` query to traverse over item-like ids
9 //! (ItemId, TraitItemId, etc.) and use tcx.def_kind and `tcx.hir().item*(id)` to filter and
10 //! access actual item-like thing, respectively.
11 //! - Pro: Efficient; just walks the lists of item ids and gives users control whether to access
12 //! the hir_owners themselves or not.
13 //! - Con: Don't get information about nesting
14 //! - Con: Don't have methods for specific bits of HIR, like "on
15 //! every expr, do this".
16 //! 2. **Deep visit**: Want to scan for specific kinds of HIR nodes within
17 //! an item, but don't care about how item-like things are nested
18 //! within one another.
19 //! - Example: Examine each expression to look for its type and do some check or other.
20 //! - How: Implement `intravisit::Visitor` and override the `NestedFilter` type to
21 //! `nested_filter::OnlyBodies` (and implement `nested_visit_map`), and use
22 //! `tcx.hir().visit_all_item_likes_in_crate(&mut visitor)`. Within your
23 //! `intravisit::Visitor` impl, implement methods like `visit_expr()` (don't forget to invoke
24 //! `intravisit::walk_expr()` to keep walking the subparts).
25 //! - Pro: Visitor methods for any kind of HIR node, not just item-like things.
26 //! - Pro: Integrates well into dependency tracking.
27 //! - Con: Don't get information about nesting between items
28 //! 3. **Nested visit**: Want to visit the whole HIR and you care about the nesting between
30 //! - Example: Lifetime resolution, which wants to bring lifetimes declared on the
31 //! impl into scope while visiting the impl-items, and then back out again.
32 //! - How: Implement `intravisit::Visitor` and override the `NestedFilter` type to
33 //! `nested_filter::All` (and implement `nested_visit_map`). Walk your crate with
34 //! `tcx.hir().walk_toplevel_module(visitor)` invoked on `tcx.hir().krate()`.
35 //! - Pro: Visitor methods for any kind of HIR node, not just item-like things.
36 //! - Pro: Preserves nesting information
37 //! - Con: Does not integrate well into dependency tracking.
39 //! If you have decided to use this visitor, here are some general
40 //! notes on how to do so:
42 //! Each overridden visit method has full control over what
43 //! happens with its node, it can do its own traversal of the node's children,
44 //! call `intravisit::walk_*` to apply the default traversal algorithm, or prevent
45 //! deeper traversal by doing nothing.
47 //! When visiting the HIR, the contents of nested items are NOT visited
48 //! by default. This is different from the AST visitor, which does a deep walk.
49 //! Hence this module is called `intravisit`; see the method `visit_nested_item`
52 //! Note: it is an important invariant that the default visitor walks
53 //! the body of a function in "execution order" - more concretely, if
54 //! we consider the reverse post-order (RPO) of the CFG implied by the HIR,
55 //! then a pre-order traversal of the HIR is consistent with the CFG RPO
56 //! on the *initial CFG point* of each HIR node, while a post-order traversal
57 //! of the HIR is consistent with the CFG RPO on each *final CFG point* of
60 //! One thing that follows is that if HIR node A always starts/ends executing
61 //! before HIR node B, then A appears in traversal pre/postorder before B,
62 //! respectively. (This follows from RPO respecting CFG domination).
64 //! This order consistency is required in a few places in rustc, for
65 //! example generator inference, and possibly also HIR borrowck.
68 use rustc_ast::walk_list;
69 use rustc_ast::{Attribute, Label};
70 use rustc_span::symbol::{Ident, Symbol};
73 pub trait IntoVisitor<'hir> {
74 type Visitor: Visitor<'hir>;
75 fn into_visitor(&self) -> Self::Visitor;
78 #[derive(Copy, Clone, Debug)]
80 /// `#[xxx] pub async/const/extern "Abi" fn foo()`
81 ItemFn(Ident, &'a Generics<'a>, FnHeader),
84 Method(Ident, &'a FnSig<'a>),
91 pub fn header(&self) -> Option<&FnHeader> {
93 FnKind::ItemFn(_, _, ref header) => Some(header),
94 FnKind::Method(_, ref sig) => Some(&sig.header),
95 FnKind::Closure => None,
99 pub fn constness(self) -> Constness {
100 self.header().map_or(Constness::NotConst, |header| header.constness)
103 pub fn asyncness(self) -> IsAsync {
104 self.header().map_or(IsAsync::NotAsync, |header| header.asyncness)
108 /// An abstract representation of the HIR `rustc_middle::hir::map::Map`.
109 pub trait Map<'hir> {
110 /// Retrieves the `Node` corresponding to `id`, returning `None` if cannot be found.
111 fn find(&self, hir_id: HirId) -> Option<Node<'hir>>;
112 fn body(&self, id: BodyId) -> &'hir Body<'hir>;
113 fn item(&self, id: ItemId) -> &'hir Item<'hir>;
114 fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir>;
115 fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir>;
116 fn foreign_item(&self, id: ForeignItemId) -> &'hir ForeignItem<'hir>;
119 // Used when no map is actually available, forcing manual implementation of nested visitors.
120 impl<'hir> Map<'hir> for ! {
121 fn find(&self, _: HirId) -> Option<Node<'hir>> {
124 fn body(&self, _: BodyId) -> &'hir Body<'hir> {
127 fn item(&self, _: ItemId) -> &'hir Item<'hir> {
130 fn trait_item(&self, _: TraitItemId) -> &'hir TraitItem<'hir> {
133 fn impl_item(&self, _: ImplItemId) -> &'hir ImplItem<'hir> {
136 fn foreign_item(&self, _: ForeignItemId) -> &'hir ForeignItem<'hir> {
141 pub mod nested_filter {
144 /// Specifies what nested things a visitor wants to visit. By "nested
145 /// things", we are referring to bits of HIR that are not directly embedded
146 /// within one another but rather indirectly, through a table in the crate.
147 /// This is done to control dependencies during incremental compilation: the
148 /// non-inline bits of HIR can be tracked and hashed separately.
150 /// The most common choice is `OnlyBodies`, which will cause the visitor to
151 /// visit fn bodies for fns that it encounters, and closure bodies, but
152 /// skip over nested item-like things.
154 /// See the comments on `ItemLikeVisitor` for more details on the overall
156 pub trait NestedFilter<'hir> {
159 /// Whether the visitor visits nested "item-like" things.
160 /// E.g., item, impl-item.
162 /// Whether the visitor visits "intra item-like" things.
163 /// E.g., function body, closure, `AnonConst`
167 /// Do not visit any nested things. When you add a new
168 /// "non-nested" thing, you will want to audit such uses to see if
169 /// they remain valid.
171 /// Use this if you are only walking some particular kind of tree
172 /// (i.e., a type, or fn signature) and you don't want to thread a
175 impl NestedFilter<'_> for None {
177 const INTER: bool = false;
178 const INTRA: bool = false;
182 use nested_filter::NestedFilter;
184 /// Each method of the Visitor trait is a hook to be potentially
185 /// overridden. Each method's default implementation recursively visits
186 /// the substructure of the input via the corresponding `walk` method;
187 /// e.g., the `visit_mod` method by default calls `intravisit::walk_mod`.
189 /// Note that this visitor does NOT visit nested items by default
190 /// (this is why the module is called `intravisit`, to distinguish it
191 /// from the AST's `visit` module, which acts differently). If you
192 /// simply want to visit all items in the crate in some order, you
193 /// should call `tcx.hir().visit_all_item_likes_in_crate`. Otherwise, see the comment
194 /// on `visit_nested_item` for details on how to visit nested items.
196 /// If you want to ensure that your code handles every variant
197 /// explicitly, you need to override each method. (And you also need
198 /// to monitor future changes to `Visitor` in case a new method with a
199 /// new default implementation gets introduced.)
200 pub trait Visitor<'v>: Sized {
201 // this type should not be overridden, it exists for convenient usage as `Self::Map`
202 type Map: Map<'v> = <Self::NestedFilter as NestedFilter<'v>>::Map;
204 ///////////////////////////////////////////////////////////////////////////
207 /// Override this type to control which nested HIR are visited; see
208 /// [`NestedFilter`] for details. If you override this type, you
209 /// must also override [`nested_visit_map`](Self::nested_visit_map).
211 /// **If for some reason you want the nested behavior, but don't
212 /// have a `Map` at your disposal:** then override the
213 /// `visit_nested_XXX` methods. If a new `visit_nested_XXX` variant is
214 /// added in the future, it will cause a panic which can be detected
215 /// and fixed appropriately.
216 type NestedFilter: NestedFilter<'v> = nested_filter::None;
218 /// If `type NestedFilter` is set to visit nested items, this method
219 /// must also be overridden to provide a map to retrieve nested items.
220 fn nested_visit_map(&mut self) -> Self::Map {
222 "nested_visit_map must be implemented or consider using \
223 `type NestedFilter = nested_filter::None` (the default)"
227 /// Invoked when a nested item is encountered. By default, when
228 /// `Self::NestedFilter` is `nested_filter::None`, this method does
229 /// nothing. **You probably don't want to override this method** --
230 /// instead, override [`Self::NestedFilter`] or use the "shallow" or
231 /// "deep" visit patterns described on
232 /// `itemlikevisit::ItemLikeVisitor`. The only reason to override
233 /// this method is if you want a nested pattern but cannot supply a
234 /// [`Map`]; see `nested_visit_map` for advice.
235 fn visit_nested_item(&mut self, id: ItemId) {
236 if Self::NestedFilter::INTER {
237 let item = self.nested_visit_map().item(id);
238 self.visit_item(item);
242 /// Like `visit_nested_item()`, but for trait items. See
243 /// `visit_nested_item()` for advice on when to override this
245 fn visit_nested_trait_item(&mut self, id: TraitItemId) {
246 if Self::NestedFilter::INTER {
247 let item = self.nested_visit_map().trait_item(id);
248 self.visit_trait_item(item);
252 /// Like `visit_nested_item()`, but for impl items. See
253 /// `visit_nested_item()` for advice on when to override this
255 fn visit_nested_impl_item(&mut self, id: ImplItemId) {
256 if Self::NestedFilter::INTER {
257 let item = self.nested_visit_map().impl_item(id);
258 self.visit_impl_item(item);
262 /// Like `visit_nested_item()`, but for foreign items. See
263 /// `visit_nested_item()` for advice on when to override this
265 fn visit_nested_foreign_item(&mut self, id: ForeignItemId) {
266 if Self::NestedFilter::INTER {
267 let item = self.nested_visit_map().foreign_item(id);
268 self.visit_foreign_item(item);
272 /// Invoked to visit the body of a function, method or closure. Like
273 /// `visit_nested_item`, does nothing by default unless you override
274 /// `Self::NestedFilter`.
275 fn visit_nested_body(&mut self, id: BodyId) {
276 if Self::NestedFilter::INTRA {
277 let body = self.nested_visit_map().body(id);
278 self.visit_body(body);
282 fn visit_param(&mut self, param: &'v Param<'v>) {
283 walk_param(self, param)
286 /// Visits the top-level item and (optionally) nested items / impl items. See
287 /// `visit_nested_item` for details.
288 fn visit_item(&mut self, i: &'v Item<'v>) {
292 fn visit_body(&mut self, b: &'v Body<'v>) {
296 ///////////////////////////////////////////////////////////////////////////
298 fn visit_id(&mut self, _hir_id: HirId) {
301 fn visit_name(&mut self, _name: Symbol) {
304 fn visit_ident(&mut self, ident: Ident) {
305 walk_ident(self, ident)
307 fn visit_mod(&mut self, m: &'v Mod<'v>, _s: Span, n: HirId) {
310 fn visit_foreign_item(&mut self, i: &'v ForeignItem<'v>) {
311 walk_foreign_item(self, i)
313 fn visit_local(&mut self, l: &'v Local<'v>) {
316 fn visit_block(&mut self, b: &'v Block<'v>) {
319 fn visit_stmt(&mut self, s: &'v Stmt<'v>) {
322 fn visit_arm(&mut self, a: &'v Arm<'v>) {
325 fn visit_pat(&mut self, p: &'v Pat<'v>) {
328 fn visit_pat_field(&mut self, f: &'v PatField<'v>) {
329 walk_pat_field(self, f)
331 fn visit_array_length(&mut self, len: &'v ArrayLen) {
332 walk_array_len(self, len)
334 fn visit_anon_const(&mut self, c: &'v AnonConst) {
335 walk_anon_const(self, c)
337 fn visit_expr(&mut self, ex: &'v Expr<'v>) {
340 fn visit_let_expr(&mut self, lex: &'v Let<'v>) {
341 walk_let_expr(self, lex)
343 fn visit_expr_field(&mut self, field: &'v ExprField<'v>) {
344 walk_expr_field(self, field)
346 fn visit_ty(&mut self, t: &'v Ty<'v>) {
349 fn visit_generic_param(&mut self, p: &'v GenericParam<'v>) {
350 walk_generic_param(self, p)
352 fn visit_const_param_default(&mut self, _param: HirId, ct: &'v AnonConst) {
353 walk_const_param_default(self, ct)
355 fn visit_generics(&mut self, g: &'v Generics<'v>) {
356 walk_generics(self, g)
358 fn visit_where_predicate(&mut self, predicate: &'v WherePredicate<'v>) {
359 walk_where_predicate(self, predicate)
361 fn visit_fn_ret_ty(&mut self, ret_ty: &'v FnRetTy<'v>) {
362 walk_fn_ret_ty(self, ret_ty)
364 fn visit_fn_decl(&mut self, fd: &'v FnDecl<'v>) {
365 walk_fn_decl(self, fd)
367 fn visit_fn(&mut self, fk: FnKind<'v>, fd: &'v FnDecl<'v>, b: BodyId, _: Span, id: HirId) {
368 walk_fn(self, fk, fd, b, id)
370 fn visit_use(&mut self, path: &'v UsePath<'v>, hir_id: HirId) {
371 walk_use(self, path, hir_id)
373 fn visit_trait_item(&mut self, ti: &'v TraitItem<'v>) {
374 walk_trait_item(self, ti)
376 fn visit_trait_item_ref(&mut self, ii: &'v TraitItemRef) {
377 walk_trait_item_ref(self, ii)
379 fn visit_impl_item(&mut self, ii: &'v ImplItem<'v>) {
380 walk_impl_item(self, ii)
382 fn visit_foreign_item_ref(&mut self, ii: &'v ForeignItemRef) {
383 walk_foreign_item_ref(self, ii)
385 fn visit_impl_item_ref(&mut self, ii: &'v ImplItemRef) {
386 walk_impl_item_ref(self, ii)
388 fn visit_trait_ref(&mut self, t: &'v TraitRef<'v>) {
389 walk_trait_ref(self, t)
391 fn visit_param_bound(&mut self, bounds: &'v GenericBound<'v>) {
392 walk_param_bound(self, bounds)
394 fn visit_poly_trait_ref(&mut self, t: &'v PolyTraitRef<'v>) {
395 walk_poly_trait_ref(self, t)
397 fn visit_variant_data(&mut self, s: &'v VariantData<'v>) {
398 walk_struct_def(self, s)
400 fn visit_field_def(&mut self, s: &'v FieldDef<'v>) {
401 walk_field_def(self, s)
403 fn visit_enum_def(&mut self, enum_definition: &'v EnumDef<'v>, item_id: HirId) {
404 walk_enum_def(self, enum_definition, item_id)
406 fn visit_variant(&mut self, v: &'v Variant<'v>) {
407 walk_variant(self, v)
409 fn visit_label(&mut self, label: &'v Label) {
410 walk_label(self, label)
412 fn visit_infer(&mut self, inf: &'v InferArg) {
415 fn visit_generic_arg(&mut self, generic_arg: &'v GenericArg<'v>) {
416 walk_generic_arg(self, generic_arg);
418 fn visit_lifetime(&mut self, lifetime: &'v Lifetime) {
419 walk_lifetime(self, lifetime)
421 // The span is that of the surrounding type/pattern/expr/whatever.
422 fn visit_qpath(&mut self, qpath: &'v QPath<'v>, id: HirId, _span: Span) {
423 walk_qpath(self, qpath, id)
425 fn visit_path(&mut self, path: &Path<'v>, _id: HirId) {
426 walk_path(self, path)
428 fn visit_path_segment(&mut self, path_segment: &'v PathSegment<'v>) {
429 walk_path_segment(self, path_segment)
431 fn visit_generic_args(&mut self, generic_args: &'v GenericArgs<'v>) {
432 walk_generic_args(self, generic_args)
434 fn visit_assoc_type_binding(&mut self, type_binding: &'v TypeBinding<'v>) {
435 walk_assoc_type_binding(self, type_binding)
437 fn visit_attribute(&mut self, _attr: &'v Attribute) {}
438 fn visit_associated_item_kind(&mut self, kind: &'v AssocItemKind) {
439 walk_associated_item_kind(self, kind);
441 fn visit_defaultness(&mut self, defaultness: &'v Defaultness) {
442 walk_defaultness(self, defaultness);
444 fn visit_inline_asm(&mut self, asm: &'v InlineAsm<'v>, id: HirId) {
445 walk_inline_asm(self, asm, id);
449 pub fn walk_param<'v, V: Visitor<'v>>(visitor: &mut V, param: &'v Param<'v>) {
450 visitor.visit_id(param.hir_id);
451 visitor.visit_pat(param.pat);
454 pub fn walk_item<'v, V: Visitor<'v>>(visitor: &mut V, item: &'v Item<'v>) {
455 visitor.visit_ident(item.ident);
457 ItemKind::ExternCrate(orig_name) => {
458 visitor.visit_id(item.hir_id());
459 if let Some(orig_name) = orig_name {
460 visitor.visit_name(orig_name);
463 ItemKind::Use(ref path, _) => {
464 visitor.visit_use(path, item.hir_id());
466 ItemKind::Static(ref typ, _, body) | ItemKind::Const(ref typ, body) => {
467 visitor.visit_id(item.hir_id());
468 visitor.visit_ty(typ);
469 visitor.visit_nested_body(body);
471 ItemKind::Fn(ref sig, ref generics, body_id) => visitor.visit_fn(
472 FnKind::ItemFn(item.ident, generics, sig.header),
478 ItemKind::Macro(..) => {
479 visitor.visit_id(item.hir_id());
481 ItemKind::Mod(ref module) => {
482 // `visit_mod()` takes care of visiting the `Item`'s `HirId`.
483 visitor.visit_mod(module, item.span, item.hir_id())
485 ItemKind::ForeignMod { abi: _, items } => {
486 visitor.visit_id(item.hir_id());
487 walk_list!(visitor, visit_foreign_item_ref, items);
489 ItemKind::GlobalAsm(asm) => {
490 visitor.visit_id(item.hir_id());
491 visitor.visit_inline_asm(asm, item.hir_id());
493 ItemKind::TyAlias(ref ty, ref generics) => {
494 visitor.visit_id(item.hir_id());
495 visitor.visit_ty(ty);
496 visitor.visit_generics(generics)
498 ItemKind::OpaqueTy(OpaqueTy { ref generics, bounds, .. }) => {
499 visitor.visit_id(item.hir_id());
500 walk_generics(visitor, generics);
501 walk_list!(visitor, visit_param_bound, bounds);
503 ItemKind::Enum(ref enum_definition, ref generics) => {
504 visitor.visit_generics(generics);
505 // `visit_enum_def()` takes care of visiting the `Item`'s `HirId`.
506 visitor.visit_enum_def(enum_definition, item.hir_id())
508 ItemKind::Impl(Impl {
519 visitor.visit_id(item.hir_id());
520 visitor.visit_generics(generics);
521 walk_list!(visitor, visit_trait_ref, of_trait);
522 visitor.visit_ty(self_ty);
523 walk_list!(visitor, visit_impl_item_ref, *items);
525 ItemKind::Struct(ref struct_definition, ref generics)
526 | ItemKind::Union(ref struct_definition, ref generics) => {
527 visitor.visit_generics(generics);
528 visitor.visit_id(item.hir_id());
529 visitor.visit_variant_data(struct_definition);
531 ItemKind::Trait(.., ref generics, bounds, trait_item_refs) => {
532 visitor.visit_id(item.hir_id());
533 visitor.visit_generics(generics);
534 walk_list!(visitor, visit_param_bound, bounds);
535 walk_list!(visitor, visit_trait_item_ref, trait_item_refs);
537 ItemKind::TraitAlias(ref generics, bounds) => {
538 visitor.visit_id(item.hir_id());
539 visitor.visit_generics(generics);
540 walk_list!(visitor, visit_param_bound, bounds);
545 pub fn walk_body<'v, V: Visitor<'v>>(visitor: &mut V, body: &'v Body<'v>) {
546 walk_list!(visitor, visit_param, body.params);
547 visitor.visit_expr(body.value);
550 pub fn walk_ident<'v, V: Visitor<'v>>(visitor: &mut V, ident: Ident) {
551 visitor.visit_name(ident.name);
554 pub fn walk_mod<'v, V: Visitor<'v>>(visitor: &mut V, module: &'v Mod<'v>, mod_hir_id: HirId) {
555 visitor.visit_id(mod_hir_id);
556 for &item_id in module.item_ids {
557 visitor.visit_nested_item(item_id);
561 pub fn walk_foreign_item<'v, V: Visitor<'v>>(visitor: &mut V, foreign_item: &'v ForeignItem<'v>) {
562 visitor.visit_id(foreign_item.hir_id());
563 visitor.visit_ident(foreign_item.ident);
565 match foreign_item.kind {
566 ForeignItemKind::Fn(ref function_declaration, param_names, ref generics) => {
567 visitor.visit_generics(generics);
568 visitor.visit_fn_decl(function_declaration);
569 for ¶m_name in param_names {
570 visitor.visit_ident(param_name);
573 ForeignItemKind::Static(ref typ, _) => visitor.visit_ty(typ),
574 ForeignItemKind::Type => (),
578 pub fn walk_local<'v, V: Visitor<'v>>(visitor: &mut V, local: &'v Local<'v>) {
579 // Intentionally visiting the expr first - the initialization expr
580 // dominates the local's definition.
581 walk_list!(visitor, visit_expr, &local.init);
582 visitor.visit_id(local.hir_id);
583 visitor.visit_pat(local.pat);
584 if let Some(els) = local.els {
585 visitor.visit_block(els);
587 walk_list!(visitor, visit_ty, &local.ty);
590 pub fn walk_block<'v, V: Visitor<'v>>(visitor: &mut V, block: &'v Block<'v>) {
591 visitor.visit_id(block.hir_id);
592 walk_list!(visitor, visit_stmt, block.stmts);
593 walk_list!(visitor, visit_expr, &block.expr);
596 pub fn walk_stmt<'v, V: Visitor<'v>>(visitor: &mut V, statement: &'v Stmt<'v>) {
597 visitor.visit_id(statement.hir_id);
598 match statement.kind {
599 StmtKind::Local(ref local) => visitor.visit_local(local),
600 StmtKind::Item(item) => visitor.visit_nested_item(item),
601 StmtKind::Expr(ref expression) | StmtKind::Semi(ref expression) => {
602 visitor.visit_expr(expression)
607 pub fn walk_arm<'v, V: Visitor<'v>>(visitor: &mut V, arm: &'v Arm<'v>) {
608 visitor.visit_id(arm.hir_id);
609 visitor.visit_pat(arm.pat);
610 if let Some(ref g) = arm.guard {
612 Guard::If(ref e) => visitor.visit_expr(e),
613 Guard::IfLet(ref l) => {
614 visitor.visit_let_expr(l);
618 visitor.visit_expr(arm.body);
621 pub fn walk_pat<'v, V: Visitor<'v>>(visitor: &mut V, pattern: &'v Pat<'v>) {
622 visitor.visit_id(pattern.hir_id);
624 PatKind::TupleStruct(ref qpath, children, _) => {
625 visitor.visit_qpath(qpath, pattern.hir_id, pattern.span);
626 walk_list!(visitor, visit_pat, children);
628 PatKind::Path(ref qpath) => {
629 visitor.visit_qpath(qpath, pattern.hir_id, pattern.span);
631 PatKind::Struct(ref qpath, fields, _) => {
632 visitor.visit_qpath(qpath, pattern.hir_id, pattern.span);
633 walk_list!(visitor, visit_pat_field, fields);
635 PatKind::Or(pats) => walk_list!(visitor, visit_pat, pats),
636 PatKind::Tuple(tuple_elements, _) => {
637 walk_list!(visitor, visit_pat, tuple_elements);
639 PatKind::Box(ref subpattern) | PatKind::Ref(ref subpattern, _) => {
640 visitor.visit_pat(subpattern)
642 PatKind::Binding(_, _hir_id, ident, ref optional_subpattern) => {
643 visitor.visit_ident(ident);
644 walk_list!(visitor, visit_pat, optional_subpattern);
646 PatKind::Lit(ref expression) => visitor.visit_expr(expression),
647 PatKind::Range(ref lower_bound, ref upper_bound, _) => {
648 walk_list!(visitor, visit_expr, lower_bound);
649 walk_list!(visitor, visit_expr, upper_bound);
652 PatKind::Slice(prepatterns, ref slice_pattern, postpatterns) => {
653 walk_list!(visitor, visit_pat, prepatterns);
654 walk_list!(visitor, visit_pat, slice_pattern);
655 walk_list!(visitor, visit_pat, postpatterns);
660 pub fn walk_pat_field<'v, V: Visitor<'v>>(visitor: &mut V, field: &'v PatField<'v>) {
661 visitor.visit_id(field.hir_id);
662 visitor.visit_ident(field.ident);
663 visitor.visit_pat(field.pat)
666 pub fn walk_array_len<'v, V: Visitor<'v>>(visitor: &mut V, len: &'v ArrayLen) {
668 &ArrayLen::Infer(hir_id, _span) => visitor.visit_id(hir_id),
669 ArrayLen::Body(c) => visitor.visit_anon_const(c),
673 pub fn walk_anon_const<'v, V: Visitor<'v>>(visitor: &mut V, constant: &'v AnonConst) {
674 visitor.visit_id(constant.hir_id);
675 visitor.visit_nested_body(constant.body);
678 pub fn walk_expr<'v, V: Visitor<'v>>(visitor: &mut V, expression: &'v Expr<'v>) {
679 visitor.visit_id(expression.hir_id);
680 match expression.kind {
681 ExprKind::Box(ref subexpression) => visitor.visit_expr(subexpression),
682 ExprKind::Array(subexpressions) => {
683 walk_list!(visitor, visit_expr, subexpressions);
685 ExprKind::ConstBlock(ref anon_const) => visitor.visit_anon_const(anon_const),
686 ExprKind::Repeat(ref element, ref count) => {
687 visitor.visit_expr(element);
688 visitor.visit_array_length(count)
690 ExprKind::Struct(ref qpath, fields, ref optional_base) => {
691 visitor.visit_qpath(qpath, expression.hir_id, expression.span);
692 walk_list!(visitor, visit_expr_field, fields);
693 walk_list!(visitor, visit_expr, optional_base);
695 ExprKind::Tup(subexpressions) => {
696 walk_list!(visitor, visit_expr, subexpressions);
698 ExprKind::Call(ref callee_expression, arguments) => {
699 visitor.visit_expr(callee_expression);
700 walk_list!(visitor, visit_expr, arguments);
702 ExprKind::MethodCall(ref segment, receiver, arguments, _) => {
703 visitor.visit_path_segment(segment);
704 visitor.visit_expr(receiver);
705 walk_list!(visitor, visit_expr, arguments);
707 ExprKind::Binary(_, ref left_expression, ref right_expression) => {
708 visitor.visit_expr(left_expression);
709 visitor.visit_expr(right_expression)
711 ExprKind::AddrOf(_, _, ref subexpression) | ExprKind::Unary(_, ref subexpression) => {
712 visitor.visit_expr(subexpression)
714 ExprKind::Cast(ref subexpression, ref typ) | ExprKind::Type(ref subexpression, ref typ) => {
715 visitor.visit_expr(subexpression);
716 visitor.visit_ty(typ)
718 ExprKind::DropTemps(ref subexpression) => {
719 visitor.visit_expr(subexpression);
721 ExprKind::Let(ref let_expr) => visitor.visit_let_expr(let_expr),
722 ExprKind::If(ref cond, ref then, ref else_opt) => {
723 visitor.visit_expr(cond);
724 visitor.visit_expr(then);
725 walk_list!(visitor, visit_expr, else_opt);
727 ExprKind::Loop(ref block, ref opt_label, _, _) => {
728 walk_list!(visitor, visit_label, opt_label);
729 visitor.visit_block(block);
731 ExprKind::Match(ref subexpression, arms, _) => {
732 visitor.visit_expr(subexpression);
733 walk_list!(visitor, visit_arm, arms);
735 ExprKind::Closure(&Closure {
738 bound_generic_params,
746 walk_list!(visitor, visit_generic_param, bound_generic_params);
747 visitor.visit_fn(FnKind::Closure, fn_decl, body, expression.span, expression.hir_id)
749 ExprKind::Block(ref block, ref opt_label) => {
750 walk_list!(visitor, visit_label, opt_label);
751 visitor.visit_block(block);
753 ExprKind::Assign(ref lhs, ref rhs, _) => {
754 visitor.visit_expr(rhs);
755 visitor.visit_expr(lhs)
757 ExprKind::AssignOp(_, ref left_expression, ref right_expression) => {
758 visitor.visit_expr(right_expression);
759 visitor.visit_expr(left_expression);
761 ExprKind::Field(ref subexpression, ident) => {
762 visitor.visit_expr(subexpression);
763 visitor.visit_ident(ident);
765 ExprKind::Index(ref main_expression, ref index_expression) => {
766 visitor.visit_expr(main_expression);
767 visitor.visit_expr(index_expression)
769 ExprKind::Path(ref qpath) => {
770 visitor.visit_qpath(qpath, expression.hir_id, expression.span);
772 ExprKind::Break(ref destination, ref opt_expr) => {
773 walk_list!(visitor, visit_label, &destination.label);
774 walk_list!(visitor, visit_expr, opt_expr);
776 ExprKind::Continue(ref destination) => {
777 walk_list!(visitor, visit_label, &destination.label);
779 ExprKind::Ret(ref optional_expression) => {
780 walk_list!(visitor, visit_expr, optional_expression);
782 ExprKind::InlineAsm(ref asm) => {
783 visitor.visit_inline_asm(asm, expression.hir_id);
785 ExprKind::Yield(ref subexpression, _) => {
786 visitor.visit_expr(subexpression);
788 ExprKind::Lit(_) | ExprKind::Err => {}
792 pub fn walk_let_expr<'v, V: Visitor<'v>>(visitor: &mut V, let_expr: &'v Let<'v>) {
793 // match the visit order in walk_local
794 visitor.visit_expr(let_expr.init);
795 visitor.visit_id(let_expr.hir_id);
796 visitor.visit_pat(let_expr.pat);
797 walk_list!(visitor, visit_ty, let_expr.ty);
800 pub fn walk_expr_field<'v, V: Visitor<'v>>(visitor: &mut V, field: &'v ExprField<'v>) {
801 visitor.visit_id(field.hir_id);
802 visitor.visit_ident(field.ident);
803 visitor.visit_expr(field.expr)
806 pub fn walk_ty<'v, V: Visitor<'v>>(visitor: &mut V, typ: &'v Ty<'v>) {
807 visitor.visit_id(typ.hir_id);
810 TyKind::Slice(ref ty) => visitor.visit_ty(ty),
811 TyKind::Ptr(ref mutable_type) => visitor.visit_ty(mutable_type.ty),
812 TyKind::Rptr(ref lifetime, ref mutable_type) => {
813 visitor.visit_lifetime(lifetime);
814 visitor.visit_ty(mutable_type.ty)
817 TyKind::Tup(tuple_element_types) => {
818 walk_list!(visitor, visit_ty, tuple_element_types);
820 TyKind::BareFn(ref function_declaration) => {
821 walk_list!(visitor, visit_generic_param, function_declaration.generic_params);
822 visitor.visit_fn_decl(function_declaration.decl);
824 TyKind::Path(ref qpath) => {
825 visitor.visit_qpath(qpath, typ.hir_id, typ.span);
827 TyKind::OpaqueDef(item_id, lifetimes, _in_trait) => {
828 visitor.visit_nested_item(item_id);
829 walk_list!(visitor, visit_generic_arg, lifetimes);
831 TyKind::Array(ref ty, ref length) => {
832 visitor.visit_ty(ty);
833 visitor.visit_array_length(length)
835 TyKind::TraitObject(bounds, ref lifetime, _syntax) => {
836 for bound in bounds {
837 visitor.visit_poly_trait_ref(bound);
839 visitor.visit_lifetime(lifetime);
841 TyKind::Typeof(ref expression) => visitor.visit_anon_const(expression),
842 TyKind::Infer | TyKind::Err => {}
846 pub fn walk_generic_param<'v, V: Visitor<'v>>(visitor: &mut V, param: &'v GenericParam<'v>) {
847 visitor.visit_id(param.hir_id);
849 ParamName::Plain(ident) => visitor.visit_ident(ident),
850 ParamName::Error | ParamName::Fresh => {}
853 GenericParamKind::Lifetime { .. } => {}
854 GenericParamKind::Type { ref default, .. } => walk_list!(visitor, visit_ty, default),
855 GenericParamKind::Const { ref ty, ref default } => {
856 visitor.visit_ty(ty);
857 if let Some(ref default) = default {
858 visitor.visit_const_param_default(param.hir_id, default);
864 pub fn walk_const_param_default<'v, V: Visitor<'v>>(visitor: &mut V, ct: &'v AnonConst) {
865 visitor.visit_anon_const(ct)
868 pub fn walk_generics<'v, V: Visitor<'v>>(visitor: &mut V, generics: &'v Generics<'v>) {
869 walk_list!(visitor, visit_generic_param, generics.params);
870 walk_list!(visitor, visit_where_predicate, generics.predicates);
873 pub fn walk_where_predicate<'v, V: Visitor<'v>>(
875 predicate: &'v WherePredicate<'v>,
878 WherePredicate::BoundPredicate(WhereBoundPredicate {
882 bound_generic_params,
886 visitor.visit_id(hir_id);
887 visitor.visit_ty(bounded_ty);
888 walk_list!(visitor, visit_param_bound, bounds);
889 walk_list!(visitor, visit_generic_param, bound_generic_params);
891 WherePredicate::RegionPredicate(WhereRegionPredicate {
897 visitor.visit_lifetime(lifetime);
898 walk_list!(visitor, visit_param_bound, bounds);
900 WherePredicate::EqPredicate(WhereEqPredicate { ref lhs_ty, ref rhs_ty, span: _ }) => {
901 visitor.visit_ty(lhs_ty);
902 visitor.visit_ty(rhs_ty);
907 pub fn walk_fn_decl<'v, V: Visitor<'v>>(visitor: &mut V, function_declaration: &'v FnDecl<'v>) {
908 for ty in function_declaration.inputs {
911 visitor.visit_fn_ret_ty(&function_declaration.output)
914 pub fn walk_fn_ret_ty<'v, V: Visitor<'v>>(visitor: &mut V, ret_ty: &'v FnRetTy<'v>) {
915 if let FnRetTy::Return(ref output_ty) = *ret_ty {
916 visitor.visit_ty(output_ty)
920 pub fn walk_fn<'v, V: Visitor<'v>>(
922 function_kind: FnKind<'v>,
923 function_declaration: &'v FnDecl<'v>,
927 visitor.visit_id(id);
928 visitor.visit_fn_decl(function_declaration);
929 walk_fn_kind(visitor, function_kind);
930 visitor.visit_nested_body(body_id)
933 pub fn walk_fn_kind<'v, V: Visitor<'v>>(visitor: &mut V, function_kind: FnKind<'v>) {
934 match function_kind {
935 FnKind::ItemFn(_, generics, ..) => {
936 visitor.visit_generics(generics);
938 FnKind::Closure | FnKind::Method(..) => {}
942 pub fn walk_use<'v, V: Visitor<'v>>(visitor: &mut V, path: &'v UsePath<'v>, hir_id: HirId) {
943 visitor.visit_id(hir_id);
944 let UsePath { segments, ref res, span } = *path;
946 visitor.visit_path(&Path { segments, res, span }, hir_id);
950 pub fn walk_trait_item<'v, V: Visitor<'v>>(visitor: &mut V, trait_item: &'v TraitItem<'v>) {
951 // N.B., deliberately force a compilation error if/when new fields are added.
952 let TraitItem { ident, generics, ref defaultness, ref kind, span, owner_id: _ } = *trait_item;
953 let hir_id = trait_item.hir_id();
954 visitor.visit_ident(ident);
955 visitor.visit_generics(generics);
956 visitor.visit_defaultness(defaultness);
958 TraitItemKind::Const(ref ty, default) => {
959 visitor.visit_id(hir_id);
960 visitor.visit_ty(ty);
961 walk_list!(visitor, visit_nested_body, default);
963 TraitItemKind::Fn(ref sig, TraitFn::Required(param_names)) => {
964 visitor.visit_id(hir_id);
965 visitor.visit_fn_decl(sig.decl);
966 for ¶m_name in param_names {
967 visitor.visit_ident(param_name);
970 TraitItemKind::Fn(ref sig, TraitFn::Provided(body_id)) => {
971 visitor.visit_fn(FnKind::Method(ident, sig), sig.decl, body_id, span, hir_id);
973 TraitItemKind::Type(bounds, ref default) => {
974 visitor.visit_id(hir_id);
975 walk_list!(visitor, visit_param_bound, bounds);
976 walk_list!(visitor, visit_ty, default);
981 pub fn walk_trait_item_ref<'v, V: Visitor<'v>>(visitor: &mut V, trait_item_ref: &'v TraitItemRef) {
982 // N.B., deliberately force a compilation error if/when new fields are added.
983 let TraitItemRef { id, ident, ref kind, span: _ } = *trait_item_ref;
984 visitor.visit_nested_trait_item(id);
985 visitor.visit_ident(ident);
986 visitor.visit_associated_item_kind(kind);
989 pub fn walk_impl_item<'v, V: Visitor<'v>>(visitor: &mut V, impl_item: &'v ImplItem<'v>) {
990 // N.B., deliberately force a compilation error if/when new fields are added.
1001 visitor.visit_ident(ident);
1002 visitor.visit_generics(generics);
1003 visitor.visit_defaultness(defaultness);
1005 ImplItemKind::Const(ref ty, body) => {
1006 visitor.visit_id(impl_item.hir_id());
1007 visitor.visit_ty(ty);
1008 visitor.visit_nested_body(body);
1010 ImplItemKind::Fn(ref sig, body_id) => {
1012 FnKind::Method(impl_item.ident, sig),
1019 ImplItemKind::Type(ref ty) => {
1020 visitor.visit_id(impl_item.hir_id());
1021 visitor.visit_ty(ty);
1026 pub fn walk_foreign_item_ref<'v, V: Visitor<'v>>(
1028 foreign_item_ref: &'v ForeignItemRef,
1030 // N.B., deliberately force a compilation error if/when new fields are added.
1031 let ForeignItemRef { id, ident, span: _ } = *foreign_item_ref;
1032 visitor.visit_nested_foreign_item(id);
1033 visitor.visit_ident(ident);
1036 pub fn walk_impl_item_ref<'v, V: Visitor<'v>>(visitor: &mut V, impl_item_ref: &'v ImplItemRef) {
1037 // N.B., deliberately force a compilation error if/when new fields are added.
1038 let ImplItemRef { id, ident, ref kind, span: _, trait_item_def_id: _ } = *impl_item_ref;
1039 visitor.visit_nested_impl_item(id);
1040 visitor.visit_ident(ident);
1041 visitor.visit_associated_item_kind(kind);
1044 pub fn walk_trait_ref<'v, V: Visitor<'v>>(visitor: &mut V, trait_ref: &'v TraitRef<'v>) {
1045 visitor.visit_id(trait_ref.hir_ref_id);
1046 visitor.visit_path(trait_ref.path, trait_ref.hir_ref_id)
1049 pub fn walk_param_bound<'v, V: Visitor<'v>>(visitor: &mut V, bound: &'v GenericBound<'v>) {
1051 GenericBound::Trait(ref typ, _modifier) => {
1052 visitor.visit_poly_trait_ref(typ);
1054 GenericBound::LangItemTrait(_, _span, hir_id, args) => {
1055 visitor.visit_id(hir_id);
1056 visitor.visit_generic_args(args);
1058 GenericBound::Outlives(ref lifetime) => visitor.visit_lifetime(lifetime),
1062 pub fn walk_poly_trait_ref<'v, V: Visitor<'v>>(visitor: &mut V, trait_ref: &'v PolyTraitRef<'v>) {
1063 walk_list!(visitor, visit_generic_param, trait_ref.bound_generic_params);
1064 visitor.visit_trait_ref(&trait_ref.trait_ref);
1067 pub fn walk_struct_def<'v, V: Visitor<'v>>(
1069 struct_definition: &'v VariantData<'v>,
1071 walk_list!(visitor, visit_id, struct_definition.ctor_hir_id());
1072 walk_list!(visitor, visit_field_def, struct_definition.fields());
1075 pub fn walk_field_def<'v, V: Visitor<'v>>(visitor: &mut V, field: &'v FieldDef<'v>) {
1076 visitor.visit_id(field.hir_id);
1077 visitor.visit_ident(field.ident);
1078 visitor.visit_ty(field.ty);
1081 pub fn walk_enum_def<'v, V: Visitor<'v>>(
1083 enum_definition: &'v EnumDef<'v>,
1086 visitor.visit_id(item_id);
1087 walk_list!(visitor, visit_variant, enum_definition.variants);
1090 pub fn walk_variant<'v, V: Visitor<'v>>(visitor: &mut V, variant: &'v Variant<'v>) {
1091 visitor.visit_ident(variant.ident);
1092 visitor.visit_id(variant.hir_id);
1093 visitor.visit_variant_data(&variant.data);
1094 walk_list!(visitor, visit_anon_const, &variant.disr_expr);
1097 pub fn walk_label<'v, V: Visitor<'v>>(visitor: &mut V, label: &'v Label) {
1098 visitor.visit_ident(label.ident);
1101 pub fn walk_inf<'v, V: Visitor<'v>>(visitor: &mut V, inf: &'v InferArg) {
1102 visitor.visit_id(inf.hir_id);
1105 pub fn walk_generic_arg<'v, V: Visitor<'v>>(visitor: &mut V, generic_arg: &'v GenericArg<'v>) {
1107 GenericArg::Lifetime(lt) => visitor.visit_lifetime(lt),
1108 GenericArg::Type(ty) => visitor.visit_ty(ty),
1109 GenericArg::Const(ct) => visitor.visit_anon_const(&ct.value),
1110 GenericArg::Infer(inf) => visitor.visit_infer(inf),
1114 pub fn walk_lifetime<'v, V: Visitor<'v>>(visitor: &mut V, lifetime: &'v Lifetime) {
1115 visitor.visit_id(lifetime.hir_id);
1116 visitor.visit_ident(lifetime.ident);
1119 pub fn walk_qpath<'v, V: Visitor<'v>>(visitor: &mut V, qpath: &'v QPath<'v>, id: HirId) {
1121 QPath::Resolved(ref maybe_qself, ref path) => {
1122 walk_list!(visitor, visit_ty, maybe_qself);
1123 visitor.visit_path(path, id)
1125 QPath::TypeRelative(ref qself, ref segment) => {
1126 visitor.visit_ty(qself);
1127 visitor.visit_path_segment(segment);
1129 QPath::LangItem(..) => {}
1133 pub fn walk_path<'v, V: Visitor<'v>>(visitor: &mut V, path: &Path<'v>) {
1134 for segment in path.segments {
1135 visitor.visit_path_segment(segment);
1139 pub fn walk_path_segment<'v, V: Visitor<'v>>(visitor: &mut V, segment: &'v PathSegment<'v>) {
1140 visitor.visit_ident(segment.ident);
1141 visitor.visit_id(segment.hir_id);
1142 if let Some(ref args) = segment.args {
1143 visitor.visit_generic_args(args);
1147 pub fn walk_generic_args<'v, V: Visitor<'v>>(visitor: &mut V, generic_args: &'v GenericArgs<'v>) {
1148 walk_list!(visitor, visit_generic_arg, generic_args.args);
1149 walk_list!(visitor, visit_assoc_type_binding, generic_args.bindings);
1152 pub fn walk_assoc_type_binding<'v, V: Visitor<'v>>(
1154 type_binding: &'v TypeBinding<'v>,
1156 visitor.visit_id(type_binding.hir_id);
1157 visitor.visit_ident(type_binding.ident);
1158 visitor.visit_generic_args(type_binding.gen_args);
1159 match type_binding.kind {
1160 TypeBindingKind::Equality { ref term } => match term {
1161 Term::Ty(ref ty) => visitor.visit_ty(ty),
1162 Term::Const(ref c) => visitor.visit_anon_const(c),
1164 TypeBindingKind::Constraint { bounds } => walk_list!(visitor, visit_param_bound, bounds),
1168 pub fn walk_associated_item_kind<'v, V: Visitor<'v>>(_: &mut V, _: &'v AssocItemKind) {
1169 // No visitable content here: this fn exists so you can call it if
1170 // the right thing to do, should content be added in the future,
1171 // would be to walk it.
1174 pub fn walk_defaultness<'v, V: Visitor<'v>>(_: &mut V, _: &'v Defaultness) {
1175 // No visitable content here: this fn exists so you can call it if
1176 // the right thing to do, should content be added in the future,
1177 // would be to walk it.
1180 pub fn walk_inline_asm<'v, V: Visitor<'v>>(visitor: &mut V, asm: &'v InlineAsm<'v>, id: HirId) {
1181 for (op, op_sp) in asm.operands {
1183 InlineAsmOperand::In { expr, .. } | InlineAsmOperand::InOut { expr, .. } => {
1184 visitor.visit_expr(expr)
1186 InlineAsmOperand::Out { expr, .. } => {
1187 if let Some(expr) = expr {
1188 visitor.visit_expr(expr);
1191 InlineAsmOperand::SplitInOut { in_expr, out_expr, .. } => {
1192 visitor.visit_expr(in_expr);
1193 if let Some(out_expr) = out_expr {
1194 visitor.visit_expr(out_expr);
1197 InlineAsmOperand::Const { anon_const, .. }
1198 | InlineAsmOperand::SymFn { anon_const, .. } => visitor.visit_anon_const(anon_const),
1199 InlineAsmOperand::SymStatic { path, .. } => visitor.visit_qpath(path, id, *op_sp),