-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer
-**
-**
-*/
+/*
+ * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief Entry point to the representation of procedure code.
+ * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
+ */
+#include "config.h"
+
+#include <string.h>
+#include <stddef.h>
+
+#include "xmalloc.h"
+#include "ircons_t.h"
+#include "irgraph_t.h"
+#include "irprog_t.h"
+#include "irgraph_t.h"
+#include "irnode_t.h"
+#include "iropt_t.h"
+#include "irflag_t.h"
+#include "array.h"
+#include "irgmod.h"
+#include "irouts.h"
+#include "irhooks.h"
+#include "irtools.h"
+#include "util.h"
+#include "irgwalk.h"
+#include "irbackedge_t.h"
+#include "iredges_t.h"
+#include "type_t.h"
+#include "irmemory.h"
+
+#define INITIAL_IDX_IRN_MAP_SIZE 1024
+
+/**
+ * Indicates, whether additional data can be registered to graphs.
+ * If set to 1, this is not possible anymore.
+ */
+static int forbid_new_data = 0;
+
+/**
+ * The amount of additional space for custom data to be allocated upon
+ * creating a new graph.
+ */
+static size_t additional_graph_data_size = 0;
-/* $Id$ */
+ir_graph *current_ir_graph;
+ir_graph *get_current_ir_graph(void)
+{
+ return current_ir_graph;
+}
-#ifdef HAVE_CONFIG_H
-# include <config.h>
-#endif
+void set_current_ir_graph(ir_graph *graph)
+{
+ current_ir_graph = graph;
+}
-# include <string.h>
+/** contains the suffix for frame type names */
+static ident *frame_type_suffix = NULL;
-# include "ircons.h"
-# include "irgraph_t.h"
-# include "irprog_t.h"
-# include "iropt_t.h"
-# include "array.h"
-# include "irgmod.h"
-# include "mangle.h"
+/* initialize the IR graph module */
+void firm_init_irgraph(void)
+{
+ frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
+ forbid_new_data = 1;
+}
-ir_graph *current_ir_graph;
+/**
+ * Allocate a new IR graph.
+ * This function respects the registered graph data. The only reason for
+ * this function is, that there are two locations, where graphs are
+ * allocated (new_r_ir_graph, new_const_code_irg).
+ * @return Memory for a new graph.
+ */
+static ir_graph *alloc_graph(void)
+{
+ ir_graph *res;
+ size_t size = sizeof(ir_graph) + additional_graph_data_size;
+ char *ptr = XMALLOCNZ(char, size);
-bool interprocedural_view = false;
+ res = (ir_graph *)(ptr + additional_graph_data_size);
+ res->kind = k_ir_graph;
-#if USE_EXPLICIT_PHI_IN_STACK
-/* really defined in ircons.c */
-typedef struct Phi_in_stack Phi_in_stack;
-Phi_in_stack *new_Phi_in_stack();
-void free_Phi_in_stack(Phi_in_stack *s);
-#endif
+ /* initialize the idx->node map. */
+ res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE);
+ memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0]));
+
+ return res;
+}
+
+/**
+ * Frees an allocated IR graph
+ */
+static void free_graph(ir_graph *irg)
+{
+ char *ptr = (char *)irg;
+ ir_edge_kind_t i;
+
+ for (i = EDGE_KIND_FIRST; i < EDGE_KIND_LAST; ++i)
+ edges_deactivate_kind(irg, i);
+ DEL_ARR_F(irg->idx_irn_map);
+ free(ptr - additional_graph_data_size);
+}
+
+/**
+ * Set the number of locals for a given graph.
+ *
+ * @param irg the graph
+ * @param n_loc number of locals
+ */
+void irg_set_nloc(ir_graph *res, int n_loc)
+{
+ assert(res->phase_state == phase_building);
+
+ 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! */
+
+ if (res->loc_descriptions) {
+ xfree(res->loc_descriptions);
+ res->loc_descriptions = NULL;
+ }
+}
/* Allocates a list of nodes:
- - The start block containing a start node and Proj nodes for it's four
+ - The start block containing a start node and Proj nodes for its four
results (X, M, P, Tuple).
- The end block containing an end node. This block is not matured after
new_ir_graph as predecessors need to be added to it.
Further it allocates several datastructures needed for graph construction
and optimization.
*/
-ir_graph *
-new_ir_graph (entity *ent, int n_loc)
-{
- int i;
- ir_graph *res;
- ir_node *first_block;
- ir_node *projX;
-
- res = (ir_graph *) malloc (sizeof (ir_graph));
- current_ir_graph = res;
- add_irp_irg(res); /* remember this graph global. */
-
- /** Internal information for graph construction either held in the graph or
- *** initialized for each graph. **/
-#if PRECISE_EXC_CONTEXT
- res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
- dereferenced in this graph plus one for
- the store plus one for links to fragile
- operations. n_loc is not the number of
- parameters to the procedure! */
-#else
- 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! */
-#endif
+ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc)
+{
+ ir_graph *res;
+ ir_node *first_block;
+ ir_node *start, *start_block, *initial_mem, *projX;
+
+ res = alloc_graph();
+
+ /* inform statistics here, as blocks will be already build on this graph */
+ hook_new_graph(res, ent);
+
+ /*-- initialized for each graph. --*/
+ res->kind = k_ir_graph;
+ res->obst = XMALLOC(struct obstack);
+ obstack_init(res->obst);
+
+ res->phase_state = phase_building;
+ irg_set_nloc(res, n_loc);
+
+ /* descriptions will be allocated on demand */
+ res->loc_descriptions = NULL;
+
+ res->visited = 0; /* visited flag, for the ir walker */
+ res->block_visited = 0; /* visited flag, for the 'block'-walker */
+
+ res->extbb_obst = NULL;
+
+ res->last_node_idx = 0;
- res->visited = 0; /* visited flag, for the ir walker */
- res->block_visited=0; /* visited flag, for the 'block'-walker */
+ new_identities(res);
+ res->outs = NULL;
-#if USE_EXPLICIT_PHI_IN_STACK
- res->Phi_in_stack = new_Phi_in_stack(); /* A stack needed for automatic Phi
- generation */
+ res->inline_property = irg_inline_any;
+ res->additional_properties = mtp_property_inherited; /* inherited from type */
+
+ res->irg_pinned_state = op_pin_state_pinned;
+ res->typeinfo_state = ir_typeinfo_none;
+ set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
+ res->callee_info_state = irg_callee_info_none;
+ res->class_cast_state = ir_class_casts_transitive;
+ res->fp_model = fp_model_precise;
+ res->mem_disambig_opt = aa_opt_inherited;
+
+ /*-- Type information for the procedure of the graph --*/
+ res->ent = ent;
+ set_entity_irg(ent, res);
+
+ /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
+ res->frame_type = new_type_frame();
+
+ /* the Anchor node must be created first */
+ res->anchor = new_r_Anchor(res);
+
+ /*-- Nodes needed in every graph --*/
+ set_irg_end_block (res, new_r_immBlock(res));
+ set_irg_end(res, new_r_End(res, 0, NULL));
+
+ start_block = new_r_Block_noopt(res, 0, NULL);
+ set_irg_start_block(res, start_block);
+ set_irg_no_mem (res, new_r_NoMem(res));
+ start = new_r_Start(res);
+ set_irg_start (res, start);
+
+ /* Proj results of start node */
+ projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
+ set_irg_initial_exec (res, projX);
+ set_irg_frame (res, new_r_Proj(start, mode_P_data, pn_Start_P_frame_base));
+ set_irg_args (res, new_r_Proj(start, mode_T, pn_Start_T_args));
+ initial_mem = new_r_Proj(start, mode_M, pn_Start_M);
+ set_irg_initial_mem(res, initial_mem);
+
+ res->index = get_irp_new_irg_idx();
+#ifdef DEBUG_libfirm
+ res->graph_nr = get_irp_new_node_nr();
#endif
- res->obst = (struct obstack *) xmalloc (sizeof (struct obstack));
- obstack_init (res->obst);
- res->value_table = new_identities (); /* value table for global value
- numbering for optimizing use in
- iropt.c */
- res->outs = NULL;
-
- res->phase_state = phase_building;
- res->pinned = pinned;
- res->outs_state = no_outs;
- res->dom_state = no_dom;
-
- /** Type information for the procedure of the graph **/
- res->ent = ent;
- set_entity_irg(ent, res);
-
- /** A type that represents the stack frame. A class type so that it can
- contain "inner" methods as in Pascal. **/
- res->frame_type = new_type_class(mangle(get_entity_ident(ent),
- id_from_str(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX))));
- /* Remove type from type list. Must be treated differently than other types. */
- remove_irp_type_from_list(res->frame_type);
-
- /** Nodes needed in every graph **/
- res->end_block = new_immBlock ();
- res->end = new_End ();
-
- res->start_block = new_immBlock ();
- res->start = new_Start ();
- 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);
-
- /* Proj results of start node */
- projX = new_Proj (res->start, mode_X, pns_initial_exec);
- set_store (new_Proj (res->start, mode_M, pns_global_store));
- res->frame = new_Proj (res->start, mode_p, pns_frame_base);
- res->globals = new_Proj (res->start, mode_p, pns_globals);
- res->args = new_Proj (res->start, mode_T, pns_args);
-
- add_in_edge(res->start_block, projX);
- /*
- * The code generation needs it. leave it in now.
- * Use of this edge is matter of discussion, unresolved. Also possible:
- * add_in_edge(res->start_block, res->start_block), but invalid typed.
- */
- mature_block (res->current_block);
-
- /** Make a block to start with **/
- first_block = new_immBlock ();
- add_in_edge (first_block, projX);
-
- return res;
-}
-
-
-/* Make a rudimentary ir graph for the constant code.
+
+ set_r_cur_block(res, start_block);
+ set_r_store(res, initial_mem);
+
+ /*-- Make a block to start with --*/
+ first_block = new_r_immBlock(res);
+ set_r_cur_block(res, first_block);
+ add_immBlock_pred(first_block, projX);
+
+ res->method_execution_frequency = -1.0;
+ res->estimated_node_count = 0;
+
+ return res;
+}
+
+ir_graph *new_ir_graph(ir_entity *ent, int n_loc)
+{
+ ir_graph *res = new_r_ir_graph(ent, n_loc);
+ add_irp_irg(res); /* remember this graph global. */
+ return res;
+}
+
+/* Make a rudimentary IR graph for the constant code.
Must look like a correct irg, spare everything else. */
-ir_graph *new_const_code_irg() {
- ir_graph *res;
- ir_node *projX;
-
- res = (ir_graph *) malloc (sizeof (ir_graph));
- 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->obst = (struct obstack *) xmalloc (sizeof (struct obstack));
- obstack_init (res->obst);
- 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 ();
- 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);
- set_store (new_Proj (res->start, mode_M, pns_global_store));
- 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);
- return res;
+ir_graph *new_const_code_irg(void)
+{
+ ir_graph *res = alloc_graph();
+ ir_node *body_block;
+ 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);
+
+ 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->extbb_obst = NULL;
+
+ res->last_node_idx = 0;
+
+ res->phase_state = phase_building;
+ res->irg_pinned_state = op_pin_state_pinned;
+ res->fp_model = fp_model_precise;
+
+ /* value table for global value numbering for optimizing use in iropt.c */
+ new_identities(res);
+ res->ent = NULL;
+ res->frame_type = NULL;
+
+ /* the Anchor node must be created first */
+ res->anchor = new_r_Anchor(res);
+
+ /* -- The end block -- */
+ end_block = new_r_Block_noopt(res, 0, NULL);
+ set_irg_end_block(res, end_block);
+ end = new_r_End(res, 0, NULL);
+ set_irg_end(res, end);
+
+ /* -- The start block -- */
+ start_block = new_r_Block_noopt(res, 0, NULL);
+ set_irg_start_block(res, start_block);
+ no_mem = new_r_NoMem(res);
+ set_irg_no_mem(res, no_mem);
+ start = new_r_Start(res);
+ set_irg_start(res, start);
+
+ /* Proj results of start node */
+ set_irg_initial_mem(res, new_r_Proj(start, mode_M, pn_Start_M));
+ projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
+
+ body_block = new_r_Block(res, 1, &projX);
+
+ set_r_cur_block(res, body_block);
+
+ /* Set the visited flag high enough that the blocks will never be visited. */
+ 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(no_mem, -1);
+
+ return res;
+}
+
+/**
+ * Pre-Walker: Copies blocks and nodes from the original method graph
+ * to the copied graph.
+ *
+ * @param n A node from the original method graph.
+ * @param env The copied graph.
+ */
+static void copy_all_nodes(ir_node *node, void *env)
+{
+ ir_graph *irg = (ir_graph*)env;
+ ir_node *new_node = irn_copy_into_irg(node, irg);
+
+ set_irn_link(node, new_node);
+
+ /* fix access to entities on the stack frame */
+ if (is_Sel(new_node)) {
+ ir_entity *ent = get_Sel_entity(new_node);
+ ir_type *tp = get_entity_owner(ent);
+
+ if (is_frame_type(tp)) {
+ /* replace by the copied entity */
+ ent = (ir_entity*)get_entity_link(ent);
+
+ assert(is_entity(ent));
+ assert(get_entity_owner(ent) == get_irg_frame_type(irg));
+ set_Sel_entity(new_node, ent);
+ }
+ }
+}
+
+/**
+ * Post-walker: Set the predecessors of the copied nodes.
+ * The copied nodes are set as link of their original nodes. The links of
+ * "irn" predecessors are the predecessors of copied node.
+ */
+static void rewire(ir_node *irn, void *env)
+{
+ (void) env;
+ irn_rewire_inputs(irn);
+}
+
+static ir_node *get_new_node(const ir_node *old_node)
+{
+ return (ir_node*) get_irn_link(old_node);
+}
+
+/*
+ * Create a new graph that is a copy of a given one.
+ */
+ir_graph *create_irg_copy(ir_graph *irg)
+{
+ ir_graph *res;
+
+ res = alloc_graph();
+
+ res->n_loc = 0;
+ 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->extbb_obst = NULL;
+
+ res->last_node_idx = 0;
+
+ res->phase_state = irg->phase_state;
+ res->irg_pinned_state = irg->irg_pinned_state;
+ res->fp_model = irg->fp_model;
+
+ new_identities(res);
+
+ /* clone the frame type here for safety */
+ irp_reserve_resources(irp, IRP_RESOURCE_ENTITY_LINK);
+ res->frame_type = clone_frame_type(irg->frame_type);
+
+ res->phase_state = irg->phase_state;
+
+ ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
+
+ /* copy all nodes from the graph irg to the new graph res */
+ irg_walk_anchors(irg, copy_all_nodes, rewire, res);
+
+ /* copy the Anchor node */
+ res->anchor = get_new_node(irg->anchor);
+
+ /* -- The end block -- */
+ set_irg_end_block (res, get_new_node(get_irg_end_block(irg)));
+ set_irg_end (res, get_new_node(get_irg_end(irg)));
+
+ /* -- The start block -- */
+ set_irg_start_block(res, get_new_node(get_irg_start_block(irg)));
+ set_irg_no_mem (res, get_new_node(get_irg_no_mem(irg)));
+ set_irg_start (res, get_new_node(get_irg_start(irg)));
+
+ /* Proj results of start node */
+ set_irg_initial_mem(res, get_new_node(get_irg_initial_mem(irg)));
+
+ /* Copy the node count estimation. Would be strange if this
+ is different from the original one. */
+ res->estimated_node_count = irg->estimated_node_count;
+
+ ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
+ irp_free_resources(irp, IRP_RESOURCE_ENTITY_LINK);
+
+ return res;
}
/* Frees the passed irgraph.
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) {
- set_entity_irg(irg->ent, NULL);
- free(irg->obst);
-#if USE_EXPLICIT_PHI_IN_STACK
- free_Phi_in_stack(irg->Phi_in_stack);
-#endif
- free(irg);
+void free_ir_graph(ir_graph *irg)
+{
+ assert(is_ir_graph(irg));
+
+ edges_deactivate(irg);
+
+ hook_free_graph(irg);
+ free_irg_outs(irg);
+ if (irg->frame_type)
+ free_type(irg->frame_type);
+ del_identities(irg);
+ if (irg->ent) {
+ set_entity_irg(irg->ent, NULL); /* not set in const code irg */
+ }
+
+ free_End(get_irg_end(irg));
+ obstack_free(irg->obst,NULL);
+ free(irg->obst);
+ if (irg->loc_descriptions)
+ free(irg->loc_descriptions);
+ irg->kind = k_BAD;
+ free_graph(irg);
}
/* access routines for all ir_graph attributes:
{attr type} get_irg_{attribute name} (ir_graph *irg);
void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
-ir_node *
-get_irg_start_block (ir_graph *irg)
+int (is_ir_graph)(const void *thing)
{
- return irg->start_block;
+ return is_ir_graph_(thing);
}
-void
-set_irg_start_block (ir_graph *irg, ir_node *node)
+#ifdef DEBUG_libfirm
+/* Outputs a unique number for this node */
+long get_irg_graph_nr(const ir_graph *irg)
+{
+ return irg->graph_nr;
+}
+#else
+long get_irg_graph_nr(const ir_graph *irg)
{
- irg->start_block = node;
+ return PTR_TO_INT(irg);
}
+#endif
-ir_node *
-get_irg_start (ir_graph *irg)
+size_t get_irg_idx(const ir_graph *irg)
{
- return irg->start;
+ return irg->index;
}
-void
-set_irg_start(ir_graph *irg, ir_node *node)
+ir_node *(get_idx_irn)(const ir_graph *irg, unsigned idx)
{
- irg->start = node;
+ return get_idx_irn_(irg, idx);
}
-ir_node *
-get_irg_end_block (ir_graph *irg)
+ir_node *(get_irg_start_block)(const ir_graph *irg)
{
- return irg->end_block;
+ return get_irg_start_block_(irg);
}
-void
-set_irg_end_block (ir_graph *irg, ir_node *node)
+void (set_irg_start_block)(ir_graph *irg, ir_node *node)
{
- irg->end_block = node;
+ set_irg_start_block_(irg, node);
}
-ir_node *
-get_irg_end (ir_graph *irg)
+ir_node *(get_irg_start)(const ir_graph *irg)
{
- return irg->end;
+ return get_irg_start_(irg);
}
-void
-set_irg_end (ir_graph *irg, ir_node *node)
+void (set_irg_start)(ir_graph *irg, ir_node *node)
{
- irg->end = node;
+ set_irg_start_(irg, node);
}
-ir_node *
-get_irg_cstore (ir_graph *irg)
+ir_node *(get_irg_end_block)(const ir_graph *irg)
{
- return irg->cstore;
+ return get_irg_end_block_(irg);
}
-void
-set_irg_cstore (ir_graph *irg, ir_node *node)
+void (set_irg_end_block)(ir_graph *irg, ir_node *node)
{
- irg->cstore = node;
+ set_irg_end_block_(irg, node);
}
-ir_node *
-get_irg_frame (ir_graph *irg)
+ir_node *(get_irg_end)(const ir_graph *irg)
{
- return irg->frame;
+ return get_irg_end_(irg);
}
-void
-set_irg_frame (ir_graph *irg, ir_node *node)
+void (set_irg_end)(ir_graph *irg, ir_node *node)
{
- irg->frame = node;
+ set_irg_end_(irg, node);
}
-ir_node *
-get_irg_globals (ir_graph *irg)
+ir_node *(get_irg_initial_exec)(const ir_graph *irg)
{
- return irg->globals;
+ return get_irg_initial_exec_(irg);
}
-void
-set_irg_globals (ir_graph *irg, ir_node *node)
+void (set_irg_initial_exec)(ir_graph *irg, ir_node *node)
{
- irg->globals = node;
+ set_irg_initial_exec_(irg, node);
}
-ir_node *
-get_irg_args (ir_graph *irg)
+ir_node *(get_irg_frame)(const ir_graph *irg)
{
- return irg->args;
+ return get_irg_frame_(irg);
}
-void
-set_irg_args (ir_graph *irg, ir_node *node)
+void (set_irg_frame)(ir_graph *irg, ir_node *node)
{
- irg->args = node;
+ set_irg_frame_(irg, node);
}
-ir_node *
-get_irg_bad (ir_graph *irg)
+ir_node *(get_irg_initial_mem)(const ir_graph *irg)
{
- return irg->bad;
+ return get_irg_initial_mem_(irg);
}
-void
-set_irg_bad (ir_graph *irg, ir_node *node)
+void (set_irg_initial_mem)(ir_graph *irg, ir_node *node)
{
- irg->bad = node;
+ set_irg_initial_mem_(irg, node);
}
-ir_node *
-get_irg_unknown (ir_graph *irg)
+ir_node *(get_irg_args)(const ir_graph *irg)
{
- return irg->unknown;
+ return get_irg_args_(irg);
}
-void
-set_irg_unknown (ir_graph *irg, ir_node *node)
+void (set_irg_args)(ir_graph *irg, ir_node *node)
{
- irg->unknown = node;
+ set_irg_args_(irg, node);
}
-ir_node *
-get_irg_current_block (ir_graph *irg)
+ir_node *(get_irg_no_mem)(const ir_graph *irg)
{
- return irg->current_block;
+ return get_irg_no_mem_(irg);
}
-void
-set_irg_current_block (ir_graph *irg, ir_node *node)
+void (set_irg_no_mem)(ir_graph *irg, ir_node *node)
{
- irg->current_block = node;
+ set_irg_no_mem_(irg, node);
}
-entity *
-get_irg_ent (ir_graph *irg)
+ir_entity *(get_irg_entity)(const ir_graph *irg)
{
- assert(irg && irg->ent);
- return irg->ent;
+ return get_irg_entity_(irg);
}
-void
-set_irg_ent (ir_graph *irg, entity *ent)
+void (set_irg_entity)(ir_graph *irg, ir_entity *ent)
{
- irg->ent = ent;
+ set_irg_entity_(irg, ent);
}
-type *
-get_irg_frame_type (ir_graph *irg)
+ir_type *(get_irg_frame_type)(ir_graph *irg)
{
- assert(irg && irg->frame_type);
- return irg->frame_type;
+ return get_irg_frame_type_(irg);
}
-void
-set_irg_frame_type (ir_graph *irg, type *ftp)
+void (set_irg_frame_type)(ir_graph *irg, ir_type *ftp)
{
- irg->frame_type = ftp;
+ set_irg_frame_type_(irg, ftp);
}
+int get_irg_n_locs(ir_graph *irg)
+{
+ return irg->n_loc - 1;
+}
-/* To test for a frame type */
-int
-is_frame_type(type *ftp) {
- return ((is_class_type(ftp) || is_struct_type(ftp)) &&
- id_is_suffix(id_from_str(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX)),
- get_type_ident(ftp)));
+/* Returns the obstack associated with the graph. */
+struct obstack *(get_irg_obstack)(const ir_graph *irg)
+{
+ return get_irg_obstack_(irg);
}
-int
-get_irg_n_locs (ir_graph *irg)
+/*
+ * Returns true if the node n is allocated on the storage of graph irg.
+ *
+ * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
+ */
+int node_is_in_irgs_storage(const ir_graph *irg, const ir_node *n)
{
-#if PRECISE_EXC_CONTEXT
- return irg->n_loc - 1 - 1;
-#else
- return irg->n_loc - 1;
-#endif
+ struct _obstack_chunk *p;
+
+ /*
+ * checks weather the ir_node pointer is on the obstack.
+ * A more sophisticated check would test the "whole" ir_node
+ */
+ for (p = irg->obst->chunk; p; p = p->prev) {
+ if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
+ return 1;
+ }
+
+ return 0;
}
-void
-set_irg_n_loc (ir_graph *irg, int n_loc)
+irg_phase_state (get_irg_phase_state)(const ir_graph *irg)
{
-#if PRECISE_EXC_CONTEXT
- irg->n_loc = n_loc + 1 + 1;
-#else
- irg->n_loc = n_loc + 1;
-#endif
+ return get_irg_phase_state_(irg);
+}
+
+void (set_irg_phase_state)(ir_graph *irg, irg_phase_state state)
+{
+ set_irg_phase_state_(irg, state);
+}
+
+op_pin_state (get_irg_pinned)(const ir_graph *irg)
+{
+ return get_irg_pinned_(irg);
+}
+
+void (set_irg_pinned)(ir_graph *irg, op_pin_state p)
+{
+ set_irg_pinned_(irg, p);
}
-irg_phase_state get_irg_phase_state (ir_graph *irg) {
- return irg->phase_state;
+irg_callee_info_state (get_irg_callee_info_state)(const ir_graph *irg)
+{
+ return get_irg_callee_info_state_(irg);
}
-void set_irg_phase_low(ir_graph *irg) {
- irg->phase_state = phase_low;
+void (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s)
+{
+ set_irg_callee_info_state_(irg, s);
}
-op_pinned
-get_irg_pinned (ir_graph *irg) {
- return irg->pinned;
+irg_inline_property (get_irg_inline_property)(const ir_graph *irg)
+{
+ return get_irg_inline_property_(irg);
}
-irg_outs_state get_irg_outs_state(ir_graph *irg) {
- return irg->outs_state;
+void (set_irg_inline_property)(ir_graph *irg, irg_inline_property s)
+{
+ set_irg_inline_property_(irg, s);
}
-void set_irg_outs_inconsistent(ir_graph *irg) {
- irg->outs_state = outs_inconsistent;
+mtp_additional_properties (get_irg_additional_properties)(const ir_graph *irg)
+{
+ return get_irg_additional_properties_(irg);
}
-irg_dom_state get_irg_dom_state(ir_graph *irg) {
- return irg->dom_state;
+void (set_irg_additional_properties)(ir_graph *irg, mtp_additional_properties property_mask)
+{
+ set_irg_additional_properties_(irg, property_mask);
}
-void set_irg_dom_inconsistent(ir_graph *irg) {
- irg->dom_state = dom_inconsistent;
+void (add_irg_additional_properties)(ir_graph *irg, mtp_additional_properties flag)
+{
+ add_irg_additional_properties_(irg, flag);
}
-INLINE void
-set_irg_pinned (ir_graph *irg, op_pinned p) {
- irg->pinned = p;
+void (set_irg_link)(ir_graph *irg, void *thing)
+{
+ set_irg_link_(irg, thing);
}
-INLINE void
-set_irg_link (ir_graph *irg, void *thing) {
- irg->link = thing;
+void *(get_irg_link)(const ir_graph *irg)
+{
+ return get_irg_link_(irg);
}
-INLINE void *
-get_irg_link (ir_graph *irg) {
- return irg->link;
+ir_visited_t (get_irg_visited)(const ir_graph *irg)
+{
+ return get_irg_visited_(irg);
}
-/* maximum visited flag content of all ir_graph visited fields. */
-static int max_irg_visited = 0;
+/** maximum visited flag content of all ir_graph visited fields. */
+static ir_visited_t max_irg_visited = 0;
-unsigned long
-get_irg_visited (ir_graph *irg)
+void set_irg_visited(ir_graph *irg, ir_visited_t visited)
{
- return irg->visited;
+ irg->visited = visited;
+ if (irg->visited > max_irg_visited) {
+ max_irg_visited = irg->visited;
+ }
}
-void
-set_irg_visited (ir_graph *irg, unsigned long visited)
+void inc_irg_visited(ir_graph *irg)
{
- irg->visited = visited;
- if (irg->visited > max_irg_visited) {
- max_irg_visited = irg->visited;
- }
+ ++irg->visited;
+ if (irg->visited > max_irg_visited) {
+ max_irg_visited = irg->visited;
+ }
}
-void
-inc_irg_visited (ir_graph *irg)
+ir_visited_t get_max_irg_visited(void)
{
- if (++irg->visited > max_irg_visited) {
- max_irg_visited = irg->visited;
- }
+ return max_irg_visited;
}
-unsigned long
-get_max_irg_visited(void)
+void set_max_irg_visited(int val)
{
- int i;
- for(i = 0; i < get_irp_n_irgs(); i++)
- assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
- return max_irg_visited;
+ max_irg_visited = val;
}
-unsigned long
-inc_max_irg_visited(void)
+ir_visited_t inc_max_irg_visited(void)
{
- int i;
- for(i = 0; i < get_irp_n_irgs(); i++)
- assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
- max_irg_visited++;
- return max_irg_visited;
+#ifndef NDEBUG
+ size_t i;
+ for (i = 0; i < get_irp_n_irgs(); i++)
+ assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
+#endif
+ return ++max_irg_visited;
+}
+
+ir_visited_t (get_irg_block_visited)(const ir_graph *irg)
+{
+ return get_irg_block_visited_(irg);
+}
+
+void (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited)
+{
+ set_irg_block_visited_(irg, visited);
+}
+
+void (inc_irg_block_visited)(ir_graph *irg)
+{
+ inc_irg_block_visited_(irg);
+}
+
+/* Return the floating point model of this graph. */
+unsigned (get_irg_fp_model)(const ir_graph *irg)
+{
+ return get_irg_fp_model_(irg);
+}
+
+/* Sets the floating point model for this graph. */
+void set_irg_fp_model(ir_graph *irg, unsigned model)
+{
+ irg->fp_model = model;
+}
+
+/* set a description for local value n */
+void set_irg_loc_description(ir_graph *irg, int n, void *description)
+{
+ assert(0 <= n && n < irg->n_loc);
+
+ if (! irg->loc_descriptions)
+ irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
+
+ irg->loc_descriptions[n] = description;
+}
+
+/* get the description for local value n */
+void *get_irg_loc_description(ir_graph *irg, int n)
+{
+ assert(0 <= n && n < irg->n_loc);
+ return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
+}
+
+#ifndef NDEBUG
+void ir_reserve_resources(ir_graph *irg, ir_resources_t resources)
+{
+ assert((irg->reserved_resources & resources) == 0);
+ irg->reserved_resources |= resources;
+}
+
+void ir_free_resources(ir_graph *irg, ir_resources_t resources)
+{
+ assert((irg->reserved_resources & resources) == resources);
+ irg->reserved_resources &= ~resources;
+}
+
+ir_resources_t ir_resources_reserved(const ir_graph *irg)
+{
+ return irg->reserved_resources;
+}
+#endif /* NDEBUG */
+
+/* Returns a estimated node count of the irg. */
+unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg)
+{
+ return get_irg_estimated_node_cnt_(irg);
+}
+
+/* Returns the last irn index for this graph. */
+unsigned get_irg_last_idx(const ir_graph *irg)
+{
+ return irg->last_node_idx;
+}
+
+/* register additional space in an IR graph */
+size_t register_additional_graph_data(size_t size)
+{
+ assert(!forbid_new_data && "Too late to register additional node data");
+
+ if (forbid_new_data)
+ return 0;
+
+ return additional_graph_data_size += size;
}
-unsigned long
-get_irg_block_visited (ir_graph *irg)
+void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
{
- return irg->block_visited;
+ set_irg_state_(irg, state);
}
-void
-set_irg_block_visited (ir_graph *irg, unsigned long visited)
+void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
{
- irg->block_visited = visited;
+ clear_irg_state_(irg, state);
}
-void
-inc_irg_block_visited (ir_graph *irg)
+int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
{
- ++irg->block_visited;
+ return is_irg_state_(irg, state);
}
projects / libfirm / blobdiff