1 ; RUN: llvm-upgrade < %s | llvm-as | llc
4 target pointersize = 32
5 %struct.node_t = type { double*, %struct.node_t*, %struct.node_t**, double**, double*, int, int }
7 implementation ; Functions:
11 br bool false, label %then.2.i, label %endif.2.i
13 then.2.i: ; preds = %entry
14 br label %dealwithargs.exit
16 endif.2.i: ; preds = %entry
17 br bool false, label %then.3.i, label %dealwithargs.exit
19 then.3.i: ; preds = %endif.2.i
20 br label %dealwithargs.exit
22 dealwithargs.exit: ; preds = %then.3.i, %endif.2.i, %then.2.i
23 %n_nodes.4 = phi int [ 64, %then.3.i ], [ 64, %then.2.i ], [ 64, %endif.2.i ] ; <int> [#uses=1]
24 %tmp.14.i1134.i.i = setgt int %n_nodes.4, 1 ; <bool> [#uses=2]
25 br bool %tmp.14.i1134.i.i, label %no_exit.i12.i.i, label %fill_table.exit22.i.i
27 no_exit.i12.i.i: ; preds = %no_exit.i12.i.i, %dealwithargs.exit
28 br bool false, label %fill_table.exit22.i.i, label %no_exit.i12.i.i
30 fill_table.exit22.i.i: ; preds = %no_exit.i12.i.i, %dealwithargs.exit
31 %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]
32 br bool %tmp.14.i1134.i.i, label %no_exit.i.preheader.i.i, label %make_tables.exit.i
34 no_exit.i.preheader.i.i: ; preds = %fill_table.exit22.i.i
37 make_tables.exit.i: ; preds = %fill_table.exit22.i.i