1use super::{
2 AliasReft, AssocItemConstraint, AssocItemConstraintKind, BaseTy, BaseTyKind, Ensures, EnumDef,
3 Expr, ExprKind, FieldDef, FieldExpr, FluxItem, FnDecl, FnOutput, FnSig, ForeignItem,
4 ForeignItemKind, FuncSort, GenericArg, GenericBound, Generics, Impl, ImplAssocReft, ImplItem,
5 ImplItemKind, Item, ItemKind, Lifetime, Lit, OpaqueTy, OwnerNode, Path, PathExpr, PathSegment,
6 PolyFuncSort, PolyTraitRef, QPath, Qualifier, RefineParam, Requires, Sort, SortPath, SpecFunc,
7 StructDef, TraitAssocReft, TraitItem, TraitItemKind, Ty, TyAlias, TyKind, VariantDef,
8 VariantRet, WhereBoundPredicate,
9};
10use crate::fhir::{PrimOpProp, QPathExpr, SortDecl, StructKind};
11
12#[macro_export]
13macro_rules! walk_list {
14 ($visitor: expr, $method: ident, $list: expr $(, $($extra_args: expr),* )?) => {
15 {
16 #[allow(for_loops_over_fallibles)]
17 for elem in $list {
18 $visitor.$method(elem $(, $($extra_args,)* )?)
19 }
20 }
21 }
22}
23
24pub trait Visitor<'v>: Sized {
25 fn visit_flux_item(&mut self, item: &FluxItem<'v>) {
26 walk_flux_item(self, item);
27 }
28
29 fn visit_qualifier(&mut self, qualifier: &Qualifier<'v>) {
30 walk_qualifier(self, qualifier);
31 }
32
33 fn visit_sort_decl(&mut self, sort_decl: &SortDecl) {
34 walk_sort_decl(self, sort_decl);
35 }
36
37 fn visit_func(&mut self, func: &SpecFunc<'v>) {
38 walk_func(self, func);
39 }
40
41 fn visit_primop_prop(&mut self, prop: &PrimOpProp<'v>) {
42 walk_primop_prop(self, prop);
43 }
44
45 fn visit_node(&mut self, node: &OwnerNode<'v>) {
46 walk_node(self, node);
47 }
48
49 fn visit_item(&mut self, item: &Item<'v>) {
50 walk_item(self, item);
51 }
52
53 fn visit_trait_item(&mut self, trait_item: &TraitItem<'v>) {
54 walk_trait_item(self, trait_item);
55 }
56
57 fn visit_impl_item(&mut self, impl_item: &ImplItem<'v>) {
58 walk_impl_item(self, impl_item);
59 }
60
61 fn visit_foreign_item(&mut self, foreign_item: &ForeignItem<'v>) {
62 walk_foreign_item(self, foreign_item);
63 }
64
65 fn visit_generics(&mut self, generics: &Generics<'v>) {
66 walk_generics(self, generics);
67 }
68
69 fn visit_where_predicate(&mut self, predicate: &WhereBoundPredicate<'v>) {
70 walk_where_predicate(self, predicate);
71 }
72
73 fn visit_impl(&mut self, impl_: &Impl<'v>) {
74 walk_impl(self, impl_);
75 }
76
77 fn visit_impl_assoc_reft(&mut self, assoc_reft: &ImplAssocReft<'v>) {
78 walk_impl_assoc_reft(self, assoc_reft);
79 }
80
81 fn visit_trait_assoc_reft(&mut self, assoc_reft: &TraitAssocReft<'v>) {
82 walk_trait_assoc_reft(self, assoc_reft);
83 }
84
85 fn visit_struct_def(&mut self, struct_def: &StructDef<'v>) {
86 walk_struct_def(self, struct_def);
87 }
88
89 fn visit_enum_def(&mut self, enum_def: &EnumDef<'v>) {
90 walk_enum_def(self, enum_def);
91 }
92
93 fn visit_variant(&mut self, variant: &VariantDef<'v>) {
94 walk_variant(self, variant);
95 }
96
97 fn visit_field_def(&mut self, field: &FieldDef<'v>) {
98 walk_field_def(self, field);
99 }
100
101 fn visit_variant_ret(&mut self, ret: &VariantRet<'v>) {
102 walk_variant_ret(self, ret);
103 }
104
105 fn visit_ty_alias(&mut self, ty_alias: &TyAlias<'v>) {
106 walk_ty_alias(self, ty_alias);
107 }
108
109 fn visit_opaque_ty(&mut self, opaque_ty: &OpaqueTy<'v>) {
110 walk_opaque_ty(self, opaque_ty);
111 }
112
113 fn visit_generic_bound(&mut self, bound: &GenericBound<'v>) {
114 walk_generic_bound(self, bound);
115 }
116
117 fn visit_poly_trait_ref(&mut self, trait_ref: &PolyTraitRef<'v>) {
118 walk_poly_trait_ref(self, trait_ref);
119 }
120
121 fn visit_fn_sig(&mut self, sig: &FnSig<'v>) {
122 walk_fn_sig(self, sig);
123 }
124
125 fn visit_fn_decl(&mut self, decl: &FnDecl<'v>) {
126 walk_fn_decl(self, decl);
127 }
128
129 fn visit_refine_param(&mut self, param: &RefineParam<'v>) {
130 walk_refine_param(self, param);
131 }
132
133 fn visit_requires(&mut self, requires: &Requires<'v>) {
134 walk_requires(self, requires);
135 }
136
137 fn visit_ensures(&mut self, ensures: &Ensures<'v>) {
138 walk_ensures(self, ensures);
139 }
140
141 fn visit_fn_output(&mut self, output: &FnOutput<'v>) {
142 walk_fn_output(self, output);
143 }
144
145 fn visit_generic_arg(&mut self, arg: &GenericArg<'v>) {
146 walk_generic_arg(self, arg);
147 }
148
149 fn visit_lifetime(&mut self, _lft: &Lifetime) {}
150
151 fn visit_ty(&mut self, ty: &Ty<'v>) {
152 walk_ty(self, ty);
153 }
154
155 fn visit_bty(&mut self, bty: &BaseTy<'v>) {
156 walk_bty(self, bty);
157 }
158
159 fn visit_qpath(&mut self, qpath: &QPath<'v>) {
160 walk_qpath(self, qpath);
161 }
162
163 fn visit_path(&mut self, path: &Path<'v>) {
164 walk_path(self, path);
165 }
166
167 fn visit_path_segment(&mut self, segment: &PathSegment<'v>) {
168 walk_path_segment(self, segment);
169 }
170
171 fn visit_assoc_item_constraint(&mut self, constraint: &AssocItemConstraint<'v>) {
172 walk_assoc_item_constraint(self, constraint);
173 }
174
175 fn visit_sort(&mut self, sort: &Sort<'v>) {
176 walk_sort(self, sort);
177 }
178
179 fn visit_sort_path(&mut self, path: &SortPath<'v>) {
180 walk_sort_path(self, path);
181 }
182
183 fn visit_poly_func_sort(&mut self, func: &PolyFuncSort<'v>) {
184 walk_poly_func_sort(self, func);
185 }
186
187 fn visit_func_sort(&mut self, func: &FuncSort<'v>) {
188 walk_func_sort(self, func);
189 }
190
191 fn visit_expr(&mut self, expr: &Expr<'v>) {
192 walk_expr(self, expr);
193 }
194
195 fn visit_field_expr(&mut self, expr: &FieldExpr<'v>) {
196 walk_field_expr(self, expr);
197 }
198
199 fn visit_alias_reft(&mut self, alias_reft: &AliasReft<'v>) {
200 walk_alias_reft(self, alias_reft);
201 }
202
203 fn visit_literal(&mut self, _lit: &Lit) {}
204
205 fn visit_path_expr(&mut self, _path: &PathExpr<'v>) {}
206}
207
208fn walk_sort_decl<'v, V: Visitor<'v>>(_vis: &mut V, _sort_decl: &SortDecl) {}
209
210fn walk_func<'v, V: Visitor<'v>>(vis: &mut V, func: &SpecFunc<'v>) {
211 walk_list!(vis, visit_refine_param, func.args);
212 vis.visit_sort(&func.sort);
213 if let Some(body) = &func.body {
214 vis.visit_expr(body);
215 }
216}
217
218fn walk_primop_prop<'v, V: Visitor<'v>>(vis: &mut V, prop: &PrimOpProp<'v>) {
219 walk_list!(vis, visit_refine_param, prop.args);
220 vis.visit_expr(&prop.body);
221}
222
223fn walk_qualifier<'v, V: Visitor<'v>>(vis: &mut V, qualifier: &Qualifier<'v>) {
224 walk_list!(vis, visit_refine_param, qualifier.args);
225 vis.visit_expr(&qualifier.expr);
226}
227
228fn walk_flux_item<'v, V: Visitor<'v>>(vis: &mut V, item: &FluxItem<'v>) {
229 match item {
230 FluxItem::Qualifier(qualifier) => {
231 vis.visit_qualifier(qualifier);
232 }
233 FluxItem::Func(func) => {
234 vis.visit_func(func);
235 }
236 FluxItem::PrimOpProp(prop) => {
237 vis.visit_primop_prop(prop);
238 }
239 FluxItem::SortDecl(sort_decl) => {
240 vis.visit_sort_decl(sort_decl);
241 }
242 }
243}
244
245pub fn walk_impl<'v, V: Visitor<'v>>(vis: &mut V, impl_: &Impl<'v>) {
246 walk_list!(vis, visit_impl_assoc_reft, impl_.assoc_refinements);
247}
248
249pub fn walk_struct_def<'v, V: Visitor<'v>>(vis: &mut V, struct_def: &StructDef<'v>) {
250 walk_list!(vis, visit_refine_param, struct_def.params);
251 walk_list!(vis, visit_expr, struct_def.invariants);
252 if let StructKind::Transparent { fields } = struct_def.kind {
253 walk_list!(vis, visit_field_def, fields);
254 }
255}
256
257pub fn walk_enum_def<'v, V: Visitor<'v>>(vis: &mut V, enum_def: &EnumDef<'v>) {
258 walk_list!(vis, visit_refine_param, enum_def.params);
259 walk_list!(vis, visit_variant, enum_def.variants);
260 walk_list!(vis, visit_expr, enum_def.invariants);
261}
262
263pub fn walk_variant<'v, V: Visitor<'v>>(vis: &mut V, variant: &VariantDef<'v>) {
264 walk_list!(vis, visit_refine_param, variant.params);
265 walk_list!(vis, visit_field_def, variant.fields);
266 vis.visit_variant_ret(&variant.ret);
267}
268
269pub fn walk_field_def<'v, V: Visitor<'v>>(vis: &mut V, field: &FieldDef<'v>) {
270 let FieldDef { ty, lifted: _ } = field;
271 vis.visit_ty(ty);
272}
273
274pub fn walk_variant_ret<'v, V: Visitor<'v>>(vis: &mut V, ret: &VariantRet<'v>) {
275 let VariantRet { idx, enum_id: _ } = ret;
276 vis.visit_expr(idx);
277}
278
279pub fn walk_ty_alias<'v, V: Visitor<'v>>(vis: &mut V, ty_alias: &TyAlias<'v>) {
280 if let Some(index) = &ty_alias.index {
281 vis.visit_refine_param(index);
282 }
283 vis.visit_ty(&ty_alias.ty);
284}
285
286pub fn walk_opaque_ty<'v, V: Visitor<'v>>(vis: &mut V, opaque_ty: &OpaqueTy<'v>) {
287 walk_list!(vis, visit_generic_bound, opaque_ty.bounds);
288}
289
290pub fn walk_generic_bound<'v, V: Visitor<'v>>(vis: &mut V, bound: &GenericBound<'v>) {
291 match bound {
292 GenericBound::Trait(trait_ref) => vis.visit_poly_trait_ref(trait_ref),
293 GenericBound::Outlives(_) => {}
294 }
295}
296
297pub fn walk_poly_trait_ref<'v, V: Visitor<'v>>(vis: &mut V, trait_ref: &PolyTraitRef<'v>) {
298 walk_list!(vis, visit_refine_param, trait_ref.refine_params);
299 vis.visit_path(&trait_ref.trait_ref);
300}
301
302pub fn walk_node<'v, V: Visitor<'v>>(vis: &mut V, node: &OwnerNode<'v>) {
303 match node {
304 OwnerNode::Item(item) => vis.visit_item(item),
305 OwnerNode::TraitItem(trait_item) => vis.visit_trait_item(trait_item),
306 OwnerNode::ImplItem(impl_item) => vis.visit_impl_item(impl_item),
307 OwnerNode::ForeignItem(foreign_item) => vis.visit_foreign_item(foreign_item),
308 }
309}
310
311pub fn walk_item<'v, V: Visitor<'v>>(vis: &mut V, item: &Item<'v>) {
312 vis.visit_generics(&item.generics);
313 match &item.kind {
314 ItemKind::Enum(enum_def) => vis.visit_enum_def(enum_def),
315 ItemKind::Struct(struct_def) => vis.visit_struct_def(struct_def),
316 ItemKind::TyAlias(ty_alias) => vis.visit_ty_alias(ty_alias),
317 ItemKind::Trait(trait_) => {
318 walk_list!(vis, visit_trait_assoc_reft, trait_.assoc_refinements);
319 }
320 ItemKind::Impl(impl_) => vis.visit_impl(impl_),
321 ItemKind::Fn(fn_sig) => vis.visit_fn_sig(fn_sig),
322 ItemKind::Const(info) => {
323 if let Some(expr) = info {
324 vis.visit_expr(expr);
325 }
326 }
327 ItemKind::Static(ty) => {
328 if let Some(ty) = ty {
329 vis.visit_ty(ty);
330 }
331 }
332 }
333}
334
335pub fn walk_trait_item<'v, V: Visitor<'v>>(vis: &mut V, trait_item: &TraitItem<'v>) {
336 vis.visit_generics(&trait_item.generics);
337 match &trait_item.kind {
338 TraitItemKind::Fn(fn_sig) => vis.visit_fn_sig(fn_sig),
339 TraitItemKind::Type => {}
340 TraitItemKind::Const => {}
341 }
342}
343
344pub fn walk_impl_item<'v, V: Visitor<'v>>(vis: &mut V, impl_item: &ImplItem<'v>) {
345 vis.visit_generics(&impl_item.generics);
346 match &impl_item.kind {
347 ImplItemKind::Fn(fn_sig) => vis.visit_fn_sig(fn_sig),
348 ImplItemKind::Const => {}
349 ImplItemKind::Type => {}
350 }
351}
352
353pub fn walk_foreign_item<'v, V: Visitor<'v>>(vis: &mut V, impl_item: &ForeignItem<'v>) {
354 match &impl_item.kind {
355 ForeignItemKind::Fn(fn_sig, generics) => {
356 vis.visit_generics(generics);
357 vis.visit_fn_sig(fn_sig);
358 }
359 ForeignItemKind::Static(ty, _, _, generics) => {
360 vis.visit_generics(generics);
361 vis.visit_ty(ty);
362 }
363 }
364}
365
366pub fn walk_trait_assoc_reft<'v, V: Visitor<'v>>(vis: &mut V, assoc_reft: &TraitAssocReft<'v>) {
367 walk_list!(vis, visit_refine_param, assoc_reft.params);
368 vis.visit_sort(&assoc_reft.output);
369 if let Some(expr) = &assoc_reft.body {
370 vis.visit_expr(expr);
371 }
372}
373
374pub fn walk_impl_assoc_reft<'v, V: Visitor<'v>>(vis: &mut V, assoc_reft: &ImplAssocReft<'v>) {
375 walk_list!(vis, visit_refine_param, assoc_reft.params);
376 vis.visit_sort(&assoc_reft.output);
377 vis.visit_expr(&assoc_reft.body);
378}
379
380pub fn walk_generics<'v, V: Visitor<'v>>(vis: &mut V, generics: &Generics<'v>) {
381 walk_list!(vis, visit_refine_param, generics.refinement_params);
382 if let Some(predicates) = generics.predicates {
383 walk_list!(vis, visit_where_predicate, predicates);
384 }
385}
386
387pub fn walk_where_predicate<'v, V: Visitor<'v>>(vis: &mut V, predicate: &WhereBoundPredicate<'v>) {
388 vis.visit_ty(&predicate.bounded_ty);
389 walk_list!(vis, visit_generic_bound, predicate.bounds);
390}
391
392pub fn walk_fn_sig<'v, V: Visitor<'v>>(vis: &mut V, sig: &FnSig<'v>) {
393 vis.visit_fn_decl(sig.decl);
394}
395
396pub fn walk_fn_decl<'v, V: Visitor<'v>>(vis: &mut V, decl: &FnDecl<'v>) {
397 walk_list!(vis, visit_requires, decl.requires);
398 walk_list!(vis, visit_ty, decl.inputs);
399 vis.visit_fn_output(&decl.output);
400}
401
402pub fn walk_refine_param<'v, V: Visitor<'v>>(vis: &mut V, param: &RefineParam<'v>) {
403 vis.visit_sort(¶m.sort);
404}
405
406pub fn walk_requires<'v, V: Visitor<'v>>(vis: &mut V, requires: &Requires<'v>) {
407 walk_list!(vis, visit_refine_param, requires.params);
408 vis.visit_expr(&requires.pred);
409}
410
411pub fn walk_ensures<'v, V: Visitor<'v>>(vis: &mut V, constraint: &Ensures<'v>) {
412 match constraint {
413 Ensures::Type(loc, ty) => {
414 vis.visit_path_expr(loc);
415 vis.visit_ty(ty);
416 }
417 Ensures::Pred(pred) => {
418 vis.visit_expr(pred);
419 }
420 }
421}
422
423pub fn walk_fn_output<'v, V: Visitor<'v>>(vis: &mut V, output: &FnOutput<'v>) {
424 walk_list!(vis, visit_refine_param, output.params);
425 vis.visit_ty(&output.ret);
426 walk_list!(vis, visit_ensures, output.ensures);
427}
428
429pub fn walk_generic_arg<'v, V: Visitor<'v>>(vis: &mut V, arg: &GenericArg<'v>) {
430 match arg {
431 GenericArg::Lifetime(lft) => vis.visit_lifetime(lft),
432 GenericArg::Type(ty) => vis.visit_ty(ty),
433 GenericArg::Const(_) | GenericArg::Infer => {}
434 }
435}
436
437pub fn walk_ty<'v, V: Visitor<'v>>(vis: &mut V, ty: &Ty<'v>) {
438 match ty.kind {
439 TyKind::BaseTy(bty) => vis.visit_bty(&bty),
440 TyKind::Indexed(bty, idx) => {
441 vis.visit_bty(&bty);
442 vis.visit_expr(&idx);
443 }
444 TyKind::Exists(params, ty) => {
445 walk_list!(vis, visit_refine_param, params);
446 vis.visit_ty(ty);
447 }
448 TyKind::Constr(pred, ty) => {
449 vis.visit_expr(&pred);
450 vis.visit_ty(ty);
451 }
452 TyKind::StrgRef(lft, loc, ty) => {
453 vis.visit_lifetime(&lft);
454 vis.visit_path_expr(loc);
455 vis.visit_ty(ty);
456 }
457 TyKind::Ref(lft, mty) => {
458 vis.visit_lifetime(&lft);
459 vis.visit_ty(mty.ty);
460 }
461 TyKind::BareFn(bare_fn) => vis.visit_fn_decl(bare_fn.decl),
462 TyKind::Tuple(tys) => {
463 walk_list!(vis, visit_ty, tys);
464 }
465 TyKind::Array(ty, _len) => {
466 vis.visit_ty(ty);
467 }
468 TyKind::OpaqueDef(opaque_ty) => {
469 vis.visit_opaque_ty(opaque_ty);
470 }
471 TyKind::TraitObject(poly_traits, lft, _) => {
472 walk_list!(vis, visit_poly_trait_ref, poly_traits);
473 vis.visit_lifetime(&lft);
474 }
475 TyKind::Never | TyKind::Infer | TyKind::Err(_) => {}
476 }
477}
478
479pub fn walk_bty<'v, V: Visitor<'v>>(vis: &mut V, bty: &BaseTy<'v>) {
480 match &bty.kind {
481 BaseTyKind::Path(path) => vis.visit_qpath(path),
482 BaseTyKind::Slice(ty) => vis.visit_ty(ty),
483 BaseTyKind::RawPtr(ty, _mtblt) => {
484 vis.visit_ty(ty);
485 }
486 BaseTyKind::Err(_) => {}
487 }
488}
489
490pub fn walk_qpath<'v, V: Visitor<'v>>(vis: &mut V, qpath: &QPath<'v>) {
491 match qpath {
492 QPath::Resolved(qself, path) => {
493 if let Some(self_ty) = qself {
494 vis.visit_ty(self_ty);
495 }
496 vis.visit_path(path);
497 }
498 QPath::TypeRelative(qself, assoc) => {
499 vis.visit_ty(qself);
500 vis.visit_path_segment(assoc);
501 }
502 }
503}
504
505pub fn walk_path<'v, V: Visitor<'v>>(vis: &mut V, path: &Path<'v>) {
506 walk_list!(vis, visit_path_segment, path.segments);
507 walk_list!(vis, visit_expr, path.refine);
508}
509
510pub fn walk_path_segment<'v, V: Visitor<'v>>(vis: &mut V, segment: &PathSegment<'v>) {
511 walk_list!(vis, visit_generic_arg, segment.args);
512 walk_list!(vis, visit_assoc_item_constraint, segment.constraints);
513}
514
515pub fn walk_assoc_item_constraint<'v, V: Visitor<'v>>(
516 vis: &mut V,
517 constraint: &AssocItemConstraint<'v>,
518) {
519 match &constraint.kind {
520 AssocItemConstraintKind::Equality { term } => {
521 vis.visit_ty(term);
522 }
523 }
524}
525
526pub fn walk_sort<'v, V: Visitor<'v>>(vis: &mut V, sort: &Sort<'v>) {
527 match sort {
528 Sort::Path(path) => vis.visit_sort_path(path),
529 Sort::Func(func) => vis.visit_poly_func_sort(func),
530 Sort::SortOf(bty) => vis.visit_bty(bty),
531 Sort::Tuple(sorts) => {
532 walk_list!(vis, visit_sort, *sorts);
533 }
534 Sort::Loc | Sort::BitVec(_) | Sort::Infer | Sort::Err(_) => {}
535 }
536}
537
538pub fn walk_sort_path<'v, V: Visitor<'v>>(vis: &mut V, path: &SortPath<'v>) {
539 walk_list!(vis, visit_sort, path.args);
540}
541
542pub fn walk_poly_func_sort<'v, V: Visitor<'v>>(vis: &mut V, func: &PolyFuncSort<'v>) {
543 let PolyFuncSort { params: _, fsort } = func;
544 vis.visit_func_sort(fsort);
545}
546
547pub fn walk_func_sort<'v, V: Visitor<'v>>(vis: &mut V, func: &FuncSort<'v>) {
548 walk_list!(vis, visit_sort, func.inputs_and_output);
549}
550
551pub fn walk_alias_reft<'v, V: Visitor<'v>>(vis: &mut V, alias: &AliasReft<'v>) {
552 match alias {
553 AliasReft::Qualified { qself, trait_, name: _ } => {
554 vis.visit_ty(qself);
555 vis.visit_path(trait_);
556 }
557 AliasReft::TypeRelative { qself, name: _ } => {
558 vis.visit_ty(qself);
559 }
560 }
561}
562
563pub fn walk_field_expr<'v, V: Visitor<'v>>(vis: &mut V, expr: &FieldExpr<'v>) {
564 vis.visit_expr(&expr.expr);
565}
566
567pub fn walk_expr<'v, V: Visitor<'v>>(vis: &mut V, expr: &Expr<'v>) {
568 match expr.kind {
569 ExprKind::Var(qpath) => walk_qpath_expr(vis, qpath),
570 ExprKind::Dot(base, _fld) => {
571 vis.visit_expr(base);
572 }
573 ExprKind::Literal(lit) => vis.visit_literal(&lit),
574 ExprKind::BinaryOp(_op, e1, e2) => {
575 vis.visit_expr(e1);
576 vis.visit_expr(e2);
577 }
578 ExprKind::PrimApp(_op, e1, e2) => {
579 vis.visit_expr(e1);
580 vis.visit_expr(e2);
581 }
582 ExprKind::UnaryOp(_op, e) => vis.visit_expr(e),
583 ExprKind::App(_func, args) => {
584 walk_list!(vis, visit_expr, args);
585 }
586 ExprKind::Alias(alias_reft, args) => {
587 vis.visit_alias_reft(&alias_reft);
588 walk_list!(vis, visit_expr, args);
589 }
590 ExprKind::IfThenElse(e1, e2, e3) => {
591 vis.visit_expr(e1);
592 vis.visit_expr(e2);
593 vis.visit_expr(e3);
594 }
595 ExprKind::Abs(refine_params, body) => {
596 walk_list!(vis, visit_refine_param, refine_params);
597 vis.visit_expr(body);
598 }
599 ExprKind::Record(exprs) | ExprKind::SetLiteral(exprs) | ExprKind::Tuple(exprs) => {
600 walk_list!(vis, visit_expr, exprs);
601 }
602 ExprKind::Constructor(path, exprs, spread) => {
603 if let Some(path) = path {
604 vis.visit_path_expr(&path);
605 }
606 walk_list!(vis, visit_field_expr, exprs);
607 if let Some(s) = spread {
608 vis.visit_expr(&s.expr);
609 }
610 }
611 ExprKind::BoundedQuant(_, param, _, expr) => {
612 vis.visit_refine_param(¶m);
613 vis.visit_expr(expr);
614 }
615 ExprKind::Block(decls, body) => {
616 for decl in decls {
617 vis.visit_expr(&decl.init);
618 vis.visit_refine_param(&decl.param);
619 }
620 vis.visit_expr(body);
621 }
622 ExprKind::Err(_) => {}
623 }
624}
625
626pub fn walk_qpath_expr<'v, V: Visitor<'v>>(vis: &mut V, qpath: QPathExpr<'v>) {
627 match qpath {
628 QPathExpr::Resolved(path, _param_kind) => {
629 vis.visit_path_expr(&path);
630 }
631 QPathExpr::TypeRelative(qself, _ident) => vis.visit_ty(qself),
632 }
633}