| /linux-6.14.4/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 <[email protected]>
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 …]
|
| /linux-6.14.4/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 …]
|
| /linux-6.14.4/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()
30 lockdep_is_held(&rdp->nocb_lock) || in rcu_rdp_is_offloaded()
38 return rcu_segcblist_is_offloaded(&rdp->cblist); in rcu_rdp_is_offloaded()
51 pr_info("\tCONFIG_RCU_FANOUT set to non-default value of %d.\n", in rcu_bootup_announce_oddness()
58 pr_info("\tRCU strict (and thus non-scalable) grace periods are enabled.\n"); in rcu_bootup_announce_oddness()
60 pr_info("\tFour(or more)-level hierarchy is enabled.\n"); in rcu_bootup_announce_oddness()
62 pr_info("\tBuild-time adjustment of leaf fanout to %d.\n", in rcu_bootup_announce_oddness()
[all …]
|
| D | tasks.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Task-based RCU implementations.
24 * struct rcu_tasks_percpu - Per-CPU component of definition for a Tasks-RCU-like mechanism.
26 * @lock: Lock protecting per-CPU callback list.
29 * @urgent_gp: Number of additional non-lazy grace periods.
30 * @rtp_n_lock_retries: Rough lock-contention statistic.
58 * struct rcu_tasks - Definition for a Tasks-RCU-like mechanism.
61 * @tasks_gp_mutex: Mutex protecting grace period, needed during mid-boot dead zone.
62 * @gp_func: This flavor's grace-period-wait function.
64 * @gp_sleep: Per-grace-period sleep to prevent CPU-bound looping.
[all …]
|
| D | tree_exp.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
27 * Return the value that the expedited-grace-period counter will have
46 * Take a snapshot of the expedited-grace-period counter, which is the
71 * Reset the ->expmaskinit values in the rcu_node tree to reflect any
72 * recent CPU-online activity. Note that these masks are not cleared
75 * no-work-to-do fastpath.
98 if (rnp->expmaskinit == rnp->expmaskinitnext) { in sync_exp_reset_tree_hotplug()
104 oldmask = rnp->expmaskinit; in sync_exp_reset_tree_hotplug()
105 rnp->expmaskinit = rnp->expmaskinitnext; in sync_exp_reset_tree_hotplug()
113 mask = rnp->grpmask; in sync_exp_reset_tree_hotplug()
[all …]
|
| /linux-6.14.4/Documentation/RCU/ |
| 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 | 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 | 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 | 17 (prefix "*"), field selection ("->"), assignment ("="), address-of
27 - You must use one of the rcu_dereference() family of primitives
28 to load an RCU-protected pointer, otherwise CONFIG_PROVE_RCU
29 will complain. Worse yet, your code can see random memory-corruption
45 - In the special case where data is added but is never removed
51 - You are only permitted to use rcu_dereference() on pointer values.
57 - Set bits and clear bits down in the must-be-zero low-order
62 - XOR bits to translate pointers, as is done in some
63 classic buddy-allocator algorithms.
68 - Avoid cancellation when using the "+" and "-" infix arithmetic
[all …]
|
| /linux-6.14.4/rust/kernel/ |
| D | revocable.rs | 1 // SPDX-License-Identifier: GPL-2.0
28 /// b: u32,
31 /// fn add_two(v: &Revocable<Example>) -> Option<u32> {
33 /// Some(guard.a + guard.b)
36 /// let v = KBox::pin_init(Revocable::new(Example { a: 10, b: 20 }), GFP_KERNEL).unwrap();
42 /// Sample example as above, but explicitly using the rcu read side lock.
50 /// b: u32,
53 /// fn add_two(v: &Revocable<Example>) -> Option<u32> {
56 /// Some(e.a + e.b)
59 /// let v = KBox::pin_init(Revocable::new(Example { a: 10, b: 20 }), GFP_KERNEL).unwrap();
[all …]
|
| /linux-6.14.4/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 <[email protected]>
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 …]
|
| /linux-6.14.4/drivers/staging/media/atomisp/pci/isp/kernels/xnr/xnr_3.0/ |
| D | ia_css_xnr3.host.c | 1 // SPDX-License-Identifier: GPL-2.0
17 #define XNR_MAX_ALPHA ((1 << (ISP_VEC_ELEMBITS - 1)) - 1)
25 * division look-up table
36 -7213, -5580, -4371, -3421, -2722, -2159, -6950, -5585,
37 -4529, -3697, -3010, -2485, -2070, -1727, -1428, 0
40 static const s16 b[XNR3_LOOK_UP_TABLE_POINTS] = { variable
96 s32 offset = host_scale / 2; /* fixed-point 0.5 */ in compute_coring()
98 /* Convert from public host-side scale factor to isp-side scale in compute_coring()
99 * factor. Clip to [0, isp_scale-1). in compute_coring()
102 return clamp(isp_coring, 0, isp_scale - 1); in compute_coring()
[all …]
|
| /linux-6.14.4/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 …]
|
| /linux-6.14.4/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 …]
|
| /linux-6.14.4/tools/perf/pmu-events/arch/x86/broadwellx/ |
| D | uncore-interconnect.json | 7 …-width (L0) mode, flits are made up of four fits, each of which contains 20 bits of data (along wi…
17 …-width (L0) mode, flits are made up of four fits, each of which contains 20 bits of data (along wi…
131 … "BriefDescription": "Misc Events - Set 0; Cache Inserts of Atomic Transactions as Secondary",
136 …"PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Atomic Transactions as Secondary",
141 "BriefDescription": "Misc Events - Set 0; Cache Inserts of Read Transactions as Secondary",
146 … "PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Read Transactions as Secondary",
151 "BriefDescription": "Misc Events - Set 0; Cache Inserts of Write Transactions as Secondary",
156 … "PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Write Transactions as Secondary",
161 "BriefDescription": "Misc Events - Set 0; Fastpath Rejects",
166 "PublicDescription": "Counts Timeouts - Set 0 : Fastpath Rejects",
[all …]
|
| /linux-6.14.4/tools/perf/pmu-events/arch/x86/haswellx/ |
| D | uncore-interconnect.json | 7 …-width (L0) mode, flits are made up of four fits, each of which contains 20 bits of data (along wi…
17 …-width (L0) mode, flits are made up of four fits, each of which contains 20 bits of data (along wi…
131 … "BriefDescription": "Misc Events - Set 0; Cache Inserts of Atomic Transactions as Secondary",
136 …"PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Atomic Transactions as Secondary",
141 "BriefDescription": "Misc Events - Set 0; Cache Inserts of Read Transactions as Secondary",
146 … "PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Read Transactions as Secondary",
151 "BriefDescription": "Misc Events - Set 0; Cache Inserts of Write Transactions as Secondary",
156 … "PublicDescription": "Counts Timeouts - Set 0 : Cache Inserts of Write Transactions as Secondary",
161 "BriefDescription": "Misc Events - Set 0; Fastpath Rejects",
166 "PublicDescription": "Counts Timeouts - Set 0 : Fastpath Rejects",
[all …]
|
| /linux-6.14.4/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 -
34 #define ULONG_CMP_GE(a, b) (ULONG_MAX / 2 >= (a) - (b)) argument
35 #define ULONG_CMP_LT(a, b) (ULONG_MAX / 2 < (a) - (b)) argument
38 #define RCU_SEQ_STATE_MASK ((1 << RCU_SEQ_CTR_SHIFT) - 1)
50 // not-yet-completed RCU grace periods.
54 * same_state_synchronize_rcu - Are two old-state values identical?
55 * @oldstate1: First old-state value.
56 * @oldstate2: Second old-state value.
[all …]
|
| D | bpf_mprog.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
10 * bpf_mprog is a generic layer for multi-program attachment. In-kernel users
15 * inside the multi-program array as well as prepend and append behavior if
26 * // bpf_mprog user-side lock
40 * // bpf_mprog user-side unlock
47 * // bpf_mprog user-side lock
52 * // all (*) marked is optional and depends on the use-case
65 * // bpf_mprog user-side unlock
72 * // bpf_mprog user-side lock
76 * // bpf_mprog user-side unlock
[all …]
|
| /linux-6.14.4/drivers/block/rnbd/ |
| D | rnbd-proto.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
5 * Copyright (c) 2014 - 2018 ProfitBricks GmbH. All rights reserved.
6 * Copyright (c) 2018 - 2019 1&1 IONOS Cloud GmbH. All rights reserved.
7 * Copyright (c) 2019 - 2020 1&1 IONOS SE. All rights reserved.
13 #include <linux/blk-mq.h>
27 * enum rnbd_msg_types - RNBD message types
45 * struct rnbd_msg_hdr - header of RNBD messages
74 * struct rnbd_msg_sess_info - initial session info from client to server
85 * struct rnbd_msg_sess_info_rsp - initial session info from server to client
96 * struct rnbd_msg_open - request to open a remote device.
[all …]
|
| /linux-6.14.4/drivers/block/drbd/ |
| D | drbd_protocol.h | 1 /* SPDX-License-Identifier: GPL-2.0-only */
30 P_RECV_ACK = 0x15, /* Used in protocol B */
33 P_SUPERSEDED = 0x18, /* Used in proto C, two-primaries conflict detection */
55 P_CONN_ST_CHG_REPLY = 0x2b, /* meta sock: Connection side state req reply */
69 * On a receiving side without REQ_WRITE_SAME,
74 P_ZEROES = 0x36, /* data sock: zero-out, WRITE_ZEROES */
135 #define DP_SEND_RECEIVE_ACK 128 /* This is a proto B write request */
147 u64 block_id; /* to identify the request in protocol B&C */
154 u32 size; /* == bio->bi_size */
159 u32 size; /* == bio->bi_size */
[all …]
|
| /linux-6.14.4/drivers/macintosh/ |
| D | via-macii.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * Device driver for the via ADB on (many) Mac II-class machines
13 * 1999-08-02 (jmt) - Initial rewrite for Unified ADB.
14 * 2000-03-29 Tony Mantler <[email protected]-m68k.org>
15 * - Big overhaul, should actually work now.
16 * 2006-12-31 Finn Thain - Another overhaul.
24 * ftp://ftp.apple.com/developer/Tool_Chest/Devices_-_Hardware/Apple_Desktop_Bus/
39 /* VIA registers - spaced 0x200 bytes apart */
41 #define B 0 /* B-side data */ macro
42 #define A RS /* A-side data */
[all …]
|
| D | via-cuda.c | 1 // SPDX-License-Identifier: GPL-2.0
38 /* VIA registers - spaced 0x200 bytes apart */
40 #define B 0 /* B-side data */ macro
41 #define A RS /* A-side data */
42 #define DIRB (2*RS) /* B-side direction (1=output) */
43 #define DIRA (3*RS) /* A-side direction (1=output) */
55 #define ANH (15*RS) /* A-side data, no handshake */
62 * ----------------+------------------------------------------
68 * ----------------+------------------------------------------
74 /* Bits in Port B data register */
[all …]
|
| /linux-6.14.4/Documentation/arch/arm/ |
| D | cluster-pm-race-avoidance.rst | 2 Cluster-wide Power-up/power-down race avoidance algorithm
16 ---------
29 cluster-level operations are only performed when it is truly safe to do
35 disabling those mechanisms may itself be a non-atomic operation (such as
38 power-down and power-up at the cluster level.
46 -----------
50 - DOWN
51 - COMING_UP
52 - UP
53 - GOING_DOWN
[all …]
|
| /linux-6.14.4/arch/arm/kernel/ |
| D | head-nommu.S | 1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * linux/arch/arm/kernel/head-nommu.S
5 * Copyright (C) 1994-2002 Russell King
6 * Copyright (C) 2003-2006 Hyok S. Choi
8 * Common kernel startup code (non-paged MM)
16 #include <asm/asm-offsets.h>
25 * ---------------------------
28 * are: MMU = off, D-cache = off, I-cache = dont care, r0 = 0,
31 * See linux/arch/arm/tools/mach-types for the complete list of machine
46 THUMB( bx r9 ) @ If this is a Thumb-2 kernel,
[all …]
|
| /linux-6.14.4/drivers/tty/serial/ |
| D | zs.c | 1 // SPDX-License-Identifier: GPL-2.0
9 * Copyright (C) 1998-2000 Harald Koerfgen
20 * DIN-7 MJ-4 signal SCC
21 * 2 1 TxD <- A.TxD
22 * 3 4 RxD -> A.RxD
24 * EIA-232/EIA-423:
25 * DB-25 MMJ-6 signal SCC
26 * 2 2 TxD <- B.TxD
27 * 3 5 RxD -> B.RxD
28 * 4 RTS <- ~A.RTS
[all …]
|