swc_ecma_minifier/compress/pure/loops.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200
use swc_common::{util::take::Take, Spanned};
use swc_ecma_ast::*;
use swc_ecma_utils::{ExprExt, Value};
use super::Pure;
impl Pure<'_> {
///
/// - `while(test);` => `for(;;test);
/// - `do; while(true)` => `for(;;);
pub(super) fn loop_to_for_stmt(&mut self, s: &mut Stmt) {
if !self.options.loops {
return;
}
match s {
Stmt::While(stmt) => {
self.changed = true;
report_change!("loops: Converting a while loop to a for loop");
*s = ForStmt {
span: stmt.span,
init: None,
test: Some(stmt.test.take()),
update: None,
body: stmt.body.take(),
}
.into();
}
Stmt::DoWhile(stmt) => {
let val = stmt.test.as_pure_bool(&self.expr_ctx);
if let Value::Known(true) = val {
self.changed = true;
report_change!("loops: Converting an always-true do-while loop to a for loop");
*s = ForStmt {
span: stmt.span,
init: None,
test: Some(stmt.test.take()),
update: None,
body: stmt.body.take(),
}
.into();
}
}
_ => {}
}
}
/// ## Input
/// ```js
/// for(; bar();){
/// if (x(), y(), foo()) break;
/// z(), k();
/// }
/// ```
///
/// ## Output
///
/// ```js
/// for(; bar() && (x(), y(), !foo());)z(), k();
/// ```
pub(super) fn optimize_for_if_break(&mut self, s: &mut ForStmt) -> Option<()> {
if !self.options.loops {
return None;
}
if let Stmt::Block(body) = &mut *s.body {
let first = body.stmts.get_mut(0)?;
if let Stmt::If(IfStmt {
span,
test,
cons,
alt: None,
..
}) = first
{
if let Stmt::Break(BreakStmt { label: None, .. }) = &**cons {
self.negate(test, false, false);
match s.test.as_deref_mut() {
Some(e) => {
let orig_test = e.take();
*e = BinExpr {
span: *span,
op: op!("&&"),
left: Box::new(orig_test),
right: test.take(),
}
.into();
}
None => {
s.test = Some(test.take());
}
}
report_change!("loops: Optimizing a for loop with an if-then-break");
first.take();
return None;
}
}
if let Stmt::If(IfStmt {
span,
test,
cons,
alt: Some(alt),
..
}) = first
{
if let Stmt::Break(BreakStmt { label: None, .. }) = &**alt {
match s.test.as_deref_mut() {
Some(e) => {
let orig_test = e.take();
*e = BinExpr {
span: *span,
op: op!("&&"),
left: Box::new(orig_test),
right: test.take(),
}
.into();
}
None => {
s.test = Some(test.take());
}
}
report_change!("loops: Optimizing a for loop with an if-else-break");
*first = *cons.take();
return None;
}
}
}
None
}
/// # Input
///
/// ```js
/// for(; size--;)
/// if (!(result = eq(a[size], b[size], aStack, bStack)))
/// break;
/// ```
///
///
/// # Output
///
/// ```js
/// for (; size-- && (result = eq(a[size], b[size], aStack, bStack)););
/// ```
pub(super) fn merge_for_if_break(&mut self, s: &mut ForStmt) {
if let Stmt::If(IfStmt {
test,
cons,
alt: None,
..
}) = &mut *s.body
{
if let Stmt::Break(BreakStmt { label: None, .. }) = &**cons {
// We only care about instant breaks.
//
// Note: As the minifier of swc is very fast, we don't
// care about block statements with a single break as a
// body.
//
// If it's optimizable, other pass for if statements
// will remove block and with the next pass we can apply
// this pass.
self.changed = true;
report_change!("loops: Compressing for-if-break into a for statement");
// We negate because this `test` is used as a condition for `break`.
self.negate(test, true, false);
match s.test.take() {
Some(left) => {
s.test = Some(
BinExpr {
span: s.test.span(),
op: op!("&&"),
left,
right: test.take(),
}
.into(),
);
}
None => {
s.test = Some(test.take());
}
}
// Remove body
s.body.take();
}
}
}
}