Home
last modified time | relevance | path

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

12

/linux/rust/kernel/sync/
H A Datomic.rs287 pub fn load<Ordering: ordering::AcquireOrRelaxed>(&self, _: Ordering) -> T {
289 match Ordering::TYPE {
317 pub fn store<Ordering: ordering::ReleaseOrRelaxed>(&self, v: T, _: Ordering) { in fmt()
321 match Ordering::TYPE {
358 pub fn xchg<Ordering: ordering::Ordering>(&self, v: T, _: Ordering) -> T {
364 match Ordering
299 store<Ordering: ordering::ReleaseOrRelaxed>(&self, v: T, _: Ordering) store() argument
415 cmpxchg<Ordering: ordering::Ordering>( &self, mut old: T, new: T, o: Ordering, ) -> Result<T, T> cmpxchg() argument
[all...]
/linux/rust/kernel/sync/atomic/
H A Dordering.rs73 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 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.rs
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.rs12 sync::atomic::{AtomicBool, Ordering},
36 .compare_exchange(false, true, Ordering::Acquire, Ordering::Relaxed) in acquire()
40 while self.inner.load(Ordering::Relaxed) { in acquire()
61 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/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/zerocopy/src/
H A Dwrappers.rs425 fn partial_cmp(&self, other: &Unalign<T>) -> Option<Ordering> { in partial_cmp() argument
432 fn cmp(&self, other: &Unalign<T>) -> Ordering { in cmp() argument
962 assert_eq!(PartialOrd::partial_cmp(&zero, &one), Some(Ordering::Less)); in test_unalign_trait_impls()
963 assert_eq!(Ord::cmp(&zero, &one), Ordering::Less); in test_unalign_trait_impls()
H A Dbyteorder.rs242 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
275 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
282 fn cmp(&self, other: &Self) -> Ordering {
289 fn partial_cmp(&self, other: &$native) -> Option<Ordering> {
1580 assert_eq!(val_be.cmp(&val_be), core::cmp::Ordering::Equal); in test_byteorder_traits_coverage()
1594 assert_eq!(val_be_i16.cmp(&val_be_i16), core::cmp::Ordering::Equal); in test_byteorder_traits_coverage()
H A Dref.rs936 fn cmp(&self, other: &Self) -> Ordering { in cmp() argument
949 fn partial_cmp(&self, other: &Self) -> Option<Ordering> { in partial_cmp() argument
1293 assert_eq!(PartialOrd::partial_cmp(&r1, &r2), Some(Ordering::Less)); in test_ord()
1294 assert_eq!(Ord::cmp(&r1, &r2), Ordering::Less); in test_ord()
/linux/rust/kernel/num/
H A Dbounded.rs621 fn partial_cmp(&self, other: &Bounded<U, M>) -> Option<cmp::Ordering> { in bitor()
631 fn cmp(&self, other: &Self) -> cmp::Ordering {
653 fn partial_cmp(&self, other: &T) -> Option<cmp::Ordering> {
550 partial_cmp(&self, other: &Bounded<U, M>) -> Option<cmp::Ordering> partial_cmp() argument
560 cmp(&self, other: &Self) -> cmp::Ordering cmp() argument
582 partial_cmp(&self, other: &T) -> Option<cmp::Ordering> 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.

12