@@ -1416,10 +1416,7 @@ and compile_block_no_loop st queue (pc : Addr.t) ~fall_through scope_stack =
1416
1416
if pc < 0 then assert false ;
1417
1417
if Addr.Set. mem pc ! (st.visited_blocks)
1418
1418
then (
1419
- Format. eprintf
1420
- " Trying to compile a block twice !!!! %d %b@."
1421
- pc
1422
- (Structure. is_merge_node st.structure pc);
1419
+ Format. eprintf " Trying to compile a block twice !!!! %d@." pc;
1423
1420
assert false );
1424
1421
if debug () then Format. eprintf " Compiling block %d@;" pc;
1425
1422
st.visited_blocks := Addr.Set. add pc ! (st.visited_blocks);
@@ -1688,15 +1685,15 @@ and compile_branch st queue ((pc, _) as cont) scope_stack ~src ~fall_through : b
1688
1685
match List. assoc_opt pc scope_stack with
1689
1686
| Some (l , used , Backward) ->
1690
1687
assert (src > = 0 && Structure. is_backward st.structure src pc);
1691
- let rec needed scope_stack =
1692
- match scope_stack with
1693
- | [] -> assert false
1694
- | (_pc , (_ , _ , Forward)) :: rem -> needed rem
1695
- | (pc' , (_ , _ , Backward)) :: _rem -> pc <> pc'
1696
- in
1697
1688
if fall_through = pc
1698
1689
then false , flush_all queue []
1699
1690
else
1691
+ let rec needed scope_stack =
1692
+ match scope_stack with
1693
+ | [] -> assert false
1694
+ | (_pc , (_ , _ , Forward)) :: rem -> needed rem
1695
+ | (pc' , (_ , _ , Backward)) :: _rem -> pc <> pc'
1696
+ in
1700
1697
let label =
1701
1698
if needed scope_stack
1702
1699
then (
0 commit comments