| /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/zerocopy-derive/derive/ |
| H A D | unaligned.rs | 35 …epr(C)], #[repr(transparent)], or #[repr(packed)] attribute in order to guarantee this type's alig… in derive_unaligned_struct()
52 … "must have #[repr(u8)] or #[repr(i8)] attribute in order to guarantee this type's alignment", in derive_unaligned_enum()
75 …epr(C)], #[repr(transparent)], or #[repr(packed)] attribute in order to guarantee this type's alig… in derive_unaligned_union()
|
| H A D | into_bytes.rs | 57 // guarantee that fields won't overlap [1], so the padding check is in derive_into_bytes_struct()
86 … "must have a non-align #[repr(...)] attribute in order to guarantee this type's memory layout", in derive_into_bytes_struct()
106 … "must have #[repr(C)] or #[repr(Int)] attribute in order to guarantee this type's memory layout", in derive_into_bytes_enum()
|
| /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 | 244 * The alignment is required to guarantee that bit 0 of @next will be
248 * This guarantee is important for few reasons:
251 * which encode PageTail() in bit 0. The guarantee is needed to avoid
|
| /linux/rust/kernel/ |
| 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 | 148 /// If the compiler or optimizer cannot guarantee that `build_error!` can never
176 /// will panic. If the compiler or optimizer cannot guarantee the condition will
|
| /linux/rust/zerocopy/src/pointer/ |
| H A D | invariant.rs | 64 /// all `T: ?Sized`. Any `V: Validity` must guarantee that this set is only a
70 /// `S(T, V)`. Unsafe code must ensure that this guarantee will be upheld for
73 /// An important implication of this guarantee is that it restricts what
86 /// V)`, which would violate the guarantee that `src`'s referent may only
94 /// `x ∈ S(T, V)` but `x ∉ S(U, W)`, which would violate the guarantee that
|
| H A D | transmute.rs | 307 /// DV>` conveys no safety guarantee.
319 /// `SizeEq` on its own conveys no safety guarantee. Any safety guarantees come
413 // guarantee.
441 // term "representation" doesn't guarantee this, but the subsequent sentence
447 // `T`. A consequence of this guarantee is that it is possible to convert
455 // "representation" doesn't guarantee this, but it does promise to have the
469 // `T`. A consequence of this guarantee is that it is possible to convert
|
| /linux/drivers/firewire/ |
| H A D | core-transaction.c | 60 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in fw_cancel_pending_transactions()
102 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in close_transaction()
206 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in transmit_complete_callback()
214 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in transmit_complete_callback()
394 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in __fw_send_request()
425 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in __fw_send_request()
433 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in __fw_send_request()
899 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in allocate_request()
1179 // NOTE: This can be without irqsave when we can guarantee that __fw_send_request() for in fw_core_handle_response()
1259 // NOTE: This can be without irqsave when we can guarantee that fw_send_request() for local in handle_topology_map()
[all …]
|
| /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/drivers/gpu/drm/i915/ |
| H A D | i915_wait_util.h | 28 /* Guarantee COND check prior to timeout */ \
76 /* Guarantee COND check prior to timeout */ \
|
| /linux/rust/kernel/time/ |
| H A D | delay.rs | 45 // the guarantee; `fsleep()` sleeps for at least the provided duration, in fsleep()
81 // the guarantee; `udelay()` inserts a delay for at least in udelay()
|
| /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/rust/kernel/sync/ |
| H A D | aref.rs | 111 // INVARIANT: The safety requirements guarantee that the new instance now owns the
163 // SAFETY: The type invariants guarantee that the object is valid. in from()
178 // SAFETY: The type invariants guarantee that the `ARef` owns the reference we're about to
|
| /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/Documentation/RCU/Design/Requirements/ |
| H A D | Requirements.rst | 58 #. `Grace-Period Guarantee`_
59 #. `Publish/Subscribe Guarantee`_
64 Grace-Period Guarantee
67 RCU's grace-period guarantee is unusual in being premeditated: Jack
68 Slingwine and I had this guarantee firmly in mind when we started work
71 understanding of this guarantee.
73 RCU's grace-period guarantee allows updaters to wait for the completion
83 This guarantee allows ordering to be enforced with extremely low
174 the synchronize_rcu() in start_recovery() to guarantee that
196 Although RCU's grace-period guarantee is useful in and of itself, with
[all …]
|
| /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/mm/ |
| H A D | shrinker.c | 501 * step 1: use rcu_read_lock() to guarantee existence of the in shrink_slab_memcg()
506 * step 4: use rcu_read_lock() to guarantee existence of the shrinker. in shrink_slab_memcg()
508 * shrinker_try_get() to guarantee existence of the shrinker, in shrink_slab_memcg()
515 * need to acquire the RCU lock to guarantee existence of in shrink_slab_memcg()
650 * step 1: use rcu_read_lock() to guarantee existence of the shrinker in shrink_slab()
|
| /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()
|