This is the mail archive of the
mailing list for the GCC project.
Re: [tree-ssa] RFC: Making control flow more explicit
- From: Diego Novillo <dnovillo at redhat dot com>
- To: Dorit Naishlos <DORIT at il dot ibm dot com>
- Cc: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>, "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Date: Mon, 11 Aug 2003 11:33:42 -0400
- Subject: Re: [tree-ssa] RFC: Making control flow more explicit
- Organization: Red Hat Canada
- References: <OF78BC606E.2BF46595-ONC2256D7F.00162D5C-C2256D7F.0050EA64@telaviv.ibm.com>
On Mon, 2003-08-11 at 10:43, Dorit Naishlos wrote:
> What if I want to implement an optimization that operates more easily on
> high-level constructs, but also relies on analyses that could benefit from
> SSA form?
You don't need syntactic markers for loops. We can use the loop tree
structure found by the loop discovery pass. This works directly on the
CFG and provides all the usual information one expects from loops. See
struct loops in cfgloop.h.