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
|
# This file is a part of Julia. License is MIT: https://julialang.org/license
if !isdefined(@__MODULE__, Symbol("@verify_error"))
macro verify_error(arg)
arg isa String && return esc(:(println(stderr, $arg)))
(arg isa Expr && arg.head === :string) || error("verify_error macro expected a string expression")
pushfirst!(arg.args, GlobalRef(Core, :stderr))
pushfirst!(arg.args, :println)
arg.head = :call
return esc(arg)
end
end
function check_op(ir::IRCode, domtree::DomTree, @nospecialize(op), use_bb::Int, use_idx::Int)
if isa(op, SSAValue)
if op.id > length(ir.stmts)
def_bb = block_for_inst(ir.cfg, ir.new_nodes[op.id - length(ir.stmts)].pos)
else
def_bb = block_for_inst(ir.cfg, op.id)
end
if (def_bb == use_bb)
if op.id > length(ir.stmts)
@assert ir.new_nodes[op.id - length(ir.stmts)].pos <= use_idx
else
@assert op.id < use_idx
end
else
if !dominates(domtree, def_bb, use_bb) && !(bb_unreachable(domtree, def_bb) && bb_unreachable(domtree, use_bb))
#@Base.show ir
@verify_error "Basic Block $def_bb does not dominate block $use_bb (tried to use value $(op.id))"
error()
end
end
elseif isa(op, Union{OldSSAValue, NewSSAValue})
#@Base.show ir
@verify_error "Left over SSA marker"
error()
elseif isa(op, Union{SlotNumber, TypedSlot})
@verify_error "Left over slot detected in converted IR"
error()
end
end
function count_int(val::Int, arr::Vector{Int})
n = 0
for x in arr
if x === val
n += 1
end
end
n
end
function verify_ir(ir::IRCode)
# For now require compact IR
# @assert isempty(ir.new_nodes)
# Verify CFG
last_end = 0
for (idx, block) in pairs(ir.cfg.blocks)
if first(block.stmts) != last_end + 1
#ranges = [(idx,first(bb.stmts),last(bb.stmts)) for (idx, bb) in pairs(ir.cfg.blocks)]
@verify_error "First statement of BB $idx ($(first(block.stmts))) does not match end of previous ($last_end)"
error()
end
last_end = last(block.stmts)
terminator = ir.stmts[last_end]
for p in block.preds
p == 0 && continue
c = count_int(idx, ir.cfg.blocks[p].succs)
if c == 0
@verify_error "Predecessor $p of block $idx not in successor list"
error()
elseif c > 1
@verify_error "Predecessor $p of block $idx occurs too often in successor list"
error()
end
end
if isa(terminator, ReturnNode)
if !isempty(block.succs)
@verify_error "Block $idx ends in return or unreachable, but has successors"
error()
end
elseif isa(terminator, GotoNode)
if length(block.succs) != 1 || block.succs[1] != terminator.label
@verify_error "Block $idx successors ($(block.succs)), does not match GotoNode terminator"
error()
end
elseif isa(terminator, GotoIfNot)
if terminator.dest == idx + 1
@verify_error "Block $idx terminator forms a double edge to block $(idx+1)"
error()
end
if length(block.succs) != 2 || (block.succs != [terminator.dest, idx+1] && block.succs != [idx+1, terminator.dest])
@verify_error "Block $idx successors ($(block.succs)), does not match GotoIfNot terminator"
error()
end
elseif isexpr(terminator, :enter)
@label enter_check
if length(block.succs) != 2 || (block.succs != [terminator.args[1], idx+1] && block.succs != [idx+1, terminator.args[1]])
@verify_error "Block $idx successors ($(block.succs)), does not match :enter terminator"
error()
end
else
if length(block.succs) != 1 || block.succs[1] != idx + 1
# As a special case, we allow extra statements in the BB of an :enter
# statement, until we can do proper CFG manipulations during compaction.
for stmt in ir.stmts[first(block.stmts):last(block.stmts)]
if isexpr(stmt, :enter)
terminator = stmt
@goto enter_check
end
isa(stmt, PhiNode) || break
end
@verify_error "Block $idx successors ($(block.succs)), does not match fall-through terminator"
error()
end
end
for s in block.succs
if !(idx in ir.cfg.blocks[s].preds)
#@Base.show ir.cfg
#@Base.show ir
#@Base.show ir.argtypes
@verify_error "Successor $s of block $idx not in predecessor list"
error()
end
end
end
# Verify statements
domtree = construct_domtree(ir.cfg)
for (bb, idx) in bbidxiter(ir)
stmt = ir.stmts[idx]
stmt === nothing && continue
if isa(stmt, PhiNode)
@assert length(stmt.edges) == length(stmt.values)
for i = 1:length(stmt.edges)
edge = stmt.edges[i]
if !(edge == 0 && bb == 1) && !(edge in ir.cfg.blocks[bb].preds)
#@Base.show ir.argtypes
#@Base.show ir
@verify_error "Edge $edge of φ node $idx not in predecessor list"
error()
end
edge == 0 && continue
isassigned(stmt.values, i) || continue
val = stmt.values[i]
phiT = ir.types[idx]
if isa(val, SSAValue)
if !(types(ir)[val] ⊑ phiT)
#@verify_error """
# PhiNode $idx, has operand $(val.id), whose type is not a sub lattice element.
# PhiNode type was $phiT
# Value type was $(ir.types[val.id])
#"""
#error()
end
elseif isa(val, GlobalRef) || isa(val, Expr)
@verify_error "GlobalRefs and Exprs are not allowed as PhiNode values"
error()
end
check_op(ir, domtree, val, edge, last(ir.cfg.blocks[stmt.edges[i]].stmts)+1)
end
elseif isa(stmt, PhiCNode)
for i = 1:length(stmt.values)
val = stmt.values[i]
if !isa(val, SSAValue)
@verify_error "Operand $i of PhiC node $idx must be an SSA Value."
error()
end
if !isa(ir[val], UpsilonNode)
@verify_error "Operand $i of PhiC node $idx must reference an Upsilon node."
error()
end
end
else
if isa(stmt, Expr) || isa(stmt, ReturnNode) # TODO: make sure everything has line info
if !(stmt isa ReturnNode && !isdefined(stmt, :val)) # not actually a return node, but an unreachable marker
if ir.lines[idx] <= 0
#@verify_error "Missing line number information for statement $idx of $ir"
end
end
end
if isa(stmt, Expr) && stmt.head === :(=)
if stmt.args[1] isa SSAValue
@verify_error "SSAValue as assignment LHS"
error()
end
end
for op in userefs(stmt)
op = op[]
check_op(ir, domtree, op, bb, idx)
end
end
end
end
function verify_linetable(linetable::Vector{LineInfoNode})
for i in 1:length(linetable)
line = linetable[i]
if i <= line.inlined_at
@verify_error "Misordered linetable"
end
end
end
|
