search for: brfirstsucc

Displaying 9 results from an estimated 9 matches for "brfirstsucc".

[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 08
2
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...t; single exit) >   BranchInst *ExitBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); > + >   if (ExitBr == 0) return getCouldNotCompute(); >   assert(ExitBr->isConditional() && "If unconditional, it can't be in loop!"); > > +  BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> > +                                            getSuccessor(0)->getTerminator()); > +  BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> > +                                            getSuccessor(1)->getTerminator()); > + &...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 08
2
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...lution.cpp @@ -4293,6 +4293,11 @@ ScalarEvolution::ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock) { // // FIXME: we should be able to handle switch instructions (with a single exit) BranchInst *ExitBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); + BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> + getSuccessor(0)->getTerminator()); + BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> + getSuccessor(1)->getTerminator()); + if (ExitBr == 0) r...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 08
0
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...switch instructions (with a single exit) BranchInst *ExitBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); + if (ExitBr == 0) return getCouldNotCompute(); assert(ExitBr->isConditional() && "If unconditional, it can't be in loop!"); + BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> + getSuccessor(0)->getTerminator()); + BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> + getSuccessor(1)->getTerminator()); + // At this point,...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 08
2
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...nchInst>(ExitingBlock->getTerminator()); >> > + >> >   if (ExitBr == 0) return getCouldNotCompute(); >> >   assert(ExitBr->isConditional() && "If unconditional, it can't be in >> > loop!"); >> > >> > +  BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> >> > + >> >  getSuccessor(0)->getTerminator()); >> > +  BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> >> > + >> >  getSuccessor(1)->getTerminator()); >> > + >> >   // At...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 08
0
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...ExitBr = > dyn_cast<BranchInst>(ExitingBlock->getTerminator()); > > + > > if (ExitBr == 0) return getCouldNotCompute(); > > assert(ExitBr->isConditional() && "If unconditional, it can't be in > loop!"); > > > > + BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> > > + > getSuccessor(0)->getTerminator()); > > + BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> > > + > getSuccessor(1)->getTerminator()); > > + > > // At this point, we know we have a conditi...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 09
2
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...; >> > + >> >> >   if (ExitBr == 0) return getCouldNotCompute(); >> >> >   assert(ExitBr->isConditional() && "If unconditional, it can't be in >> >> > loop!"); >> >> > >> >> > +  BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> >> >> > + >> >> >  getSuccessor(0)->getTerminator()); >> >> > +  BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> >> >> > + >> >> >  getSuccessor(1)->getTermina...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 08
0
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...etTerminator()); > >> > + > >> > if (ExitBr == 0) return getCouldNotCompute(); > >> > assert(ExitBr->isConditional() && "If unconditional, it can't be in > >> > loop!"); > >> > > >> > + BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> > >> > + > >> > getSuccessor(0)->getTerminator()); > >> > + BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> > >> > + > >> > getSuccessor(1)->getTerminator()); > >&gt...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 09
0
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...t;>> >> >   if (ExitBr == 0) return getCouldNotCompute(); >>> >> >   assert(ExitBr->isConditional() && "If unconditional, it can't be in >>> >> > loop!"); >>> >> > >>> >> > +  BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> >>> >> > + >>> >> >  getSuccessor(0)->getTerminator()); >>> >> > +  BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> >>> >> > + >>> >> >  getSuccess...
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
2012 Feb 09
1
[LLVMdev] BackedgeTakenCount calculation for fortran loops and DragonEgg gfortran-4.6
...gt; >   if (ExitBr == 0) return getCouldNotCompute(); >>>> >> >   assert(ExitBr->isConditional() && "If unconditional, it can't be in >>>> >> > loop!"); >>>> >> > >>>> >> > +  BranchInst* BrFirstSucc = dyn_cast<BranchInst>(ExitBr-> >>>> >> > + >>>> >> >  getSuccessor(0)->getTerminator()); >>>> >> > +  BranchInst* BrSecondSucc = dyn_cast<BranchInst>(ExitBr-> >>>> >> > + >>>> >&...