/* Attributes private to construction: */
unsigned matured:1; /**< if set, all in-nodes of the block are fixed */
unsigned dead:1; /**< if set, the block is dead (and could be replace by a Bad */
- struct ir_node **graph_arr; /**< array to store all parameters */
+ ir_node **graph_arr; /**< array to store all parameters */
/* Attributes holding analyses information */
- struct dom_info dom; /**< Datastructure that holds information about dominators.
- @@@ @todo
- Eventually overlay with graph_arr as only valid
- in different phases. Eventually inline the whole
- datastructure. */
- /* exc_t exc; */ /**< role of this block for exception handling */
- /* ir_node *handler_entry; */ /**< handler entry block iff this block is part of a region */
+ dom_info dom; /**< Datastructure that holds information about dominators.
+ @@@ @todo
+ Eventually overlay with graph_arr as only valid
+ in different phases. Eventually inline the whole
+ datastructure. */
+ 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 */
+ * interprocedural_view, if they differ
+ * from intraprocedural predecessors */
int *backedge; /**< Field n set to true if pred n is backedge.
- @@@ @todo Ev. replace by bitfield! */
+ @@@ @todo Ev. replace by bit field! */
int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
- @@@ @todo Ev. replace by bitfield! */
+ @@@ @todo Ev. replace by bit field! */
ir_extblk *extblk; /**< the extended basic block this block belongs to */
struct list_head succ_head; /**< A list head for all successor edges of a block. */
/** InstOf attributes */
typedef struct {
- ir_type *ent;
- int dfn;
+ except_attr exc; /**< the exception attribute. MUST be the first one. */
+ ir_type *type; /**< the type of which the object pointer must be */
} io_attr;
/** Filter attributes */
/** CallBegin attributes */
typedef struct {
- ir_node * call; /**< associated Call-operation */
+ ir_node * call; /**< Associated Call-operation. */
} callbegin_attr;
/** Cast attributes */
typedef struct {
- ir_type *totype; /**< type of the casted node */
+ ir_type *totype; /**< Type of the casted node. */
} cast_attr;
/** Load attributes */
typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_mode *load_mode; /**< the mode of this Load operation */
- ent_volatility volatility; /**< the volatility of a Load/Store operation */
+ except_attr exc; /**< The exception attribute. MUST be the first one. */
+ ir_mode *load_mode; /**< The mode of this Load operation. */
+ ent_volatility volatility; /**< The volatility of a Load/Store operation. */
} load_attr;
/** Store attributes */
/** CopyB attribute */
typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_type *data_type; /**< type of the copied entity */
+ except_attr exc; /**< The exception attribute. MUST be the first one. */
+ ir_type *data_type; /**< Type of the copied entity. */
} copyb_attr;
+/** Bound attribute */
+typedef struct {
+ except_attr exc; /**< The exception attribute. MUST be the first one. */
+} bound_attr;
+
/**
* Edge info to put into an irn.
*/
typedef struct _irn_edge_info_t {
- struct list_head outs_head; /**< The list of all outs */
- int out_count; /**< number of outs in the list */
+ struct list_head outs_head; /**< The list of all outs. */
+ int out_count; /**< Number of outs in the list. */
} irn_edge_info_t;
end_attr end; /**< For EndReg, EndExcept */
except_attr except; /**< For Phi node construction in case of exceptions */
copyb_attr copyb; /**< For CopyB operation */
+ bound_attr bound; /**< For Bound operation */
} attr;