and optimization.
*/
ir_graph *
-new_ir_graph (entity *ent, int params)
+new_ir_graph (entity *ent, int n_loc)
{
ir_graph *res;
ir_node *first_block;
/** Internal information for graph construction either held in the graph or
*** initialized for each graph. **/
- res->params = params + 1; /* number of local variables that are never
+ res->n_loc = n_loc + 1; /* number of local variables that are never
dereferenced in this graph plus one for
the store. This is not the number of parameters
to the procedure! */
set_entity_irg(ent, res);
/** Nodes needed in every graph **/
- res->end_block = new_Block ();
+ res->end_block = new_immBlock ();
res->end = new_End ();
- res->start_block = new_Block ();
+ res->start_block = new_immBlock ();
res->start = new_Start ();
res->bad = new_ir_node (res, res->start_block, op_Bad, mode_T, 0, NULL);
mature_block (res->current_block);
/** Make a block to start with **/
- first_block = new_Block ();
+ first_block = new_immBlock ();
add_in_edge (first_block, projX);
return res;
}
int
-get_irg_params (ir_graph *irg)
+get_irg_n_loc (ir_graph *irg)
{
- return irg->params;
+ return irg->n_loc;
}
void
-set_irg_params (ir_graph *irg, int params)
+set_irg_n_loc (ir_graph *irg, int n_loc)
{
- irg->params = params;
+ irg->n_loc = n_loc;
}
unsigned long