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
|
//: Calls can take ingredients just like primitives. To access a recipe's
//: ingredients, use 'next-ingredient'.
:(scenario next_ingredient)
recipe main [
f 2
]
recipe f [
12:number <- next-ingredient
13:number <- add 1, 12:number
]
+mem: storing 3 in location 13
:(scenario next_ingredient_missing)
recipe main [
f
]
recipe f [
_, 12:number <- next-ingredient
]
+mem: storing 0 in location 12
:(before "End call Fields")
vector<vector<double> > ingredient_atoms;
long long int next_ingredient_to_process;
:(before "End call Constructor")
next_ingredient_to_process = 0;
:(after "call_housekeeping:")
for (long long int i = 0; i < SIZE(ingredients); ++i) {
Current_routine->calls.front().ingredient_atoms.push_back(ingredients.at(i));
}
:(before "End Primitive Recipe Declarations")
NEXT_INGREDIENT,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["next-ingredient"] = NEXT_INGREDIENT;
:(before "End Primitive Recipe Checks")
case NEXT_INGREDIENT: {
if (!inst.ingredients.empty()) {
raise_error << maybe(Recipe[r].name) << "'next-ingredient' didn't expect any ingredients in '" << inst.to_string() << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case NEXT_INGREDIENT: {
assert(!Current_routine->calls.empty());
if (Current_routine->calls.front().next_ingredient_to_process < SIZE(Current_routine->calls.front().ingredient_atoms)) {
products.push_back(
Current_routine->calls.front().ingredient_atoms.at(Current_routine->calls.front().next_ingredient_to_process));
assert(SIZE(products) == 1); products.resize(2); // push a new vector
products.at(1).push_back(1);
++Current_routine->calls.front().next_ingredient_to_process;
}
else {
if (SIZE(current_instruction().products) < 2)
raise_error << maybe(current_recipe_name()) << "no ingredient to save in " << current_instruction().products.at(0).original_string << '\n' << end();
if (current_instruction().products.empty()) break;
products.resize(2);
// pad the first product with sufficient zeros to match its type
long long int size = size_of(current_instruction().products.at(0));
for (long long int i = 0; i < size; ++i) {
products.at(0).push_back(0);
}
products.at(1).push_back(0);
}
break;
}
:(scenario next_ingredient_fail_on_missing)
% Hide_errors = true;
recipe main [
f
]
recipe f [
11:number <- next-ingredient
]
+error: f: no ingredient to save in 11:number
:(scenario rewind_ingredients)
recipe main [
f 2
]
recipe f [
12:number <- next-ingredient # consume ingredient
_, 1:boolean <- next-ingredient # will not find any ingredients
rewind-ingredients
13:number, 2:boolean <- next-ingredient # will find ingredient again
]
+mem: storing 2 in location 12
+mem: storing 0 in location 1
+mem: storing 2 in location 13
+mem: storing 1 in location 2
:(before "End Primitive Recipe Declarations")
REWIND_INGREDIENTS,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["rewind-ingredients"] = REWIND_INGREDIENTS;
:(before "End Primitive Recipe Checks")
case REWIND_INGREDIENTS: {
break;
}
:(before "End Primitive Recipe Implementations")
case REWIND_INGREDIENTS: {
Current_routine->calls.front().next_ingredient_to_process = 0;
break;
}
:(scenario ingredient)
recipe main [
f 1, 2
]
recipe f [
12:number <- ingredient 1 # consume second ingredient first
13:number, 1:boolean <- next-ingredient # next-ingredient tries to scan past that
]
+mem: storing 2 in location 12
+mem: storing 0 in location 1
:(before "End Primitive Recipe Declarations")
INGREDIENT,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["ingredient"] = INGREDIENT;
:(before "End Primitive Recipe Checks")
case INGREDIENT: {
if (SIZE(inst.ingredients) != 1) {
raise_error << maybe(Recipe[r].name) << "'ingredient' expects exactly one ingredient, but got '" << inst.to_string() << "'\n" << end();
break;
}
if (!is_literal(inst.ingredients.at(0)) && !is_mu_number(inst.ingredients.at(0))) {
raise_error << maybe(Recipe[r].name) << "'ingredient' expects a literal ingredient, but got " << inst.ingredients.at(0).original_string << '\n' << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case INGREDIENT: {
if (static_cast<long long int>(ingredients.at(0).at(0)) < SIZE(Current_routine->calls.front().ingredient_atoms)) {
Current_routine->calls.front().next_ingredient_to_process = ingredients.at(0).at(0);
products.push_back(
Current_routine->calls.front().ingredient_atoms.at(Current_routine->calls.front().next_ingredient_to_process));
assert(SIZE(products) == 1); products.resize(2); // push a new vector
products.at(1).push_back(1);
++Current_routine->calls.front().next_ingredient_to_process;
}
else {
if (SIZE(current_instruction().products) > 1) {
products.resize(2);
products.at(0).push_back(0); // todo: will fail noisily if we try to read a compound value
products.at(1).push_back(0);
}
}
break;
}
|