algorithm so as to choose the best, not the worst, alternative.
Reset accumulated register class before processing next alternative.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@106780
138bc75d-0d04-0410-961f-
82ee72b054a4
+2005-11-11 Ulrich Weigand <uweigand@de.ibm.com>
+
+ * postreload.c (reload_cse_simplify_operands): Fix bug in sorting
+ algorithm so as to choose the best, not the worst, alternative.
+ Reset accumulated register class before processing next alternative.
+
2005-11-11 Kaz Kojima <kkojima@gcc.gnu.org>
PR target/24445
op_alt_regno[i][j] = regno;
}
j++;
+ class = (int) NO_REGS;
break;
}
p += CONSTRAINT_LEN (c, p);
int this_nregs = alternative_nregs[alternative_order[j]];
if (this_reject < best_reject
- || (this_reject == best_reject && this_nregs < best_nregs))
+ || (this_reject == best_reject && this_nregs > best_nregs))
{
best = j;
best_reject = this_reject;