| /linux/arch/arm64/boot/dts/rockchip/ |
| H A D | rk3588-jaguar-pre-ict-tester.dtso | 90 * To guarantee that, a pull-down is enforced (which is
133 * To guarantee that, a pull-down is enforced (which is
143 * To guarantee that, a pull-down is enforced (which is
153 * To guarantee that, a pull-down is enforced (which is
163 * To guarantee that, a pull-down is enforced (which is
|
| /linux/rust/kernel/ |
| H A D | cred.rs | 48 // SAFETY: The safety requirements guarantee the validity of the dereference, while the in from_ptr()
78 // SAFETY: The type invariants guarantee that `Credential` is always ref-counted. in inc_ref()
88 // SAFETY: The safety requirements guarantee that the refcount is nonzero. The cast is okay
|
| H A D | pid_namespace.rs | 37 // SAFETY: The safety requirements guarantee the validity of the dereference, while the in from_ptr()
53 // SAFETY: The safety requirements guarantee that the refcount is non-zero. in dec_ref()
|
| H A D | build_assert.rs | 11 /// If the compiler or optimizer cannot guarantee that `build_error!` can never
38 /// will panic. If the compiler or optimizer cannot guarantee the condition will
|
| /linux/kernel/sched/ |
| H A D | membarrier.c | 22 * order to enforce the guarantee that any writes occurring on CPU0 before
44 * and r2 == 0. This violates the guarantee that membarrier() is
58 * order to enforce the guarantee that any writes occurring on CPU1 before
79 * the guarantee that membarrier() is supposed to provide.
183 * A sync_core() would provide this guarantee, but in ipi_sync_core()
216 * guarantee that no memory access following registration is reordered in ipi_sync_rq_state()
226 * guarantee that no memory access prior to exec is reordered after in membarrier_exec_mmap()
450 * mm and in the current runqueue to guarantee that no memory in sync_runqueues_membarrier_state()
|
| /linux/kernel/printk/ |
| H A D | printk_ringbuffer.c | 456 * Guarantee the state is loaded before copying the descriptor in desc_read()
488 * 1. Guarantee the descriptor content is loaded before re-checking in desc_read()
504 * 2. Guarantee the record data is loaded before re-checking the in desc_read()
678 * 1. Guarantee the block ID loaded in in data_push_tail()
705 * 2. Guarantee the descriptor state loaded in in data_push_tail()
745 * Guarantee any descriptor states that have transitioned to in data_push_tail()
830 * Guarantee any descriptor states that have transitioned to in desc_push_tail()
840 * Guarantee the last state load from desc_read() is before in desc_push_tail()
892 * Guarantee the head ID is read before reading the tail ID. in desc_reserve()
926 * 1. Guarantee th in desc_reserve()
[all...] |
| /linux/Documentation/locking/ |
| H A D | spinlocks.rst | 19 spinlock itself will guarantee the global lock, so it will guarantee that
117 guarantee the same kind of exclusive access, and it will be much faster.
|
| /linux/include/linux/ |
| H A D | types.h | 231 * The alignment is required to guarantee that bit 0 of @next will be
235 * This guarantee is important for few reasons:
238 * which encode PageTail() in bit 0. The guarantee is needed to avoid
|
| H A D | u64_stats_sync.h | 26 * 4) If reader fetches several counters, there is no guarantee the whole values
47 * snapshot for each variable (but no guarantee on several ones)
|
| /linux/rust/kernel/sync/ |
| H A D | aref.rs | 98 // INVARIANT: The safety requirements guarantee that the new instance now owns the
150 // SAFETY: The type invariants guarantee that the object is valid. in drop()
165 // SAFETY: The type invariants guarantee that the `ARef` owns the reference we're about to
|
| /linux/drivers/firewire/ |
| H A D | core-transaction.c | 52 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in close_transaction()
147 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in start_split_transaction_timeout()
171 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in transmit_complete_callback()
354 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in __fw_send_request()
385 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in __fw_send_request()
393 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in __fw_send_request()
859 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in allocate_request()
1139 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in fw_core_handle_response()
1227 // NOTE: This can be without irqsave when we can guarantee that fw_send_request() for local in handle_topology_map()
1307 // NOTE: This can be without irqsave when we can guarantee that in handle_registers()
[all …]
|
| /linux/Documentation/core-api/kho/ |
| H A D | concepts.rst | 38 We guarantee that we always have such regions through the scratch regions: On
48 guarantee that no handover pages land in that region, because handover pages
|
| /linux/tools/memory-model/Documentation/ |
| H A D | ordering.txt | 101 with void return types) do not guarantee any ordering whatsoever. Nor do
106 operations such as atomic_read() do not guarantee full ordering, and
130 such as atomic_inc() and atomic_dec() guarantee no ordering whatsoever.
150 atomic_inc() implementations do not guarantee full ordering, thus
278 from "x" instead of writing to it. Then an smp_wmb() could not guarantee
501 and further do not guarantee "atomic" access. For example, the compiler
|
| /linux/Documentation/driver-api/ |
| H A D | reset.rst | 87 Exclusive resets on the other hand guarantee direct control.
99 is no guarantee that calling reset_control_assert() on a shared reset control
152 The reset control API does not guarantee the order in which the individual
|
| /linux/Documentation/ |
| H A D | memory-barriers.txt | 331 of the standard containing this guarantee is Section 3.14, which
381 A write memory barrier gives a guarantee that all the STORE operations
444 A read barrier is an address-dependency barrier plus a guarantee that all
461 A general memory barrier gives a guarantee that all the LOAD and STORE
532 There are certain things that the Linux kernel memory barriers do not guarantee:
534 (*) There is no guarantee that any of the memory accesses specified before a
539 (*) There is no guarantee that issuing a memory barrier on one CPU will have
544 (*) There is no guarantee that a CPU will see the correct order of effects
549 (*) There is no guarantee that some intervening piece of off-the-CPU
897 However, they do -not- guarantee any other sort of ordering:
[all …]
|
| /linux/net/smc/ |
| H A D | smc_cdc.c | 46 /* guarantee 0 <= sndbuf_space <= sndbuf_desc->len */ in smc_cdc_tx_handler()
273 /* guarantee 0 <= sndbuf_space <= sndbuf_desc->len */ in smcd_cdc_msg_send()
349 /* guarantee 0 <= peer_rmbe_space <= peer_rmbe_size */ in smc_cdc_msg_recv_action()
367 /* guarantee 0 <= sndbuf_space <= sndbuf_desc->len */ in smc_cdc_msg_recv_action()
384 /* guarantee 0 <= bytes_to_rcv <= rmb_desc->len */ in smc_cdc_msg_recv_action()
|
| /linux/arch/arc/include/asm/ |
| H A D | futex.h | 82 preempt_disable(); /* to guarantee atomic r-m-w of futex op */ in arch_futex_atomic_op_inuser()
131 preempt_disable(); /* to guarantee atomic r-m-w of futex op */ in futex_atomic_cmpxchg_inatomic()
|
| /linux/drivers/net/ethernet/meta/fbnic/ |
| H A D | fbnic_txrx.h | 15 /* Guarantee we have space needed for storing the buffer
21 * If we cannot guarantee that then we should return TX_BUSY
|
| /linux/mm/ |
| H A D | shrinker.c | 492 * step 1: use rcu_read_lock() to guarantee existence of the in shrink_slab_memcg()
497 * step 4: use rcu_read_lock() to guarantee existence of the shrinker. in shrink_slab_memcg()
499 * shrinker_try_get() to guarantee existence of the shrinker, in shrink_slab_memcg()
506 * need to acquire the RCU lock to guarantee existence of in shrink_slab_memcg()
638 * step 1: use rcu_read_lock() to guarantee existence of the shrinker in shrink_slab()
|
| /linux/Documentation/block/ |
| H A D | stat.rst | 15 By having a single file, the kernel can guarantee that the statistics
18 each, it would be impossible to guarantee that a set of readings
|
| /linux/tools/testing/selftests/drivers/net/mlxsw/ |
| H A D | sharedbuffer.sh | 27 # Add egress filter on $h1 that will guarantee that the packet sent,
44 # Add egress filter on $h2 that will guarantee that the packet sent,
|
| /linux/Documentation/arch/sh/ |
| H A D | booting.rst | 8 guarantee any particular initial register state, kernels built to
|
| /linux/Documentation/RCU/Design/Memory-Ordering/ |
| H A D | Tree-RCU-Memory-Ordering.rst | 13 grace-period memory ordering guarantee is provided.
15 What Is Tree RCU's Grace Period Memory Ordering Guarantee?
33 RCU updaters use this guarantee by splitting their updates into
42 The RCU implementation provides this guarantee using a network
145 RCU's grace-period memory ordering guarantee to extend to any
254 Tree RCU's grace-period memory-ordering guarantee is provided by a
272 If RCU's grace-period guarantee is to mean anything at all, any access
275 portion of RCU's grace period guarantee is shown in the following
|
| /linux/drivers/clocksource/ |
| H A D | timer-pxa.c | 116 * register 0 and the OSCR, to guarantee that we will receive in pxa_timer_resume()
118 * to OSCR to guarantee that OSCR is monotonically incrementing. in pxa_timer_resume()
|
| /linux/Documentation/RCU/ |
| H A D | UP.rst | 47 its arguments would cause it to fail to make the fundamental guarantee
77 It is far better to guarantee that callbacks are invoked
|