Home
last modified time | relevance | path

Searched refs:pred_begin (Results 1 – 25 of 99) sorted by relevance

1234

/openbsd/gnu/llvm/llvm/include/llvm/IR/
H A DCFG.h110 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin() function
111 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin() function
119 return pred_begin(BB) == pred_end(BB); in pred_empty()
124 return std::distance(pred_begin(BB), pred_end(BB)); in pred_size()
127 return pred_range(pred_begin(BB), pred_end(BB)); in predecessors()
130 return const_pred_range(pred_begin(BB), pred_end(BB)); in predecessors()
329 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
338 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DInterval.h109 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin() function
132 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
/openbsd/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h209 return pred_empty() ? nullptr : *(pred_begin()); in getFirstPred()
237 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
241 const_pred_iterator pred_begin() const { in pred_begin() function
242 return const_cast<ExplodedNode*>(this)->pred_begin(); in pred_begin()
/openbsd/gnu/llvm/llvm/lib/IR/
H A DBasicBlock.cpp285 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
293 const_pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
307 return hasNItems(pred_begin(this), pred_end(this), N); in hasNPredecessors()
311 return hasNItemsOrMore(pred_begin(this), pred_end(this), N); in hasNPredecessorsOrMore()
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DMachineLoopUtils.cpp31 MachineBasicBlock *Preheader = *Loop->pred_begin(); in PeelSingleBlockLoop()
33 Preheader = *std::next(Loop->pred_begin()); in PeelSingleBlockLoop()
H A DMachineDominators.cpp127 PredBB = *PredBB->pred_begin(); in applySplitCriticalEdges()
H A DUnreachableBlockElim.cpp153 SmallPtrSet<MachineBasicBlock*, 8> preds(BB.pred_begin(), in runOnMachineFunction()
H A DMachineLateInstrsCleanup.cpp180 MachineBasicBlock *FirstPred = *MBB->pred_begin(); in processBlock()
/openbsd/gnu/llvm/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp80 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin() function in __anonb38266460111::DAGDeltaAlgorithmImpl
203 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl()
336 CurrentSet.insert(pred_begin(CT), pred_end(CT)); in Run()
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp184 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
231 const CFGBlock *pred = *CB->pred_begin(); in isInvalidPath()
H A DUndefBranchChecker.cpp93 ExplodedNode *PrevN = *N->pred_begin(); in checkBranchCondition()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h357 pred_iterator pred_begin() { return Predecessors.begin(); }
358 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
391 return make_range(pred_begin(), pred_end());
394 return make_range(pred_begin(), pred_end());
1248 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
1260 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
/openbsd/gnu/llvm/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp70 for (CFGBlock::const_pred_iterator i = block->pred_begin(), in mapReachability()
H A DReachableCode.cpp435 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in isDeadCodeRoot()
509 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in scanBackwards()
656 CFGBlock::const_pred_iterator PI = B->pred_begin(); in reportDeadCode()
H A DConsumed.cpp97 if (Block->pred_size() == 1 && *Block->pred_begin()) in getLastStmtLoc()
98 return getLastStmtLoc(*Block->pred_begin()); in getLastStmtLoc()
1009 for (CFGBlock::const_pred_iterator PI = TargetBlock->pred_begin(), in allBackEdgesVisited()
1081 for (CFGBlock::const_pred_iterator PI = Block->pred_begin(), in isBackEdgeTarget()
/openbsd/gnu/llvm/clang/include/clang/Analysis/
H A DCFG.h937 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
939 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() function
948 return pred_range(pred_begin(), pred_end()); in preds()
952 return pred_const_range(pred_begin(), pred_end()); in preds()
1030 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
1516 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
1528 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
/openbsd/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64RedundantCopyElimination.cpp154 MachineBasicBlock *PredMBB = *MBB->pred_begin(); in knownRegValInBlock()
285 MachineBasicBlock *PredMBB = *MBB->pred_begin(); in optimizeBlock()
/openbsd/gnu/llvm/llvm/lib/Target/RISCV/
H A DRISCVRedundantCopyElimination.cpp94 MachineBasicBlock *PredMBB = *MBB.pred_begin(); in optimizeBlock()
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp91 const ExplodedNode *pred = *(node->pred_begin()); in shouldCollect()
159 ExplodedNode *pred = *(node->pred_begin()); in collectNode()
/openbsd/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixBrTableDefaults.cpp95 auto *HeaderMBB = *MBB->pred_begin(); in fixBrTableDefault()
/openbsd/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCEarlyReturn.cpp159 MachineBasicBlock &PrevMBB = **ReturnMBB.pred_begin(); in processBlock()
/openbsd/gnu/llvm/llvm/lib/Target/Lanai/
H A DLanaiAsmPrinter.cpp221 const MachineBasicBlock *Pred = *MBB->pred_begin(); in isBlockOnlyReachableByFallthrough()
/openbsd/gnu/llvm/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp44 PredMBB = *MBB->pred_begin(); in getSingleSchedPred()
/openbsd/gnu/llvm/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp315 edge_iterator pred_begin() const { return Preds.begin(); } in pred_begin() function in __anon3d6662b80111::BBState
1444 for (BBState::edge_iterator PI(MyStates.pred_begin()), in VisitBottomUp()
1585 BBState::edge_iterator PI(MyStates.pred_begin()), in VisitTopDown()
1604 if (!BB->hasNPredecessors(MyStates.pred_end() - MyStates.pred_begin())) in VisitTopDown()
1698 PredStack.push_back(std::make_pair(&ExitBB, MyStates.pred_begin())); in ComputePostOrders()
1706 PredStack.push_back(std::make_pair(BB, BBStates[BB].pred_begin())); in ComputePostOrders()
/openbsd/gnu/llvm/llvm/lib/Analysis/
H A DCFG.cpp109 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()

1234