Hi,
> > I'm working on decompiling x86-64 binary programs, using branches to rebuild
> > a control-flow graph and looking for loops. I've found a significant number
> > of irreducible loops in gcc-produced code (irreducible loops are loops with
> > more than one entry point), especially in -O3 opt
On 18/08/2010 12:37, Steven Bosscher wrote:
On Wed, Aug 18, 2010 at 11:53 AM, Alain Ketterlin
wrote:
My question is: where do these irreducible loops come from? Which
optimization pass leads to irreducible regions? Thanks in advance for any
pointer.
Questions right back at you: What compi
On Wed, Aug 18, 2010 at 11:53 AM, Alain Ketterlin
wrote:
>
> I'm working on decompiling x86-64 binary programs, using branches to rebuild
> a control-flow graph and looking for loops. I've found a significant number
> of irreducible loops in gcc-produced code (irreducible loops are loops with
> mo
I'm working on decompiling x86-64 binary programs, using branches to
rebuild a control-flow graph and looking for loops. I've found a
significant number of irreducible loops in gcc-produced code
(irreducible loops are loops with more than one entry point), especially
in -O3 optimized binaries
