This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Dominator opts fixes and enhancements
- From: Diego Novillo <dnovillo at redhat dot com>
- To: Jeff Law <law at redhat dot com>
- Cc: Andrew Macleod <amacleod at redhat dot com>, gcc-patches <gcc-patches at gcc dot gnu dot org>
- Date: Mon, 25 Aug 2003 10:43:41 -0400
- Subject: Re: [tree-ssa] Dominator opts fixes and enhancements
- Organization: Red Hat Canada
- References: <200308251439.h7PEdLjc027672@speedy.slc.redhat.com>
On Mon, 2003-08-25 at 10:39, law@redhat.com wrote:
> In message <1061821474.27406.69.camel@frodo.toronto.redhat.com>, Diego Novillo
> writes:
> >We do not build the tree CFG with multiple entry points in mind. So,
> >ENTRY_BLOCK_PTR always has exactly one successor: basic block 0.
> Well, it's not terribly hard to change any code which makes that
> assumption to do something like
>
> for (e = ENTRY_BLOCK_PTR->succ; e; e = e->succ_next)
> do something (e->dest)
>
Absolutely.
> Now reality is without input code which exercises
> multiple entry points odds are some places still need to be converted.
>
Yup. Having test code would help.
Diego.