X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=testprograms%2Fdead_loop_example.c;h=39dae956d8f7fa29aa9a7cdbe00f005756caf22b;hb=1479bfdba32d70f164f61f1bdc8e31190df1269f;hp=60445712d16b5a95214a176e15b017955f8b374d;hpb=d29e3540e6c573ebe11a411aa09c28f3f15fe184;p=libfirm diff --git a/testprograms/dead_loop_example.c b/testprograms/dead_loop_example.c index 60445712d..39dae956d 100644 --- a/testprograms/dead_loop_example.c +++ b/testprograms/dead_loop_example.c @@ -10,12 +10,10 @@ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. */ -# include -# include +#include +#include -# include "irvrfy.h" -# include "irdump.h" -# include "firm.h" +#include /** * This file constructs a control flow with an unreachable @@ -38,28 +36,27 @@ * **/ -int main(int argc, char **argv) +int main(void) { ir_graph *irg; /* this variable contains the irgraph */ - type *prim_t_int; - type *owner; /* the class in which this method is defined */ - type *proc_main; /* typeinformation for the method main */ - entity *ent; /* represents this method as entity of owner */ + ir_type *prim_t_int; + ir_type *owner; /* the class in which this method is defined */ + ir_type *proc_main; /* typeinformation for the method main */ + ir_entity *ent; /* represents this method as ir_entity of owner */ ir_node *returnBlock, *loopBlock1, *loopBlock2, *x, *c1, *c2, *t, *f; /* init library */ - init_firm (NULL); - //set_opt_normalize(0); - set_opt_constant_folding (0); /* so that the stupid tests are not optimized. */ + init_firm(NULL); + /*set_opt_normalize(0); */ + set_opt_constant_folding(0); /* so that the stupid tests are not optimized. */ set_opt_cse(1); - set_opt_dead_node_elimination(1); /* FIRM was designed for oo languages where all methods belong to a class. * For imperative languages like C we view a file as a large class containing * all functions as methods in this file. * Therefore we define a class "empty" according to the file name - * with a method main as an entity. + * with a method main as an ir_entity. */ #define CLASSNAME "DEAD_LOOP" #define METHODNAME "main" @@ -67,33 +64,33 @@ int main(int argc, char **argv) #define NRES 0 printf("\nCreating an IR graph: %s...\n", CLASSNAME); - prim_t_int = new_type_primitive(id_from_str ("int", 3), mode_Is); + prim_t_int = new_type_primitive(new_id_from_str("int"), mode_Is); - owner = new_type_class (new_id_from_str (CLASSNAME)); + owner = new_type_class(new_id_from_str(CLASSNAME)); proc_main = new_type_method(new_id_from_str(METHODNAME), NRARGS, NRES); set_method_param_type(proc_main, 0, prim_t_int); - ent = new_entity (owner, new_id_from_str (METHODNAME), proc_main); + ent = new_entity(owner, new_id_from_str(METHODNAME), proc_main); get_entity_ld_name(ent); /* To enforce name mangling for vcg graph name */ #define NUM_OF_LOCAL_VARS 0 - irg = new_ir_graph (ent, NUM_OF_LOCAL_VARS); + irg = new_ir_graph(ent, NUM_OF_LOCAL_VARS); returnBlock = get_irg_current_block(irg); /* Make some real stupid stuff: a data loop (without Phi). */ { ir_node *a, *b, *c, *in[2]; - add_in_edge(get_cur_block(), new_Bad()); - a = new_Const (mode_Is, new_tarval_from_long (1, mode_Is)); - b = new_Const (mode_Is, new_tarval_from_long (2, mode_Is)); + add_immBlock_pred(get_cur_block(), new_Bad()); + a = new_Const(mode_Is, new_tarval_from_long(1, mode_Is)); + b = new_Const(mode_Is, new_tarval_from_long(2, mode_Is)); c = new_Add(a, b, mode_Is); b = new_Sub(c, b, mode_Is); in[0] = b; in[1] = new_Bad(); a = new_Phi(2, in, mode_Is); set_Add_left(c, a); - add_End_keepalive(get_irg_end(irg), a); + /* add_End_keepalive(get_irg_end(irg), a); */ set_nodes_block(c, new_Bad()); set_nodes_block(a, new_Bad()); } @@ -102,44 +99,46 @@ int main(int argc, char **argv) loopBlock1 = new_immBlock(); loopBlock2 = new_immBlock(); x = new_Jmp(); - add_in_edge(loopBlock1, x); - mature_block(loopBlock1); + add_immBlock_pred(loopBlock1, x); + mature_immBlock(loopBlock1); - switch_block(loopBlock1); - c1 = new_Const (mode_Is, new_tarval_from_long (1, mode_Is)); + set_cur_block(loopBlock1); + c1 = new_Const(mode_Is, new_tarval_from_long(1, mode_Is)); c2 = new_Proj(get_irg_args(irg), mode_Is, 0); - x = new_Cond(new_Proj(new_Cmp(c1, c2), mode_b, Eq)); - f = new_Proj(x, mode_X, 0); - t = new_Proj(x, mode_X, 1); - add_in_edge(loopBlock2, t); - add_in_edge(returnBlock, f); - mature_block(loopBlock2); + x = new_Cond(new_Proj(new_Cmp(c1, c2), mode_b, pn_Cmp_Eq)); + f = new_Proj(x, mode_X, pn_Cond_false); + t = new_Proj(x, mode_X, pn_Cond_true); + add_immBlock_pred(loopBlock2, t); + add_immBlock_pred(returnBlock, f); + mature_immBlock(loopBlock2); /* Make the unreachable, endless loop */ loopBlock1 = new_immBlock(); loopBlock2 = new_immBlock(); x = new_Jmp(); - add_in_edge(loopBlock1, x); - mature_block(loopBlock1); + add_immBlock_pred(loopBlock1, x); + mature_immBlock(loopBlock1); - switch_block(loopBlock1); + set_cur_block(loopBlock1); x = new_Jmp(); - add_in_edge(loopBlock2, x); - add_End_keepalive(get_irg_end(irg), x); - mature_block(loopBlock2); + add_immBlock_pred(loopBlock2, x); + add_End_keepalive(get_irg_end(irg), loopBlock1); + mature_immBlock(loopBlock2); /* Make the return block */ - switch_block(returnBlock); - x = new_Return (get_store(), 0, NULL); - mature_block (get_irg_current_block(irg)); + set_cur_block(returnBlock); + x = new_Return(get_store(), 0, NULL); + mature_immBlock(get_irg_current_block(irg)); - add_in_edge (get_irg_end_block(irg), x); - mature_block (get_irg_end_block(irg)); + add_immBlock_pred(get_irg_end_block(irg), x); + mature_immBlock(get_irg_end_block(irg)); - finalize_cons (irg); + irg_finalize_cons(irg); - //printf("Optimizing ...\n"); - //dead_node_elimination(irg); +#if 0 + printf("Optimizing ...\n"); + dead_node_elimination(irg); +#endif /* verify the graph */ irg_vrfy(irg); @@ -148,41 +147,39 @@ int main(int argc, char **argv) turn_off_edge_labels(); dump_keepalive_edges(1); dump_consts_local(0); - dump_ir_graph (irg); - dump_ir_block_graph (irg); - dump_cfg (irg); + dump_ir_graph(irg, "-cfg"); + dump_ir_block_graph(irg, "-cfg"); + dump_cfg(irg, "-cfg"); printf("Running analyses.\n"); - compute_outs(irg); + compute_irg_outs(irg); compute_doms(irg); construct_backedges(irg); printf("Dumping the graph with analyses information.\n"); - dump_file_suffix = "-ana"; - dump_out_edges(); - dump_dominator_information(); - dump_loop_information(); + dump_out_edges(0); + dump_dominator_information(0); + dump_loop_information(0); dump_backedge_information(1); - dump_ir_graph (irg); - dump_ir_block_graph (irg); - dump_cfg (irg); - dump_loop_tree(irg, dump_file_suffix); + dump_ir_graph(irg, "-ana"); + dump_ir_block_graph(irg, "-anablocks"); + dump_cfg(irg, "-ana"); + dump_loop_tree(irg, "-ana"); printf("Optimizing.\n"); optimize_cf(current_ir_graph); local_optimize_graph(current_ir_graph); printf("Dumping the optimized graph.\n"); - dump_file_suffix = "-opt"; - dump_ir_graph (irg); - dump_ir_block_graph (irg); - dump_cfg (irg); - dump_loop_tree(irg, dump_file_suffix); + dump_ir_graph(irg, "-opt"); + dump_ir_block_graph(irg, "-opt"); + dump_cfg(irg, "-opt"); + dump_loop_tree(irg, "-opt"); - printf("Use xvcg to view these graphs:\n"); - printf("/ben/goetz/bin/xvcg GRAPHNAME\n\n"); + printf("Use ycomp to view these graphs:\n"); + printf("ycomp GRAPHNAME\n\n"); - return (0); + return 0; }