/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 | 60 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function 71 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 | 93 BasicBlock *BB = SplitCriticalEdge(TI, SuccNum); 94 assert (BB && "Unable to split critical edge."); 95 InsertPt = BB->getFirstInsertionPt();
|
LowerExpectIntrinsic.cpp | 137 BasicBlock *BB = I++; 140 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) { 143 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator())) { 149 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end();
|
/external/clang/test/CodeGenCXX/ |
virtual-base-cast.cpp | 4 struct B { int b; virtual int bb(); }; 5 struct C : virtual A, virtual B { int c; virtual int aa(); virtual int bb(); }; 7 struct BB { int b; virtual int bb(); }; 8 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); }; 27 BB* c() { return x; }
|
/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 | 86 unsigned BB = I->getNumber(); 87 O << "\t\"BB#" << BB << "\" [ shape=box ]\n" 88 << '\t' << G.getBundle(BB, false) << " -> \"BB#" << BB << "\"\n" 89 << "\t\"BB#" << BB << "\" -> " << G.getBundle(BB, true) << '\n'; 92 O << "\t\"BB#" << BB << "\" -> \"BB#" << (*SI)->getNumber( [all...] |
UnreachableBlockElim.cpp | 78 BasicBlock *BB = I; 79 DeadBlocks.push_back(BB); 80 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) { 82 BB->getInstList().pop_front(); 84 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) 85 (*SI)->removePredecessor(BB); 86 BB->dropAllReferences(); 141 MachineBasicBlock *BB = I; 144 if (!Reachable.count(BB)) { [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCAPElim.cpp | 44 static bool OptimizeBB(BasicBlock *BB); 76 const BasicBlock *BB = I; 77 for (BasicBlock::const_iterator J = BB->begin(), F = BB->end(); 93 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) { 97 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
DependencyAnalysis.cpp | 249 const BasicBlock *BB = *I; 250 if (BB == StartBB) 252 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back());
|
/external/llvm/lib/Transforms/Scalar/ |
Reg2Mem.cpp | 49 const BasicBlock *BB = Inst->getParent(); 53 if (I->getParent() != BB || isa<PHINode>(I))
|
/external/llvm/tools/llvm-objdump/ |
MCFunction.cpp | 98 MCBasicBlock BB; 100 // Add instructions to the BB. 105 BB.addInst(Instructions[ii]); 107 f.addBlock(*spi, BB); 114 MCBasicBlock &BB = const_cast<MCBasicBlock&>(i->second); 115 if (BB.getInsts().empty()) continue; 116 const MCDecodedInst &Inst = BB.getInsts().back(); 124 BB.addSucc(i->first); 126 BB.addSucc(targ); 129 BB.addSucc(llvm::next(i)->first) [all...] |
/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/Transforms/Utils/ |
IntegerDivision.cpp | 33 BasicBlock *BB = BasicBlock::Create(C, "", F); 34 Builder.SetInsertPoint(BB); 41 EXPECT_TRUE(BB->front().getOpcode() == Instruction::SDiv); 46 EXPECT_TRUE(BB->front().getOpcode() == Instruction::AShr); 63 BasicBlock *BB = BasicBlock::Create(C, "", F); 64 Builder.SetInsertPoint(BB); 71 EXPECT_TRUE(BB->front().getOpcode() == Instruction::UDiv); 76 EXPECT_TRUE(BB->front().getOpcode() == Instruction::ICmp); 93 BasicBlock *BB = BasicBlock::Create(C, "", F); 94 Builder.SetInsertPoint(BB); [all...] |
/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/jmonkeyengine/engine/src/terrain/com/jme3/terrain/noise/basis/ |
ImprovedNoise.java | 64 int BB = ImprovedNoise.p[B + 1] + Z;
73 ImprovedNoise.grad3(ImprovedNoise.p[BB], x - 1, y - 1, z))),// FROM
78 ImprovedNoise.grad3(ImprovedNoise.p[BB + 1], x - 1, y - 1, z - 1))));
|
/external/llvm/include/llvm/Analysis/ |
DominatorInternals.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/ |
DomPrinter.cpp | 36 BasicBlock *BB = Node->getBlock(); 38 if (!BB) 44 ::getSimpleNodeLabel(BB, BB->getParent()); 47 ::getCompleteNodeLabel(BB, BB->getParent());
|
DominanceFrontier.cpp | 43 BasicBlock *BB = Node->getBlock(); 49 workList.push_back(DFCalculateWorkObject(BB, NULL, Node, NULL)); 115 OS << " DomFrontier for BB ";
|
RegionPrinter.cpp | 44 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); 48 ::getSimpleNodeLabel(BB, BB->getParent()); 51 ::getCompleteNodeLabel(BB, BB->getParent());
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGSDNodes.h | 38 MachineBasicBlock *BB; 51 void Run(SelectionDAG *dag, MachineBasicBlock *bb);
|