//: Arithmetic primitives
:(before "End Primitive Recipe Declarations")
ADD,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "add", ADD);
:(before "End Primitive Recipe Checks")
case ADD: {
// primary goal of these checks is to forbid address arithmetic
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_number(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'add' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'add' yields exactly one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'add' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case ADD: {
double result = 0;
for (int i = 0; i < SIZE(ingredients); ++i) {
result += ingredients.at(i).at(0);
}
products.resize(1);
products.at(0).push_back(result);
break;
}
:(code)
void test_add_literal() {
run(
"def main [\n"
" 1:num <- add 23, 34\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 57 in location 1\n"
);
}
void test_add() {
run(
"def main [\n"
" 1:num <- copy 23\n"
" 2:num <- copy 34\n"
" 3:num <- add 1:num, 2:num\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 57 in location 3\n"
);
}
void test_add_multiple() {
run(
"def main [\n"
" 1:num <- add 3, 4, 5\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 12 in location 1\n"
);
}
void test_add_checks_type() {
Hide_errors = true;
run(
"def main [\n"
" 1:num <- add 2:bool, 1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"error: main: 'add' requires number ingredients, but got '2:bool'\n"
);
}
void test_add_checks_return_type() {
Hide_errors = true;
run(
"def main [\n"
" 1:&:num <- add 2, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"error: main: 'add' should yield a number, but got '1:&:num'\n"
);
}
:(before "End Primitive Recipe Declarations")
SUBTRACT,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "subtract", SUBTRACT);
:(before "End Primitive Recipe Checks")
case SUBTRACT: {
if (inst.ingredients.empty()) {
raise << maybe(get(Recipe, r).name) << "'subtract' has no ingredients\n" << end();
break;
}
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_number(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'subtract' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'subtract' yields exactly one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'subtract' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case SUBTRACT: {
double result = ingredients.at(0).at(0);
for (int i = 1; i < SIZE(ingredients); ++i)
result -= ingredients.at(i).at(0);
products.resize(1);
products.at(0).push_back(result);
break;
}
:(code)
void test_subtract_literal() {
run(
"def main [\n"
" 1:num <- subtract 5, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 3 in location 1\n"
);
}
void test_subtract() {
run(
"def main [\n"
" 1:num <- copy 23\n"
" 2:num <- copy 34\n"
" 3:num <- subtract 1:num, 2:num\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing -11 in location 3\n"
);
}
void test_subtract_multiple() {
run(
"def main [\n"
" 1:num <- subtract 6, 3, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
:(before "End Primitive Recipe Declarations")
MULTIPLY,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "multiply", MULTIPLY);
:(before "End Primitive Recipe Checks")
case MULTIPLY: {
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_number(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'multiply' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'multiply' yields exactly one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'multiply' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case MULTIPLY: {
double result = 1;
for (int i = 0; i < SIZE(ingredients); ++i) {
result *= ingredients.at(i).at(0);
}
products.resize(1);
products.at(0).push_back(result);
break;
}
:(code)
void test_multiply_literal() {
run(
"def main [\n"
" 1:num <- multiply 2, 3\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 6 in location 1\n"
);
}
void test_multiply() {
run(
"def main [\n"
" 1:num <- copy 4\n"
" 2:num <- copy 6\n"
" 3:num <- multiply 1:num, 2:num\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 24 in location 3\n"
);
}
void test_multiply_multiple() {
run(
"def main [\n"
" 1:num <- multiply 2, 3, 4\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 24 in location 1\n"
);
}
:(before "End Primitive Recipe Declarations")
DIVIDE,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "divide", DIVIDE);
:(before "End Primitive Recipe Checks")
case DIVIDE: {
if (inst.ingredients.empty()) {
raise << maybe(get(Recipe, r).name) << "'divide' has no ingredients\n" << end();
break;
}
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_number(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'divide' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'divide' yields exactly one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'divide' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case DIVIDE: {
double result = ingredients.at(0).at(0);
for (int i = 1; i < SIZE(ingredients); ++i)
result /= ingredients.at(i).at(0);
products.resize(1);
products.at(0).push_back(result);
break;
}
:(code)
void test_divide_literal() {
run(
"def main [\n"
" 1:num <- divide 8, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 4 in location 1\n"
);
}
void test_divide() {
run(
"def main [\n"
" 1:num <- copy 27\n"
" 2:num <- copy 3\n"
" 3:num <- divide 1:num, 2:num\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 9 in location 3\n"
);
}
void test_divide_multiple() {
run(
"def main [\n"
" 1:num <- divide 12, 3, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 2 in location 1\n"
);
}
//: Integer division
:(before "End Primitive Recipe Declarations")
DIVIDE_WITH_REMAINDER,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "divide-with-remainder", DIVIDE_WITH_REMAINDER);
:(before "End Primitive Recipe Checks")
case DIVIDE_WITH_REMAINDER: {
if (SIZE(inst.ingredients) != 2) {
raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) {
raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (SIZE(inst.products) > 2) {
raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' yields two products in '" << to_original_string(inst) << "'\n" << end();
break;
}
for (int i = 0; i < SIZE(inst.products); ++i) {
if (!is_dummy(inst.products.at(i)) && !is_mu_number(inst.products.at(i))) {
raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' should yield a number, but got '" << inst.products.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
break;
}
:(before "End Primitive Recipe Implementations")
case DIVIDE_WITH_REMAINDER: {
products.resize(2);
// fractions will be dropped; very large numbers will overflow
long long int a = static_cast<long long int>(ingredients.at(0).at(0));
long long int b = static_cast<long long int>(ingredients.at(1).at(0));
if (b == 0) {
raise << maybe(current_recipe_name()) << "divide by zero in '" << to_original_string(current_instruction()) << "'\n" << end();
products.resize(2);
products.at(0).push_back(0);
products.at(1).push_back(0);
break;
}
long long int quotient = a / b;
long long int remainder = a % b;
products.at(0).push_back(static_cast<double>(quotient));
products.at(1).push_back(static_cast<double>(remainder));
break;
}
:(code)
void test_divide_with_remainder_literal() {
run(
"def main [\n"
" 1:num, 2:num <- divide-with-remainder 9, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 4 in location 1\n"
"mem: storing 1 in location 2\n"
);
}
void test_divide_with_remainder() {
run(
"def main [\n"
" 1:num <- copy 27\n"
" 2:num <- copy 11\n"
" 3:num, 4:num <- divide-with-remainder 1:num, 2:num\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 2 in location 3\n"
"mem: storing 5 in location 4\n"
);
}
void test_divide_with_decimal_point() {
run(
"def main [\n"
" 1:num <- divide 5, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 2.5 in location 1\n"
);
}
void test_divide_by_zero() {
run(
"def main [\n"
" 1:num <- divide 4, 0\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing inf in location 1\n"
);
}
void test_divide_by_zero_2() {
Hide_errors = true;
run(
"def main [\n"
" 1:num <- divide-with-remainder 4, 0\n"
"]\n"
);
// integer division can't return floating-point infinity
CHECK_TRACE_CONTENTS(
"error: main: divide by zero in '1:num <- divide-with-remainder 4, 0'\n"
);
}
//: Bitwise shifts
:(before "End Primitive Recipe Declarations")
SHIFT_LEFT,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "shift-left", SHIFT_LEFT);
:(before "End Primitive Recipe Checks")
case SHIFT_LEFT: {
if (SIZE(inst.ingredients) != 2) {
raise << maybe(get(Recipe, r).name) << "'shift-left' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) {
raise << maybe(get(Recipe, r).name) << "'shift-left' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'shift-left' yields one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'shift-left' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end();
goto finish_checking_instruction;
}
break;
}
:(before "End Primitive Recipe Implementations")
case SHIFT_LEFT: {
// ingredients must be integers
int a = static_cast<int>(ingredients.at(0).at(0));
int b = static_cast<int>(ingredients.at(1).at(0));
products.resize(1);
if (b < 0) {
raise << maybe(current_recipe_name()) << "second ingredient can't be negative in '" << to_original_string(current_instruction()) << "'\n" << end();
products.at(0).push_back(0);
break;
}
products.at(0).push_back(a<<b);
break;
}
:(code)
void test_shift_left_by_zero() {
run(
"def main [\n"
" 1:num <- shift-left 1, 0\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
void test_shift_left_1() {
run(
"def main [\n"
" 1:num <- shift-left 1, 4\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 16 in location 1\n"
);
}
void test_shift_left_2() {
run(
"def main [\n"
" 1:num <- shift-left 3, 2\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 12 in location 1\n"
);
}
void test_shift_left_by_negative() {
Hide_errors = true;
run(
"def main [\n"
" 1:num <- shift-left 3, -1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"error: main: second ingredient can't be negative in '1:num <- shift-left 3, -1'\n"
);
}
void test_shift_left_ignores_fractional_part() {
run(
"def main [\n"
" 1:num <- divide 3, 2\n"
" 2:num <- shift-left 1:num, 1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 2 in location 2\n"
);
}
:(before "End Primitive Recipe Declarations")
SHIFT_RIGHT,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "shift-right", SHIFT_RIGHT);
:(before "End Primitive Recipe Checks")
case SHIFT_RIGHT: {
if (SIZE(inst.ingredients) != 2) {
raise << maybe(get(Recipe, r).name) << "'shift-right' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) {
raise << maybe(get(Recipe, r).name) << "'shift-right' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'shift-right' yields one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'shift-right' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end();
goto finish_checking_instruction;
}
break;
}
:(before "End Primitive Recipe Implementations")
case SHIFT_RIGHT: {
// ingredients must be integers
int a = static_cast<int>(ingredients.at(0).at(0));
int b = static_cast<int>(ingredients.at(1).at(0));
products.resize(1);
if (b < 0) {
raise << maybe(current_recipe_name()) << "second ingredient can't be negative in '" << to_original_string(current_instruction()) << "'\n" << end();
products.at(0).push_back(0);
break;
}
products.at(0).push_back(a>>b);
break;
}
:(code)
void test_shift_right_by_zero() {
run(
"def main [\n"
" 1:num <- shift-right 1, 0\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
void test_shift_right_1() {
run(
"def main [\n"
" 1:num <- shift-right 1024, 1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 512 in location 1\n"
);
}
void test_shift_right_2() {
run(
"def main [\n"
" 1:num <- shift-right 3, 1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
void test_shift_right_by_negative() {
Hide_errors = true;
run(
"def main [\n"
" 1:num <- shift-right 4, -1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"error: main: second ingredient can't be negative in '1:num <- shift-right 4, -1'\n"
);
}
void test_shift_right_ignores_fractional_part() {
run(
"def main [\n"
" 1:num <- divide 3, 2\n"
" 2:num <- shift-right 1:num, 1\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 2\n"
);
}
:(before "End Primitive Recipe Declarations")
AND_BITS,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "and-bits", AND_BITS);
:(before "End Primitive Recipe Checks")
case AND_BITS: {
if (SIZE(inst.ingredients) != 2) {
raise << maybe(get(Recipe, r).name) << "'and-bits' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) {
raise << maybe(get(Recipe, r).name) << "'and-bits' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end();
break;
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'and-bits' yields one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'and-bits' should yield a number, but got '" << inst.products.at(0).original_string << "'\n"
