Home
last modified time | relevance | path

Searched refs:successors (Results 1 – 25 of 215) sorted by relevance

123456789

/freebsd/share/mk/
H A Dversion_gen.awk61 successors[symver] = "";
83 successors[symver] = v;
213 if (successors[v] != "")
214 print_version(successors[v]);
232 if (successors[v] == "")
235 printf("} %s;\n", successors[v]);
/freebsd/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_taskdeps.cpp37 node->dn.successors = NULL; in __kmp_init_node()
235 if (source_info->successors[i] == task_sink->td_task_id) { in __kmp_track_dependence()
243 kmp_int32 *old_succ_ids = source_info->successors; in __kmp_track_dependence()
246 source_info->successors = new_succ_ids; in __kmp_track_dependence()
250 source_info->successors[source_info->nsuccessors] = task_sink->td_task_id; in __kmp_track_dependence()
294 return td->td_depnode->dn.successors; in __kmpc_task_get_successors()
320 if (!dep->dn.successors || dep->dn.successors->node != node) { in __kmp_depnode_link_successor()
325 dep->dn.successors = __kmp_add_node(thread, dep->dn.successors, node); in __kmp_depnode_link_successor()
362 if (!sink->dn.successors || sink->dn.successors->node != source) { in __kmp_depnode_link_successor()
367 sink->dn.successors = __kmp_add_node(thread, sink->dn.successors, source); in __kmp_depnode_link_successor()
[all …]
H A Dkmp_taskdeps.h101 kmp_int32 successorNumber = TaskInfo->successors[i]; in __kmp_release_deps()
150 for (kmp_depnode_list_t *p = node->dn.successors; p; p = next) { in __kmp_release_deps()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp122 for (BasicBlock *SuccBB : IBr->successors()) in runImpl()
183 for (BasicBlock *SuccBB : IBr->successors()) in runImpl()
226 for (BasicBlock *SuccBB : IBr->successors()) in runImpl()
250 for (BasicBlock *SuccBB : IBr->successors()) in runImpl()
H A DEdgeBundles.cpp49 for (const MachineBasicBlock *Succ : MBB.successors()) in runOnMachineFunction()
88 for (const MachineBasicBlock *Succ : MBB.successors()) in WriteGraph()
H A DMachineBranchProbabilityInfo.cpp56 for (const MachineBasicBlock *Succ : MBB.successors()) in run()
92 return getEdgeProbability(Src, find(Src->successors(), Dst)); in getEdgeProbability()
H A DMachineBlockPlacement.cpp681 for (MachineBasicBlock *Succ : MBB->successors()) { in markBlockSuccessors()
728 for (MachineBasicBlock *Succ : BB->successors()) { in collectViableSuccessors()
776 for (MachineBasicBlock *Succ : BB.successors()) in hasSameSuccessors()
988 for (MachineBasicBlock *CheckSucc : SuccPred->successors()) in isTrellis()
1303 for (MachineBasicBlock *Succ : BB.successors()) { in precomputeTriangleChains()
1976 for (MachineBasicBlock *Succ : Pred->successors()) { in TopFallThroughFreq()
2054 for (MachineBasicBlock *Succ : BestPred->successors()) { in FallThroughGains()
2251 for (MachineBasicBlock *Succ : MBB->successors()) { in findBestLoopExit()
2345 for (MachineBasicBlock *Succ : Pred->successors()) { in hasViableTopFallthrough()
2392 for (MachineBasicBlock *Succ : Bottom->successors()) { in rotateLoop()
[all …]
H A DMachineLoopInfo.cpp171 for (MachineBasicBlock *S : Preheader->successors()) { in findLoopPreheader()
207 for (const auto *Succ : successors(TI)) { in getLoopID()
H A DLoopTraversal.cpp45 for (MachineBasicBlock *Succ : ActiveMBB->successors()) { in traverse()
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp144 for (auto *Succ : MBB->successors()) { in calculate()
404 for (auto *Entry : Pred->successors()) { in makeSingleEntryLoop()
420 for (auto *Entry : Pred->successors()) in makeSingleEntryLoop()
433 for (auto *Entry : Pred->successors()) { in makeSingleEntryLoop()
469 for (auto *Succ : Pred->successors()) { in makeSingleEntryLoop()
H A DWebAssemblyLateEHPrepare.cpp103 SmallVector<MachineBasicBlock *, 4> Succs(MBB->successors()); in eraseDeadBBsAndChildren()
306 SmallVector<MachineBasicBlock *, 8> Succs(MBB.successors()); in removeUnnecessaryUnreachables()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h261 inline succ_range successors(Instruction *I) { in successors() function
264 inline const_succ_range successors(const Instruction *I) { in successors() function
286 inline succ_range successors(BasicBlock *BB) { in successors() function
289 inline const_succ_range successors(const BasicBlock *BB) { in successors() function
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUSetWavePriority.cpp89 for (const MachineBasicBlock *Succ : Pred->successors()) { in CanLowerPriorityDirectlyInPredecessors()
150 for (const MachineBasicBlock *Succ : MBB->successors()) { in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DADCE.cpp290 for (auto *Succ : successors(BB)) in initialize()
403 for (auto *BB : successors(I->getParent())) in markLive()
630 for (auto *Succ : successors(BB)) { in updateDeadRegions()
641 for (auto *Succ : successors(BB)) { in updateDeadRegions()
H A DLoopSimplifyCFG.cpp191 for (auto *Succ : successors(BB)) in hasIrreducibleCFG()
241 for (BasicBlock *Succ : successors(BB)) in analyze()
293 return any_of(successors(BB), [&](BasicBlock *Succ) { in analyze()
492 for (auto *Succ : successors(BB)) in foldTerminators()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h1366 ArrayRef<BasicBlock *> successors();
1368 ArrayRef<BasicBlock *> successors() const { in successors() function
1369 return const_cast<Terminator*>(this)->successors(); in successors()
1394 ArrayRef<BasicBlock *> successors() { return TargetBlock; } in successors() function
1442 ArrayRef<BasicBlock *> successors() { return llvm::ArrayRef(Branches); } in successors() function
1473 ArrayRef<BasicBlock *> successors() { return std::nullopt; } in successors() function
1493 inline ArrayRef<BasicBlock*> Terminator::successors() { in successors() function
1495 case COP_Goto: return cast<Goto>(this)->successors(); in successors()
1496 case COP_Branch: return cast<Branch>(this)->successors(); in successors()
1497 case COP_Return: return cast<Return>(this)->successors(); in successors()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DMoveAutoInit.cpp133 SmallVector<BasicBlock *> WorkList(successors(UsersDominator)); in runMoveAutoInit()
139 // successors. in runMoveAutoInit()
141 for (BasicBlock *Successor : successors(CurrBB)) { in runMoveAutoInit()
H A DDemoteRegToStack.cpp111 for (BasicBlock *Handler : successors(&*InsertPt)) in DemoteRegToStack()
118 for (BasicBlock *Succ : successors(CBI)) in DemoteRegToStack()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86VZeroUpper.cpp274 for (MachineBasicBlock *Succ : MBB.successors()) in processBasicBlock()
347 for (MachineBasicBlock *Succ : MBB.successors()) in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp264 for (const auto *Succ : successors(BB)) in getSccExitBlocks()
296 if (llvm::any_of(successors(BB), [&](const BasicBlock *Succ) { in calculateSccBlockType()
620 if (!CmpLHSConst || !llvm::is_contained(successors(BB), B)) in computeUnlikelySuccessors()
864 auto MaxWeight = getMaxEstimatedEdgeWeight(LoopBB, successors(BB)); in computeEestimateBlockWeight()
892 for (const BasicBlock *SuccBB : successors(BB)) { in calcEstimatedHeuristics()
1078 for (const BasicBlock *Succ : successors(&BI)) in print()
1121 return BranchProbability(llvm::count(successors(Src), Dst), succ_size(Src)); in getEdgeProbability()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCopyHoisting.cpp169 for (MachineBasicBlock *SB : BB->successors()) { in analyzeCopy()
181 for (MachineBasicBlock *SuccBB : BB->successors()) { in analyzeCopy()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp169 for (auto *Block : successors()) in topologicalSort()
238 for (auto *Succ : successors()) { in computePostDominator()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DCFGMST.h49 // Whehter the function has an exit block with no successors.
144 if (int successors = TI->getNumSuccessors()) { in buildEdges()
145 for (int i = 0; i != successors; ++i) { in buildEdges()
130 if (int successors = TI->getNumSuccessors()) { buildEdges() local
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DEHUtils.h45 for (auto *SuccBB : successors(BB)) { in computeEHOnlyBlocks()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h53 llvm::append_range(TmpStorage, successors(Block)); in getExitBlocks()
75 for (BlockT *Succ : successors(Block)) { in getExitingBlocks()
350 llvm::append_range(TraverseStack, successors(Block)); in dfs()

123456789