HomeSort by relevance Sort by last modified time
    Searched refs:IBB (Results 1 - 5 of 5) sorted by null

  /external/llvm/lib/Transforms/Scalar/
GlobalMerge.cpp 221 for (Function::iterator IBB = IFn->begin(), IEndBB = IFn->end();
222 IBB != IEndBB; ++IBB) {
224 const InvokeInst *II = dyn_cast<InvokeInst>(IBB->getTerminator());
  /external/llvm/lib/CodeGen/
BranchFolding.cpp 841 // Look at blocks (IBB) with multiple predecessors (PBB).
844 // to IBB, and
846 // not IBB; this may require adding back an unconditional branch to IBB
848 // Bcc IBB
852 // with a conceptual B to IBB after that, which never actually exists.
864 MachineBasicBlock *IBB = I;
875 if (PBB == IBB
    [all...]
  /external/llvm/lib/Transforms/Utils/
Local.cpp 556 BasicBlock *IBB = PN->getIncomingBlock(PI);
557 if (BBPreds.count(IBB) &&
558 BBPN->getIncomingValueForBlock(IBB) != PN->getIncomingValue(PI)) {
562 << IBB->getName() << "\n");
572 BasicBlock *IBB = PN->getIncomingBlock(PI);
573 if (BBPreds.count(IBB) && Val != PN->getIncomingValue(PI)) {
576 << "predecessor " << IBB->getName() << "\n");
    [all...]
LoopSimplify.cpp 705 BasicBlock *IBB = PN->getIncomingBlock(i);
707 if (IBB == Preheader) {
710 NewPN->addIncoming(IV, IBB);
IntegerDivision.cpp 140 BasicBlock *IBB = Builder.GetInsertBlock();
141 Function *F = IBB->getParent();

Completed in 186 milliseconds