{
char *free_point = (char *) oballoc (1);
rtx reg = gen_rtx (REG, word_mode, 0);
- rtx pow2 = GEN_INT (32);
- rtx lea;
- int i;
add_cost = rtx_cost (gen_rtx (PLUS, word_mode, reg, reg), SET);
{
register rtx insn;
register int i;
- rtx end;
rtx last_insn;
loop_dump_stream = dumpfile;
{
register struct movable *m1;
int regno = m->regno;
- rtx reg_note, reg_note1;
bzero (matched_regs, nregs);
matched_regs[regno] = 1;
{
struct iv_class *bl;
rtx final_value = 0;
- rtx tem;
bl = reg_biv_class[REGNO (v->src_reg)];
rtx jump_label;
rtx final_value;
rtx start_value;
- enum rtx_code branch_code;
rtx new_add_val;
rtx comparison;
rtx before_comparison;
|| (bl->giv_count + bl->biv_count + num_mem_sets
+ num_movables + 2 == insn_count)))
{
- rtx condition = get_condition_for_loop (PREV_INSN (loop_end));
- int win;
rtx tem;
/* Loop can be reversed. */
int threshold, insn_count;
{
rtx reg = bl->biv->dest_reg;
- rtx p, set;
- struct induction *v;
+ rtx p;
/* Scan all insns in the loop, stopping if we find one that uses the
biv in a way that we cannot eliminate. */