| /external/llvm/include/llvm/IR/ |
| D | CFG.h | 91 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin()
92 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin()
95 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end()
96 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end()
99 inline bool pred_empty(const BasicBlock *BB) { in pred_empty()
102 inline pred_range predecessors(BasicBlock *BB) { in predecessors()
105 inline pred_const_range predecessors(const BasicBlock *BB) { in predecessors()
120 inline succ_iterator succ_begin(BasicBlock *BB) { in succ_begin()
123 inline succ_const_iterator succ_begin(const BasicBlock *BB) { in succ_begin()
126 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end()
[all …]
|
| D | PredIteratorCache.h | 43 BasicBlock **GetPreds(BasicBlock *BB) { in GetPreds()
58 unsigned GetNumPreds(BasicBlock *BB) { in GetNumPreds()
64 size_t size(BasicBlock *BB) { return GetNumPreds(BB); } in size()
65 ArrayRef<BasicBlock *> get(BasicBlock *BB) { in get()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopIterator.h | 84 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); } in hasPreorder()
87 bool hasPostorder(BasicBlock *BB) const { in hasPostorder()
93 unsigned getPostorder(BasicBlock *BB) const { in getPostorder()
101 unsigned getRPO(BasicBlock *BB) const { in getRPO()
153 bool visitPreorder(BasicBlock *BB) { in visitPreorder()
162 void finishPostorder(BasicBlock *BB) { in finishPostorder()
175 finishPostorder(BasicBlock *BB) { in finishPostorder()
|
| D | RegionInfoImpl.h | 54 void RegionBase<Tr>::replaceEntry(BlockT *BB) { in replaceEntry()
59 void RegionBase<Tr>::replaceExit(BlockT *BB) { in replaceExit()
104 BlockT *BB = const_cast<BlockT *>(B); in contains() local
155 BlockT *BB) const { in outermostLoopInRegion()
237 void RegionBase<Tr>::verifyBBInRegion(BlockT *BB) const { in verifyBBInRegion()
263 void RegionBase<Tr>::verifyWalk(BlockT *BB, std::set<BlockT *> *visited) const { in verifyWalk()
324 typename Tr::RegionT *RegionBase<Tr>::getSubRegionNode(BlockT *BB) const { in getSubRegionNode()
344 typename Tr::RegionNodeT *RegionBase<Tr>::getBBNode(BlockT *BB) const { in getBBNode()
359 typename Tr::RegionNodeT *RegionBase<Tr>::getNode(BlockT *BB) const { in getNode()
395 BlockT *BB = (*I)->template getNodeAs<BlockT>(); in addSubRegion() local
[all …]
|
| D | LoopInfo.h | 118 bool contains(const BlockT *BB) const { in contains()
167 bool isLoopExiting(const BlockT *BB) const { in isLoopExiting()
301 void addBlockEntry(BlockT *BB) { in addBlockEntry()
319 void moveToHeader(BlockT *BB) { in moveToHeader()
334 void removeBlockFromLoop(BlockT *BB) { in removeBlockFromLoop()
352 explicit LoopBase(BlockT *BB) : ParentLoop(nullptr) { in LoopBase()
497 explicit Loop(BasicBlock *BB) : LoopBase<BasicBlock, Loop>(BB) {} in Loop()
558 LoopT *getLoopFor(const BlockT *BB) const { return BBMap.lookup(BB); } in getLoopFor()
569 unsigned getLoopDepth(const BlockT *BB) const { in getLoopDepth()
575 bool isLoopHeader(const BlockT *BB) const { in isLoopHeader()
[all …]
|
| D | RegionIterator.h | 72 NodeType* getISucc(BlockT* BB) const { in getISucc()
86 inline bool isExit(BlockT* BB) const { in isExit()
124 BlockT *BB = isRegionMode() ? getRegionSucc() : *BItor; variable
206 BlockT *BB = *Itor; variable
|
| D | IntervalIterator.h | 49 inline BasicBlock *getNodeHeader(BasicBlock *BB) { return BB; } in getNodeHeader()
56 inline BasicBlock *getSourceGraphNode(Function *, BasicBlock *BB) { in getSourceGraphNode()
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) { in getSourceGraphNode()
68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { in addNodeToInterval()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineLoopInfo.h | 95 inline MachineLoop *getLoopFor(const MachineBasicBlock *BB) const { in getLoopFor()
107 inline unsigned getLoopDepth(const MachineBasicBlock *BB) const { in getLoopDepth()
112 inline bool isLoopHeader(const MachineBasicBlock *BB) const { in isLoopHeader()
132 inline void changeLoopFor(MachineBasicBlock *BB, MachineLoop *L) { in changeLoopFor()
151 void removeBlock(MachineBasicBlock *BB) { in removeBlock()
|
| D | MachineInstrBuilder.h | 252 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
263 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
274 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
291 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
301 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
311 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
326 inline MachineInstrBuilder BuildMI(MachineBasicBlock *BB, in BuildMI()
335 inline MachineInstrBuilder BuildMI(MachineBasicBlock *BB, in BuildMI()
373 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
424 MIBundleBuilder(MachineBasicBlock &BB, in MIBundleBuilder()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineSSAUpdater.cpp | 70 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { in AddAvailableValue()
76 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { in GetValueAtEndOfBlock()
81 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, in LookForIdenticalPHI()
115 MachineBasicBlock *BB, MachineBasicBlock::iterator I, in InsertNewDef()
142 unsigned MachineSSAUpdater::GetValueInMiddleOfBlock(MachineBasicBlock *BB) { in GetValueInMiddleOfBlock()
246 static BlkSucc_iterator BlkSucc_begin(BlkT *BB) { return BB->succ_begin(); } in BlkSucc_begin()
247 static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return BB->succ_end(); } in BlkSucc_end()
276 static void FindPredecessorBlocks(MachineBasicBlock *BB, in FindPredecessorBlocks()
285 static unsigned GetUndefVal(MachineBasicBlock *BB, in GetUndefVal()
297 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI()
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | SSAUpdater.cpp | 58 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) { in AddAvailableValue()
81 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) { in GetValueAtEndOfBlock()
86 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) { in GetValueInMiddleOfBlock()
216 static BlkSucc_iterator BlkSucc_begin(BlkT *BB) { return succ_begin(BB); } in BlkSucc_begin()
217 static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return succ_end(BB); } in BlkSucc_end()
244 static void FindPredecessorBlocks(BasicBlock *BB, in FindPredecessorBlocks()
259 static Value *GetUndefVal(BasicBlock *BB, SSAUpdater *Updater) { in GetUndefVal()
265 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI()
311 Value *SSAUpdater::GetValueAtEndOfBlockInternal(BasicBlock *BB) { in GetValueAtEndOfBlockInternal()
359 BasicBlock *BB = User->getParent(); in run() local
|
| D | Local.cpp | 65 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions, in ConstantFoldTerminator()
189 BasicBlock *BB = SI->getParent(); in ConstantFoldTerminator() local
471 bool llvm::SimplifyInstructionsInBlock(BasicBlock *BB, in SimplifyInstructionsInBlock()
522 void llvm::RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred) { in RemovePredecessorAndSimplify()
610 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { in CanPropagatePredecessorsForPHIs()
680 static Value *selectIncomingValueForBlock(Value *OldVal, BasicBlock *BB, in selectIncomingValueForBlock()
708 BasicBlock *BB = PN->getIncomingBlock(i); in gatherIncomingValuesToPhi() local
728 BasicBlock *BB = PN->getIncomingBlock(i); in replaceUndefValuesInPhi() local
743 static void redirectValuesFromPredecessorsToPhi(BasicBlock *BB, in redirectValuesFromPredecessorsToPhi()
803 bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) { in TryToSimplifyUncondBranchFromEmptyBlock()
[all …]
|
| D | UnifyFunctionExitNodes.cpp | 71 BasicBlock *BB = *I; in runOnFunction() local
109 BasicBlock *BB = *I; in runOnFunction() local
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | MergedLoadStoreMotion.cpp | 199 BasicBlock *MergedLoadStoreMotion::getDiamondTail(BasicBlock *BB) { in getDiamondTail()
210 bool MergedLoadStoreMotion::isDiamondHead(BasicBlock *BB) { in isDiamondHead()
288 void MergedLoadStoreMotion::hoistInstruction(BasicBlock *BB, in hoistInstruction()
333 bool MergedLoadStoreMotion::hoistLoad(BasicBlock *BB, LoadInst *L0, in hoistLoad()
358 bool MergedLoadStoreMotion::mergeLoads(BasicBlock *BB) { in mergeLoads()
439 PHINode *MergedLoadStoreMotion::getPHIOperand(BasicBlock *BB, StoreInst *S0, in getPHIOperand()
461 bool MergedLoadStoreMotion::sinkStore(BasicBlock *BB, StoreInst *S0, in sinkStore()
577 BasicBlock *BB = &*FI++; in runOnFunction() local
|
| D | StructurizeCFG.cpp | 76 void addBlock(BasicBlock *BB, bool Remember = true) { in addBlock()
298 BasicBlock *BB = RN->getEntry(); in orderNodes() local
311 BasicBlock *BB = (*I)->getEntry(); in orderNodes() local
358 BasicBlock *BB = N->getNodeAs<BasicBlock>(); in analyzeLoops() local
421 BasicBlock *BB = N->getEntry(); in gatherPredicates() local
633 void StructurizeCFG::killTerminator(BasicBlock *BB) { in killTerminator()
659 BasicBlock *BB = *I++; in changeExit() local
685 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); in changeExit() local
739 void StructurizeCFG::setPrevNode(BasicBlock *BB) { in setPrevNode()
745 bool StructurizeCFG::dominatesPredicates(BasicBlock *BB, RegionNode *Node) { in dominatesPredicates()
[all …]
|
| D | JumpThreading.cpp | 221 BasicBlock *BB = &*I; in runOnFunction() local
281 static unsigned getJumpThreadDuplicationCost(const BasicBlock *BB, in getJumpThreadDuplicationCost()
391 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, PredValueInfo &Result, in ComputeValueKnownInPredecessors()
677 static unsigned GetBestDestForJumpOnUndef(BasicBlock *BB) { in GetBestDestForJumpOnUndef()
695 static bool hasAddressTakenAndUsed(BasicBlock *BB) { in hasAddressTakenAndUsed()
707 bool JumpThreading::ProcessBlock(BasicBlock *BB) { in ProcessBlock()
888 bool JumpThreading::ProcessImpliedCondition(BasicBlock *BB) { in ProcessImpliedCondition()
1116 FindMostPopularDest(BasicBlock *BB, in FindMostPopularDest()
1175 bool JumpThreading::ProcessThreadableEdges(Value *Cond, BasicBlock *BB, in ProcessThreadableEdges()
1285 BasicBlock *BB = PN->getParent(); in ProcessBranchOnPHI() local
[all …]
|
| /external/llvm/unittests/Transforms/Utils/ |
| D | IntegerDivision.cpp | 34 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
64 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
94 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
124 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
155 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
185 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
215 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
245 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 29 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges() local
72 unsigned llvm::GetSuccessorNumber(const BasicBlock *BB, in GetSuccessorNumber()
113 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop()
143 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany() local
199 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent()); in isPotentiallyReachable() local
|
| D | LazyValueInfo.cpp | 367 void insertResult(Value *Val, BasicBlock *BB, const LVILatticeVal &Result) { in insertResult()
412 bool hasCachedValueInfo(Value *V, BasicBlock *BB) { in hasCachedValueInfo()
424 LVILatticeVal getCachedValueInfo(Value *V, BasicBlock *BB) { in getCachedValueInfo()
477 for (auto &BB : ToErase) in deleted() local
485 void LazyValueInfoCache::eraseBlock(BasicBlock *BB) { in eraseBlock()
520 bool LazyValueInfoCache::hasBlockValue(Value *Val, BasicBlock *BB) { in hasBlockValue()
528 LVILatticeVal LazyValueInfoCache::getBlockValue(Value *Val, BasicBlock *BB) { in getBlockValue()
556 bool LazyValueInfoCache::solveBlockValue(Value *Val, BasicBlock *BB) { in solveBlockValue()
664 Value *Val, BasicBlock *BB) { in solveBlockValueNonLocal()
740 PHINode *PN, BasicBlock *BB) { in solveBlockValuePHINode()
[all …]
|
| D | BranchProbabilityInfo.cpp | 122 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { in calcUnreachableHeuristics()
182 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { in calcMetadataWeights()
244 bool BranchProbabilityInfo::calcColdCallHeuristics(BasicBlock *BB) { in calcColdCallHeuristics()
299 bool BranchProbabilityInfo::calcPointerHeuristics(BasicBlock *BB) { in calcPointerHeuristics()
332 bool BranchProbabilityInfo::calcLoopBranchHeuristics(BasicBlock *BB, in calcLoopBranchHeuristics()
390 bool BranchProbabilityInfo::calcZeroHeuristics(BasicBlock *BB) { in calcZeroHeuristics()
472 bool BranchProbabilityInfo::calcFloatingPointHeuristics(BasicBlock *BB) { in calcFloatingPointHeuristics()
508 bool BranchProbabilityInfo::calcInvokeHeuristics(BasicBlock *BB) { in calcInvokeHeuristics()
688 for (auto BB : post_order(&F.getEntryBlock())) { in calculate() local
|
| D | SparsePropagation.cpp | 91 void SparseSolver::MarkBlockExecutable(BasicBlock *BB) { in MarkBlockExecutable()
222 BasicBlock *BB = TI.getParent(); in visitTerminatorInst() local
316 BasicBlock *BB = BBWorkList.back(); in Solve() local
331 for (auto &BB : F) { in Print() local
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | CFGMST.h | 76 BBInfo &getBBInfo(const BasicBlock *BB) const { in getBBInfo()
88 const BasicBlock *BB = &(F.getEntryBlock()); in buildEdges() local
101 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in buildEdges() local
171 const BasicBlock *BB = BI.first; in dumpEdges() local
|
| /external/llvm/include/llvm/ADT/ |
| D | PostOrderIterator.h | 66 void finishPostorder(NodeType *BB) {} in finishPostorder()
86 void finishPostorder(NodeType *BB) {} in finishPostorder()
107 NodeType *BB = *VisitStack.back().second++; in traverseChild() local
115 po_iterator(NodeType *BB) { in po_iterator()
122 po_iterator(NodeType *BB, SetType &S) in po_iterator()
285 void Initialize(NodeType *BB) { in Initialize()
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 94 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom) in DomTreeNodeBase()
355 NodeT *BB = I->first; in compare() local
377 DomTreeNodeBase<NodeT> *getNode(NodeT *BB) const { in getNode()
558 DomTreeNodeBase<NodeT> *addNewBlock(NodeT *BB, NodeT *DomBB) { in addNewBlock()
577 void changeImmediateDominator(NodeT *BB, NodeT *NewBB) { in changeImmediateDominator()
584 void eraseNode(NodeT *BB) { in eraseNode()
645 DomTreeNodeBase<NodeT> *getNodeForBlock(NodeT *BB) { in getNodeForBlock()
662 NodeT *getIDom(NodeT *BB) const { return IDoms.lookup(BB); } in getIDom()
664 void addRoot(NodeT *BB) { this->Roots.push_back(BB); } in addRoot()
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| D | SIISelLowering.cpp | 142 void SITargetLowering::AppendS_WAITCNT(MachineInstr *MI, MachineBasicBlock &BB, in AppendS_WAITCNT()
149 void SITargetLowering::LowerSI_INTERP(MachineInstr *MI, MachineBasicBlock &BB, in LowerSI_INTERP()
182 MachineBasicBlock &BB, MachineBasicBlock::iterator I, in LowerSI_INTERP_CONST()
203 void SITargetLowering::LowerSI_KIL(MachineInstr *MI, MachineBasicBlock &BB, in LowerSI_KIL()
235 void SITargetLowering::LowerSI_V_CNDLT(MachineInstr *MI, MachineBasicBlock &BB, in LowerSI_V_CNDLT()
|