ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) {
ir_graph *res;
ir_node *first_block;
- ir_node *end, *start, *start_block, *initial_mem, *projX;
+ ir_node *end, *start, *start_block, *initial_mem, *projX, *bad;
res = alloc_graph();
res->last_node_idx = 0;
- res->value_table = new_identities (); /* value table for global value
- numbering for optimizing use in iropt.c */
+ res->value_table = new_identities(); /* value table for global value
+ numbering for optimizing use in iropt.c */
res->outs = NULL;
res->inline_property = irg_inline_any;
set_entity_irg(ent, res);
/*-- a class type so that it can contain "inner" methods as in Pascal. --*/
- res->frame_type = new_type_frame(id_mangle(get_entity_ident(ent), frame_type_suffix));
+ res->frame_type = new_type_frame();
/* the Anchor node must be created first */
res->anchor = new_Anchor(res);
start_block = new_immBlock();
set_cur_block(start_block);
set_irg_start_block(res, start_block);
- set_irg_bad (res, new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL));
+ bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
+ bad->attr.irg.irg = res;
+ set_irg_bad (res, bad);
set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
start = new_Start();
set_irg_start (res, start);
set_irg_frame (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base));
set_irg_tls (res, new_Proj(start, mode_P_data, pn_Start_P_tls));
set_irg_args (res, new_Proj(start, mode_T, pn_Start_T_args));
- set_irg_value_param_base(res, new_Proj(start, mode_P_data, pn_Start_P_value_arg_base));
initial_mem = new_Proj(start, mode_M, pn_Start_M);
set_irg_initial_mem(res, initial_mem);
- add_immBlock_pred(start_block, projX);
set_store(initial_mem);
res->index = get_irp_new_irg_idx();
res->graph_nr = get_irp_new_node_nr();
#endif
- /*
- * The code generation needs it. leave it in now.
- * Use of this edge is matter of discussion, unresolved. Also possible:
- * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
- */
mature_immBlock(res->current_block);
/*-- Make a block to start with --*/
/* Make a rudimentary IR graph for the constant code.
Must look like a correct irg, spare everything else. */
-ir_graph *new_const_code_irg(void) {
- ir_graph *res;
- ir_node *end, *start_block, *start, *projX;
+ir_graph *new_const_code_irg(void)
+{
+ ir_graph *res = alloc_graph();
+ ir_node *bad;
ir_node *body_block;
-
- res = alloc_graph();
+ ir_node *end;
+ ir_node *end_block;
+ ir_node *no_mem;
+ ir_node *projX;
+ ir_node *start_block;
+ ir_node *start;
/* inform statistics here, as blocks will be already build on this graph */
hook_new_graph(res, NULL);
- current_ir_graph = res;
- res->n_loc = 1; /* Only the memory. */
- res->visited = 0; /* visited flag, for the ir walker */
+ current_ir_graph = res;
+ res->n_loc = 1; /* Only the memory. */
+ res->visited = 0; /* visited flag, for the ir walker */
res->block_visited = 0; /* visited flag, for the 'block'-walker */
- res->obst = XMALLOC(struct obstack);
- obstack_init (res->obst);
+ res->obst = XMALLOC(struct obstack);
+ obstack_init(res->obst);
res->extbb_obst = NULL;
res->last_node_idx = 0;
res->extblk_state = ir_extblk_info_none;
res->fp_model = fp_model_precise;
- res->value_table = new_identities(); /* value table for global value
- numbering for optimizing use in
- iropt.c */
- res->ent = NULL;
+ /* value table for global value numbering for optimizing use in iropt.c */
+ res->value_table = new_identities();
+ res->ent = NULL;
res->frame_type = NULL;
/* the Anchor node must be created first */
res->anchor = new_Anchor(res);
/* -- The end block -- */
- set_irg_end_block (res, new_immBlock());
- set_cur_block(get_irg_end_block(res));
+ end_block = new_immBlock();
+ set_irg_end_block(res, end_block);
+ set_cur_block(end_block);
end = new_End();
set_irg_end (res, end);
set_irg_end_reg (res, end);
set_irg_end_except(res, end);
- mature_immBlock(get_cur_block()); /* mature the end block */
+ mature_immBlock(end_block);
/* -- The start block -- */
start_block = new_immBlock();
set_cur_block(start_block);
set_irg_start_block(res, start_block);
- set_irg_bad (res, new_ir_node (NULL, res, start_block, op_Bad, mode_T, 0, NULL));
- set_irg_no_mem (res, new_ir_node (NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
- start = new_Start();
- set_irg_start (res, start);
+ bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
+ bad->attr.irg.irg = res;
+ set_irg_bad(res, bad);
+ no_mem = new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL);
+ set_irg_no_mem(res, no_mem);
+ start = new_Start();
+ set_irg_start(res, start);
/* Proj results of start node */
set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M));
projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
- add_immBlock_pred(start_block, projX);
- mature_immBlock (start_block); /* mature the start block */
-
+ mature_immBlock(start_block);
body_block = new_immBlock();
add_immBlock_pred(body_block, projX);
- mature_immBlock (body_block); /* mature the 'body' block for expressions */
+ mature_immBlock(body_block); /* mature the 'body' block for expressions */
set_cur_block(body_block);
/* Set the visited flag high enough that the blocks will never be visited. */
- set_irn_visited(get_cur_block(), -1);
- set_Block_block_visited(get_cur_block(), -1);
+ set_irn_visited(body_block, -1);
+ set_Block_block_visited(body_block, -1);
set_Block_block_visited(start_block, -1);
set_irn_visited(start_block, -1);
- set_irn_visited(get_irg_bad(res), -1);
- set_irn_visited(get_irg_no_mem(res), -1);
+ set_irn_visited(bad, -1);
+ set_irn_visited(no_mem, -1);
res->phase_state = phase_high;
new_backedge_info(nn);
set_irn_link(n, nn);
- /* fix the irg for blocks */
+ /* fix the irg for Blocks: as Bad nodes are NOT copied, no
+ need t fix them */
if (is_Block(nn))
- nn->attr.block.irg = irg;
+ nn->attr.block.irg.irg = irg;
/* fix access to entities on the stack frame */
if (is_Sel(nn)) {
inefficient search, call remove_irp_irg by hand).
Does not free types, entities or modes that are used only by this
graph, nor the entity standing for this graph. */
-void free_ir_graph(ir_graph *irg) {
+void free_ir_graph(ir_graph *irg)
+{
assert(is_ir_graph(irg));
edges_deactivate(irg);
if (irg->value_table)
del_identities(irg->value_table);
if (irg->ent) {
- ir_peculiarity pec = get_entity_peculiarity (irg->ent);
- set_entity_peculiarity (irg->ent, peculiarity_description);
set_entity_irg(irg->ent, NULL); /* not set in const code irg */
- set_entity_peculiarity (irg->ent, pec);
}
free_End(get_irg_end(irg));
return irg->index;
}
+ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx) {
+ return _get_idx_irn(irg, idx);
+}
+
ir_node *
(get_irg_start_block)(const ir_graph *irg) {
return _get_irg_start_block(irg);
_set_irg_args(irg, node);
}
-ir_node *
-(get_irg_value_param_base)(const ir_graph *irg) {
- return _get_irg_value_param_base(irg);
-}
-
-void
-(set_irg_value_param_base)(ir_graph *irg, ir_node *node) {
- _set_irg_value_param_base(irg, node);
-}
-
ir_node *
(get_irg_bad)(const ir_graph *irg) {
return _get_irg_bad(irg);
_set_irg_frame_type(irg, ftp);
}
+/* Returns the value parameter type of an IR graph. */
+ir_type *get_irg_value_param_type(ir_graph *irg) {
+ ir_entity *ent = get_irg_entity(irg);
+ ir_type *mtp = get_entity_type(ent);
+ return get_method_value_param_type(mtp);
+}
+
int
get_irg_n_locs(ir_graph *irg) {
if (get_opt_precise_exc_context())
return _get_irg_visited(irg);
}
-#ifdef INTERPROCEDURAL_VIEW
/** maximum visited flag content of all ir_graph visited fields. */
static ir_visited_t max_irg_visited = 0;
-#endif /* INTERPROCEDURAL_VIEW */
-void
-set_irg_visited(ir_graph *irg, ir_visited_t visited) {
+void set_irg_visited(ir_graph *irg, ir_visited_t visited)
+{
irg->visited = visited;
-#ifdef INTERPROCEDURAL_VIEW
if (irg->visited > max_irg_visited) {
max_irg_visited = irg->visited;
}
-#endif /* INTERPROCEDURAL_VIEW */
}
-void
-inc_irg_visited(ir_graph *irg) {
-#ifdef INTERPROCEDURAL_VIEW
- if (++irg->visited > max_irg_visited) {
+void inc_irg_visited(ir_graph *irg)
+{
+ ++irg->visited;
+ if (irg->visited > max_irg_visited) {
max_irg_visited = irg->visited;
}
-#else
- ++irg->visited;
-#endif /* INTERPROCEDURAL_VIEW */
}
-#ifdef INTERPROCEDURAL_VIEW
-ir_visited_t
-get_max_irg_visited(void) {
-#ifndef NDEBUG
- int i;
- for(i = 0; i < get_irp_n_irgs(); i++)
- assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
-#endif
+ir_visited_t get_max_irg_visited(void)
+{
return max_irg_visited;
}
-void set_max_irg_visited(int val) {
+void set_max_irg_visited(int val)
+{
max_irg_visited = val;
}
-ir_visited_t
-inc_max_irg_visited(void) {
+ir_visited_t inc_max_irg_visited(void)
+{
#ifndef NDEBUG
int i;
for(i = 0; i < get_irp_n_irgs(); i++)
#endif
return ++max_irg_visited;
}
-#endif /* INTERPROCEDURAL_VIEW */
ir_visited_t
(get_irg_block_visited)(const ir_graph *irg) {
return additional_graph_data_size += size;
}
+
+void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
+{
+ _set_irg_state(irg, state);
+}
+
+void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
+{
+ _clear_irg_state(irg, state);
+}
+
+int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
+{
+ return _is_irg_state(irg, state);
+}
projects / libfirm / blobdiff