#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub enum LiStep {
Lui(i64),
Addi(i64),
Addiw(i64),
Slli(u32),
Srli(u32),
}
fn fits(v: i64, bits: u32) -> bool {
let shift = 64 - bits;
(v << shift) >> shift == v
}
fn sext12(v: i64) -> i64 {
(v << 52) >> 52
}
fn seq(val: i64, out: &mut Vec<LiStep>) {
if fits(val, 32) {
let hi20 = ((val + 0x800) >> 12) & 0xf_ffff;
let lo12 = sext12(val);
if hi20 != 0 {
out.push(LiStep::Lui(hi20));
}
if lo12 != 0 || hi20 == 0 {
out.push(if hi20 != 0 {
LiStep::Addiw(lo12)
} else {
LiStep::Addi(lo12)
});
}
return;
}
let lo12 = sext12(val);
let mut val = val.wrapping_sub(lo12);
let mut shift = 0;
if !fits(val, 32) {
shift = val.trailing_zeros();
val >>= shift;
if shift > 12 && !fits(val, 12) && fits(((val as u64) << 12) as i64, 32) {
shift -= 12;
val = ((val as u64) << 12) as i64;
}
}
seq(val, out);
if shift != 0 {
out.push(LiStep::Slli(shift));
}
if lo12 != 0 {
out.push(LiStep::Addi(lo12));
}
}
pub fn li(val: i64) -> Vec<LiStep> {
let mut out = Vec::new();
seq(val, &mut out);
if val & 0xfff != 0 && val & 1 == 0 && out.len() >= 2 {
let zeros = val.trailing_zeros();
let shifted = val >> zeros;
let mut alt = Vec::new();
seq(shifted, &mut alt);
if alt.len() + 1 < out.len() || fits(shifted, 6) {
alt.push(LiStep::Slli(zeros));
out = alt;
}
}
if out.len() <= 2 {
return out;
}
if val > 0 {
let zeros = val.leading_zeros();
let ones = (1u64 << zeros) - 1;
let shifted = ((val as u64) << zeros) | ones;
for candidate in [shifted, shifted & !ones] {
let mut alt = Vec::new();
seq(candidate as i64, &mut alt);
if alt.len() + 1 < out.len() {
alt.push(LiStep::Srli(zeros));
out = alt;
}
}
}
out
}