Struct regalloc2::PRegSet

pub struct PRegSet { /* private fields */ }

A physical register set. Used to represent clobbers efficiently.

The set is Copy and is guaranteed to have constant, and small, size, as it is based on a bitset internally.

Implementations

impl PRegSet

pub const fn empty() -> Self

Create an empty set.

pub fn contains(&self, reg: PReg) -> bool

Returns whether the given register is part of the set.

pub const fn with(self, reg: PReg) -> Self

Add a physical register (PReg) to the set, returning the new value.

pub fn add(&mut self, reg: PReg)

Add a physical register (PReg) to the set.

pub fn remove(&mut self, reg: PReg)

Remove a physical register (PReg) from the set.

pub fn union_from(&mut self, other: PRegSet)

Add all of the registers in one set to this one, mutating in place.

Trait Implementations

impl Clone for PRegSet

fn clone(&self) -> PRegSet

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PRegSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for PRegSet

fn default() -> PRegSet

Returns the “default value” for a type.

impl From<&MachineEnv> for PRegSet

fn from(env: &MachineEnv) -> Self

Converts to this type from the input type.

impl Hash for PRegSet

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl IntoIterator for PRegSet

type Item = PReg

The type of the elements being iterated over.

type IntoIter = PRegSetIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> PRegSetIter

Creates an iterator from a value.

impl Ord for PRegSet

fn cmp(&self, other: &PRegSet) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for PRegSet

fn eq(&self, other: &PRegSet) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for PRegSet

fn partial_cmp(&self, other: &PRegSet) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for PRegSet

impl Eq for PRegSet

impl StructuralPartialEq for PRegSet