On Thursday 29 September 2005 17:29, Segher Boessenkool wrote:
> >int f(int *);
> >int verbosity;
> >int *arr;
> >int last;
> >
> >void g ()
> >{
> > int i;
> > if (last < 4000) {
> > if (verbosity >= 4) f(&verbosity);
> > for (i = 0; i <= last;
int f(int *);
int verbosity;
int *arr;
int last;
void g ()
{
int i;
if (last < 4000) {
if (verbosity >= 4) f(&verbosity);
for (i = 0; i <= last; i++) arr[i] = i;
}
}
If last != 0, arr+i cannot point to last for any i,
as last is not part
On Monday 26 September 2005 10:38, Paolo Bonzini wrote:
> Right now, I am thinking more
> about shuffling the pass order. One possibility that comes to mind is
> GCSE+fwprop+CSE, where GCSE could work out the common code for loading
> the address, and fwprop/CSE could do the addressing mode select
The only big regression for fwprop on PPC is bzip2. I've distilled it
to this small testcase:
int f(int *);
int verbosity;
int *arr;
int last;
void g ()
{
int i;
if (last < 4000) {
if (verbosity >= 4) f(&verbosity);
for (i = 0; i <= last; i++) ar
