[LLVMdev] constructing 'for' statement from LLVM bitcode

[Domagoj Babic]

Daniel,

On 8/30/07, Daniel Berlin <dberlin at dberlin.org> wrote:
> On 8/29/07, Domagoj Babic <babic.domagoj at gmail.com> wrote:
> > Seung,
> >
> > On 8/25/07, Chris Lattner <sabre at nondot.org> wrote:
> > > Ok.  Note that LLVM can represent irreducible loops.  You can handle
> > > this through code duplication.
> > > -Chris
> >
> >
> > If you are willing to invest more effort into a more complicated analysis,
> > in many cases you can even avoid code duplication. See this paper for
> > details:
>
> We implemented this in GCC early on in the days of GIMPLE, and while
> theoretically it removes code duplication, in practice it made the
> code take significantly more space and run slower. :)

This is good to know, I've never implemented it myself.

I'm a bit surprised that the code took significantly more space.

Cheers,

-- 
        Domagoj Babic

        http://www.domagoj.info/
        http://www.calysto.org/