Searched refs:BB (Results 76 - 100 of 478) sorted by relevance

1234567891011>>

/external/llvm/lib/Analysis/
H A DLazyValueInfo.cpp358 void insertResult(Value *Val, BasicBlock *BB, const LVILatticeVal &Result) { argument
359 SeenBlocks.insert(BB);
360 lookup(Val)[BB] = Result;
362 OverDefinedCache.insert(std::make_pair(BB, Val));
365 LVILatticeVal getBlockValue(Value *Val, BasicBlock *BB);
369 bool hasBlockValue(Value *Val, BasicBlock *BB);
374 bool solveBlockValue(Value *Val, BasicBlock *BB);
376 Value *Val, BasicBlock *BB);
378 PHINode *PN, BasicBlock *BB);
380 Instruction *BBI, BasicBlock *BB);
442 eraseBlock(BasicBlock *BB) argument
480 hasBlockValue(Value *Val, BasicBlock *BB) argument
492 getBlockValue(Value *Val, BasicBlock *BB) argument
501 solveBlockValue(Value *Val, BasicBlock *BB) argument
602 solveBlockValueNonLocal(LVILatticeVal &BBLV, Value *Val, BasicBlock *BB) argument
678 solveBlockValuePHINode(LVILatticeVal &BBLV, PHINode *PN, BasicBlock *BB) argument
751 solveBlockValueConstantRange(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument
996 getValueInBlock(Value *V, BasicBlock *BB, Instruction *CxtI) argument
1144 getConstant(Value *V, BasicBlock *BB, Instruction *CxtI) argument
1277 eraseBlock(BasicBlock *BB) argument
[all...]
H A DCodeMetrics.cpp111 void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB, argument
116 for (BasicBlock::const_iterator II = BB->begin(), E = BB->end();
137 if (F == BB->getParent())
169 if (isa<ReturnInst>(BB->getTerminator()))
183 notDuplicatable |= isa<IndirectBrInst>(BB->getTerminator());
185 // Remember NumInsts for this BB.
186 NumBBInsts[BB] = NumInsts - NumInstsBeforeThisBB;
H A DDomPrinter.cpp36 BasicBlock *BB = Node->getBlock(); local
38 if (!BB)
44 ::getSimpleNodeLabel(BB, BB->getParent());
47 ::getCompleteNodeLabel(BB, BB->getParent());
/external/llvm/lib/CodeGen/
H A DStackProtector.cpp211 for (const BasicBlock &BB : *F) {
212 for (const Instruction &I : BB) {
273 static CallInst *FindPotentialTailCall(BasicBlock *BB, ReturnInst *RI, argument
281 for (BasicBlock::reverse_iterator I = std::next(BB->rbegin()), E = BB->rend();
305 returnTypeIsEligibleForTailCall(BB->getParent(), CI, RI, *TLI))
376 BasicBlock *BB = I++; local
377 ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator());
391 if (CallInst *CI = FindPotentialTailCall(BB, RI, TLI)) {
395 // At this point we know that BB ha
[all...]
H A DWinEHPrepare.cpp99 CatchHandler *findCatchHandler(BasicBlock *BB, BasicBlock *&NextBB,
157 bool isOriginLandingPadBlock(const BasicBlock *BB) const;
317 for (BasicBlock &BB : Fn) {
318 if (auto *LP = BB.getLandingPadInst())
320 if (auto *Resume = dyn_cast<ResumeInst>(BB.getTerminator()))
725 // Insert an indirect branch into the outlined landing pad BB.
736 static bool isSelectorDispatch(BasicBlock *BB, BasicBlock *&CatchHandler, argument
742 if (!match(BB->getTerminator(),
790 for (BasicBlock &BB : *Handler) {
791 TerminatorInst *Terminator = BB
1342 BasicBlock *BB = LPad->getParent(); local
1417 findCatchHandler(BasicBlock *BB, BasicBlock *&NextBB, VisitedBlockSet &VisitedBlocks) argument
1462 createCleanupHandler(LandingPadActions &Actions, CleanupHandlerMapTy &CleanupHandlerMap, BasicBlock *BB) argument
1476 matchOutlinedFinallyCall(BasicBlock *BB, Instruction *MaybeCall) argument
1493 followSingleUnconditionalBranches(BasicBlock *BB) argument
1523 BasicBlock *BB = StartBB; local
[all...]
H A DSjLjEHPrepare.cpp144 /// MarkBlocksLiveIn - Insert BB and all of its predescessors into LiveBBs until
146 static void MarkBlocksLiveIn(BasicBlock *BB, argument
148 if (!LiveBBs.insert(BB).second)
151 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
278 for (Function::iterator BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) {
279 for (BasicBlock::iterator II = BB->begin(), IIE = BB
[all...]
H A DMachineBlockPlacement.cpp123 BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB) argument
124 : Blocks(1, BB), BlockToChain(BlockToChain), LoopPredecessors(0) {
125 assert(BB && "Cannot create a chain with a null basic block");
126 BlockToChain[BB] = this;
144 void merge(MachineBasicBlock *BB, BlockChain *Chain) { argument
145 assert(BB);
150 assert(!BlockToChain[BB]);
151 Blocks.push_back(BB);
152 BlockToChain[BB] = this;
156 assert(BB
287 getBlockName(MachineBasicBlock *BB) argument
299 getBlockNum(MachineBasicBlock *BB) argument
351 selectBestSuccessor(MachineBasicBlock *BB, BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
521 buildChain( MachineBasicBlock *BB, BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &BlockWorkList, const BlockFilterSet *BlockFilter) argument
892 MachineBasicBlock *BB = FI; local
[all...]
H A DMachineModuleInfo.cpp44 void setPtr(BasicBlock *BB) { argument
45 ValueHandleBase::operator=(BB);
91 MCSymbol *getAddrLabelSymbol(BasicBlock *BB);
92 std::vector<MCSymbol*> getAddrLabelSymbolToEmit(BasicBlock *BB);
97 void UpdateForDeletedBlock(BasicBlock *BB);
102 MCSymbol *MMIAddrLabelMap::getAddrLabelSymbol(BasicBlock *BB) { argument
103 assert(BB->hasAddressTaken() &&
105 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
109 assert(BB->getParent() == Entry.Fn && "Parent changed");
116 // entry to BBCallbacks so we can be notified if the BB i
127 getAddrLabelSymbolToEmit(BasicBlock *BB) argument
161 UpdateForDeletedBlock(BasicBlock *BB) argument
343 getAddrLabelSymbol(const BasicBlock *BB) argument
354 getAddrLabelSymbolToEmit(const BasicBlock *BB) argument
[all...]
/external/llvm/test/MC/COFF/
H A Dbasic-coff-64.s14 # BB#0: # %entry
H A Dbasic-coff.s14 # BB#0: # %entry
H A Dseh-linkonce.s14 # BB#0: # %entry
/external/llvm/lib/Transforms/Utils/
H A DMem2Reg.cpp64 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function local
77 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
H A DSimplifyCFG.cpp137 bool run(BasicBlock *BB);
237 /// If AggressiveInsts is non-null, and if V does not dominate BB, we check to
239 /// that do not dominate BB have a combined cost lower than CostRemaining and
249 static bool DominatesMergePoint(Value *V, BasicBlock *BB, argument
266 if (PBB == BB) return false;
269 // branch to BB, then it must be in the 'conditional' part of the "if
272 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB)
298 if (!DominatesMergePoint(*i, BB, AggressiveInsts, CostRemaining, TTI))
576 static void EliminateBlockCases(BasicBlock *BB, argument
578 Cases.erase(std::remove(Cases.begin(), Cases.end(), BB), Case
826 BasicBlock *BB = TI->getParent(); local
1648 HasNoDuplicateCall(const BasicBlock *BB) argument
1661 BlockIsSimpleEnoughToThreadThrough(BasicBlock *BB) argument
1689 BasicBlock *BB = BI->getParent(); local
1794 BasicBlock *BB = PN->getParent(); local
2053 BasicBlock *BB = BI->getParent(); local
2173 DEBUG(dbgs() << "FOLDING BRANCH TO COMMON DEST:\\n" << *PBI << *BB); local
2351 BasicBlock *BB = BI->getParent(); local
2704 BasicBlock *BB = ICI->getParent(); local
2851 BasicBlock *BB = BI->getParent(); local
2877 << "\\nEXTRABB = " << *BB); local
2916 BasicBlock *BB = RI->getParent(); local
2960 BasicBlock *BB = RI->getParent(); local
3010 BasicBlock *BB = UI->getParent(); local
3298 FindPHIForConditionForwarding(ConstantInt *CaseValue, BasicBlock *BB, int *PhiIndex) argument
4270 BasicBlock *BB = SI->getParent(); local
4316 BasicBlock *BB = IBI->getParent(); local
4373 TryToMergeLandingPad(LandingPadInst *LPad, BranchInst *BI, BasicBlock *BB) argument
4429 BasicBlock *BB = BI->getParent(); local
4472 BasicBlock *BB = BI->getParent(); local
4599 removeUndefIntroducingPredecessor(BasicBlock *BB) argument
4624 run(BasicBlock *BB) argument
4694 SimplifyCFG(BasicBlock *BB, const TargetTransformInfo &TTI, unsigned BonusInstThreshold, AssumptionCache *AC) argument
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DDeadStoreElimination.cpp78 bool runOnBasicBlock(BasicBlock &BB);
80 bool handleEndBlock(BasicBlock &BB);
477 bool DSE::runOnBasicBlock(BasicBlock &BB) { argument
480 // Do a top-down walk on the BB.
481 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
517 BBI = BB.begin();
518 else if (BBI != BB.begin()) // Revisit this instruction if possible.
554 const DataLayout &DL = BB.getModule()->getDataLayout();
570 if (BBI != BB
629 FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, BasicBlock *BB, DominatorTree *DT) argument
654 BasicBlock *BB = Blocks.pop_back_val(); local
699 handleEndBlock(BasicBlock &BB) argument
[all...]
H A DLoopInstSimplify.cpp109 BasicBlock *BB = Item.getPointer(); local
114 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {
142 BI = BB->begin(); BE = BB->end();
154 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE;
H A DSink.cpp58 bool ProcessBlock(BasicBlock &BB);
60 bool AllUsesDominatedByBlock(Instruction *Inst, BasicBlock *BB) const;
77 BasicBlock *BB) const {
93 if (!DT->dominates(BB, UseBlock))
120 bool Sinking::ProcessBlock(BasicBlock &BB) { argument
122 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false;
127 if (!DT->isReachableFromEntry(&BB)) return false;
132 BasicBlock::iterator I = BB.end();
141 ProcessedBegin = I == BB
[all...]
/external/valgrind/callgrind/
H A Dbb.c32 /*--- Basic block (BB) operations ---*/
35 /* BB hash, resizable */
44 bbs.table = (BB**) CLG_MALLOC("cl.bb.ibh.1",
45 bbs.size * sizeof(BB*));
57 * - BB base as object file offset
70 BB **new_table, *curr, *next;
74 new_table = (BB**) CLG_MALLOC("cl.bb.rbt.1",
75 new_size * sizeof(BB*));
104 CLG_DEBUG(0, "Resize BB Hash: %d => %d (entries %d, conflicts %d/%d)\n",
115 * Allocate new BB structur
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsOs16.cpp79 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
80 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
/external/llvm/unittests/Analysis/
H A DAliasAnalysisTest.cpp75 auto *BB = BasicBlock::Create(C, "entry", F); local
81 auto *Store1 = new StoreInst(Value, Addr, BB);
82 auto *Load1 = new LoadInst(Addr, "load", BB);
83 auto *Add1 = BinaryOperator::CreateAdd(Value, Value, "add", BB);
85 ReturnInst::Create(C, nullptr, BB);
/external/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h41 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) { argument
42 assert(find(BB) != end() && "Block is not in DominanceFrontier!");
44 I->second.erase(BB);
45 Frontiers.erase(BB);
51 assert(I != end() && "BB is not in DominanceFrontier!");
52 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
59 assert(I != end() && "BB is not in DominanceFrontier!");
60 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
68 for (BlockT *BB : DS2)
69 tmpSet.insert(BB);
153 BlockT *BB = Node->getBlock(); local
[all...]
H A DMemoryDependenceAnalysis.h188 /// each BasicBlock (the BB entry) it keeps a MemDepResult.
190 BasicBlock *BB; member in class:llvm::NonLocalDepEntry
194 : BB(bb), Result(result) {}
197 NonLocalDepEntry(BasicBlock *bb) : BB(bb) {}
199 // BB is the sort key, it can't be changed.
200 BasicBlock *getBB() const { return BB; }
207 return BB < RHS.BB;
212 /// For each BasicBlock (the BB entry) it keeps a MemDepResult and the
221 // BB i
[all...]
H A DInterval.h69 inline bool contains(BasicBlock *BB) const {
71 if (Nodes[i] == BB) return true;
74 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
78 inline bool isSuccessor(BasicBlock *BB) const {
80 if (Successors[i] == BB) return true;
83 //return find(Successors.begin(), Successors.end(), BB) != Successors.end();
/external/llvm/lib/Target/R600/
H A DSIAnnotateControlFlow.cpp72 bool isTopOfStack(BasicBlock *BB);
76 void push(BasicBlock *BB, Value *Saved);
90 void closeControlFlow(BasicBlock *BB);
155 /// \brief Is BB the last block saved on the stack ?
156 bool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) { argument
157 return !Stack.empty() && Stack.back().first == BB;
165 /// \brief Push a BB and saved value to the control flow stack
166 void SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) { argument
167 Stack.push_back(std::make_pair(BB, Saved));
274 BasicBlock *BB local
292 closeControlFlow(BasicBlock *BB) argument
[all...]
/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/Transforms/Utils/
H A DBasicBlockUtils.h18 // FIXME: Move to this file: BasicBlock::removePredecessor, BB::splitBasicBlock
37 void DeleteDeadBlock(BasicBlock *BB);
39 /// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
43 void FoldSingleEntryPHINodes(BasicBlock *BB, AliasAnalysis *AA = nullptr,
51 bool DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI = nullptr);
55 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
145 SplitCriticalEdge(BasicBlock *BB, succ_iterator SI, argument
148 return SplitCriticalEdge(BB->getTerminator(), SI.getSuccessorIndex(),
152 /// SplitCriticalEdge - If the edge from *PI to BB is not critical, return
206 /// into the function and moves some of the predecessors of BB t
[all...]

Completed in 406 milliseconds

1234567891011>>