| /external/llvm/examples/ModuleMaker/ |
| ModuleMaker.cpp | 42 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", F);
53 BB->getInstList().push_back(Add);
56 BB->getInstList().push_back(ReturnInst::Create(Context, Add));
|
| /external/llvm/lib/Transforms/Utils/ |
| Mem2Reg.cpp | 61 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
72 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
|
| UnifyFunctionExitNodes.cpp | 72 BasicBlock *BB = *I;
73 BB->getInstList().pop_back(); // Remove the unreachable inst.
74 BranchInst::Create(UnreachableBlock, BB);
110 BasicBlock *BB = *I;
115 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
117 BB->getInstList().pop_back(); // Remove the return insn
118 BranchInst::Create(NewRetBlock, BB);
|
| DemoteRegToStack.cpp | 94 BasicBlock *BB = SplitCriticalEdge(TI, SuccNum);
95 assert (BB && "Unable to split critical edge.");
96 InsertPt = BB->getFirstInsertionPt();
|
| LowerExpectIntrinsic.cpp | 151 BasicBlock *BB = I++;
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/clang/test/SemaTemplate/ |
| instantiate-member-initializers.cpp | 23 template <class T> class BB : public AA<T> {
25 BB() : AA<T>(1) {}
27 BB<int> x;
|
| /external/llvm/examples/HowToUseJIT/ |
| HowToUseJIT.cpp | 71 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", Add1F);
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/lib/CodeGen/ |
| EdgeBundles.cpp | 80 unsigned BB = MBB.getNumber();
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#" << BB << "\" -> \"BB#" << (*SI)->getNumber(
[all...] |
| /external/llvm/lib/IR/ |
| IRPrintingPasses.cpp | 92 bool runOnBasicBlock(BasicBlock &BB) override {
93 Out << Banner << BB;
111 INITIALIZE_PASS(PrintBasicBlockPass, "print-bb", "Print BB to stderr", false,
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64CleanupLocalDynamicTLSPass.cpp | 58 MachineBasicBlock *BB = Node->getBlock();
62 for (MachineBasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUTargetTransformInfo.cpp | 100 BasicBlock *BB = *BI;
101 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCAPElim.cpp | 45 static bool OptimizeBB(BasicBlock *BB);
77 const BasicBlock *BB = I;
78 for (BasicBlock::const_iterator J = BB->begin(), F = BB->end();
94 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) {
98 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
| DependencyAnalysis.cpp | 251 const BasicBlock *BB = *I;
252 if (BB == StartBB)
254 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back());
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reg2Mem.cpp | 50 const BasicBlock *BB = Inst->getParent();
53 if (UI->getParent() != BB || isa<PHINode>(UI))
|
| /external/llvm/unittests/Bitcode/ |
| BitReaderTest.cpp | 36 BasicBlock* BB = BasicBlock::Create(Mod->getContext(), "bb", Func);
37 new UnreachableInst(Mod->getContext(), BB);
42 BlockAddress::get(BB), "table");
|
| /external/llvm/unittests/IR/ |
| PatternMatch.cpp | 37 BasicBlock *BB;
45 BB(BasicBlock::Create(Ctx, "entry", F)), IRB(BB) {}
|
| /external/llvm/unittests/Transforms/Utils/ |
| IntegerDivision.cpp | 34 BasicBlock *BB = BasicBlock::Create(C, "", F);
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);
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);
95 Builder.SetInsertPoint(BB);
[all...] |
| /external/clang/test/CodeGenCXX/ |
| virtual-base-cast.cpp | 5 struct B { int b; virtual int bb(); };
6 struct C : virtual A, virtual B { int c; virtual int aa(); virtual int bb(); };
8 struct BB { int b; virtual int bb(); };
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/examples/Fibonacci/ |
| fibonacci.cpp | 48 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF);
64 Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
65 BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 42 const BasicBlock *BB = dyn_cast_or_null<BasicBlock>(X);
43 return BB ? BB->size() : 0;
|
| /external/clang/test/SemaCXX/ |
| conversion-delete-expr.cpp | 96 struct BB {
100 struct DD : BB {
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 60 typename GraphT::NodeType* BB = Worklist.back().first;
64 DT.Info[BB];
66 // First time we visited this BB?
67 if (NextSucc == GraphT::child_begin(BB)) {
69 BBInfo.Label = BB;
71 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 // store the DFS number of the current BB - the reference to BBInfo might
84 if (NextSucc == GraphT::child_end(BB)) {
|
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 29 const BasicBlock *BB = &F.getEntryBlock();
30 if (succ_begin(BB) == succ_end(BB))
37 Visited.insert(BB);
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
39 InStack.insert(BB);
47 BB = *I++;
48 if (Visited.insert(BB)) {
53 if (InStack.count(BB))
[all...] |
| Delinearization.cpp | 93 const BasicBlock *BB = Inst->getParent();
96 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
|
| DomPrinter.cpp | 36 BasicBlock *BB = Node->getBlock();
38 if (!BB)
44 ::getSimpleNodeLabel(BB, BB->getParent());
47 ::getCompleteNodeLabel(BB, BB->getParent());
|
