Struct UnshareFlags
pub struct UnshareFlags(/* private fields */);
dep_rustix
only.Expand description
CLONE_*
for use with unshare
.
Implementations§
pub const FILES: UnshareFlags
pub const FILES: UnshareFlags
CLONE_FILES
.
pub const FS: UnshareFlags
pub const FS: UnshareFlags
CLONE_FS
.
pub const NEWCGROUP: UnshareFlags
pub const NEWCGROUP: UnshareFlags
CLONE_NEWCGROUP
.
pub const NEWIPC: UnshareFlags
pub const NEWIPC: UnshareFlags
CLONE_NEWIPC
.
pub const NEWNET: UnshareFlags
pub const NEWNET: UnshareFlags
CLONE_NEWNET
.
pub const NEWNS: UnshareFlags
pub const NEWNS: UnshareFlags
CLONE_NEWNS
.
pub const NEWPID: UnshareFlags
pub const NEWPID: UnshareFlags
CLONE_NEWPID
.
pub const NEWTIME: UnshareFlags
pub const NEWTIME: UnshareFlags
CLONE_NEWTIME
.
pub const NEWUSER: UnshareFlags
pub const NEWUSER: UnshareFlags
CLONE_NEWUSER
.
pub const NEWUTS: UnshareFlags
pub const NEWUTS: UnshareFlags
CLONE_NEWUTS
pub const SYSVSEM: UnshareFlags
pub const SYSVSEM: UnshareFlags
CLONE_SYSVSEM
.
pub const fn empty() -> UnshareFlags
pub const fn empty() -> UnshareFlags
Get a flags value with all bits unset.
pub const fn all() -> UnshareFlags
pub const fn all() -> UnshareFlags
Get a flags value with all known bits set.
pub const fn bits(&self) -> u32 ⓘ
pub const fn bits(&self) -> u32 ⓘ
Get the underlying bits value.
The returned value is exactly the bits set in this flags value.
pub const fn from_bits(bits: u32) -> Option<UnshareFlags> ⓘ
pub const fn from_bits(bits: u32) -> Option<UnshareFlags> ⓘ
Convert from a bits value.
This method will return None
if any unknown bits are set.
pub const fn from_bits_truncate(bits: u32) -> UnshareFlags
pub const fn from_bits_truncate(bits: u32) -> UnshareFlags
Convert from a bits value, unsetting any unknown bits.
pub const fn from_bits_retain(bits: u32) -> UnshareFlags
pub const fn from_bits_retain(bits: u32) -> UnshareFlags
Convert from a bits value exactly.
pub fn from_name(name: &str) -> Option<UnshareFlags> ⓘ
pub fn from_name(name: &str) -> Option<UnshareFlags> ⓘ
Get a flags value with the bits of a flag with the given name set.
This method will return None
if name
is empty or doesn’t
correspond to any named flag.
pub const fn intersects(&self, other: UnshareFlags) -> bool
pub const fn intersects(&self, other: UnshareFlags) -> bool
Whether any set bits in a source flags value are also set in a target flags value.
pub const fn contains(&self, other: UnshareFlags) -> bool
pub const fn contains(&self, other: UnshareFlags) -> bool
Whether all set bits in a source flags value are also set in a target flags value.
pub fn insert(&mut self, other: UnshareFlags)
pub fn insert(&mut self, other: UnshareFlags)
The bitwise or (|
) of the bits in two flags values.
pub fn remove(&mut self, other: UnshareFlags)
pub fn remove(&mut self, other: UnshareFlags)
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
remove
won’t truncate other
, but the !
operator will.
pub fn toggle(&mut self, other: UnshareFlags)
pub fn toggle(&mut self, other: UnshareFlags)
The bitwise exclusive-or (^
) of the bits in two flags values.
pub fn set(&mut self, other: UnshareFlags, value: bool)
pub fn set(&mut self, other: UnshareFlags, value: bool)
Call insert
when value
is true
or remove
when value
is false
.
pub const fn intersection(self, other: UnshareFlags) -> UnshareFlags
pub const fn intersection(self, other: UnshareFlags) -> UnshareFlags
The bitwise and (&
) of the bits in two flags values.
pub const fn union(self, other: UnshareFlags) -> UnshareFlags
pub const fn union(self, other: UnshareFlags) -> UnshareFlags
The bitwise or (|
) of the bits in two flags values.
pub const fn difference(self, other: UnshareFlags) -> UnshareFlags
pub const fn difference(self, other: UnshareFlags) -> UnshareFlags
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
pub const fn symmetric_difference(self, other: UnshareFlags) -> UnshareFlags
pub const fn symmetric_difference(self, other: UnshareFlags) -> UnshareFlags
The bitwise exclusive-or (^
) of the bits in two flags values.
pub const fn complement(self) -> UnshareFlags
pub const fn complement(self) -> UnshareFlags
The bitwise negation (!
) of the bits in a flags value, truncating the result.
pub const fn iter(&self) -> Iter<UnshareFlags> ⓘ
pub const fn iter(&self) -> Iter<UnshareFlags> ⓘ
Yield a set of contained flags values.
Each yielded flags value will correspond to a defined named flag. Any unknown bits will be yielded together as a final flags value.
pub const fn iter_names(&self) -> IterNames<UnshareFlags> ⓘ
pub const fn iter_names(&self) -> IterNames<UnshareFlags> ⓘ
Yield a set of contained named flags values.
This method is like iter
, except only yields bits in contained named flags.
Any unknown bits, or bits not corresponding to a contained flag will not be yielded.
Trait Implementations§
§fn bitand(self, other: UnshareFlags) -> UnshareFlags
fn bitand(self, other: UnshareFlags) -> UnshareFlags
The bitwise and (&
) of the bits in two flags values.
§type Output = UnshareFlags
type Output = UnshareFlags
&
operator.§fn bitand_assign(&mut self, other: UnshareFlags)
fn bitand_assign(&mut self, other: UnshareFlags)
The bitwise and (&
) of the bits in two flags values.
§fn bitor(self, other: UnshareFlags) -> UnshareFlags
fn bitor(self, other: UnshareFlags) -> UnshareFlags
The bitwise or (|
) of the bits in two flags values.
§type Output = UnshareFlags
type Output = UnshareFlags
|
operator.§fn bitor_assign(&mut self, other: UnshareFlags)
fn bitor_assign(&mut self, other: UnshareFlags)
The bitwise or (|
) of the bits in two flags values.
§fn bitxor(self, other: UnshareFlags) -> UnshareFlags
fn bitxor(self, other: UnshareFlags) -> UnshareFlags
The bitwise exclusive-or (^
) of the bits in two flags values.
§type Output = UnshareFlags
type Output = UnshareFlags
^
operator.§fn bitxor_assign(&mut self, other: UnshareFlags)
fn bitxor_assign(&mut self, other: UnshareFlags)
The bitwise exclusive-or (^
) of the bits in two flags values.
§fn clone(&self) -> UnshareFlags
fn clone(&self) -> UnshareFlags
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = UnshareFlags>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = UnshareFlags>,
The bitwise or (|
) of the bits in each flags value.
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)§const FLAGS: &'static [Flag<UnshareFlags>]
const FLAGS: &'static [Flag<UnshareFlags>]
§fn from_bits_retain(bits: u32) -> UnshareFlags
fn from_bits_retain(bits: u32) -> UnshareFlags
§fn contains_unknown_bits(&self) -> bool
fn contains_unknown_bits(&self) -> bool
true
if any unknown bits are set.§fn from_bits_truncate(bits: Self::Bits) -> Self
fn from_bits_truncate(bits: Self::Bits) -> Self
§fn from_name(name: &str) -> Option<Self> ⓘ
fn from_name(name: &str) -> Option<Self> ⓘ
§fn iter_names(&self) -> IterNames<Self> ⓘ
fn iter_names(&self) -> IterNames<Self> ⓘ
§fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
§fn contains(&self, other: Self) -> boolwhere
Self: Sized,
fn contains(&self, other: Self) -> boolwhere
Self: Sized,
§fn insert(&mut self, other: Self)where
Self: Sized,
fn insert(&mut self, other: Self)where
Self: Sized,
|
) of the bits in two flags values.§fn remove(&mut self, other: Self)where
Self: Sized,
fn remove(&mut self, other: Self)where
Self: Sized,
&!
). Read more§fn toggle(&mut self, other: Self)where
Self: Sized,
fn toggle(&mut self, other: Self)where
Self: Sized,
^
) of the bits in two flags values.§fn set(&mut self, other: Self, value: bool)where
Self: Sized,
fn set(&mut self, other: Self, value: bool)where
Self: Sized,
Flags::insert
] when value
is true
or [Flags::remove
] when value
is false
.§fn intersection(self, other: Self) -> Self
fn intersection(self, other: Self) -> Self
&
) of the bits in two flags values.§fn difference(self, other: Self) -> Self
fn difference(self, other: Self) -> Self
&!
). Read more§fn symmetric_difference(self, other: Self) -> Self
fn symmetric_difference(self, other: Self) -> Self
^
) of the bits in two flags values.§fn complement(self) -> Self
fn complement(self) -> Self
!
) of the bits in a flags value, truncating the result.§fn from_iter<T>(iterator: T) -> UnshareFlagswhere
T: IntoIterator<Item = UnshareFlags>,
fn from_iter<T>(iterator: T) -> UnshareFlagswhere
T: IntoIterator<Item = UnshareFlags>,
The bitwise or (|
) of the bits in each flags value.
§type Item = UnshareFlags
type Item = UnshareFlags
§type IntoIter = Iter<UnshareFlags>
type IntoIter = Iter<UnshareFlags>
§fn into_iter(self) -> <UnshareFlags as IntoIterator>::IntoIter
fn into_iter(self) -> <UnshareFlags as IntoIterator>::IntoIter
§fn not(self) -> UnshareFlags
fn not(self) -> UnshareFlags
The bitwise negation (!
) of the bits in a flags value, truncating the result.
§type Output = UnshareFlags
type Output = UnshareFlags
!
operator.§fn sub(self, other: UnshareFlags) -> UnshareFlags
fn sub(self, other: UnshareFlags) -> UnshareFlags
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
§type Output = UnshareFlags
type Output = UnshareFlags
-
operator.§fn sub_assign(&mut self, other: UnshareFlags)
fn sub_assign(&mut self, other: UnshareFlags)
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
Auto Trait Implementations§
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.