search for: getuniquepredecessor

.../that has only one predecessor and has an unconditional branch to the > +    //loop header > +    if (BrFirstSucc && BrFirstSucc->isUnconditional() && > +        BrFirstSucc->getSuccessor(0) == L->getHeader() && > +        BrFirstSucc->getParent()->getUniquePredecessor()) > +      Ok = true; > +    if (BrSecondSucc && BrSecondSucc->isUnconditional() && > +        BrSecondSucc->getSuccessor(0) == L->getHeader() && > +        BrSecondSucc->getParent()->getUniquePredecessor()) > +      Ok = true; > +     // Th...

...he is a block + //that has only one predecessor and has an unconditional branch to the + //loop header + if (BrFirstSucc && BrFirstSucc->isUnconditional() && + BrFirstSucc->getSuccessor(0) == L->getHeader() && + BrFirstSucc->getParent()->getUniquePredecessor()) + Ok = true; + if (BrSecondSucc && BrSecondSucc->isUnconditional() && + BrSecondSucc->getSuccessor(0) == L->getHeader() && + BrSecondSucc->getParent()->getUniquePredecessor()) + Ok = true; + // The simple checks failed, try cl...

...ional branch to >> > the >> > +    //loop header >> > +    if (BrFirstSucc && BrFirstSucc->isUnconditional() && >> > +        BrFirstSucc->getSuccessor(0) == L->getHeader() && >> > +        BrFirstSucc->getParent()->getUniquePredecessor()) >> > +      Ok = true; >> > +    if (BrSecondSucc && BrSecondSucc->isUnconditional() && >> > +        BrSecondSucc->getSuccessor(0) == L->getHeader() && >> > +        BrSecondSucc->getParent()->getUniquePredecessor()) &gt...

...essor and has an unconditional branch to > the > > + //loop header > > + if (BrFirstSucc && BrFirstSucc->isUnconditional() && > > + BrFirstSucc->getSuccessor(0) == L->getHeader() && > > + BrFirstSucc->getParent()->getUniquePredecessor()) > > + Ok = true; > > + if (BrSecondSucc && BrSecondSucc->isUnconditional() && > > + BrSecondSucc->getSuccessor(0) == L->getHeader() && > > + BrSecondSucc->getParent()->getUniquePredecessor()) > > + Ok...

...t;> >> > +    //loop header >> >> > +    if (BrFirstSucc && BrFirstSucc->isUnconditional() && >> >> > +        BrFirstSucc->getSuccessor(0) == L->getHeader() && >> >> > +        BrFirstSucc->getParent()->getUniquePredecessor()) >> >> > +      Ok = true; >> >> > +    if (BrSecondSucc && BrSecondSucc->isUnconditional() && >> >> > +        BrSecondSucc->getSuccessor(0) == L->getHeader() && >> >> > +        BrSecondSucc->getPare...

Hello, I'm finding problems with BackEdgeTaken count calculation in even simple fortran loops with gfortran-4.6 + DragonEgg 3.0. Even for simple double loops like this one: program test2 integer i,j,k dimension k(100,100) do j=1,100 do i=1,100 k(i,j) = i enddo enddo write(*,*) k(1,30) end make the ScalarEvolution

...> > the > >> > + //loop header > >> > + if (BrFirstSucc && BrFirstSucc->isUnconditional() && > >> > + BrFirstSucc->getSuccessor(0) == L->getHeader() && > >> > + BrFirstSucc->getParent()->getUniquePredecessor()) > >> > + Ok = true; > >> > + if (BrSecondSucc && BrSecondSucc->isUnconditional() && > >> > + BrSecondSucc->getSuccessor(0) == L->getHeader() && > >> > + BrSecondSucc->getParent()->getUniq...

...gt; > +    //loop header >>> >> > +    if (BrFirstSucc && BrFirstSucc->isUnconditional() && >>> >> > +        BrFirstSucc->getSuccessor(0) == L->getHeader() && >>> >> > +        BrFirstSucc->getParent()->getUniquePredecessor()) >>> >> > +      Ok = true; >>> >> > +    if (BrSecondSucc && BrSecondSucc->isUnconditional() && >>> >> > +        BrSecondSucc->getSuccessor(0) == L->getHeader() && >>> >> > +        BrSecond...

... //loop header >>>> >> > +    if (BrFirstSucc && BrFirstSucc->isUnconditional() && >>>> >> > +        BrFirstSucc->getSuccessor(0) == L->getHeader() && >>>> >> > +        BrFirstSucc->getParent()->getUniquePredecessor()) >>>> >> > +      Ok = true; >>>> >> > +    if (BrSecondSucc && BrSecondSucc->isUnconditional() && >>>> >> > +        BrSecondSucc->getSuccessor(0) == L->getHeader() && >>>> >> > +...

How can I get list of its predecessor basic blocks from a basic block? --Rajwinder Singh -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100625/21c52063/attachment.html>