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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
|
//: Transform to maintain multiple variants of a recipe depending on the
//: number and types of the ingredients and products. Allows us to use nice
//: names like 'print' or 'length' in many mutually extensible ways.
:(scenario static_dispatch)
recipe main [
7:number/raw <- test 3
]
recipe test a:number -> z:number [
z <- copy 1
]
recipe test a:number, b:number -> z:number [
z <- copy 2
]
+mem: storing 1 in location 7
//: When loading recipes, accumulate variants if headers don't collide, and
//: raise a warning if headers collide.
:(before "End Globals")
map<string, vector<recipe_ordinal> > Recipe_variants;
:(before "End One-time Setup")
put(Recipe_variants, "main", vector<recipe_ordinal>()); // since we manually added main to Recipe_ordinal
:(before "Clear Other State For Recently_added_recipes")
for (map<string, vector<recipe_ordinal> >::iterator p = Recipe_variants.begin(); p != Recipe_variants.end(); ++p) {
for (long long int i = 0; i < SIZE(p->second); ++i) {
if (find(Recently_added_recipes.begin(), Recently_added_recipes.end(), p->second.at(i)) != Recently_added_recipes.end())
p->second.at(i) = -1; // just leave a ghost
}
}
:(before "End Load Recipe Header(result)")
if (result.name != "main" && contains_key(Recipe_ordinal, result.name)) {
const recipe_ordinal r = get(Recipe_ordinal, result.name);
//? cerr << result.name << ": " << contains_key(Recipe, r) << (contains_key(Recipe, r) ? get(Recipe, r).has_header : 0) << matching_variant_name(result) << '\n';
if (!contains_key(Recipe, r) || get(Recipe, r).has_header) {
string new_name = matching_variant_name(result);
if (new_name.empty()) {
// variant doesn't already exist
new_name = next_unused_recipe_name(result.name);
put(Recipe_ordinal, new_name, Next_recipe_ordinal++);
get_or_insert(Recipe_variants, result.name).push_back(get(Recipe_ordinal, new_name));
}
result.name = new_name;
//? cerr << "=> " << new_name << '\n';
}
}
else {
// save first variant
put(Recipe_ordinal, result.name, Next_recipe_ordinal++);
get_or_insert(Recipe_variants, result.name).push_back(get(Recipe_ordinal, result.name));
}
:(code)
string matching_variant_name(const recipe& rr) {
const vector<recipe_ordinal>& variants = get_or_insert(Recipe_variants, rr.name);
for (long long int i = 0; i < SIZE(variants); ++i) {
if (!contains_key(Recipe, variants.at(i))) continue;
const recipe& candidate = get(Recipe, variants.at(i));
if (!all_reagents_match(rr, candidate)) continue;
return candidate.name;
}
return "";
}
bool all_reagents_match(const recipe& r1, const recipe& r2) {
if (SIZE(r1.ingredients) != SIZE(r2.ingredients)) return false;
if (SIZE(r1.products) != SIZE(r2.products)) return false;
for (long long int i = 0; i < SIZE(r1.ingredients); ++i) {
if (!deeply_equal_types(r1.ingredients.at(i).properties.at(0).second,
r2.ingredients.at(i).properties.at(0).second)) {
return false;
}
}
for (long long int i = 0; i < SIZE(r1.products); ++i) {
if (!deeply_equal_types(r1.products.at(i).properties.at(0).second,
r2.products.at(i).properties.at(0).second)) {
return false;
}
}
return true;
}
:(before "End Globals")
set<string> Literal_type_names;
:(before "End One-time Setup")
Literal_type_names.insert("number");
Literal_type_names.insert("character");
:(code)
bool deeply_equal_types(const string_tree* a, const string_tree* b) {
if (!a) return !b;
if (!b) return !a;
if (a->value == "literal" && b->value == "literal")
return true;
if (a->value == "literal")
return Literal_type_names.find(b->value) != Literal_type_names.end();
if (b->value == "literal")
return Literal_type_names.find(a->value) != Literal_type_names.end();
return a->value == b->value
&& deeply_equal_types(a->left, b->left)
&& deeply_equal_types(a->right, b->right);
}
string next_unused_recipe_name(const string& recipe_name) {
for (long long int i = 2; ; ++i) {
ostringstream out;
out << recipe_name << '_' << i;
if (!contains_key(Recipe_ordinal, out.str()))
return out.str();
}
}
//: Once all the recipes are loaded, transform their bodies to replace each
//: call with the most suitable variant.
:(scenario static_dispatch_picks_most_similar_variant)
recipe main [
7:number/raw <- test 3, 4, 5
]
recipe test a:number -> z:number [
z <- copy 1
]
recipe test a:number, b:number -> z:number [
z <- copy 2
]
+mem: storing 2 in location 7
//: support recipe headers in a previous transform to fill in missing types
:(before "End check_or_set_invalid_types")
for (long long int i = 0; i < SIZE(caller.ingredients); ++i) {
check_or_set_invalid_types(caller.ingredients.at(i).type, caller.ingredients.at(i).properties.at(0).second,
maybe(caller.name), "recipe header ingredient");
}
for (long long int i = 0; i < SIZE(caller.products); ++i) {
check_or_set_invalid_types(caller.products.at(i).type, caller.products.at(i).properties.at(0).second,
maybe(caller.name), "recipe header product");
}
//: after filling in all missing types (because we'll be introducing 'blank' types in this transform in a later layer, for shape-shifting recipes)
:(after "Transform.push_back(transform_names)")
Transform.push_back(resolve_ambiguous_calls); // idempotent
//: In a later layer we'll introduce recursion in resolve_ambiguous_calls, by
//: having it generate code for shape-shifting recipes and then transform such
//: code. This data structure will help error messages be more useful.
//:
//: We're punning the 'call' data structure just because it has slots for
//: calling recipe and calling instruction.
:(before "End Globals")
list<call> resolve_stack;
:(code)
void resolve_ambiguous_calls(recipe_ordinal r) {
recipe& caller_recipe = get(Recipe, r);
trace(9991, "transform") << "--- resolve ambiguous calls for recipe " << caller_recipe.name << end();
//? cerr << "--- resolve ambiguous calls for recipe " << caller_recipe.name << '\n';
for (long long int index = 0; index < SIZE(caller_recipe.steps); ++index) {
instruction& inst = caller_recipe.steps.at(index);
if (inst.is_label) continue;
if (get_or_insert(Recipe_variants, inst.name).empty()) continue;
resolve_stack.push_front(call(r));
resolve_stack.front().running_step_index = index;
replace_best_variant(inst, caller_recipe);
assert(resolve_stack.front().running_recipe == r);
assert(resolve_stack.front().running_step_index == index);
resolve_stack.pop_front();
}
}
void replace_best_variant(instruction& inst, const recipe& caller_recipe) {
trace(9992, "transform") << "instruction " << inst.name << end();
vector<recipe_ordinal>& variants = get(Recipe_variants, inst.name);
//? trace(9992, "transform") << "checking base: " << get(Recipe_ordinal, inst.name) << end();
long long int best_score = variant_score(inst, get(Recipe_ordinal, inst.name));
trace(9992, "transform") << "score for base: " << best_score << end();
for (long long int i = 0; i < SIZE(variants); ++i) {
if (variants.at(i) == -1) continue;
//? trace(9992, "transform") << "checking variant " << i << ": " << variants.at(i) << end();
long long int current_score = variant_score(inst, variants.at(i));
trace(9992, "transform") << "score for variant " << i << ": " << current_score << end();
if (current_score > best_score) {
inst.name = get(Recipe, variants.at(i)).name;
best_score = current_score;
}
}
// End Instruction Dispatch(inst, best_score)
if (best_score == -1 && get(Recipe_ordinal, inst.name) >= MAX_PRIMITIVE_RECIPES) {
raise_error << maybe(caller_recipe.name) << "failed to find a matching call for '" << inst.to_string() << "'\n" << end();
for (list<call>::iterator p = /*skip*/++resolve_stack.begin(); p != resolve_stack.end(); ++p) {
const recipe& specializer_recipe = get(Recipe, p->running_recipe);
const instruction& specializer_inst = specializer_recipe.steps.at(p->running_step_index);
if (specializer_recipe.name != "interactive")
raise_error << " (from '" << specializer_inst.to_string() << "' in " << specializer_recipe.name << ")\n" << end();
else
raise_error << " (from '" << specializer_inst.to_string() << "')\n" << end();
// One special-case to help with the rewrite_stash transform. (cross-layer)
if (specializer_inst.products.at(0).name.find("stash_") == 0) {
instruction stash_inst;
if (next_stash(*p, &stash_inst)) {
if (specializer_recipe.name != "interactive")
raise_error << " (part of '" << stash_inst.original_string << "' in " << specializer_recipe.name << ")\n" << end();
else
raise_error << " (part of '" << stash_inst.original_string << "')\n" << end();
}
}
}
}
}
bool next_stash(const call& c, instruction* stash_inst) {
const recipe& specializer_recipe = get(Recipe, c.running_recipe);
long long int index = c.running_step_index;
for (++index; index < SIZE(specializer_recipe.steps); ++index) {
const instruction& inst = specializer_recipe.steps.at(index);
if (inst.name == "stash") {
*stash_inst = inst;
return true;
}
}
return false;
}
long long int variant_score(const instruction& inst, recipe_ordinal variant) {
long long int result = 1000;
if (variant == -1) return -1; // ghost from a previous test
//? cerr << "variant score: " << inst.to_string() << '\n';
if (!contains_key(Recipe, variant)) {
assert(variant < MAX_PRIMITIVE_RECIPES);
return -1;
}
const vector<reagent>& header_ingredients = get(Recipe, variant).ingredients;
//? cerr << "=== checking ingredients\n";
for (long long int i = 0; i < min(SIZE(inst.ingredients), SIZE(header_ingredients)); ++i) {
if (!types_match(header_ingredients.at(i), inst.ingredients.at(i))) {
trace(9993, "transform") << "mismatch: ingredient " << i << end();
//? cerr << "mismatch: ingredient " << i << '\n';
return -1;
}
if (types_strictly_match(header_ingredients.at(i), inst.ingredients.at(i))) {
trace(9993, "transform") << "strict match: ingredient " << i << end();
//? cerr << "strict match: ingredient " << i << '\n';
}
else if (boolean_matches_literal(header_ingredients.at(i), inst.ingredients.at(i))) {
// slight penalty for coercing literal to boolean (prefer direct conversion to number if possible)
trace(9993, "transform") << "boolean matches literal: ingredient " << i << end();
result--;
}
else {
// slightly larger penalty for modifying type in other ways
trace(9993, "transform") << "non-strict match: ingredient " << i << end();
//? cerr << "non-strict match: ingredient " << i << '\n';
result-=10;
}
}
//? cerr << "=== done checking ingredients\n";
const vector<reagent>& header_products = get(Recipe, variant).products;
for (long long int i = 0; i < min(SIZE(header_products), SIZE(inst.products)); ++i) {
if (is_dummy(inst.products.at(i))) continue;
if (!types_match(header_products.at(i), inst.products.at(i))) {
trace(9993, "transform") << "mismatch: product " << i << end();
//? cerr << "mismatch: product " << i << '\n';
return -1;
}
if (types_strictly_match(header_products.at(i), inst.products.at(i))) {
trace(9993, "transform") << "strict match: product " << i << end();
//? cerr << "strict match: product " << i << '\n';
}
else if (boolean_matches_literal(header_products.at(i), inst.products.at(i))) {
// slight penalty for coercing literal to boolean (prefer direct conversion to number if possible)
trace(9993, "transform") << "boolean matches literal: product " << i << end();
result--;
}
else {
// slightly larger penalty for modifying type in other ways
trace(9993, "transform") << "non-strict match: product " << i << end();
//? cerr << "non-strict match: product " << i << '\n';
result-=10;
}
}
// the greater the number of unused ingredients/products, the lower the score
return result - abs(SIZE(get(Recipe, variant).products)-SIZE(inst.products))
- abs(SIZE(inst.ingredients)-SIZE(get(Recipe, variant).ingredients));
}
:(scenario static_dispatch_disabled_on_headerless_definition)
% Hide_warnings = true;
recipe test a:number -> z:number [
z <- copy 1
]
recipe test [
reply 34
]
+warn: redefining recipe test
:(scenario static_dispatch_disabled_on_headerless_definition_2)
% Hide_warnings = true;
recipe test [
reply 34
]
recipe test a:number -> z:number [
z <- copy 1
]
+warn: redefining recipe test
:(scenario static_dispatch_on_primitive_names)
recipe main [
1:number <- copy 34
2:number <- copy 34
3:boolean <- equal 1:number, 2:number
4:boolean <- copy 0/false
5:boolean <- copy 0/false
6:boolean <- equal 4:boolean, 5:boolean
]
# temporarily hardcode number equality to always fail
recipe equal x:number, y:number -> z:boolean [
local-scope
load-ingredients
z <- copy 0/false
]
# comparing numbers used overload
+mem: storing 0 in location 3
# comparing booleans continues to use primitive
+mem: storing 1 in location 6
:(scenario static_dispatch_works_with_dummy_results_for_containers)
% Hide_errors = true;
recipe main [
_ <- test 3, 4
]
recipe test a:number -> z:point [
local-scope
load-ingredients
z <- merge a, 0
]
recipe test a:number, b:number -> z:point [
local-scope
load-ingredients
z <- merge a, b
]
$error: 0
:(scenario static_dispatch_works_with_compound_type_containing_container_defined_after_first_use)
% Hide_errors = true;
recipe main [
x:address:shared:foo <- new foo:type
test x
]
container foo [
x:number
]
recipe test a:address:shared:foo -> z:number [
local-scope
load-ingredients
z:number <- get *a, x:offset
]
$error: 0
:(scenario static_dispatch_works_with_compound_type_containing_container_defined_after_second_use)
% Hide_errors = true;
recipe main [
x:address:shared:foo <- new foo:type
test x
]
recipe test a:address:shared:foo -> z:number [
local-scope
load-ingredients
z:number <- get *a, x:offset
]
container foo [
x:number
]
$error: 0
:(scenario static_dispatch_prefers_literals_to_be_numbers_rather_than_addresses)
recipe main [
1:number <- foo 0
]
recipe foo x:address:number -> y:number [
reply 34
]
recipe foo x:number -> y:number [
reply 35
]
+mem: storing 35 in location 1
:(scenario static_dispatch_on_non_literal_character_ignores_variant_with_numbers)
% Hide_errors = true;
recipe main [
local-scope
x:character <- copy 10/newline
1:number/raw <- foo x
]
recipe foo x:number -> y:number [
load-ingredients
reply 34
]
+error: main: ingredient 0 has the wrong type at '1:number/raw <- foo x'
-mem: storing 34 in location 1
:(scenario static_dispatch_dispatches_literal_to_boolean_before_character)
recipe main [
1:number/raw <- foo 0 # valid literal for boolean
]
recipe foo x:character -> y:number [
local-scope
load-ingredients
reply 34
]
recipe foo x:boolean -> y:number [
local-scope
load-ingredients
reply 35
]
# boolean variant is preferred
+mem: storing 35 in location 1
:(scenario static_dispatch_dispatches_literal_to_character_when_out_of_boolean_range)
recipe main [
1:number/raw <- foo 97 # not a valid literal for boolean
]
recipe foo x:character -> y:number [
local-scope
load-ingredients
reply 34
]
recipe foo x:boolean -> y:number [
local-scope
load-ingredients
reply 35
]
# character variant is preferred
+mem: storing 34 in location 1
:(scenario static_dispatch_dispatches_literal_to_number_if_at_all_possible)
recipe main [
1:number/raw <- foo 97
]
recipe foo x:character -> y:number [
local-scope
load-ingredients
reply 34
]
recipe foo x:number -> y:number [
local-scope
load-ingredients
reply 35
]
# number variant is preferred
+mem: storing 35 in location 1
:(code)
string header_label(recipe_ordinal r) {
const recipe& caller = get(Recipe, r);
ostringstream out;
out << "recipe " << caller.name;
for (long long int i = 0; i < SIZE(caller.ingredients); ++i)
out << ' ' << caller.ingredients.at(i).original_string;
if (!caller.products.empty()) out << " ->";
for (long long int i = 0; i < SIZE(caller.products); ++i)
out << ' ' << caller.products.at(i).original_string;
return out.str();
}
:(scenario reload_variant_retains_other_variants)
recipe main [
1:number <- copy 34
2:number <- foo 1:number
]
recipe foo x:number -> y:number [
local-scope
load-ingredients
reply 34
]
recipe foo x:address:number -> y:number [
local-scope
load-ingredients
reply 35
]
recipe! foo x:address:number -> y:number [
local-scope
load-ingredients
reply 36
]
+mem: storing 34 in location 2
$error: 0
$warn: 0
:(scenario dispatch_errors_come_after_unknown_name_errors)
% Hide_errors = true;
recipe main [
y:number <- foo x
]
recipe foo a:number -> b:number [
local-scope
load-ingredients
reply 34
]
recipe foo a:boolean -> b:number [
local-scope
load-ingredients
reply 35
]
+error: main: missing type for x in 'y:number <- foo x'
+error: main: failed to find a matching call for 'y:number <- foo x'
:(before "End Includes")
using std::abs;
|