/
stmtchk.go
304 lines (271 loc) · 6.28 KB
/
stmtchk.go
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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
package cl
import (
"log"
"time"
"github.com/weblfe/c2go/clang/ast"
)
// -----------------------------------------------------------------------------
type none = struct{}
type blockMarkCtx struct {
parent *blockMarkCtx
owner *ownerStmtCtx
name string
}
func markComplicatedByDepth(ctx *markCtx, a, b *blockMarkCtx) {
aDepth, bDepth := a.depth(), b.depth()
retry:
if aDepth < bDepth {
b = b.owner.markComplicated(ctx)
bDepth = b.depth()
goto retry
} else if bDepth < aDepth {
a = a.owner.markComplicated(ctx)
aDepth = a.depth()
goto retry
} else if a != b {
a, b = a.owner.markComplicated(ctx), b.owner.markComplicated(ctx)
aDepth, bDepth = a.depth(), b.depth()
goto retry
}
}
func (at *blockMarkCtx) markComplicated(ctx *markCtx, ref *blockMarkCtx) {
if at.isComplicated(ref) {
at.owner.markComplicated(ctx)
markComplicatedByDepth(ctx, at, ref)
}
}
func (at *blockMarkCtx) getName() string {
if at != nil {
return at.name
}
return "funcBody"
}
func (at *blockMarkCtx) depth() (n int) {
for at != nil {
n++
at = at.parent
}
return
}
func (at *blockMarkCtx) isComplicated(ref *blockMarkCtx) bool {
if at == nil {
return false
}
if at.owner.isComplicated() {
return true
}
for ref != nil {
if at == ref {
return false
}
ref = ref.parent
}
return true
}
type labelCtx struct {
at *blockMarkCtx // block that defines this label
refs map[*blockMarkCtx]none // blocks that refer this label
defined bool
}
func (p *labelCtx) defineLabel(name string, at *blockMarkCtx) {
if p.defined {
log.Panicln("defineLabel: label exists -", name)
}
p.at, p.defined = at, true
if debugMarkComplicated {
log.Println("--> label", name, "depth:", at.depth())
}
}
func (p *labelCtx) useLabel(name string, at *blockMarkCtx) {
if p.refs == nil {
p.refs = make(map[*blockMarkCtx]none)
}
p.refs[at] = none{}
if debugMarkComplicated {
log.Println("--> goto", name, "from depth:", at.depth())
}
}
type ownerStmtCtx struct {
parent *blockMarkCtx
stmt *ast.Node
}
func (p *ownerStmtCtx) isComplicated() bool {
if p != nil {
return p.stmt.Complicated
}
return false
}
func (p *ownerStmtCtx) markComplicated(ctx *markCtx) *blockMarkCtx {
if p != nil {
ctx.markComplicated(p.stmt)
return p.parent
}
return nil
}
type markCtx struct {
current *blockMarkCtx
owner *ownerStmtCtx
labels map[string]*labelCtx
complicat bool
}
func (p *markCtx) reqLabel(name string) *labelCtx {
l, ok := p.labels[name]
if !ok {
l = &labelCtx{}
p.labels[name] = l
}
return l
}
func (p *markCtx) enter(name string) *blockMarkCtx {
self := &blockMarkCtx{parent: p.current, owner: p.owner, name: name}
p.current = self
if debugMarkComplicated {
log.Println("--> enter", name, "depth:", self.depth())
}
return self
}
func (p *markCtx) leave(self *blockMarkCtx) {
p.current = self.parent
}
func (p *markCtx) enterOwner(stmt *ast.Node) (old *ownerStmtCtx) {
if debugMarkComplicated {
log.Println("--> stmt", stmt.Kind, "depth:", p.current.depth())
}
p.owner, old = &ownerStmtCtx{parent: p.current, stmt: stmt}, p.owner
return
}
func (p *markCtx) leaveOwner(old *ownerStmtCtx) {
p.owner = old
}
func (p *markCtx) markSub(ctx *blockCtx, name string, stmt *ast.Node) {
self := p.enter(name)
defer p.leave(self)
p.markBody(ctx, stmt)
}
func (p *markCtx) markBody(ctx *blockCtx, stmt *ast.Node) {
switch stmt.Kind {
case ast.CompoundStmt:
for _, item := range stmt.Inner {
p.mark(ctx, item)
}
return
}
p.mark(ctx, stmt)
}
func (p *markCtx) mark(ctx *blockCtx, stmt *ast.Node) {
switch stmt.Kind {
case ast.IfStmt:
ret := p.enterOwner(stmt)
defer p.leaveOwner(ret)
p.markSub(ctx, "ifBody", stmt.Inner[1])
if stmt.HasElse {
p.markSub(ctx, "elseBody", stmt.Inner[2])
}
case ast.SwitchStmt:
p.markSwitch(ctx, stmt)
case ast.ForStmt:
ret := p.enterOwner(stmt)
defer p.leaveOwner(ret)
p.markSub(ctx, "forBody", stmt.Inner[4])
case ast.WhileStmt:
ret := p.enterOwner(stmt)
defer p.leaveOwner(ret)
p.markSub(ctx, "whileBody", stmt.Inner[1])
case ast.DoStmt:
ret := p.enterOwner(stmt)
defer p.leaveOwner(ret)
p.markSub(ctx, "doBody", stmt.Inner[0])
case ast.LabelStmt:
name := stmt.Name
p.reqLabel(name).defineLabel(name, p.current)
case ast.GotoStmt:
name := ctx.labelOfGoto(stmt)
p.reqLabel(name).useLabel(name, p.current)
case ast.CompoundStmt:
ret := p.enterOwner(stmt)
defer p.leaveOwner(ret)
p.markSub(ctx, "blockBody", stmt)
case ast.CaseStmt, ast.DefaultStmt:
p.markSwitchComplicated()
}
}
func (p *markCtx) markSwitchComplicated() {
owner := p.owner
for owner != nil {
p.markComplicated(owner.stmt)
if owner.stmt.Kind == ast.SwitchStmt {
return
}
owner = owner.parent.owner
}
}
func (p *markCtx) markSwitch(ctx *blockCtx, switchStmt *ast.Node) {
ret := p.enterOwner(switchStmt)
defer p.leaveOwner(ret)
self := p.enter("switchBody")
defer p.leave(self)
body := switchStmt.Inner[1]
if firstStmtNotCase(body) {
p.markComplicated(switchStmt)
p.markComplicated(body)
}
var bodyStmts = body.Inner
var caseCtx *blockMarkCtx
for i, n := 0, len(bodyStmts); i < n; i++ {
stmt := bodyStmts[i]
retry:
var idx int
switch stmt.Kind {
case ast.CaseStmt:
idx = 1
case ast.DefaultStmt:
default:
p.mark(ctx, stmt)
continue
}
if caseCtx != nil {
p.leave(caseCtx)
caseCtx = nil
}
caseCtx = p.enter("caseBody")
switch caseBody := stmt.Inner[idx]; caseBody.Kind {
case ast.CaseStmt, ast.DefaultStmt:
stmt = caseBody
goto retry
default:
p.mark(ctx, caseBody)
}
}
return
}
func (p *markCtx) markEnd() {
for _, l := range p.labels {
for ref := range l.refs {
l.at.markComplicated(p, ref)
}
}
}
func (p *markCtx) markComplicated(stmt *ast.Node) {
if stmt == nil {
return
}
if debugMarkComplicated && !stmt.Complicated {
log.Println("==> markComplicated", stmt.Kind, *stmt.Range)
}
stmt.Complicated = true
p.complicat = true
}
func (p *blockCtx) markComplicated(name string, body *ast.Node) bool {
if debugMarkComplicated {
start := time.Now()
defer func() {
log.Printf("==> Marked %s: %v\n", name, time.Since(start))
}()
}
labels := make(map[string]*labelCtx)
marker := &markCtx{labels: labels}
marker.markBody(p, body)
marker.markEnd()
return marker.complicat
}
// -----------------------------------------------------------------------------