Home
last modified time | relevance | path

Searched refs:Ordering (Results 1 – 25 of 34) sorted by relevance

12

/linux/rust/kernel/sync/
H A Datomic.rs269 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 Dordering.rs73 pub trait Ordering: internal::Sealed { trait
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 Ddetection.rs3 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 Dlocation.rs3 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 Dlib.rs174 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 Dfallback.rs17 use core::cmp::Ordering;
465 Ordering::Less in find()
467 Ordering::Greater in find()
470 Ordering::Equal in find()
/linux/rust/kernel/
H A Drevocable.rs15 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 Drbtree.rs11 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 in find_best_match()
[all...]
/linux/rust/pin-init/examples/
H A Dmutex.rs13 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 Dlifetime.rs6 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 Dverbatim.rs5 use std::cmp::Ordering;
17 if crate::buffer::cmp_assuming_same_buffer(end, next) == Ordering::Less { in between()
H A Dbuffer.rs13 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 Dprecedence.rs17 use std::cmp::Ordering;
207 fn partial_cmp(&self, other: &Self) -> Option<Ordering> { in partial_cmp() argument
/linux/drivers/gpu/nova-core/gsp/
H A Dcmdq.rs8 Ordering, //
264 cmp::Ordering::Equal => (&after_rx[0..0], &after_rx[0..0]),
265 cmp::Ordering::Greater => (&after_rx[..tx], &before_rx[0..0]),
266 cmp::Ordering::Less => (after_rx, &before_rx[..tx]),
361 fence(Ordering::SeqCst); in advance_cpu_read_ptr()
396 fence(Ordering::SeqCst); in advance_cpu_write_ptr()
/linux/rust/kernel/list/
H A Darc.rs
/linux/tools/memory-model/Documentation/
H A Dcheatsheet.txt25 C: Ordering is cumulative
26 P: Ordering propagates
H A Dreferences.txt16 Itanium Processor Family Memory Ordering". Intel Corporation.
104 Ordering" (backup material for the LWN articles)
H A Dlocking.txt153 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
H A Dordering.txt5 Categories of Ordering
126 RMW Ordering Augmentation Barriers
371 RCU Read-Side Ordering
488 discussed in the "RMW Ordering Augmentation Barriers" section.
/linux/fs/jffs2/
H A DREADME.Locking37 Ordering constraints: See f->sem.
62 Ordering constraints:
115 Ordering constraints:
147 Ordering constraints:
168 Ordering constraints:
/linux/rust/kernel/num/
H A Dbounded.rs550 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 Dio_ordering.rst2 Ordering I/O writes to memory-mapped addresses
/linux/tools/memory-model/
H A Dlinux-kernel.cat97 (* Propagation: Ordering from release operations and strong fences. *)
106 * Happens Before: Ordering from the passage of time.
/linux/Documentation/gpu/
H A Dafbc.rst18 Components and Ordering
/linux/Documentation/RCU/Design/Memory-Ordering/
H A DTree-RCU-Memory-Ordering.rst2 A Tour Through TREE_RCU's Grace-Period Memory Ordering
15 What Is Tree RCU's Grace Period Memory Ordering Guarantee?
46 Tree RCU Grace Period Memory Ordering Building Blocks
251 Tree RCU Grace Period Memory Ordering Components

12