| /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/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 | 74 BasicBlock *BB = *I;
75 BB->getInstList().pop_back(); // Remove the unwind insn
76 BranchInst::Create(UnwindBlock, BB);
92 BasicBlock *BB = *I;
93 BB->getInstList().pop_back(); // Remove the unreachable inst.
94 BranchInst::Create(UnreachableBlock, BB);
130 BasicBlock *BB = *I;
135 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
137 BB->getInstList().pop_back(); // Remove the return ins
[all...] |
| LowerExpectIntrinsic.cpp | 142 BasicBlock *BB = I++;
145 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) {
148 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator())) {
154 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end();
|
| ValueMapper.cpp | 98 BasicBlock *BB = cast_or_null<BasicBlock>(MapValue(BA->getBasicBlock(), VM,
100 return VM[V] = BlockAddress::get(F, BB ? BB : BA->getBasicBlock());
|
| /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/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/Scalar/ |
| Reg2Mem.cpp | 49 const BasicBlock *BB = Inst->getParent();
53 if (I->getParent() != BB || isa<PHINode>(I))
|
| CorrelatedValuePropagation.cpp | 93 BasicBlock *BB = P->getParent();
100 BB);
|
| /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/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/unittests/Support/ |
| IRBuilderTest.cpp | 29 BB = BasicBlock::Create(getGlobalContext(), "", F);
33 BB = 0;
38 BasicBlock *BB;
42 IRBuilder<> Builder(BB);
|
| /external/clang/test/SemaCXX/ |
| conversion-delete-expr.cpp | 96 struct BB {
100 struct DD : BB {
|
| warn-reorder-ctor-initialization.cpp | 3 struct BB {};
7 class complex : public BB, BB1 {
13 BB1(), // expected-warning {{base class 'BB1' will be initialized after base 'BB'}}
14 BB()
|
| /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/ |
| DbgInfoPrinter.cpp | 201 BasicBlock *BB = I;
203 if (I != F.begin() && (pred_begin(BB) == pred_end(BB)))
207 Out << BB->getName();
212 for (BasicBlock::const_iterator i = BB->begin(), e = BB->end();
|
| DomPrinter.cpp | 36 BasicBlock *BB = Node->getBlock();
38 if (!BB)
44 ::getSimpleNodeLabel(BB, BB->getParent());
47 ::getCompleteNodeLabel(BB, BB->getParent());
|
| DominanceFrontier.cpp | 41 BasicBlock *BB = Node->getBlock();
47 workList.push_back(DFCalculateWorkObject(BB, NULL, Node, NULL));
113 OS << " DomFrontier for BB ";
|
| RegionPrinter.cpp | 44 BasicBlock *BB = Node->getNodeAs<BasicBlock>();
48 ::getSimpleNodeLabel(BB, BB->getParent());
51 ::getCompleteNodeLabel(BB, BB->getParent());
126 BasicBlock *BB = (*BI)->getNodeAs<BasicBlock>();
127 if (RI->getRegionFor(BB) == R)
129 << static_cast<const void*>(RI->getTopLevelRegion()->getBBNode(BB))
|
| SparsePropagation.cpp | 90 void SparseSolver::MarkBlockExecutable(BasicBlock *BB) {
91 DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << "\n");
92 BBExecutable.insert(BB); // Basic block is executable!
93 BBWorkList.push_back(BB); // Add the block to the work list!
96 /// markEdgeExecutable - Mark a basic block as executable, adding it to the BB
221 BasicBlock *BB = TI.getParent();
226 markEdgeExecutable(BB, TI.getSuccessor(i));
316 BasicBlock *BB = BBWorkList.back();
319 DEBUG(dbgs() << "\nPopped off BBWL: " << *BB);
323 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I
[all...] |
| /bionic/libc/bionic/ |
| md5.c | 78 u_int32_t AA, BB, CC, DD;
81 BB = B;
174 B += BB;
|
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 66 NodeType *BB = *VisitStack.back().second++;
67 if (this->Visited.insert(BB)) { // If the block is not visited...
68 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
73 inline po_iterator(NodeType *BB) {
74 this->Visited.insert(BB);
75 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
80 inline po_iterator(NodeType *BB, SetType &S) :
82 if (this->Visited.insert(BB)) {
[all...] |
