Re: Loop dependency analysis for C programs

Way too much work for just finding the loop structure.


You may want to look at this paper:
Paul Havlak, Nesting of reducible and irreducible loops, ACM
Transactions on Programming Languages and Systems (TOPLAS), v.19 n.4,
p.557-567, July 1997


There is also a correction by Ramalingam.


Or, simpler, just take a loop at natural loops in the dragon book ;-)


-- Robert


neal wrote:
> 1. Compute dominance relation of control flow graph.
> 2. Compute dominance frontiers.
> 3. Any node which has itself as its dominance frontier is a loop head
> node. All nodes dominated by the loop head node are within a loop.
> 4. After you know which nodes are in a loop, then you can infer the
> loop index variables.
>
> Just google dominance tree or dominance frontiers, you will find the
> papers about these algorithms.
>
> Neal
>
> On Nov 29, 11:07 pm, "renjith.va...@gmail.com"
> <renjith.va...@gmail.com> wrote:
> > Hans-Peter Diettrich wrote:
> > > renjith.va...@gmail.com wrote:
> >
> > > > I am planning to do loop dependency analysis for C programs. Could you
> > > > tell me the best way to get the loop structure?
> >
> > > You want to create an "control flow graph" (CFG). ...

Return to the comp.compilers page.
Search the comp.compilers archives again.