#include "irgraph.h"
#include "iredgekinds.h"
#include "irtypeinfo.h"
-#include "irextbb.h"
#include "irmemory.h"
#include "callgraph.h"
#include "irprog.h"
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 dynamic_ins:1; /**< if set in-array is an ARR_F on the heap. */
unsigned marked:1; /**< Can be set/unset to temporary mark a block. */
ir_node **graph_arr; /**< An array to store all parameters. */
/* Attributes holding analyses information */
in different phases. Eventually inline the whole
datastructure. */
ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
- ir_node ** in_cg; /**< array with predecessors in
- * interprocedural_view, if they differ
- * from intraprocedural predecessors */
bitset_t *backedge; /**< Bitfield n set to true if pred n is backedge.*/
- bitset_t *cg_backedge; /**< Bitfield n set to true if pred n is interprocedural backedge. */
- ir_extblk *extblk; /**< The extended basic block this block belongs to. */
ir_entity *entity; /**< entitiy representing this block */
ir_node *phis; /**< The list of Phi nodes in this block. */
struct ir_graph {
firm_kind kind; /**< Always set to k_ir_graph. */
/* -- Basics of the representation -- */
- unsigned last_node_idx; /**< The last IR node index for this graph. */
+ unsigned last_node_idx; /**< The last IR node index for this graph. */
ir_entity *ent; /**< The entity of this procedure, i.e.,
the type of the procedure and the
class it belongs to. */
ir_node *anchor; /**< Pointer to the anchor node of this graph. */
struct obstack *obst; /**< The obstack where all of the ir_nodes live. */
ir_node *current_block; /**< Current block for newly gen_*()-erated ir_nodes. */
- struct obstack *extbb_obst; /**< The obstack for extended basic block info. */
/* -- Fields for graph properties -- */
irg_inline_property inline_property; /**< How to handle inlineing. */
mtp_additional_properties additional_properties; /**< Additional graph properties. */
/* -- Fields indicating different states of irgraph -- */
- ir_graph_state_t state;
- irg_phase_state phase_state; /**< Compiler phase. */
- op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
- ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
- irg_callee_info_state callee_info_state; /**< Validity of callee information. */
- ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
+ ir_graph_properties_t properties;
+ ir_graph_constraints_t constraints;
+ irg_phase_state phase_state; /**< Compiler phase. */
+ op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
+ ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
+ irg_callee_info_state callee_info_state; /**< Validity of callee information. */
+ ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */
unsigned fp_model; /**< floating point model of the graph. */
to allocate nodes the represent values
of constant entities. It is not meant as
a procedure. */
+ ir_entity *unknown_entity; /**< unique 'unknown'-entity */
ir_type *segment_types[IR_SEGMENT_LAST+1];
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. */
+ ir_type *none_type; /**< unique 'none'-type */
+ ir_type *code_type; /**< unique 'code'-type */
+ ir_type *unknown_type; /**< unique 'unknown'-type */
+ ir_type *byte_type; /**< type for a 'byte' */
ident **global_asms; /**< An array of global ASM insertions. */
/* -- states of and access to generated information -- */
ir_class_cast_state class_cast_state; /**< The state of cast operations in code. */
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. */
size_t max_irg_idx; /**< highest unused irg index */
long max_node_nr; /**< to generate unique numbers for nodes. */
unsigned dump_nr; /**< number of program info dumps */
- unsigned optimization_dumps :1; /**< dump irg on each optimization */
#ifndef NDEBUG
- ir_resources_t reserved_resources; /**< Bitset for tracking used global resources. */
+ irp_resources_t reserved_resources; /**< Bitset for tracking used global resources. */
#endif
};
projects / libfirm / blobdiff