mu/cpp/020call

99 lines
3.1 KiB
Plaintext
Raw Normal View History

2015-03-14 00:39:32 +00:00
:(scenario "calling_recipe")
recipe main [
f
]
recipe f [
3:integer <- add 2:literal, 2:literal
]
+mem: storing in location 3
2015-03-15 05:25:06 +00:00
:(before "End Call Fields")
vector<vector<int> > ingredient_atoms;
size_t next_ingredient_to_process;
2015-03-15 05:52:35 +00:00
:(replace{} "call(recipe_number r)")
call(recipe_number r) :running_recipe(r), pc(0), next_ingredient_to_process(0) {}
2015-03-15 05:25:06 +00:00
2015-03-15 15:41:23 +00:00
:(replace{} "default:" following "End Primitive Recipe Implementations.")
2015-03-15 00:10:33 +00:00
default: {
2015-03-15 05:25:06 +00:00
// not a primitive; try to look for a matching recipe
2015-03-15 00:10:33 +00:00
if (Recipe.find(instructions[pc].operation) == Recipe.end()) {
raise << "undefined operation " << instructions[pc].operation << '\n';
break;
}
call callee(instructions[pc].operation);
for (vector<reagent>::iterator p = instructions[pc].ingredients.begin(); p != instructions[pc].ingredients.end(); ++p) {
2015-03-15 05:25:06 +00:00
callee.ingredient_atoms.push_back(read_memory(*p));
2015-03-15 00:10:33 +00:00
}
rr.calls.push(callee);
continue; // not done with caller; don't increment pc
}
:(scenario "next_ingredient")
recipe main [
f 2:literal
]
recipe f [
12:integer <- next_ingredient
13:integer <- add 1:literal, 12:integer
]
+run: instruction f/1
+mem: location 12 is 2
+mem: storing in location 13
:(before "End Globals")
const int NEXT_INGREDIENT = 22;
:(before "End Primitive Recipe Numbers")
Recipe_number["next_ingredient"] = NEXT_INGREDIENT;
assert(Next_recipe_number == NEXT_INGREDIENT);
Next_recipe_number++;
:(before "End Primitive Recipe Implementations")
case NEXT_INGREDIENT: {
2015-03-15 05:25:06 +00:00
if (rr.calls.top().next_ingredient_to_process < rr.calls.top().ingredient_atoms.size()) {
trace("run") << "product 0 is "
2015-03-15 05:25:06 +00:00
<< rr.calls.top().ingredient_atoms[rr.calls.top().next_ingredient_to_process][0];
write_memory(instructions[pc].products[0],
2015-03-15 05:25:06 +00:00
rr.calls.top().ingredient_atoms[rr.calls.top().next_ingredient_to_process]);
++rr.calls.top().next_ingredient_to_process;
}
break;
}
2015-03-14 08:09:20 +00:00
:(scenario "reply")
recipe main [
3:integer, 4:integer <- f 2:literal
]
recipe f [
12:integer <- next_ingredient
13:integer <- add 1:literal, 12:integer
reply 12:integer, 13:integer
]
+run: instruction main/0
+run: result 0 is 1[2...]
+mem: storing in location 3
+run: result 1 is 1[3...]
+mem: storing in location 4
:(before "End Globals")
const int REPLY = 23;
:(before "End Primitive Recipe Numbers")
Recipe_number["reply"] = REPLY;
assert(Next_recipe_number == REPLY);
Next_recipe_number++;
:(before "End Primitive Recipe Implementations")
case REPLY: {
vector<vector<int> > callee_results;
for (size_t i = 0; i < instructions[pc].ingredients.size(); ++i) {
callee_results.push_back(read_memory(instructions[pc].ingredients[i]));
}
rr.calls.pop();
2015-03-15 02:21:51 +00:00
size_t& caller_pc = rr.calls.top().pc;
2015-03-15 05:33:42 +00:00
instruction& caller_instruction = Recipe[rr.calls.top().running_recipe].steps[caller_pc];
assert(caller_instruction.products.size() <= callee_results.size());
for (size_t i = 0; i < caller_instruction.products.size(); ++i) {
2015-03-14 08:09:20 +00:00
trace("run") << "result " << i << " is " << callee_results[i].size() << "[" << callee_results[i][0] << "...]";
2015-03-15 05:33:42 +00:00
write_memory(caller_instruction.products[i], callee_results[i]);
2015-03-14 08:09:20 +00:00
}
2015-03-15 02:21:51 +00:00
++caller_pc;
2015-03-14 08:09:20 +00:00
break;
}