gcc/
* cse.c (count_reg_usage): Handle INT_LIST.
* lra-eliminations.c (lra_eliminate_regs_1): Likewise.
* reginfo.c (reg_scan_mark_refs): Likewise.
* reload1.c (eliminate_regs_1): Likewise.
From-SVN: r202969
+2013-09-27 Richard Sandiford <rdsandiford@googlemail.com>
+
+ * cse.c (count_reg_usage): Handle INT_LIST.
+ * lra-eliminations.c (lra_eliminate_regs_1): Likewise.
+ * reginfo.c (reg_scan_mark_refs): Likewise.
+ * reload1.c (eliminate_regs_1): Likewise.
+
2013-09-27 Iain Sandoe <iain@codesourcery.com>
PR middle-end/58547
return;
case INSN_LIST:
+ case INT_LIST:
gcc_unreachable ();
default:
/* ... fall through ... */
case INSN_LIST:
+ case INT_LIST:
/* Now do eliminations in the rest of the chain. If this was
an EXPR_LIST, this might result in allocating more memory than is
strictly needed, but it simplifies the code. */
break;
case INSN_LIST:
+ case INT_LIST:
if (XEXP (x, 1))
reg_scan_mark_refs (XEXP (x, 1), insn);
break;
/* ... fall through ... */
case INSN_LIST:
+ case INT_LIST:
/* Now do eliminations in the rest of the chain. If this was
an EXPR_LIST, this might result in allocating more memory than is
strictly needed, but it simplifies the code. */