- ir_node *cfop = skip_Proj(get_Block_cfgpred(b, i));
- ir_node *pred = get_nodes_block(cfop);
+ cfop = skip_Proj(get_Block_cfgpred(b, i));
+ pred = get_nodes_block(cfop);
/* We want nice blocks. */
assert( get_irn_op(pred) != op_Bad
&& get_irn_op(skip_Proj(get_Block_cfgpred(b, i))) != op_Bad);
/* We want nice blocks. */
assert( get_irn_op(pred) != op_Bad
&& get_irn_op(skip_Proj(get_Block_cfgpred(b, i))) != op_Bad);
} else {
int found = find_inner_loop(b, l, pred, cfop);
if (!found) {
} else {
int found = find_inner_loop(b, l, pred, cfop);
if (!found) {
- if (b != get_loop_element(l, 0).node) {
- if (get_firm_verbosity()) {
- printf("Loop entry not at loop position 0. "); DDMN(b);
- }
- }
- found = find_outer_loop(l, pred_l, pred, cfop);
- if (found) add_region_in(b, NULL); /* placeholder */
+ if (b != get_loop_element(l, 0).node) {
+ if (get_firm_verbosity()) {
+ printf("Loop entry not at loop position 0. "); DDMN(b);
+ }
+ }
+ found = find_outer_loop(l, pred_l, pred, cfop);
+ if (found) add_region_in(b, NULL); /* placeholder */
- found = find_previous_loop(l, pred_l, b, pred, cfop);
+ found = find_previous_loop(l, pred_l, b, pred, cfop);
- DDMG(current_ir_graph);
- DDMN(b);
- DDMN(pred);
- assert(is_backedge(b, i));
- assert(found && "backedge from inner loop");
+ DDMG(current_ir_graph);
+ DDMN(b);
+ DDMN(pred);
+ assert(is_backedge(b, i));
+ assert(found && "backedge from inner loop");
}
}
if (b != get_loop_element(l, 0).node) {
/* Check for improper region */
if (has_backedges(b)) {
}
}
if (b != get_loop_element(l, 0).node) {
/* Check for improper region */
if (has_backedges(b)) {