/external/llvm/lib/Transforms/Utils/ |
BasicBlockUtils.cpp | 35 void llvm::DeleteDeadBlock(BasicBlock *BB) { 36 assert((pred_begin(BB) == pred_end(BB) || 38 BB->getSinglePredecessor() == BB) && "Block is not dead!"); 39 TerminatorInst *BBTerm = BB->getTerminator(); 44 BBTerm->getSuccessor(i)->removePredecessor(BB); 47 while (!BB->empty()) { 48 Instruction &I = BB->back(); 56 BB->getInstList().pop_back() [all...] |
CloneFunction.cpp | 34 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB, 38 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F); 39 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix); 44 for (BasicBlock::const_iterator II = BB->begin(), IE = BB->end(); 63 CodeInfo->ContainsUnwinds |= isa<UnwindInst>(BB->getTerminator()); 66 BB != &BB->getParent()->getEntryBlock(); 112 const BasicBlock &BB = *BI [all...] |
LowerSwitch.cpp | 52 BasicBlock* BB; 54 CaseRange(Constant *low = 0, Constant *high = 0, BasicBlock *bb = 0) : 55 Low(low), High(high), BB(bb) { } 213 BasicBlock* Succ = Leaf.BB; 251 BasicBlock* nextBB = J->BB; 252 BasicBlock* currentBB = I->BB;
|
CodeExtractor.cpp | 212 BasicBlock *BB = *ci; 214 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) { 231 TerminatorInst *TI = BB->getTerminator(); 360 static BasicBlock* FindPhiPredForUseInBlock(Value* Used, BasicBlock* BB) { 364 if (P && P->getParent() == BB) 763 for (ArrayRef<BasicBlock*>::iterator BB = code.begin(), e=code.end(); 764 BB != e; ++BB) 765 for (BasicBlock::const_iterator I = (*BB)->begin(), Ie = (*BB)->end() [all...] |
Local.cpp | 54 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions) { 55 TerminatorInst *T = BB->getTerminator(); 76 OldDest->removePredecessor(BB); 148 BasicBlock *BB = SI->getParent(); 157 Succ->removePredecessor(BB); 185 // indirectbr blockaddress(@F, @BB) -> br label @BB 207 BB->getTerminator()->eraseFromParent(); 208 new UnreachableInst(BB->getContext(), BB); [all...] |
LoopSimplify.cpp | 149 for (Loop::block_iterator BB = L->block_begin(), E = L->block_end(); 150 BB != E; ++BB) { 151 if (*BB == L->getHeader()) continue; 154 for (pred_iterator PI = pred_begin(*BB), 155 PE = pred_end(*BB); PI != PE; ++PI) { 441 BasicBlock *BB = WorkList.back(); WorkList.pop_back(); 442 if (Blocks.insert(BB).second && BB != StopBlock) 443 // If BB is not already processed and it is not a stop block the [all...] |
SSAUpdater.cpp | 58 bool SSAUpdater::HasValueForBlock(BasicBlock *BB) const { 59 return getAvailableVals(AV).count(BB); 64 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) { 68 getAvailableVals(AV)[BB] = V; 91 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) { 92 Value *Res = GetValueAtEndOfBlockInternal(BB); 101 /// 'use' in BB. Consider code like this: 115 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) { 118 if (!HasValueForBlock(BB)) 119 return GetValueAtEndOfBlock(BB); [all...] |
/external/llvm/lib/VMCore/ |
Metadata.cpp | 123 BasicBlock *BB = I->getParent(); 124 return BB ? BB->getParent() : 0; 128 if (BasicBlock *BB = dyn_cast<BasicBlock>(V)) 129 return BB->getParent();
|
AutoUpgrade.cpp | 426 static void FindExnAndSelIntrinsics(BasicBlock *BB, CallInst *&Exn, 429 if (!Visited.insert(BB)) return; 432 I = BB->begin(), E = BB->end(); I != E; ++I) { 452 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 536 BasicBlock *BB = &*II; 537 InvokeInst *Inst = dyn_cast<InvokeInst>(BB->getTerminator()); 649 BasicBlock *BB = Resume->getParent(); 652 Builder.SetInsertPoint(BB, Resume) [all...] |
/external/llvm/tools/bugpoint/ |
ExtractFunction.cpp | 69 Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB 339 BasicBlock *BB = *I; 340 // If the BB doesn't have a name, give it one so we have something to key 342 if (!BB->hasName()) BB->setName("tmpbb"); 343 BlocksToNotExtractFile.os() << BB->getParent()->getNameStr() << " " 344 << BB->getName() << "\n";
|
Miscompilation.cpp | 488 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[i]]); 489 BBsOnClone.push_back(BB); 794 BasicBlock *BB = BasicBlock::Create(Safe->getContext(), "entry", newMain); 795 CallInst *call = CallInst::Create(oldMainProto, args, "", BB); 798 ReturnInst::Create(Safe->getContext(), call, BB); [all...] |
/frameworks/compile/slang/ |
slang_rs_backend.cpp | 357 llvm::BasicBlock *BB = 359 llvm::IRBuilder<> *IB = new llvm::IRBuilder<>(BB);
|
/external/llvm/include/llvm/Analysis/ |
MemoryDependenceAnalysis.h | 189 /// each BasicBlock (the BB entry) it keeps a MemDepResult. 191 BasicBlock *BB; 194 NonLocalDepEntry(BasicBlock *bb, MemDepResult result) 195 : BB(bb), Result(result) {} 198 NonLocalDepEntry(BasicBlock *bb) : BB(bb) {} 200 // BB is the sort key, it can't be changed. 201 BasicBlock *getBB() const { return BB; } [all...] |
LoopInfo.h | 112 bool contains(const BlockT *BB) const { 113 return std::find(block_begin(), block_end(), BB) != block_end(); 146 bool isLoopExiting(const BlockT *BB) const { 149 BlockTraits::child_begin(const_cast<BlockT*>(BB)), 150 SE = BlockTraits::child_end(const_cast<BlockT*>(BB)); SI != SE; ++SI) { 388 void addBlockEntry(BlockT *BB) { 389 Blocks.push_back(BB); 392 /// moveToHeader - This method is used to move BB (which must be part of this 395 void moveToHeader(BlockT *BB) { 396 if (Blocks[0] == BB) return [all...] |
/external/llvm/lib/Analysis/ |
BranchProbabilityInfo.cpp | 86 // Return TRUE if BB leads directly to a Return Instruction. 87 static bool isReturningBlock(BasicBlock *BB) { 91 TerminatorInst *TI = BB->getTerminator(); 102 Visited.insert(BB); 103 BB = TI->getSuccessor(0); 106 if (Visited.count(BB)) 113 uint32_t getMaxWeightFor(BasicBlock *BB) const { 114 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); 123 bool calcMetadataWeights(BasicBlock *BB); 126 bool calcReturnHeuristics(BasicBlock *BB); [all...] |
Lint.cpp | 573 BasicBlock *BB = L->getParent(); 576 if (!VisitedBlocks.insert(BB)) break; 578 BB, BBI, 6, AA)) 580 if (BBI != BB->begin()) break; 581 BB = BB->getUniquePredecessor(); 582 if (!BB) break; 583 BBI = BB->end();
|
LazyValueInfo.cpp | 383 BasicBlock *BB; 388 : Parent(P), Val(V), BB(B), BBLV(LV) { } 392 Parent->OverDefinedCache.insert(std::make_pair(BB, Val)); 399 LVILatticeVal getBlockValue(Value *Val, BasicBlock *BB); 402 bool hasBlockValue(Value *Val, BasicBlock *BB); 407 bool solveBlockValue(Value *Val, BasicBlock *BB); 409 Value *Val, BasicBlock *BB); 411 PHINode *PN, BasicBlock *BB); 413 Instruction *BBI, BasicBlock *BB); 424 LVILatticeVal getValueInBlock(Value *V, BasicBlock *BB); [all...] |
MemoryDependenceAnalysis.cpp | 193 BasicBlock::iterator ScanIt, BasicBlock *BB) { 197 while (ScanIt != BB->begin()) { 239 if (BB != &BB->getParent()->getEntryBlock()) 340 BasicBlock::iterator ScanIt, BasicBlock *BB) { 348 while (ScanIt != BB->begin()) { 500 if (BB != &BB->getParent()->getEntryBlock()) 751 /// GetNonLocalInfoForBlock - Compute the memdep value for BB with 757 bool isLoad, BasicBlock *BB, [all...] |
/external/llvm/lib/CodeGen/ |
DwarfEHPrepare.cpp | 72 Instruction *CreateExceptionValueCall(BasicBlock *BB); 594 Function::iterator BB = F->begin(); 595 for (Function::iterator BE = F->end(); BB != BE; ++BB) { 597 if (LandingPads.count(BB)) 600 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end(); 624 for (Function::iterator BE = F->end(); BB != BE; ++BB) { 626 if (LandingPads.count(BB)) [all...] |
MachineCSE.cpp | 292 MachineBasicBlock *BB = MI->getParent(); 293 if (CSBB != BB && !CSBB->isSuccessor(BB)) 324 // it unless the defined value is already used in the BB of the new use.
|
/external/llvm/lib/Transforms/IPO/ |
ArgumentPromotion.cpp | 463 BasicBlock *BB = Load->getParent(); 466 if (AA.canInstructionRangeModify(BB->front(), *Load, Loc)) 472 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LICM.cpp | 132 bool inSubLoop(BasicBlock *BB) { 133 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop"); 134 return LI->getLoopFor(BB) != CurLoop; 225 BasicBlock *BB = *I; 226 if (LI->getLoopFor(BB) == L) // Ignore blocks in subloops. 227 CurAST->add(*BB); // Incorporate the specified basic block 275 BasicBlock *BB = N->getBlock(); 278 if (!CurLoop->contains(BB)) return; 287 if (inSubLoop(BB)) return [all...] |
/external/clang/lib/CodeGen/ |
CodeGenFunction.cpp | 140 static void EmitIfUsed(CodeGenFunction &CGF, llvm::BasicBlock *BB) { 141 if (!BB) return; 142 if (!BB->use_empty()) 143 return CGF.CurFn->getBasicBlockList().push_back(BB); 144 delete BB; 782 llvm::BasicBlock *BB = getJumpDestForLabel(L).getBlock(); 785 IndirectBranch->addDestination(BB); 786 return llvm::BlockAddress::get(CurFn, BB); [all...] |
/external/clang/test/SemaCXX/ |
overloaded-operator.cpp | 264 struct BB : AA {}; 265 bool x(BB y, BB z) { return y != z; }
|
/external/llvm/include/llvm/CodeGen/ |
MachineBasicBlock.h | 65 const BasicBlock *BB; 100 explicit MachineBasicBlock(MachineFunction &mf, const BasicBlock *bb); 112 const BasicBlock *getBasicBlock() const { return BB; } 473 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; } 486 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
|