You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
99 lines
3.2 KiB
99 lines
3.2 KiB
10 years ago
|
#include <stdio.h>
|
||
|
|
#include <iostream>
|
||
|
|
#include <vector>
|
||
|
|
#include <map>
|
||
|
|
#include "util.h"
|
||
|
|
#include "lllparser.h"
|
||
|
|
#include "bignum.h"
|
||
|
|
|
||
|
|
// Compile-time arithmetic calculations
|
||
|
|
Node optimize(Node inp) {
|
||
|
|
if (inp.type == TOKEN) {
|
||
|
|
Node o = tryNumberize(inp);
|
||
|
|
if (decimalGt(o.val, tt256, true))
|
||
|
|
err("Value too large (exceeds 32 bytes or 2^256)", inp.metadata);
|
||
|
|
return o;
|
||
|
|
}
|
||
|
|
for (unsigned i = 0; i < inp.args.size(); i++) {
|
||
|
|
inp.args[i] = optimize(inp.args[i]);
|
||
|
|
}
|
||
|
|
// Arithmetic-specific transform
|
||
|
|
if (inp.val == "+") inp.val = "add";
|
||
|
|
if (inp.val == "*") inp.val = "mul";
|
||
|
|
if (inp.val == "-") inp.val = "sub";
|
||
|
|
if (inp.val == "/") inp.val = "sdiv";
|
||
|
|
if (inp.val == "^") inp.val = "exp";
|
||
|
|
if (inp.val == "**") inp.val = "exp";
|
||
|
|
if (inp.val == "%") inp.val = "smod";
|
||
|
|
// Degenerate cases for add and mul
|
||
|
|
if (inp.args.size() == 2) {
|
||
|
|
if (inp.val == "add" && inp.args[0].type == TOKEN &&
|
||
|
|
inp.args[0].val == "0") {
|
||
|
|
Node x = inp.args[1];
|
||
|
|
inp = x;
|
||
|
|
}
|
||
|
|
if (inp.val == "add" && inp.args[1].type == TOKEN &&
|
||
|
|
inp.args[1].val == "0") {
|
||
|
|
Node x = inp.args[0];
|
||
|
|
inp = x;
|
||
|
|
}
|
||
|
|
if (inp.val == "mul" && inp.args[0].type == TOKEN &&
|
||
|
|
inp.args[0].val == "1") {
|
||
|
|
Node x = inp.args[1];
|
||
|
|
inp = x;
|
||
|
|
}
|
||
|
|
if (inp.val == "mul" && inp.args[1].type == TOKEN &&
|
||
|
|
inp.args[1].val == "1") {
|
||
|
|
Node x = inp.args[0];
|
||
|
|
inp = x;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
// Arithmetic computation
|
||
|
|
if (inp.args.size() == 2
|
||
|
|
&& inp.args[0].type == TOKEN
|
||
|
|
&& inp.args[1].type == TOKEN) {
|
||
|
|
std::string o;
|
||
|
|
if (inp.val == "add") {
|
||
|
|
o = decimalMod(decimalAdd(inp.args[0].val, inp.args[1].val), tt256);
|
||
|
|
}
|
||
|
|
else if (inp.val == "sub") {
|
||
|
|
if (decimalGt(inp.args[0].val, inp.args[1].val, true))
|
||
|
|
o = decimalSub(inp.args[0].val, inp.args[1].val);
|
||
|
|
}
|
||
|
|
else if (inp.val == "mul") {
|
||
|
|
o = decimalMod(decimalMul(inp.args[0].val, inp.args[1].val), tt256);
|
||
|
|
}
|
||
|
|
else if (inp.val == "div" && inp.args[1].val != "0") {
|
||
|
|
o = decimalDiv(inp.args[0].val, inp.args[1].val);
|
||
|
|
}
|
||
|
|
else if (inp.val == "sdiv" && inp.args[1].val != "0"
|
||
|
|
&& decimalGt(tt255, inp.args[0].val)
|
||
|
|
&& decimalGt(tt255, inp.args[1].val)) {
|
||
|
|
o = decimalDiv(inp.args[0].val, inp.args[1].val);
|
||
|
|
}
|
||
|
|
else if (inp.val == "mod" && inp.args[1].val != "0") {
|
||
|
|
o = decimalMod(inp.args[0].val, inp.args[1].val);
|
||
|
|
}
|
||
|
|
else if (inp.val == "smod" && inp.args[1].val != "0"
|
||
|
|
&& decimalGt(tt255, inp.args[0].val)
|
||
|
|
&& decimalGt(tt255, inp.args[1].val)) {
|
||
|
|
o = decimalMod(inp.args[0].val, inp.args[1].val);
|
||
|
|
}
|
||
|
|
else if (inp.val == "exp") {
|
||
|
|
o = decimalModExp(inp.args[0].val, inp.args[1].val, tt256);
|
||
|
|
}
|
||
|
|
if (o.length()) return token(o, inp.metadata);
|
||
|
|
}
|
||
|
|
return inp;
|
||
|
|
}
|
||
|
|
|
||
|
|
// Is a node degenerate (ie. trivial to calculate) ?
|
||
|
|
bool isDegenerate(Node n) {
|
||
|
|
return optimize(n).type == TOKEN;
|
||
|
|
}
|
||
|
|
|
||
|
|
// Is a node purely arithmetic?
|
||
|
|
bool isPureArithmetic(Node n) {
|
||
|
|
return isNumberLike(optimize(n));
|
||
|
|
}
|