| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/interrupt-controller/ |
| D | fsl,mu-msi.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/interrupt-controller/fsl,mu-msi.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Frank Li <Frank.Li@nxp.com>
16 for one processor (A side) to signal the other processor (B side) using
20 different clocks (from each side of the different peripheral buses).
21 Therefore, the MU must synchronize the accesses from one side to the
23 registers (Processor A-side, Processor B-side).
28 - $ref: /schemas/interrupt-controller/msi-controller.yaml#
[all …]
|
| /kernel/linux/linux-6.6/Documentation/networking/ |
| D | snmp_counter.rst | 17 .. _RFC1213 ipInReceives: https://tools.ietf.org/html/rfc1213#page-26
30 .. _RFC1213 ipInDelivers: https://tools.ietf.org/html/rfc1213#page-28
41 .. _RFC1213 ipOutRequests: https://tools.ietf.org/html/rfc1213#page-28
60 .. _Explicit Congestion Notification: https://tools.ietf.org/html/rfc3168#page-6
73 .. _RFC1213 ipInHdrErrors: https://tools.ietf.org/html/rfc1213#page-27
81 .. _RFC1213 ipInAddrErrors: https://tools.ietf.org/html/rfc1213#page-27
98 .. _RFC1213 ipInUnknownProtos: https://tools.ietf.org/html/rfc1213#page-27
111 .. _RFC1213 ipInDiscards: https://tools.ietf.org/html/rfc1213#page-28
118 .. _RFC1213 ipOutDiscards: https://tools.ietf.org/html/rfc1213#page-28
125 .. _RFC1213 ipOutNoRoutes: https://tools.ietf.org/html/rfc1213#page-29
[all …]
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | snmp_counter.rst | 17 .. _RFC1213 ipInReceives: https://tools.ietf.org/html/rfc1213#page-26
30 .. _RFC1213 ipInDelivers: https://tools.ietf.org/html/rfc1213#page-28
41 .. _RFC1213 ipOutRequests: https://tools.ietf.org/html/rfc1213#page-28
60 .. _Explicit Congestion Notification: https://tools.ietf.org/html/rfc3168#page-6
73 .. _RFC1213 ipInHdrErrors: https://tools.ietf.org/html/rfc1213#page-27
81 .. _RFC1213 ipInAddrErrors: https://tools.ietf.org/html/rfc1213#page-27
98 .. _RFC1213 ipInUnknownProtos: https://tools.ietf.org/html/rfc1213#page-27
111 .. _RFC1213 ipInDiscards: https://tools.ietf.org/html/rfc1213#page-28
118 .. _RFC1213 ipOutDiscards: https://tools.ietf.org/html/rfc1213#page-28
125 .. _RFC1213 ipOutNoRoutes: https://tools.ietf.org/html/rfc1213#page-29
[all …]
|
| /kernel/linux/linux-5.10/Documentation/RCU/ |
| D | whatisRCU.rst | 3 What is RCU? -- "Read, Copy, Update"
21 during the 2.5 development effort that is optimized for read-mostly
40 :ref:`6. ANALOGY WITH READER-WRITER LOCKING <6_whatisRCU>`
58 everything, feel free to read the whole thing -- but if you are really
60 never need this document anyway. ;-)
65 ----------------
94 b. Wait for all previous readers to complete their RCU read-side
101 Step (b) above is the key idea underlying RCU's deferred destruction.
103 use much lighter-weight synchronization, in some cases, absolutely no
104 synchronization at all. In contrast, in more conventional lock-based
[all …]
|
| D | checklist.rst | 1 .. SPDX-License-Identifier: GPL-2.0
14 0. Is RCU being applied to a read-mostly situation? If the data
18 tool for the job. Yes, RCU does reduce read-side overhead by
19 increasing write-side overhead, which is exactly why normal uses
27 Yet another exception is where the low real-time latency of RCU's
28 read-side primitives is critically important.
33 counter-intuitive situation where rcu_read_lock() and
40 RCU does allow -readers- to run (almost) naked, but -writers- must
44 b. atomic operations, or
47 If you choose #b, be prepared to describe how you have handled
[all …]
|
| D | UP.rst | 16 --------------------------
18 Suppose that an RCU-based algorithm scans a linked list containing
19 elements A, B, and C in process context, and can delete elements from
20 this same list in softirq context. Suppose that the process-context scan
21 is referencing element B when it is interrupted by softirq processing,
22 which deletes element B, and then invokes call_rcu() to free element B
27 element B. This situation can greatly decrease the life expectancy of
33 Example 2: Function-Call Fatality
34 ---------------------------------
40 Suppose that an RCU-based algorithm again scans a linked list containing
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/mailbox/ |
| D | fsl,mu.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Dong Aisheng <aisheng.dong@nxp.com>
19 different clocks (from each side of the different peripheral buses).
20 Therefore, the MU must synchronize the accesses from one side to the
22 registers (Processor A-facing, Processor B-facing).
27 - const: fsl,imx6sx-mu
28 - const: fsl,imx7ulp-mu
29 - const: fsl,imx8-mu-scu
[all …]
|
| /kernel/linux/linux-6.6/Documentation/RCU/ |
| D | whatisRCU.rst | 3 What is RCU? -- "Read, Copy, Update"
21 …ries: Fundamentals https://www.linuxfoundation.org/webinars/unraveling-rcu-usage-mysteries
22 …Cases https://www.linuxfoundation.org/webinars/unraveling-rcu-usage-mysteries-additional-use-cases
28 during the 2.5 development effort that is optimized for read-mostly
47 :ref:`6. ANALOGY WITH READER-WRITER LOCKING <6_whatisRCU>`
67 everything, feel free to read the whole thing -- but if you are really
69 never need this document anyway. ;-)
74 ----------------
103 b. Wait for all previous readers to complete their RCU read-side
110 Step (b) above is the key idea underlying RCU's deferred destruction.
[all …]
|
| D | checklist.rst | 1 .. SPDX-License-Identifier: GPL-2.0
14 0. Is RCU being applied to a read-mostly situation? If the data
18 tool for the job. Yes, RCU does reduce read-side overhead by
19 increasing write-side overhead, which is exactly why normal uses
27 Yet another exception is where the low real-time latency of RCU's
28 read-side primitives is critically important.
33 counter-intuitive situation where rcu_read_lock() and
44 b. atomic operations, or
47 If you choose #b, be prepared to describe how you have handled
49 them -- even x86 allows later loads to be reordered to precede
[all …]
|
| D | UP.rst | 16 --------------------------
18 Suppose that an RCU-based algorithm scans a linked list containing
19 elements A, B, and C in process context, and can delete elements from
20 this same list in softirq context. Suppose that the process-context scan
21 is referencing element B when it is interrupted by softirq processing,
22 which deletes element B, and then invokes call_rcu() to free element B
27 element B. This situation can greatly decrease the life expectancy of
33 Example 2: Function-Call Fatality
34 ---------------------------------
40 Suppose that an RCU-based algorithm again scans a linked list containing
[all …]
|
| D | rcu_dereference.rst | 8 field selection ("->"), assignment ("="), address-of ("&"), addition and
14 - You must use one of the rcu_dereference() family of primitives
15 to load an RCU-protected pointer, otherwise CONFIG_PROVE_RCU
16 will complain. Worse yet, your code can see random memory-corruption
32 - In the special case where data is added but is never removed
38 - You are only permitted to use rcu_dereference() on pointer values.
44 - Set bits and clear bits down in the must-be-zero low-order
49 - XOR bits to translate pointers, as is done in some
50 classic buddy-allocator algorithms.
55 - Avoid cancellation when using the "+" and "-" infix arithmetic
[all …]
|
| /kernel/linux/linux-6.6/kernel/rcu/ |
| D | tree_plugin.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Read-Copy Update mechanism for mutual exclusion (tree-based version)
4 * Internal non-public definitions that provide either classic
23 * non-preemptible reads are also safe. NOCB kthreads and in rcu_rdp_is_offloaded()
37 return rcu_segcblist_is_offloaded(&rdp->cblist); in rcu_rdp_is_offloaded()
50 pr_info("\tCONFIG_RCU_FANOUT set to non-default value of %d.\n", in rcu_bootup_announce_oddness()
57 pr_info("\tRCU strict (and thus non-scalable) grace periods are enabled.\n"); in rcu_bootup_announce_oddness()
59 pr_info("\tFour(or more)-level hierarchy is enabled.\n"); in rcu_bootup_announce_oddness()
61 pr_info("\tBuild-time adjustment of leaf fanout to %d.\n", in rcu_bootup_announce_oddness()
64 pr_info("\tBoot-time adjustment of leaf fanout to %d.\n", in rcu_bootup_announce_oddness()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/mailbox/ |
| D | fsl,mu.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Dong Aisheng <aisheng.dong@nxp.com>
19 different clocks (from each side of the different peripheral buses).
20 Therefore, the MU must synchronize the accesses from one side to the
22 registers (Processor A-facing, Processor B-facing).
27 - const: fsl,imx6sx-mu
28 - const: fsl,imx7ulp-mu
29 - const: fsl,imx8ulp-mu
[all …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/kvm/x86_64/ |
| D | tsc_msrs_test.c | 1 // SPDX-License-Identifier: GPL-2.0
17 #define ROUND(x) ((x + UNITY / 2) & -UNITY)
21 #define GUEST_ASSERT_EQ(a, b) do { \ argument
23 __typeof(b) _b = (b); \
27 #a " == " #b, __LINE__, _a, _b); \
57 * host-side offset and affect both MSRs. in guest_code()
66 * Guest: writes to MSR_IA32_TSC affect both MSRs, so the host-side in guest_code()
73 GUEST_ASSERT_EQ(rounded_rdmsr(MSR_IA32_TSC_ADJUST), val - HOST_ADJUST); in guest_code()
100 exit_reason_str(vcpu_state(vm, vcpuid)->exit_reason)); in run_vcpu()
129 * Host: writes to MSR_IA32_TSC set the host-side offset in main()
[all …]
|
| /kernel/linux/linux-6.6/include/linux/ |
| D | rcupdate.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Read-Copy Update mechanism for mutual exclusion
15 * For detailed explanation of Read-Copy Update mechanism see -
35 #define ULONG_CMP_GE(a, b) (ULONG_MAX / 2 >= (a) - (b)) argument
36 #define ULONG_CMP_LT(a, b) (ULONG_MAX / 2 < (a) - (b)) argument
38 #define USHORT_CMP_GE(a, b) (USHRT_MAX / 2 >= (unsigned short)((a) - (b))) argument
39 #define USHORT_CMP_LT(a, b) (USHRT_MAX / 2 < (unsigned short)((a) - (b))) argument
52 // not-yet-completed RCU grace periods.
56 * same_state_synchronize_rcu - Are two old-state values identical?
57 * @oldstate1: First old-state value.
[all …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | rcupdate.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Read-Copy Update mechanism for mutual exclusion
15 * For detailed explanation of Read-Copy Update mechanism see -
33 #define ULONG_CMP_GE(a, b) (ULONG_MAX / 2 >= (a) - (b)) argument
34 #define ULONG_CMP_LT(a, b) (ULONG_MAX / 2 < (a) - (b)) argument
36 #define USHORT_CMP_GE(a, b) (USHRT_MAX / 2 >= (unsigned short)((a) - (b))) argument
37 #define USHORT_CMP_LT(a, b) (USHRT_MAX / 2 < (unsigned short)((a) - (b))) argument
53 * nesting depth, but makes sense only if CONFIG_PREEMPT_RCU -- in other
56 #define rcu_preempt_depth() (current->rcu_read_lock_nesting)
122 * RCU_NONIDLE - Indicate idle-loop code that needs RCU readers
[all …]
|
| /kernel/linux/linux-5.10/drivers/edac/ |
| D | amd8131_edac.c | 1 // SPDX-License-Identifier: GPL-2.0-only
75 struct pci_dev *dev = dev_info->dev; in amd8131_pcix_init()
87 /* Clear CRC Error flag on link side A */ in amd8131_pcix_init()
92 /* Clear CRC Error flag on link side B */ in amd8131_pcix_init()
112 /* Setup CRC Flood Enable for link side A */ in amd8131_pcix_init()
117 /* Setup CRC Flood Enable for link side B */ in amd8131_pcix_init()
126 struct pci_dev *dev = dev_info->dev; in amd8131_pcix_exit()
138 /* Disable CRC Sync Flood on link side A */ in amd8131_pcix_exit()
143 /* Disable CRC Sync Flood on link side B */ in amd8131_pcix_exit()
151 struct amd8131_dev_info *dev_info = edac_dev->pvt_info; in amd8131_pcix_check()
[all …]
|
| /kernel/linux/linux-6.6/drivers/edac/ |
| D | amd8131_edac.c | 1 // SPDX-License-Identifier: GPL-2.0-only
75 struct pci_dev *dev = dev_info->dev; in amd8131_pcix_init()
87 /* Clear CRC Error flag on link side A */ in amd8131_pcix_init()
92 /* Clear CRC Error flag on link side B */ in amd8131_pcix_init()
112 /* Setup CRC Flood Enable for link side A */ in amd8131_pcix_init()
117 /* Setup CRC Flood Enable for link side B */ in amd8131_pcix_init()
126 struct pci_dev *dev = dev_info->dev; in amd8131_pcix_exit()
138 /* Disable CRC Sync Flood on link side A */ in amd8131_pcix_exit()
143 /* Disable CRC Sync Flood on link side B */ in amd8131_pcix_exit()
151 struct amd8131_dev_info *dev_info = edac_dev->pvt_info; in amd8131_pcix_check()
[all …]
|
| /kernel/linux/linux-5.10/kernel/rcu/ |
| D | tasks.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Task-based RCU implementations.
23 * Definition for a Tasks-RCU-like mechanism.
28 * @kthread_ptr: This flavor's grace-period/callback-invocation kthread.
29 * @gp_func: This flavor's grace-period-wait function.
31 * @gp_sleep: Per-grace-period sleep to prevent CPU-bound looping.
34 * @gp_start: Most recent grace-period start in jiffies.
37 * @n_ipis_fails: Number of IPI-send failures.
38 * @pregp_func: This flavor's pre-grace-period function (optional).
39 * @pertask_func: This flavor's per-task scan function (optional).
[all …]
|
| /kernel/linux/linux-6.6/arch/arm/mach-at91/ |
| D | pm_suspend.S | 1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * arch/arm/mach-at91/pm_slow_clock.S
13 #include "pm_data-offsets.h"
16 .arch armv7-a
32 * Side effects: overwrites r7, r8
39 b 2f
45 bne 2b
51 * Side effects: overwrites r7
56 beq 1b
62 * Side effects: overwrites r7
[all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/broadwellx/ |
| D | uncore-interconnect.json | 6 …-width (L0) mode, flits are made up of four fits, each of which contains 20 bits of data (along wi…
15 …-width (L0) mode, flits are made up of four fits, each of which contains 20 bits of data (along wi…
118 … "BriefDescription": "Misc Events - Set 0; Cache Inserts of Atomic Transactions as Secondary",
122 …"PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Atomic Transactions as Secondary",
127 "BriefDescription": "Misc Events - Set 0; Cache Inserts of Read Transactions as Secondary",
131 … "PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Read Transactions as Secondary",
136 "BriefDescription": "Misc Events - Set 0; Cache Inserts of Write Transactions as Secondary",
140 … "PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Write Transactions as Secondary",
145 "BriefDescription": "Misc Events - Set 0; Fastpath Rejects",
149 "PublicDescription": "Counts Timeouts - Set 0 : Fastpath Rejects",
[all …]
|
| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/xnr/xnr_3.0/ |
| D | ia_css_xnr3.host.c | 1 // SPDX-License-Identifier: GPL-2.0
24 #define XNR_MAX_ALPHA ((1 << (ISP_VEC_ELEMBITS - 1)) - 1)
32 * division look-up table
43 -7213, -5580, -4371, -3421, -2722, -2159, -6950, -5585,
44 -4529, -3697, -3010, -2485, -2070, -1727, -1428, 0
47 static const s16 b[XNR3_LOOK_UP_TABLE_POINTS] = { variable
103 s32 offset = host_scale / 2; /* fixed-point 0.5 */ in compute_coring()
105 /* Convert from public host-side scale factor to isp-side scale in compute_coring()
106 * factor. Clip to [0, isp_scale-1). in compute_coring()
109 return min(max(isp_coring, 0), isp_scale - 1); in compute_coring()
[all …]
|
| /kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/isp/kernels/xnr/xnr_3.0/ |
| D | ia_css_xnr3.host.c | 1 // SPDX-License-Identifier: GPL-2.0
24 #define XNR_MAX_ALPHA ((1 << (ISP_VEC_ELEMBITS - 1)) - 1)
32 * division look-up table
43 -7213, -5580, -4371, -3421, -2722, -2159, -6950, -5585,
44 -4529, -3697, -3010, -2485, -2070, -1727, -1428, 0
47 static const s16 b[XNR3_LOOK_UP_TABLE_POINTS] = { variable
103 s32 offset = host_scale / 2; /* fixed-point 0.5 */ in compute_coring()
105 /* Convert from public host-side scale factor to isp-side scale in compute_coring()
106 * factor. Clip to [0, isp_scale-1). in compute_coring()
109 return min(max(isp_coring, 0), isp_scale - 1); in compute_coring()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/RCU/Design/Requirements/ |
| D | Requirements.rst | 16 ------------
18 Read-copy update (RCU) is a synchronization mechanism that is often used
19 as a replacement for reader-writer locking. RCU is unusual in that
20 updaters do not block readers, which means that RCU's read-side
28 thought of as an informal, high-level specification for RCU. It is
40 #. `Fundamental Non-Requirements`_
42 #. `Quality-of-Implementation Requirements`_
44 #. `Software-Engineering Requirements`_
53 ------------------------
58 #. `Grace-Period Guarantee`_
[all …]
|
| /kernel/linux/linux-5.10/Documentation/RCU/Design/Requirements/ |
| D | Requirements.rst | 16 ------------
18 Read-copy update (RCU) is a synchronization mechanism that is often used
19 as a replacement for reader-writer locking. RCU is unusual in that
20 updaters do not block readers, which means that RCU's read-side
28 thought of as an informal, high-level specification for RCU. It is
40 #. `Fundamental Non-Requirements`_
42 #. `Quality-of-Implementation Requirements`_
44 #. `Software-Engineering Requirements`_
53 ------------------------
58 #. `Grace-Period Guarantee`_
[all …]
|