2015-04-25 04:39:09 +00:00
|
|
|
//: Run a second routine concurrently using fork, without any guarantees on
|
|
|
|
//: how the operations in each are interleaved with each other.
|
2015-04-24 03:42:17 +00:00
|
|
|
|
2015-04-25 07:00:49 +00:00
|
|
|
:(scenario scheduler)
|
2015-04-25 04:39:09 +00:00
|
|
|
recipe f1 [
|
2015-05-01 22:25:47 +00:00
|
|
|
start-running f2:recipe
|
2015-04-25 04:39:09 +00:00
|
|
|
1:integer <- copy 3:literal
|
|
|
|
]
|
|
|
|
recipe f2 [
|
|
|
|
2:integer <- copy 4:literal
|
|
|
|
]
|
|
|
|
+schedule: f1
|
|
|
|
+schedule: f2
|
2015-04-24 03:42:17 +00:00
|
|
|
|
2015-04-25 04:39:09 +00:00
|
|
|
//: first, add a deadline to run(routine)
|
|
|
|
//: these changes are ugly and brittle; just close your nose and get through the next few lines
|
2015-04-25 02:58:38 +00:00
|
|
|
:(replace "void run_current_routine()")
|
|
|
|
void run_current_routine(size_t time_slice)
|
2015-04-25 03:00:56 +00:00
|
|
|
:(replace "while (!Current_routine->completed())" following "void run_current_routine(size_t time_slice)")
|
2015-04-24 03:42:17 +00:00
|
|
|
size_t ninstrs = 0;
|
2015-04-27 08:42:07 +00:00
|
|
|
while (Current_routine->state == RUNNING && ninstrs < time_slice)
|
2015-04-24 03:42:17 +00:00
|
|
|
:(after "Running One Instruction")
|
|
|
|
ninstrs++;
|
2015-04-25 04:39:09 +00:00
|
|
|
|
|
|
|
//: now the rest of the scheduler is clean
|
2015-04-27 05:44:47 +00:00
|
|
|
|
|
|
|
:(before "struct routine")
|
|
|
|
enum routine_state {
|
|
|
|
RUNNING,
|
|
|
|
COMPLETED,
|
2015-04-27 08:42:07 +00:00
|
|
|
// End routine States
|
2015-04-27 05:44:47 +00:00
|
|
|
};
|
|
|
|
:(before "End routine Fields")
|
|
|
|
enum routine_state state;
|
|
|
|
:(before "End routine Constructor")
|
|
|
|
state = RUNNING;
|
|
|
|
|
2015-04-25 04:39:09 +00:00
|
|
|
:(before "End Globals")
|
2015-04-27 05:44:47 +00:00
|
|
|
vector<routine*> Routines;
|
2015-05-04 18:02:56 +00:00
|
|
|
index_t Current_routine_index = 0;
|
2015-04-25 04:39:09 +00:00
|
|
|
size_t Scheduling_interval = 500;
|
2015-04-25 07:00:49 +00:00
|
|
|
:(before "End Setup")
|
|
|
|
Scheduling_interval = 500;
|
2015-04-25 04:39:09 +00:00
|
|
|
:(replace{} "void run(recipe_number r)")
|
|
|
|
void run(recipe_number r) {
|
2015-04-27 05:44:47 +00:00
|
|
|
Routines.push_back(new routine(r));
|
|
|
|
Current_routine_index = 0, Current_routine = Routines[0];
|
|
|
|
while (!all_routines_done()) {
|
2015-05-02 18:49:11 +00:00
|
|
|
skip_to_next_routine();
|
|
|
|
//? cout << "scheduler: " << Current_routine_index << '\n'; //? 1
|
2015-04-27 05:44:47 +00:00
|
|
|
assert(Current_routine);
|
|
|
|
assert(Current_routine->state == RUNNING);
|
2015-04-25 04:39:09 +00:00
|
|
|
trace("schedule") << current_recipe_name();
|
|
|
|
run_current_routine(Scheduling_interval);
|
2015-04-26 05:30:20 +00:00
|
|
|
if (Current_routine->completed())
|
2015-04-27 05:44:47 +00:00
|
|
|
Current_routine->state = COMPLETED;
|
|
|
|
// End Scheduler State Transitions
|
|
|
|
}
|
2015-05-02 18:49:11 +00:00
|
|
|
//? cout << "done with run\n"; //? 1
|
2015-04-27 05:44:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
:(code)
|
|
|
|
bool all_routines_done() {
|
2015-05-04 18:02:56 +00:00
|
|
|
for (index_t i = 0; i < Routines.size(); ++i) {
|
2015-05-02 18:49:11 +00:00
|
|
|
//? cout << "routine " << i << ' ' << Routines[i]->state << '\n'; //? 1
|
2015-04-27 05:44:47 +00:00
|
|
|
if (Routines[i]->state == RUNNING) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// skip Current_routine_index past non-RUNNING routines
|
|
|
|
void skip_to_next_routine() {
|
|
|
|
assert(!Routines.empty());
|
|
|
|
assert(Current_routine_index < Routines.size());
|
2015-05-04 18:02:56 +00:00
|
|
|
for (index_t i = (Current_routine_index+1)%Routines.size(); i != Current_routine_index; i = (i+1)%Routines.size()) {
|
2015-04-27 05:44:47 +00:00
|
|
|
if (Routines[i]->state == RUNNING) {
|
2015-05-02 18:49:11 +00:00
|
|
|
//? cout << "switching to " << i << '\n'; //? 1
|
2015-04-27 05:44:47 +00:00
|
|
|
Current_routine_index = i;
|
|
|
|
Current_routine = Routines[i];
|
|
|
|
return;
|
|
|
|
}
|
2015-04-25 04:39:09 +00:00
|
|
|
}
|
2015-05-02 18:49:11 +00:00
|
|
|
//? cout << "all done\n"; //? 1
|
2015-04-25 04:39:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
:(before "End Teardown")
|
2015-05-04 18:02:56 +00:00
|
|
|
for (index_t i = 0; i < Routines.size(); ++i)
|
2015-04-27 05:44:47 +00:00
|
|
|
delete Routines[i];
|
|
|
|
Routines.clear();
|
2015-04-25 04:39:09 +00:00
|
|
|
|
2015-05-06 00:41:10 +00:00
|
|
|
//:: To schedule new routines to run, call 'start-scheduling'.
|
|
|
|
|
|
|
|
//: 'start-scheduling' will return a unique id for the routine that was
|
|
|
|
//: created.
|
|
|
|
:(before "End routine Fields")
|
|
|
|
index_t id;
|
|
|
|
:(before "End Globals")
|
|
|
|
index_t Next_routine_id = 1;
|
|
|
|
:(before "End Setup")
|
|
|
|
Next_routine_id = 1;
|
|
|
|
:(before "End routine Constructor")
|
|
|
|
id = Next_routine_id;
|
|
|
|
Next_routine_id++;
|
|
|
|
|
2015-04-25 04:39:09 +00:00
|
|
|
:(before "End Primitive Recipe Declarations")
|
2015-05-01 22:25:47 +00:00
|
|
|
START_RUNNING,
|
2015-04-25 04:39:09 +00:00
|
|
|
:(before "End Primitive Recipe Numbers")
|
2015-05-01 22:25:47 +00:00
|
|
|
Recipe_number["start-running"] = START_RUNNING;
|
2015-04-25 04:39:09 +00:00
|
|
|
:(before "End Primitive Recipe Implementations")
|
2015-05-01 22:25:47 +00:00
|
|
|
case START_RUNNING: {
|
2015-04-25 04:39:09 +00:00
|
|
|
trace("run") << "ingredient 0 is " << current_instruction().ingredients[0].name;
|
|
|
|
assert(!current_instruction().ingredients[0].initialized);
|
2015-05-06 00:41:10 +00:00
|
|
|
routine* new_routine = new routine(Recipe_number[current_instruction().ingredients[0].name]);
|
2015-05-06 02:39:20 +00:00
|
|
|
// populate ingredients
|
|
|
|
for (index_t i = 1; i < current_instruction().ingredients.size(); ++i)
|
|
|
|
new_routine->calls.top().ingredient_atoms.push_back(read_memory(current_instruction().ingredients[i]));
|
2015-05-06 00:41:10 +00:00
|
|
|
Routines.push_back(new_routine);
|
|
|
|
if (!current_instruction().products.empty()) {
|
|
|
|
vector<long long int> result;
|
|
|
|
result.push_back(new_routine->id);
|
|
|
|
write_memory(current_instruction().products[0], result);
|
|
|
|
}
|
2015-04-25 04:39:09 +00:00
|
|
|
break;
|
|
|
|
}
|
2015-04-25 07:00:49 +00:00
|
|
|
|
2015-05-02 18:49:11 +00:00
|
|
|
:(scenario scheduler_runs_single_routine)
|
|
|
|
% Scheduling_interval = 1;
|
|
|
|
recipe f1 [
|
|
|
|
1:integer <- copy 0:literal
|
|
|
|
2:integer <- copy 0:literal
|
|
|
|
]
|
|
|
|
+schedule: f1
|
|
|
|
+run: instruction f1/0
|
|
|
|
+schedule: f1
|
|
|
|
+run: instruction f1/1
|
|
|
|
|
2015-04-25 07:00:49 +00:00
|
|
|
:(scenario scheduler_interleaves_routines)
|
|
|
|
% Scheduling_interval = 1;
|
|
|
|
recipe f1 [
|
2015-05-01 22:25:47 +00:00
|
|
|
start-running f2:recipe
|
2015-04-25 07:00:49 +00:00
|
|
|
1:integer <- copy 0:literal
|
|
|
|
2:integer <- copy 0:literal
|
|
|
|
]
|
|
|
|
recipe f2 [
|
|
|
|
3:integer <- copy 4:literal
|
|
|
|
4:integer <- copy 4:literal
|
|
|
|
]
|
|
|
|
+schedule: f1
|
|
|
|
+run: instruction f1/0
|
|
|
|
+schedule: f2
|
|
|
|
+run: instruction f2/0
|
|
|
|
+schedule: f1
|
|
|
|
+run: instruction f1/1
|
|
|
|
+schedule: f2
|
|
|
|
+run: instruction f2/1
|
|
|
|
+schedule: f1
|
|
|
|
+run: instruction f1/2
|
2015-05-02 18:49:11 +00:00
|
|
|
|
2015-05-06 02:39:20 +00:00
|
|
|
:(scenario start_running_takes_args)
|
|
|
|
recipe f1 [
|
|
|
|
start-running f2:recipe, 3:literal
|
|
|
|
]
|
|
|
|
recipe f2 [
|
|
|
|
1:integer <- next-ingredient
|
|
|
|
2:integer <- add 1:integer, 1:literal
|
|
|
|
]
|
|
|
|
+mem: storing 4 in location 2
|
|
|
|
|
2015-05-06 00:41:10 +00:00
|
|
|
:(scenario start_running_returns_routine_id)
|
|
|
|
recipe f1 [
|
|
|
|
1:integer <- start-running f2:recipe
|
|
|
|
]
|
|
|
|
recipe f2 [
|
|
|
|
12:integer <- copy 44:literal
|
|
|
|
]
|
|
|
|
+mem: storing 2 in location 1
|
|
|
|
|
2015-05-02 18:49:11 +00:00
|
|
|
:(scenario scheduler_skips_completed_routines)
|
|
|
|
# this scenario will require some careful setup in escaped C++
|
|
|
|
# (straining our tangle capabilities to near-breaking point)
|
|
|
|
% recipe_number f1 = load("recipe f1 [\n1:integer <- copy 0:literal\n]").front();
|
|
|
|
% recipe_number f2 = load("recipe f2 [\n2:integer <- copy 0:literal\n]").front();
|
|
|
|
% Routines.push_back(new routine(f1)); // f1 meant to run
|
|
|
|
% Routines.push_back(new routine(f2));
|
|
|
|
% Routines.back()->state = COMPLETED; // f2 not meant to run
|
|
|
|
#? % Trace_stream->dump_layer = "all";
|
|
|
|
# must have at least one routine without escaping
|
|
|
|
recipe f3 [
|
|
|
|
3:integer <- copy 0:literal
|
|
|
|
]
|
|
|
|
# by interleaving '+' lines with '-' lines, we allow f1 and f3 to run in any order
|
|
|
|
+schedule: f1
|
|
|
|
+mem: storing 0 in location 1
|
|
|
|
-schedule: f2
|
|
|
|
-mem: storing 0 in location 2
|
|
|
|
+schedule: f3
|
|
|
|
+mem: storing 0 in location 3
|
|
|
|
|
|
|
|
:(scenario scheduler_starts_at_middle_of_routines)
|
|
|
|
% Routines.push_back(new routine(COPY));
|
|
|
|
% Routines.back()->state = COMPLETED;
|
|
|
|
recipe f1 [
|
|
|
|
1:integer <- copy 0:literal
|
|
|
|
2:integer <- copy 0:literal
|
|
|
|
]
|
|
|
|
+schedule: f1
|
|
|
|
-run: idle
|
2015-05-06 00:54:46 +00:00
|
|
|
|
|
|
|
//:: 'routine-state' can tell if a given routine id is running
|
|
|
|
|
|
|
|
:(scenario routine_state_test)
|
|
|
|
% Scheduling_interval = 2;
|
|
|
|
recipe f1 [
|
|
|
|
1:integer/child-id <- start-running f2:recipe
|
|
|
|
12:integer <- copy 0:literal # race condition since we don't care about location 12
|
|
|
|
# thanks to Scheduling_interval, f2's one instruction runs in between here and completes
|
|
|
|
2:integer/state <- routine-state 1:integer/child-id
|
|
|
|
]
|
|
|
|
recipe f2 [
|
|
|
|
12:integer <- copy 0:literal
|
|
|
|
# trying to run a second instruction marks routine as completed
|
|
|
|
]
|
|
|
|
# recipe f2 should be in state COMPLETED
|
|
|
|
+mem: storing 1 in location 2
|
|
|
|
|
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
ROUTINE_STATE,
|
|
|
|
:(before "End Primitive Recipe Numbers")
|
|
|
|
Recipe_number["routine-state"] = ROUTINE_STATE;
|
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case ROUTINE_STATE: {
|
|
|
|
vector<long long int> result;
|
|
|
|
index_t id = read_memory(current_instruction().ingredients[0])[0];
|
|
|
|
for (index_t i = 0; i < Routines.size(); ++i) {
|
|
|
|
if (Routines[i]->id == id) {
|
|
|
|
result.push_back(Routines[i]->state);
|
|
|
|
write_memory(current_instruction().products[0], result);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|