counter_t cnt_call_with_cnst_arg; /**< number of calls with const args */
counter_t cnt_indirect_calls; /**< number of indirect calls */
counter_t cnt_if_conv[IF_RESULT_LAST]; /**< number of if conversions */
+ counter_t cnt_real_func_call; /**< number real function call optimization */
+ unsigned num_tail_recursion; /**< number of tail recursion optimizations */
HASH_MAP(opt_entry_t) *opt_hash[HOOK_OPT_LAST]; /**< hash maps containing opcode counter for optimizations */
ir_graph *irg; /**< the graph of this object */
entity *ent; /**< the entity of this graph if one exists */
counter_t cnt_edges; /**< the counter of edges in this block */
counter_t cnt_in_edges; /**< the counter of edges incoming from other blocks to this block */
counter_t cnt_out_edges; /**< the counter of edges outgoing from this block to other blocks */
+ counter_t cnt_phi_data; /**< the counter of data Phi nodes in this block */
long block_nr; /**< block nr */
} block_entry_t;
ir_op *op_DivC; /**< pseudo op for division by const */
ir_op *op_ModC; /**< pseudo op for modulo by const */
ir_op *op_DivModC; /**< pseudo op for DivMod by const */
+ ir_op *op_SelSel; /**< pseudo op for Sel(Sel) */
+ ir_op *op_SelSelSel; /**< pseudo op for Sel(Sel(Sel)) */
dumper_t *dumper; /**< list of dumper */
int reassoc_run; /**< if set, reassociation is running */
int stat_options; /**< statistic options */