{
nodes_iter_t nodes_it;
aff_edge_t *edges = NEW_ARR_F(aff_edge_t, 0);
- ir_node *n;
int i, len;
size_t pn;
void sr_remove(size_red_t *sr)
{
- ir_node *irn;
bool redo = true;
const be_ifg_t *ifg = sr->co->cenv->ifg;
nodes_iter_t iter;
unsigned n_regs = arch_register_class_n_regs(ienv->co->cls);
const unsigned *allocatable_colors = lenv->allocatable_colors;
nodes_iter_t iter;
- ir_node *irn;
char buf[32];
unsigned *const colors = rbitset_alloca(n_regs);
ir_graph *irg = co->irg;
be_irg_t *birg = be_birg_from_irg(irg);
- ir_node *irn;
nodes_iter_t it;
neighbours_iter_t nit;
int n, n_regs;
static void dump_ifg_nodes(FILE *F, const be_ifg_t *ifg)
{
nodes_iter_t ifg_iter;
- ir_node *node;
be_ifg_foreach_node(ifg, &ifg_iter, node) {
dump_node(F, node);
}
static void dump_ifg_edges(FILE *F, const be_ifg_t *ifg)
{
nodes_iter_t ifg_iter;
- ir_node *node;
be_ifg_foreach_node(ifg, &ifg_iter, node) {
neighbours_iter_t neigh_iter;
nodes_iter_t nodes_it;
bitset_t *seen = bitset_malloc(get_irg_last_idx(irg));
- ir_node *n;
-
be_ifg_foreach_node(ifg, &nodes_it, n) {
if (bitset_is_set(seen, get_irn_idx(n)))
continue;
nodes_iter_t nodes_it;
neighbours_iter_t neigh_it;
bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg));
- ir_node *n;
memset(stat, 0, sizeof(stat[0]));
for (ir_node *pos = be_ifg_neighbours_begin(ifg, iter, irn); pos; pos = be_ifg_neighbours_next(iter))
#define be_ifg_foreach_node(ifg, iter, pos) \
- for(pos = be_ifg_nodes_begin(ifg, iter); pos != NULL; pos = be_ifg_nodes_next(iter))
+ for (ir_node *pos = be_ifg_nodes_begin(ifg, iter); pos; pos = be_ifg_nodes_next(iter))
#define be_ifg_foreach_clique(ifg, iter, buf, count) \
for(*(count) = be_ifg_cliques_begin(ifg, iter, buf); \