2015-04-25 06:30:14 +00:00
|
|
|
//: Arrays contain a variable number of elements of the same type. Their value
|
|
|
|
//: starts with the length of the array.
|
2015-04-18 03:36:25 +00:00
|
|
|
//:
|
|
|
|
//: 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.
|
2015-04-17 18:22:59 +00:00
|
|
|
|
2015-05-26 22:48:35 +00:00
|
|
|
//: 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.
|
2015-02-22 06:08:58 +00:00
|
|
|
:(scenario copy_array)
|
2015-05-13 17:03:26 +00:00
|
|
|
# Arrays can be copied around with a single instruction just like numbers,
|
2015-03-27 04:47:29 +00:00
|
|
|
# no matter how large they are.
|
2015-02-22 06:08:58 +00:00
|
|
|
recipe main [
|
2015-05-13 17:03:26 +00:00
|
|
|
1:number <- copy 3:literal # length
|
|
|
|
2:number <- copy 14:literal
|
|
|
|
3:number <- copy 15:literal
|
|
|
|
4:number <- copy 16:literal
|
2015-05-26 22:48:35 +00:00
|
|
|
5:array:number <- copy 1:array:number/raw # unsafe
|
2015-02-22 06:08:58 +00:00
|
|
|
]
|
2015-03-24 06:59:59 +00:00
|
|
|
+mem: storing 3 in location 5
|
|
|
|
+mem: storing 14 in location 6
|
|
|
|
+mem: storing 15 in location 7
|
|
|
|
+mem: storing 16 in location 8
|
2015-02-22 06:08:58 +00:00
|
|
|
|
2015-04-18 04:49:40 +00:00
|
|
|
:(scenario copy_array_indirect)
|
|
|
|
recipe main [
|
2015-05-13 17:03:26 +00:00
|
|
|
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
|
2015-04-18 04:49:40 +00:00
|
|
|
]
|
|
|
|
+mem: storing 3 in location 6
|
|
|
|
+mem: storing 14 in location 7
|
|
|
|
+mem: storing 15 in location 8
|
|
|
|
+mem: storing 16 in location 9
|
|
|
|
|
2015-03-27 04:47:29 +00:00
|
|
|
//: disable the size mismatch check since the destination array need not be initialized
|
2015-06-21 05:55:01 +00:00
|
|
|
:(after "bool size_mismatch(const reagent& x, const vector<double>& data)")
|
2015-07-04 16:40:50 +00:00
|
|
|
if (x.types.at(0) == Type_ordinal["array"]) return false;
|
2015-05-17 09:22:41 +00:00
|
|
|
:(after "long long int size_of(const reagent& r)")
|
2015-07-04 16:40:50 +00:00
|
|
|
if (r.types.at(0) == Type_ordinal["array"]) {
|
2015-05-17 09:22:41 +00:00
|
|
|
assert(SIZE(r.types) > 1);
|
2015-03-27 04:47:29 +00:00
|
|
|
// skip the 'array' type to get at the element type
|
2015-05-13 00:00:56 +00:00
|
|
|
return 1 + Memory[r.value]*size_of(array_element(r.types));
|
2015-03-27 03:24:38 +00:00
|
|
|
}
|
2015-02-22 09:32:24 +00:00
|
|
|
|
2015-04-18 06:24:52 +00:00
|
|
|
//:: To access elements of an array, use 'index'
|
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario index)
|
2015-03-27 04:47:29 +00:00
|
|
|
recipe main [
|
2015-05-13 17:03:26 +00:00
|
|
|
1:number <- copy 3:literal # length
|
|
|
|
2:number <- copy 14:literal
|
|
|
|
3:number <- copy 15:literal
|
|
|
|
4:number <- copy 16:literal
|
2015-05-26 22:48:35 +00:00
|
|
|
5:number <- index 1:array:number/raw, 0:literal # unsafe
|
2015-03-27 04:47:29 +00:00
|
|
|
]
|
|
|
|
+mem: storing 14 in location 5
|
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario index_direct_offset)
|
2015-04-03 19:49:11 +00:00
|
|
|
recipe main [
|
2015-05-13 17:03:26 +00:00
|
|
|
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
|
2015-05-26 22:48:35 +00:00
|
|
|
6:number <- index 1:array:number/raw, 5:number # unsafe
|
2015-04-03 19:49:11 +00:00
|
|
|
]
|
|
|
|
+mem: storing 14 in location 6
|
|
|
|
|
2015-04-17 17:31:17 +00:00
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
INDEX,
|
2015-02-22 09:32:24 +00:00
|
|
|
:(before "End Primitive Recipe Numbers")
|
2015-07-04 16:40:50 +00:00
|
|
|
Recipe_ordinal["index"] = INDEX;
|
2015-02-22 09:32:24 +00:00
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case INDEX: {
|
2015-04-03 19:49:11 +00:00
|
|
|
//? if (Trace_stream) Trace_stream->dump_layer = "run"; //? 1
|
2015-05-07 22:06:53 +00:00
|
|
|
reagent base = canonize(current_instruction().ingredients.at(0));
|
2015-05-22 01:57:25 +00:00
|
|
|
//? trace(Primitive_recipe_depth, "run") << "ingredient 0 after canonize: " << base.to_string(); //? 1
|
2015-05-17 09:22:41 +00:00
|
|
|
long long int base_address = base.value;
|
2015-07-04 16:40:50 +00:00
|
|
|
assert(base.types.at(0) == Type_ordinal["array"]);
|
2015-05-07 22:06:53 +00:00
|
|
|
reagent offset = canonize(current_instruction().ingredients.at(1));
|
2015-05-22 01:57:25 +00:00
|
|
|
//? trace(Primitive_recipe_depth, "run") << "ingredient 1 after canonize: " << offset.to_string(); //? 1
|
2015-05-13 01:08:47 +00:00
|
|
|
vector<double> offset_val(read_memory(offset));
|
2015-07-04 16:40:50 +00:00
|
|
|
vector<type_ordinal> element_type = array_element(base.types);
|
2015-05-22 01:57:25 +00:00
|
|
|
//? trace(Primitive_recipe_depth, "run") << "offset: " << offset_val.at(0); //? 1
|
|
|
|
//? trace(Primitive_recipe_depth, "run") << "size of elements: " << size_of(element_type); //? 1
|
2015-07-10 03:32:23 +00:00
|
|
|
assert(offset_val.at(0) >= 0);
|
|
|
|
assert(offset_val.at(0) < Memory[base_address]*size_of(element_type) + 1);
|
2015-05-17 09:22:41 +00:00
|
|
|
long long int src = base_address + 1 + offset_val.at(0)*size_of(element_type);
|
2015-05-22 01:57:25 +00:00
|
|
|
trace(Primitive_recipe_depth, "run") << "address to copy is " << src;
|
2015-06-17 19:40:55 +00:00
|
|
|
trace(Primitive_recipe_depth, "run") << "its type is " << Type[element_type.at(0)].name;
|
2015-03-26 02:06:32 +00:00
|
|
|
reagent tmp;
|
2015-05-13 00:00:56 +00:00
|
|
|
tmp.set_value(src);
|
2015-03-27 04:47:29 +00:00
|
|
|
copy(element_type.begin(), element_type.end(), inserter(tmp.types, tmp.types.begin()));
|
2015-05-07 22:06:53 +00:00
|
|
|
products.push_back(read_memory(tmp));
|
2015-02-22 09:32:24 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2015-03-27 04:47:29 +00:00
|
|
|
:(code)
|
2015-07-04 16:40:50 +00:00
|
|
|
vector<type_ordinal> array_element(const vector<type_ordinal>& types) {
|
|
|
|
return vector<type_ordinal>(++types.begin(), types.end());
|
2015-03-27 04:47:29 +00:00
|
|
|
}
|
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario index_address)
|
2015-02-22 09:32:24 +00:00
|
|
|
recipe main [
|
2015-05-13 17:03:26 +00:00
|
|
|
1:number <- copy 3:literal # length
|
|
|
|
2:number <- copy 14:literal
|
|
|
|
3:number <- copy 15:literal
|
|
|
|
4:number <- copy 16:literal
|
2015-05-26 22:48:35 +00:00
|
|
|
5:number <- index-address 1:array:number/raw, 0:literal # unsafe
|
2015-02-22 09:32:24 +00:00
|
|
|
]
|
2015-03-27 04:47:29 +00:00
|
|
|
+mem: storing 2 in location 5
|
2015-02-22 09:32:24 +00:00
|
|
|
|
2015-04-18 06:24:52 +00:00
|
|
|
//:: To write to elements of containers, you need their address.
|
2015-04-17 17:31:17 +00:00
|
|
|
|
2015-04-24 17:19:03 +00:00
|
|
|
:(scenario index_indirect)
|
2015-04-17 17:31:17 +00:00
|
|
|
recipe main [
|
2015-05-13 17:03:26 +00:00
|
|
|
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
|
2015-04-17 17:31:17 +00:00
|
|
|
]
|
|
|
|
+mem: storing 15 in location 6
|
|
|
|
|
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
INDEX_ADDRESS,
|
2015-02-22 09:32:24 +00:00
|
|
|
:(before "End Primitive Recipe Numbers")
|
2015-07-04 16:40:50 +00:00
|
|
|
Recipe_ordinal["index-address"] = INDEX_ADDRESS;
|
2015-02-22 09:32:24 +00:00
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case INDEX_ADDRESS: {
|
2015-05-07 22:06:53 +00:00
|
|
|
reagent base = canonize(current_instruction().ingredients.at(0));
|
2015-05-17 09:22:41 +00:00
|
|
|
long long int base_address = base.value;
|
2015-07-04 16:40:50 +00:00
|
|
|
assert(base.types.at(0) == Type_ordinal["array"]);
|
2015-05-13 00:00:56 +00:00
|
|
|
reagent offset = canonize(current_instruction().ingredients.at(1));
|
2015-05-13 01:08:47 +00:00
|
|
|
vector<double> offset_val(read_memory(offset));
|
2015-07-04 16:40:50 +00:00
|
|
|
vector<type_ordinal> element_type = array_element(base.types);
|
2015-07-10 03:32:23 +00:00
|
|
|
assert(offset_val.at(0) >= 0);
|
|
|
|
assert(offset_val.at(0) < Memory[base_address]*size_of(element_type) + 1);
|
2015-05-17 09:22:41 +00:00
|
|
|
long long int result = base_address + 1 + offset_val.at(0)*size_of(element_type);
|
2015-05-07 22:06:53 +00:00
|
|
|
products.resize(1);
|
2015-05-13 00:00:56 +00:00
|
|
|
products.at(0).push_back(result);
|
2015-02-22 09:32:24 +00:00
|
|
|
break;
|
|
|
|
}
|
2015-05-26 22:16:36 +00:00
|
|
|
|
|
|
|
//:: 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
|
2015-05-26 22:48:35 +00:00
|
|
|
5:number <- length 1:array:number/raw # unsafe
|
2015-05-26 22:16:36 +00:00
|
|
|
]
|
|
|
|
+mem: storing 3 in location 5
|
|
|
|
|
|
|
|
:(before "End Primitive Recipe Declarations")
|
|
|
|
LENGTH,
|
|
|
|
:(before "End Primitive Recipe Numbers")
|
2015-07-04 16:40:50 +00:00
|
|
|
Recipe_ordinal["length"] = LENGTH;
|
2015-05-26 22:16:36 +00:00
|
|
|
:(before "End Primitive Recipe Implementations")
|
|
|
|
case LENGTH: {
|
|
|
|
reagent x = canonize(current_instruction().ingredients.at(0));
|
2015-07-04 16:40:50 +00:00
|
|
|
if (x.types.at(0) != Type_ordinal["array"]) {
|
2015-05-26 22:16:36 +00:00
|
|
|
raise << "tried to calculate length of non-array " << x.to_string() << '\n';
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
products.resize(1);
|
|
|
|
products.at(0).push_back(Memory[x.value]);
|
|
|
|
break;
|
|
|
|
}
|