1 //! HIR walker for walking the contents of nodes.
3 //! **For an overview of the visitor strategy, see the docs on the
4 //! `super::itemlikevisit::ItemLikeVisitor` trait.**
6 //! If you have decided to use this visitor, here are some general
7 //! notes on how to do so:
9 //! Each overridden visit method has full control over what
10 //! happens with its node, it can do its own traversal of the node's children,
11 //! call `intravisit::walk_*` to apply the default traversal algorithm, or prevent
12 //! deeper traversal by doing nothing.
14 //! When visiting the HIR, the contents of nested items are NOT visited
15 //! by default. This is different from the AST visitor, which does a deep walk.
16 //! Hence this module is called `intravisit`; see the method `visit_nested_item`
19 //! Note: it is an important invariant that the default visitor walks
20 //! the body of a function in "execution order" - more concretely, if
21 //! we consider the reverse post-order (RPO) of the CFG implied by the HIR,
22 //! then a pre-order traversal of the HIR is consistent with the CFG RPO
23 //! on the *initial CFG point* of each HIR node, while a post-order traversal
24 //! of the HIR is consistent with the CFG RPO on each *final CFG point* of
27 //! One thing that follows is that if HIR node A always starts/ends executing
28 //! before HIR node B, then A appears in traversal pre/postorder before B,
29 //! respectively. (This follows from RPO respecting CFG domination).
31 //! This order consistency is required in a few places in rustc, for
32 //! example generator inference, and possibly also HIR borrowck.
35 use crate::hir_id::CRATE_HIR_ID;
36 use crate::itemlikevisit::{ItemLikeVisitor, ParItemLikeVisitor};
37 use rustc_ast::walk_list;
38 use rustc_ast::{Attribute, Label};
39 use rustc_span::symbol::{Ident, Symbol};
42 pub struct DeepVisitor<'v, V> {
46 impl<'v, V> DeepVisitor<'v, V> {
47 pub fn new(base: &'v mut V) -> Self {
48 DeepVisitor { visitor: base }
52 impl<'v, 'hir, V> ItemLikeVisitor<'hir> for DeepVisitor<'v, V>
56 fn visit_item(&mut self, item: &'hir Item<'hir>) {
57 self.visitor.visit_item(item);
60 fn visit_trait_item(&mut self, trait_item: &'hir TraitItem<'hir>) {
61 self.visitor.visit_trait_item(trait_item);
64 fn visit_impl_item(&mut self, impl_item: &'hir ImplItem<'hir>) {
65 self.visitor.visit_impl_item(impl_item);
69 pub trait IntoVisitor<'hir> {
70 type Visitor: Visitor<'hir>;
71 fn into_visitor(&self) -> Self::Visitor;
74 pub struct ParDeepVisitor<V>(pub V);
76 impl<'hir, V> ParItemLikeVisitor<'hir> for ParDeepVisitor<V>
80 fn visit_item(&self, item: &'hir Item<'hir>) {
81 self.0.into_visitor().visit_item(item);
84 fn visit_trait_item(&self, trait_item: &'hir TraitItem<'hir>) {
85 self.0.into_visitor().visit_trait_item(trait_item);
88 fn visit_impl_item(&self, impl_item: &'hir ImplItem<'hir>) {
89 self.0.into_visitor().visit_impl_item(impl_item);
93 #[derive(Copy, Clone)]
95 /// `#[xxx] pub async/const/extern "Abi" fn foo()`
96 ItemFn(Ident, &'a Generics<'a>, FnHeader, &'a Visibility<'a>, &'a [Attribute]),
99 Method(Ident, &'a FnSig<'a>, Option<&'a Visibility<'a>>, &'a [Attribute]),
102 Closure(&'a [Attribute]),
105 impl<'a> FnKind<'a> {
106 pub fn attrs(&self) -> &'a [Attribute] {
108 FnKind::ItemFn(.., attrs) => attrs,
109 FnKind::Method(.., attrs) => attrs,
110 FnKind::Closure(attrs) => attrs,
114 pub fn header(&self) -> Option<&FnHeader> {
116 FnKind::ItemFn(_, _, ref header, _, _) => Some(header),
117 FnKind::Method(_, ref sig, _, _) => Some(&sig.header),
118 FnKind::Closure(_) => None,
123 /// An abstract representation of the HIR `rustc_middle::hir::map::Map`.
124 pub trait Map<'hir> {
125 /// Retrieves the `Node` corresponding to `id`, returning `None` if cannot be found.
126 fn find(&self, hir_id: HirId) -> Option<Node<'hir>>;
127 fn body(&self, id: BodyId) -> &'hir Body<'hir>;
128 fn item(&self, id: HirId) -> &'hir Item<'hir>;
129 fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir>;
130 fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir>;
133 /// An erased version of `Map<'hir>`, using dynamic dispatch.
134 /// NOTE: This type is effectively only usable with `NestedVisitorMap::None`.
135 pub struct ErasedMap<'hir>(&'hir dyn Map<'hir>);
137 impl<'hir> Map<'hir> for ErasedMap<'hir> {
138 fn find(&self, _: HirId) -> Option<Node<'hir>> {
141 fn body(&self, id: BodyId) -> &'hir Body<'hir> {
144 fn item(&self, id: HirId) -> &'hir Item<'hir> {
147 fn trait_item(&self, id: TraitItemId) -> &'hir TraitItem<'hir> {
148 self.0.trait_item(id)
150 fn impl_item(&self, id: ImplItemId) -> &'hir ImplItem<'hir> {
155 /// Specifies what nested things a visitor wants to visit. The most
156 /// common choice is `OnlyBodies`, which will cause the visitor to
157 /// visit fn bodies for fns that it encounters, but skip over nested
158 /// item-like things.
160 /// See the comments on `ItemLikeVisitor` for more details on the overall
162 pub enum NestedVisitorMap<M> {
163 /// Do not visit any nested things. When you add a new
164 /// "non-nested" thing, you will want to audit such uses to see if
165 /// they remain valid.
167 /// Use this if you are only walking some particular kind of tree
168 /// (i.e., a type, or fn signature) and you don't want to thread a
172 /// Do not visit nested item-like things, but visit nested things
173 /// that are inside of an item-like.
175 /// **This is the most common choice.** A very common pattern is
176 /// to use `visit_all_item_likes()` as an outer loop,
177 /// and to have the visitor that visits the contents of each item
178 /// using this setting.
181 /// Visits all nested things, including item-likes.
183 /// **This is an unusual choice.** It is used when you want to
184 /// process everything within their lexical context. Typically you
185 /// kick off the visit by doing `walk_krate()`.
189 impl<M> NestedVisitorMap<M> {
190 /// Returns the map to use for an "intra item-like" thing (if any).
191 /// E.g., function body.
192 fn intra(self) -> Option<M> {
194 NestedVisitorMap::None => None,
195 NestedVisitorMap::OnlyBodies(map) => Some(map),
196 NestedVisitorMap::All(map) => Some(map),
200 /// Returns the map to use for an "item-like" thing (if any).
201 /// E.g., item, impl-item.
202 fn inter(self) -> Option<M> {
204 NestedVisitorMap::None => None,
205 NestedVisitorMap::OnlyBodies(_) => None,
206 NestedVisitorMap::All(map) => Some(map),
211 /// Each method of the Visitor trait is a hook to be potentially
212 /// overridden. Each method's default implementation recursively visits
213 /// the substructure of the input via the corresponding `walk` method;
214 /// e.g., the `visit_mod` method by default calls `intravisit::walk_mod`.
216 /// Note that this visitor does NOT visit nested items by default
217 /// (this is why the module is called `intravisit`, to distinguish it
218 /// from the AST's `visit` module, which acts differently). If you
219 /// simply want to visit all items in the crate in some order, you
220 /// should call `Crate::visit_all_items`. Otherwise, see the comment
221 /// on `visit_nested_item` for details on how to visit nested items.
223 /// If you want to ensure that your code handles every variant
224 /// explicitly, you need to override each method. (And you also need
225 /// to monitor future changes to `Visitor` in case a new method with a
226 /// new default implementation gets introduced.)
227 pub trait Visitor<'v>: Sized {
230 ///////////////////////////////////////////////////////////////////////////
233 /// The default versions of the `visit_nested_XXX` routines invoke
234 /// this method to get a map to use. By selecting an enum variant,
235 /// you control which kinds of nested HIR are visited; see
236 /// `NestedVisitorMap` for details. By "nested HIR", we are
237 /// referring to bits of HIR that are not directly embedded within
238 /// one another but rather indirectly, through a table in the
239 /// crate. This is done to control dependencies during incremental
240 /// compilation: the non-inline bits of HIR can be tracked and
241 /// hashed separately.
243 /// **If for some reason you want the nested behavior, but don't
244 /// have a `Map` at your disposal:** then you should override the
245 /// `visit_nested_XXX` methods, and override this method to
246 /// `panic!()`. This way, if a new `visit_nested_XXX` variant is
247 /// added in the future, we will see the panic in your code and
248 /// fix it appropriately.
249 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map>;
251 /// Invoked when a nested item is encountered. By default does
252 /// nothing unless you override `nested_visit_map` to return other than
253 /// `None`, in which case it will walk the item. **You probably
254 /// don't want to override this method** -- instead, override
255 /// `nested_visit_map` or use the "shallow" or "deep" visit
256 /// patterns described on `itemlikevisit::ItemLikeVisitor`. The only
257 /// reason to override this method is if you want a nested pattern
258 /// but cannot supply a `Map`; see `nested_visit_map` for advice.
259 fn visit_nested_item(&mut self, id: ItemId) {
260 let opt_item = self.nested_visit_map().inter().map(|map| map.item(id.id));
261 walk_list!(self, visit_item, opt_item);
264 /// Like `visit_nested_item()`, but for trait items. See
265 /// `visit_nested_item()` for advice on when to override this
267 fn visit_nested_trait_item(&mut self, id: TraitItemId) {
268 let opt_item = self.nested_visit_map().inter().map(|map| map.trait_item(id));
269 walk_list!(self, visit_trait_item, opt_item);
272 /// Like `visit_nested_item()`, but for impl items. See
273 /// `visit_nested_item()` for advice on when to override this
275 fn visit_nested_impl_item(&mut self, id: ImplItemId) {
276 let opt_item = self.nested_visit_map().inter().map(|map| map.impl_item(id));
277 walk_list!(self, visit_impl_item, opt_item);
280 /// Invoked to visit the body of a function, method or closure. Like
281 /// visit_nested_item, does nothing by default unless you override
282 /// `nested_visit_map` to return other than `None`, in which case it will walk
284 fn visit_nested_body(&mut self, id: BodyId) {
285 let opt_body = self.nested_visit_map().intra().map(|map| map.body(id));
286 walk_list!(self, visit_body, opt_body);
289 fn visit_param(&mut self, param: &'v Param<'v>) {
290 walk_param(self, param)
293 /// Visits the top-level item and (optionally) nested items / impl items. See
294 /// `visit_nested_item` for details.
295 fn visit_item(&mut self, i: &'v Item<'v>) {
299 fn visit_body(&mut self, b: &'v Body<'v>) {
303 /// When invoking `visit_all_item_likes()`, you need to supply an
304 /// item-like visitor. This method converts a "intra-visit"
305 /// visitor into an item-like visitor that walks the entire tree.
306 /// If you use this, you probably don't want to process the
307 /// contents of nested item-like things, since the outer loop will
308 /// visit them as well.
309 fn as_deep_visitor(&mut self) -> DeepVisitor<'_, Self> {
310 DeepVisitor::new(self)
313 ///////////////////////////////////////////////////////////////////////////
315 fn visit_id(&mut self, _hir_id: HirId) {
318 fn visit_name(&mut self, _span: Span, _name: Symbol) {
321 fn visit_ident(&mut self, ident: Ident) {
322 walk_ident(self, ident)
324 fn visit_mod(&mut self, m: &'v Mod<'v>, _s: Span, n: HirId) {
327 fn visit_foreign_item(&mut self, i: &'v ForeignItem<'v>) {
328 walk_foreign_item(self, i)
330 fn visit_local(&mut self, l: &'v Local<'v>) {
333 fn visit_block(&mut self, b: &'v Block<'v>) {
336 fn visit_stmt(&mut self, s: &'v Stmt<'v>) {
339 fn visit_arm(&mut self, a: &'v Arm<'v>) {
342 fn visit_pat(&mut self, p: &'v Pat<'v>) {
345 fn visit_anon_const(&mut self, c: &'v AnonConst) {
346 walk_anon_const(self, c)
348 fn visit_expr(&mut self, ex: &'v Expr<'v>) {
351 fn visit_ty(&mut self, t: &'v Ty<'v>) {
354 fn visit_generic_param(&mut self, p: &'v GenericParam<'v>) {
355 walk_generic_param(self, p)
357 fn visit_generics(&mut self, g: &'v Generics<'v>) {
358 walk_generics(self, g)
360 fn visit_where_predicate(&mut self, predicate: &'v WherePredicate<'v>) {
361 walk_where_predicate(self, predicate)
363 fn visit_fn_decl(&mut self, fd: &'v FnDecl<'v>) {
364 walk_fn_decl(self, fd)
366 fn visit_fn(&mut self, fk: FnKind<'v>, fd: &'v FnDecl<'v>, b: BodyId, s: Span, id: HirId) {
367 walk_fn(self, fk, fd, b, s, id)
369 fn visit_use(&mut self, path: &'v Path<'v>, hir_id: HirId) {
370 walk_use(self, path, hir_id)
372 fn visit_trait_item(&mut self, ti: &'v TraitItem<'v>) {
373 walk_trait_item(self, ti)
375 fn visit_trait_item_ref(&mut self, ii: &'v TraitItemRef) {
376 walk_trait_item_ref(self, ii)
378 fn visit_impl_item(&mut self, ii: &'v ImplItem<'v>) {
379 walk_impl_item(self, ii)
381 fn visit_impl_item_ref(&mut self, ii: &'v ImplItemRef<'v>) {
382 walk_impl_item_ref(self, ii)
384 fn visit_trait_ref(&mut self, t: &'v TraitRef<'v>) {
385 walk_trait_ref(self, t)
387 fn visit_param_bound(&mut self, bounds: &'v GenericBound<'v>) {
388 walk_param_bound(self, bounds)
390 fn visit_poly_trait_ref(&mut self, t: &'v PolyTraitRef<'v>, m: TraitBoundModifier) {
391 walk_poly_trait_ref(self, t, m)
393 fn visit_variant_data(
395 s: &'v VariantData<'v>,
401 walk_struct_def(self, s)
403 fn visit_struct_field(&mut self, s: &'v StructField<'v>) {
404 walk_struct_field(self, s)
408 enum_definition: &'v EnumDef<'v>,
409 generics: &'v Generics<'v>,
413 walk_enum_def(self, enum_definition, generics, item_id)
415 fn visit_variant(&mut self, v: &'v Variant<'v>, g: &'v Generics<'v>, item_id: HirId) {
416 walk_variant(self, v, g, item_id)
418 fn visit_label(&mut self, label: &'v Label) {
419 walk_label(self, label)
421 fn visit_generic_arg(&mut self, generic_arg: &'v GenericArg<'v>) {
423 GenericArg::Lifetime(lt) => self.visit_lifetime(lt),
424 GenericArg::Type(ty) => self.visit_ty(ty),
425 GenericArg::Const(ct) => self.visit_anon_const(&ct.value),
428 fn visit_lifetime(&mut self, lifetime: &'v Lifetime) {
429 walk_lifetime(self, lifetime)
431 fn visit_qpath(&mut self, qpath: &'v QPath<'v>, id: HirId, span: Span) {
432 walk_qpath(self, qpath, id, span)
434 fn visit_path(&mut self, path: &'v Path<'v>, _id: HirId) {
435 walk_path(self, path)
437 fn visit_path_segment(&mut self, path_span: Span, path_segment: &'v PathSegment<'v>) {
438 walk_path_segment(self, path_span, path_segment)
440 fn visit_generic_args(&mut self, path_span: Span, generic_args: &'v GenericArgs<'v>) {
441 walk_generic_args(self, path_span, generic_args)
443 fn visit_assoc_type_binding(&mut self, type_binding: &'v TypeBinding<'v>) {
444 walk_assoc_type_binding(self, type_binding)
446 fn visit_attribute(&mut self, _attr: &'v Attribute) {}
447 fn visit_macro_def(&mut self, macro_def: &'v MacroDef<'v>) {
448 walk_macro_def(self, macro_def)
450 fn visit_vis(&mut self, vis: &'v Visibility<'v>) {
453 fn visit_associated_item_kind(&mut self, kind: &'v AssocItemKind) {
454 walk_associated_item_kind(self, kind);
456 fn visit_defaultness(&mut self, defaultness: &'v Defaultness) {
457 walk_defaultness(self, defaultness);
461 /// Walks the contents of a crate. See also `Crate::visit_all_items`.
462 pub fn walk_crate<'v, V: Visitor<'v>>(visitor: &mut V, krate: &'v Crate<'v>) {
463 visitor.visit_mod(&krate.item.module, krate.item.span, CRATE_HIR_ID);
464 walk_list!(visitor, visit_attribute, krate.item.attrs);
465 walk_list!(visitor, visit_macro_def, krate.exported_macros);
468 pub fn walk_macro_def<'v, V: Visitor<'v>>(visitor: &mut V, macro_def: &'v MacroDef<'v>) {
469 visitor.visit_id(macro_def.hir_id);
470 visitor.visit_ident(macro_def.ident);
471 walk_list!(visitor, visit_attribute, macro_def.attrs);
474 pub fn walk_mod<'v, V: Visitor<'v>>(visitor: &mut V, module: &'v Mod<'v>, mod_hir_id: HirId) {
475 visitor.visit_id(mod_hir_id);
476 for &item_id in module.item_ids {
477 visitor.visit_nested_item(item_id);
481 pub fn walk_body<'v, V: Visitor<'v>>(visitor: &mut V, body: &'v Body<'v>) {
482 walk_list!(visitor, visit_param, body.params);
483 visitor.visit_expr(&body.value);
486 pub fn walk_local<'v, V: Visitor<'v>>(visitor: &mut V, local: &'v Local<'v>) {
487 // Intentionally visiting the expr first - the initialization expr
488 // dominates the local's definition.
489 walk_list!(visitor, visit_expr, &local.init);
490 walk_list!(visitor, visit_attribute, local.attrs.iter());
491 visitor.visit_id(local.hir_id);
492 visitor.visit_pat(&local.pat);
493 walk_list!(visitor, visit_ty, &local.ty);
496 pub fn walk_ident<'v, V: Visitor<'v>>(visitor: &mut V, ident: Ident) {
497 visitor.visit_name(ident.span, ident.name);
500 pub fn walk_label<'v, V: Visitor<'v>>(visitor: &mut V, label: &'v Label) {
501 visitor.visit_ident(label.ident);
504 pub fn walk_lifetime<'v, V: Visitor<'v>>(visitor: &mut V, lifetime: &'v Lifetime) {
505 visitor.visit_id(lifetime.hir_id);
506 match lifetime.name {
507 LifetimeName::Param(ParamName::Plain(ident)) => {
508 visitor.visit_ident(ident);
510 LifetimeName::Param(ParamName::Fresh(_))
511 | LifetimeName::Param(ParamName::Error)
512 | LifetimeName::Static
513 | LifetimeName::Error
514 | LifetimeName::Implicit
515 | LifetimeName::ImplicitObjectLifetimeDefault
516 | LifetimeName::Underscore => {}
520 pub fn walk_poly_trait_ref<'v, V: Visitor<'v>>(
522 trait_ref: &'v PolyTraitRef<'v>,
523 _modifier: TraitBoundModifier,
525 walk_list!(visitor, visit_generic_param, trait_ref.bound_generic_params);
526 visitor.visit_trait_ref(&trait_ref.trait_ref);
529 pub fn walk_trait_ref<'v, V: Visitor<'v>>(visitor: &mut V, trait_ref: &'v TraitRef<'v>) {
530 visitor.visit_id(trait_ref.hir_ref_id);
531 visitor.visit_path(&trait_ref.path, trait_ref.hir_ref_id)
534 pub fn walk_param<'v, V: Visitor<'v>>(visitor: &mut V, param: &'v Param<'v>) {
535 visitor.visit_id(param.hir_id);
536 visitor.visit_pat(¶m.pat);
537 walk_list!(visitor, visit_attribute, param.attrs);
540 pub fn walk_item<'v, V: Visitor<'v>>(visitor: &mut V, item: &'v Item<'v>) {
541 visitor.visit_vis(&item.vis);
542 visitor.visit_ident(item.ident);
544 ItemKind::ExternCrate(orig_name) => {
545 visitor.visit_id(item.hir_id);
546 if let Some(orig_name) = orig_name {
547 visitor.visit_name(item.span, orig_name);
550 ItemKind::Use(ref path, _) => {
551 visitor.visit_use(path, item.hir_id);
553 ItemKind::Static(ref typ, _, body) | ItemKind::Const(ref typ, body) => {
554 visitor.visit_id(item.hir_id);
555 visitor.visit_ty(typ);
556 visitor.visit_nested_body(body);
558 ItemKind::Fn(ref sig, ref generics, body_id) => visitor.visit_fn(
559 FnKind::ItemFn(item.ident, generics, sig.header, &item.vis, &item.attrs),
565 ItemKind::Mod(ref module) => {
566 // `visit_mod()` takes care of visiting the `Item`'s `HirId`.
567 visitor.visit_mod(module, item.span, item.hir_id)
569 ItemKind::ForeignMod(ref foreign_module) => {
570 visitor.visit_id(item.hir_id);
571 walk_list!(visitor, visit_foreign_item, foreign_module.items);
573 ItemKind::GlobalAsm(_) => {
574 visitor.visit_id(item.hir_id);
576 ItemKind::TyAlias(ref ty, ref generics) => {
577 visitor.visit_id(item.hir_id);
578 visitor.visit_ty(ty);
579 visitor.visit_generics(generics)
581 ItemKind::OpaqueTy(OpaqueTy { ref generics, bounds, .. }) => {
582 visitor.visit_id(item.hir_id);
583 walk_generics(visitor, generics);
584 walk_list!(visitor, visit_param_bound, bounds);
586 ItemKind::Enum(ref enum_definition, ref generics) => {
587 visitor.visit_generics(generics);
588 // `visit_enum_def()` takes care of visiting the `Item`'s `HirId`.
589 visitor.visit_enum_def(enum_definition, generics, item.hir_id, item.span)
602 visitor.visit_id(item.hir_id);
603 visitor.visit_generics(generics);
604 walk_list!(visitor, visit_trait_ref, of_trait);
605 visitor.visit_ty(self_ty);
606 walk_list!(visitor, visit_impl_item_ref, items);
608 ItemKind::Struct(ref struct_definition, ref generics)
609 | ItemKind::Union(ref struct_definition, ref generics) => {
610 visitor.visit_generics(generics);
611 visitor.visit_id(item.hir_id);
612 visitor.visit_variant_data(
620 ItemKind::Trait(.., ref generics, bounds, trait_item_refs) => {
621 visitor.visit_id(item.hir_id);
622 visitor.visit_generics(generics);
623 walk_list!(visitor, visit_param_bound, bounds);
624 walk_list!(visitor, visit_trait_item_ref, trait_item_refs);
626 ItemKind::TraitAlias(ref generics, bounds) => {
627 visitor.visit_id(item.hir_id);
628 visitor.visit_generics(generics);
629 walk_list!(visitor, visit_param_bound, bounds);
632 walk_list!(visitor, visit_attribute, item.attrs);
635 pub fn walk_use<'v, V: Visitor<'v>>(visitor: &mut V, path: &'v Path<'v>, hir_id: HirId) {
636 visitor.visit_id(hir_id);
637 visitor.visit_path(path, hir_id);
640 pub fn walk_enum_def<'v, V: Visitor<'v>>(
642 enum_definition: &'v EnumDef<'v>,
643 generics: &'v Generics<'v>,
646 visitor.visit_id(item_id);
647 walk_list!(visitor, visit_variant, enum_definition.variants, generics, item_id);
650 pub fn walk_variant<'v, V: Visitor<'v>>(
652 variant: &'v Variant<'v>,
653 generics: &'v Generics<'v>,
654 parent_item_id: HirId,
656 visitor.visit_ident(variant.ident);
657 visitor.visit_id(variant.id);
658 visitor.visit_variant_data(
665 walk_list!(visitor, visit_anon_const, &variant.disr_expr);
666 walk_list!(visitor, visit_attribute, variant.attrs);
669 pub fn walk_ty<'v, V: Visitor<'v>>(visitor: &mut V, typ: &'v Ty<'v>) {
670 visitor.visit_id(typ.hir_id);
673 TyKind::Slice(ref ty) => visitor.visit_ty(ty),
674 TyKind::Ptr(ref mutable_type) => visitor.visit_ty(&mutable_type.ty),
675 TyKind::Rptr(ref lifetime, ref mutable_type) => {
676 visitor.visit_lifetime(lifetime);
677 visitor.visit_ty(&mutable_type.ty)
680 TyKind::Tup(tuple_element_types) => {
681 walk_list!(visitor, visit_ty, tuple_element_types);
683 TyKind::BareFn(ref function_declaration) => {
684 walk_list!(visitor, visit_generic_param, function_declaration.generic_params);
685 visitor.visit_fn_decl(&function_declaration.decl);
687 TyKind::Path(ref qpath) => {
688 visitor.visit_qpath(qpath, typ.hir_id, typ.span);
690 TyKind::OpaqueDef(item_id, lifetimes) => {
691 visitor.visit_nested_item(item_id);
692 walk_list!(visitor, visit_generic_arg, lifetimes);
694 TyKind::Array(ref ty, ref length) => {
695 visitor.visit_ty(ty);
696 visitor.visit_anon_const(length)
698 TyKind::TraitObject(bounds, ref lifetime) => {
699 for bound in bounds {
700 visitor.visit_poly_trait_ref(bound, TraitBoundModifier::None);
702 visitor.visit_lifetime(lifetime);
704 TyKind::Typeof(ref expression) => visitor.visit_anon_const(expression),
705 TyKind::Infer | TyKind::Err => {}
709 pub fn walk_qpath<'v, V: Visitor<'v>>(
711 qpath: &'v QPath<'v>,
716 QPath::Resolved(ref maybe_qself, ref path) => {
717 walk_list!(visitor, visit_ty, maybe_qself);
718 visitor.visit_path(path, id)
720 QPath::TypeRelative(ref qself, ref segment) => {
721 visitor.visit_ty(qself);
722 visitor.visit_path_segment(span, segment);
724 QPath::LangItem(..) => {}
728 pub fn walk_path<'v, V: Visitor<'v>>(visitor: &mut V, path: &'v Path<'v>) {
729 for segment in path.segments {
730 visitor.visit_path_segment(path.span, segment);
734 pub fn walk_path_segment<'v, V: Visitor<'v>>(
737 segment: &'v PathSegment<'v>,
739 visitor.visit_ident(segment.ident);
740 walk_list!(visitor, visit_id, segment.hir_id);
741 if let Some(ref args) = segment.args {
742 visitor.visit_generic_args(path_span, args);
746 pub fn walk_generic_args<'v, V: Visitor<'v>>(
749 generic_args: &'v GenericArgs<'v>,
751 walk_list!(visitor, visit_generic_arg, generic_args.args);
752 walk_list!(visitor, visit_assoc_type_binding, generic_args.bindings);
755 pub fn walk_assoc_type_binding<'v, V: Visitor<'v>>(
757 type_binding: &'v TypeBinding<'v>,
759 visitor.visit_id(type_binding.hir_id);
760 visitor.visit_ident(type_binding.ident);
761 match type_binding.kind {
762 TypeBindingKind::Equality { ref ty } => {
763 visitor.visit_ty(ty);
765 TypeBindingKind::Constraint { bounds } => {
766 walk_list!(visitor, visit_param_bound, bounds);
771 pub fn walk_pat<'v, V: Visitor<'v>>(visitor: &mut V, pattern: &'v Pat<'v>) {
772 visitor.visit_id(pattern.hir_id);
774 PatKind::TupleStruct(ref qpath, children, _) => {
775 visitor.visit_qpath(qpath, pattern.hir_id, pattern.span);
776 walk_list!(visitor, visit_pat, children);
778 PatKind::Path(ref qpath) => {
779 visitor.visit_qpath(qpath, pattern.hir_id, pattern.span);
781 PatKind::Struct(ref qpath, fields, _) => {
782 visitor.visit_qpath(qpath, pattern.hir_id, pattern.span);
783 for field in fields {
784 visitor.visit_id(field.hir_id);
785 visitor.visit_ident(field.ident);
786 visitor.visit_pat(&field.pat)
789 PatKind::Or(pats) => walk_list!(visitor, visit_pat, pats),
790 PatKind::Tuple(tuple_elements, _) => {
791 walk_list!(visitor, visit_pat, tuple_elements);
793 PatKind::Box(ref subpattern) | PatKind::Ref(ref subpattern, _) => {
794 visitor.visit_pat(subpattern)
796 PatKind::Binding(_, _hir_id, ident, ref optional_subpattern) => {
797 visitor.visit_ident(ident);
798 walk_list!(visitor, visit_pat, optional_subpattern);
800 PatKind::Lit(ref expression) => visitor.visit_expr(expression),
801 PatKind::Range(ref lower_bound, ref upper_bound, _) => {
802 walk_list!(visitor, visit_expr, lower_bound);
803 walk_list!(visitor, visit_expr, upper_bound);
806 PatKind::Slice(prepatterns, ref slice_pattern, postpatterns) => {
807 walk_list!(visitor, visit_pat, prepatterns);
808 walk_list!(visitor, visit_pat, slice_pattern);
809 walk_list!(visitor, visit_pat, postpatterns);
814 pub fn walk_foreign_item<'v, V: Visitor<'v>>(visitor: &mut V, foreign_item: &'v ForeignItem<'v>) {
815 visitor.visit_id(foreign_item.hir_id);
816 visitor.visit_vis(&foreign_item.vis);
817 visitor.visit_ident(foreign_item.ident);
819 match foreign_item.kind {
820 ForeignItemKind::Fn(ref function_declaration, param_names, ref generics) => {
821 visitor.visit_generics(generics);
822 visitor.visit_fn_decl(function_declaration);
823 for ¶m_name in param_names {
824 visitor.visit_ident(param_name);
827 ForeignItemKind::Static(ref typ, _) => visitor.visit_ty(typ),
828 ForeignItemKind::Type => (),
831 walk_list!(visitor, visit_attribute, foreign_item.attrs);
834 pub fn walk_param_bound<'v, V: Visitor<'v>>(visitor: &mut V, bound: &'v GenericBound<'v>) {
836 GenericBound::Trait(ref typ, modifier) => {
837 visitor.visit_poly_trait_ref(typ, modifier);
839 GenericBound::LangItemTrait(_, span, hir_id, args) => {
840 visitor.visit_id(hir_id);
841 visitor.visit_generic_args(span, args);
843 GenericBound::Outlives(ref lifetime) => visitor.visit_lifetime(lifetime),
847 pub fn walk_generic_param<'v, V: Visitor<'v>>(visitor: &mut V, param: &'v GenericParam<'v>) {
848 visitor.visit_id(param.hir_id);
849 walk_list!(visitor, visit_attribute, param.attrs);
851 ParamName::Plain(ident) => visitor.visit_ident(ident),
852 ParamName::Error | ParamName::Fresh(_) => {}
855 GenericParamKind::Lifetime { .. } => {}
856 GenericParamKind::Type { ref default, .. } => walk_list!(visitor, visit_ty, default),
857 GenericParamKind::Const { ref ty } => visitor.visit_ty(ty),
859 walk_list!(visitor, visit_param_bound, param.bounds);
862 pub fn walk_generics<'v, V: Visitor<'v>>(visitor: &mut V, generics: &'v Generics<'v>) {
863 walk_list!(visitor, visit_generic_param, generics.params);
864 walk_list!(visitor, visit_where_predicate, generics.where_clause.predicates);
867 pub fn walk_where_predicate<'v, V: Visitor<'v>>(
869 predicate: &'v WherePredicate<'v>,
872 &WherePredicate::BoundPredicate(WhereBoundPredicate {
875 bound_generic_params,
878 visitor.visit_ty(bounded_ty);
879 walk_list!(visitor, visit_param_bound, bounds);
880 walk_list!(visitor, visit_generic_param, bound_generic_params);
882 &WherePredicate::RegionPredicate(WhereRegionPredicate { ref lifetime, bounds, .. }) => {
883 visitor.visit_lifetime(lifetime);
884 walk_list!(visitor, visit_param_bound, bounds);
886 &WherePredicate::EqPredicate(WhereEqPredicate {
887 hir_id, ref lhs_ty, ref rhs_ty, ..
889 visitor.visit_id(hir_id);
890 visitor.visit_ty(lhs_ty);
891 visitor.visit_ty(rhs_ty);
896 pub fn walk_fn_ret_ty<'v, V: Visitor<'v>>(visitor: &mut V, ret_ty: &'v FnRetTy<'v>) {
897 if let FnRetTy::Return(ref output_ty) = *ret_ty {
898 visitor.visit_ty(output_ty)
902 pub fn walk_fn_decl<'v, V: Visitor<'v>>(visitor: &mut V, function_declaration: &'v FnDecl<'v>) {
903 for ty in function_declaration.inputs {
906 walk_fn_ret_ty(visitor, &function_declaration.output)
909 pub fn walk_fn_kind<'v, V: Visitor<'v>>(visitor: &mut V, function_kind: FnKind<'v>) {
910 match function_kind {
911 FnKind::ItemFn(_, generics, ..) => {
912 visitor.visit_generics(generics);
914 FnKind::Method(..) | FnKind::Closure(_) => {}
918 pub fn walk_fn<'v, V: Visitor<'v>>(
920 function_kind: FnKind<'v>,
921 function_declaration: &'v FnDecl<'v>,
926 visitor.visit_id(id);
927 visitor.visit_fn_decl(function_declaration);
928 walk_fn_kind(visitor, function_kind);
929 visitor.visit_nested_body(body_id)
932 pub fn walk_trait_item<'v, V: Visitor<'v>>(visitor: &mut V, trait_item: &'v TraitItem<'v>) {
933 visitor.visit_ident(trait_item.ident);
934 walk_list!(visitor, visit_attribute, trait_item.attrs);
935 visitor.visit_generics(&trait_item.generics);
936 match trait_item.kind {
937 TraitItemKind::Const(ref ty, default) => {
938 visitor.visit_id(trait_item.hir_id);
939 visitor.visit_ty(ty);
940 walk_list!(visitor, visit_nested_body, default);
942 TraitItemKind::Fn(ref sig, TraitFn::Required(param_names)) => {
943 visitor.visit_id(trait_item.hir_id);
944 visitor.visit_fn_decl(&sig.decl);
945 for ¶m_name in param_names {
946 visitor.visit_ident(param_name);
949 TraitItemKind::Fn(ref sig, TraitFn::Provided(body_id)) => {
951 FnKind::Method(trait_item.ident, sig, None, &trait_item.attrs),
958 TraitItemKind::Type(bounds, ref default) => {
959 visitor.visit_id(trait_item.hir_id);
960 walk_list!(visitor, visit_param_bound, bounds);
961 walk_list!(visitor, visit_ty, default);
966 pub fn walk_trait_item_ref<'v, V: Visitor<'v>>(visitor: &mut V, trait_item_ref: &'v TraitItemRef) {
967 // N.B., deliberately force a compilation error if/when new fields are added.
968 let TraitItemRef { id, ident, ref kind, span: _, ref defaultness } = *trait_item_ref;
969 visitor.visit_nested_trait_item(id);
970 visitor.visit_ident(ident);
971 visitor.visit_associated_item_kind(kind);
972 visitor.visit_defaultness(defaultness);
975 pub fn walk_impl_item<'v, V: Visitor<'v>>(visitor: &mut V, impl_item: &'v ImplItem<'v>) {
976 // N.B., deliberately force a compilation error if/when new fields are added.
988 visitor.visit_ident(ident);
989 visitor.visit_vis(vis);
990 visitor.visit_defaultness(defaultness);
991 walk_list!(visitor, visit_attribute, attrs);
992 visitor.visit_generics(generics);
994 ImplItemKind::Const(ref ty, body) => {
995 visitor.visit_id(impl_item.hir_id);
996 visitor.visit_ty(ty);
997 visitor.visit_nested_body(body);
999 ImplItemKind::Fn(ref sig, body_id) => {
1001 FnKind::Method(impl_item.ident, sig, Some(&impl_item.vis), &impl_item.attrs),
1008 ImplItemKind::TyAlias(ref ty) => {
1009 visitor.visit_id(impl_item.hir_id);
1010 visitor.visit_ty(ty);
1015 pub fn walk_impl_item_ref<'v, V: Visitor<'v>>(visitor: &mut V, impl_item_ref: &'v ImplItemRef<'v>) {
1016 // N.B., deliberately force a compilation error if/when new fields are added.
1017 let ImplItemRef { id, ident, ref kind, span: _, ref vis, ref defaultness } = *impl_item_ref;
1018 visitor.visit_nested_impl_item(id);
1019 visitor.visit_ident(ident);
1020 visitor.visit_associated_item_kind(kind);
1021 visitor.visit_vis(vis);
1022 visitor.visit_defaultness(defaultness);
1025 pub fn walk_struct_def<'v, V: Visitor<'v>>(
1027 struct_definition: &'v VariantData<'v>,
1029 walk_list!(visitor, visit_id, struct_definition.ctor_hir_id());
1030 walk_list!(visitor, visit_struct_field, struct_definition.fields());
1033 pub fn walk_struct_field<'v, V: Visitor<'v>>(visitor: &mut V, struct_field: &'v StructField<'v>) {
1034 visitor.visit_id(struct_field.hir_id);
1035 visitor.visit_vis(&struct_field.vis);
1036 visitor.visit_ident(struct_field.ident);
1037 visitor.visit_ty(&struct_field.ty);
1038 walk_list!(visitor, visit_attribute, struct_field.attrs);
1041 pub fn walk_block<'v, V: Visitor<'v>>(visitor: &mut V, block: &'v Block<'v>) {
1042 visitor.visit_id(block.hir_id);
1043 walk_list!(visitor, visit_stmt, block.stmts);
1044 walk_list!(visitor, visit_expr, &block.expr);
1047 pub fn walk_stmt<'v, V: Visitor<'v>>(visitor: &mut V, statement: &'v Stmt<'v>) {
1048 visitor.visit_id(statement.hir_id);
1049 match statement.kind {
1050 StmtKind::Local(ref local) => visitor.visit_local(local),
1051 StmtKind::Item(item) => visitor.visit_nested_item(item),
1052 StmtKind::Expr(ref expression) | StmtKind::Semi(ref expression) => {
1053 visitor.visit_expr(expression)
1058 pub fn walk_anon_const<'v, V: Visitor<'v>>(visitor: &mut V, constant: &'v AnonConst) {
1059 visitor.visit_id(constant.hir_id);
1060 visitor.visit_nested_body(constant.body);
1063 pub fn walk_expr<'v, V: Visitor<'v>>(visitor: &mut V, expression: &'v Expr<'v>) {
1064 visitor.visit_id(expression.hir_id);
1065 walk_list!(visitor, visit_attribute, expression.attrs.iter());
1066 match expression.kind {
1067 ExprKind::Box(ref subexpression) => visitor.visit_expr(subexpression),
1068 ExprKind::Array(subexpressions) => {
1069 walk_list!(visitor, visit_expr, subexpressions);
1071 ExprKind::Repeat(ref element, ref count) => {
1072 visitor.visit_expr(element);
1073 visitor.visit_anon_const(count)
1075 ExprKind::Struct(ref qpath, fields, ref optional_base) => {
1076 visitor.visit_qpath(qpath, expression.hir_id, expression.span);
1077 for field in fields {
1078 visitor.visit_id(field.hir_id);
1079 visitor.visit_ident(field.ident);
1080 visitor.visit_expr(&field.expr)
1082 walk_list!(visitor, visit_expr, optional_base);
1084 ExprKind::Tup(subexpressions) => {
1085 walk_list!(visitor, visit_expr, subexpressions);
1087 ExprKind::Call(ref callee_expression, arguments) => {
1088 visitor.visit_expr(callee_expression);
1089 walk_list!(visitor, visit_expr, arguments);
1091 ExprKind::MethodCall(ref segment, _, arguments, _) => {
1092 visitor.visit_path_segment(expression.span, segment);
1093 walk_list!(visitor, visit_expr, arguments);
1095 ExprKind::Binary(_, ref left_expression, ref right_expression) => {
1096 visitor.visit_expr(left_expression);
1097 visitor.visit_expr(right_expression)
1099 ExprKind::AddrOf(_, _, ref subexpression) | ExprKind::Unary(_, ref subexpression) => {
1100 visitor.visit_expr(subexpression)
1102 ExprKind::Cast(ref subexpression, ref typ) | ExprKind::Type(ref subexpression, ref typ) => {
1103 visitor.visit_expr(subexpression);
1104 visitor.visit_ty(typ)
1106 ExprKind::DropTemps(ref subexpression) => {
1107 visitor.visit_expr(subexpression);
1109 ExprKind::Loop(ref block, ref opt_label, _) => {
1110 walk_list!(visitor, visit_label, opt_label);
1111 visitor.visit_block(block);
1113 ExprKind::Match(ref subexpression, arms, _) => {
1114 visitor.visit_expr(subexpression);
1115 walk_list!(visitor, visit_arm, arms);
1117 ExprKind::Closure(_, ref function_declaration, body, _fn_decl_span, _gen) => visitor
1119 FnKind::Closure(&expression.attrs),
1120 function_declaration,
1125 ExprKind::Block(ref block, ref opt_label) => {
1126 walk_list!(visitor, visit_label, opt_label);
1127 visitor.visit_block(block);
1129 ExprKind::Assign(ref lhs, ref rhs, _) => {
1130 visitor.visit_expr(rhs);
1131 visitor.visit_expr(lhs)
1133 ExprKind::AssignOp(_, ref left_expression, ref right_expression) => {
1134 visitor.visit_expr(right_expression);
1135 visitor.visit_expr(left_expression);
1137 ExprKind::Field(ref subexpression, ident) => {
1138 visitor.visit_expr(subexpression);
1139 visitor.visit_ident(ident);
1141 ExprKind::Index(ref main_expression, ref index_expression) => {
1142 visitor.visit_expr(main_expression);
1143 visitor.visit_expr(index_expression)
1145 ExprKind::Path(ref qpath) => {
1146 visitor.visit_qpath(qpath, expression.hir_id, expression.span);
1148 ExprKind::Break(ref destination, ref opt_expr) => {
1149 walk_list!(visitor, visit_label, &destination.label);
1150 walk_list!(visitor, visit_expr, opt_expr);
1152 ExprKind::Continue(ref destination) => {
1153 walk_list!(visitor, visit_label, &destination.label);
1155 ExprKind::Ret(ref optional_expression) => {
1156 walk_list!(visitor, visit_expr, optional_expression);
1158 ExprKind::InlineAsm(ref asm) => {
1159 for op in asm.operands {
1161 InlineAsmOperand::In { expr, .. }
1162 | InlineAsmOperand::InOut { expr, .. }
1163 | InlineAsmOperand::Const { expr, .. }
1164 | InlineAsmOperand::Sym { expr, .. } => visitor.visit_expr(expr),
1165 InlineAsmOperand::Out { expr, .. } => {
1166 if let Some(expr) = expr {
1167 visitor.visit_expr(expr);
1170 InlineAsmOperand::SplitInOut { in_expr, out_expr, .. } => {
1171 visitor.visit_expr(in_expr);
1172 if let Some(out_expr) = out_expr {
1173 visitor.visit_expr(out_expr);
1179 ExprKind::LlvmInlineAsm(ref asm) => {
1180 walk_list!(visitor, visit_expr, asm.outputs_exprs);
1181 walk_list!(visitor, visit_expr, asm.inputs_exprs);
1183 ExprKind::Yield(ref subexpression, _) => {
1184 visitor.visit_expr(subexpression);
1186 ExprKind::Lit(_) | ExprKind::Err => {}
1190 pub fn walk_arm<'v, V: Visitor<'v>>(visitor: &mut V, arm: &'v Arm<'v>) {
1191 visitor.visit_id(arm.hir_id);
1192 visitor.visit_pat(&arm.pat);
1193 if let Some(ref g) = arm.guard {
1195 Guard::If(ref e) => visitor.visit_expr(e),
1198 visitor.visit_expr(&arm.body);
1199 walk_list!(visitor, visit_attribute, arm.attrs);
1202 pub fn walk_vis<'v, V: Visitor<'v>>(visitor: &mut V, vis: &'v Visibility<'v>) {
1203 if let VisibilityKind::Restricted { ref path, hir_id } = vis.node {
1204 visitor.visit_id(hir_id);
1205 visitor.visit_path(path, hir_id)
1209 pub fn walk_associated_item_kind<'v, V: Visitor<'v>>(_: &mut V, _: &'v AssocItemKind) {
1210 // No visitable content here: this fn exists so you can call it if
1211 // the right thing to do, should content be added in the future,
1212 // would be to walk it.
1215 pub fn walk_defaultness<'v, V: Visitor<'v>>(_: &mut V, _: &'v Defaultness) {
1216 // No visitable content here: this fn exists so you can call it if
1217 // the right thing to do, should content be added in the future,
1218 // would be to walk it.