ir_node *get_irg_end (ir_graph *irg);
void set_irg_end (ir_graph *irg, ir_node *node);
+/* The fields end_reg and end_except contain the end nodes of the
+ interprocedural view. If the view is not constructed they contain
+ the nomal end node. */
+ir_node *get_irg_end_reg (ir_graph *irg);
+void set_irg_end_reg (ir_graph *irg, ir_node *node);
+
+ir_node *get_irg_end_except (ir_graph *irg);
+void set_irg_end_except (ir_graph *irg, ir_node *node);
+
+
/* @@@ oblivious, no more supported. */
ir_node *get_irg_cstore (ir_graph *irg);
void set_irg_cstore (ir_graph *irg, ir_node *node);
int get_irg_n_locs (ir_graph *irg);
-INLINE long get_irg_graph_nr(ir_graph *irg);
+long get_irg_graph_nr(ir_graph *irg);
/********************************************************************************/
/* States of an ir_graph. */
/* state: loopinfo_state
Loop information describes the loops within the control and
data flow of the procedure. */
-/* @@@ make unrecognizable for jni script!!! -- Why??? */
typedef enum {
- no_loopinfo,
- loopinfo_consistent,
- loopinfo_inconsistent
+ 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);
+
/* A void * field to link arbritary information to the node. */
void set_irg_link (ir_graph *irg, void *thing);
void *get_irg_link (ir_graph *irg);