Searched defs:BB (Results 1 - 25 of 273) sorted by relevance

1234567891011

/external/llvm/include/llvm/Analysis/
H A DOrderedBasicBlock.h48 const BasicBlock *BB; member in class:llvm::OrderedBasicBlock
50 /// \brief Given no cached results, find if \p A comes before \p B in \p BB.
51 /// Cache and number out instruction while walking \p BB.
58 /// comes before \p B in \p BB. This is a simplification that considers
60 /// only relevant to compare relative instructions positions inside \p BB.
H A DIntervalPartition.h78 inline Interval *getBlockInterval(BasicBlock *BB) { argument
79 IntervalMapTy::iterator I = IntervalMap.find(BB);
/external/llvm/examples/ModuleMaker/
H A DModuleMaker.cpp42 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", F); local
53 BB->getInstList().push_back(Add);
56 BB->getInstList().push_back(ReturnInst::Create(Context, Add));
/external/llvm/lib/Transforms/Instrumentation/
H A DInstrumentation.cpp38 BasicBlock::iterator llvm::PrepareToSplitEntryBlock(BasicBlock &BB, argument
40 assert(&BB.getParent()->getEntryBlock() == &BB);
41 for (auto I = IP, E = BB.end(); I != E; ++I) {
/external/clang/test/SemaTemplate/
H A Dinstantiate-member-initializers.cpp23 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 DHowToUseJIT.cpp72 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", Add1F); local
75 // automatically append instructions to the basic block `BB'.
76 IRBuilder<> builder(BB);
86 // 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 DPredIteratorCache.h39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) { argument
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) { argument
59 GetPreds(BB);
64 size(BasicBlock *BB) argument
65 get(BasicBlock *BB) argument
[all...]
/external/llvm/lib/Analysis/
H A DCodeMetrics.cpp105 void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB, argument
110 for (BasicBlock::const_iterator II = BB->begin(), E = BB->end();
131 if (F == BB->getParent())
152 if (II->getType()->isTokenTy() && II->isUsedOutsideOfBlock(BB))
166 if (isa<ReturnInst>(BB->getTerminator()))
180 notDuplicatable |= isa<IndirectBrInst>(BB->getTerminator());
182 // Remember NumInsts for this BB.
183 NumBBInsts[BB] = NumInsts - NumInstsBeforeThisBB;
H A DInstCount.cpp42 void visitBasicBlock(BasicBlock &BB) { ++TotalBlocks; } argument
H A DIteratedDominanceFrontier.cpp37 for (BasicBlock *BB : *DefBlocks) {
38 if (DomTreeNode *Node = DT.getNode(BB))
63 BasicBlock *BB = Node->getBlock(); local
65 for (auto Succ : successors(BB)) {
/external/llvm/lib/Transforms/Scalar/
H A DReg2Mem.cpp50 const BasicBlock *BB = Inst->getParent(); local
53 if (UI->getParent() != BB || isa<PHINode>(UI))
/external/llvm/lib/Transforms/Utils/
H A DDemoteRegToStack.cpp49 BasicBlock *BB = SplitCriticalEdge(II, SuccNum); local
50 assert(BB && "Unable to split critical edge.");
51 (void)BB;
H A DMem2Reg.cpp64 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function local
80 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
H A DUnifyFunctionExitNodes.cpp71 BasicBlock *BB = *I; local
72 BB->getInstList().pop_back(); // Remove the unreachable inst.
73 BranchInst::Create(UnreachableBlock, BB);
109 BasicBlock *BB = *I; local
114 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
116 BB->getInstList().pop_back(); // Remove the return insn
117 BranchInst::Create(NewRetBlock, BB);
/external/llvm/unittests/IR/
H A DPatternMatch.cpp37 BasicBlock *BB; member in struct:__anon13189::PatternMatchTest
45 BB(BasicBlock::Create(Ctx, "entry", F)), IRB(BB) {}
/external/llvm/unittests/Transforms/Utils/
H A DIntegerDivision.cpp34 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 Dvirtual-base-cast.cpp8 struct BB { int b; virtual int bb(); }; struct
9 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); };
48 BB* c() { return x; }
72 BB* d() { return y; }
/external/llvm/lib/CodeGen/
H A DEdgeBundles.cpp80 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 DIRPrintingPasses.cpp96 bool runOnBasicBlock(BasicBlock &BB) override {
97 Out << Banner << BB; variable
115 INITIALIZE_PASS(PrintBasicBlockPass, "print-bb", "Print BB to stderr", false,
/external/llvm/lib/Target/AArch64/
H A DAArch64CleanupLocalDynamicTLSPass.cpp58 MachineBasicBlock *BB = Node->getBlock(); local
62 for (MachineBasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;
/external/llvm/lib/Target/NVPTX/
H A DNVPTXLowerAlloca.cpp45 bool runOnBasicBlock(BasicBlock &BB) override;
64 bool NVPTXLowerAlloca::runOnBasicBlock(BasicBlock &BB) { argument
66 for (auto &I : BB) {
/external/llvm/lib/Transforms/ObjCARC/
H A DObjCARCAPElim.cpp45 static bool OptimizeBB(BasicBlock *BB);
75 for (const BasicBlock &BB : *Callee) {
76 for (const Instruction &I : BB)
91 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) { argument
95 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
/external/clang/test/SemaCXX/
H A Dconversion-delete-expr.cpp96 struct BB { struct
100 struct DD : BB {
/external/llvm/examples/Fibonacci/
H A Dfibonacci.cpp48 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);
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h18 // FIXME: Move to this file: BasicBlock::removePredecessor, BB::splitBasicBlock
36 void DeleteDeadBlock(BasicBlock *BB);
38 /// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
42 void FoldSingleEntryPHINodes(BasicBlock *BB,
50 bool DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI = nullptr);
54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
133 SplitCriticalEdge(BasicBlock *BB, succ_iterator SI, argument
136 return SplitCriticalEdge(BB->getTerminator(), SI.getSuccessorIndex(),
140 /// SplitCriticalEdge - If the edge from *PI to BB is not critical, return
194 /// into the function and moves some of the predecessors of BB t
[all...]

Completed in 1304 milliseconds

1234567891011