[lno] Induction variable optimizations

[Zdenek Dvorak]

Hello,

> >Index: expr.c
> >===================================================================
> >RCS file: /cvs/gcc/gcc/gcc/expr.c,v
> >retrieving revision 1.467.2.70.2.1
> >diff -c -3 -p -r1.467.2.70.2.1 expr.c
> >*** expr.c	21 Jan 2004 01:10:26 -0000	1.467.2.70.2.1
> >--- expr.c	25 Jan 2004 20:16:35 -0000
> >*************** expand_expr_1 (tree exp, rtx target, enu
> >*** 6433,6438 ****
> >--- 6433,6441 ----
> >  	return temp;
> >        }
> >
> >+     case SSA_NAME:
> >+       return expand_expr_1 (SSA_NAME_VAR (exp), target, tmode, 
> >modifier);
> >+
> >      case PARM_DECL:
> >        if (!DECL_RTL_SET_P (exp))
> >  	{
> >
> 
> Uh, this shouldn't be necessary.
> We shouldn't have SSA_NAME's by the time we go to expand the 
> expression. rewrite_out_of_ssa should have removed it.

right; I am just letting some pieces of code to be expanded, so that I
can estimate the costs of the computations.  This of course wastes a lot
of memory and I will rewrite it into something more senseful soon.

Zdenek