1 //! Platform-independent platform abstraction
3 //! This is the platform-independent portion of the standard library's
4 //! platform abstraction layer, whereas `std::sys` is the
5 //! platform-specific portion.
7 //! The relationship between `std::sys_common`, `std::sys` and the
8 //! rest of `std` is complex, with dependencies going in all
9 //! directions: `std` depending on `sys_common`, `sys_common`
10 //! depending on `sys`, and `sys` depending on `sys_common` and `std`.
11 //! This is because `sys_common` not only contains platform-independent code,
12 //! but also code that is shared between the different platforms in `sys`.
13 //! Ideally all that shared code should be moved to `sys::common`,
14 //! and the dependencies between `std`, `sys_common` and `sys` all would form a dag.
15 //! Progress on this is tracked in #84187.
17 #![allow(missing_docs)]
18 #![allow(missing_debug_implementations)]
36 pub mod thread_local_dtor;
37 pub mod thread_local_key;
38 pub mod thread_parker;
42 if #[cfg(any(target_os = "l4re",
44 feature = "restricted-std",
45 all(target_arch = "wasm32", not(target_os = "emscripten")),
46 all(target_vendor = "fortanix", target_env = "sgx")))] {
47 pub use crate::sys::net;
53 // common error constructors
55 /// A trait for viewing representations from std types
57 pub trait AsInner<Inner: ?Sized> {
58 fn as_inner(&self) -> &Inner;
61 /// A trait for viewing representations from std types
63 pub trait AsInnerMut<Inner: ?Sized> {
64 fn as_inner_mut(&mut self) -> &mut Inner;
67 /// A trait for extracting representations from std types
69 pub trait IntoInner<Inner> {
70 fn into_inner(self) -> Inner;
73 /// A trait for creating std types from internal representations
75 pub trait FromInner<Inner> {
76 fn from_inner(inner: Inner) -> Self;
79 // Computes (value*numer)/denom without overflow, as long as both
80 // (numer*denom) and the overall result fit into i64 (which is the case
81 // for our time conversions).
82 #[allow(dead_code)] // not used on all platforms
83 pub fn mul_div_u64(value: u64, numer: u64, denom: u64) -> u64 {
84 let q = value / denom;
85 let r = value % denom;
86 // Decompose value as (value/denom*denom + value%denom),
87 // substitute into (value*numer)/denom and simplify.
88 // r < denom, so (denom*numer) is the upper bound of (r*numer)
89 q * numer + r * numer / denom