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
|
/* Compiler implementation of the D programming language
* Copyright (C) 1999-2021 by The D Language Foundation, All Rights Reserved
* written by Walter Bright
* http://www.digitalmars.com
* Distributed under the Boost Software License, Version 1.0.
* http://www.boost.org/LICENSE_1_0.txt
* https://github.com/D-Programming-Language/dmd/blob/master/src/apply.c
*/
#include "root/dsystem.h"
#include "mars.h"
#include "expression.h"
#include "template.h"
#include "visitor.h"
/**************************************
* An Expression tree walker that will visit each Expression e in the tree,
* in depth-first evaluation order, and call fp(e,param) on it.
* fp() signals whether the walking continues with its return value:
* Returns:
* 0 continue
* 1 done
* It's a bit slower than using virtual functions, but more encapsulated and less brittle.
* Creating an iterator for this would be much more complex.
*/
class PostorderExpressionVisitor : public StoppableVisitor
{
public:
StoppableVisitor *v;
PostorderExpressionVisitor(StoppableVisitor *v) : v(v) {}
bool doCond(Expression *e)
{
if (!stop && e)
e->accept(this);
return stop;
}
bool doCond(Expressions *e)
{
if (!e)
return false;
for (size_t i = 0; i < e->length && !stop; i++)
doCond((*e)[i]);
return stop;
}
bool applyTo(Expression *e)
{
e->accept(v);
stop = v->stop;
return true;
}
void visit(Expression *e)
{
applyTo(e);
}
void visit(NewExp *e)
{
//printf("NewExp::apply(): %s\n", toChars());
doCond(e->thisexp) || doCond(e->newargs) || doCond(e->arguments) || applyTo(e);
}
void visit(NewAnonClassExp *e)
{
//printf("NewAnonClassExp::apply(): %s\n", toChars());
doCond(e->thisexp) || doCond(e->newargs) || doCond(e->arguments) || applyTo(e);
}
void visit(TypeidExp *e)
{
doCond(isExpression(e->obj)) || applyTo(e);
}
void visit(UnaExp *e)
{
doCond(e->e1) || applyTo(e);
}
void visit(BinExp *e)
{
doCond(e->e1) || doCond(e->e2) || applyTo(e);
}
void visit(AssertExp *e)
{
//printf("CallExp::apply(apply_fp_t fp, void *param): %s\n", toChars());
doCond(e->e1) || doCond(e->msg) || applyTo(e);
}
void visit(CallExp *e)
{
//printf("CallExp::apply(apply_fp_t fp, void *param): %s\n", toChars());
doCond(e->e1) || doCond(e->arguments) || applyTo(e);
}
void visit(ArrayExp *e)
{
//printf("ArrayExp::apply(apply_fp_t fp, void *param): %s\n", toChars());
doCond(e->e1) || doCond(e->arguments) || applyTo(e);
}
void visit(SliceExp *e)
{
doCond(e->e1) || doCond(e->lwr) || doCond(e->upr) || applyTo(e);
}
void visit(ArrayLiteralExp *e)
{
doCond(e->basis) || doCond(e->elements) || applyTo(e);
}
void visit(AssocArrayLiteralExp *e)
{
doCond(e->keys) || doCond(e->values) || applyTo(e);
}
void visit(StructLiteralExp *e)
{
if (e->stageflags & stageApply) return;
int old = e->stageflags;
e->stageflags |= stageApply;
doCond(e->elements) || applyTo(e);
e->stageflags = old;
}
void visit(TupleExp *e)
{
doCond(e->e0) || doCond(e->exps) || applyTo(e);
}
void visit(CondExp *e)
{
doCond(e->econd) || doCond(e->e1) || doCond(e->e2) || applyTo(e);
}
};
bool walkPostorder(Expression *e, StoppableVisitor *v)
{
PostorderExpressionVisitor pv(v);
e->accept(&pv);
return v->stop;
}
|
