-
Notifications
You must be signed in to change notification settings - Fork 132
/
Copy pathvisit.rs
265 lines (254 loc) · 9.21 KB
/
visit.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
// Copyright 2016 The html5ever Project Developers. See the
// COPYRIGHT file at the top-level directory of this distribution.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
/// Just enough of an AST visitor to reach every expression.
use syn;
pub trait Visitor {
fn visit_crate(&mut self, _crate: &mut syn::Crate) {}
fn visit_item(&mut self, _item: &mut syn::Item) {}
fn visit_trait_item(&mut self, _item: &mut syn::TraitItem) {}
fn visit_impl_item(&mut self, _item: &mut syn::ImplItem) {}
fn visit_block(&mut self, _expr: &mut syn::Block) {}
fn visit_statement(&mut self, _expr: &mut syn::Stmt) {}
fn visit_expression(&mut self, _expr: &mut syn::Expr) {}
}
pub struct RecursiveVisitor<'a, V: 'a> {
pub node_visitor: &'a mut V,
}
impl<'a, V: Visitor + 'a> Visitor for RecursiveVisitor<'a, V> {
fn visit_crate(&mut self, crate_: &mut syn::Crate) {
self.node_visitor.visit_crate(crate_);
for item in &mut crate_.items {
self.visit_item(item)
}
}
fn visit_item(&mut self, item: &mut syn::Item) {
use syn::ItemKind::*;
self.node_visitor.visit_item(item);
match item.node {
ExternCrate(_) => {}
Use(_) => {}
Static(_, _, ref mut expr) => self.visit_expression(expr),
Const(_, ref mut expr) => self.visit_expression(expr),
Fn(_, _, _, _, _, ref mut block) => self.visit_block(block),
Mod(Some(ref mut items)) => {
for item in items {
self.visit_item(item)
}
}
Mod(None) => {}
ForeignMod(_) => {}
Ty(_, _) => {}
Enum(_, _) => {}
Struct(_, _) => {}
Union(_, _) => {}
Trait(_, _, _, ref mut trait_items) => {
for trait_item in trait_items {
self.visit_trait_item(trait_item)
}
}
DefaultImpl(_, _) => {}
Impl(_, _, _, _, _, ref mut impl_items) => {
for impl_item in impl_items {
self.visit_impl_item(impl_item)
}
}
Mac(_) => {}
}
}
fn visit_trait_item(&mut self, trait_item: &mut syn::TraitItem) {
use syn::TraitItemKind::*;
self.node_visitor.visit_trait_item(trait_item);
match trait_item.node {
Const(_, Some(ref mut expr)) => self.visit_expression(expr),
Const(_, None) => {}
Method(_, Some(ref mut block)) => self.visit_block(block),
Method(_, None) => {}
Type(_, _) => {}
Macro(_) => {}
}
}
fn visit_impl_item(&mut self, impl_item: &mut syn::ImplItem) {
use syn::ImplItemKind::*;
self.node_visitor.visit_impl_item(impl_item);
match impl_item.node {
Const(_, ref mut expr) => self.visit_expression(expr),
Method(_, ref mut block) => self.visit_block(block),
Type(_) => {}
Macro(_) => {}
}
}
fn visit_block(&mut self, block: &mut syn::Block) {
self.node_visitor.visit_block(block);
for statement in &mut block.stmts {
self.visit_statement(statement)
}
}
fn visit_statement(&mut self, statement: &mut syn::Stmt) {
use syn::Stmt::*;
self.node_visitor.visit_statement(statement);
match *statement {
Local(ref mut local) => {
if let Some(ref mut expr) = local.init {
self.visit_expression(expr)
}
}
Item(ref mut item) => self.visit_item(item),
Expr(ref mut expr) => self.visit_expression(expr),
Semi(ref mut expr) => self.visit_expression(expr),
Mac(_) => {}
}
}
fn visit_expression(&mut self, expr: &mut syn::Expr) {
use syn::ExprKind::*;
self.node_visitor.visit_expression(expr);
match expr.node {
Box(ref mut boxed) => {
self.visit_expression(boxed)
}
Vec(ref mut elements) => {
for element in elements {
self.visit_expression(element)
}
}
Call(ref mut called, ref mut args) => {
self.visit_expression(called);
for arg in args {
self.visit_expression(arg)
}
}
MethodCall(_, _, ref mut args) => {
for arg in args {
self.visit_expression(arg)
}
}
Tup(ref mut elements) => {
for element in elements {
self.visit_expression(element)
}
}
Binary(_, ref mut left, ref mut right) => {
self.visit_expression(left);
self.visit_expression(right);
}
Unary(_, ref mut operand) => {
self.visit_expression(operand)
}
Lit(_) => {}
Cast(ref mut expr, _) => {
self.visit_expression(expr)
}
Type(ref mut expr, _) => {
self.visit_expression(expr)
}
If(ref mut test, ref mut then, ref mut else_) => {
self.visit_expression(test);
self.visit_block(then);
if let Some(ref mut else_) = *else_ {
self.visit_expression(else_);
}
}
IfLet(_, ref mut test, ref mut then, ref mut else_) => {
self.visit_expression(test);
self.visit_block(then);
if let Some(ref mut else_) = *else_ {
self.visit_expression(else_);
}
}
While(ref mut test, ref mut block, _) => {
self.visit_expression(test);
self.visit_block(block);
}
WhileLet(_, ref mut test, ref mut block, _) => {
self.visit_expression(test);
self.visit_block(block);
}
ForLoop(_, ref mut iterable, ref mut block, _) => {
self.visit_expression(iterable);
self.visit_block(block);
}
Loop(ref mut block, _) => {
self.visit_block(block);
}
Match(ref mut matched, ref mut arms) => {
self.visit_expression(matched);
for arm in arms {
if let Some(ref mut guard) = arm.guard {
self.visit_expression(guard)
}
self.visit_expression(&mut arm.body)
}
}
Closure(_, _, ref mut block) => {
self.visit_block(block)
}
Block(_, ref mut block) => {
self.visit_block(block)
}
Assign(ref mut left, ref mut right) => {
self.visit_expression(left);
self.visit_expression(right);
}
AssignOp(_, ref mut left, ref mut right) => {
self.visit_expression(left);
self.visit_expression(right);
}
Field(ref mut base, _) => {
self.visit_expression(base)
}
TupField(ref mut base, _) => {
self.visit_expression(base)
}
Index(ref mut base, ref mut index) => {
self.visit_expression(base);
self.visit_expression(index);
}
Range(ref mut start, ref mut end, _) => {
if let Some(ref mut start) = *start {
self.visit_expression(start)
}
if let Some(ref mut end) = *end {
self.visit_expression(end)
}
}
Path(_, _) => {}
AddrOf(_, ref mut base) => {
self.visit_expression(base)
}
Break(_) => {}
Continue(_) => {}
Ret(Some(ref mut expr)) => {
self.visit_expression(expr)
}
Ret(None) => {}
Mac(_) => {}
Struct(_, ref mut fields, ref mut base) => {
for field in fields {
self.visit_expression(&mut field.expr)
}
if let Some(ref mut base) = *base {
self.visit_expression(base)
}
}
Repeat(ref mut element, ref mut number) => {
self.visit_expression(element);
self.visit_expression(number);
}
Paren(ref mut expr) => {
self.visit_expression(expr)
}
Try(ref mut expr) => {
self.visit_expression(expr)
}
InPlace(ref mut expr, ref mut other) => {
self.visit_expression(expr);
self.visit_expression(other);
}
}
}
}