use core::hash::Hash;
use core::marker::PhantomData;
use core::{fmt, ops::Range};
use cranelift_bitset::ScalarBitSet;
pub trait Reg: Sized + Copy + Eq + Ord + Hash + Into<AnyReg> + fmt::Debug + fmt::Display {
const RANGE: Range<u8>;
unsafe fn new_unchecked(index: u8) -> Self;
fn new(index: u8) -> Option<Self> {
if Self::RANGE.contains(&index) {
Some(unsafe { Self::new_unchecked(index) })
} else {
None
}
}
fn to_u8(self) -> u8;
fn index(self) -> usize {
self.to_u8().into()
}
}
macro_rules! impl_reg {
($reg_ty:ty, $any:ident, $range:expr) => {
impl From<$reg_ty> for AnyReg {
fn from(r: $reg_ty) -> Self {
AnyReg::$any(r)
}
}
impl fmt::Display for $reg_ty {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
fmt::Debug::fmt(&self, f)
}
}
impl Reg for $reg_ty {
const RANGE: Range<u8> = $range;
unsafe fn new_unchecked(index: u8) -> Self {
core::mem::transmute(index)
}
fn to_u8(self) -> u8 {
self as u8
}
}
};
}
#[repr(u8)]
#[derive(Debug,Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[cfg_attr(feature = "arbitrary", derive(arbitrary::Arbitrary))]
#[allow(non_camel_case_types, missing_docs)]
#[rustfmt::skip]
pub enum XReg {
x0, x1, x2, x3, x4, x5, x6, x7, x8, x9,
x10, x11, x12, x13, x14, x15, x16, x17, x18, x19,
x20, x21, x22, x23, x24, x25, x26,
sp,
lr,
fp,
spilltmp0,
spilltmp1,
}
impl XReg {
pub fn is_special(self) -> bool {
matches!(
self,
Self::sp | Self::lr | Self::fp | Self::spilltmp0 | Self::spilltmp1
)
}
}
#[repr(u8)]
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[cfg_attr(feature = "arbitrary", derive(arbitrary::Arbitrary))]
#[allow(non_camel_case_types, missing_docs)]
#[rustfmt::skip]
pub enum FReg {
f0, f1, f2, f3, f4, f5, f6, f7, f8, f9,
f10, f11, f12, f13, f14, f15, f16, f17, f18, f19,
f20, f21, f22, f23, f24, f25, f26, f27, f28, f29,
f30, f31,
}
#[repr(u8)]
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[cfg_attr(feature = "arbitrary", derive(arbitrary::Arbitrary))]
#[allow(non_camel_case_types, missing_docs)]
#[rustfmt::skip]
pub enum VReg {
v0, v1, v2, v3, v4, v5, v6, v7, v8, v9,
v10, v11, v12, v13, v14, v15, v16, v17, v18, v19,
v20, v21, v22, v23, v24, v25, v26, v27, v28, v29,
v30, v31,
}
impl_reg!(XReg, X, 0..32);
impl_reg!(FReg, F, 0..32);
impl_reg!(VReg, V, 0..32);
#[allow(missing_docs)]
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[cfg_attr(feature = "arbitrary", derive(arbitrary::Arbitrary))]
pub enum AnyReg {
X(XReg),
F(FReg),
V(VReg),
}
impl fmt::Display for AnyReg {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
fmt::Debug::fmt(self, f)
}
}
impl fmt::Debug for AnyReg {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> core::fmt::Result {
match self {
AnyReg::X(r) => fmt::Debug::fmt(r, f),
AnyReg::F(r) => fmt::Debug::fmt(r, f),
AnyReg::V(r) => fmt::Debug::fmt(r, f),
}
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[cfg_attr(feature = "arbitrary", derive(arbitrary::Arbitrary))]
pub struct BinaryOperands<R> {
pub dst: R,
pub src1: R,
pub src2: R,
}
impl<R: Reg> BinaryOperands<R> {
pub fn new(dst: impl Into<R>, src1: impl Into<R>, src2: impl Into<R>) -> Self {
Self {
dst: dst.into(),
src1: src1.into(),
src2: src2.into(),
}
}
pub fn to_bits(self) -> u16 {
let dst = self.dst.to_u8();
let src1 = self.src1.to_u8();
let src2 = self.src2.to_u8();
(dst as u16) | ((src1 as u16) << 5) | ((src2 as u16) << 10)
}
pub fn from_bits(bits: u16) -> Self {
Self {
dst: R::new((bits & 0b11111) as u8).unwrap(),
src1: R::new(((bits >> 5) & 0b11111) as u8).unwrap(),
src2: R::new(((bits >> 10) & 0b11111) as u8).unwrap(),
}
}
}
pub struct RegSet<R> {
bitset: ScalarBitSet<u32>,
phantom: PhantomData<R>,
}
impl<R: Reg> RegSet<R> {
pub fn from_bitset(bitset: ScalarBitSet<u32>) -> Self {
Self {
bitset,
phantom: PhantomData,
}
}
pub fn to_bitset(self) -> ScalarBitSet<u32> {
self.bitset
}
}
impl<R: Reg> From<ScalarBitSet<u32>> for RegSet<R> {
fn from(bitset: ScalarBitSet<u32>) -> Self {
Self {
bitset,
phantom: PhantomData,
}
}
}
impl<R: Reg> Into<ScalarBitSet<u32>> for RegSet<R> {
fn into(self) -> ScalarBitSet<u32> {
self.bitset
}
}
impl<R: Reg> IntoIterator for RegSet<R> {
type Item = R;
type IntoIter = core::iter::FilterMap<cranelift_bitset::scalar::Iter<u32>, fn(u8) -> Option<R>>;
fn into_iter(self) -> Self::IntoIter {
self.bitset.into_iter().filter_map(R::new)
}
}
impl<R: Reg> FromIterator<R> for RegSet<R> {
fn from_iter<I: IntoIterator<Item = R>>(iter: I) -> Self {
let mut set = ScalarBitSet::new();
for reg in iter {
set.insert(reg.to_u8());
}
RegSet::from(set)
}
}
impl<R: Reg> Default for RegSet<R> {
fn default() -> Self {
Self {
bitset: Default::default(),
phantom: Default::default(),
}
}
}
impl<R: Reg> Copy for RegSet<R> {}
impl<R: Reg> Clone for RegSet<R> {
fn clone(&self) -> Self {
*self
}
}
impl<R: Reg> PartialEq for RegSet<R> {
fn eq(&self, other: &Self) -> bool {
self.bitset == other.bitset
}
}
impl<R: Reg> Eq for RegSet<R> {}
impl<R: Reg> fmt::Debug for RegSet<R> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_set().entries(self.into_iter()).finish()
}
}
#[cfg(feature = "arbitrary")]
impl<'a, R: Reg> arbitrary::Arbitrary<'a> for RegSet<R> {
fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result<Self> {
ScalarBitSet::arbitrary(u).map(Self::from)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn special_x_regs() {
assert!(XReg::sp.is_special());
assert!(XReg::lr.is_special());
assert!(XReg::fp.is_special());
assert!(XReg::spilltmp0.is_special());
assert!(XReg::spilltmp1.is_special());
}
#[test]
fn not_special_x_regs() {
for i in 0..27 {
assert!(!XReg::new(i).unwrap().is_special());
}
}
#[test]
fn binary_operands() {
let mut i = 0;
for src2 in XReg::RANGE {
for src1 in XReg::RANGE {
for dst in XReg::RANGE {
let operands = BinaryOperands {
dst: XReg::new(dst).unwrap(),
src1: XReg::new(src1).unwrap(),
src2: XReg::new(src2).unwrap(),
};
assert_eq!(operands.to_bits(), i);
assert_eq!(BinaryOperands::from_bits(i), operands);
assert_eq!(BinaryOperands::from_bits(0x8000 | i), operands);
i += 1;
}
}
}
}
}