Searched defs:BB (Results 26 - 50 of 253) sorted by relevance

1234567891011

/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGSDNodes.h38 MachineBasicBlock *BB; member in class:llvm::ScheduleDAGSDNodes
/external/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp76 BasicBlock *BB = I; local
77 DeadBlocks.push_back(BB);
78 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
80 BB->getInstList().pop_front();
82 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
83 (*SI)->removePredecessor(BB);
84 BB->dropAllReferences();
137 MachineBasicBlock *BB = I; local
140 if (!Reachable.count(BB)) {
173 MachineBasicBlock *BB = I; local
[all...]
/external/llvm/lib/IR/
H A DDominators.cpp150 // If the BB the edge ends in doesn't dominate the use BB, then the
157 // Simple case: if the end BB has a single predecessor, the fact that it
184 const BasicBlock *BB = *PI; local
185 if (BB == Start)
188 if (!dominates(End, BB))
/external/llvm/lib/Target/AArch64/
H A DAArch64StorePairSuppress.cpp49 bool shouldAddSTPToBlock(const MachineBasicBlock *BB);
73 bool AArch64StorePairSuppress::shouldAddSTPToBlock(const MachineBasicBlock *BB) { argument
77 MachineTraceMetrics::Trace BBTrace = MinInstr->getTrace(BB);
91 DEBUG(dbgs() << " Suppress STP in BB: " << BB->getNumber()
/external/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp48 void DeleteBasicBlock(BasicBlock *BB);
104 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
105 if (CheckUnwind && isa<ResumeInst>(BB->getTerminator())) {
108 } else if (CheckReturn && isa<ReturnInst>(BB->getTerminator())) {
115 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
176 for (Function::iterator BB = F->begin(), E = F->end(); BB !
236 DeleteBasicBlock(BasicBlock *BB) argument
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h42 const BasicBlock *BB = dyn_cast_or_null<BasicBlock>(X); local
43 return BB ? BB->size() : 0;
/external/llvm/lib/Transforms/ObjCARC/
H A DDependencyAnalysis.cpp251 const BasicBlock *BB = *I; local
252 if (BB == StartBB)
254 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back());
/external/llvm/lib/Transforms/Scalar/
H A DPartiallyInlineLibCalls.cpp45 BasicBlock &CurrBB, Function::iterator &BB);
65 for (Function::iterator BB = F.begin(), BE = F.end(); BB != BE;) {
66 CurrBB = BB++;
87 optimizeSQRT(Call, CalledFunc, *CurrBB, BB))
105 Function::iterator &BB) {
151 BB = JoinBB;
102 optimizeSQRT(CallInst *Call, Function *CalledFunc, BasicBlock &CurrBB, Function::iterator &BB) argument
H A DSimplifyCFGPass.cpp79 BasicBlock &BB = *BBI++; local
82 ReturnInst *Ret = dyn_cast<ReturnInst>(BB.getTerminator());
87 if (Ret != &BB.front()) {
92 while (isa<DbgInfoIntrinsic>(I) && I != BB.begin())
95 (!isa<PHINode>(I) || I != BB.begin() ||
103 RetBlock = &BB;
116 BB.replaceAllUsesWith(RetBlock);
117 BB.eraseFromParent();
135 // Turn BB into a block that just unconditionally branches to the return
138 RetBlockPHI->addIncoming(Ret->getOperand(0), &BB);
[all...]
/external/llvm/lib/Transforms/Utils/
H A DValueMapper.cpp121 BasicBlock *BB = cast_or_null<BasicBlock>(MapValue(BA->getBasicBlock(), VM, local
123 return VM[V] = BlockAddress::get(F, BB ? BB : BA->getBasicBlock());
/external/llvm/unittests/Analysis/
H A DMixedTBAATest.cpp38 auto *BB = BasicBlock::Create(C, "entry", F); local
44 auto *Store1 = new StoreInst(Value, Addr, BB);
45 auto *Store2 = new StoreInst(Value, Addr, BB);
46 ReturnInst::Create(C, nullptr, BB);
/external/clang/test/SemaCXX/
H A Dwarn-reorder-ctor-initialization.cpp3 struct BB {}; struct
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/
H A DDominanceFrontier.h66 iterator addBasicBlock(BasicBlock *BB, const DomSetType &frontier) { argument
67 assert(find(BB) == end() && "Block already in DominanceFrontier!");
68 return Frontiers.insert(std::make_pair(BB, frontier)).first;
71 /// removeBlock - Remove basic block BB's frontier.
72 void removeBlock(BasicBlock *BB) { argument
73 assert(find(BB) != end() && "Block is not in DominanceFrontier!");
75 I->second.erase(BB);
76 Frontiers.erase(BB);
80 assert(I != end() && "BB is not in DominanceFrontier!");
85 assert(I != end() && "BB i
[all...]
H A DLoopIterator.h84 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
87 bool hasPostorder(BasicBlock *BB) const {
88 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
93 unsigned getPostorder(BasicBlock *BB) const {
94 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
101 unsigned getRPO(BasicBlock *BB) const {
102 return 1 + PostBlocks.size() - getPostorder(BB);
118 void finishPostorder(BasicBlock *BB);
153 bool visitPreorder(BasicBlock *BB) { argument
162 finishPostorder(BasicBlock *BB) argument
175 finishPostorder(BasicBlock *BB) argument
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineDominators.h118 inline MachineDomTreeNode *operator[](MachineBasicBlock *BB) const {
119 return DT->getNode(BB);
125 inline MachineDomTreeNode *getNode(MachineBasicBlock *BB) const {
126 return DT->getNode(BB);
132 inline MachineDomTreeNode *addNewBlock(MachineBasicBlock *BB, argument
134 return DT->addNewBlock(BB, DomBB);
152 /// children list. Deletes dominator node associated with basic block BB.
153 inline void eraseNode(MachineBasicBlock *BB) { argument
154 DT->eraseNode(BB);
157 /// splitBlock - BB i
[all...]
H A DMachineLoopInfo.h97 /// getLoopFor - Return the inner most loop that BB lives in. If a basic
100 inline MachineLoop *getLoopFor(const MachineBasicBlock *BB) const {
101 return LI.getLoopFor(BB);
106 inline const MachineLoop *operator[](const MachineBasicBlock *BB) const {
107 return LI.getLoopFor(BB);
112 inline unsigned getLoopDepth(const MachineBasicBlock *BB) const {
113 return LI.getLoopDepth(BB);
117 inline bool isLoopHeader(MachineBasicBlock *BB) const {
118 return LI.isLoopHeader(BB);
134 /// changeLoopFor - Change the top-level loop that contains BB t
137 changeLoopFor(MachineBasicBlock *BB, MachineLoop *L) argument
156 removeBlock(MachineBasicBlock *BB) argument
[all...]
/external/llvm/include/llvm/IR/
H A DInstIterator.h37 _BB_i_t BB; // BasicBlocksType::iterator member in class:llvm::InstIterator
52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
59 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
60 if (BB != BBs->end()) {
61 BI = BB->begin();
67 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor
71 inline BBIty &getBasicBlockIterator() { return BB; }
[all...]
/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h60 typename GraphT::NodeType* BB = Worklist.back().first; local
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/include/llvm/Target/
H A DTargetJITInfo.h75 virtual uintptr_t getPICJumpTableEntry(uintptr_t BB, uintptr_t JTBase) { argument
/external/llvm/lib/Analysis/
H A DCFG.cpp29 const BasicBlock *BB = &F.getEntryBlock(); local
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))
72 GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) argument
112 getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) argument
143 BasicBlock *BB = Worklist.pop_back_val(); local
199 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent()); local
[all...]
H A DDomPrinter.cpp36 BasicBlock *BB = Node->getBlock(); local
38 if (!BB)
44 ::getSimpleNodeLabel(BB, BB->getParent());
47 ::getCompleteNodeLabel(BB, BB->getParent());
H A DDominanceFrontier.cpp42 BasicBlock *BB = Node->getBlock(); local
48 workList.push_back(DFCalculateWorkObject(BB, nullptr, Node, nullptr));
114 OS << " DomFrontier for BB ";
H A DRegionPrinter.cpp44 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); local
48 ::getSimpleNodeLabel(BB, BB->getParent());
51 ::getCompleteNodeLabel(BB, BB->getParent());
124 for (const auto &BB : R.blocks())
125 if (RI->getRegionFor(BB) == &R)
127 << static_cast<const void*>(RI->getTopLevelRegion()->getBBNode(BB))
H A DSparsePropagation.cpp91 void SparseSolver::MarkBlockExecutable(BasicBlock *BB) { argument
92 DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << "\n");
93 BBExecutable.insert(BB); // Basic block is executable!
94 BBWorkList.push_back(BB); // Add the block to the work list!
97 /// markEdgeExecutable - Mark a basic block as executable, adding it to the BB
222 BasicBlock *BB = TI.getParent(); local
227 markEdgeExecutable(BB, TI.getSuccessor(i));
316 BasicBlock *BB = BBWorkList.back(); local
319 DEBUG(dbgs() << "\nPopped off BBWL: " << *BB);
323 for (BasicBlock::iterator I = BB
[all...]
/external/llvm/lib/MC/MCAnalysis/
H A DMCModule.cpp108 static bool CompBBToAtom(MCBasicBlock *BB, const MCTextAtom *Atom) { argument
109 return BB->getInsts() < Atom;
118 MCBasicBlock *BB = *I; local
119 MCBasicBlock *NewBB = &BB->getParent()->createBlock(*NewTA);
120 BB->splitBasicBlock(NewBB);
124 void MCModule::trackBBForAtom(const MCTextAtom *Atom, MCBasicBlock *BB) { argument
125 assert(Atom == BB->getInsts() && "Text atom doesn't back the basic block!");
130 if (*I == BB)
132 BBsByAtom.insert(I, BB);

Completed in 1037 milliseconds

1234567891011