Home
last modified time | relevance | path

Searched defs:BB (Results 1 – 25 of 235) sorted by relevance

12345678910

/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DLoopIterator.h84 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()
DBlockFrequencyImpl.h53 std::string getBlockName(BasicBlock *BB) const { in getBlockName()
62 if (const BasicBlock *BB = MBB->getBasicBlock()) in getBlockName() local
68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) { in setBlockFreq()
82 void incBlockFreq(BlockT *BB, BlockFrequency Freq) { in incBlockFreq()
109 rpot_iterator rpot_at(BlockT *BB) { in rpot_at()
132 BlockT *getSingleBlockPred(BlockT *BB) { in getSingleBlockPred()
149 void doBlock(BlockT *BB, BlockT *LoopHead, in doBlock()
208 BlockT *BB = *I; in doLoop() local
284 BlockT *BB = *I; in doFunction() local
291 BlockT *BB = *I; in doFunction() local
[all …]
DLoopInfo.h112 bool contains(const BlockT *BB) const { in contains()
151 bool isLoopExiting(const BlockT *BB) const { in isLoopExiting()
273 void addBlockEntry(BlockT *BB) { in addBlockEntry()
291 void moveToHeader(BlockT *BB) { in moveToHeader()
306 void removeBlockFromLoop(BlockT *BB) { in removeBlockFromLoop()
321 explicit LoopBase(BlockT *BB) : ParentLoop(0) { in LoopBase()
443 explicit Loop(BasicBlock *BB) : LoopBase<BasicBlock, Loop>(BB) {} in Loop()
489 LoopT *getLoopFor(const BlockT *BB) const { in getLoopFor()
502 unsigned getLoopDepth(const BlockT *BB) const { in getLoopDepth()
508 bool isLoopHeader(BlockT *BB) const { in isLoopHeader()
[all …]
DRegionIterator.h69 RegionNode* getISucc(BasicBlock* BB) const { in getISucc()
83 inline bool isExit(BasicBlock* BB) const { in isExit()
122 BasicBlock* BB = isRegionMode() ? getRegionSucc() : *BItor; variable
209 BasicBlock* BB = *Itor; variable
DIntervalIterator.h49 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()
DDominators.h88 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom) in DomTreeNodeBase()
315 NodeT *BB = I->first; in compare() local
335 inline DomTreeNodeBase<NodeT> *getNode(NodeT *BB) const { in getNode()
495 DomTreeNodeBase<NodeT> *addNewBlock(NodeT *BB, NodeT *DomBB) { in addNewBlock()
514 void changeImmediateDominator(NodeT *BB, NodeT *NewBB) { in changeImmediateDominator()
521 void eraseNode(NodeT *BB) { in eraseNode()
544 void removeNode(NodeT *BB) { in removeNode()
635 DomTreeNodeBase<NodeT> *getNodeForBlock(NodeT *BB) { in getNodeForBlock()
652 inline NodeT *getIDom(NodeT *BB) const { in getIDom()
656 inline void addRoot(NodeT* BB) { in addRoot()
[all …]
/freebsd-9-stable/contrib/llvm/include/llvm/Support/
DCFG.h88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin()
89 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin()
92 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end()
93 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end()
230 inline succ_iterator succ_begin(BasicBlock *BB) { in succ_begin()
233 inline succ_const_iterator succ_begin(const BasicBlock *BB) { in succ_begin()
236 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end()
239 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end()
DPredIteratorCache.h42 BasicBlock **GetPreds(BasicBlock *BB) { in GetPreds()
56 unsigned GetNumPreds(BasicBlock *BB) { in GetNumPreds()
/freebsd-9-stable/contrib/llvm/include/llvm/CodeGen/
DMachineLoopInfo.h99 inline MachineLoop *getLoopFor(const MachineBasicBlock *BB) const { in getLoopFor()
111 inline unsigned getLoopDepth(const MachineBasicBlock *BB) const { in getLoopDepth()
116 inline bool isLoopHeader(MachineBasicBlock *BB) const { in isLoopHeader()
136 inline void changeLoopFor(MachineBasicBlock *BB, MachineLoop *L) { in changeLoopFor()
155 void removeBlock(MachineBasicBlock *BB) { in removeBlock()
DMachineInstrBuilder.h244 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
255 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
266 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
284 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
294 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
304 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
321 inline MachineInstrBuilder BuildMI(MachineBasicBlock *BB, in BuildMI()
331 inline MachineInstrBuilder BuildMI(MachineBasicBlock *BB, in BuildMI()
368 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI()
419 MIBundleBuilder(MachineBasicBlock &BB, in MIBundleBuilder()
[all …]
DMachineDominators.h125 inline MachineDomTreeNode *getNode(MachineBasicBlock *BB) const { in getNode()
132 inline MachineDomTreeNode *addNewBlock(MachineBasicBlock *BB, in addNewBlock()
153 inline void eraseNode(MachineBasicBlock *BB) { in eraseNode()
/freebsd-9-stable/contrib/llvm/lib/CodeGen/
DMachineSSAUpdater.cpp68 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { in AddAvailableValue()
74 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { in GetValueAtEndOfBlock()
79 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, in LookForIdenticalPHI()
113 MachineBasicBlock *BB, MachineBasicBlock::iterator I, in InsertNewDef()
140 unsigned MachineSSAUpdater::GetValueInMiddleOfBlock(MachineBasicBlock *BB) { in GetValueInMiddleOfBlock()
254 static BlkSucc_iterator BlkSucc_begin(BlkT *BB) { return BB->succ_begin(); } in BlkSucc_begin()
255 static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return BB->succ_end(); } in BlkSucc_end()
284 static void FindPredecessorBlocks(MachineBasicBlock *BB, in FindPredecessorBlocks()
293 static unsigned GetUndefVal(MachineBasicBlock *BB, in GetUndefVal()
305 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI()
[all …]
/freebsd-9-stable/contrib/llvm/include/llvm/ADT/
DPostOrderIterator.h65 void finishPostorder(NodeType *BB) {} in finishPostorder()
84 void finishPostorder(NodeType *BB) {} in finishPostorder()
105 NodeType *BB = *VisitStack.back().second++; in traverseChild() local
113 inline po_iterator(NodeType *BB) { in po_iterator()
120 inline po_iterator(NodeType *BB, SetType &S) : in po_iterator()
262 inline void Initialize(NodeType *BB) { in Initialize()
/freebsd-9-stable/contrib/llvm/lib/Analysis/
DCFG.cpp30 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges() local
73 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) { in GetSuccessorNumber()
119 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop()
150 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableInner() local
207 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent()); in isPotentiallyReachable() local
DBranchProbabilityInfo.cpp115 static uint32_t getMaxWeightFor(BasicBlock *BB) { in getMaxWeightFor()
124 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { in calcUnreachableHeuristics()
174 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { in calcMetadataWeights()
218 bool BranchProbabilityInfo::calcColdCallHeuristics(BasicBlock *BB) { in calcColdCallHeuristics()
273 bool BranchProbabilityInfo::calcPointerHeuristics(BasicBlock *BB) { in calcPointerHeuristics()
306 bool BranchProbabilityInfo::calcLoopBranchHeuristics(BasicBlock *BB) { in calcLoopBranchHeuristics()
360 bool BranchProbabilityInfo::calcZeroHeuristics(BasicBlock *BB) { in calcZeroHeuristics()
434 bool BranchProbabilityInfo::calcFloatingPointHeuristics(BasicBlock *BB) { in calcFloatingPointHeuristics()
470 bool BranchProbabilityInfo::calcInvokeHeuristics(BasicBlock *BB) { in calcInvokeHeuristics()
DSparsePropagation.cpp90 void SparseSolver::MarkBlockExecutable(BasicBlock *BB) { in MarkBlockExecutable()
221 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
DLazyValueInfo.cpp348 BasicBlock *BB; member
434 void LazyValueInfoCache::eraseBlock(BasicBlock *BB) { in eraseBlock()
467 bool LazyValueInfoCache::hasBlockValue(Value *Val, BasicBlock *BB) { in hasBlockValue()
479 LVILatticeVal LazyValueInfoCache::getBlockValue(Value *Val, BasicBlock *BB) { in getBlockValue()
488 bool LazyValueInfoCache::solveBlockValue(Value *Val, BasicBlock *BB) { in solveBlockValue()
585 Value *Val, BasicBlock *BB) { in solveBlockValueNonLocal()
661 PHINode *PN, BasicBlock *BB) { in solveBlockValuePHINode()
698 BasicBlock *BB) { in solveBlockValueConstantRange()
912 LVILatticeVal LazyValueInfoCache::getValueInBlock(Value *V, BasicBlock *BB) { in getValueInBlock()
1051 Constant *LazyValueInfo::getConstant(Value *V, BasicBlock *BB) { in getConstant()
[all …]
/freebsd-9-stable/contrib/llvm/lib/Transforms/Utils/
DSSAUpdater.cpp58 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()
215 static BlkSucc_iterator BlkSucc_begin(BlkT *BB) { return succ_begin(BB); } in BlkSucc_begin()
216 static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return succ_end(BB); } in BlkSucc_end()
243 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()
362 BasicBlock *BB = User->getParent(); in run() local
DLocal.cpp59 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions, in ConstantFoldTerminator()
174 BasicBlock *BB = SI->getParent(); in ConstantFoldTerminator() local
398 bool llvm::SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD, in SimplifyInstructionsInBlock()
445 void llvm::RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred, in RemovePredecessorAndSimplify()
532 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { in CanPropagatePredecessorsForPHIs()
602 static Value *selectIncomingValueForBlock(Value *OldVal, BasicBlock *BB, in selectIncomingValueForBlock()
630 BasicBlock *BB = PN->getIncomingBlock(i); in gatherIncomingValuesToPhi() local
650 BasicBlock *BB = PN->getIncomingBlock(i); in replaceUndefValuesInPhi() local
665 static void redirectValuesFromPredecessorsToPhi(BasicBlock *BB, in redirectValuesFromPredecessorsToPhi()
725 bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) { in TryToSimplifyUncondBranchFromEmptyBlock()
[all …]
DUnifyFunctionExitNodes.cpp72 BasicBlock *BB = *I; in runOnFunction() local
110 BasicBlock *BB = *I; in runOnFunction() local
DBasicBlockUtils.cpp36 void llvm::DeleteDeadBlock(BasicBlock *BB) { in DeleteDeadBlock()
68 void llvm::FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P) { in FoldSingleEntryPHINodes()
98 bool llvm::DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI) { in DeleteDeadPHIs()
116 bool llvm::MergeBlockIntoPredecessor(BasicBlock *BB, Pass *P) { in MergeBlockIntoPredecessor()
241 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) { in SplitEdge()
442 BasicBlock *llvm::SplitBlockPredecessors(BasicBlock *BB, in SplitBlockPredecessors()
594 ReturnInst *llvm::FoldReturnIntoUncondBranch(ReturnInst *RI, BasicBlock *BB, in FoldReturnIntoUncondBranch()
681 Value *llvm::GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, in GetIfCondition()
/freebsd-9-stable/contrib/llvm/lib/Transforms/Scalar/
DTailRecursionElimination.cpp143 BasicBlock *BB = AI->getParent(); in CanTRE() local
192 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB) { in runOnFunction() local
211 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in runOnFunction() local
248 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in runOnFunction() local
398 BasicBlock *BB = TI->getParent(); in FindTRECandidate() local
507 BasicBlock *BB = Ret->getParent(); in EliminateRecursiveTailCall() local
623 bool TailCallElim::FoldReturnAndProcessPred(BasicBlock *BB, in FoldReturnAndProcessPred()
DJumpThreading.cpp162 BasicBlock *BB = I; in runOnFunction() local
222 static unsigned getJumpThreadDuplicationCost(const BasicBlock *BB, in getJumpThreadDuplicationCost()
327 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, PredValueInfo &Result, in ComputeValueKnownInPredecessors()
610 static unsigned GetBestDestForJumpOnUndef(BasicBlock *BB) { in GetBestDestForJumpOnUndef()
628 static bool hasAddressTakenAndUsed(BasicBlock *BB) { in hasAddressTakenAndUsed()
640 bool JumpThreading::ProcessBlock(BasicBlock *BB) { in ProcessBlock()
1015 FindMostPopularDest(BasicBlock *BB, in FindMostPopularDest()
1074 bool JumpThreading::ProcessThreadableEdges(Value *Cond, BasicBlock *BB, in ProcessThreadableEdges()
1183 BasicBlock *BB = PN->getParent(); in ProcessBranchOnPHI() local
1213 BasicBlock *BB = BO->getParent(); in ProcessBranchOnXOR() local
[all …]
DStructurizeCFG.cpp71 void addBlock(BasicBlock *BB, bool Remember = true) { in addBlock()
298 BasicBlock *BB = N->getNodeAs<BasicBlock>(); in analyzeLoops() local
370 BasicBlock *BB = N->getEntry(); in gatherPredicates() local
581 void StructurizeCFG::killTerminator(BasicBlock *BB) { in killTerminator()
607 BasicBlock *BB = *I++; in changeExit() local
633 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); in changeExit() local
687 void StructurizeCFG::setPrevNode(BasicBlock *BB) { in setPrevNode()
692 bool StructurizeCFG::dominatesPredicates(BasicBlock *BB, RegionNode *Node) { in dominatesPredicates()
837 BasicBlock *BB = *I; in rebuildSSA() local
/freebsd-9-stable/contrib/llvm/lib/MC/
DMCModule.cpp106 static bool CompBBToAtom(MCBasicBlock *BB, const MCTextAtom *Atom) { in CompBBToAtom()
116 MCBasicBlock *BB = *I; in splitBasicBlocksForAtom() local
122 void MCModule::trackBBForAtom(const MCTextAtom *Atom, MCBasicBlock *BB) { in trackBBForAtom()

12345678910