On Sep 22, 2005, at 7:39 PM, Kenneth Zadeck wrote:
I will pull a patch together tomorrow. There is currently nothing
in the code for keeping the region stuff up to date as changes are
made to the cfg. For most changes this would not be hard, but for
some it is really hard.
OK. I've cod
I will pull a patch together tomorrow. There is currently nothing in
the code for keeping the region stuff up to date as changes are made to
the cfg. For most changes this would not be hard, but for some it is
really hard.
Daniel Berlin wrote:
On Thu, 2005-09-22 at 18:49 -0700, Devang Pate
On Thu, 2005-09-22 at 18:49 -0700, Devang Patel wrote:
> On Sep 22, 2005, at 2:32 AM, Steven Bosscher wrote:
>
> > On Sep 22, 2005 11:25 AM, Zdenek Dvorak
> > <[EMAIL PROTECTED]> wrote:
> >
> >>> 4. Other ideas?
> >>>
> >>
> >> Preserving the information about loops throughout the
> >> optimiz
On Sep 22, 2005, at 2:32 AM, Steven Bosscher wrote:
On Sep 22, 2005 11:25 AM, Zdenek Dvorak
<[EMAIL PROTECTED]> wrote:
4. Other ideas?
Preserving the information about loops throughout the
optimizations, and
just keeping this information attached at the loop description
would by
far
On Sep 22, 2005 11:25 AM, Zdenek Dvorak <[EMAIL PROTECTED]> wrote:
> > 4. Other ideas?
>
> Preserving the information about loops throughout the optimizations, and
> just keeping this information attached at the loop description would by
> far be the cleanest approach -- admitedly also the one tha
Hello,
> As a follow up to http://gcc.gnu.org/ml/gcc/2005-04/msg00461.html
>
> I would like to improve SMS by passing data dependencies information
> computed in tree-level to rtl-level SMS. Currently data-dependency graph
> built for use by SMS has an edge for every two data references (i.e. it'
1. Introduce a new BB bit flag and set it for the header BB of a loop that
has no data dependencies. This approach already works, but only if the old
loop optimizer (pass_loop_optimize) is disabled (otherwise the bit doesn't
survive).
Which will happen in 4.2.
One potential problem is that t
As a follow up to http://gcc.gnu.org/ml/gcc/2005-04/msg00461.html
I would like to improve SMS by passing data dependencies information
computed in tree-level to rtl-level SMS. Currently data-dependency graph
built for use by SMS has an edge for every two data references (i.e. it's
too conserva
