2015-03-17 03:26:59 +00:00
|
|
|
//: Calls can take ingredients just like primitives. To access a recipe's
|
2015-03-17 04:19:50 +00:00
|
|
|
//: ingredients, use 'next-ingredient'.
|
2015-04-17 18:22:59 +00:00
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario next_ingredient)
|
2015-03-15 16:49:23 +00:00
|
|
|
recipe main [
|
|
|
|
f 2:literal
|
|
|
|
]
|
|
|
|
recipe f [
|
2015-03-17 04:19:50 +00:00
|
|
|
12:integer <- next-ingredient
|
2015-03-15 16:49:23 +00:00
|
|
|
13:integer <- add 1:literal, 12:integer
|
|
|
|
]
|
|
|
|
+run: instruction f/1
|
|
|
|
+mem: location 12 is 2
|
2015-03-24 06:59:59 +00:00
|
|
|
+mem: storing 3 in location 13
|
2015-03-15 16:49:23 +00:00
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario next_ingredient_missing)
|
2015-04-20 03:38:09 +00:00
|
|
|
recipe main [
|
|
|
|
f
|
|
|
|
]
|
|
|
|
recipe f [
|
|
|
|
_, 12:integer <- next-ingredient
|
|
|
|
]
|
|
|
|
+mem: storing 0 in location 12
|
|
|
|
|
2015-04-13 03:56:45 +00:00
|
|
|
:(before "End call Fields")
|
2015-05-06 00:20:11 +00:00
|
|
|
vector<vector<long long int> > ingredient_atoms;
|
2015-05-04 18:02:56 +00:00
|
|
|
index_t next_ingredient_to_process;
|
2015-03-15 16:49:23 +00:00
|
|
|
:(replace{} "call(recipe_number r)")
|
2015-04-25 03:41:37 +00:00
|
|
|
call(recipe_number r) :running_recipe(r), running_step_index(0), next_ingredient_to_process(0) {}
|
2015-03-15 16:49:23 +00:00
|
|
|
|
2015-04-25 03:07:17 +00:00
|
|
|
:(replace "Current_routine->calls.push(call(current_instruction().operation))" following "End Primitive Recipe Implementations")
|
|
|
|
call callee(current_instruction().operation);
|
2015-05-07 22:06:53 +00:00
|
|
|
for (size_t i = 0; i < ingredients.size(); ++i) {
|
|
|
|
callee.ingredient_atoms.push_back(ingredients.at(i));
|
2015-03-15 16:49:23 +00:00
|
|
|
}
|
2015-04-25 02:58:38 +00:00
|
|
|
Current_routine->calls.push(callee);
|
2015-03-15 16:49:23 +00:00
|
|
|
|
2015-04-17 17:31:17 +00:00
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
NEXT_INGREDIENT,
|
2015-03-15 16:49:23 +00:00
|
|
|
:(before "End Primitive Recipe Numbers")
|
2015-03-17 04:19:50 +00:00
|
|
|
Recipe_number["next-ingredient"] = NEXT_INGREDIENT;
|
2015-03-15 16:49:23 +00:00
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case NEXT_INGREDIENT: {
|
2015-04-25 02:58:38 +00:00
|
|
|
if (Current_routine->calls.top().next_ingredient_to_process < Current_routine->calls.top().ingredient_atoms.size()) {
|
2015-05-07 22:06:53 +00:00
|
|
|
products.push_back(
|
|
|
|
Current_routine->calls.top().ingredient_atoms.at(Current_routine->calls.top().next_ingredient_to_process));
|
|
|
|
assert(products.size() == 1); products.resize(2); // push a new vector
|
|
|
|
products.at(1).push_back(1);
|
2015-04-25 02:58:38 +00:00
|
|
|
++Current_routine->calls.top().next_ingredient_to_process;
|
2015-03-15 16:49:23 +00:00
|
|
|
}
|
2015-04-20 03:38:09 +00:00
|
|
|
else {
|
2015-05-07 22:06:53 +00:00
|
|
|
products.resize(2);
|
|
|
|
products.at(0).push_back(0); // todo: will fail noisily if we try to read a compound value
|
|
|
|
products.at(1).push_back(0);
|
2015-04-20 03:38:09 +00:00
|
|
|
}
|
2015-03-15 16:49:23 +00:00
|
|
|
break;
|
|
|
|
}
|
2015-04-20 03:49:30 +00:00
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario rewind_ingredients)
|
2015-04-20 03:49:30 +00:00
|
|
|
recipe main [
|
|
|
|
f 2:literal
|
|
|
|
]
|
|
|
|
recipe f [
|
|
|
|
12:integer <- next-ingredient # consume ingredient
|
|
|
|
_, 1:boolean <- next-ingredient # will not find any ingredients
|
|
|
|
rewind-ingredients
|
|
|
|
13:integer, 2:boolean <- next-ingredient # will find ingredient again
|
|
|
|
]
|
|
|
|
+mem: storing 2 in location 12
|
|
|
|
+mem: storing 0 in location 1
|
|
|
|
+mem: storing 2 in location 13
|
|
|
|
+mem: storing 1 in location 2
|
|
|
|
|
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
REWIND_INGREDIENTS,
|
|
|
|
:(before "End Primitive Recipe Numbers")
|
|
|
|
Recipe_number["rewind-ingredients"] = REWIND_INGREDIENTS;
|
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case REWIND_INGREDIENTS: {
|
2015-04-25 02:58:38 +00:00
|
|
|
Current_routine->calls.top().next_ingredient_to_process = 0;
|
2015-04-20 03:49:30 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario ingredient)
|
2015-04-20 03:49:30 +00:00
|
|
|
recipe main [
|
|
|
|
f 1:literal, 2:literal
|
|
|
|
]
|
|
|
|
recipe f [
|
|
|
|
12:integer <- ingredient 1:literal # consume second ingredient first
|
|
|
|
13:integer, 1:boolean <- next-ingredient # next-ingredient tries to scan past that
|
|
|
|
]
|
|
|
|
+mem: storing 2 in location 12
|
|
|
|
+mem: storing 0 in location 1
|
|
|
|
|
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
INGREDIENT,
|
|
|
|
:(before "End Primitive Recipe Numbers")
|
|
|
|
Recipe_number["ingredient"] = INGREDIENT;
|
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case INGREDIENT: {
|
2015-05-07 22:06:53 +00:00
|
|
|
assert(isa_literal(current_instruction().ingredients.at(0)));
|
|
|
|
assert(ingredients.at(0).size() == 1); // scalar
|
|
|
|
if (static_cast<index_t>(ingredients.at(0).at(0)) < Current_routine->calls.top().ingredient_atoms.size()) {
|
|
|
|
Current_routine->calls.top().next_ingredient_to_process = ingredients.at(0).at(0);
|
|
|
|
products.push_back(
|
|
|
|
Current_routine->calls.top().ingredient_atoms.at(Current_routine->calls.top().next_ingredient_to_process));
|
|
|
|
assert(products.size() == 1); products.resize(2); // push a new vector
|
2015-05-13 00:00:56 +00:00
|
|
|
products.at(1).push_back(1);
|
2015-04-25 02:58:38 +00:00
|
|
|
++Current_routine->calls.top().next_ingredient_to_process;
|
2015-04-20 03:49:30 +00:00
|
|
|
}
|
|
|
|
else {
|
2015-04-25 03:07:17 +00:00
|
|
|
if (current_instruction().products.size() > 1) {
|
2015-05-07 22:06:53 +00:00
|
|
|
products.resize(2);
|
|
|
|
products.at(0).push_back(0); // todo: will fail noisily if we try to read a compound value
|
2015-05-13 00:00:56 +00:00
|
|
|
products.at(1).push_back(0);
|
2015-04-20 03:49:30 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|