/Linux-v5.10/mm/ |
D | zpool.c | 108 * the requested module, if needed, but there is no guarantee the module will 149 * Implementations must guarantee this to be thread-safe. 207 * Implementations must guarantee this to be thread-safe, 232 * Implementations must guarantee this to be thread-safe. 248 * Implementations must guarantee this to be thread-safe. 269 * Implementations must guarantee this to be thread-safe. 284 * This frees previously allocated memory. This does not guarantee 288 * Implementations must guarantee this to be thread-safe, 311 * Implementations must guarantee this to be thread-safe.
|
/Linux-v5.10/tools/testing/selftests/rcutorture/formal/srcu-cbmc/include/linux/ |
D | types.h | 129 * The alignment is required to guarantee that bits 0 and 1 of @next will be 133 * This guarantee is important for few reasons: 136 * which encode PageTail() in bit 0. The guarantee is needed to avoid
|
/Linux-v5.10/include/linux/ |
D | rbtree_latch.h | 9 * lockless lookups; we cannot guarantee they return a correct result. 21 * However, while we have the guarantee that there is at all times one stable 22 * copy, this does not guarantee an iteration will not observe modifications. 61 * guarantee on which of the elements matching the key is found. See
|
D | types.h | 206 * The alignment is required to guarantee that bit 0 of @next will be 210 * This guarantee is important for few reasons: 213 * which encode PageTail() in bit 0. The guarantee is needed to avoid
|
D | io.h | 84 * no ioremap API in the kernel that can guarantee non-posted write 88 * guarantee non-posted writes semantics to make the memory mapping
|
D | u64_stats_sync.h | 25 * 4) If reader fetches several counters, there is no guarantee the whole values 51 * snapshot for each variable (but no guarantee on several ones)
|
/Linux-v5.10/fs/verity/ |
D | Kconfig | 50 used to provide an authenticity guarantee for verity files, as 53 authenticity guarantee.
|
/Linux-v5.10/arch/x86/include/asm/vdso/ |
D | gettimeofday.h | 203 * Note: The kernel and hypervisor must guarantee that cpu ID in vread_pvclock() 207 * preemption, it cannot guarantee that per-CPU pvclock time in vread_pvclock() 213 * guarantee than we get with a normal seqlock. in vread_pvclock() 215 * On Xen, we don't appear to have that guarantee, but Xen still in vread_pvclock()
|
/Linux-v5.10/Documentation/networking/ |
D | page_pool.rst | 63 This lockless guarantee naturally comes from running under a NAPI softirq. 64 The protection doesn't strictly have to be NAPI, any guarantee that allocating 87 must guarantee safe context (e.g NAPI), since it will recycle the page
|
/Linux-v5.10/fs/xfs/ |
D | kmem.c | 60 * Same as kmem_alloc_large, except we guarantee the buffer returned is aligned 61 * to the @align_mask. We only guarantee alignment up to page size, we'll clamp
|
/Linux-v5.10/kernel/printk/ |
D | printk_ringbuffer.c | 455 * Guarantee the state is loaded before copying the descriptor in desc_read() 485 * 1. Guarantee the descriptor content is loaded before re-checking in desc_read() 501 * 2. Guarantee the record data is loaded before re-checking the in desc_read() 675 * 1. Guarantee the block ID loaded in in data_push_tail() 702 * 2. Guarantee the descriptor state loaded in in data_push_tail() 742 * Guarantee any descriptor states that have transitioned to in data_push_tail() 827 * Guarantee any descriptor states that have transitioned to in desc_push_tail() 837 * Guarantee the last state load from desc_read() is before in desc_push_tail() 889 * Guarantee the head ID is read before reading the tail ID. in desc_reserve() 923 * 1. Guarantee the tail ID is read before validating the in desc_reserve() [all …]
|
/Linux-v5.10/Documentation/locking/ |
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-v5.10/Documentation/core-api/ |
D | refcount-vs-atomic.rst | 84 Memory ordering guarantee changes: 97 Memory ordering guarantee changes: 108 Memory ordering guarantee changes:
|
/Linux-v5.10/Documentation/driver-api/usb/ |
D | anchors.rst | 55 Therefore no guarantee is made that the URBs have been unlinked when 82 destinations in one anchor you have no guarantee the chronologically
|
/Linux-v5.10/Documentation/ |
D | memory-barriers.txt | 332 of the standard containing this guarantee is Section 3.14, which 382 A write memory barrier gives a guarantee that all the STORE operations 436 A read barrier is a data dependency barrier plus a guarantee that all the 453 A general memory barrier gives a guarantee that all the LOAD and STORE 524 There are certain things that the Linux kernel memory barriers do not guarantee: 526 (*) There is no guarantee that any of the memory accesses specified before a 531 (*) There is no guarantee that issuing a memory barrier on one CPU will have 536 (*) There is no guarantee that a CPU will see the correct order of effects 541 (*) There is no guarantee that some intervening piece of off-the-CPU 878 However, they do -not- guarantee any other sort of ordering: [all …]
|
/Linux-v5.10/kernel/sched/ |
D | membarrier.c | 49 * A sync_core() would provide this guarantee, but in ipi_sync_core() 82 * guarantee that no memory access following registration is reordered in ipi_sync_rq_state() 92 * guarantee that no memory access prior to exec is reordered after in membarrier_exec_mmap() 298 * mm and in the current runqueue to guarantee that no memory in sync_runqueues_membarrier_state()
|
/Linux-v5.10/arch/arc/include/asm/ |
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-v5.10/include/asm-generic/ |
D | atomic.h | 20 * Atomically $ops @i to @v. Does not strictly guarantee a memory-barrier, use 158 * Atomic operations that C can't guarantee us. Useful for
|
/Linux-v5.10/Documentation/sh/ |
D | booting.rst | 8 guarantee any particular initial register state, kernels built to
|
/Linux-v5.10/Documentation/RCU/Design/Requirements/ |
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-v5.10/Documentation/block/ |
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-v5.10/Documentation/RCU/ |
D | UP.rst | 47 its arguments would cause it to fail to make the fundamental guarantee 76 It is far better to guarantee that callbacks are invoked
|
/Linux-v5.10/drivers/net/wireless/ti/wl1251/ |
D | io.c | 145 /* Guarantee that the memory partition doesn't overlap the in wl1251_set_partition() 156 /* Guarantee that the register partition doesn't overlap the in wl1251_set_partition()
|
/Linux-v5.10/arch/s390/kernel/ |
D | kprobes_insn_page.S | 8 * The page must be within the kernel image to guarantee that the
|
/Linux-v5.10/net/smc/ |
D | smc_cdc.c | 47 /* guarantee 0 <= sndbuf_space <= sndbuf_desc->len */ in smc_cdc_tx_handler() 250 /* guarantee 0 <= sndbuf_space <= sndbuf_desc->len */ in smcd_cdc_msg_send() 326 /* guarantee 0 <= peer_rmbe_space <= peer_rmbe_size */ in smc_cdc_msg_recv_action() 338 /* guarantee 0 <= bytes_to_rcv <= rmb_desc->len */ in smc_cdc_msg_recv_action()
|