| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | CGSCCPassManager.h | 112 extern template class LLVM_TEMPLATE_ABI AllAnalysesOn<LazyCallGraph::SCC>; 115 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>; 124 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>; 131 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, 132 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, 135 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, 144 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, 149 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager, 151 : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, 154 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, [all …]
|
| H A D | LazyCallGraph.h | 417 class LLVM_ABI SCC { 425 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function 440 friend raw_ostream &operator<<(raw_ostream &OS, const SCC &C) { 486 bool isParentOf(const SCC &C) const; 494 bool isAncestorOf(const SCC &C) const; 500 bool isChildOf(const SCC &C) const { return C.isParentOf(*this); } in isChildOf() 506 bool isDescendantOf(const SCC &C) const { return C.isAncestorOf(*this); } in isDescendantOf() 549 SmallVector<SCC *, 4> SCCs; 552 SmallDenseMap<SCC *, int, 4> SCCIndices; 573 for (LazyCallGraph::SCC &C : RC) { [all …]
|
| H A D | MLInlineAdvisor.h | 36 void onPassEntry(LazyCallGraph::SCC *SCC) override; 37 void onPassExit(LazyCallGraph::SCC *SCC) override;
|
| H A D | InlineAdvisor.h | 186 virtual void onPassEntry(LazyCallGraph::SCC *SCC = nullptr) {} 191 virtual void onPassExit(LazyCallGraph::SCC *SCC = nullptr) {} 350 LLVM_ABI PreservedAnalyses run(LazyCallGraph::SCC &InitialC,
|
| H A D | CallGraphSCCPass.h | 60 virtual bool runOnSCC(CallGraphSCC &SCC) = 0; 127 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC() argument
|
| H A D | SyntheticCountsUtils.h | 46 static void propagateFromSCC(const SccTy &SCC, GetProfCountTy GetProfCount,
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CGSCCPassManager.cpp | 51 template class LLVM_EXPORT_TEMPLATE AllAnalysesOn<LazyCallGraph::SCC>; 53 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>; 54 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, 59 ModuleAnalysisManager, LazyCallGraph::SCC, LazyCallGraph &>; 67 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, 68 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run() 80 LazyCallGraph::SCC *C = &InitialC; in run() 112 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run() 124 PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA); in run() 137 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>(); in run() [all …]
|
| H A D | LazyCallGraph.cpp | 40 template struct LLVM_EXPORT_TEMPLATE Any::TypeId<const LazyCallGraph::SCC *>; 244 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump() 250 void LazyCallGraph::SCC::verify() { in verify() 286 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf() 299 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf() 306 SmallPtrSet<const SCC *, 16> Visited = {this}; in isAncestorOf() 307 SmallVector<const SCC *, 16> Worklist = {this}; in isAncestorOf() 311 const SCC &C = *Worklist.pop_back_val(); in isAncestorOf() 314 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf() 347 SmallPtrSet<SCC *, 4> SCCSet; in verify() [all …]
|
| H A D | SyntheticCountsUtils.cpp | 24 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC() argument 26 DenseSet<NodeRef> SCCNodes(llvm::from_range, SCC); in propagateFromSCC() 92 for (auto &SCC : reverse(SCCs)) in propagate() local 93 propagateFromSCC(SCC, GetProfCount, AddCount); in propagate()
|
| H A D | GlobalsModRef.cpp | 481 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local 482 assert(!SCC.empty() && "SCC with no functions?"); in CollectSCCMembership() 484 for (auto *CGN : SCC) in CollectSCCMembership() 499 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local 500 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph() 502 Function *F = SCC[0]->getFunction(); in AnalyzeCallGraph() 508 for (auto *Node : SCC) in AnalyzeCallGraph() 532 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph() 560 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph() 570 if (!is_contained(SCC, CalleeNode)) in AnalyzeCallGraph() [all …]
|
| H A D | DependenceGraphBuilder.cpp | 113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local 114 if (SCC.size() > 1) in createPiBlocks() 115 ListOfSCCs.emplace_back(SCC.begin(), SCC.end()); in createPiBlocks()
|
| H A D | CallGraphSCCPass.cpp | 676 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC() argument 689 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC() 693 for (CallGraphNode *CGN : SCC) { in runOnSCC() 710 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | CallGraphUpdater.h | 45 LazyCallGraph::SCC *SCC = nullptr; variable 58 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize() argument 61 this->SCC = &SCC; in initialize() 65 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager(); in initialize()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUPerfHintAnalysis.cpp | 399 bool runOnSCC(CallGraphSCC &SCC) override; 425 CallGraphSCC &SCC) { in runOnSCC() argument 427 for (CallGraphNode *I : SCC) { in runOnSCC() 449 for (LazyCallGraph::SCC &SCC : RC) { in run() 450 if (SCC.size() != 1) in run() 452 Function &F = SCC.begin()->getFunction(); in run() 473 bool AMDGPUPerfHintAnalysisLegacy::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 479 return Impl.runOnSCC(TM, SCC); in runOnSCC()
|
| H A D | SOPInstructions.td | 213 let Uses = [SCC] in { 216 } // End Uses = [SCC] 224 let Defs = [SCC] in { 236 } // End Defs = [SCC] 262 let Defs = [SCC] in { 271 } // End Defs = [SCC] 335 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in { 346 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] 364 let Defs = [SCC] in { 368 } // End Defs = [SCC] [all …]
|
| H A D | SIOptimizeExecMaskingPreRA.cpp | 215 assert(AndSCC.getReg() == AMDGPU::SCC); in optimizeVcndVcmpPair() 217 assert(Andn2SCC.getReg() == AMDGPU::SCC); in optimizeVcndVcmpPair() 389 RecalcRegs.insert(AMDGPU::SCC); in run() 396 RecalcRegs.insert(AMDGPU::SCC); in run()
|
| /freebsd/sys/contrib/device-tree/Bindings/arm/ |
| H A D | vexpress-scc.txt | 4 Test chips for ARM Versatile Express platform implement SCC (Serial 23 - reg: when the SCC is memory mapped, physical address and size of the 25 - interrupts: when the SCC can generate a system-level interrupt
|
| /freebsd/sys/contrib/device-tree/Bindings/crypto/ |
| H A D | fsl-imx-scc.txt | 1 Freescale Security Controller (SCC) 9 - clocks: Should contain the clock driving the SCC core.
|
| /freebsd/sys/dev/scc/ |
| H A D | scc_if.m | 35 # The SCC hardware interface. The core SCC code is hardware independent. 36 # The details of the hardware are abstracted by the SCC hardware interface. 73 # ipend() - query SCC for pending interrupts.
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CallGraphUpdater.cpp | 67 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction() 96 SCC->getOuterRefSCC().replaceNodeFunction(OldLCGN, NewFn); in replaceFunctionWith()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | OpenMPOpt.cpp | 392 void foreachUse(SmallVectorImpl<Function *> &SCC, in foreachUse() 394 for (Function *F : SCC) in foreachUse() 938 OpenMPOpt(SmallVectorImpl<Function *> &SCC, CallGraphUpdater &CGUpdater, in OpenMPOpt() 941 : M(*(*SCC.begin())->getParent()), SCC(SCC), CGUpdater(CGUpdater), in OpenMPOpt() 952 if (SCC.empty()) in run() 957 LLVM_DEBUG(dbgs() << TAG << "Run on SCC with " << SCC.size() in run() 1007 for (Function *F : SCC) { in printICVs() 1025 for (Function *F : SCC) { in printKernels() 1325 RFI.foreachUse(SCC, DetectPRsCB); in mergeParallelRegions() 1478 RFI.foreachUse(SCC, DeleteCallCB); in deleteParallelRegions() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/ |
| H A D | CoroAnnotationElide.h | 29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
|
| H A D | CoroSplit.h | 49 LLVM_ABI PreservedAnalyses run(LazyCallGraph::SCC &C,
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | ArgumentPromotion.h | 29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
|
| /freebsd/tools/kerneldoc/subsys/ |
| H A D | Doxyfile-dev_scc | 6 PROJECT_NAME = "FreeBSD kernel SCC device code"
|