HomeSort by relevance Sort by last modified time
    Searched defs:BB (Results 1 - 25 of 199) sorted by null

1 2 3 4 5 6 7 8

  /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/
UnifyFunctionExitNodes.cpp 71 BasicBlock *BB = *I;
72 BB->getInstList().pop_back(); // Remove the unreachable inst.
73 BranchInst::Create(UnreachableBlock, BB);
109 BasicBlock *BB = *I;
114 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
116 BB->getInstList().pop_back(); // Remove the return insn
117 BranchInst::Create(NewRetBlock, BB);
DemoteRegToStack.cpp 49 BasicBlock *BB = SplitCriticalEdge(II, SuccNum);
50 assert(BB && "Unable to split critical edge.");
51 (void)BB;
Mem2Reg.cpp 64 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
77 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
  /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 72 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", Add1F);
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.
102 BB = BasicBlock::Create(Context, "EntryBlock", FooF);
105 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 96 bool runOnBasicBlock(BasicBlock &BB) override {
97 Out << Banner << BB;
115 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/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; ) {
  /external/llvm/lib/Transforms/Scalar/
Reg2Mem.cpp 50 const BasicBlock *BB = Inst->getParent();
53 if (UI->getParent() != BB || isa<PHINode>(UI))
  /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(); };
48 BB* c() { return x; }
72 BB* d() { return y; }
  /external/llvm/examples/Fibonacci/
fibonacci.cpp 47 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF);
63 Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
64 BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.h 38 MachineBasicBlock *BB;
51 void Run(SelectionDAG *dag, MachineBasicBlock *bb);
  /external/llvm/lib/Target/SystemZ/
SystemZLDCleanup.cpp 87 MachineBasicBlock *BB = Node->getBlock();
91 for (auto I = BB->begin(), E = BB->end(); I != E; ++I) {
  /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/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_empty(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).second) {
53 if (InStack.count(BB))
54 Result.push_back(std::make_pair(ParentBB, 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());
RegionPrinter.cpp 44 BasicBlock *BB = Node->getNodeAs<BasicBlock>();
48 ::getSimpleNodeLabel(BB, BB->getParent());
51 ::getCompleteNodeLabel(BB, BB->getParent());
126 for (auto *BB : R.blocks())
127 if (RI.getRegionFor(BB) == &R)
129 << static_cast<const void*>(RI.getTopLevelRegion()->getBBNode(BB))

Completed in 550 milliseconds

1 2 3 4 5 6 7 8