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
|
//: Boolean primitives
:(before "End Primitive Recipe Declarations")
AND,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "and", AND);
:(before "End Primitive Recipe Checks")
case AND: {
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_scalar(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'and' requires boolean ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'and' yields exactly one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'and' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case AND: {
bool result = true;
for (int i = 0; i < SIZE(ingredients); ++i)
result = result && scalar_ingredient(ingredients, i);
products.resize(1);
products.at(0).push_back(result);
break;
}
:(code)
double scalar_ingredient(const vector<vector<double> >& ingredients, int i) {
if (is_mu_address(current_instruction().ingredients.at(i)))
return ingredients.at(i).at(/*skip alloc id*/1);
return ingredients.at(i).at(0);
}
void test_and() {
run(
"def main [\n"
" 1:bool <- copy true\n"
" 2:bool <- copy false\n"
" 3:bool <- and 1:bool, 2:bool\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 3\n"
);
}
void test_and_2() {
run(
"def main [\n"
" 1:bool <- and true, true\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
void test_and_multiple() {
run(
"def main [\n"
" 1:bool <- and true, true, false\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 1\n"
);
}
void test_and_multiple_2() {
run(
"def main [\n"
" 1:bool <- and true, true, true\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
:(before "End Primitive Recipe Declarations")
OR,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "or", OR);
:(before "End Primitive Recipe Checks")
case OR: {
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_scalar(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'and' requires boolean ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
if (SIZE(inst.products) > 1) {
raise << maybe(get(Recipe, r).name) << "'or' yields exactly one product in '" << to_original_string(inst) << "'\n" << end();
break;
}
if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) {
raise << maybe(get(Recipe, r).name) << "'or' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end();
break;
}
break;
}
:(before "End Primitive Recipe Implementations")
case OR: {
bool result = false;
for (int i = 0; i < SIZE(ingredients); ++i)
result = result || scalar_ingredient(ingredients, i);
products.resize(1);
products.at(0).push_back(result);
break;
}
:(code)
void test_or() {
run(
"def main [\n"
" 1:bool <- copy true\n"
" 2:bool <- copy false\n"
" 3:bool <- or 1:bool, 2:bool\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 3\n"
);
}
void test_or_2() {
run(
"def main [\n"
" 1:bool <- or false, false\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 1\n"
);
}
void test_or_multiple() {
run(
"def main [\n"
" 1:bool <- or false, false, false\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 1\n"
);
}
void test_or_multiple_2() {
run(
"def main [\n"
" 1:bool <- or false, false, true\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 1 in location 1\n"
);
}
:(before "End Primitive Recipe Declarations")
NOT,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "not", NOT);
:(before "End Primitive Recipe Checks")
case NOT: {
if (SIZE(inst.products) != SIZE(inst.ingredients)) {
raise << "ingredients and products should match in '" << to_original_string(inst) << "'\n" << end();
break;
}
for (int i = 0; i < SIZE(inst.ingredients); ++i) {
if (!is_mu_scalar(inst.ingredients.at(i)) && !is_mu_address(inst.ingredients.at(i))) {
raise << maybe(get(Recipe, r).name) << "'not' requires ingredients that can be interpreted as boolean, but got '" << inst.ingredients.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
for (int i = 0; i < SIZE(inst.products); ++i) {
if (is_dummy(inst.products.at(i))) continue;
if (!is_mu_boolean(inst.products.at(i))) {
raise << maybe(get(Recipe, r).name) << "'not' should yield a boolean, but got '" << inst.products.at(i).original_string << "'\n" << end();
goto finish_checking_instruction;
}
}
break;
}
:(before "End Primitive Recipe Implementations")
case NOT: {
products.resize(SIZE(ingredients));
for (int i = 0; i < SIZE(ingredients); ++i) {
products.at(i).push_back(!scalar_ingredient(ingredients, i));
}
break;
}
:(code)
void test_not() {
run(
"def main [\n"
" 1:bool <- copy true\n"
" 2:bool <- not 1:bool\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 2\n"
);
}
void test_not_multiple() {
run(
"def main [\n"
" 1:bool, 2:bool, 3:bool <- not true, false, true\n"
"]\n"
);
CHECK_TRACE_CONTENTS(
"mem: storing 0 in location 1\n"
"mem: storing 1 in location 2\n"
"mem: storing 0 in location 3\n"
);
}
|