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
|
//: Arrays contain a variable number of elements of the same type. Their value
//: starts with the length of the array.
//:
//: You can create arrays of containers, but containers can only contain
//: elements of a fixed size, so you can't create containers containing arrays.
//: Create containers containing addresses to arrays instead.
//: Tests in this layer often explicitly setup memory before reading it as an
//: array. Don't do this in general. I'm tagging exceptions with /raw to
//: avoid warnings.
:(scenario copy_array)
# Arrays can be copied around with a single instruction just like numbers,
# no matter how large they are.
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:array:number <- copy 1:array:number/raw # unsafe
]
+mem: storing 3 in location 5
+mem: storing 14 in location 6
+mem: storing 15 in location 7
+mem: storing 16 in location 8
:(scenario copy_array_indirect)
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:address:array:number <- copy 1:literal
6:array:number <- copy 5:address:array:number/deref
]
+mem: storing 3 in location 6
+mem: storing 14 in location 7
+mem: storing 15 in location 8
+mem: storing 16 in location 9
//: disable the size mismatch check since the destination array need not be initialized
:(after "bool size_mismatch(const reagent& x, const vector<double>& data)")
if (x.types.at(0) == Type_ordinal["array"]) return false;
:(before "End size_of(reagent) Cases")
if (r.types.at(0) == Type_ordinal["array"]) {
if (SIZE(r.types) == 1) {
raise << current_recipe_name() << ": '" << r.original_string << "' is an array of what?\n" << end();
return 1;
}
// skip the 'array' type to get at the element type
return 1 + Memory[r.value]*size_of(array_element(r.types));
}
//:: To access elements of an array, use 'index'
:(scenario index)
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- index 1:array:number/raw, 0:literal # unsafe
]
+mem: storing 14 in location 5
:(scenario index_direct_offset)
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- copy 0:literal
6:number <- index 1:array:number/raw, 5:number # unsafe
]
+mem: storing 14 in location 6
:(before "End Primitive Recipe Declarations")
INDEX,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["index"] = INDEX;
:(before "End Primitive Recipe Implementations")
case INDEX: {
if (SIZE(ingredients) != 2) {
raise << current_recipe_name() << ": 'index' expects exactly 2 ingredients in '" << current_instruction().to_string() << "'\n" << end();
break;
}
reagent base = canonize(current_instruction().ingredients.at(0));
long long int base_address = base.value;
if (base.types.at(0) != Type_ordinal["array"]) {
raise << current_recipe_name () << ": 'index' on a non-array " << base.original_string << '\n' << end();
break;
}
reagent offset = canonize(current_instruction().ingredients.at(1));
vector<double> offset_val(read_memory(offset));
vector<type_ordinal> element_type = array_element(base.types);
if (offset_val.at(0) < 0 || offset_val.at(0) >= Memory[base_address]) {
raise << current_recipe_name() << ": invalid index " << offset_val.at(0) << '\n' << end();
products.resize(1);
break;
}
long long int src = base_address + 1 + offset_val.at(0)*size_of(element_type);
trace(Primitive_recipe_depth, "run") << "address to copy is " << src << end();
trace(Primitive_recipe_depth, "run") << "its type is " << Type[element_type.at(0)].name << end();
reagent tmp;
tmp.set_value(src);
copy(element_type.begin(), element_type.end(), inserter(tmp.types, tmp.types.begin()));
products.push_back(read_memory(tmp));
break;
}
:(code)
vector<type_ordinal> array_element(const vector<type_ordinal>& types) {
return vector<type_ordinal>(++types.begin(), types.end());
}
:(scenario index_indirect)
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:address:array:number <- copy 1:literal
6:number <- index 5:address:array:number/deref, 1:literal
]
+mem: storing 15 in location 6
:(scenario index_out_of_bounds)
% Hide_warnings = true;
recipe main [
1:number <- copy 3:literal # 3 points
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- copy 14:literal
6:number <- copy 15:literal
7:number <- copy 16:literal
8:address:array:point <- copy 1:literal
index 8:address:array:point/deref, 4:literal # less than size of array in locations, but larger than its length in elements
]
+warn: main: invalid index 4
:(scenario index_out_of_bounds2)
% Hide_warnings = true;
recipe main [
1:number <- copy 3:literal # 3 points
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- copy 14:literal
6:number <- copy 15:literal
7:number <- copy 16:literal
8:address:array:point <- copy 1:literal
index 8:address:array:point/deref, -1:literal
]
+warn: main: invalid index -1
//:: To write to elements of containers, you need their address.
:(scenario index_address)
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- index-address 1:array:number/raw, 0:literal # unsafe
]
+mem: storing 2 in location 5
:(before "End Primitive Recipe Declarations")
INDEX_ADDRESS,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["index-address"] = INDEX_ADDRESS;
:(before "End Primitive Recipe Implementations")
case INDEX_ADDRESS: {
if (SIZE(ingredients) != 2) {
raise << current_recipe_name() << ": 'index-address' expects exactly 2 ingredients in '" << current_instruction().to_string() << "'\n" << end();
break;
}
reagent base = canonize(current_instruction().ingredients.at(0));
long long int base_address = base.value;
if (base.types.at(0) != Type_ordinal["array"]) {
raise << current_recipe_name () << ": 'index-address' on a non-array " << base.original_string << '\n' << end();
break;
}
reagent offset = canonize(current_instruction().ingredients.at(1));
vector<double> offset_val(read_memory(offset));
vector<type_ordinal> element_type = array_element(base.types);
if (offset_val.at(0) < 0 || offset_val.at(0) >= Memory[base_address]) {
raise << current_recipe_name() << ": invalid index " << offset_val.at(0) << '\n' << end();
products.resize(1);
break;
}
long long int result = base_address + 1 + offset_val.at(0)*size_of(element_type);
products.resize(1);
products.at(0).push_back(result);
break;
}
:(scenario index_address_out_of_bounds)
% Hide_warnings = true;
recipe main [
1:number <- copy 3:literal # 3 points
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- copy 14:literal
6:number <- copy 15:literal
7:number <- copy 16:literal
8:address:array:point <- copy 1:literal
index-address 8:address:array:point/deref, 4:literal # less than size of array in locations, but larger than its length in elements
]
+warn: main: invalid index 4
:(scenario index_address_out_of_bounds2)
% Hide_warnings = true;
recipe main [
1:number <- copy 3:literal # 3 points
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- copy 14:literal
6:number <- copy 15:literal
7:number <- copy 16:literal
8:address:array:point <- copy 1:literal
index-address 8:address:array:point/deref, -1:literal
]
+warn: main: invalid index -1
//:: compute the length of an array
:(scenario array_length)
recipe main [
1:number <- copy 3:literal # length
2:number <- copy 14:literal
3:number <- copy 15:literal
4:number <- copy 16:literal
5:number <- length 1:array:number/raw # unsafe
]
+mem: storing 3 in location 5
:(before "End Primitive Recipe Declarations")
LENGTH,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["length"] = LENGTH;
:(before "End Primitive Recipe Implementations")
case LENGTH: {
if (SIZE(ingredients) != 1) {
raise << current_recipe_name() << ": 'length' expects exactly 2 ingredients in '" << current_instruction().to_string() << "'\n" << end();
break;
}
reagent x = canonize(current_instruction().ingredients.at(0));
if (x.types.at(0) != Type_ordinal["array"]) {
raise << "tried to calculate length of non-array " << x.original_string << '\n' << end();
break;
}
products.resize(1);
products.at(0).push_back(Memory[x.value]);
break;
}
|