+
+/* 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 *projX;
+
+ res = (ir_graph *) malloc (sizeof(*res));
+ memset(res, 0, sizeof(*res));
+
+ /* inform statistics here, as blocks will be already build on this graph */
+ stat_new_graph(res, NULL);
+
+ 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 */
+#if USE_EXPLICIT_PHI_IN_STACK
+ res->Phi_in_stack = NULL;
+#endif
+ res->kind = k_ir_graph;
+ res->obst = (struct obstack *) xmalloc (sizeof (struct obstack));
+ obstack_init (res->obst);
+ res->phase_state = phase_building;
+ res->pinned = pinned;
+ res->value_table = new_identities (); /* value table for global value
+ numbering for optimizing use in
+ iropt.c */
+ res->ent = NULL;
+ res->frame_type = NULL;
+ res->start_block = new_immBlock ();
+ res->end_block = new_immBlock ();
+ res->end = new_End ();
+ res->end_reg = res->end;
+ res->end_except = res->end;
+ mature_block(get_cur_block());
+ res->bad = new_ir_node (NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
+ /* res->unknown = new_ir_node (NULL, res, res->start_block, op_Unknown, mode_T, 0, NULL); */
+ res->start = new_Start ();
+
+ /* Proj results of start node */
+ projX = new_Proj (res->start, mode_X, pns_initial_exec);
+ add_in_edge(res->start_block, projX);
+ mature_block (res->current_block);
+ add_in_edge (new_immBlock (), projX);
+ mature_block(get_cur_block());
+ /* Set the visited flag high enough that the block will never be visited. */
+ set_irn_visited(get_cur_block(), -1);
+ set_Block_block_visited(get_cur_block(), -1);
+ set_Block_block_visited(res->start_block, -1);
+ set_irn_visited(res->start_block, -1);
+ set_irn_visited(res->bad, -1);
+ return res;
+}
+
+/* Defined in iropt.c */
+void del_identities (pset *value_table);
+
+/* Frees the passed irgraph.
+ Deallocates all nodes in this graph and the ir_graph structure.
+ Sets the field irgraph in the corresponding entity to NULL.
+ Does not remove the irgraph from the list in irprog (requires
+ 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) {
+ stat_free_graph(irg);
+ if (irg->outs_state != no_outs) free_outs(irg);
+ if (irg->frame_type) free_type(irg->frame_type);
+ if (irg->value_table) del_identities(irg->value_table);
+ if (irg->ent) {
+ 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(irg->end);
+ obstack_free(irg->obst,NULL);
+ free(irg->obst);
+#if USE_EXPLICIT_PHI_IN_STACK
+ free_Phi_in_stack(irg->Phi_in_stack);
+#endif
+ irg->kind = k_BAD;
+ free(irg);
+}
+