2020-03-14 13:06:40 +01:00
|
|
|
#![cfg(not(feature = "no_optimize"))]
|
|
|
|
|
2020-03-17 03:27:43 +01:00
|
|
|
use crate::any::{Any, Dynamic};
|
|
|
|
use crate::engine::{
|
|
|
|
Engine, FnCallArgs, KEYWORD_DEBUG, KEYWORD_DUMP_AST, KEYWORD_PRINT, KEYWORD_TYPE_OF,
|
|
|
|
};
|
2020-03-15 15:39:58 +01:00
|
|
|
use crate::parser::{map_dynamic_to_expr, Expr, FnDef, Stmt, AST};
|
2020-03-14 07:30:44 +01:00
|
|
|
use crate::scope::{Scope, ScopeEntry, VariableType};
|
2020-03-09 14:57:07 +01:00
|
|
|
|
2020-03-17 19:26:11 +01:00
|
|
|
use crate::stdlib::{
|
|
|
|
sync::Arc,
|
|
|
|
vec::Vec, string::{String, ToString},
|
|
|
|
boxed::Box, vec,
|
|
|
|
};
|
2020-03-15 15:39:58 +01:00
|
|
|
|
|
|
|
/// Level of optimization performed
|
|
|
|
#[derive(Debug, Eq, PartialEq, Hash, Clone, Copy)]
|
|
|
|
pub enum OptimizationLevel {
|
|
|
|
/// No optimization performed
|
|
|
|
None,
|
|
|
|
/// Only perform simple optimizations without evaluating functions
|
|
|
|
Simple,
|
|
|
|
/// Full optimizations performed, including evaluating functions.
|
|
|
|
/// Take care that this may cause side effects.
|
|
|
|
Full,
|
|
|
|
}
|
|
|
|
|
|
|
|
struct State<'a> {
|
2020-03-13 11:12:41 +01:00
|
|
|
changed: bool,
|
|
|
|
constants: Vec<(String, Expr)>,
|
2020-03-15 15:39:58 +01:00
|
|
|
engine: Option<&'a Engine<'a>>,
|
2020-03-13 11:12:41 +01:00
|
|
|
}
|
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
impl State<'_> {
|
2020-03-13 11:12:41 +01:00
|
|
|
pub fn new() -> Self {
|
|
|
|
State {
|
|
|
|
changed: false,
|
|
|
|
constants: vec![],
|
2020-03-15 15:39:58 +01:00
|
|
|
engine: None,
|
2020-03-13 11:12:41 +01:00
|
|
|
}
|
|
|
|
}
|
2020-03-15 15:39:58 +01:00
|
|
|
pub fn reset(&mut self) {
|
|
|
|
self.changed = false;
|
|
|
|
}
|
2020-03-13 11:12:41 +01:00
|
|
|
pub fn set_dirty(&mut self) {
|
|
|
|
self.changed = true;
|
|
|
|
}
|
|
|
|
pub fn is_dirty(&self) -> bool {
|
|
|
|
self.changed
|
|
|
|
}
|
|
|
|
pub fn contains_constant(&self, name: &str) -> bool {
|
|
|
|
self.constants.iter().any(|(n, _)| n == name)
|
|
|
|
}
|
|
|
|
pub fn restore_constants(&mut self, len: usize) {
|
|
|
|
self.constants.truncate(len)
|
|
|
|
}
|
|
|
|
pub fn push_constant(&mut self, name: &str, value: Expr) {
|
|
|
|
self.constants.push((name.to_string(), value))
|
|
|
|
}
|
|
|
|
pub fn find_constant(&self, name: &str) -> Option<&Expr> {
|
|
|
|
for (n, expr) in self.constants.iter().rev() {
|
|
|
|
if n == name {
|
|
|
|
return Some(expr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
None
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
fn optimize_stmt<'a>(stmt: Stmt, state: &mut State<'a>, preserve_result: bool) -> Stmt {
|
2020-03-09 14:57:07 +01:00
|
|
|
match stmt {
|
2020-03-12 16:46:52 +01:00
|
|
|
Stmt::IfElse(expr, stmt1, None) if stmt1.is_noop() => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-12 16:46:52 +01:00
|
|
|
|
|
|
|
let pos = expr.position();
|
2020-03-13 11:12:41 +01:00
|
|
|
let expr = optimize_expr(*expr, state);
|
2020-03-12 16:46:52 +01:00
|
|
|
|
2020-03-14 16:41:15 +01:00
|
|
|
if matches!(expr, Expr::False(_) | Expr::True(_)) {
|
|
|
|
Stmt::Noop(stmt1.position())
|
|
|
|
} else {
|
|
|
|
let stmt = Stmt::Expr(Box::new(expr));
|
2020-03-12 16:46:52 +01:00
|
|
|
|
2020-03-14 16:41:15 +01:00
|
|
|
if preserve_result {
|
|
|
|
Stmt::Block(vec![stmt, *stmt1], pos)
|
|
|
|
} else {
|
|
|
|
stmt
|
2020-03-12 16:46:52 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-09 14:57:07 +01:00
|
|
|
Stmt::IfElse(expr, stmt1, None) => match *expr {
|
|
|
|
Expr::False(pos) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
Stmt::Noop(pos)
|
|
|
|
}
|
2020-03-13 11:12:41 +01:00
|
|
|
Expr::True(_) => optimize_stmt(*stmt1, state, true),
|
2020-03-10 04:22:41 +01:00
|
|
|
expr => Stmt::IfElse(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(expr, state)),
|
|
|
|
Box::new(optimize_stmt(*stmt1, state, true)),
|
2020-03-09 14:57:07 +01:00
|
|
|
None,
|
|
|
|
),
|
|
|
|
},
|
|
|
|
|
|
|
|
Stmt::IfElse(expr, stmt1, Some(stmt2)) => match *expr {
|
2020-03-13 11:12:41 +01:00
|
|
|
Expr::False(_) => optimize_stmt(*stmt2, state, true),
|
|
|
|
Expr::True(_) => optimize_stmt(*stmt1, state, true),
|
2020-03-10 04:22:41 +01:00
|
|
|
expr => Stmt::IfElse(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(expr, state)),
|
|
|
|
Box::new(optimize_stmt(*stmt1, state, true)),
|
|
|
|
match optimize_stmt(*stmt2, state, true) {
|
2020-03-12 16:46:52 +01:00
|
|
|
stmt if stmt.is_noop() => None,
|
|
|
|
stmt => Some(Box::new(stmt)),
|
|
|
|
},
|
2020-03-09 14:57:07 +01:00
|
|
|
),
|
|
|
|
},
|
|
|
|
|
|
|
|
Stmt::While(expr, stmt) => match *expr {
|
|
|
|
Expr::False(pos) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
Stmt::Noop(pos)
|
|
|
|
}
|
2020-03-13 11:12:41 +01:00
|
|
|
Expr::True(_) => Stmt::Loop(Box::new(optimize_stmt(*stmt, state, false))),
|
2020-03-10 04:22:41 +01:00
|
|
|
expr => Stmt::While(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(expr, state)),
|
|
|
|
Box::new(optimize_stmt(*stmt, state, false)),
|
2020-03-09 14:57:07 +01:00
|
|
|
),
|
|
|
|
},
|
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
Stmt::Loop(stmt) => Stmt::Loop(Box::new(optimize_stmt(*stmt, state, false))),
|
2020-03-09 14:57:07 +01:00
|
|
|
Stmt::For(id, expr, stmt) => Stmt::For(
|
|
|
|
id,
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(*expr, state)),
|
|
|
|
Box::new(optimize_stmt(*stmt, state, false)),
|
2020-03-09 14:57:07 +01:00
|
|
|
),
|
|
|
|
Stmt::Let(id, Some(expr), pos) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
Stmt::Let(id, Some(Box::new(optimize_expr(*expr, state))), pos)
|
2020-03-09 14:57:07 +01:00
|
|
|
}
|
|
|
|
Stmt::Let(_, None, _) => stmt,
|
|
|
|
|
|
|
|
Stmt::Block(statements, pos) => {
|
2020-03-12 07:54:14 +01:00
|
|
|
let orig_len = statements.len();
|
2020-03-15 15:39:58 +01:00
|
|
|
let orig_constants_len = state.constants.len();
|
2020-03-09 14:57:07 +01:00
|
|
|
|
|
|
|
let mut result: Vec<_> = statements
|
|
|
|
.into_iter() // For each statement
|
2020-03-13 11:12:41 +01:00
|
|
|
.map(|stmt| {
|
|
|
|
if let Stmt::Const(name, value, pos) = stmt {
|
|
|
|
state.push_constant(&name, *value);
|
|
|
|
state.set_dirty();
|
|
|
|
Stmt::Noop(pos) // No need to keep constants
|
|
|
|
} else {
|
|
|
|
optimize_stmt(stmt, state, preserve_result) // Optimize the statement
|
|
|
|
}
|
|
|
|
})
|
2020-03-11 16:43:10 +01:00
|
|
|
.enumerate()
|
2020-03-13 11:12:41 +01:00
|
|
|
.filter(|(i, stmt)| stmt.is_op() || (preserve_result && *i == orig_len - 1)) // Remove no-op's but leave the last one if we need the result
|
|
|
|
.map(|(_, stmt)| stmt)
|
2020-03-09 14:57:07 +01:00
|
|
|
.collect();
|
|
|
|
|
2020-03-11 16:43:10 +01:00
|
|
|
// Remove all raw expression statements that are pure except for the very last statement
|
|
|
|
let last_stmt = if preserve_result { result.pop() } else { None };
|
2020-03-10 04:22:41 +01:00
|
|
|
|
2020-03-14 16:41:15 +01:00
|
|
|
result.retain(|stmt| !matches!(stmt, Stmt::Expr(expr) if expr.is_pure()));
|
2020-03-11 16:43:10 +01:00
|
|
|
|
|
|
|
if let Some(stmt) = last_stmt {
|
|
|
|
result.push(stmt);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove all let statements at the end of a block - the new variables will go away anyway.
|
|
|
|
// But be careful only remove ones that have no initial values or have values that are pure expressions,
|
|
|
|
// otherwise there may be side effects.
|
|
|
|
let mut removed = false;
|
|
|
|
|
|
|
|
while let Some(expr) = result.pop() {
|
|
|
|
match expr {
|
|
|
|
Stmt::Let(_, None, _) => removed = true,
|
|
|
|
Stmt::Let(_, Some(val_expr), _) if val_expr.is_pure() => removed = true,
|
|
|
|
_ => {
|
|
|
|
result.push(expr);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if preserve_result {
|
|
|
|
if removed {
|
|
|
|
result.push(Stmt::Noop(pos))
|
|
|
|
}
|
|
|
|
|
|
|
|
result = result
|
|
|
|
.into_iter()
|
|
|
|
.rev()
|
|
|
|
.enumerate()
|
2020-03-13 11:12:41 +01:00
|
|
|
.map(|(i, s)| optimize_stmt(s, state, i == 0)) // Optimize all other statements again
|
2020-03-11 16:43:10 +01:00
|
|
|
.rev()
|
|
|
|
.collect();
|
2020-03-10 04:22:41 +01:00
|
|
|
}
|
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
if orig_len != result.len() {
|
|
|
|
state.set_dirty();
|
|
|
|
}
|
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
state.restore_constants(orig_constants_len);
|
2020-03-09 14:57:07 +01:00
|
|
|
|
|
|
|
match result[..] {
|
2020-03-11 16:43:10 +01:00
|
|
|
// No statements in block - change to No-op
|
2020-03-09 14:57:07 +01:00
|
|
|
[] => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-10 04:22:41 +01:00
|
|
|
Stmt::Noop(pos)
|
|
|
|
}
|
2020-03-11 16:43:10 +01:00
|
|
|
// Only one statement - promote
|
2020-03-09 14:57:07 +01:00
|
|
|
[_] => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
result.remove(0)
|
|
|
|
}
|
|
|
|
_ => Stmt::Block(result, pos),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
Stmt::Expr(expr) => Stmt::Expr(Box::new(optimize_expr(*expr, state))),
|
2020-03-09 14:57:07 +01:00
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
Stmt::ReturnWithVal(Some(expr), is_return, pos) => {
|
|
|
|
Stmt::ReturnWithVal(Some(Box::new(optimize_expr(*expr, state))), is_return, pos)
|
|
|
|
}
|
2020-03-09 14:57:07 +01:00
|
|
|
|
2020-03-11 16:43:10 +01:00
|
|
|
stmt => stmt,
|
2020-03-09 14:57:07 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
fn optimize_expr<'a>(expr: Expr, state: &mut State<'a>) -> Expr {
|
2020-03-17 03:27:43 +01:00
|
|
|
const SKIP_FUNC_KEYWORDS: [&str; 3] = [KEYWORD_PRINT, KEYWORD_DEBUG, KEYWORD_DUMP_AST];
|
|
|
|
|
2020-03-09 14:57:07 +01:00
|
|
|
match expr {
|
2020-03-13 11:12:41 +01:00
|
|
|
Expr::Stmt(stmt, pos) => match optimize_stmt(*stmt, state, true) {
|
2020-03-09 14:57:07 +01:00
|
|
|
Stmt::Noop(_) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
Expr::Unit(pos)
|
|
|
|
}
|
|
|
|
Stmt::Expr(expr) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
*expr
|
|
|
|
}
|
|
|
|
stmt => Expr::Stmt(Box::new(stmt), pos),
|
|
|
|
},
|
2020-03-14 04:51:45 +01:00
|
|
|
Expr::Assignment(id1, expr1, pos1) => match *expr1 {
|
|
|
|
Expr::Assignment(id2, expr2, pos2) => match (*id1, *id2) {
|
|
|
|
(Expr::Variable(var1, _), Expr::Variable(var2, _)) if var1 == var2 => {
|
|
|
|
// Assignment to the same variable - fold
|
|
|
|
state.set_dirty();
|
|
|
|
|
|
|
|
Expr::Assignment(
|
|
|
|
Box::new(Expr::Variable(var1, pos1)),
|
|
|
|
Box::new(optimize_expr(*expr2, state)),
|
|
|
|
pos1,
|
|
|
|
)
|
|
|
|
}
|
|
|
|
(id1, id2) => Expr::Assignment(
|
|
|
|
Box::new(id1),
|
|
|
|
Box::new(Expr::Assignment(
|
|
|
|
Box::new(id2),
|
|
|
|
Box::new(optimize_expr(*expr2, state)),
|
|
|
|
pos2,
|
|
|
|
)),
|
|
|
|
pos1,
|
|
|
|
),
|
|
|
|
},
|
|
|
|
expr => Expr::Assignment(id1, Box::new(optimize_expr(expr, state)), pos1),
|
|
|
|
},
|
2020-03-09 14:57:07 +01:00
|
|
|
Expr::Dot(lhs, rhs, pos) => Expr::Dot(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(*lhs, state)),
|
|
|
|
Box::new(optimize_expr(*rhs, state)),
|
2020-03-09 14:57:07 +01:00
|
|
|
pos,
|
|
|
|
),
|
2020-03-11 04:03:18 +01:00
|
|
|
|
2020-03-10 10:10:33 +01:00
|
|
|
#[cfg(not(feature = "no_index"))]
|
|
|
|
Expr::Index(lhs, rhs, pos) => match (*lhs, *rhs) {
|
|
|
|
(Expr::Array(mut items, _), Expr::IntegerConstant(i, _))
|
2020-03-11 16:43:10 +01:00
|
|
|
if i >= 0 && (i as usize) < items.len() && items.iter().all(|x| x.is_pure()) =>
|
2020-03-10 10:10:33 +01:00
|
|
|
{
|
2020-03-16 05:41:52 +01:00
|
|
|
// Array literal where everything is pure - promote the indexed item.
|
2020-03-11 16:43:10 +01:00
|
|
|
// All other items can be thrown away.
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-10 10:10:33 +01:00
|
|
|
items.remove(i as usize)
|
|
|
|
}
|
2020-03-17 03:27:43 +01:00
|
|
|
(Expr::StringConstant(s, pos), Expr::IntegerConstant(i, _))
|
2020-03-16 05:41:52 +01:00
|
|
|
if i >= 0 && (i as usize) < s.chars().count() =>
|
|
|
|
{
|
|
|
|
// String literal indexing - get the character
|
|
|
|
state.set_dirty();
|
|
|
|
Expr::CharConstant(s.chars().nth(i as usize).expect("should get char"), pos)
|
|
|
|
}
|
|
|
|
|
2020-03-10 10:10:33 +01:00
|
|
|
(lhs, rhs) => Expr::Index(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(lhs, state)),
|
|
|
|
Box::new(optimize_expr(rhs, state)),
|
2020-03-10 10:10:33 +01:00
|
|
|
pos,
|
|
|
|
),
|
|
|
|
},
|
2020-03-11 04:03:18 +01:00
|
|
|
|
2020-03-10 10:10:33 +01:00
|
|
|
#[cfg(not(feature = "no_index"))]
|
2020-03-09 14:57:07 +01:00
|
|
|
Expr::Array(items, pos) => {
|
2020-03-12 07:54:14 +01:00
|
|
|
let orig_len = items.len();
|
2020-03-09 14:57:07 +01:00
|
|
|
|
|
|
|
let items: Vec<_> = items
|
|
|
|
.into_iter()
|
2020-03-13 11:12:41 +01:00
|
|
|
.map(|expr| optimize_expr(expr, state))
|
2020-03-09 14:57:07 +01:00
|
|
|
.collect();
|
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
if orig_len != items.len() {
|
|
|
|
state.set_dirty();
|
|
|
|
}
|
2020-03-09 14:57:07 +01:00
|
|
|
|
|
|
|
Expr::Array(items, pos)
|
|
|
|
}
|
|
|
|
|
|
|
|
Expr::And(lhs, rhs) => match (*lhs, *rhs) {
|
|
|
|
(Expr::True(_), rhs) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
rhs
|
|
|
|
}
|
|
|
|
(Expr::False(pos), _) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
Expr::False(pos)
|
|
|
|
}
|
|
|
|
(lhs, Expr::True(_)) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
lhs
|
|
|
|
}
|
|
|
|
(lhs, rhs) => Expr::And(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(lhs, state)),
|
|
|
|
Box::new(optimize_expr(rhs, state)),
|
2020-03-09 14:57:07 +01:00
|
|
|
),
|
|
|
|
},
|
|
|
|
Expr::Or(lhs, rhs) => match (*lhs, *rhs) {
|
|
|
|
(Expr::False(_), rhs) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
rhs
|
|
|
|
}
|
|
|
|
(Expr::True(pos), _) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
Expr::True(pos)
|
|
|
|
}
|
|
|
|
(lhs, Expr::False(_)) => {
|
2020-03-13 11:12:41 +01:00
|
|
|
state.set_dirty();
|
2020-03-09 14:57:07 +01:00
|
|
|
lhs
|
|
|
|
}
|
|
|
|
(lhs, rhs) => Expr::Or(
|
2020-03-13 11:12:41 +01:00
|
|
|
Box::new(optimize_expr(lhs, state)),
|
|
|
|
Box::new(optimize_expr(rhs, state)),
|
2020-03-09 14:57:07 +01:00
|
|
|
),
|
|
|
|
},
|
2020-03-11 16:43:10 +01:00
|
|
|
|
2020-03-17 03:27:43 +01:00
|
|
|
// Do not optimize anything within built-in function keywords
|
|
|
|
Expr::FunctionCall(id, args, def_value, pos) if SKIP_FUNC_KEYWORDS.contains(&id.as_str())=>
|
|
|
|
Expr::FunctionCall(id, args, def_value, pos),
|
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
// Actually call function to optimize it
|
|
|
|
Expr::FunctionCall(id, args, def_value, pos)
|
2020-03-17 03:27:43 +01:00
|
|
|
if state.engine.map(|eng| eng.optimization_level == OptimizationLevel::Full).unwrap_or(false) // full optimizations
|
2020-03-15 15:39:58 +01:00
|
|
|
&& args.iter().all(|expr| expr.is_constant()) // all arguments are constants
|
2020-03-17 03:27:43 +01:00
|
|
|
=> {
|
2020-03-15 15:39:58 +01:00
|
|
|
let engine = state.engine.expect("engine should be Some");
|
|
|
|
let mut arg_values: Vec<_> = args.iter().map(Expr::get_constant_value).collect();
|
|
|
|
let call_args: FnCallArgs = arg_values.iter_mut().map(Dynamic::as_mut).collect();
|
2020-03-17 03:27:43 +01:00
|
|
|
|
|
|
|
// Save the typename of the first argument if it is `type_of()`
|
|
|
|
// This is to avoid `call_args` being passed into the closure
|
|
|
|
let arg_for_type_of = if id == KEYWORD_TYPE_OF && call_args.len() == 1 {
|
|
|
|
engine.map_type_name(call_args[0].type_name())
|
|
|
|
} else {
|
|
|
|
""
|
|
|
|
};
|
|
|
|
|
|
|
|
engine.call_ext_fn_raw(&id, call_args, pos).ok().map(|r|
|
|
|
|
r.or_else(|| {
|
|
|
|
if !arg_for_type_of.is_empty() {
|
|
|
|
// Handle `type_of()`
|
|
|
|
Some(arg_for_type_of.to_string().into_dynamic())
|
|
|
|
} else {
|
|
|
|
// Otherwise use the default value, if any
|
|
|
|
def_value.clone()
|
|
|
|
}
|
|
|
|
}).and_then(|result| map_dynamic_to_expr(result, pos).0)
|
2020-03-15 15:39:58 +01:00
|
|
|
.map(|expr| {
|
|
|
|
state.set_dirty();
|
|
|
|
expr
|
2020-03-17 03:27:43 +01:00
|
|
|
})
|
|
|
|
).flatten().unwrap_or_else(|| Expr::FunctionCall(id, args, def_value, pos))
|
2020-03-15 15:39:58 +01:00
|
|
|
}
|
|
|
|
// Optimize the function call arguments
|
2020-03-17 03:27:43 +01:00
|
|
|
Expr::FunctionCall(id, args, def_value, pos) =>
|
|
|
|
Expr::FunctionCall(id, args.into_iter().map(|a| optimize_expr(a, state)).collect(), def_value, pos),
|
2020-03-11 16:43:10 +01:00
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
Expr::Variable(ref name, _) if state.contains_constant(name) => {
|
|
|
|
state.set_dirty();
|
|
|
|
|
|
|
|
// Replace constant with value
|
|
|
|
state
|
|
|
|
.find_constant(name)
|
2020-03-15 15:39:58 +01:00
|
|
|
.expect("should find constant in scope!")
|
2020-03-13 11:12:41 +01:00
|
|
|
.clone()
|
|
|
|
}
|
|
|
|
|
2020-03-11 16:43:10 +01:00
|
|
|
expr => expr,
|
2020-03-09 14:57:07 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
pub(crate) fn optimize<'a>(
|
|
|
|
statements: Vec<Stmt>,
|
|
|
|
engine: Option<&Engine<'a>>,
|
|
|
|
scope: &Scope,
|
|
|
|
) -> Vec<Stmt> {
|
|
|
|
// If optimization level is None then skip optimizing
|
|
|
|
if engine
|
|
|
|
.map(|eng| eng.optimization_level == OptimizationLevel::None)
|
|
|
|
.unwrap_or(false)
|
|
|
|
{
|
|
|
|
return statements;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Set up the state
|
|
|
|
let mut state = State::new();
|
|
|
|
state.engine = engine;
|
|
|
|
|
|
|
|
scope
|
|
|
|
.iter()
|
|
|
|
.filter(|ScopeEntry { var_type, expr, .. }| {
|
|
|
|
// Get all the constants with definite constant expressions
|
|
|
|
*var_type == VariableType::Constant
|
|
|
|
&& expr.as_ref().map(Expr::is_constant).unwrap_or(false)
|
|
|
|
})
|
|
|
|
.for_each(|ScopeEntry { name, expr, .. }| {
|
|
|
|
state.push_constant(
|
|
|
|
name.as_ref(),
|
|
|
|
expr.as_ref().expect("should be Some(expr)").clone(),
|
|
|
|
)
|
|
|
|
});
|
|
|
|
|
|
|
|
let orig_constants_len = state.constants.len();
|
|
|
|
|
|
|
|
// Optimization loop
|
2020-03-11 16:43:10 +01:00
|
|
|
let mut result = statements;
|
|
|
|
|
2020-03-09 14:57:07 +01:00
|
|
|
loop {
|
2020-03-15 15:39:58 +01:00
|
|
|
state.reset();
|
|
|
|
state.restore_constants(orig_constants_len);
|
2020-03-09 14:57:07 +01:00
|
|
|
|
2020-03-15 15:39:58 +01:00
|
|
|
let num_statements = result.len();
|
2020-03-14 07:30:44 +01:00
|
|
|
|
2020-03-11 16:43:10 +01:00
|
|
|
result = result
|
2020-03-09 14:57:07 +01:00
|
|
|
.into_iter()
|
2020-03-11 16:43:10 +01:00
|
|
|
.enumerate()
|
|
|
|
.map(|(i, stmt)| {
|
2020-03-13 11:12:41 +01:00
|
|
|
if let Stmt::Const(name, value, _) = &stmt {
|
|
|
|
// Load constants
|
|
|
|
state.push_constant(name, value.as_ref().clone());
|
|
|
|
stmt // Keep it in the top scope
|
|
|
|
} else {
|
|
|
|
// Keep all variable declarations at this level
|
|
|
|
// and always keep the last return value
|
|
|
|
let keep = stmt.is_var() || i == num_statements - 1;
|
|
|
|
|
|
|
|
optimize_stmt(stmt, &mut state, keep)
|
|
|
|
}
|
2020-03-11 16:43:10 +01:00
|
|
|
})
|
2020-03-09 14:57:07 +01:00
|
|
|
.collect();
|
|
|
|
|
2020-03-13 11:12:41 +01:00
|
|
|
if !state.is_dirty() {
|
2020-03-09 14:57:07 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-12 16:46:52 +01:00
|
|
|
// Eliminate code that is pure but always keep the last statement
|
2020-03-11 16:43:10 +01:00
|
|
|
let last_stmt = result.pop();
|
|
|
|
|
2020-03-12 16:46:52 +01:00
|
|
|
// Remove all pure statements at top level
|
2020-03-14 16:41:15 +01:00
|
|
|
result.retain(|stmt| !matches!(stmt, Stmt::Expr(expr) if expr.is_pure()));
|
2020-03-11 16:43:10 +01:00
|
|
|
|
|
|
|
if let Some(stmt) = last_stmt {
|
|
|
|
result.push(stmt); // Add back the last statement
|
|
|
|
}
|
|
|
|
|
|
|
|
result
|
2020-03-09 14:57:07 +01:00
|
|
|
}
|
2020-03-15 15:39:58 +01:00
|
|
|
|
|
|
|
pub fn optimize_ast(
|
|
|
|
engine: &Engine,
|
|
|
|
scope: &Scope,
|
|
|
|
statements: Vec<Stmt>,
|
|
|
|
functions: Vec<FnDef>,
|
|
|
|
) -> AST {
|
|
|
|
AST(
|
|
|
|
match engine.optimization_level {
|
|
|
|
OptimizationLevel::None => statements,
|
|
|
|
OptimizationLevel::Simple => optimize(statements, None, &scope),
|
|
|
|
OptimizationLevel::Full => optimize(statements, Some(engine), &scope),
|
|
|
|
},
|
|
|
|
functions
|
|
|
|
.into_iter()
|
|
|
|
.map(|mut fn_def| {
|
|
|
|
match engine.optimization_level {
|
|
|
|
OptimizationLevel::None => (),
|
|
|
|
OptimizationLevel::Simple | OptimizationLevel::Full => {
|
|
|
|
let pos = fn_def.body.position();
|
|
|
|
let mut body = optimize(vec![fn_def.body], None, &Scope::new());
|
|
|
|
fn_def.body = body.pop().unwrap_or_else(|| Stmt::Noop(pos));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Arc::new(fn_def)
|
|
|
|
})
|
|
|
|
.collect(),
|
|
|
|
)
|
|
|
|
}
|