mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

about summary refs log tree commit diff stats

path: root/mu.md

	Commit message (Expand)	Author	Age	Files	Lines
*	7292 - mu.subx: loosen copy-byte checks a bit	Kartik Agaram	2020-11-27	1	-3/+3
*	7286 - mu.subx: isolate bytes from previous values	Kartik Agaram	2020-11-27	1	-1/+2
*	7270	Kartik Agaram	2020-11-21	1	-5/+5
*	7261 - mu.subx: array bounds-checking done	Kartik Agaram	2020-11-17	1	-1/+1
*	7251	Kartik Agaram	2020-11-16	1	-46/+49
*	7250	Kartik Agaram	2020-11-16	1	-19/+11
*	7247	Kartik Agaram	2020-11-15	1	-9/+60
*	7152 - 'return' instruction	Kartik Agaram	2020-11-01	1	-0/+4
*	7028	Kartik Agaram	2020-10-14	1	-4/+11
*	7027	Kartik Agaram	2020-10-14	1	-2/+8
*	7026	Kartik Agaram	2020-10-14	1	-1/+5
*	7024	Kartik Agaram	2020-10-14	1	-35/+64
*	7023	Kartik Agaram	2020-10-14	1	-2/+2
*	7022	Kartik Agaram	2020-10-14	1	-2/+1
*	6957	Kartik Agaram	2020-10-05	1	-0/+4
*	6944	Kartik Agaram	2020-10-04	1	-0/+3
*	6941 - detective story for the day	Kartik Agaram	2020-10-03	1	-0/+5
*	6939	Kartik Agaram	2020-10-03	1	-0/+6
*	6915 - a new family of Mu branch instructions	Kartik Agaram	2020-09-30	1	-0/+9
*	6897	Kartik Agaram	2020-09-29	1	-0/+7
*	6896	Kartik Agaram	2020-09-28	1	-5/+90
*	6657	Kartik Agaram	2020-07-16	1	-5/+6
*	6648 - bit-shift instructions in Mu	Kartik Agaram	2020-07-14	1	-0/+7
*	6645 - heap allocations in Mu	Kartik Agaram	2020-07-13	1	-0/+16
*	6642	Kartik Agaram	2020-07-12	1	-10/+10
*	6640	Kartik Agaram	2020-07-12	1	-194/+194
*	6621	Kartik Agaram	2020-07-06	1	-0/+5
*	6620	Kartik Agaram	2020-07-06	1	-1/+1
*	6619	Kartik Agaram	2020-07-06	1	-1/+1
*	6618 - new docs	Kartik Agaram	2020-07-06	1	-0/+456

