search for: isunconditional

...   for (BasicBlock *BB = ExitBr->getParent(); BB; ) { > +    //Check if the one of the successor of the exit branch has the 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->...

...ExitBr->getSuccessor(1) != L->getHeader() && - ExitBr->getParent() != L->getHeader()) { - // The simple checks failed, try climbing the unique predecessor chain + ExitBr->getParent() != L->getHeader() && + !((BrFirstSucc && BrFirstSucc->isUnconditional() && + BrFirstSucc->getSuccessor(0) == L->getHeader()) || + (BrSecondSucc && BrSecondSucc->isUnconditional() && + BrSecondSucc->getSuccessor(0) == L->getHeader())) ) { + // The simple checks failed, try climbing the unique predecesso...

...bool Ok = false; - for (BasicBlock *BB = ExitBr->getParent(); BB; ) { + //Check if the one of the successor of the exit branch has the 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->...

...t; > +    //Check if the one of the successor of the exit branch has the 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() &&...

...Br->getParent(); BB; ) { > > + //Check if the one of the successor of the exit branch has the 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() && > > +...

...t; > 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 && BrSec...

...the successor of the exit branch has the > 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->isUn...

...; >> > 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...

...k >>>> >> > +    //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; >>>> >> > +    i...

...or/last instruction of BasicBlock if(isa<BranchInst>(bi)) { BranchInst *brInst = cast<BranchInst>(bi); // We are interested in conditional branch only if(brInst->isUnconditional()) continue; Value *condRes = brInst->getCondition(); errs()<<"Type:"<<condRes->getType()->getDescription()<<"\n"; // Looking for a function in Module Symbol table Cons...

...lock::iterator bi = fi->end(); > > bi--; // Getting the terminator/last instruction of BasicBlock > > if(isa<BranchInst>(bi)) > > { > > BranchInst *brInst = cast<BranchInst>(bi); > > // We are interested in conditional branch only > > if(brInst->isUnconditional()) continue; > > Value *condRes = brInst->getCondition(); > > errs()<<"Type:"<<condRes->getType()->getDescription()<<"\n"; > > // Looking for a function in Module Symbol table > > Constant *PrintFn = M.getOrInsertFunction("...

...               if(isa<BranchInst>(bi)) > >                     { > >                         BranchInst *brInst = cast<BranchInst>(bi); > > > >                         // We are interested in conditional branch only > >                         if(brInst->isUnconditional()) continue; > > > >                         Value *condRes = brInst->getCondition(); > > > errs()<<"Type:"<<condRes->getType()->getDescription()<<"\n"; > > > >                        // Looking for a function in Module...