On Wed, 31 Oct 2012, Jan Hubicka wrote:
> >
> > visited is a poor name for a map ...
> Hmm, visited_with_priority?
Just block_priority?
Richard.
> Thanks,
> Honza
> >
> > Otherwise looks ok.
> >
> > Thanks,
> > Richard.
> >
> > > +
> > > + /* Perform shortest path discovery loop->header ..
>
> visited is a poor name for a map ...
Hmm, visited_with_priority?
Thanks,
Honza
>
> Otherwise looks ok.
>
> Thanks,
> Richard.
>
> > +
> > + /* Perform shortest path discovery loop->header ... loop->latch.
> > +
> > + The "distance" is given by the smallest loop bound of basic block
>
On Tue, 30 Oct 2012, Jan Hubicka wrote:
> Hi,
> this patch implements the second part of planned change - to determine loop
> bounds
> based by shortest path discovery. This allows to bound number of iterations
> on loops with bounds in statements that do not dominate the latch.
>
> I originall
