File tree Expand file tree Collapse file tree 2 files changed +3
-3
lines changed Expand file tree Collapse file tree 2 files changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -527,7 +527,7 @@ mutable struct IncrementalCompact
527
527
cfg_transforms_enabled:: Bool
528
528
fold_constant_branches:: Bool
529
529
530
- function IncrementalCompact (code:: IRCode , allow_cfg_transforms:: Bool = false )
530
+ function IncrementalCompact (code:: IRCode , allow_cfg_transforms:: Bool = true )
531
531
# Sort by position with attach after nodes after regular ones
532
532
perm = my_sortperm (Int[let new_node = code. new_nodes. info[i]
533
533
(new_node. pos * 2 + Int (new_node. attach_after))
@@ -1416,7 +1416,7 @@ function complete(compact::IncrementalCompact)
1416
1416
return IRCode (compact. ir, compact. result, cfg, compact. new_new_nodes)
1417
1417
end
1418
1418
1419
- function compact! (code:: IRCode , allow_cfg_transforms:: Bool = false )
1419
+ function compact! (code:: IRCode , allow_cfg_transforms:: Bool = true )
1420
1420
compact = IncrementalCompact (code, allow_cfg_transforms)
1421
1421
# Just run through the iterator without any processing
1422
1422
for _ in compact; end # _ isa Pair{Int, Any}
Original file line number Diff line number Diff line change @@ -161,7 +161,7 @@ function f_ifelse(x)
161
161
return b ? x + 1 : x
162
162
end
163
163
# 2 for now because the compiler leaves a GotoNode around
164
- @test_broken length (code_typed (f_ifelse, (String,))[1 ][1 ]. code) <= 2
164
+ @test length (code_typed (f_ifelse, (String,))[1 ][1 ]. code) <= 2
165
165
166
166
# Test that inlining of _apply properly hits the inference cache
167
167
@noinline cprop_inline_foo1 () = (1 , 1 )
You can’t perform that action at this time.
0 commit comments