about summary refs log tree commit diff stats
path: root/arc/.traces/string-equal-reflexive
blob: 48c7159a4ae0772d76c0fb1fec24832cbd12bf11 (plain) (blame)
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
c{0: 0 (((1 string-address)) <- ((new)) ab) -- nil
c{0: 1 (((3 boolean)) <- ((string-equal)) ((1 string-address)) ((1 string-address))) -- nil
c{1: 0 ✓ (((1 string-address)) <- ((new)) ab)
c{1: 1 ✓ (((3 boolean)) <- ((string-equal)) ((1 string-address)) ((1 string-address)))
cn0: convert-names in main
cn0: (((1 string-address)) <- ((new)) ab) nil nil
cn0: checking arg ab
cn0: checking oarg ((1 string-address))
maybe-add: ((1 string-address))
cn0: (((3 boolean)) <- ((string-equal)) ((1 string-address)) ((1 string-address))) nil nil
cn0: checking arg ((1 string-address))
maybe-add: ((1 string-address))
cn0: checking arg ((1 string-address))
maybe-add: ((1 string-address))
cn0: checking oarg ((3 boolean))
maybe-add: ((3 boolean))
cn1: (((1 string-address)) <- ((new)) ab)
cn1: (((3 boolean)) <- ((string-equal)) ((1 string-address)) ((1 string-address)))
schedule: main
run: main 0: (((1 string-address)) <- ((new)) ab)
run: main 0: 1000 => ((1 string-address))
mem: ((1 string-address)): 1 <= 1000
run: main 1: (((3 boolean)) <- ((string-equal)) ((1 string-address)) ((1 string-address)))
mem: ((1 string-address)) => 1000
mem: ((1 string-address)) => 1000
run: string-equal/main 0: (((default-space space-address)) <- ((new)) ((space literal)) ((30 literal)))
run: string-equal/main 0: 1003 => ((default-space space-address))
run: string-equal/main 1: (((1 string-address)) <- ((next-input)))
arg: nil 0 (1000 1000)
run: string-equal/main 1: 1000 => ((1 string-address))
mem: ((1 string-address)): 1005 <= 1000
run: string-equal/main 2: (((2 integer)) <- ((length)) ((1 string-address) (deref)))
array-len: ((1 string-address) (deref))
mem: ((1000 integer) (raw)) => 2
run: string-equal/main 2: 2 => ((2 integer))
mem: ((2 integer)): 1006 <= 2
run: string-equal/main 3: (((3 string-address)) <- ((next-input)))
arg: nil 1 (1000 1000)
run: string-equal/main 3: 1000 => ((3 string-address))
mem: ((3 string-address)): 1007 <= 1000
run: string-equal/main 4: (((4 integer)) <- ((length)) ((3 string-address) (deref)))
array-len: ((3 string-address) (deref))
mem: ((1000 integer) (raw)) => 2
run: string-equal/main 4: 2 => ((4 integer))
mem: ((4 integer)): 1008 <= 2
run: string-equal/main 5: (((5 boolean)) <- ((equal)) ((2 integer)) ((4 integer)))
mem: ((2 integer)) => 2
mem: ((4 integer)) => 2
run: string-equal/main 5: t => ((5 boolean))
mem: ((5 boolean)): 1009 <= t
run: string-equal/main 6: (((jump-if)) ((5 boolean)) ((1 offset)))
mem: ((5 boolean)) => t
run: string-equal/main 8: (((6 integer)) <- ((copy)) ((0 literal)))
run: string-equal/main 8: 0 => ((6 integer))
mem: ((6 integer)): 1010 <= 0
run: string-equal/main 9: (((7 boolean)) <- ((greater-or-equal)) ((6 integer)) ((2 integer)))
mem: ((6 integer)) => 0
mem: ((2 integer)) => 2
run: string-equal/main 9: nil => ((7 boolean))
mem: ((7 boolean)): 1011 <= nil
run: string-equal/main 10: (((jump-if)) ((7 boolean)) ((7 offset)))
mem: ((7 boolean)) => nil
run: string-equal/main 11: (((8 byte)) <- ((index)) ((1 string-address) (deref)) ((6 integer)))
mem: ((6 integer)) => 0
array-len: ((1000 string) (raw))
mem: ((1000 integer) (raw)) => 2
mem: ((1001 byte) (raw)) => a
run: string-equal/main 11: #\a => ((8 byte))
mem: ((8 byte)): 1012 <= #\a
run: string-equal/main 12: (((9 byte)) <- ((index)) ((3 string-address) (deref)) ((6 integer)))
mem: ((6 integer)) => 0
array-len: ((1000 string) (raw))
mem: ((1000 integer) (raw)) => 2
mem: ((1001 byte) (raw)) => a
run: string-equal/main 12: #\a => ((9 byte))
mem: ((9 byte)): 1013 <= #\a
run: string-equal/main 13: (((10 boolean)) <- ((equal)) ((8 byte)) ((9 byte)))
mem: ((8 byte)) => a
mem: ((9 byte)) => a
run: string-equal/main 13: t => ((10 boolean))
mem: ((10 boolean)): 1014 <= t
run: string-equal/main 14: (((jump-if)) ((10 boolean)) ((1 offset)))
mem: ((10 boolean)) => t
run: string-equal/main 16: (((6 integer)) <- ((add)) ((6 integer)) ((1 literal)))
mem: ((6 integer)) => 0
run: string-equal/main 16: 1 => ((6 integer))
mem: ((6 integer)): 1010 <= 1
run: string-equal/main 17: (((jump)) ((-9 offset)))
run: string-equal/main 9: (((7 boolean)) <- ((greater-or-equal)) ((6 integer)) ((2 integer)))
mem: ((6 integer)) => 1
mem: ((2 integer)) => 2
run: string-equal/main 9: nil => ((7 boolean))
mem: ((7 boolean)): 1011 <= nil
run: string-equal/main 10: (((jump-if)) ((7 boolean)) ((7 offset)))
mem: ((7 boolean)) => nil
run: string-equal/main 11: (((8 byte)) <- ((index)) ((1 string-address) (deref)) ((6 integer)))
mem: ((6 integer)) => 1
array-len: ((1000 string) (raw))
mem: ((1000 integer) (raw)) => 2
mem: ((1002 byte) (raw)) => b
run: string-equal/main 11: #\b => ((8 byte))
mem: ((8 byte)): 1012 <= #\b
run: string-equal/main 12: (((9 byte)) <- ((index)) ((3 string-address) (deref)) ((6 integer)))
mem: ((6 integer)) => 1
array-len: ((1000 string) (raw))
mem: ((1000 integer) (raw)) => 2
mem: ((1002 byte) (raw)) => b
run: string-equal/main 12: #\b => ((9 byte))
mem: ((9 byte)): 1013 <= #\b
run: string-equal/main 13: (((10 boolean)) <- ((equal)) ((8 byte)) ((9 byte)))
mem: ((8 byte)) => b
mem: ((9 byte)) => b
run: string-equal/main 13: t => ((10 boolean))
mem: ((10 boolean)): 1014 <= t
run: string-equal/main 14: (((jump-if)) ((10 boolean)) ((1 offset)))
mem: ((10 boolean)) => t
run: string-equal/main 16: (((6 integer)) <- ((add)) ((6 integer)) ((1 literal)))
mem: ((6 integer)) => 1
run: string-equal/main 16: 2 => ((6 integer))
mem: ((6 integer)): 1010 <= 2
run: string-equal/main 17: (((jump)) ((-9 offset)))
run: string-equal/main 9: (((7 boolean)) <- ((greater-or-equal)) ((6 integer)) ((2 integer)))
mem: ((6 integer)) => 2
mem: ((2 integer)) => 2
run: string-equal/main 9: t => ((7 boolean))
mem: ((7 boolean)): 1011 <= t
run: string-equal/main 10: (((jump-if)) ((7 boolean)) ((7 offset)))
mem: ((7 boolean)) => t
run: string-equal/main 18: (((reply)) ((t literal)))
run: main 1: t => ((3 boolean))
mem: ((3 boolean)): 3 <= t
schedule: done with routine nil
, 30 0:space/names:new-counter <- next-ingredient # outer space must be created by 'new-counter' above y:num/space:1 <- add y:num/space:1, 1 # increment y:num <- copy 234 # dummy return y:num/space:1 ] +name: lexically surrounding space for recipe increment-counter comes from new-counter +mem: storing 15 in location 11 //: To make this work, compute the recipe that provides names for the //: surrounding space of each recipe. :(before "End Globals") map<recipe_ordinal, recipe_ordinal> Surrounding_space; // internal to transform; no need to snapshot :(before "End Reset") Surrounding_space.clear(); :(before "Begin Type Modifying Transforms") Transform.push_back(collect_surrounding_spaces); // idempotent :(code) void collect_surrounding_spaces(const recipe_ordinal r) { trace(9991, "transform") << "--- collect surrounding spaces for recipe " << get(Recipe, r).name << end(); for (int i = 0; i < SIZE(get(Recipe, r).steps); ++i) { const instruction& inst = get(Recipe, r).steps.at(i); if (inst.is_label) continue; for (int j = 0; j < SIZE(inst.products); ++j) { if (is_literal(inst.products.at(j))) continue; if (inst.products.at(j).name != "0") continue; if (!is_mu_space(inst.products.at(j))) { raise << "slot 0 should always have type address:array:location, but is '" << to_string(inst.products.at(j)) << "'\n" << end(); continue; } string_tree* s = property(inst.products.at(j), "names"); if (!s) { raise << "slot 0 requires a /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); continue; } if (!s->atom) raise << "slot 0 should have a single value in /names, but got '" << to_string(inst.products.at(j)) << "'\n" << end(); const string& surrounding_recipe_name = s->value; if (surrounding_recipe_name.empty()) { raise << "slot 0 doesn't initialize its /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); continue; } if (contains_key(Surrounding_space, r) && get(Surrounding_space, r) != get(Recipe_ordinal, surrounding_recipe_name)) { raise << "recipe '" << get(Recipe, r).name << "' can have only one 'surrounding' recipe but has '" << get(Recipe, get(Surrounding_space, r)).name << "' and '" << surrounding_recipe_name << "'\n" << end(); continue; } trace(9993, "name") << "lexically surrounding space for recipe " << get(Recipe, r).name << " comes from " << surrounding_recipe_name << end(); if (!contains_key(Recipe_ordinal, surrounding_recipe_name)) { raise << "can't find recipe providing surrounding space for '" << get(Recipe, r).name << "'; looking for '" << surrounding_recipe_name << "'\n" << end(); continue; } put(Surrounding_space, r, get(Recipe_ordinal, surrounding_recipe_name)); } } } //: Once surrounding spaces are available, transform_names uses them to handle //: /space properties. :(replace{} "int lookup_name(const reagent& r, const recipe_ordinal default_recipe)") int lookup_name(const reagent& x, const recipe_ordinal default_recipe) { if (!has_property(x, "space")) { if (Name[default_recipe].empty()) raise << "name not found: " << x.name << '\n' << end(); return Name[default_recipe][x.name]; } string_tree* p = property(x, "space"); if (!p || !p->atom) raise << "/space property should have exactly one (non-negative integer) value\n" << end(); int n = to_integer(p->value); assert(n >= 0); recipe_ordinal surrounding_recipe = lookup_surrounding_recipe(default_recipe, n); if (surrounding_recipe == -1) return -1; set<recipe_ordinal> done; vector<recipe_ordinal> path; return lookup_name(x, surrounding_recipe, done, path); } // If the recipe we need to lookup this name in doesn't have names done yet, // recursively call transform_names on it. int lookup_name(const reagent& x, const recipe_ordinal r, set<recipe_ordinal>& done, vector<recipe_ordinal>& path) { if (!Name[r].empty()) return Name[r][x.name]; if (contains_key(done, r)) { raise << "can't compute address of '" << to_string(x) << "' because\n" << end(); for (int i = 1; i < SIZE(path); ++i) { raise << path.at(i-1) << " requires computing names of " << path.at(i) << '\n' << end(); } raise << path.at(SIZE(path)-1) << " requires computing names of " << r << "..ad infinitum\n" << end(); return -1; } done.insert(r); path.push_back(r); transform_names(r); // Not passing 'done' through. Might this somehow cause an infinite loop? assert(!Name[r].empty()); return Name[r][x.name]; } recipe_ordinal lookup_surrounding_recipe(const recipe_ordinal r, int n) { if (n == 0) return r; if (!contains_key(Surrounding_space, r)) { raise << "don't know surrounding recipe of '" << get(Recipe, r).name << "'\n" << end(); return -1; } assert(contains_key(Surrounding_space, r)); return lookup_surrounding_recipe(get(Surrounding_space, r), n-1); } //: weaken use-before-set detection just a tad :(replace{} "bool already_transformed(const reagent& r, const map<string, int>& names)") bool already_transformed(const reagent& r, const map<string, int>& names) { if (has_property(r, "space")) { string_tree* p = property(r, "space"); if (!p || !p->atom) { raise << "/space property should have exactly one (non-negative integer) value in '" << r.original_string << "'\n" << end(); return false; } if (p->value != "0") return true; } return contains_key(names, r.name); } :(scenario missing_surrounding_space) % Hide_errors = true; def f [ local-scope x:num/space:1 <- copy 34 ] +error: don't know surrounding recipe of 'f' +error: f: can't find a place to store 'x' //: extra test for try_reclaim_locals() from previous layers :(scenario local_scope_ignores_nonlocal_spaces) def new-scope [ local-scope x:&:num <- new number:type *x:&:num <- copy 34 return default-space:space ] def use-scope [ local-scope outer:space/names:new-scope <- next-ingredient 0:space/names:new-scope <- copy outer:space return *x:&:num/space:1 ] def main [ 1:space/raw <- new-scope 3:num/raw <- use-scope 1:space/raw ] +mem: storing 34 in location 3 :(scenario recursive_transform_names) def foo [ local-scope x:num <- copy 0 return default-space:space/names:foo ] def main [ local-scope 0:space/names:foo <- foo x:num/space:1 <- copy 34 ] $error: 0