about summary refs log blame commit diff stats
path: root/doc/pydoc/ranger.container.history.html
blob: 68fe9cfa0cbeef408b05ce18a3eeabd8cef49185 (plain) (tree) 
f07bb12f ^



































































































4c13e1f2 ^

f07bb12f ^




































1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

100

101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136



































































































                                                                                                                                                                                                                                                               
                                                                                                                                                                                                                                                                                                                                 



































                                                                                                                                                                                                                                                     
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><title>Python: module ranger.container.history</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head><body bgcolor="#f0f0f8">

<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="heading">
<tr bgcolor="#7799ee">
<td valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial">&nbsp;<br><big><big><strong><a href="ranger.html"><font color="#ffffff">ranger</font></a>.<a href="ranger.container.html"><font color="#ffffff">container</font></a>.history</strong></big></big></font></td
><td align=right valign=bottom
><font color="#ffffff" face="helvetica, arial"><a href=".">index</a><br><a href="file:/home/hut/work/ranger/ranger/container/history.py">/home/hut/work/ranger/ranger/container/history.py</a></font></td></tr></table>
    <p></p>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ee77aa">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Classes</strong></big></font></td></tr>
    
<tr><td bgcolor="#ee77aa"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><dl>
<dt><font face="helvetica, arial"><a href="builtins.html#Exception">builtins.Exception</a>(<a href="builtins.html#BaseException">builtins.BaseException</a>)
</font></dt><dd>
<dl>
<dt><font face="helvetica, arial"><a href="ranger.container.history.html#HistoryEmptyException">HistoryEmptyException</a>
</font></dt></dl>
</dd>
<dt><font face="helvetica, arial"><a href="builtins.html#object">builtins.object</a>
</font></dt><dd>
<dl>
<dt><font face="helvetica, arial"><a href="ranger.container.history.html#History">History</a>
</font></dt></dl>
</dd>
</dl>
 <p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ffc8d8">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#000000" face="helvetica, arial"><a name="History">class <strong>History</strong></a>(<a href="builtins.html#object">builtins.object</a>)</font></td></tr>
    
<tr><td bgcolor="#ffc8d8"><tt>&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%">Methods defined here:<br>
<dl><dt><a name="History-__init__"><strong>__init__</strong></a>(self, maxlen<font color="#909090">=None</font>)</dt></dl>

<dl><dt><a name="History-__iter__"><strong>__iter__</strong></a>(self)</dt></dl>

<dl><dt><a name="History-__len__"><strong>__len__</strong></a>(self)</dt></dl>

<dl><dt><a name="History-add"><strong>add</strong></a>(self, item)</dt></dl>

<dl><dt><a name="History-back"><strong>back</strong></a>(self)</dt></dl>

<dl><dt><a name="History-bottom"><strong>bottom</strong></a>(self)</dt></dl>

<dl><dt><a name="History-current"><strong>current</strong></a>(self)</dt></dl>

<dl><dt><a name="History-fast_forward"><strong>fast_forward</strong></a>(self)</dt></dl>

<dl><dt><a name="History-forward"><strong>forward</strong></a>(self)</dt></dl>

<dl><dt><a name="History-modify"><strong>modify</strong></a>(self, item)</dt></dl>

<dl><dt><a name="History-move"><strong>move</strong></a>(self, n)</dt></dl>

<dl><dt><a name="History-next"><strong>next</strong></a>(self)</dt></dl>

<dl><dt><a name="History-top"><strong>top</strong></a>(self)</dt></dl>

<hr>
Data descriptors defined here:<br>
<dl><dt><strong>__dict__</strong></dt>
<dd><tt>dictionary&nbsp;for&nbsp;instance&nbsp;variables&nbsp;(if&nbsp;defined)</tt></dd>
</dl>
<dl><dt><strong>__weakref__</strong></dt>
<dd><tt>list&nbsp;of&nbsp;weak&nbsp;references&nbsp;to&nbsp;the&nbsp;object&nbsp;(if&nbsp;defined)</tt></dd>
</dl>
</td></tr></table> <p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ffc8d8">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#000000" face="helvetica, arial"><a name="HistoryEmptyException">class <strong>HistoryEmptyException</strong></a>(<a href="builtins.html#Exception">builtins.Exception</a>)</font></td></tr>
    
