| /NextBSD/contrib/llvm/include/llvm/IR/ |
| HD | 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() 256 inline succ_iterator succ_begin(BasicBlock *BB) { in succ_begin() 259 inline succ_const_iterator succ_begin(const BasicBlock *BB) { in succ_begin() 262 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() [all …]
|
| HD | 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()
|
| /NextBSD/contrib/llvm/include/llvm/Analysis/ |
| HD | 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()
|
| HD | LoopInfo.h | 113 bool contains(const BlockT *BB) const { in contains() 152 bool isLoopExiting(const BlockT *BB) const { in isLoopExiting() 286 void addBlockEntry(BlockT *BB) { in addBlockEntry() 304 void moveToHeader(BlockT *BB) { in moveToHeader() 319 void removeBlockFromLoop(BlockT *BB) { in removeBlockFromLoop() 337 explicit LoopBase(BlockT *BB) : ParentLoop(nullptr) { in LoopBase() 479 explicit Loop(BasicBlock *BB) : LoopBase<BasicBlock, Loop>(BB) {} in Loop() 540 LoopT *getLoopFor(const BlockT *BB) const { return BBMap.lookup(BB); } in getLoopFor() 551 unsigned getLoopDepth(const BlockT *BB) const { in getLoopDepth() 557 bool isLoopHeader(const BlockT *BB) const { in isLoopHeader() [all …]
|
| HD | 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() 261 void RegionBase<Tr>::verifyWalk(BlockT *BB, std::set<BlockT *> *visited) const { in verifyWalk() 322 typename Tr::RegionT *RegionBase<Tr>::getSubRegionNode(BlockT *BB) const { in getSubRegionNode() 342 typename Tr::RegionNodeT *RegionBase<Tr>::getBBNode(BlockT *BB) const { in getBBNode() 357 typename Tr::RegionNodeT *RegionBase<Tr>::getNode(BlockT *BB) const { in getNode() 393 BlockT *BB = (*I)->template getNodeAs<BlockT>(); in addSubRegion() local [all …]
|
| HD | 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
|
| HD | 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()
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | 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()
|
| HD | MachineInstrBuilder.h | 257 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 268 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 279 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 297 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 307 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 317 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 334 inline MachineInstrBuilder BuildMI(MachineBasicBlock *BB, in BuildMI() 344 inline MachineInstrBuilder BuildMI(MachineBasicBlock *BB, in BuildMI() 384 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() 435 MIBundleBuilder(MachineBasicBlock &BB, in MIBundleBuilder() [all …]
|
| /NextBSD/contrib/llvm/lib/CodeGen/ |
| HD | 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 …]
|
| HD | UnreachableBlockElim.cpp | 75 BasicBlock *BB = I; in runOnFunction() local 134 MachineBasicBlock *BB = I; in runOnMachineFunction() local 170 MachineBasicBlock *BB = I; in runOnMachineFunction() local
|
| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | 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
|
| HD | Local.cpp | 64 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions, in ConstantFoldTerminator() 188 BasicBlock *BB = SI->getParent(); in ConstantFoldTerminator() local 422 bool llvm::SimplifyInstructionsInBlock(BasicBlock *BB, in SimplifyInstructionsInBlock() 469 void llvm::RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred) { in RemovePredecessorAndSimplify() 557 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { in CanPropagatePredecessorsForPHIs() 627 static Value *selectIncomingValueForBlock(Value *OldVal, BasicBlock *BB, in selectIncomingValueForBlock() 655 BasicBlock *BB = PN->getIncomingBlock(i); in gatherIncomingValuesToPhi() local 675 BasicBlock *BB = PN->getIncomingBlock(i); in replaceUndefValuesInPhi() local 690 static void redirectValuesFromPredecessorsToPhi(BasicBlock *BB, in redirectValuesFromPredecessorsToPhi() 750 bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) { in TryToSimplifyUncondBranchFromEmptyBlock() [all …]
|
| HD | UnifyFunctionExitNodes.cpp | 71 BasicBlock *BB = *I; in runOnFunction() local 109 BasicBlock *BB = *I; in runOnFunction() local
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | CFG.cpp | 29 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges() local 72 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) { in GetSuccessorNumber() 112 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop() 142 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany() local 198 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent()); in isPotentiallyReachable() local
|
| HD | BranchProbabilityInfo.cpp | 122 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { in calcUnreachableHeuristics() 172 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { in calcMetadataWeights() 234 bool BranchProbabilityInfo::calcColdCallHeuristics(BasicBlock *BB) { in calcColdCallHeuristics() 289 bool BranchProbabilityInfo::calcPointerHeuristics(BasicBlock *BB) { in calcPointerHeuristics() 322 bool BranchProbabilityInfo::calcLoopBranchHeuristics(BasicBlock *BB) { in calcLoopBranchHeuristics() 379 bool BranchProbabilityInfo::calcZeroHeuristics(BasicBlock *BB) { in calcZeroHeuristics() 461 bool BranchProbabilityInfo::calcFloatingPointHeuristics(BasicBlock *BB) { in calcFloatingPointHeuristics() 497 bool BranchProbabilityInfo::calcInvokeHeuristics(BasicBlock *BB) { in calcInvokeHeuristics() 522 for (auto BB : post_order(&F.getEntryBlock())) { in runOnFunction() local
|
| HD | 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 (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in Print() local
|
| HD | LazyValueInfo.cpp | 358 void insertResult(Value *Val, BasicBlock *BB, const LVILatticeVal &Result) { in insertResult() 442 void LazyValueInfoCache::eraseBlock(BasicBlock *BB) { in eraseBlock() 480 bool LazyValueInfoCache::hasBlockValue(Value *Val, BasicBlock *BB) { in hasBlockValue() 492 LVILatticeVal LazyValueInfoCache::getBlockValue(Value *Val, BasicBlock *BB) { in getBlockValue() 501 bool LazyValueInfoCache::solveBlockValue(Value *Val, BasicBlock *BB) { in solveBlockValue() 603 Value *Val, BasicBlock *BB) { in solveBlockValueNonLocal() 679 PHINode *PN, BasicBlock *BB) { in solveBlockValuePHINode() 753 BasicBlock *BB) { in solveBlockValueConstantRange() 996 LVILatticeVal LazyValueInfoCache::getValueInBlock(Value *V, BasicBlock *BB, in getValueInBlock() 1144 Constant *LazyValueInfo::getConstant(Value *V, BasicBlock *BB, in getConstant() [all …]
|
| /NextBSD/contrib/llvm/include/llvm/ADT/ |
| HD | 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()
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | MergedLoadStoreMotion.cpp | 195 BasicBlock *MergedLoadStoreMotion::getDiamondTail(BasicBlock *BB) { in getDiamondTail() 206 bool MergedLoadStoreMotion::isDiamondHead(BasicBlock *BB) { in isDiamondHead() 285 void MergedLoadStoreMotion::hoistInstruction(BasicBlock *BB, in hoistInstruction() 330 bool MergedLoadStoreMotion::hoistLoad(BasicBlock *BB, LoadInst *L0, in hoistLoad() 355 bool MergedLoadStoreMotion::mergeLoads(BasicBlock *BB) { in mergeLoads() 438 PHINode *MergedLoadStoreMotion::getPHIOperand(BasicBlock *BB, StoreInst *S0, in getPHIOperand() 467 bool MergedLoadStoreMotion::sinkStore(BasicBlock *BB, StoreInst *S0, in sinkStore() 582 BasicBlock *BB = FI++; in runOnFunction() local
|
| HD | SampleProfile.cpp | 193 BasicBlock *BB) { in printBlockEquivalence() 203 void SampleProfileLoader::printBlockWeight(raw_ostream &OS, BasicBlock *BB) { in printBlockWeight() 246 unsigned SampleProfileLoader::getBlockWeight(BasicBlock *BB) { in getBlockWeight() 273 for (auto &BB : F) { in computeBlockWeights() local 343 for (auto &BB : F) { in findEquivalenceClasses() local 392 BasicBlock *BB = &BI; in findEquivalenceClasses() local 436 BasicBlock *BB = &BI; in propagateThroughEdges() local 604 BasicBlock *BB = &BI; in propagateWeights() local
|
| HD | 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 425 BasicBlock *BB = N->getEntry(); in gatherPredicates() local 637 void StructurizeCFG::killTerminator(BasicBlock *BB) { in killTerminator() 663 BasicBlock *BB = *I++; in changeExit() local 689 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); in changeExit() local 743 void StructurizeCFG::setPrevNode(BasicBlock *BB) { in setPrevNode() 749 bool StructurizeCFG::dominatesPredicates(BasicBlock *BB, RegionNode *Node) { in dominatesPredicates() [all …]
|
| HD | JumpThreading.cpp | 179 BasicBlock *BB = I; in runOnFunction() local 239 static unsigned getJumpThreadDuplicationCost(const BasicBlock *BB, in getJumpThreadDuplicationCost() 344 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, PredValueInfo &Result, in ComputeValueKnownInPredecessors() 630 static unsigned GetBestDestForJumpOnUndef(BasicBlock *BB) { in GetBestDestForJumpOnUndef() 648 static bool hasAddressTakenAndUsed(BasicBlock *BB) { in hasAddressTakenAndUsed() 660 bool JumpThreading::ProcessBlock(BasicBlock *BB) { in ProcessBlock() 1037 FindMostPopularDest(BasicBlock *BB, in FindMostPopularDest() 1096 bool JumpThreading::ProcessThreadableEdges(Value *Cond, BasicBlock *BB, in ProcessThreadableEdges() 1206 BasicBlock *BB = PN->getParent(); in ProcessBranchOnPHI() local 1236 BasicBlock *BB = BO->getParent(); in ProcessBranchOnXOR() local [all …]
|
| /NextBSD/contrib/llvm/include/llvm/Support/ |
| HD | GenericDomTree.h | 94 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom) in DomTreeNodeBase() 355 NodeT *BB = I->first; in compare() local 376 DomTreeNodeBase<NodeT> *getNode(NodeT *BB) const { in getNode() 556 DomTreeNodeBase<NodeT> *addNewBlock(NodeT *BB, NodeT *DomBB) { in addNewBlock() 575 void changeImmediateDominator(NodeT *BB, NodeT *NewBB) { in changeImmediateDominator() 582 void eraseNode(NodeT *BB) { in eraseNode() 643 DomTreeNodeBase<NodeT> *getNodeForBlock(NodeT *BB) { in getNodeForBlock() 660 NodeT *getIDom(NodeT *BB) const { return IDoms.lookup(BB); } in getIDom() 662 void addRoot(NodeT *BB) { this->Roots.push_back(BB); } in addRoot()
|
| /NextBSD/contrib/llvm/lib/Bitcode/Writer/ |
| HD | ValueEnumerator.cpp | 124 for (const BasicBlock &BB : F) in orderModule() local 128 for (const BasicBlock &BB : F) in orderModule() local 134 for (const BasicBlock &BB : F) in orderModule() local 248 for (const BasicBlock &BB : F) in predictUseListOrder() local 252 for (const BasicBlock &BB : F) in predictUseListOrder() local 257 for (const BasicBlock &BB : F) in predictUseListOrder() local 362 for (const BasicBlock &BB : F) in ValueEnumerator() local 739 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in incorporateFunction() local 762 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in incorporateFunction() local 800 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB) in IncorporateFunctionInfoGlobalBBIDs() local
|