Home
last modified time | relevance | path

Searched full:scc (Results 1 – 25 of 200) sorted by relevance

12345678

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp49 template class AllAnalysesOn<LazyCallGraph::SCC>;
50 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
51 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
55 LazyCallGraph::SCC, LazyCallGraph &>;
62 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
63 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
73 // The SCC may be refined while we are running passes over it, so set up in run()
75 LazyCallGraph::SCC *C = &InitialC; in run()
89 // Update the SCC if necessary. in run()
102 // If the CGSCC pass wasn't able to provide a valid updated SCC, the in run()
[all …]
H A DSyntheticCountsUtils.cpp21 // Given an SCC, propagate entry counts along the edge of the SCC nodes.
24 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC() argument
29 for (auto &Node : SCC) in propagateFromSCC()
32 // Partition the edges coming out of the SCC into those whose destination is in propagateFromSCC()
33 // in the SCC and the rest. in propagateFromSCC()
43 // For nodes in the same SCC, update the counts in two steps: in propagateFromSCC()
46 // SCC and summing them up. in propagateFromSCC()
47 // 2. Add the additional counts to the nodes in the SCC. in propagateFromSCC()
49 // traversal of nodes within the SCC doesn't affect the final result. in propagateFromSCC()
60 // Update the counts for the nodes in the SCC. in propagateFromSCC()
[all …]
H A DLazyCallGraph.cpp242 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump()
248 void LazyCallGraph::SCC::verify() { in verify()
250 assert(!Nodes.empty() && "Can't have an empty SCC!"); in verify()
255 "Node does not map to this SCC!"); in verify()
257 "Must set DFS numbers to -1 when adding a node to an SCC!"); in verify()
259 "Must set low link to -1 when adding a node to an SCC!"); in verify()
264 // Verify that all nodes in this SCC can reach all other nodes. in verify()
277 "Cannot reach all nodes within SCC"); in verify()
284 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
297 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
[all …]
H A DCallGraphSCCPass.cpp12 // call-graph in SCC order: that is, they process function bottom-up, except for
51 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
78 // CGPassManager walks SCC and it needs CallGraph. in getAnalysisUsage()
90 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n"; in dumpPassStructure()
174 // Run pass P on all functions in the current SCC. in RunPassOnSCC()
189 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: " << P->getPassName() in RunPassOnSCC()
209 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size() in RefreshCallGraph()
217 // Scan all functions in the SCC. in RefreshCallGraph()
405 // large scc's. in RefreshCallGraph()
411 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n"; in RefreshCallGraph()
[all …]
H A DDependenceGraphBuilder.cpp98 // 1. Identify SCCs and for each SCC create a pi-block node containing all in createPiBlocks()
99 // the nodes in that SCC. in createPiBlocks()
100 // 2. Identify incoming edges incident to the nodes inside of the SCC and in createPiBlocks()
102 // 3. Identify outgoing edges from the nodes inside of the SCC to nodes in createPiBlocks()
104 // SCC node instead. in createPiBlocks()
106 // Adding nodes as we iterate through the SCCs cause the SCC in createPiBlocks()
108 // collect a list of nodes that are part of an SCC, and then iterate over in createPiBlocks()
110 // list of nodes in an SCC. Note: trivial SCCs containing a single node are in createPiBlocks()
113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local
114 if (SCC.size() > 1) in createPiBlocks()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h66 /// entries that become dead. This extra data is provided to every SCC pass so
112 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
114 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
123 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
130 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
131 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
134 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
140 /// a sequence of SCC passes over each SCC that the manager is run over. This
143 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
148 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
[all …]
H A DCallGraphSCCPass.h12 // SCC order: that is, they process function bottom-up, except for recursive
46 /// doInitialization - This method is called before the SCC's of the program
53 /// whatever action is necessary for the specified SCC. Note that
54 /// non-recursive (or only self-recursive) functions will have an SCC size of
55 /// 1, where recursive portions of the call graph will have SCC size > 1.
57 /// SCC passes that add or delete functions to the SCC are required to update
58 /// the SCC list, otherwise stale pointers may be dereferenced.
59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
61 /// doFinalization - This method is called after the SCC's of the program has
83 bool skipSCC(CallGraphSCC &SCC) const;
[all …]
H A DLazyCallGraph.h20 /// visited prior to a caller (given any SCC constraints), or vice versa. As
69 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
71 /// that functions already visited in a bottom-up order of the SCC DAG are no
73 /// a bottom-up order of the SCC DAG are not required to have already been
77 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
78 /// in the SCC DAG, the more independence there is in optimizing within it.
114 class SCC; variable
377 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
408 /// An SCC of the call graph.
412 /// a collection of call graph nodes. While the order of nodes in the SCC is
[all …]
H A DBranchProbabilityInfo.h216 // Enum of types to classify basic blocks in SCC. Basic block belonging to
217 // SCC is 'Inner' until it is either 'Header' or 'Exiting'. Note that a
224 // Map of basic blocks to SCC IDs they belong to. If basic block doesn't
225 // belong to any SCC it is not in the map.
227 // Each basic block in SCC is attributed with one or several types from
234 // vector element corresponds to SCC with ID equal to i.
243 /// If \p BB belongs to some SCC then ID of that SCC is returned, otherwise
244 /// -1 is returned. If \p BB belongs to more than one SCC at the same time
247 /// Returns true if \p BB is a 'header' block in SCC with \p SccNum ID,
252 /// Returns true if \p BB is an 'exiting' block in SCC with \p SccNum ID,
[all …]
/freebsd/sys/contrib/device-tree/Bindings/arm/
H A Dvexpress-scc.txt4 Test chips for ARM Versatile Express platform implement SCC (Serial
15 - compatible value: "arm,vexpress-scc,<model>", "arm,vexpress-scc";
19 compatible = "arm,vexpress-scc,v2p-ca15_a7", "arm,vexpress-scc";
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
29 scc@7fff0000 {
30 compatible = "arm,vexpress-scc,v2p-ca15_a7", "arm,vexpress-scc";
/freebsd/cddl/contrib/opensolaris/lib/libgen/common/
H A Dgmatch.c65 wchar_t scc, c; in gmatch() local
73 scc = n; in gmatch()
75 scc = cl; in gmatch()
82 return (scc == 0); in gmatch()
88 if (scc <= 0) in gmatch()
111 if (scc < lc || scc > c) in gmatch()
119 if (lc <= scc && in gmatch()
120 scc <= c) in gmatch()
129 if (scc != lc) in gmatch()
136 if (scc == lc) in gmatch()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp74 "intra-scc-cost-multiplier", cl::init(2), cl::Hidden,
77 "new call was previously an intra-SCC call (not relevant when the "
78 "original call was already intra-SCC). This can accumulate over "
82 "multiplied by intra-scc-cost-multiplier). This is to prevent tons of "
83 "inlining through a child SCC which can cause terrible compile times"));
90 /// Allows printing the contents of the advisor after each SCC inliner pass.
92 EnablePostSCCAdvisorPrinting("enable-scc-inline-advisor-printing",
170 // It should still be possible to run the inliner as a stand-alone SCC pass, in getAdvisor()
172 // DefaultInlineAdvisor, which doesn't need to keep state between SCC pass in getAdvisor()
208 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
[all …]
H A DFunctionAttrs.cpp148 /// where SCCNodes is the current SCC.
157 /// and additional memory effects that apply if any of the functions in the SCC
171 // Additional locations accessed if the SCC accesses argmem. in checkFunctionMemoryAccess()
184 // We can optimistically ignore calls to functions in the same SCC, with in checkFunctionMemoryAccess()
191 // Keep track of which additional locations are accessed if the SCC in checkFunctionMemoryAccess()
257 /// Deduce readonly/readnone/writeonly attributes for the SCC.
278 // If the SCC accesses argmem, add recursive accesses resulting from that. in addMemoryAttrs()
478 // Call propagation functions on each SCC in the Index in thinLTOPropagateFunctionAttrs()
490 /// in the same SCC that the pointer data flows into. We use this to build an
491 /// SCC of the arguments.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp9 // An irreducible SCC is one which has multiple "header" blocks, i.e., blocks
10 // with control-flow edges incident from outside the SCC. This pass converts a
11 // irreducible SCC into a natural loop by applying the following transformation:
13 // 1. Collect the set of headers H of the SCC.
15 // well as outside the SCC.
18 // This converts the SCC into a natural loop with N as the header: N is the only
19 // block with edges incident from outside the SCC, and all backedges in the SCC
48 // The transformation is applied to every maximal SCC that is not already
51 // including inside any newly created loops. This ensures that any SCC hidde
272 for (auto Scc = scc_begin(G); !Scc.isAtEnd(); ++Scc) { makeReducible() local
[all...]
/freebsd/sys/dev/dpaa2/
H A Dmemac_mdio_acpi.c58 struct memacphy_softc_common scc; member
70 memacphy_miibus_statchg(&sc->scc); in memacphy_acpi_miibus_statchg()
79 return (memacphy_set_ni_dev(&sc->scc, nidev)); in memacphy_acpi_set_ni_dev()
88 return (memacphy_get_phy_loc(&sc->scc, phy_loc)); in memacphy_acpi_get_phy_loc()
107 sc->scc.dev = dev; in memacphy_acpi_attach()
119 sc->scc.phy = sc->phy_channel; in memacphy_acpi_attach()
121 sc->scc.phy = -1; in memacphy_acpi_attach()
128 sc->compatible[0] != '\0' ? sc->compatible : "", sc->scc.phy); in memacphy_acpi_attach()
130 if (sc->scc.phy == -1) in memacphy_acpi_attach()
164 struct memac_mdio_softc_common scc; member
[all …]
H A Dmemac_mdio_fdt.c59 struct memacphy_softc_common scc; member
70 memacphy_miibus_statchg(&sc->scc); in memacphy_fdt_miibus_statchg()
79 return (memacphy_set_ni_dev(&sc->scc, nidev)); in memacphy_fdt_set_ni_dev()
88 return (memacphy_get_phy_loc(&sc->scc, phy_loc)); in memacphy_fdt_get_phy_loc()
111 sc->scc.dev = dev; in memacphy_fdt_attach()
117 sc->scc.phy = sc->reg; in memacphy_fdt_attach()
119 sc->scc.phy = -1; in memacphy_fdt_attach()
128 node, ofw_bus_get_name(dev), sc->reg, sc->xref, sc->scc.phy); in memacphy_fdt_attach()
130 if (sc->scc.phy == -1) in memacphy_fdt_attach()
169 struct memac_mdio_softc_common scc; member
[all …]
/freebsd/sys/contrib/device-tree/Bindings/crypto/
H A Dfsl-imx-scc.yaml4 $id: http://devicetree.org/schemas/crypto/fsl-imx-scc.yaml#
7 title: Freescale Security Controller (SCC)
14 const: fsl,imx25-scc
21 - description: SCC SCM interrupt
22 - description: SCC SMN interrupt
48 compatible = "fsl,imx25-scc";
H A Dfsl-imx-scc.txt1 Freescale Security Controller (SCC)
4 - compatible : Should be "fsl,imx25-scc".
9 - clocks: Should contain the clock driving the SCC core.
14 scc: crypto@53fac000 {
15 compatible = "fsl,imx25-scc";
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h14 /// The SCC iterator has the important property that if a node in SCC S1 has an
15 /// edge to a node in SCC S2, then it visits S1 *after* S2.
41 /// of the SCC DAG.
44 /// build up a vector of nodes in a particular SCC. Note that it is a forward
71 /// The visit counters used to detect when a complete SCC is on the stack.
78 /// Stack holding nodes of the SCC.
81 /// The current SCC, retrieved using operator*().
94 /// Compute the next SCC using the DFS traversal.
128 assert(!CurrentSCC.empty() && "Dereferencing END SCC iterator!");
132 /// Test if the current SCC has a cycle.
[all …]
/freebsd/sys/contrib/device-tree/Bindings/soc/fsl/cpm_qe/
H A Dfsl,cpm1-scc-qmc.yaml4 $id: http://devicetree.org/schemas/soc/fsl/cpm_qe/fsl,cpm1-scc-qmc.yaml#
20 - fsl,mpc885-scc-qmc
21 - fsl,mpc866-scc-qmc
22 - const: fsl,cpm1-scc-qmc
26 - description: SCC (Serial communication controller) register base
27 - description: SCC parameter ram base
38 description: SCC interrupt line in the CPM interrupt controller
107 - fsl,mpc885-scc-qmc-hdlc
108 - fsl,mpc866-scc-qmc-hdlc
109 - const: fsl,cpm1-scc
[all...]
H A Dserial.txt6 - fsl,cpm1-scc-uart
7 - fsl,cpm2-scc-uart
23 compatible = "fsl,mpc8272-scc-uart",
24 "fsl,cpm2-scc-uart";
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h44 LazyCallGraph::SCC *SCC = nullptr; variable
57 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize() argument
60 this->SCC = &SCC; in initialize()
64 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager(); in initialize()
83 /// Replace \p OldFn in the call graph (and SCC) with \p NewFn. The uses
/freebsd/sys/dev/bhnd/cores/chipc/pwrctl/
H A Dbhnd_pwrctl_subr.c492 uint32_t scc; in bhnd_pwrctl_setclk() local
505 scc = bhnd_bus_read_4(sc->res, CHIPC_PLL_SLOWCLK_CTL); in bhnd_pwrctl_setclk()
507 scc = bhnd_bus_read_4(sc->res, CHIPC_SYS_CLK_CTL); in bhnd_pwrctl_setclk()
513 scc &= ~(CHIPC_SCC_XC | CHIPC_SCC_FS | CHIPC_SCC_IP); in bhnd_pwrctl_setclk()
514 scc |= CHIPC_SCC_IP; in bhnd_pwrctl_setclk()
520 scc |= CHIPC_SYCC_HR; in bhnd_pwrctl_setclk()
526 bhnd_bus_write_4(sc->res, CHIPC_PLL_SLOWCLK_CTL, scc); in bhnd_pwrctl_setclk()
528 bhnd_bus_write_4(sc->res, CHIPC_SYS_CLK_CTL, scc); in bhnd_pwrctl_setclk()
536 scc &= ~(CHIPC_SCC_FS | CHIPC_SCC_IP | CHIPC_SCC_XC); in bhnd_pwrctl_setclk()
537 if ((scc & CHIPC_SCC_SS_MASK) != CHIPC_SCC_SS_XTAL) in bhnd_pwrctl_setclk()
[all …]
/freebsd/sys/dev/scc/
H A Dscc_if.m33 #include <dev/scc/scc_bfe.h>
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.
38 INTERFACE scc;
73 # ipend() - query SCC for pending interrupts.
H A Dscc_bfe.h36 * to access the SCC. The rclk field, although not important to actually
37 * access the SCC, is important for baudrate programming, delay loops and
60 * SCC mode (child) and channel control structures.
103 * SCC class & instance (=softc)
108 u_int cl_class; /* SCC bus class ID. */

12345678