<tr><td bgcolor="#ffc8d8"><tt>&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><dl><dt>Method resolution order:</dt>
<dd><a href="ranger.container.history.html#HistoryEmptyException">HistoryEmptyException</a></dd>
<dd><a href="builtins.html#Exception">builtins.Exception</a></dd>
<dd><a href="builtins.html#BaseException">builtins.BaseException</a></dd>
<dd><a href="builtins.html#object">builtins.object</a></dd>
</dl>
<hr>
Data descriptors defined here:<br>
<dl><dt><strong>__weakref__</strong></dt>
<dd><tt>list&nbsp;of&nbsp;weak&nbsp;references&nbsp;to&nbsp;the&nbsp;object&nbsp;(if&nbsp;defined)</tt></dd>
</dl>
<hr>
Methods inherited from <a href="builtins.html#Exception">builtins.Exception</a>:<br>
<dl><dt><a name="HistoryEmptyException-__init__"><strong>__init__</strong></a>(...)</dt><dd><tt>x.<a href="#HistoryEmptyException-__init__">__init__</a>(...)&nbsp;initializes&nbsp;x;&nbsp;see&nbsp;x.__class__.__doc__&nbsp;for&nbsp;signature</tt></dd></dl>

<hr>
Data and other attributes inherited from <a href="builtins.html#Exception">builtins.Exception</a>:<br>
<dl><dt><strong>__new__</strong> = &lt;built-in method __new__ of type object at 0x7f20a8d46120&gt;<dd><tt>T.<a href="#HistoryEmptyException-__new__">__new__</a>(S,&nbsp;...)&nbsp;-&gt;&nbsp;a&nbsp;new&nbsp;<a href="builtins.html#object">object</a>&nbsp;with&nbsp;type&nbsp;S,&nbsp;a&nbsp;subtype&nbsp;of&nbsp;T</tt></dl>

<hr>
Methods inherited from <a href="builtins.html#BaseException">builtins.BaseException</a>:<br>
<dl><dt><a name="HistoryEmptyException-__delattr__"><strong>__delattr__</strong></a>(...)</dt><dd><tt>x.<a href="#HistoryEmptyException-__delattr__">__delattr__</a>('name')&nbsp;&lt;==&gt;&nbsp;del&nbsp;x.name</tt></dd></dl>

<dl><dt><a name="HistoryEmptyException-__getattribute__"><strong>__getattribute__</strong></a>(...)</dt><dd><tt>x.<a href="#HistoryEmptyException-__getattribute__">__getattribute__</a>('name')&nbsp;&lt;==&gt;&nbsp;x.name</tt></dd></dl>

<dl><dt><a name="HistoryEmptyException-__reduce__"><strong>__reduce__</strong></a>(...)</dt></dl>

<dl><dt><a name="HistoryEmptyException-__repr__"><strong>__repr__</strong></a>(...)</dt><dd><tt>x.<a href="#HistoryEmptyException-__repr__">__repr__</a>()&nbsp;&lt;==&gt;&nbsp;repr(x)</tt></dd></dl>

<dl><dt><a name="HistoryEmptyException-__setattr__"><strong>__setattr__</strong></a>(...)</dt><dd><tt>x.<a href="#HistoryEmptyException-__setattr__">__setattr__</a>('name',&nbsp;value)&nbsp;&lt;==&gt;&nbsp;x.name&nbsp;=&nbsp;value</tt></dd></dl>

<dl><dt><a name="HistoryEmptyException-__setstate__"><strong>__setstate__</strong></a>(...)</dt></dl>

