mirror of
https://github.com/Noratrieb/brainfuck.git
synced 2026-01-14 13:35:00 +01:00
make window_pass generic over window length
This commit is contained in:
parent
d7fea43acf
commit
4490d49d35
1 changed files with 17 additions and 12 deletions
|
|
@ -56,6 +56,7 @@ pub fn optimize<'ir>(alloc: &'ir Bump, instrs: &[(Instr<'_>, Span)]) -> Ir<'ir>
|
||||||
pass_find_set_null(&mut ir);
|
pass_find_set_null(&mut ir);
|
||||||
pass_set_n(&mut ir);
|
pass_set_n(&mut ir);
|
||||||
pass_cancel_left_right_add_sub(&mut ir);
|
pass_cancel_left_right_add_sub(&mut ir);
|
||||||
|
pass_add_sub_offset(&mut ir);
|
||||||
ir
|
ir
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -165,7 +166,7 @@ fn pass_find_set_null(ir: &mut Ir<'_>) {
|
||||||
/// pass that replaces `SetN(n) Add(m)` with `SetN(n + m)`
|
/// pass that replaces `SetN(n) Add(m)` with `SetN(n + m)`
|
||||||
#[tracing::instrument]
|
#[tracing::instrument]
|
||||||
fn pass_set_n(ir: &mut Ir<'_>) {
|
fn pass_set_n(ir: &mut Ir<'_>) {
|
||||||
two_window_pass(ir, pass_set_n, |a, b| {
|
window_pass(ir, pass_set_n, |[a, b]| {
|
||||||
if let StmtKind::SetN(before) = a.kind() {
|
if let StmtKind::SetN(before) = a.kind() {
|
||||||
let new = match b.kind() {
|
let new = match b.kind() {
|
||||||
StmtKind::Add(n) => StmtKind::SetN(before.wrapping_add(*n)),
|
StmtKind::Add(n) => StmtKind::SetN(before.wrapping_add(*n)),
|
||||||
|
|
@ -183,12 +184,12 @@ fn pass_set_n(ir: &mut Ir<'_>) {
|
||||||
/// pass that replaces `Left(5) Right(3)` with `Left(2)`
|
/// pass that replaces `Left(5) Right(3)` with `Left(2)`
|
||||||
#[tracing::instrument]
|
#[tracing::instrument]
|
||||||
fn pass_cancel_left_right_add_sub(ir: &mut Ir<'_>) {
|
fn pass_cancel_left_right_add_sub(ir: &mut Ir<'_>) {
|
||||||
two_window_pass(ir, pass_cancel_left_right_add_sub, |a, b| {
|
window_pass(ir, pass_cancel_left_right_add_sub, |[a, b]| {
|
||||||
match (a.kind(), b.kind()) {
|
match (a.kind(), b.kind()) {
|
||||||
(StmtKind::Right(r), StmtKind::Left(l)) | (StmtKind::Left(l), StmtKind::Right(r)) => {
|
(StmtKind::Right(r), StmtKind::Left(l)) | (StmtKind::Left(l), StmtKind::Right(r)) => {
|
||||||
let new = match r.cmp(l) {
|
let new = match r.cmp(l) {
|
||||||
Ordering::Equal => {
|
Ordering::Equal => {
|
||||||
return WindowPassAction::RemoveBoth;
|
return WindowPassAction::RemoveAll;
|
||||||
}
|
}
|
||||||
Ordering::Less => StmtKind::Left(l - r),
|
Ordering::Less => StmtKind::Left(l - r),
|
||||||
Ordering::Greater => StmtKind::Right(r - l),
|
Ordering::Greater => StmtKind::Right(r - l),
|
||||||
|
|
@ -198,7 +199,7 @@ fn pass_cancel_left_right_add_sub(ir: &mut Ir<'_>) {
|
||||||
}
|
}
|
||||||
(StmtKind::Add(r), StmtKind::Sub(l)) | (StmtKind::Sub(l), StmtKind::Add(r)) => {
|
(StmtKind::Add(r), StmtKind::Sub(l)) | (StmtKind::Sub(l), StmtKind::Add(r)) => {
|
||||||
let new = match r.cmp(l) {
|
let new = match r.cmp(l) {
|
||||||
Ordering::Equal => return WindowPassAction::RemoveBoth,
|
Ordering::Equal => return WindowPassAction::RemoveAll,
|
||||||
Ordering::Less => StmtKind::Sub(l - r),
|
Ordering::Less => StmtKind::Sub(l - r),
|
||||||
Ordering::Greater => StmtKind::Add(r - l),
|
Ordering::Greater => StmtKind::Add(r - l),
|
||||||
};
|
};
|
||||||
|
|
@ -217,14 +218,16 @@ fn pass_add_sub_offset(ir: &mut Ir<'_>) {}
|
||||||
enum WindowPassAction<'ir> {
|
enum WindowPassAction<'ir> {
|
||||||
None,
|
None,
|
||||||
Merge(StmtKind<'ir>),
|
Merge(StmtKind<'ir>),
|
||||||
RemoveBoth,
|
RemoveAll,
|
||||||
}
|
}
|
||||||
|
|
||||||
fn two_window_pass<'ir, P, F>(ir: &mut Ir<'ir>, pass_recur: P, action: F)
|
fn window_pass<'ir, P, F, const N: usize>(ir: &mut Ir<'ir>, pass_recur: P, action: F)
|
||||||
where
|
where
|
||||||
P: Fn(&mut Ir<'ir>),
|
P: Fn(&mut Ir<'ir>),
|
||||||
F: Fn(&Stmt<'ir>, &Stmt<'ir>) -> WindowPassAction<'ir>,
|
F: Fn([&Stmt<'ir>; N]) -> WindowPassAction<'ir>,
|
||||||
{
|
{
|
||||||
|
assert!(N > 0);
|
||||||
|
|
||||||
let stmts = &mut ir.stmts;
|
let stmts = &mut ir.stmts;
|
||||||
let mut i = 0;
|
let mut i = 0;
|
||||||
while i < stmts.len() {
|
while i < stmts.len() {
|
||||||
|
|
@ -233,23 +236,25 @@ where
|
||||||
pass_recur(body);
|
pass_recur(body);
|
||||||
}
|
}
|
||||||
|
|
||||||
if i >= stmts.len() - 1 {
|
if i >= stmts.len() - (N - 1) {
|
||||||
break; // we are the last element
|
break; // there aren't N elements left
|
||||||
}
|
}
|
||||||
|
|
||||||
let a = &stmts[i];
|
let a = &stmts[i];
|
||||||
let b = &stmts[i + 1];
|
let b = &stmts[i + 1];
|
||||||
|
|
||||||
let merged_span = a.span.merge(b.span);
|
let mut elements = stmts[i..][..N].iter();
|
||||||
|
let elements = [(); N].map(|()| elements.next().unwrap());
|
||||||
|
|
||||||
let result = action(a, b);
|
let merged_span = elements[0].span.merge(elements.last().unwrap().span);
|
||||||
|
let result = action(elements);
|
||||||
|
|
||||||
match result {
|
match result {
|
||||||
WindowPassAction::None => {
|
WindowPassAction::None => {
|
||||||
// only increment i if we haven't removed anything
|
// only increment i if we haven't removed anything
|
||||||
i += 1;
|
i += 1;
|
||||||
}
|
}
|
||||||
WindowPassAction::RemoveBoth => {
|
WindowPassAction::RemoveAll => {
|
||||||
trace!(?a, ?b, "Removing both statements");
|
trace!(?a, ?b, "Removing both statements");
|
||||||
stmts.remove(i);
|
stmts.remove(i);
|
||||||
stmts.remove(i);
|
stmts.remove(i);
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue