| /linux/rust/kernel/sync/ |
| H A D | atomic.rs | 269 pub fn load<Ordering: ordering::AcquireOrRelaxed>(&self, _: Ordering) -> T { in load()
271 match Ordering::TYPE { in load()
299 pub fn store<Ordering: ordering::ReleaseOrRelaxed>(&self, v: T, _: Ordering) { in store() argument
303 match Ordering::TYPE { in store()
340 pub fn xchg<Ordering: ordering::Ordering>(&self, v: T, _: Ordering) -> T { in xchg()
346 match Ordering::TYPE { in xchg()
411 pub fn cmpxchg<Ordering: ordering::Ordering>( in cmpxchg()
415 o: Ordering, in cmpxchg() argument
458 fn try_cmpxchg<Ordering: ordering::Ordering>(&self, old: &mut T, new: T, _: Ordering) -> bool { in try_cmpxchg()
465 match Ordering::TYPE { in try_cmpxchg()
[all …]
|
| /linux/rust/kernel/sync/atomic/ |
| H A D | ordering.rs | 73 pub trait Ordering: internal::Sealed { interface
78 impl Ordering for Relaxed {
82 impl Ordering for Acquire {
86 impl Ordering for Release {
90 impl Ordering for Full {
95 pub trait AcquireOrRelaxed: Ordering {}
101 pub trait ReleaseOrRelaxed: Ordering {}
|
| /linux/rust/proc-macro2/ |
| H A D | detection.rs | 3 use core::sync::atomic::{AtomicUsize, Ordering};
10 match WORKS.load(Ordering::Relaxed) { in inside_proc_macro()
21 WORKS.store(1, Ordering::Relaxed); in force_fallback()
31 WORKS.store(available as usize + 1, Ordering::Relaxed); in initialize()
70 WORKS.store(works as usize + 1, Ordering::Relaxed); in initialize()
|
| H A D | location.rs | 3 use core::cmp::Ordering;
20 fn cmp(&self, other: &Self) -> Ordering { in cmp() argument
28 fn partial_cmp(&self, other: &Self) -> Option<Ordering> { in partial_cmp() argument
|
| H A D | lib.rs | 174 use core::cmp::Ordering;
1025 fn partial_cmp(&self, other: &Ident) -> Option<Ordering> { in partial_cmp() argument
1031 fn cmp(&self, other: &Ident) -> Ordering { in cmp() argument
|
| H A D | fallback.rs | 17 use core::cmp::Ordering;
465 Ordering::Less in find()
467 Ordering::Greater in find()
470 Ordering::Equal in find()
|
| /linux/rust/kernel/ |
| H A D | revocable.rs | 15 sync::atomic::{AtomicBool, Ordering},
101 if self.is_available.load(Ordering::Relaxed) { in try_access()
119 if self.is_available.load(Ordering::Relaxed) { in try_access_with_guard()
160 let revoke = self.is_available.swap(false, Ordering::Relaxed); in revoke_internal()
|
| H A D | rbtree.rs | 11 cmp::{Ord, Ordering},
373 Ordering::Less => child_field_of_parent = unsafe { &mut (*curr).rb_left }, in raw_entry()
375 Ordering::Greater => child_field_of_parent = unsafe { &mut (*curr).rb_right }, in raw_entry()
376 Ordering::Equal => { in raw_entry()
425 Ordering::Less => node_ref.rb_left, in get()
426 Ordering::Greater => node_ref.rb_right, in get()
427 Ordering::Equal => return Some(&this_ref.value), in get()
509 Ordering::Equal => { in find_best_match()
514 Ordering::Greater => { in find_best_match()
517 Ordering::Less => { in find_best_match()
|
| /linux/rust/pin-init/examples/ |
| H A D | mutex.rs | 13 sync::atomic::{AtomicBool, Ordering},
37 .compare_exchange(false, true, Ordering::Acquire, Ordering::Relaxed) in acquire()
41 while self.inner.load(Ordering::Relaxed) { in acquire()
62 self.0.inner.store(false, Ordering::Release); in drop()
|
| /linux/rust/syn/ |
| H A D | lifetime.rs | 6 use std::cmp::Ordering;
99 fn partial_cmp(&self, other: &Lifetime) -> Option<Ordering> { in partial_cmp() argument
105 fn cmp(&self, other: &Lifetime) -> Ordering { in cmp() argument
|
| H A D | verbatim.rs | 5 use std::cmp::Ordering;
17 if crate::buffer::cmp_assuming_same_buffer(end, next) == Ordering::Less { in between()
|
| H A D | buffer.rs | 13 use std::cmp::Ordering;
401 fn partial_cmp(&self, other: &Self) -> Option<Ordering> { in partial_cmp() argument
427 pub(crate) fn cmp_assuming_same_buffer(a: Cursor, b: Cursor) -> Ordering { in cmp_assuming_same_buffer() argument
|
| H A D | precedence.rs | 17 use std::cmp::Ordering;
207 fn partial_cmp(&self, other: &Self) -> Option<Ordering> { in partial_cmp() argument
|
| /linux/Documentation/RCU/ |
| H A D | index.rst | 27 Design/Memory-Ordering/Tree-RCU-Memory-Ordering
|
| /linux/rust/kernel/list/ |
| H A D | arc.rs | |
| /linux/tools/memory-model/Documentation/ |
| H A D | cheatsheet.txt | 25 C: Ordering is cumulative
26 P: Ordering propagates
|
| H A D | references.txt | 16 Itanium Processor Family Memory Ordering". Intel Corporation.
104 Ordering" (backup material for the LWN articles)
|
| H A D | locking.txt | 153 Ordering Provided by a Lock to CPUs Not Holding That Lock
189 Ordering can be extended to CPUs not holding the lock by careful use
|
| /linux/fs/jffs2/ |
| H A D | README.Locking | 37 Ordering constraints: See f->sem.
62 Ordering constraints:
115 Ordering constraints:
147 Ordering constraints:
168 Ordering constraints:
|
| /linux/Documentation/dev-tools/lkmm/docs/ |
| H A D | ordering.rst | 3 Ordering title
|
| /linux/drivers/gpu/nova-core/gsp/ |
| H A D | cmdq.rs | 276 cmp::Ordering::Equal => (&after_rx[0..0], &after_rx[0..0]),
277 cmp::Ordering::Greater => (&after_rx[..tx], &before_rx[0..0]),
278 cmp::Ordering::Less => (after_rx, &before_rx[..tx]),
|
| H A D | fw.rs | 48 Ordering, //
82 fence(Ordering::SeqCst); in advance_cpu_read_ptr()
108 fence(Ordering::SeqCst); in advance_cpu_write_ptr()
|
| /linux/rust/kernel/num/ |
| H A D | bounded.rs | 550 fn partial_cmp(&self, other: &Bounded<U, M>) -> Option<cmp::Ordering> { in partial_cmp() argument
560 fn cmp(&self, other: &Self) -> cmp::Ordering { in cmp() argument
582 fn partial_cmp(&self, other: &T) -> Option<cmp::Ordering> { in partial_cmp() argument
|
| /linux/Documentation/driver-api/ |
| H A D | io_ordering.rst | 2 Ordering I/O writes to memory-mapped addresses
|
| /linux/tools/memory-model/ |
| H A D | linux-kernel.cat | 97 (* Propagation: Ordering from release operations and strong fences. *)
106 * Happens Before: Ordering from the passage of time.
|