From 9570363aec35e187e2395b1760a4b94e71580ac9 Mon Sep 17 00:00:00 2001 From: "Kartik K. Agaram" Date: Wed, 29 Jul 2015 15:55:05 -0700 Subject: 1885 --- html/032array.cc.html | 191 +++++++++++++++++++++++++------------------------- 1 file changed, 95 insertions(+), 96 deletions(-) (limited to 'html/032array.cc.html') diff --git a/html/032array.cc.html b/html/032array.cc.html index b210893c..6086d339 100644 --- a/html/032array.cc.html +++ b/html/032array.cc.html @@ -13,15 +13,14 @@ pre { white-space: pre-wrap; font-family: monospace; color: #eeeeee; background-color: #080808; } body { font-family: monospace; color: #eeeeee; background-color: #080808; } * { font-size: 1.05em; } +.traceContains { color: #008000; } .cSpecial { color: #008000; } -.SalientComment { color: #00ffff; } .Constant { color: #00a0a0; } -.Normal { color: #eeeeee; background-color: #080808; padding-bottom: 1px; } +.SalientComment { color: #00ffff; } .Comment { color: #9090ff; } .Delimiter { color: #a04060; } .Special { color: #ff6060; } .Identifier { color: #804000; } -.traceContains { color: #008000; } --> @@ -47,10 +46,10 @@ body { font-family: monospace; color: #eeeeee; background-color: #080808; } # 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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 5:array:number <- copy 1:array:number/raw # unsafe ] +mem: storing 3 in location 5 @@ -60,12 +59,12 @@ recipe main [ :(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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:address:array:number <- copy 1 + 6:array:number <- copy *5:address:array:number ] +mem: storing 3 in location 6 +mem: storing 14 in location 7 @@ -73,11 +72,11 @@ recipe main [ +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_mismatch(x) Cases") +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) { + 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; } @@ -89,21 +88,21 @@ recipe main [ :(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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- index 1:array:number/raw, 0 # 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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- copy 0 6:number <- index 1:array:number/raw, 5:number # unsafe ] +mem: storing 14 in location 6 @@ -113,26 +112,26 @@ INDEX, :(before "End Primitive Recipe Numbers") Recipe_ordinal["index"] = INDEX; :(before "End Primitive Recipe Implementations") -case INDEX: { - if (SIZE(ingredients) != 2) { +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"]) { + 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<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]) { + 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); + 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; @@ -143,48 +142,48 @@ Recipe_ordinal["index"] = INDEX} :(code) -vector<type_ordinal> array_element(const vector<type_ordinal>& types) { +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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:address:array:number <- copy 1 + 6:number <- index *5:address:array:number, 1 ] +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 + 1:number <- copy 3 # 3 points + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- copy 14 + 6:number <- copy 15 + 7:number <- copy 16 + 8:address:array:point <- copy 1 + index *8:address:array:point, 4 # 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 + 1:number <- copy 3 # 3 points + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- copy 14 + 6:number <- copy 15 + 7:number <- copy 16 + 8:address:array:point <- copy 1 + index *8:address:array:point, -1 ] +warn: main: invalid index -1 @@ -192,11 +191,11 @@ recipe main [ :(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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- index-address 1:array:number/raw, 0 # unsafe ] +mem: storing 2 in location 5 @@ -205,26 +204,26 @@ 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) { +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"]) { + 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<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]) { + 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); + 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; @@ -233,30 +232,30 @@ Recipe_ordinal["index-address"] = INDEX_ :(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 + 1:number <- copy 3 # 3 points + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- copy 14 + 6:number <- copy 15 + 7:number <- copy 16 + 8:address:array:point <- copy 1 + index-address *8:address:array:point, 4 # 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 + 1:number <- copy 3 # 3 points + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 + 5:number <- copy 14 + 6:number <- copy 15 + 7:number <- copy 16 + 8:address:array:point <- copy 1 + index-address *8:address:array:point, -1 ] +warn: main: invalid index -1 @@ -264,10 +263,10 @@ recipe main [ :(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 + 1:number <- copy 3 # length + 2:number <- copy 14 + 3:number <- copy 15 + 4:number <- copy 16 5:number <- length 1:array:number/raw # unsafe ] +mem: storing 3 in location 5 @@ -277,13 +276,13 @@ LENGTH, :(before "End Primitive Recipe Numbers") Recipe_ordinal["length"] = LENGTH; :(before "End Primitive Recipe Implementations") -case LENGTH: { - if (SIZE(ingredients) != 1) { +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"]) { + if (x.types.at(0) != Type_ordinal["array"]) { raise << "tried to calculate length of non-array " << x.original_string << '\n' << end(); break; } -- cgit 1.4.1-2-gfad0