* very careful!
*/
static INLINE int *mere_get_backarray(ir_node *n) {
- switch(intern_get_irn_opcode(n)) {
+ switch (get_irn_opcode(n)) {
case iro_Block:
if (!get_Block_matured(n)) return NULL;
if (interprocedural_view && n->attr.block.in_cg) {
INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
- opcode opc = intern_get_irn_opcode(n);
+ opcode opc = get_irn_opcode(n);
int *arr = mere_get_backarray(n);
if (ARR_LEN(arr) == ARR_LEN(get_irn_in(n))-1)
return;
bool has_backedges (ir_node *n) {
int i;
int *ba = get_backarray (n);
- if (ba)
- for (i = 0; i < intern_get_irn_arity(n); i++)
+ if (ba) {
+ int arity = get_irn_arity(n);
+ for (i = 0; i < arity; i++)
if (ba[i]) return true;
+ }
return false;
}
/** Sets all backedge information to zero. */
void clear_backedges (ir_node *n) {
- int i, rem = interprocedural_view;
+ int i, arity;
+ int rem = interprocedural_view;
int *ba;
interprocedural_view = 0;
ba = get_backarray (n);
- if (ba)
- for (i = 0; i < intern_get_irn_arity(n); i++)
+ if (ba) {
+ arity = get_irn_arity(n);
+ for (i = 0; i < arity; i++)
ba[i] = 0;
+ }
interprocedural_view = 1;
ba = get_backarray (n);
- if (ba)
- for (i = 0; i < intern_get_irn_arity(n); i++)
+ if (ba) {
+ arity = get_irn_arity(n);
+ for (i = 0; i < arity; i++)
ba[i] = 0;
+ }
interprocedural_view = rem;
}