// FIXME: this is almost certainly boned.  a Reg could appear in the
// address expressions.
public boolean usesRegs() {
        // FIXME: this is almost certainly boned.  a Reg could appear in the
        // address expressions.
        for (int i=0;i<rhs().length;++i) {
            if (usesDirectly(i) && rhs()[i] instanceof Reg) {
                return true;
            }
        }
        if (opcode.form().implicitUses(head().code()).length!=0) {
            return true;
        }
        return false;
    }
public boolean usesRegs() {
// FIXME: this is almost certainly boned. a Reg could appear in the
// address expressions.
for (int i=0;i<rhs().length;++i) {
if (usesDirectly(i) && rhs()[i] instanceof Reg) {
public boolean usesRegs() {
// FIXME: this is almost certainly boned. a Reg could appear in the
// address expressions.
for (int i=0;i<rhs().length;++i) {
if (usesDirectly(i) && rhs()[i] instanceof Reg) {
return true;
}
}
if (opcode.form().implicitUses(head().code()).length!=0) {
return true;
}
return false;
}
public boolean usesRegs() {
// FIXME: this is almost certainly boned. a Reg could appear in the
// address expressions.
for (int i=0;i<rhs().length;++i) {
if (usesDirectly(i) && rhs()[i] instanceof Reg) {
return true;
}
}
if (opcode.form().implicitUses(head().code()).length!=0) {
return true;
}
return false;
}