-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
+/* (C) 1998 - 2000 by Universitaet Karlsruhe
** All rights reserved.
**
** Authors: Christian Schaefer, Goetz Lindenmaier
*** main() {
*** int a = 0; // pos 0
*** int b = 1; // pos 1
+*** int h; // pos 2
***
*** if (0 == 0)
*** { a = 2; }
*** }
***
*** return a-b;
+*** }
**/
int
main(void)
{
ir_graph *irg;
- type_class *owner;
- type_method *proc_main;
+ type *owner;
+ type *proc_main;
entity *ent;
ir_node *b, *x, *r, *t, *f;
- printf("creating an IR graph: IF_WHILE_EXAMPLE...\n");
+ printf("\nCreating an IR graph: IF_WHILE_EXAMPLE...\n");
init_firm ();
+ turn_of_edge_labels();
-
- set_opt_constant_folding(0);
+ set_optimize(1);
+ set_opt_constant_folding(0); /* so that the stupid tests are not optimized. */
+ /* if optimized no path to End remains!! */
set_opt_cse(1);
set_opt_dead_node_elimination (1);
proc_main = new_type_method(id_from_str(METHODNAME, strlen(METHODNAME)),
NRARGS, NRES);
owner = new_type_class (id_from_str ("IF_WHILE_EXAMPLE", 16));
- ent = new_entity ((type *)owner, id_from_str ("main", 4), (type *)proc_main);
+ ent = new_entity (owner, id_from_str ("main", 4), proc_main);
/* Generates start and end blocks and nodes and a first, initial block */
irg = new_ir_graph (ent, 4);
/* Generate two constants */
- set_value (0, new_Const (mode_I, tarval_from_long (mode_i, 0)));
- set_value (1, new_Const (mode_I, tarval_from_long (mode_i, 1)));
- mature_block (irg->current_block);
+ set_value (0, new_Const (mode_I, tarval_from_long (mode_I, 0)));
+ set_value (1, new_Const (mode_I, tarval_from_long (mode_I, 1)));
+ mature_block (get_irg_current_block(irg));
/* Generate a conditional branch */
- x = new_Cond (new_Proj(new_Cmp(new_Const (mode_I, tarval_from_long (mode_i, 0)),
- new_Const (mode_I, tarval_from_long (mode_i, 0))),
- mode_b, Eq));
- f = new_Proj (x, mode_X, 0);
- t = new_Proj (x, mode_X, 1);
-
- /* generate and fill the then block */
- r = new_Block ();
- add_in_edge (r, t);
- set_value (0, new_Const (mode_I, tarval_from_long (mode_i, 2)));
- mature_block (r);
- x = new_Jmp ();
+ x = new_Jmp();
/* generate the fall through block and add all cfg edges */
- r = new_Block ();
- add_in_edge (r, f);
+ r = new_immBlock ();
add_in_edge (r, x);
mature_block (r);
x = new_Jmp ();
/* generate a block for the loop header and the conditional branch */
- r = new_Block ();
+ r = new_immBlock ();
add_in_edge (r, x);
x = new_Cond (new_Proj(new_Cmp(new_Const (mode_I, tarval_from_long (mode_i, 0)),
new_Const (mode_I, tarval_from_long (mode_i, 0))),
t = new_Proj (x, mode_X, 1);
/* generate the block for the loop body */
- b = new_Block ();
+ b = new_immBlock ();
add_in_edge (b,t);
x = new_Jmp ();
add_in_edge (r, x);
mature_block (b);
/* generate the return block */
- r = new_Block ();
+ r = new_immBlock ();
add_in_edge (r, f);
mature_block (r);
}
/* finalize the end block generated in new_ir_graph() */
- add_in_edge (irg->end_block, x);
- mature_block (irg->end_block);
+ add_in_edge (get_irg_end_block(irg), x);
+ mature_block (get_irg_end_block(irg));
- /* verify the graph */
- irg_vrfy(irg);
+ printf("Optimizing ...\n");
+ local_optimize_graph(irg);
dead_node_elimination(irg);
+ /* verify the graph */
+ irg_vrfy(irg);
+
/* output the vcg file */
- printf("\nDone building the graph. Dumping it.\n");
+ printf("Done building the graph. Dumping it.\n");
dump_ir_block_graph (irg);
-
- printf("use xvcg to view this graph:\n");
- printf("/ben/goetz/bin/xvcg GRAPHNAME\n");
+ printf("Use xvcg to view this graph:\n");
+ printf("/ben/goetz/bin/xvcg GRAPHNAME\n\n");
return (0);
}