#include "irprintf.h"
#include "execfreq.h"
-typedef struct _env {
- struct obstack *obst; /**< the obstack where allocations took place */
+typedef struct env {
+ struct obstack *obst; /**< the obstack where allocations took place */
ir_extblk *head; /**< head of the list of all extended blocks */
ir_exec_freq *execfreqs;
} env_t;
ir_node *best_succ = NULL;
double best_execfreq = -1;
- /*
+ /*
More than two successors means we have a jump table.
we cannot include a jump target into the current extended
basic block, so create a new one here.
*/
void compute_extbb_execfreqs(ir_graph *irg, ir_exec_freq *execfreqs)
{
- env_t env;
+ env_t env;
ir_extblk *extbb, *next;
ir_node *endblock;
extbb->blks = NEW_ARR_D(ir_node *, env.obst, len);
- for (block = extbb->link, i = 0; i < len; ++i) {
- ir_node *nblock = get_irn_link(block);
+ for (block = (ir_node*) extbb->link, i = 0; i < len; ++i) {
+ ir_node *nblock = (ir_node*) get_irn_link(block);
/* ensure that the leader is the first one */
extbb->blks[len - 1 - i] = block;
extbb->visited = 0;
}
- irg->extblk_state = extblk_valid;
+ irg->extblk_state = ir_extblk_info_valid;
}