om which it will be ready to //: run again when a specific memory location changes its value. This is mu's //: basic technique for orchestrating the order in which different routines //: operate. :(scenario wait_for_location) recipe f1 [ 1:integer <- copy 0:literal start-running f2:recipe wait-for-location 1:integer # now wait for f2 to run and modify location 1 before using its value 2:integer <- copy 1:integer ] recipe f2 [ 1:integer <- copy 34:literal ] # if we got the synchronization wrong we'd be storing 0 in location 2 +mem: storing 34 in location 2 //: define the new state that all routines can be in :(before "End routine States") WAITING, :(before "End routine Fields") // only if state == WAITING index_t waiting_on_location; double old_value_of_waiting_location; :(before "End routine Constructor") waiting_on_location = old_value_of_waiting_location = 0; //: primitive recipe to put routines in that state :(before "End Primitive Recipe Declarations") WAIT_FOR_LOCATION, :(before "End Primitive Recipe Numbers") Recipe_number["wait-for-location"] = WAIT_FOR_LOCATION; :(before "End Primitive Recipe Implementations") case WAIT_FOR_LOCATION: { reagent loc = canonize(current_instruction().ingredients.at(0)); Current_routine->state = WAITING; Current_routine->waiting_on_location = loc.value; Current_routine->old_value_of_waiting_location = value(Memory[loc.value]); trace("run") << "waiting for location " << loc.value << " to change from " << value(Memory[loc.value]); //? trace("schedule") << Current_routine->id << ": waiting for location " << loc.value << " to change from " << value(Memory[loc.value]); //? 2 break; } //: scheduler tweak to get routines out of that state :(before "End Scheduler State Transitions") for (index_t i = 0; i < Routines.size(); ++i) { //? trace("schedule") << "wake up loop 1: routine " << Routines.at(i)->id << " has state " << Routines.at(i)->state; //? 1 if (Routines.at(i)->state != WAITING) continue; //? trace("schedule") << "waiting on location: " << Routines.at(i)->waiting_on_location; //? 1 //? if (Routines.at(i)->waiting_on_location) //? 2 //? trace("schedule") << "checking routine " << Routines.at(i)->id << " waiting on location " //? 2 //? << Routines.at(i)->waiting_on_location << ": " << value(Memory[Routines.at(i)->waiting_on_location]) << " vs " << Routines.at(i)->old_value_of_waiting_location; //? 2 if (Routines.at(i)->waiting_on_location && value(Memory[Routines.at(i)->waiting_on_location]) != Routines.at(i)->old_value_of_waiting_location) { trace("schedule") << "waking up routine\n"; Routines.at(i)->state = RUNNING; Routines.at(i)->waiting_on_location = Routines.at(i)->old_value_of_waiting_location = 0; } } //: also allow waiting on a routine to stop running :(scenario wait_for_routine) recipe f1 [ 1:integer <- copy 0:literal 12:integer/routine <- start-running f2:recipe wait-for-routine 12:integer/routine # now wait for f2 to run and modify location 1 before using its value 3:integer <- copy 1:integer ] recipe f2 [ 1:integer <- copy 34:literal ] +schedule: f1 +run: waiting for routine 2 +schedule: f2 +schedule: waking up routine 1 +schedule: f1 # if we got the synchronization wrong we'd be storing 0 in location 3 +mem: storing 34 in location 3 :(before "End routine Fields") // only if state == WAITING index_t waiting_on_routine; :(before "End routine Constructor") waiting_on_routine = 0; :(before "End Primitive Recipe Declarations") WAIT_FOR_ROUTINE, :(before "End Primitive Recipe Numbers") Recipe_number["wait-for-routine"] = WAIT_FOR_ROUTINE; :(before "End Primitive Recipe Implementations") case WAIT_FOR_ROUTINE: { Current_routine->state = WAITING; assert(ingredients.at(0).size() == 1); // scalar Current_routine->waiting_on_routine = ingredients.at(0).at(0); trace("run") << "waiting for routine " << ingredients.at(0).at(0); break; } :(before "End Scheduler State Transitions") // Wake up any routines waiting for other routines to go to sleep. // Important: this must come after the scheduler loop above giving routines // waiting for locations to change a chance to wake up. for (index_t i = 0; i < Routines.size(); ++i) { if (Routines.at(i)->state != WAITING) continue; if (!Routines.at(i)->waiting_on_routine) continue; index_t id = Routines.at(i)->waiting_on_routine; assert(id != Routines.at(i)->id); for (index_t j = 0; j < Routines.size(); ++j) { if (Routines.at(j)->id == id && Routines.at(j)->state != RUNNING) { trace("schedule") << "waking up routine " << Routines.at(i)->id; Routines.at(i)->state = RUNNING; Routines.at(i)->waiting_on_routine = 0; } } } :(before "End Primitive Recipe Declarations") SWITCH, :(before "End Primitive Recipe Numbers") Recipe_number["switch"] = SWITCH; :(before "End Primitive Recipe Implementations") case SWITCH: { index_t id = some_other_running_routine(); if (id) { assert(id != Current_routine->id); //? cerr << "waiting on " << id << " from " << Current_routine->id << '\n'; //? 1 Current_routine->state = WAITING; Current_routine->waiting_on_routine = id; } break; } :(code) index_t some_other_running_routine() { for (index_t i = 0; i < Routines.size(); ++i) { if (i == Current_routine_index) continue; assert(Routines.at(i) != Current_routine); assert(Routines.at(i)->id != Current_routine->id); if (Routines.at(i)->state == RUNNING) return Routines.at(i)->id; } return 0; }