+/** Returns teh number of value numbers of a graph. */
+int get_irg_n_locs (ir_graph *irg);
+
+/** Returns the graph number. */
+long get_irg_graph_nr(ir_graph *irg);
+
+/********************************************************************************/
+/* States of an ir_graph. */
+/********************************************************************************/
+
+/*
+ information associated with the graph. Optimizations invalidate these
+ states. */
+
+/** state: phase values: phase_building, phase_high, phase_low.
+ The irg is in phase_building during construction of the irgraph. It is in
+ phase_high after construction. All nodes are allowed. To get the irgraph
+ into phase_low all Sel nodes must be removed and replaced by explicit
+ address computations. SymConst size and typetag nodes must be removed (@@@
+ really?). Initialization of memory allocated by Alloc must be explicit.
+ @@@ More conditions? */
+typedef enum {
+ phase_building,
+ phase_high,
+ phase_low
+} irg_phase_state;
+
+irg_phase_state get_irg_phase_state (ir_graph *irg);
+void set_irg_phase_low(ir_graph *irg);
+
+/** state: pinned
+ The graph is "pinned" if all nodes are associated with a basic block.
+ It is in state "floats" if nodes are in arbitrary blocks. In state
+ "floats" the block predecessor is set in all nodes, but this can be an
+ invalid block, i.e., the block is not a dominator of all the uses of
+ the node.
+ The enum op_pinned is defined in irop.h. */
+op_pinned get_irg_pinned (ir_graph *irg);
+
+/** state: outs_state
+ Outs are the back edges or def-use edges.
+ Values: no_outs, outs_consistent, outs_inconsistent
+ no_outs: outs are not computed, no memory is allocated.
+ outs_consistent: outs are computed and correct,
+ outs_inconsistent: outs have been computed, memory is still allocated,
+ but the graph has been changed since. */
+typedef enum {
+ no_outs,
+ outs_consistent,
+ outs_inconsistent
+} irg_outs_state;
+irg_outs_state get_irg_outs_state(ir_graph *irg);
+void set_irg_outs_inconsistent(ir_graph *irg);
+
+/** state: dom_state
+ Signals the state of the dominator infomation.
+ Values: no_dom, dom_consistent, dom_inconsistent
+ no_dom: doms are not computed, no memory is allocated. The access routines
+ may not be used.
+ dom_consistent: dominator information is computed and correct,
+ dom_inconsistent: dominator information is computed, memory is still allocated,
+ but the graph has been changed since. Using the access routines is possible,
+ obtained information may be incorrect. */
+typedef enum {
+ no_dom,
+ dom_consistent,
+ dom_inconsistent
+} irg_dom_state;
+irg_dom_state get_irg_dom_state(ir_graph *irg);
+void set_irg_dom_inconsistent(ir_graph *irg);
+
+/* state: loopinfo_state
+ Loop information describes the loops within the control and
+ data flow of the procedure. */
+typedef enum {
+ loopinfo_none, /**< No loop information is constructed. Default. */
+ loopinfo_consistent, /**< IntRAprocedural loop information constructed and valid. */
+ loopinfo_inconsistent, /**< IntRAprocedural loop information constructed and invalid. */
+ loopinfo_ip_consistent, /**< IntERprocedural loop information constructed and valid. */
+ loopinfo_ip_inconsistent, /**< IntERprocedural loop information constructed and invalid. */
+ loopinfo_cf_consistent, /**< IntRAprocedural control loop information constructed and valid. */
+ loopinfo_cf_inconsistent, /**< IntRAprocedural control loop information constructed and invalid. */
+ loopinfo_cf_ip_consistent, /**< IntERprocedural control loop information constructed and valid. */
+ loopinfo_cf_ip_inconsistent /**< IntERprocedural control loop information constructed and invalid. */
+} irg_loopinfo_state;
+irg_loopinfo_state get_irg_loopinfo_state(ir_graph *irg);
+void set_irg_loopinfo_state(ir_graph *irg, irg_loopinfo_state s);
+/* Sets the loopinformation state to the appropriate inconsistent state.
+ If state is 'none' does not change. */
+void set_irg_loopinfo_inconsistent(ir_graph *irg);
+
+
+/** state: callee_information_state
+ * Call nodes contain a list of possible callees. This list must be
+ * computed by an anlyses. */
+typedef enum {
+ irg_callee_info_none,
+ irg_callee_info_consistent,
+ irg_callee_info_inconsistent
+} irg_callee_info_state;
+irg_callee_info_state get_irg_callee_info_state(ir_graph *irg);
+void set_irg_callee_info_state(ir_graph *irg, irg_callee_info_state s);
+
+/** property:
+ * Tells how to handle an ir graph in inlineing.
+ */
+typedef enum {
+ irg_inline_any, /**< No restriction on inlineing. Default. */
+ irg_inline_forbidden, /**< The graph may not be inlined. */
+ irg_inline_recomended, /**< The graph should be inlined. */
+ irg_inline_forced /**< The graph must be inlined. */
+} irg_inline_property;
+irg_inline_property get_irg_inline_property(ir_graph *irg);
+void set_irg_inline_property(ir_graph *irg, irg_inline_property s);