# ifndef _IRGRAPH_H_
# define _IRGRAPH_H_
# include "tv.h"
+# include "entity.h"
/* to resolve recursion between irnode.h and irgraph.h */
#ifndef _IR_NODE_TYPEDEF_
* datastructure is used to build the Phi nodes and removed after
* completion of the graph. There is no path from end to start in the
* graph after calling ir_graph.
- * pinned set to "pinned" if no global cse was performed on the graph.
- * set to "floats" if global cse was performed (and during construction:
+ * op_pin_state_pinned set to "op_pin_state_pinned" if no global cse was performed on the graph.
+ * set to "op_pin_state_floats" if global cse was performed (and during construction:
* did actually change something). Code placement is necessary.
*/
* n_loc is the number of local variables in this procedure including
* the procedure parameters.
* The constructor adds the new irgraph to the list in ir_prog.
- * The state of the ir graph is: phase_building, pinned, no_outs. */
+ * The state of the ir graph is: phase_building, op_pin_state_pinned, outs_none. */
ir_graph *new_ir_graph (entity *ent, int n_loc);
/** Frees the passed irgraph.
*/
int is_ir_graph(void *thing);
-#define get_irg_entity get_irg_ent
-#define set_irg_entity set_irg_ent
-entity *get_irg_ent (ir_graph *irg);
-void set_irg_ent (ir_graph *irg, entity *ent);
+/* #define get_irg_entity get_irg_ent */
+/* #define set_irg_entity set_irg_ent */
+entity *get_irg_entity (ir_graph *irg);
+void set_irg_entity (ir_graph *irg, entity *ent);
type *get_irg_frame_type (ir_graph *irg);
void set_irg_frame_type (ir_graph *irg, type *ftp);
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
+/** state: op_pin_state_pinned
+ The graph is "op_pin_state_pinned" if all nodes are associated with a basic block.
+ It is in state "op_pin_state_floats" if nodes are in arbitrary blocks. In state
+ "op_pin_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);
+ The enum op_pin_state is defined in irop.h. */
+op_pin_state 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.
+ Values: outs_none, outs_consistent, outs_inconsistent
+ outs_none: 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_none,
outs_consistent,
outs_inconsistent
} irg_outs_state;
/** 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
+ Values: dom_none, dom_consistent, dom_inconsistent
+ dom_none: 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_none,
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
+/** 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. */
+ loopinfo_none = 0, /**< No loop information is constructed. Default. */
+ loopinfo_constructed = 1, /**< Some kind of loop information is constructed. */
+ loopinfo_valid = 2, /**< Loop information is valid. */
+ loopinfo_cf = 4, /**< Loop information constructed for control flow only. */
+ loopinfo_inter = 8, /**< Loop information for interprocedural view. */
+
+ loopinfo_for_firmjni = 16, /**< A hack for firmjni: all enums must differ as they
+ are used in a switch. */
+
+ /** IntRAprocedural loop information constructed and valid. */
+ loopinfo_consistent = loopinfo_constructed | loopinfo_valid,
+ /** IntRAprocedural loop information constructed and invalid. */
+ loopinfo_inconsistent = loopinfo_constructed | loopinfo_for_firmjni,
+
+ /** IntERprocedural loop information constructed and valid. */
+ loopinfo_ip_consistent = loopinfo_constructed | loopinfo_inter | loopinfo_valid,
+ /** IntERprocedural loop information constructed and invalid. */
+ loopinfo_ip_inconsistent = loopinfo_constructed | loopinfo_inter,
+
+ /** IntRAprocedural control loop information constructed and valid. */
+ loopinfo_cf_consistent = loopinfo_constructed | loopinfo_cf | loopinfo_valid,
+ /** IntRAprocedural control loop information constructed and invalid. */
+ loopinfo_cf_inconsistent = loopinfo_constructed | loopinfo_cf,
+
+ /** IntERprocedural control loop information constructed and valid. */
+ loopinfo_cf_ip_consistent = loopinfo_constructed | loopinfo_cf | loopinfo_inter | loopinfo_valid,
+ /** IntERprocedural control loop information constructed and invalid. */
+ loopinfo_cf_ip_inconsistent = loopinfo_constructed | loopinfo_cf | loopinfo_inter
} 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 anlysis. */
+ * computed by an anlysis.
+ *
+ * It's strange that this state is administered on irg basis, as the
+ * information must be computed for the whole program, or not?
+ */
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);
+void set_irg_callee_info_state(ir_graph *irg, irg_callee_info_state s);
/** property:
* Tells how to handle an ir graph in inlineing.
unsigned long get_irg_block_visited (ir_graph *irg);
void set_irg_block_visited (ir_graph *irg, unsigned long i);
+/* is irg a pseudo graph for analysis? */
+int is_pseudo_ir_graph(ir_graph *irg);
+
# endif /* _IRGRAPH_H_ */
projects / libfirm / blobdiff