1 ; RUN: llvm-upgrade < %s | llvm-as | llc
3 %struct.node_t = type { double*, %struct.node_t*, %struct.node_t**, double**, double*, int, int }
5 implementation ; Functions:
9 br bool false, label %then.2.i, label %endif.2.i
11 then.2.i: ; preds = %entry
12 br label %dealwithargs.exit
14 endif.2.i: ; preds = %entry
15 br bool false, label %then.3.i, label %dealwithargs.exit
17 then.3.i: ; preds = %endif.2.i
18 br label %dealwithargs.exit
20 dealwithargs.exit: ; preds = %then.3.i, %endif.2.i, %then.2.i
21 %n_nodes.4 = phi int [ 64, %then.3.i ], [ 64, %then.2.i ], [ 64, %endif.2.i ] ; <int> [#uses=1]
22 %tmp.14.i1134.i.i = setgt int %n_nodes.4, 1 ; <bool> [#uses=2]
23 br bool %tmp.14.i1134.i.i, label %no_exit.i12.i.i, label %fill_table.exit22.i.i
25 no_exit.i12.i.i: ; preds = %no_exit.i12.i.i, %dealwithargs.exit
26 br bool false, label %fill_table.exit22.i.i, label %no_exit.i12.i.i
28 fill_table.exit22.i.i: ; preds = %no_exit.i12.i.i, %dealwithargs.exit
29 %cur_node.0.i8.1.i.i = phi %struct.node_t* [ undef, %dealwithargs.exit ], [ null, %no_exit.i12.i.i ] ; <%struct.node_t*> [#uses=0]
30 br bool %tmp.14.i1134.i.i, label %no_exit.i.preheader.i.i, label %make_tables.exit.i
32 no_exit.i.preheader.i.i: ; preds = %fill_table.exit22.i.i
35 make_tables.exit.i: ; preds = %fill_table.exit22.i.i