@@ -130,7 +130,7 @@ function simple_walk(compact::IncrementalCompact, @nospecialize(defssa#=::AnySSA
130
130
return defssa
131
131
end
132
132
if isa (def. val, SSAValue)
133
- if isa (defssa, OldSSAValue) && ! already_inserted (compact, defssa)
133
+ if is_old (compact, defssa)
134
134
defssa = OldSSAValue (def. val. id)
135
135
else
136
136
defssa = def. val
@@ -281,7 +281,7 @@ function lift_leaves(compact::IncrementalCompact, @nospecialize(stmt),
281
281
end
282
282
if is_tuple_call (compact, def) && isa (field, Int) && 1 <= field < length (def. args)
283
283
lifted = def. args[1 + field]
284
- if isa (leaf, OldSSAValue ) && isa (lifted, SSAValue)
284
+ if is_old (compact, leaf ) && isa (lifted, SSAValue)
285
285
lifted = OldSSAValue (lifted. id)
286
286
end
287
287
if isa (lifted, GlobalRef) || isa (lifted, Expr)
@@ -320,7 +320,7 @@ function lift_leaves(compact::IncrementalCompact, @nospecialize(stmt),
320
320
compact[leaf] = def
321
321
end
322
322
lifted = def. args[1 + field]
323
- if isa (leaf, OldSSAValue ) && isa (lifted, SSAValue)
323
+ if is_old (compact, leaf ) && isa (lifted, SSAValue)
324
324
lifted = OldSSAValue (lifted. id)
325
325
end
326
326
if isa (lifted, GlobalRef) || isa (lifted, Expr)
@@ -339,7 +339,7 @@ function lift_leaves(compact::IncrementalCompact, @nospecialize(stmt),
339
339
# N.B.: This can be a bit dangerous because it can lead to
340
340
# infinite loops if we accidentally insert a node just ahead
341
341
# of where we are
342
- if isa (leaf, OldSSAValue ) && (isa (field, Int) || isa (field, Symbol))
342
+ if is_old (compact, leaf ) && (isa (field, Int) || isa (field, Symbol))
343
343
(isa (typ, DataType) && (! typ. abstract)) || return nothing
344
344
@assert ! typ. mutable
345
345
# If there's the potential for an undefref error on access, we cannot insert a getfield
0 commit comments