int num_alt;
int insn_code, insn_index;
{
- rtx newexp;
rtx condexp;
int i;
int len = XVECLEN (exp, 0);
rtx *tests = (rtx *) alloca (len * sizeof (rtx));
int allsame = 1;
- char *spacer, *first_spacer;
+ char *first_spacer;
/* This lets us free all storage allocated below, if appropriate. */
first_spacer = (char *) obstack_finish (rtl_obstack);
{
rtx newexp;
int i;
- char *alternative;
/* Find the bit. */
for (i = 0; (mask & (1 << i)) == 0; i++)
{
struct attr_desc *attr;
struct attr_value *av;
- struct insn_ent *ie, *nextie;
+ struct insn_ent *ie;
rtx newexp;
int something_changed = 1;
int i;
}
}
+#if 0
static rtx
simplify_by_alternatives (exp, insn_code, insn_index)
rtx exp;
current_alternative_string = 0;
return simplify_cond (newexp, insn_code, insn_index);
}
+#endif
\f
/* An expression where all the unknown terms are EQ_ATTR tests can be
rearranged into a COND provided we can enumerate all possible
if (GET_CODE (x) == EQ_ATTR)
MEM_VOLATILE_P (x) = 1;
}
+
+ return exp;
}
/* Reduce the expression EXP based on the MEM_VOLATILE_P settings of
copy_rtx_unchanging (orig)
register rtx orig;
{
+#if 0
register rtx copy;
register RTX_CODE code;
+#endif
if (RTX_UNCHANGING_P (orig) || MEM_IN_STRUCT_P (orig))
return orig;
FILE *infile;
register int c;
struct attr_desc *attr;
- struct attr_value *av;
struct insn_def *id;
rtx tem;
int i;