|Re: How Smart Can We Afford to be? email@example.com (1992-02-24)|
|reducible loops firstname.lastname@example.org (1992-02-24)|
|Re: reducible loops email@example.com (Raul Deluth Miller-Rockwell) (1992-02-25)|
|Re: reducible loops firstname.lastname@example.org (1992-02-26)|
|Re: reducible loops email@example.com (1992-02-26)|
|Re: reducible loops firstname.lastname@example.org (1992-02-26)|
|Re: reducible loops email@example.com (1992-02-27)|
|Re: reducible loops firstname.lastname@example.org (1992-02-28)|
|[2 later articles]|
|From:||email@example.com (Preston Briggs)|
|Date:||Mon, 24 Feb 92 17:05:14 CST|
firstname.lastname@example.org (David desJardins) writes:
>I don't understand why this is a hard problem.
> Finding cycles in digraphs is certainly not a
>hard graph-theoretic problem. So what is the problem?
Well, I've left lots of pieces of the problem out. We want to find
all the loops, including loop nests, and organize them into a little
tree that shows which is contained where.
>What I thought you were going to produce, and the only case which it seems
>to me should be hard, is code in which multiple cycles are intertwined
>with one another. In this case it may indeed be hard to find the "real
if (condition a) then
if (condition b) then
>Now there are two cycles, (ABC) and (BDE), intertwined, and optimizing
>both simultaneously seems a hard problem.
Most techniques would say this is is a loop nest with 2 loops, ABCDE and BDE.
BDE is just an inner loop, contained entirely within the larger ABCDE.
Surprised? I was.
Return to the
Search the comp.compilers archives again.