/external/llvm/include/llvm/IR/ |
H A D | CFG.h | 88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } argument 89 inline const_pred_iterator pred_begin(const BasicBlock *BB) { argument 90 return const_pred_iterator(BB); 92 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} argument 93 inline const_pred_iterator pred_end(const BasicBlock *BB) { argument 94 return const_pred_iterator(BB, true); 237 /// Get the source BB of this iterator. 248 inline succ_iterator succ_begin(BasicBlock *BB) { argument 251 succ_begin(const BasicBlock *BB) argument 254 succ_end(BasicBlock *BB) argument 257 succ_end(const BasicBlock *BB) argument 278 getEntryNode(BasicBlock *BB) argument 291 getEntryNode(const BasicBlock *BB) argument [all...] |
H A D | InstVisitor.h | 105 void visit(BasicBlock &BB) { argument 106 static_cast<SubClass*>(this)->visitBasicBlock(BB); 107 visit(BB.begin(), BB.end()); 113 void visit(BasicBlock *BB) { visit(*BB); } argument 143 void visitBasicBlock(BasicBlock &BB) {} argument
|
/external/llvm/lib/Analysis/ |
H A D | AliasAnalysis.cpp | 399 BasicBlock *BB = I->getParent(); variable 402 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) 415 BasicBlock *BB = I->getParent(); variable 417 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) 519 bool AliasAnalysis::canBasicBlockModify(const BasicBlock &BB, argument 521 return canInstructionRangeModify(BB.front(), BB.back(), Loc);
|
H A D | BranchProbabilityInfo.cpp | 117 static uint32_t getMaxWeightFor(BasicBlock *BB) { argument 118 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); 126 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { argument 127 TerminatorInst *TI = BB->getTerminator(); 130 PostDominatedByUnreachable.insert(BB); 137 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { 147 PostDominatedByUnreachable.insert(BB); 159 setEdgeWeight(BB, *I, UnreachableWeight); 169 setEdgeWeight(BB, * 176 calcMetadataWeights(BasicBlock *BB) argument 220 calcColdCallHeuristics(BasicBlock *BB) argument 275 calcPointerHeuristics(BasicBlock *BB) argument 308 calcLoopBranchHeuristics(BasicBlock *BB) argument 365 calcZeroHeuristics(BasicBlock *BB) argument 439 calcFloatingPointHeuristics(BasicBlock *BB) argument 475 calcInvokeHeuristics(BasicBlock *BB) argument [all...] |
H A D | LoopInfo.cpp | 180 BasicBlock *BB = *BI; local 181 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;++I) 192 if (UserBB != BB && 299 for (block_iterator BB = block_begin(), BE = block_end(); BB != BE; ++BB) { 300 for (BasicBlock::iterator II = (*BB)->begin(), EE = (*BB)->end(); 448 Loop *getNearestLoop(BasicBlock *BB, Loo 545 getNearestLoop(BasicBlock *BB, Loop *BBLoop) argument [all...] |
/external/llvm/lib/CodeGen/ |
H A D | BasicTargetTransformInfo.cpp | 237 BasicBlock *BB = *I; local 239 for (BasicBlock::iterator J = BB->begin(), JE = BB->end(); J != JE; ++J)
|
H A D | MachineCSE.cpp | 385 MachineBasicBlock *BB = MI->getParent(); local 386 if (CSBB != BB && !CSBB->isSuccessor(BB)) 415 // it unless the defined value is already used in the BB of the new use.
|
H A D | MachineSSAUpdater.cpp | 64 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { 65 return getAvailableVals(AV).count(BB); 70 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { argument 71 getAvailableVals(AV)[BB] = V; 76 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { argument 77 return GetValueAtEndOfBlockInternal(BB); 81 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, argument 83 if (BB->empty()) 86 MachineBasicBlock::iterator I = BB->begin(); 93 while (I != BB 114 InsertNewDef(unsigned Opcode, MachineBasicBlock *BB, MachineBasicBlock::iterator I, const TargetRegisterClass *RC, MachineRegisterInfo *MRI, const TargetInstrInfo *TII) argument 142 GetValueInMiddleOfBlock(MachineBasicBlock *BB) argument 246 BlkSucc_begin(BlkT *BB) argument 247 BlkSucc_end(BlkT *BB) argument 276 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument 285 GetUndefVal(MachineBasicBlock *BB, MachineSSAUpdater *Updater) argument 297 CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, MachineSSAUpdater *Updater) argument 349 GetValueAtEndOfBlockInternal(MachineBasicBlock *BB) argument [all...] |
H A D | PostRASchedulerList.cpp | 127 /// The index in BB of RegionEnd. 145 void startBlock(MachineBasicBlock *BB) override; 147 // Set the index of RegionEnd within the current BB. 300 << ":BB#" << MBB->getNumber() << " ***\n"; 353 void SchedulePostRATDList::startBlock(MachineBasicBlock *BB) { argument 355 ScheduleDAGInstrs::startBlock(BB); 360 AntiDepBreak->StartBlock(BB); 641 BB->splice(RegionEnd, BB, FirstDbgValue); 646 BB [all...] |
H A D | PrologEpilogInserter.cpp | 205 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) 206 for (MachineBasicBlock::iterator I = BB->begin(); I != BB->end(); ++I) 724 MachineBasicBlock *BB = *DFI; local 725 replaceFrameIndices(BB, Fn, SPAdj); 726 SPState[BB->getNumber()] = SPAdj; 730 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB ! 739 replaceFrameIndices(MachineBasicBlock *BB, MachineFunction &Fn, int &SPAdj) argument [all...] |
H A D | SjLjEHPrepare.cpp | 138 /// MarkBlocksLiveIn - Insert BB and all of its predescessors into LiveBBs until 140 static void MarkBlocksLiveIn(BasicBlock *BB, argument 142 if (!LiveBBs.insert(BB)) 145 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 288 for (Function::iterator BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) { 289 for (BasicBlock::iterator II = BB->begin(), IIE = BB [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | FunctionLoweringInfo.cpp | 50 const BasicBlock *BB = I->getParent(); local 52 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U)) 76 Function::const_iterator BB = Fn->begin(), EB = Fn->end(); local 77 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I) 99 for (; BB != EB; ++BB) 100 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); 181 for (BB [all...] |
/external/llvm/lib/ExecutionEngine/MCJIT/ |
H A D | MCJIT.cpp | 258 void *MCJIT::getPointerToBasicBlock(BasicBlock *BB) { argument
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonCopyToCombine.cpp | 358 HexagonCopyToCombine::findPotentialNewifiableTFRs(MachineBasicBlock &BB) { argument 360 for (MachineBasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) { 562 MachineBasicBlock *BB = InsertPt->getParent(); local 566 BuildMI(*BB, InsertPt, DL, TII->get(Hexagon::COMBINE_Ii), DoubleDestReg) 573 BuildMI(*BB, InsertPt, DL, TII->get(Hexagon::COMBINE_iI_V4), DoubleDestReg) 583 BuildMI(*BB, InsertPt, DL, TII->get(Hexagon::COMBINE_Ii), DoubleDestReg) 591 BuildMI(*BB, InsertPt, DL, TII->get(Hexagon::COMBINE_iI_V4), DoubleDestReg) 599 BuildMI(*BB, InsertPt, DL, TII->get(Hexagon::COMBINE_Ii), DoubleDestReg) 612 MachineBasicBlock *BB local 637 MachineBasicBlock *BB = InsertPt->getParent(); local 665 MachineBasicBlock *BB = InsertPt->getParent(); local [all...] |
/external/llvm/lib/Target/Mips/ |
H A D | Mips16HardFloat.cpp | 25 (LLVMContext &C, StringRef AsmString, BasicBlock *BB ) { 35 CallInst::Create(IA, AsmArgs, "", BB); 42 BasicBlock *BB; member in class:__anon26045::InlineAsmHelper 45 C(C_), BB(BB_) { 49 inlineAsmOut(C, AsmString, BB); 272 BasicBlock *BB = BasicBlock::Create(Context, "entry", FStub); local 273 InlineAsmHelper IAH(Context, BB); 328 new UnreachableInst(Context, BB); 370 for (Function::iterator BB = F.begin(), E = F.end(); BB ! 459 BasicBlock *BB = BasicBlock::Create(Context, "entry", FStub); local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantHoisting.cpp | 249 BasicBlock *BB, *BB1, *BB2; local 252 BB = DT->findNearestCommonDominator(BB1, BB2); 253 if (BB == Entry) 257 BBs.insert(BB); 364 for (Function::iterator BB : Fn) 365 for (BasicBlock::iterator Inst : *BB) 475 << " + " << *Offset << ") in BB " 545 DEBUG(dbgs() << "Hoist constant (" << *ConstInfo.BaseConstant << ") to BB "
|
H A D | DeadStoreElimination.cpp | 77 bool runOnBasicBlock(BasicBlock &BB); 79 bool handleEndBlock(BasicBlock &BB); 493 bool DSE::runOnBasicBlock(BasicBlock &BB) { argument 496 // Do a top-down walk on the BB. 497 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { 533 BBI = BB.begin(); 534 else if (BBI != BB.begin()) // Revisit this instruction if possible. 584 if (BBI != BB.begin()) 623 if (DepWrite == &BB 643 FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, BasicBlock *BB, DominatorTree *DT) argument 667 BasicBlock *BB = Blocks.pop_back_val(); local 712 handleEndBlock(BasicBlock &BB) argument [all...] |
H A D | EarlyCSE.cpp | 401 BasicBlock *BB = Node->getBlock(); local 409 if (!BB->getSinglePredecessor()) 422 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | CloneFunction.cpp | 38 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB, argument 42 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F); 43 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix); 48 for (BasicBlock::const_iterator II = BB->begin(), IE = BB->end(); 69 BB != &BB->getParent()->getEntryBlock(); 121 const BasicBlock &BB = *BI; local 124 BasicBlock *CBB = CloneBasicBlock(&BB, VMa 284 CloneBlock(const BasicBlock *BB, std::vector<const BasicBlock*> &ToClone) argument 442 const BasicBlock *BB = CloneWorklist.back(); local [all...] |
H A D | LoopSimplify.cpp | 89 // block that neighbors a BB actually in the loop. 198 BasicBlock *BB = Worklist.pop_back_val(); local 199 if (Blocks.insert(BB).second && BB != StopBlock) 200 // If BB is not already processed and it is not a stop block then 202 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 337 BasicBlock *BB = L->getBlocks()[i]; local 338 if (!BlocksInL.count(BB)) { 340 L->removeBlockFromLoop(BB); [all...] |
H A D | LowerSwitch.cpp | 56 BasicBlock* BB; member in struct:__anon26356::LowerSwitch::CaseRange 60 Low(low), High(high), BB(bb) { } 152 return Begin->BB; 266 BasicBlock* Succ = Leaf.BB; 305 BasicBlock* nextBB = J->BB; 306 BasicBlock* currentBB = I->BB;
|
/external/llvm/unittests/ExecutionEngine/MCJIT/ |
H A D | MCJITTestBase.h | 55 BasicBlock *BB = BasicBlock::Create(Context, Name, Result); local 56 Builder.SetInsertPoint(BB);
|
/external/llvm/unittests/IR/ |
H A D | LegacyPassManagerTest.cpp | 254 virtual bool runOnBasicBlock(BasicBlock &BB) { argument
|
/external/llvm/unittests/Transforms/Utils/ |
H A D | Cloning.cpp | 161 BasicBlock *BB = BasicBlock::Create(context, "", F1); local 162 IRBuilder<> Builder(BB); 189 BasicBlock *BB = BasicBlock::Create(context, "", F1); local 190 IRBuilder<> Builder(BB);
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 115 bool contains(const BlockT *BB) const { 116 return DenseBlockSet.count(BB); 154 bool isLoopExiting(const BlockT *BB) const { 157 BlockTraits::child_begin(BB), 158 SE = BlockTraits::child_end(BB); SI != SE; ++SI) { 288 void addBlockEntry(BlockT *BB) { argument 289 Blocks.push_back(BB); 290 DenseBlockSet.insert(BB); 303 /// moveToHeader - This method is used to move BB (which must be part of this 306 void moveToHeader(BlockT *BB) { argument 321 removeBlockFromLoop(BlockT *BB) argument 336 LoopBase(BlockT *BB) argument 483 Loop(BasicBlock *BB) argument 567 changeLoopFor(BlockT *BB, LoopT *L) argument 597 removeBlock(BlockT *BB) argument 700 changeLoopFor(BasicBlock *BB, Loop *L) argument 719 removeBlock(BasicBlock *BB) argument [all...] |