Mario Romano 29df96a085 react app
2016-04-06 17:52:19 +01:00

336 lines
8.8 KiB
JavaScript

/* eslint indent: 0 */
/* eslint max-len: 0 */
// This file contains Babels metainterpreter that can evaluate static code.
/* eslint eqeqeq: 0 */
"use strict";
exports.__esModule = true;
exports.evaluateTruthy = evaluateTruthy;
exports.evaluate = evaluate;
var VALID_CALLEES = ["String", "Number", "Math"];
var INVALID_METHODS = ["random"];
/**
* Walk the input `node` and statically evaluate if it's truthy.
*
* Returning `true` when we're sure that the expression will evaluate to a
* truthy value, `false` if we're sure that it will evaluate to a falsy
* value and `undefined` if we aren't sure. Because of this please do not
* rely on coercion when using this method and check with === if it's false.
*
* For example do:
*
* if (t.evaluateTruthy(node) === false) falsyLogic();
*
* **AND NOT**
*
* if (!t.evaluateTruthy(node)) falsyLogic();
*
*/
function evaluateTruthy() {
var res = this.evaluate();
if (res.confident) return !!res.value;
}
/**
* Walk the input `node` and statically evaluate it.
*
* Returns an object in the form `{ confident, value }`. `confident` indicates
* whether or not we had to drop out of evaluating the expression because of
* hitting an unknown node that we couldn't confidently find the value of.
*
* Example:
*
* t.evaluate(parse("5 + 5")) // { confident: true, value: 10 }
* t.evaluate(parse("!true")) // { confident: true, value: false }
* t.evaluate(parse("foo + foo")) // { confident: false, value: undefined }
*
*/
function evaluate() {
var confident = true;
var deoptPath = undefined;
function deopt(path) {
if (!confident) return;
deoptPath = path;
confident = false;
}
var value = evaluate(this);
if (!confident) value = undefined;
return {
confident: confident,
deopt: deoptPath,
value: value
};
function evaluate(path) {
if (!confident) return;
var node = path.node;
if (path.isSequenceExpression()) {
var exprs = path.get("expressions");
return evaluate(exprs[exprs.length - 1]);
}
if (path.isStringLiteral() || path.isNumericLiteral() || path.isBooleanLiteral()) {
return node.value;
}
if (path.isNullLiteral()) {
return null;
}
if (path.isTemplateLiteral()) {
var str = "";
var i = 0;
var exprs = path.get("expressions");
var _arr = node.quasis;
for (var _i = 0; _i < _arr.length; _i++) {
var elem = _arr[_i];
// not confident, evaluated an expression we don't like
if (!confident) break;
// add on cooked element
str += elem.value.cooked;
// add on interpolated expression if it's present
var expr = exprs[i++];
if (expr) str += String(evaluate(expr));
}
if (!confident) return;
return str;
}
if (path.isConditionalExpression()) {
var testResult = evaluate(path.get("test"));
if (!confident) return;
if (testResult) {
return evaluate(path.get("consequent"));
} else {
return evaluate(path.get("alternate"));
}
}
if (path.isExpressionWrapper()) {
// TypeCastExpression, ExpressionStatement etc
return evaluate(path.get("expression"));
}
// "foo".length
if (path.isMemberExpression() && !path.parentPath.isCallExpression({ callee: node })) {
var property = path.get("property");
var object = path.get("object");
if (object.isLiteral() && property.isIdentifier()) {
var _value = object.node.value;
var type = typeof _value;
if (type === "number" || type === "string") {
return _value[property.node.name];
}
}
}
if (path.isReferencedIdentifier()) {
var binding = path.scope.getBinding(node.name);
if (binding && binding.hasValue) {
return binding.value;
} else {
if (node.name === "undefined") {
return undefined;
} else if (node.name === "Infinity") {
return Infinity;
} else if (node.name === "NaN") {
return NaN;
}
var resolved = path.resolve();
if (resolved === path) {
return deopt(path);
} else {
return evaluate(resolved);
}
}
}
if (path.isUnaryExpression({ prefix: true })) {
if (node.operator === "void") {
// we don't need to evaluate the argument to know what this will return
return undefined;
}
var argument = path.get("argument");
if (node.operator === "typeof" && (argument.isFunction() || argument.isClass())) {
return "function";
}
var arg = evaluate(argument);
if (!confident) return;
switch (node.operator) {
case "!":
return !arg;
case "+":
return +arg;
case "-":
return -arg;
case "~":
return ~arg;
case "typeof":
return typeof arg;
}
}
if (path.isArrayExpression()) {
var arr = [];
var elems = path.get("elements");
for (var _i2 = 0; _i2 < elems.length; _i2++) {
var elem = elems[_i2];
elem = elem.evaluate();
if (elem.confident) {
arr.push(elem.value);
} else {
return deopt(elem);
}
}
return arr;
}
if (path.isObjectExpression()) {
// todo
}
if (path.isLogicalExpression()) {
// If we are confident that one side of an && is false, or the left
// side of an || is true, we can be confident about the entire expression
var wasConfident = confident;
var left = evaluate(path.get("left"));
var leftConfident = confident;
confident = wasConfident;
var right = evaluate(path.get("right"));
var rightConfident = confident;
confident = leftConfident && rightConfident;
switch (node.operator) {
case "||":
// TODO consider having a "truthy type" that doesn't bail on
// left uncertainity but can still evaluate to truthy.
if (left && leftConfident) {
confident = true;
return left;
}
if (!confident) return;
return left || right;
case "&&":
if (!left && leftConfident || !right && rightConfident) {
confident = true;
}
if (!confident) return;
return left && right;
}
}
if (path.isBinaryExpression()) {
var left = evaluate(path.get("left"));
if (!confident) return;
var right = evaluate(path.get("right"));
if (!confident) return;
switch (node.operator) {
case "-":
return left - right;
case "+":
return left + right;
case "/":
return left / right;
case "*":
return left * right;
case "%":
return left % right;
case "**":
return Math.pow(left, right);
case "<":
return left < right;
case ">":
return left > right;
case "<=":
return left <= right;
case ">=":
return left >= right;
case "==":
return left == right;
case "!=":
return left != right;
case "===":
return left === right;
case "!==":
return left !== right;
case "|":
return left | right;
case "&":
return left & right;
case "^":
return left ^ right;
case "<<":
return left << right;
case ">>":
return left >> right;
case ">>>":
return left >>> right;
}
}
if (path.isCallExpression()) {
var callee = path.get("callee");
var context = undefined;
var func = undefined;
// Number(1);
if (callee.isIdentifier() && !path.scope.getBinding(callee.node.name, true) && VALID_CALLEES.indexOf(callee.node.name) >= 0) {
func = global[node.callee.name];
}
if (callee.isMemberExpression()) {
var object = callee.get("object");
var property = callee.get("property");
// Math.min(1, 2)
if (object.isIdentifier() && property.isIdentifier() && VALID_CALLEES.indexOf(object.node.name) >= 0 && INVALID_METHODS.indexOf(property.node.name) < 0) {
context = global[object.node.name];
func = context[property.node.name];
}
// "abc".charCodeAt(4)
if (object.isLiteral() && property.isIdentifier()) {
var type = typeof object.node.value;
if (type === "string" || type === "number") {
context = object.node.value;
func = context[property.node.name];
}
}
}
if (func) {
var args = path.get("arguments").map(evaluate);
if (!confident) return;
return func.apply(context, args);
}
}
deopt(path);
}
}