<dl><dt><a name="HistoryEmptyException-__str__"><strong>__str__</strong></a>(...)</dt><dd><tt>x.<a href="#HistoryEmptyException-__str__">__str__</a>()&nbsp;&lt;==&gt;&nbsp;str(x)</tt></dd></dl>

<dl><dt><a name="HistoryEmptyException-with_traceback"><strong>with_traceback</strong></a>(...)</dt><dd><tt><a href="builtins.html#Exception">Exception</a>.<a href="#HistoryEmptyException-with_traceback">with_traceback</a>(tb)&nbsp;--<br>
set&nbsp;self.<strong>__traceback__</strong>&nbsp;to&nbsp;tb&nbsp;and&nbsp;return&nbsp;self.</tt></dd></dl>

<hr>
Data descriptors inherited from <a href="builtins.html#BaseException">builtins.BaseException</a>:<br>
<dl><dt><strong>__cause__</strong></dt>
<dd><tt>exception&nbsp;cause</tt></dd>
</dl>
<dl><dt><strong>__context__</strong></dt>
<dd><tt>exception&nbsp;context</tt></dd>
</dl>
<dl><dt><strong>__dict__</strong></dt>
</dl>
<dl><dt><strong>__traceback__</strong></dt>
</dl>
<dl><dt><strong>args</strong></dt>
</dl>
</td></tr></table></td></tr></table>
</body></html>
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-08-24 18:08:45 +0000
{ raise << maybe(get(Recipe, r).name) << "'get-location' expects exactly 2 ingredients in '" << to_original_string(inst) << "'\n" << end(); break; } reagent/*copy*/ base = inst.ingredients.at(0); if (!canonize_type(base)) break; if (!base.type) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'get-location' should be a container, but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } const type_tree* base_root_type = base.type->atom ? base.type : base.type->left; if (!base_root_type->atom || base_root_type->value == 0 || !contains_key(Type, base_root_type->value) || get(Type, base_root_type->value).kind != CONTAINER) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'get-location' should be a container, but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } type_ordinal base_type = base.type->value; const reagent& offset = inst.ingredients.at(1); if (!is_literal(offset) || !is_mu_scalar(offset)) { raise << maybe(get(Recipe, r).name) << "second ingredient of 'get-location' should have type 'offset', but got '" << inst.ingredients.at(1).original_string << "'\n" << end(); break; } int offset_value = 0; //: later layers will permit non-integer offsets if (is_integer(offset.name)) { offset_value = to_integer(offset.name); if (offset_value < 0 || offset_value >= SIZE(get(Type, base_type).elements)) { raise << maybe(get(Recipe, r).name) << "invalid offset " << offset_value << " for '" << get(Type, base_type).name << "'\n" << end(); break; } } else { offset_value = offset.value; } if (inst.products.empty()) break; if (!is_mu_location(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'get-location " << base.original_string << ", " << offset.original_string << "' should write to type location but '" << inst.products.at(0).name << "' has type '" << names_to_string_without_quotes(inst.products.at(0).type) << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case GET_LOCATION: { reagent/*copy*/ base = current_instruction().ingredients.at(0); canonize(base); int base_address = base.value; if (base_address == 0) { raise << maybe(current_recipe_name()) << "tried to access location 0 in '" << to_original_string(current_instruction()) << "'\n" << end(); break; } const type_tree* base_type = get_base_type(base.type); int offset = ingredients.at(1).at(0); if (offset < 0 || offset >= SIZE(get(Type, base_type->value).elements)) break; // copied from Check above int result = base_address; for (int i = 0; i < offset; ++i) result += size_of(element_type(base.type, i)); trace(Callstack_depth+1, "run") << "address to copy is " << result << end(); products.resize(1); products.at(0).push_back(result); break; } :(code) bool is_mu_location(reagent/*copy*/ x) { if (!canonize_type(x)) return false; if (!x.type) return false; if (!x.type->atom) return false; return x.type->value == get(Type_ordinal, "location"); } void test_get_location_out_of_bounds() { Hide_errors = true; run( "def main [\n" " 12:num <- copy 34\n" " 13:num <- copy 35\n" " 14:num <- copy 36\n" " get-location 12:point-number/raw, 2:offset\n" // point-number occupies 3 locations but has only 2 fields; out of bounds "]\n" ); CHECK_TRACE_CONTENTS( "error: main: invalid offset 2 for 'point-number'\n" ); } void test_get_location_out_of_bounds_2() { Hide_errors = true; run( "def main [\n" " 12:num <- copy 34\n" " 13:num <- copy 35\n" " 14:num <- copy 36\n" " get-location 12:point-number/raw, -1:offset\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: main: invalid offset -1 for 'point-number'\n" ); } void test_get_location_product_type_mismatch() { Hide_errors = true; run( "container boolbool [\n" " x:bool\n" " y:bool\n" "]\n" "def main [\n" " 12:bool <- copy 1\n" " 13:bool <- copy 0\n" " 15:bool <- get-location 12:boolbool, 1:offset\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: main: 'get-location 12:boolbool, 1:offset' should write to type location but '15' has type 'boolean'\n" ); } void test_get_location_indirect() { // 'get-location' can read from container address run( "def main [\n" " 1:num/alloc-id, 2:num <- copy 0, 10\n" " 10:num/alloc-id, 11:num/x, 12:num/y <- copy 0, 34, 35\n" " 20:location <- get-location 1:&:point/lookup, 0:offset\n" "]\n" ); CHECK_TRACE_CONTENTS( "mem: storing 11 in location 20\n" ); } void test_get_location_indirect_2() { run( "def main [\n" " 1:num/alloc-id, 2:num <- copy 0, 10\n" " 10:num/alloc-id, 11:num/x, 12:num/y <- copy 0, 34, 35\n" " 4:num/alloc-id, 5:num <- copy 0, 20\n" " 4:&:location/lookup <- get-location 1:&:point/lookup, 0:offset\n" "]\n" ); CHECK_TRACE_CONTENTS( "mem: storing 11 in location 21\n" ); } //: allow waiting on a routine to complete void test_wait_for_routine() { run( "def f1 [\n" // add a few routines to run " 1:num/routine <- start-running f2\n" " 2:num/routine <- start-running f3\n" " wait-for-routine 1:num/routine\n" // now wait for f2 to *complete* and modify location 13 before using its value " 20:num <- copy 13:num\n" "]\n" "def f2 [\n" " 10:num <- copy 0\n" // just padding " switch\n" // simulate a block; routine f1 shouldn't restart at this point " 13:num <- copy 34\n" "]\n" "def f3 [\n" // padding routine just to help simulate the block in f2 using 'switch' " 11:num <- copy 0\n" " 12:num <- copy 0\n" "]\n" ); CHECK_TRACE_CONTENTS( "schedule: f1\n" "run: waiting for routine 2\n" "schedule: f2\n" "schedule: f3\n" "schedule: f2\n" "schedule: waking up routine 1\n" "schedule: f1\n" // if we got the synchronization wrong we'd be storing 0 in location 20 "mem: storing 34 in location 20\n" ); } :(before "End routine Fields") // only if state == WAITING int waiting_on_routine; :(before "End routine Constructor") waiting_on_routine = 0; :(before "End Primitive Recipe Declarations") WAIT_FOR_ROUTINE, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "wait-for-routine", WAIT_FOR_ROUTINE); :(before "End Primitive Recipe Checks") case WAIT_FOR_ROUTINE: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'wait-for-routine' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'wait-for-routine' should be a routine id generated by 'start-running', but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case WAIT_FOR_ROUTINE: { if (ingredients.at(0).at(0) == Current_routine->id) { raise << maybe(current_recipe_name()) << "routine can't wait for itself! '" << to_original_string(current_instruction()) << "'\n" << end(); break; } Current_routine->state = WAITING; Current_routine->waiting_on_routine = ingredients.at(0).at(0); trace(Callstack_depth+1, "run") << "waiting for routine " << ingredients.at(0).at(0) << end(); break; } :(before "End Scheduler State Transitions") // Wake up any routines waiting for other routines to complete. // Important: this must come after the scheduler loop above giving routines // waiting for locations to change a chance to wake up. for (int i = 0; i < SIZE(Routines); ++i) { if (Routines.at(i)->state != WAITING) continue; routine* waiter = Routines.at(i); if (!waiter->waiting_on_routine) continue; int id = waiter->waiting_on_routine; assert(id != waiter->id); // routine can't wait on itself for (int j = 0; j < SIZE(Routines); ++j) { const routine* waitee = Routines.at(j); if (waitee->id == id && waitee->state != RUNNING && waitee->state != WAITING) { // routine is COMPLETED or DISCONTINUED trace(100, "schedule") << "waking up routine " << waiter->id << end(); waiter->state = RUNNING; waiter->waiting_on_routine = 0; } } } //: yield voluntarily to let some other routine run :(before "End Primitive Recipe Declarations") SWITCH, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "switch", SWITCH); :(before "End Primitive Recipe Checks") case SWITCH: { break; } :(before "End Primitive Recipe Implementations") case SWITCH: { ++current_step_index(); goto stop_running_current_routine; } :(code) void test_switch_preempts_current_routine() { run( "def f1 [\n" " start-running f2\n" " 1:num <- copy 34\n" " switch\n" " 3:num <- copy 36\n" "]\n" "def f2 [\n" " 2:num <- copy 35\n" "]\n" ); CHECK_TRACE_CONTENTS( "mem: storing 34 in location 1\n" // context switch "mem: storing 35 in location 2\n" // back to original thread "mem: storing 36 in location 3\n" ); } //:: helpers for manipulating routines in tests //: //: Managing arbitrary scenarios requires the ability to: //: a) check if a routine is blocked //: b) restart a blocked routine ('restart') //: //: A routine is blocked either if it's waiting or if it explicitly signals //: that it's blocked (even as it periodically wakes up and polls for some //: event). //: //: Signalling blockedness might well be a huge hack. But Mu doesn't have Unix //: signals to avoid polling with, because signals are also pretty hacky. :(before "End routine Fields") bool blocked; :(before "End routine Constructor") blocked = false; :(before "End Primitive Recipe Declarations") CURRENT_ROUTINE_IS_BLOCKED, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "current-routine-is-blocked", CURRENT_ROUTINE_IS_BLOCKED); :(before "End Primitive Recipe Checks") case CURRENT_ROUTINE_IS_BLOCKED: { if (!inst.ingredients.empty()) { raise << maybe(get(Recipe, r).name) << "'current-routine-is-blocked' should have no ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case CURRENT_ROUTINE_IS_BLOCKED: { Current_routine->blocked = true; break; } :(before "End Primitive Recipe Declarations") CURRENT_ROUTINE_IS_UNBLOCKED, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "current-routine-is-unblocked", CURRENT_ROUTINE_IS_UNBLOCKED); :(before "End Primitive Recipe Checks") case CURRENT_ROUTINE_IS_UNBLOCKED: { if (!inst.ingredients.empty()) { raise << maybe(get(Recipe, r).name) << "'current-routine-is-unblocked' should have no ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case CURRENT_ROUTINE_IS_UNBLOCKED: { Current_routine->blocked = false; break; } //: also allow waiting on a routine to block //: (just for tests; use wait_for_routine above wherever possible) :(code) void test_wait_for_routine_to_block() { run( "def f1 [\n" " 1:num/routine <- start-running f2\n" " wait-for-routine-to-block 1:num/routine\n" // now wait for f2 to run and modify location 10 before using its value " 11:num <- copy 10:num\n" "]\n" "def f2 [\n" " 10:num <- copy 34\n" "]\n" ); CHECK_TRACE_CONTENTS( "schedule: f1\n" "run: waiting for routine 2 to block\n" "schedule: f2\n" "schedule: waking up routine 1 because routine 2 is blocked\n" "schedule: f1\n" // if we got the synchronization wrong we'd be storing 0 in location 11 "mem: storing 34 in location 11\n" ); } :(before "End routine Fields") // only if state == WAITING int waiting_on_routine_to_block; :(before "End routine Constructor") waiting_on_routine_to_block = 0; :(before "End Primitive Recipe Declarations") WAIT_FOR_ROUTINE_TO_BLOCK, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "wait-for-routine-to-block", WAIT_FOR_ROUTINE_TO_BLOCK); :(before "End Primitive Recipe Checks") case WAIT_FOR_ROUTINE_TO_BLOCK: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'wait-for-routine-to-block' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'wait-for-routine-to-block' should be a routine id generated by 'start-running', but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case WAIT_FOR_ROUTINE_TO_BLOCK: { if (ingredients.at(0).at(0) == Current_routine->id) { raise << maybe(current_recipe_name()) << "routine can't wait for itself! '" << to_original_string(current_instruction()) << "'\n" << end(); break; } Current_routine->state = WAITING; Current_routine->waiting_on_routine_to_block = ingredients.at(0).at(0); trace(Callstack_depth+1, "run") << "waiting for routine " << ingredients.at(0).at(0) << " to block" << end(); break; } :(before "End Scheduler State Transitions") // Wake up any routines waiting for other routines to stop running. for (int i = 0; i < SIZE(Routines); ++i) { if (Routines.at(i)->state != WAITING) continue; routine* waiter = Routines.at(i); if (!waiter->waiting_on_routine_to_block) continue; int id = waiter->waiting_on_routine_to_block; assert(id != waiter->id); // routine can't wait on itself for (int j = 0; j < SIZE(Routines); ++j) { const routine* waitee = Routines.at(j); if (waitee->id != id) continue; if (waitee->state != RUNNING || waitee->blocked) { trace(100, "schedule") << "waking up routine " << waiter->id << " because routine " << waitee->id << " is blocked" << end(); waiter->state = RUNNING; waiter->waiting_on_routine_to_block = 0; } } } //: helper for restarting blocking routines in tests :(before "End Primitive Recipe Declarations") RESTART, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "restart", RESTART); :(before "End Primitive Recipe Checks") case RESTART: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'restart' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'restart' should be a routine id generated by 'start-running', but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case RESTART: { int id = ingredients.at(0).at(0); for (int i = 0; i < SIZE(Routines); ++i) { if (Routines.at(i)->id == id) { if (Routines.at(i)->state == WAITING) Routines.at(i)->state = RUNNING; Routines.at(i)->blocked = false; break; } } break; } :(code) void test_cannot_restart_completed_routine() { Scheduling_interval = 1; run( "def main [\n" " local-scope\n" " r:num/routine-id <- start-running f\n" " x:num <- copy 0\n" // wait for f to be scheduled // r is COMPLETED by this point " restart r\n" // should have no effect " x:num <- copy 0\n" // give f time to be scheduled (though it shouldn't be) "]\n" "def f [\n" " 1:num/raw <- copy 1\n" "]\n" ); // shouldn't crash } void test_restart_blocked_routine() { Scheduling_interval = 1; run( "def main [\n" " local-scope\n" " r:num/routine-id <- start-running f\n" " wait-for-routine-to-block r\n" // get past the block in f below " restart r\n" " wait-for-routine-to-block r\n" // should run f to completion "]\n" // function with one block "def f [\n" " current-routine-is-blocked\n" // 8 instructions of padding, many more than 'main' above " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" " 1:num <- add 1:num, 1\n" "]\n" ); // make sure all of f ran CHECK_TRACE_CONTENTS( "mem: storing 8 in location 1\n" ); }
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-08-24 18:08:42 +0000