search for: irreducibleloopinfo

...ers/preheaders/latches, nesting levels, which blocks are part of what level of which loop etc. LoopInfo gives me everything I need for the reducible case, but I agree that it is not very convenient to make it more complicated for rather uncommon cases. I think I will implement an independent "IrreducibleLoopInfo" pass that discovers loops in the presence of multiple entries and offers an interface similar to LoopInfo (iterators, getHeaders(), getLoopFor(), ...). A question that is related: do the available SCC iterators provide nested SCCs as well or do I have to compute them manually? Regards, Ralf

On Sep 28, 2009, at 2:28 AM, Ralf Karrenberg wrote: > Hello everybody, > > I just started implementing a part of my algorithm that deals with > irreducible control-flow. > Apparently, the LoopInfo analysis does not recognize loops with > multiple > incoming edges (as of LLVM 2.5). > On the mailing list archives I found a few discussions related to > irreducible

Hello everybody, I just started implementing a part of my algorithm that deals with irreducible control-flow. Apparently, the LoopInfo analysis does not recognize loops with multiple incoming edges (as of LLVM 2.5). On the mailing list archives I found a few discussions related to irreducible control-flow, but it was never mentioned if it is planned to enhance LoopInfo to also represent such