/external/llvm/lib/Analysis/ |
H A D | CodeMetrics.cpp | 25 void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB, argument 29 for (BasicBlock::const_iterator II = BB->begin(), E = BB->end(); 46 if (F == BB->getParent()) 78 if (isa<ReturnInst>(BB->getTerminator())) 92 notDuplicatable |= isa<IndirectBrInst>(BB->getTerminator()); 94 // Remember NumInsts for this BB. 95 NumBBInsts[BB] = NumInsts - NumInstsBeforeThisBB;
|
H A D | InstCount.cpp | 42 void visitBasicBlock(BasicBlock &BB) { ++TotalBlocks; } argument
|
H A D | Delinearization.cpp | 93 const BasicBlock *BB = Inst->getParent(); local 96 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
|
/external/llvm/examples/ModuleMaker/ |
H A D | ModuleMaker.cpp | 42 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", F); local 53 BB->getInstList().push_back(Add); 56 BB->getInstList().push_back(ReturnInst::Create(Context, Add));
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-member-initializers.cpp | 23 template <class T> class BB : public AA<T> { class in inherits:AA 25 BB() : AA<T>(1) {} function in class:BB 27 BB<int> x;
|
/external/llvm/examples/HowToUseJIT/ |
H A D | HowToUseJIT.cpp | 71 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", Add1F); local 74 // automatically append instructions to the basic block `BB'. 75 IRBuilder<> builder(BB); 85 // Create the add instruction, inserting it into the end of BB. 101 BB = BasicBlock::Create(Context, "EntryBlock", FooF); 104 builder.SetInsertPoint(BB);
|
/external/llvm/include/llvm/IR/ |
H A D | PredIteratorCache.h | 38 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI) 41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 42 BasicBlock **GetPreds(BasicBlock *BB) { argument 43 BasicBlock **&Entry = BlockToPredsMap[BB]; 46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB)); 49 BlockToPredCountMap[BB] = PredCache.size()-1; 56 unsigned GetNumPreds(BasicBlock *BB) { argument 57 GetPreds(BB); [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 18 // FIXME: Move to this file: BasicBlock::removePredecessor, BB::splitBasicBlock 35 void DeleteDeadBlock(BasicBlock *BB); 37 /// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are 41 void FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P = nullptr); 48 bool DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI = nullptr); 52 bool MergeBlockIntoPredecessor(BasicBlock *BB, Pass *P = nullptr); 96 inline BasicBlock *SplitCriticalEdge(BasicBlock *BB, succ_iterator SI, argument 98 return SplitCriticalEdge(BB->getTerminator(), SI.getSuccessorIndex(), P); 101 /// SplitCriticalEdge - If the edge from *PI to BB is not critical, return 146 /// SplitBlockPredecessors - This method transforms BB b [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | Reg2Mem.cpp | 50 const BasicBlock *BB = Inst->getParent(); local 53 if (UI->getParent() != BB || isa<PHINode>(UI))
|
/external/llvm/lib/Transforms/Utils/ |
H A D | DemoteRegToStack.cpp | 94 BasicBlock *BB = SplitCriticalEdge(TI, SuccNum); local 95 assert (BB && "Unable to split critical edge."); 96 InsertPt = BB->getFirstInsertionPt();
|
H A D | Mem2Reg.cpp | 61 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function local 72 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
|
H A D | UnifyFunctionExitNodes.cpp | 72 BasicBlock *BB = *I; local 73 BB->getInstList().pop_back(); // Remove the unreachable inst. 74 BranchInst::Create(UnreachableBlock, BB); 110 BasicBlock *BB = *I; local 115 PN->addIncoming(BB->getTerminator()->getOperand(0), BB); 117 BB->getInstList().pop_back(); // Remove the return insn 118 BranchInst::Create(NewRetBlock, BB);
|
H A D | LowerExpectIntrinsic.cpp | 151 BasicBlock *BB = I++; local 154 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) { 157 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator())) { 163 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end();
|
/external/llvm/unittests/Bitcode/ |
H A D | BitReaderTest.cpp | 36 BasicBlock* BB = BasicBlock::Create(Mod->getContext(), "bb", Func); local 37 new UnreachableInst(Mod->getContext(), BB); 42 BlockAddress::get(BB), "table");
|
/external/llvm/unittests/IR/ |
H A D | PatternMatch.cpp | 37 BasicBlock *BB; member in struct:__anon26505::PatternMatchTest 45 BB(BasicBlock::Create(Ctx, "entry", F)), IRB(BB) {}
|
/external/llvm/unittests/Transforms/Utils/ |
H A D | IntegerDivision.cpp | 34 BasicBlock *BB = BasicBlock::Create(C, "", F); local 35 Builder.SetInsertPoint(BB); 42 EXPECT_TRUE(BB->front().getOpcode() == Instruction::SDiv); 47 EXPECT_TRUE(BB->front().getOpcode() == Instruction::AShr); 64 BasicBlock *BB = BasicBlock::Create(C, "", F); local 65 Builder.SetInsertPoint(BB); 72 EXPECT_TRUE(BB->front().getOpcode() == Instruction::UDiv); 77 EXPECT_TRUE(BB->front().getOpcode() == Instruction::ICmp); 94 BasicBlock *BB = BasicBlock::Create(C, "", F); local 95 Builder.SetInsertPoint(BB); 124 BasicBlock *BB = BasicBlock::Create(C, "", F); local 155 BasicBlock *BB = BasicBlock::Create(C, "", F); local 185 BasicBlock *BB = BasicBlock::Create(C, "", F); local 215 BasicBlock *BB = BasicBlock::Create(C, "", F); local 245 BasicBlock *BB = BasicBlock::Create(C, "", F); local [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | virtual-base-cast.cpp | 8 struct BB { int b; virtual int bb(); }; struct 9 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); }; 50 BB* c() { return x; } 75 BB* d() { return y; }
|
/external/llvm/include/llvm/Analysis/ |
H A D | IntervalPartition.h | 78 inline Interval *getBlockInterval(BasicBlock *BB) { argument 79 IntervalMapTy::iterator I = IntervalMap.find(BB);
|
/external/llvm/lib/CodeGen/ |
H A D | EdgeBundles.cpp | 80 unsigned BB = MBB.getNumber(); local 81 O << "\t\"BB#" << BB << "\" [ shape=box ]\n" 82 << '\t' << G.getBundle(BB, false) << " -> \"BB#" << BB << "\"\n" 83 << "\t\"BB#" << BB << "\" -> " << G.getBundle(BB, true) << '\n'; 86 O << "\t\"BB#" << B [all...] |
/external/llvm/lib/IR/ |
H A D | IRPrintingPasses.cpp | 92 bool runOnBasicBlock(BasicBlock &BB) override { 93 Out << Banner << BB; variable 111 INITIALIZE_PASS(PrintBasicBlockPass, "print-bb", "Print BB to stderr", false,
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64CleanupLocalDynamicTLSPass.cpp | 58 MachineBasicBlock *BB = Node->getBlock(); local 62 for (MachineBasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;
|
/external/llvm/lib/Target/R600/ |
H A D | AMDGPUTargetTransformInfo.cpp | 100 BasicBlock *BB = *BI; local 101 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCAPElim.cpp | 45 static bool OptimizeBB(BasicBlock *BB); 77 const BasicBlock *BB = I; local 78 for (BasicBlock::const_iterator J = BB->begin(), F = BB->end(); 94 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) { argument 98 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
/external/clang/test/SemaCXX/ |
H A D | conversion-delete-expr.cpp | 96 struct BB { struct 100 struct DD : BB {
|
/external/llvm/examples/Fibonacci/ |
H A D | fibonacci.cpp | 48 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF); local 64 Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond"); 65 BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
|