#include "execution_frequency.h"
#include "irmemory.h"
#include "callgraph.h"
+#include "irprog.h"
#include "field_temperature.h"
#include "irphases_t.h"
typedef struct {
/* General attributes */
ir_graph *irg; /**< The graph this block belongs to. */
- unsigned long block_visited; /**< For the walker that walks over all blocks. */
+ ir_visited_t block_visited; /**< For the walker that walks over all blocks. */
/* Attributes private to construction: */
unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
unsigned is_dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
struct ir_node {
/* ------- Basics of the representation ------- */
firm_kind kind; /**< Distinguishes this node from others. */
- unsigned node_idx; /**< The node index of this node in its graph. */
+ unsigned node_idx; /**< The node index of this node in its graph. */
ir_op *op; /**< The Opcode of this node. */
ir_mode *mode; /**< The Mode of this node. */
struct ir_node **in; /**< The array of predecessors / operands. */
- unsigned long visited; /**< The visited counter for walks of the graph. */
+ ir_visited_t visited; /**< The visited counter for walks of the graph. */
void *link; /**< To attach additional information to the node, e.g.
- used while construction to link Phi0 nodes and
- during optimization to link to nodes that
+ used during optimization to link to nodes that
shall replace a node. */
/* ------- Fields for optimizations / analysis information ------- */
ir_def_use_edge *out; /**< array of def-use edges. */
#endif
/* ------- For analyses -------- */
ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
-#ifdef DO_HEAPANALYSIS
- struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
- struct section *sec; /**< Heapanalysis: The section of this node. */
-#endif
struct ir_node **deps; /**< Additional dependencies induced by state. */
+ void *backend_info;
irn_edges_info_t edge_info; /**< Everlasting out edges. */
/* ------- Opcode depending fields -------- */
attr attr; /**< The set of attributes of this node. Depends on opcode.
* Edge info to put into an irg.
*/
typedef struct _irg_edge_info_t {
- ir_edgeset_t edges;
- struct obstack edges_obst;
- unsigned allocated : 1;
- unsigned activated : 1; /**< set if edges are activated for the graph. */
+ ir_edgeset_t edges; /**< A set containing all edges of the current graph. */
+ struct list_head free_edges; /**< list of all free edges. */
+ struct obstack edges_obst; /**< Obstack, where edges are allocated on. */
+ unsigned allocated : 1; /**< Set if edges are allocated on the obstack. */
+ unsigned activated : 1; /**< Set if edges are activated for the graph. */
} irg_edge_info_t;
typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST];
ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
irg_extblk_info_state extblk_state; /**< State of extended basic block info. */
exec_freq_state execfreq_state; /**< Execution frequency state. */
- ir_address_taken_computed_state adr_taken_state; /**< Address taken state. */
+ ir_entity_usage_computed_state entity_usage_state;
unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */
unsigned fp_model; /**< floating point model of the graph. */
ir_loop *l; /**< For callgraph analysis. */
/* -- Fields for Walking the graph -- */
- unsigned long visited; /**< this flag is an identifier for
+ ir_visited_t visited; /**< this flag is an identifier for
ir walk. it will be incremented
every time someone walks through
the graph */
- unsigned long block_visited; /**< same as visited, for a complete block */
+ ir_visited_t block_visited; /**< same as visited, for a complete block */
+
+ ir_visited_t self_visited; /**< visited flag of the irg */
unsigned estimated_node_count; /**< estimated number of nodes in this graph,
updated after every walk */
#endif
#ifndef NDEBUG
- unsigned using_irn_visited : 1; /**< set to 1 if we are currently using the visited flag */
- unsigned using_block_visited : 1; /**< set to 1 if we are currently using the block_visited flag */
- unsigned using_irn_link : 1; /**< set to 1 if we are currently using the irn_link fields */
- unsigned using_block_mark : 1; /**< set to 1 if we are currently using the block mark flags */
+ ir_resources_t reserved_resources; /**< Bitset for tracking used local resources. */
#endif
};
to allocate nodes the represent values
of constant entities. It is not meant as
a procedure. */
- ir_type *glob_type; /**< The global type. Must be a class as it can
- have fields and procedures. */
- ir_type *tls_type; /**< The thread local storage type. Must be a struct as it can
- only have fields. */
- ir_type *constructors_type; /**< contains links to module constructor
- functions. Must be a struct */
+ ir_type *segment_types[IR_SEGMENT_COUNT];
ir_type **types; /**< A list of all types in the ir. */
ir_mode **modes; /**< A list of all modes in the ir. */
ir_op **opcodes; /**< A list of all opcodes in the ir. */
+ ident **global_asms; /**< An array of global ASM insertions. */
/* -- states of and access to generated information -- */
irg_phase_state phase_state; /**< The state of construction. */
exec_freq_state execfreq_state; /**< The state of execution frequency information */
loop_nesting_depth_state lnd_state; /**< The state of loop nesting depth information. */
ir_class_cast_state class_cast_state; /**< The state of cast operations in code. */
- ir_address_taken_computed_state globals_adr_taken_state; /**< Address taken state of the globals. */
+ ir_entity_usage_computed_state globals_entity_usage_state;
ir_exc_region_t last_region_nr; /**< The last exception region number that was assigned. */
ir_label_t last_label_nr; /**< The highest label number for generating unique labels. */
#ifdef DEBUG_libfirm
long max_node_nr; /**< to generate unique numbers for nodes. */
#endif
+#ifndef NDEBUG
+ ir_resources_t reserved_resources; /**< Bitset for tracking used global resources. */
+#endif
};
#endif
projects / libfirm / blobdiff