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
|
//: A big convenience high-level languages provide is the ability to name memory
//: locations. In mu, a transform called 'transform_names' provides this
//: convenience.
:(scenario convert_names)
recipe main [
x:number <- copy 0:literal
]
+name: assign x 1
+mem: storing 0 in location 1
:(scenario convert_names_warns)
% Hide_warnings = true;
recipe main [
x:number <- copy y:number
]
+warn: use before set: y in main
:(after "int main")
Transform.push_back(transform_names);
:(before "End Globals")
map<recipe_number, map<string, long long int> > Name;
:(after "Clear Other State For recently_added_recipes")
for (long long int i = 0; i < SIZE(recently_added_recipes); ++i) {
Name.erase(recently_added_recipes.at(i));
}
:(code)
void transform_names(const recipe_number r) {
bool names_used = false;
bool numeric_locations_used = false;
map<string, long long int>& names = Name[r];
// store the indices 'used' so far in the map
long long int& curr_idx = names[""];
++curr_idx; // avoid using index 0, benign skip in some other cases
for (long long int i = 0; i < SIZE(Recipe[r].steps); ++i) {
instruction& inst = Recipe[r].steps.at(i);
// Per-recipe Transforms
// map names to addresses
for (long long int in = 0; in < SIZE(inst.ingredients); ++in) {
if (is_numeric_location(inst.ingredients.at(in))) numeric_locations_used = true;
if (is_named_location(inst.ingredients.at(in))) names_used = true;
if (disqualified(inst.ingredients.at(in))) continue;
if (!already_transformed(inst.ingredients.at(in), names)) {
raise << "use before set: " << inst.ingredients.at(in).name << " in " << Recipe[r].name << '\n';
}
inst.ingredients.at(in).set_value(lookup_name(inst.ingredients.at(in), r));
}
for (long long int out = 0; out < SIZE(inst.products); ++out) {
if (is_numeric_location(inst.products.at(out))) numeric_locations_used = true;
if (is_named_location(inst.products.at(out))) names_used = true;
if (disqualified(inst.products.at(out))) continue;
if (names.find(inst.products.at(out).name) == names.end()) {
trace("name") << "assign " << inst.products.at(out).name << " " << curr_idx;
names[inst.products.at(out).name] = curr_idx;
curr_idx += size_of(inst.products.at(out));
}
inst.products.at(out).set_value(lookup_name(inst.products.at(out), r));
}
}
if (names_used && numeric_locations_used)
raise << "mixing variable names and numeric addresses in " << Recipe[r].name << '\n';
}
bool disqualified(/*mutable*/ reagent& x) {
if (x.types.empty())
raise << "missing type in " << x.to_string() << '\n';
assert(!x.types.empty());
if (is_raw(x)) return true;
if (isa_literal(x)) return true;
if (is_integer(x.name)) return true;
// End Disqualified Reagents
if (x.initialized) return true;
return false;
}
bool already_transformed(const reagent& r, const map<string, long long int>& names) {
return names.find(r.name) != names.end();
}
long long int lookup_name(const reagent& r, const recipe_number default_recipe) {
return Name[default_recipe][r.name];
}
type_number skip_addresses(const vector<type_number>& types) {
for (long long int i = 0; i < SIZE(types); ++i) {
if (types.at(i) != Type_number["address"]) return types.at(i);
}
raise << "expected a container" << '\n' << die();
return -1;
}
int find_element_name(const type_number t, const string& name) {
const type_info& container = Type[t];
//? cout << "looking for element " << name << " in type " << container.name << " with " << SIZE(container.element_names) << " elements\n"; //? 1
for (long long int i = 0; i < SIZE(container.element_names); ++i) {
if (container.element_names.at(i) == name) return i;
}
raise << "unknown element " << name << " in container " << t << '\n' << die();
return -1;
}
bool is_numeric_location(const reagent& x) {
if (isa_literal(x)) return false;
if (is_raw(x)) return false;
if (x.name == "0") return false; // used for chaining lexical scopes
return is_integer(x.name);
}
bool is_named_location(const reagent& x) {
if (isa_literal(x)) return false;
if (is_raw(x)) return false;
if (is_special_name(x.name)) return false;
return !is_integer(x.name);
}
bool is_raw(const reagent& r) {
for (long long int i = /*skip value+type*/1; i < SIZE(r.properties); ++i) {
if (r.properties.at(i).first == "raw") return true;
}
return false;
}
bool is_special_name(const string& s) {
if (s == "_") return true;
if (s == "0") return true;
// End is_special_name Cases
return false;
}
:(scenario convert_names_passes_dummy)
# _ is just a dummy result that never gets consumed
recipe main [
_, x:number <- copy 0:literal, 1:literal
]
+name: assign x 1
-name: assign _ 1
//: an escape hatch to suppress name conversion that we'll use later
:(scenario convert_names_passes_raw)
recipe main [
x:number/raw <- copy 0:literal
]
-name: assign x 1
:(scenario convert_names_warns_when_mixing_names_and_numeric_locations)
% Hide_warnings = true;
recipe main [
x:number <- copy 1:number
]
+warn: mixing variable names and numeric addresses in main
:(scenario convert_names_warns_when_mixing_names_and_numeric_locations2)
% Hide_warnings = true;
recipe main [
x:number <- copy 1:literal
1:number <- copy x:number
]
+warn: mixing variable names and numeric addresses in main
:(scenario convert_names_does_not_warn_when_mixing_names_and_raw_locations)
% Hide_warnings = true;
recipe main [
x:number <- copy 1:number/raw
]
-warn: mixing variable names and numeric addresses in main
:(scenario convert_names_does_not_warn_when_mixing_names_and_literals)
% Hide_warnings = true;
recipe main [
x:number <- copy 1:literal
]
-warn: mixing variable names and numeric addresses in main
:(scenario convert_names_does_not_warn_when_mixing_special_names_and_numeric_locations)
% Hide_warnings = true;
recipe main [
screen:number <- copy 1:number
]
-warn: mixing variable names and numeric addresses in main
//:: Support element names for containers in 'get' and 'get-address'.
//: update our running example container for the next test
:(before "End Mu Types Initialization")
Type[point].element_names.push_back("x");
Type[point].element_names.push_back("y");
:(scenario convert_names_transforms_container_elements)
recipe main [
p:address:point <- copy 0:literal # unsafe
a:number <- get p:address:point/deref, y:offset
b:number <- get p:address:point/deref, x:offset
]
+name: element y of type point is at offset 1
+name: element x of type point is at offset 0
:(after "Per-recipe Transforms")
// replace element names of containers with offsets
if (inst.operation == Recipe_number["get"]
|| inst.operation == Recipe_number["get-address"]) {
// at least 2 args, and second arg is offset
assert(SIZE(inst.ingredients) >= 2);
//? cout << inst.ingredients.at(1).to_string() << '\n'; //? 1
assert(isa_literal(inst.ingredients.at(1)));
if (inst.ingredients.at(1).name.find_first_not_of("0123456789") == string::npos) continue;
// since first non-address in base type must be a container, we don't have to canonize
type_number base_type = skip_addresses(inst.ingredients.at(0).types);
inst.ingredients.at(1).set_value(find_element_name(base_type, inst.ingredients.at(1).name));
trace("name") << "element " << inst.ingredients.at(1).name << " of type " << Type[base_type].name << " is at offset " << inst.ingredients.at(1).value;
}
//: this test is actually illegal so can't call run
:(scenarios transform)
:(scenario convert_names_handles_containers)
recipe main [
a:point <- copy 0:literal
b:number <- copy 0:literal
]
+name: assign a 1
+name: assign b 3
//:: Support variant names for exclusive containers in 'maybe-convert'.
:(scenarios run)
:(scenario maybe_convert_named)
recipe main [
12:number <- copy 1:literal
13:number <- copy 35:literal
14:number <- copy 36:literal
20:address:point <- maybe-convert 12:number-or-point, p:variant
]
+name: variant p of type number-or-point has tag 1
+mem: storing 13 in location 20
:(after "Per-recipe Transforms")
// convert variant names of exclusive containers
if (inst.operation == Recipe_number["maybe-convert"]) {
// at least 2 args, and second arg is offset
assert(SIZE(inst.ingredients) >= 2);
assert(isa_literal(inst.ingredients.at(1)));
if (inst.ingredients.at(1).name.find_first_not_of("0123456789") == string::npos) continue;
// since first non-address in base type must be an exclusive container, we don't have to canonize
type_number base_type = skip_addresses(inst.ingredients.at(0).types);
inst.ingredients.at(1).set_value(find_element_name(base_type, inst.ingredients.at(1).name));
trace("name") << "variant " << inst.ingredients.at(1).name << " of type " << Type[base_type].name << " has tag " << inst.ingredients.at(1).value;
}
|