1
2
3
4
5
6 :(before "End Mu Types Initialization")
7 put(Type_abbreviations, "space", new_type_tree("address:array:location"));
8
9 put(Type_abbreviations, "scope", new_type_tree("address:array:location"));
10
11 :(scenario set_default_space)
12
13
14 def main [
15
16 10:num <- copy 0
17 11:num <- copy 5
18 default-space:space <- copy 10/unsafe
19 1:num <- copy 23
20 ]
21 +mem: storing 23 in location 13
22
23 :(scenario lookup_sidesteps_default_space)
24 def main [
25
26 2001:num <- copy 34
27
28 1000:num <- copy 0
29 1001:num <- copy 5
30
31 default-space:space <- copy 1000/unsafe
32 1:&:num <- copy 2000/unsafe
33 8:num/raw <- copy *1:&:num
34 ]
35 +mem: storing 34 in location 8
36
37
38 :(scenario convert_names_passes_default_space)
39 % Hide_errors = true;
40 def main [
41 default-space:num, x:num <- copy 0, 1
42 ]
43 +name: assign x 1
44 -name: assign default-space 1
45
46 :(before "End is_disqualified Special-cases")
47 if (x.name == "default-space")
48 x.initialized = true;
49 :(before "End is_special_name Special-cases")
50 if (s == "default-space") return true;
51
52
53 :(before "End call Fields")
54 int default_space;
55 :(before "End call Constructor")
56 default_space = 0;
57
58 :(before "End canonize(x) Special-cases")
59 absolutize(x);
60 :(code)
61 void absolutize(reagent& x) {
62 if (is_raw(x) || is_dummy(x)) return;
63 if (x.name == "default-space") return;
64 if (!x.initialized)
65 raise << to_original_string(current_instruction()) << ": reagent not initialized: '" << x.original_string << "'\n" << end();
66 x.set_value(address(x.value, space_base(x)));
67 x.properties.push_back(pair<string, string_tree*>("raw", NULL));
68 assert(is_raw(x));
69 }
70
71
72 int space_base(const reagent& x) {
73 return current_call().default_space ? (current_call().default_space+1) : 0;
74 }
75
76 int address(int offset, int base) {
77 assert(offset >= 0);
78 if (base == 0) return offset;
79 int size = get_or_insert(Memory, base);
80 if (offset >= size) {
81
82 raise << "location " << offset << " is out of bounds " << size << " at " << base << '\n' << end();
83 return 0;
84 }
85 return base + 1 + offset;
86 }
87
88
89
90 :(after "Begin Preprocess write_memory(x, data)")
91 if (x.name == "default-space") {
92 if (!scalar(data) || !is_space(x))
93 raise << maybe(current_recipe_name()) << "'default-space' should be of type address:array:location, but is " << to_string(x.type) << '\n' << end();
94 current_call().default_space = data.at(0);
95 return;
96 }
97 :(code)
98 bool is_space(const reagent& r) {
99 return is_address_of_array_of_numbers(r);
100 }
101
102 :(scenario get_default_space)
103 def main [
104 default-space:space <- copy 10/unsafe
105 1:space/raw <- copy default-space:space
106 ]
107 +mem: storing 10 in location 1
108
109 :(after "Begin Preprocess read_memory(x)")
110 if (x.name == "default-space") {
111 vector<double> result;
112 result.push_back(current_call().default_space);
113 return result;
114 }
115
116
117
118 :(scenario lookup_sidesteps_default_space_in_get)
119 def main [
120
121 2001:num <- copy 34
122 2002:num <- copy 35
123
124 1000:num <- copy 0
125 1001:num <- copy 5
126
127 default-space:space <- copy 1000/unsafe
128 1:&:point <- copy 2000/unsafe
129 9:num/raw <- get *1:&:point, 1:offset
130 ]
131 +mem: storing 35 in location 9
132
133 :(before "Read element" following "case GET:")
134 element.properties.push_back(pair<string, string_tree*>("raw", NULL));
135
136
137
138 :(scenario lookup_sidesteps_default_space_in_index)
139 def main [
140
141 2001:num <- copy 2
142 2002:num <- copy 34
143 2003:num <- copy 35
144
145 1000:num <- copy 0
146 1001:num <- copy 5
147
148 default-space:space <- copy 1000/unsafe
149 1:&:@:num <- copy 2000/unsafe
150 9:num/raw <- index *1:&:@:num, 1
151 ]
152 +mem: storing 35 in location 9
153
154 :(before "Read element" following "case INDEX:")
155 element.properties.push_back(pair<string, string_tree*>("raw", NULL));
156
157
158
159
160 :(scenario new_default_space)
161 def main [
162 new-default-space
163 x:num <- copy 0
164 y:num <- copy 3
165 ]
166
167 +mem: array length is 3
168
169 :(before "End is_disqualified Special-cases")
170 if (x.name == "number-of-locals")
171 x.initialized = true;
172 :(before "End is_special_name Special-cases")
173 if (s == "number-of-locals") return true;
174
175 :(before "End Rewrite Instruction(curr, recipe result)")
176
177
178
179 if (curr.name == "new-default-space") {
180 rewrite_default_space_instruction(curr);
181 }
182 :(after "Begin Preprocess read_memory(x)")
183 if (x.name == "number-of-locals") {
184 vector<double> result;
185 result.push_back(Name[get(Recipe_ordinal, current_recipe_name())][""]);
186 if (result.back() == 0)
187 raise << "no space allocated for default-space in recipe " << current_recipe_name() << "; are you using names?\n" << end();
188 return result;
189 }
190 :(after "Begin Preprocess write_memory(x, data)")
191 if (x.name == "number-of-locals") {
192 raise << maybe(current_recipe_name()) << "can't write to special name 'number-of-locals'\n" << end();
193 return;
194 }
195
196
197
198
199 :(scenario local_scope)
200 def main [
201 1:&:@:location <- foo
202 2:&:@:location <- foo
203 3:bool <- equal 1:&, 2:&
204 ]
205 def foo [
206 local-scope
207 x:num <- copy 34
208 return default-space:space
209 ]
210
211 +mem: storing 1 in location 3
212
213 :(scenario local_scope_frees_up_addresses)
214 def main [
215 local-scope
216 x:text <- new [abc]
217 ]
218 +mem: clearing x:text
219
220 :(before "End Rewrite Instruction(curr, recipe result)")
221 if (curr.name == "local-scope") {
222 rewrite_default_space_instruction(curr);
223 }
224
225
226 :(after "Falling Through End Of Recipe")
227 try_reclaim_locals();
228 :(after "Starting Reply")
229 try_reclaim_locals();
230
231 :(code)
232 void try_reclaim_locals() {
233
234 const recipe_ordinal r = get(Recipe_ordinal, current_recipe_name());
235 const recipe& exiting_recipe = get(Recipe, r);
236 if (exiting_recipe.steps.empty()) return;
237 const instruction& inst = exiting_recipe.steps.at(0);
238 if (inst.old_name != "local-scope") return;
239
240 vector<double> zeros;
241 for (int i = 1; i < SIZE(exiting_recipe.steps); ++i) {
242 const instruction& inst = exiting_recipe.steps.at(i);
243 for (int i = 0; i < SIZE(inst.products); ++i) {
244 const reagent& product = inst.products.at(i);
245
246 if (has_property(product, "lookup")) continue;
247 if (has_property(product, "raw")) continue;
248 if (escaping(product)) continue;
249
250 trace(9999, "mem") << "clearing " << product.original_string << end();
251 zeros.resize(size_of(product));
252 write_memory(product, zeros);
253 }
254 }
255 trace(9999, "mem") << "automatically abandoning " << current_call().default_space << end();
256 abandon(current_call().default_space,
257 inst.products.at(0).type->right,
258 1 + 1 + Name[r][""]);
259 }
260
261 :(code)
262
263
264 bool escaping(const reagent& r) {
265 assert(Current_routine);
266
267 if (current_step_index() >= SIZE(Current_routine->steps())) return false;
268 for (long long i = 0; i < SIZE(current_instruction().ingredients); ++i) {
269 if (r == current_instruction().ingredients.at(i)) {
270 if (caller_uses_product(i))
271 return true;
272 }
273 }
274 return false;
275 }
276
277
278
279
280 :(after "Write Products of Instruction")
281 Update_refcounts_in_write_memory = should_update_refcounts_in_write_memory();
282 :(before "End Write Products of Instruction")
283 Update_refcounts_in_write_memory = true;
284 :(code)
285 bool should_update_refcounts_in_write_memory() {
286 const instruction& inst = current_instruction();
287
288 if (inst.operation < MAX_PRIMITIVE_RECIPES) return true;
289 if (!contains_key(Recipe, inst.operation)) return true;
290 const recipe& callee = get(Recipe, inst.operation);
291 if (callee.steps.empty()) return true;
292 return callee.steps.at(0).old_name != "local-scope";
293 }
294
295 bool caller_uses_product(int product_index) {
296 assert(Current_routine);
297 assert(!Current_routine->calls.empty());
298 if (Current_routine->calls.size() == 1) return false;
299 const call& caller = *++Current_routine->calls.begin();
300 const instruction& caller_inst = to_instruction(caller);
301 if (product_index >= SIZE(caller_inst.products)) return false;
302 return !is_dummy(caller_inst.products.at(product_index));
303 }
304
305 void rewrite_default_space_instruction(instruction& curr) {
306 if (!curr.ingredients.empty())
307 raise << to_original_string(curr) << " can't take any ingredients\n" << end();
308 curr.name = "new";
309 curr.ingredients.push_back(reagent("location:type"));
310 curr.ingredients.push_back(reagent("number-of-locals:literal"));
311 if (!curr.products.empty())
312 raise << "new-default-space can't take any results\n" << end();
313 curr.products.push_back(reagent("default-space:space"));
314 }
315
316 :(scenario local_scope_frees_up_addresses_inside_containers)
317 container foo [
318 x:num
319 y:&:num
320 ]
321 def main [
322 local-scope
323 x:&:num <- new number:type
324 y:foo <- merge 34, x:&:num
325
326 ]
327 +mem: clearing x:&:num
328 +mem: decrementing refcount of 1006: 2 -> 1
329 +mem: clearing y:foo
330 +mem: decrementing refcount of 1006: 1 -> 0
331 +mem: automatically abandoning 1006
332
333 :(scenario local_scope_returns_addresses_inside_containers)
334 container foo [
335 x:num
336 y:&:num
337 ]
338 def f [
339 local-scope
340 x:&:num <- new number:type
341 *x:&:num <- copy 12
342 y:foo <- merge 34, x:&:num
343
344 return y:foo
345 ]
346 def main [
347 1:foo <- f
348 3:num <- get 1:foo, x:offset
349 4:&:num <- get 1:foo, y:offset
350 5:num <- copy *4:&:num
351 1:foo <- put 1:foo, y:offset, 0
352 4:&:num <- copy 0
353 ]
354 +mem: storing 34 in location 1
355 +mem: storing 1006 in location 2
356 +mem: storing 34 in location 3
357
358 +run: {4: ("address" "number")} <- get {1: "foo"}, {y: "offset"}
359 +mem: incrementing refcount of 1006: 1 -> 2
360
361 +run: {5: "number"} <- copy {4: ("address" "number"), "lookup": ()}
362 +mem: storing 12 in location 5
363 +run: {1: "foo"} <- put {1: "foo"}, {y: "offset"}, {0: "literal"}
364 +mem: decrementing refcount of 1006: 2 -> 1
365 +run: {4: ("address" "number")} <- copy {0: "literal"}
366 +mem: decrementing refcount of 1006: 1 -> 0
367 +mem: automatically abandoning 1006
368
369 :(scenario local_scope_claims_return_values_when_not_saved)
370 def f [
371 local-scope
372 x:&:num <- new number:type
373 return x:&:num
374 ]
375 def main [
376 f
377 ]
378
379 +mem: automatically abandoning 1004
380
381 +mem: automatically abandoning 1000
382
383
384
385 :(before "End Globals")
386 bool Hide_missing_default_space_errors = true;
387 :(before "End Checks")
388 Transform.push_back(check_default_space);
389 :(code)
390 void check_default_space(const recipe_ordinal r) {
391 if (Hide_missing_default_space_errors) return;
392 const recipe& caller = get(Recipe, r);
393
394
395 if (!contains_non_special_name(r)) return;
396 trace(9991, "transform") << "--- check that recipe " << caller.name << " sets default-space" << end();
397 if (caller.steps.empty()) return;
398 if (caller.steps.at(0).products.empty()
399 || caller.steps.at(0).products.at(0).name != "default-space") {
400 raise << caller.name << " does not seem to start with default-space or local-scope\n" << end();
401 }
402 }
403 :(after "Load Mu Prelude")
404 Hide_missing_default_space_errors = false;
405 :(after "Test Runs")
406 Hide_missing_default_space_errors = true;
407 :(after "Running Main")
408 Hide_missing_default_space_errors = false;
409
410 :(code)
411 bool contains_non_special_name(const recipe_ordinal r) {
412 for (map<string, int>::iterator p = Name[r].begin(); p != Name[r].end(); ++p) {
413 if (p->first.empty()) continue;
414 if (p->first.find("stash_") == 0) continue;
415 if (!is_special_name(p->first))
416 return true;
417 }
418 return false;
419 }
420
421
422 bool operator==(const reagent& a, const reagent& b) {
423 if (a.name != b.name) return false;
424 if (property(a, "space") != property(b, "space")) return false;
425 return true;
426 }
427
428 bool operator<(const reagent& a, const reagent& b) {
429 int aspace = 0, bspace = 0;
430 if (has_property(a, "space")) aspace = to_integer(property(a, "space")->value);
431 if (has_property(b, "space")) bspace = to_integer(property(b, "space")->value);
432 if (aspace != bspace) return aspace < bspace;
433 return a.name < b.name;
434 }