[LLVMdev] constructing 'for' statement from LLVM bitcode

[Sebastian Pop]

On 8/30/07, Domagoj Babic <babic.domagoj at gmail.com> wrote:
>
> I'm a bit surprised that the code took significantly more space.
>

That's because of the new conditions, and new control variables.  As
this technique transforms control flow dependences to data deps, it
depends on how many cfg edges you are redirecting via temp variables.

A nice example is when the transformed jump is from a loop to another
loop: the number of checks to the control variable is the depth from
the first loop to the common parent plus the depth for the second loop
to the parent.