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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
|
//: Mu scenarios. This will get long, but these are the tests we want to
//: support in this layer.
//: You can use variable names in scenarios, but for the most part we'll use
//: raw location numbers, because that lets us make assertions on memory.
//: Tests should avoid abstraction as far as possible.
:(scenarios run_mu_scenario)
:(scenario scenario_block)
scenario foo [
run [
1:number <- copy 13:literal
]
memory-should-contain [
1 <- 13
]
]
# checks are inside scenario
:(scenario scenario_multiple_blocks)
scenario foo [
run [
1:number <- copy 13:literal
]
memory-should-contain [
1 <- 13
]
run [
2:number <- copy 13:literal
]
memory-should-contain [
1 <- 13
2 <- 13
]
]
:(scenario scenario_check_memory_and_trace)
scenario foo [
run [
1:number <- copy 13:literal
trace [a], [a b c]
]
memory-should-contain [
1 <- 13
]
trace-should-contain [
a: a b c
]
trace-should-not-contain [
a: x y z
]
]
//:: Core data structure
:(before "End Types")
struct scenario {
string name;
string to_run;
};
:(before "End Globals")
vector<scenario> Scenarios;
//:: Parse the 'scenario' form.
//: Simply store the text of the scenario.
:(before "End Command Handlers")
else if (command == "scenario") {
Scenarios.push_back(parse_scenario(in));
}
:(code)
scenario parse_scenario(istream& in) {
scenario result;
result.name = next_word(in);
skip_bracket(in, "'scenario' must begin with '['");
ostringstream buffer;
slurp_until_matching_bracket(in, buffer);
result.to_run = buffer.str();
return result;
}
//:: Run scenarios when we run 'mu test'.
//: Treat the text of the scenario as a regular series of instructions.
:(before "End Tests")
time_t mu_time; time(&mu_time);
cerr << "\nMu tests: " << ctime(&mu_time);
for (long long int i = 0; i < SIZE(Scenarios); ++i) {
//? cerr << Passed << '\n'; //? 1
//? cerr << i << ": " << Scenarios.at(i).name << '\n'; //? 3
run_mu_scenario(Scenarios.at(i));
if (Passed) cerr << ".";
}
//: Convenience: run a single named scenario.
:(before "Loading Commandline Files")
if (argc == 2 && Run_tests) {
for (long long int i = 0; i < SIZE(Scenarios); ++i) {
if (Scenarios.at(i).name == argv[1]) {
run_mu_scenario(Scenarios.at(i));
return 0;
}
}
}
:(before "End Globals")
const scenario* Current_scenario = NULL;
:(code)
void run_mu_scenario(const scenario& s) {
Current_scenario = &s;
bool not_already_inside_test = !Trace_stream;
if (not_already_inside_test) {
Trace_file = s.name;
Trace_stream = new trace_stream;
setup();
}
run("recipe "+s.name+" [ " + s.to_run + " ]");
if (not_already_inside_test && Trace_stream) {
teardown();
ofstream fout((Trace_dir+Trace_file).c_str());
fout << Trace_stream->readable_contents("");
fout.close();
delete Trace_stream;
Trace_stream = NULL;
Trace_file = "";
}
Current_scenario = NULL;
}
//:: The special instructions we want to support inside scenarios.
//: In a compiler for the mu VM these will require more work.
//: 'run' interprets a string as a set of instructions
:(scenarios run)
:(scenario run)
#? % Trace_stream->dump_layer = "all";
recipe main [
run [
1:number <- copy 13:literal
]
]
+mem: storing 13 in location 1
:(before "End Primitive Recipe Declarations")
RUN,
:(before "End Primitive Recipe Numbers")
Recipe_number["run"] = RUN;
:(before "End Primitive Recipe Implementations")
case RUN: {
//? cout << "recipe " << current_instruction().ingredients.at(0).name << '\n'; //? 1
ostringstream tmp;
tmp << "recipe run" << Next_recipe_number << " [ " << current_instruction().ingredients.at(0).name << " ]";
//? Show_rest_of_stream = true; //? 1
vector<recipe_number> tmp_recipe = load(tmp.str());
// Predefined Scenario Locals In Run.
// End Predefined Scenario Locals In Run.
transform_all();
//? cout << tmp_recipe.at(0) << ' ' << Recipe_number["main"] << '\n'; //? 1
Current_routine->calls.push_front(call(tmp_recipe.at(0)));
continue; // not done with caller; don't increment current_step_index()
}
:(scenario run_multiple)
recipe main [
run [
1:number <- copy 13:literal
]
run [
2:number <- copy 13:literal
]
]
+mem: storing 13 in location 1
+mem: storing 13 in location 2
//: 'memory-should-contain' raises warnings if specific locations aren't as expected
//: Also includes some special support for checking strings.
:(scenario memory_check)
% Hide_warnings = true;
recipe main [
memory-should-contain [
1 <- 13
]
]
+run: checking location 1
+warn: expected location 1 to contain 13 but saw 0
:(before "End Primitive Recipe Declarations")
MEMORY_SHOULD_CONTAIN,
:(before "End Primitive Recipe Numbers")
Recipe_number["memory-should-contain"] = MEMORY_SHOULD_CONTAIN;
:(before "End Primitive Recipe Implementations")
case MEMORY_SHOULD_CONTAIN: {
//? cout << current_instruction().ingredients.at(0).name << '\n'; //? 1
check_memory(current_instruction().ingredients.at(0).name);
break;
}
:(code)
void check_memory(const string& s) {
istringstream in(s);
in >> std::noskipws;
set<long long int> locations_checked;
while (true) {
skip_whitespace_and_comments(in);
if (in.eof()) break;
string lhs = next_word(in);
if (!is_integer(lhs)) {
check_type(lhs, in);
continue;
}
int address = to_integer(lhs);
skip_whitespace_and_comments(in);
string _assign; in >> _assign; assert(_assign == "<-");
skip_whitespace_and_comments(in);
int value = 0; in >> value;
if (locations_checked.find(address) != locations_checked.end())
raise << "duplicate expectation for location " << address << '\n';
trace("run") << "checking location " << address;
if (Memory[address] != value) {
if (Current_scenario)
raise << "\nF - " << Current_scenario->name << ": expected location " << address << " to contain " << value << " but saw " << Memory[address] << '\n';
else
raise << "expected location " << address << " to contain " << value << " but saw " << Memory[address] << '\n';
Passed = false;
return;
}
locations_checked.insert(address);
}
}
void check_type(const string& lhs, istream& in) {
reagent x(lhs);
if (x.properties.at(0).second.at(0) == "string") {
x.set_value(to_integer(x.name));
skip_whitespace_and_comments(in);
string _assign = next_word(in);
assert(_assign == "<-");
skip_whitespace_and_comments(in);
string literal = next_word(in);
long long int address = x.value;
// exclude quoting brackets
assert(*literal.begin() == '['); literal.erase(literal.begin());
assert(*--literal.end() == ']'); literal.erase(--literal.end());
check_string(address, literal);
return;
}
raise << "don't know how to check memory for " << lhs << '\n';
}
void check_string(long long int address, const string& literal) {
trace("run") << "checking string length at " << address;
if (Memory[address] != SIZE(literal))
raise << "expected location " << address << " to contain length " << SIZE(literal) << " of string [" << literal << "] but saw " << Memory[address] << '\n';
++address; // now skip length
for (long long int i = 0; i < SIZE(literal); ++i) {
trace("run") << "checking location " << address+i;
if (Memory[address+i] != literal.at(i))
raise << "expected location " << (address+i) << " to contain " << literal.at(i) << " but saw " << Memory[address+i] << '\n';
}
}
:(scenario memory_check_multiple)
% Hide_warnings = true;
recipe main [
memory-should-contain [
1 <- 0
1 <- 0
]
]
+warn: duplicate expectation for location 1
:(scenario memory_check_string_length)
% Hide_warnings = true;
recipe main [
1:number <- copy 3:literal
2:number <- copy 97:literal # 'a'
3:number <- copy 98:literal # 'b'
4:number <- copy 99:literal # 'c'
memory-should-contain [
1:string <- [ab]
]
]
+warn: expected location 1 to contain length 2 of string [ab] but saw 3
:(scenario memory_check_string)
recipe main [
1:number <- copy 3:literal
2:number <- copy 97:literal # 'a'
3:number <- copy 98:literal # 'b'
4:number <- copy 99:literal # 'c'
memory-should-contain [
1:string <- [abc]
]
]
+run: checking string length at 1
+run: checking location 2
+run: checking location 3
+run: checking location 4
:(code)
//: 'trace-should-contain' is like the '+' lines in our scenarios so far
// Like runs of contiguous '+' lines, order is important. The trace checks
// that the lines are present *and* in the specified sequence. (There can be
// other lines in between.)
//
// Be careful not to mix setting Hide_warnings and checking the trace in .mu
// files. It'll work in C++ scenarios, but the test failure gets silently
// hidden in mu scenarios.
:(scenario trace_check_warns_on_failure)
% Hide_warnings = true;
recipe main [
trace-should-contain [
a: b
a: d
]
]
+warn: missing [b] in trace layer a
:(before "End Primitive Recipe Declarations")
TRACE_SHOULD_CONTAIN,
:(before "End Primitive Recipe Numbers")
Recipe_number["trace-should-contain"] = TRACE_SHOULD_CONTAIN;
:(before "End Primitive Recipe Implementations")
case TRACE_SHOULD_CONTAIN: {
check_trace(current_instruction().ingredients.at(0).name);
break;
}
:(code)
// simplified version of check_trace_contents() that emits warnings rather
// than just printing to stderr
bool check_trace(const string& expected) {
//? cerr << "AAA " << expected << '\n'; //? 1
Trace_stream->newline();
vector<pair<string, string> > expected_lines = parse_trace(expected);
//? cerr << "BBB " << SIZE(expected_lines) << '\n'; //? 1
if (expected_lines.empty()) return true;
long long int curr_expected_line = 0;
for (vector<pair<string, pair<int, string> > >::iterator p = Trace_stream->past_lines.begin(); p != Trace_stream->past_lines.end(); ++p) {
if (expected_lines.at(curr_expected_line).first != p->first) continue;
if (expected_lines.at(curr_expected_line).second != p->second.second) continue;
// match
++curr_expected_line;
if (curr_expected_line == SIZE(expected_lines)) {
//? cerr << "ZZZ\n"; //? 1
return true;
}
}
raise << "missing [" << expected_lines.at(curr_expected_line).second << "] "
<< "in trace layer " << expected_lines.at(curr_expected_line).first << '\n';
Passed = false;
return false;
}
vector<pair<string, string> > parse_trace(const string& expected) {
vector<string> buf = split(expected, "\n");
vector<pair<string, string> > result;
for (long long int i = 0; i < SIZE(buf); ++i) {
buf.at(i) = trim(buf.at(i));
if (buf.at(i).empty()) continue;
long long int delim = buf.at(i).find(": ");
result.push_back(pair<string, string>(buf.at(i).substr(0, delim), buf.at(i).substr(delim+2)));
}
return result;
}
:(scenario trace_check_warns_on_failure_in_later_line)
% Hide_warnings = true;
recipe main [
run [
trace [a], [b]
]
trace-should-contain [
a: b
a: d
]
]
+warn: missing [d] in trace layer a
:(scenario trace_check_passes_silently)
% Hide_warnings = true;
recipe main [
run [
trace [a], [b]
]
trace-should-contain [
a: b
]
]
-warn: missing [b] in trace layer a
//: 'trace-should-not-contain' is like the '-' lines in our scenarios so far
//: Each trace line is separately checked for absense. Order is *not*
//: important, so you can't say things like "B should not exist after A."
:(scenario trace_negative_check_warns_on_failure)
% Hide_warnings = true;
recipe main [
run [
trace [a], [b]
]
trace-should-not-contain [
a: b
]
]
+warn: unexpected [b] in trace layer a
:(before "End Primitive Recipe Declarations")
TRACE_SHOULD_NOT_CONTAIN,
:(before "End Primitive Recipe Numbers")
Recipe_number["trace-should-not-contain"] = TRACE_SHOULD_NOT_CONTAIN;
:(before "End Primitive Recipe Implementations")
case TRACE_SHOULD_NOT_CONTAIN: {
check_trace_missing(current_instruction().ingredients.at(0).name);
break;
}
:(code)
// simplified version of check_trace_contents() that emits warnings rather
// than just printing to stderr
bool check_trace_missing(const string& in) {
Trace_stream->newline();
vector<pair<string, string> > lines = parse_trace(in);
for (long long int i = 0; i < SIZE(lines); ++i) {
if (trace_count(lines.at(i).first, lines.at(i).second) != 0) {
raise << "unexpected [" << lines.at(i).second << "] in trace layer " << lines.at(i).first << '\n';
Passed = false;
return false;
}
}
return true;
}
:(scenario trace_negative_check_passes_silently)
% Hide_warnings = true;
recipe main [
trace-should-not-contain [
a: b
]
]
-warn: unexpected [b] in trace layer a
:(scenario trace_negative_check_warns_on_any_unexpected_line)
% Hide_warnings = true;
recipe main [
run [
trace [a], [d]
]
trace-should-not-contain [
a: b
a: d
]
]
+warn: unexpected [d] in trace layer a
//:: Helpers
:(code)
// just for the scenarios running scenarios in C++ layers
void run_mu_scenario(const string& form) {
istringstream in(form);
in >> std::noskipws;
string _scenario = next_word(in);
//? cout << _scenario << '\n'; //? 1
assert(_scenario == "scenario");
scenario s = parse_scenario(in);
run_mu_scenario(s);
}
void slurp_until_matching_bracket(istream& in, ostream& out) {
int brace_depth = 1; // just scanned '['
char c;
while (in >> c) {
if (c == '[') ++brace_depth;
if (c == ']') --brace_depth;
if (brace_depth == 0) break; // drop final ']'
out << c;
}
}
// see tests for this function in tangle/030tangle.test.cc
string trim(const string& s) {
string::const_iterator first = s.begin();
while (first != s.end() && isspace(*first))
++first;
if (first == s.end()) return "";
string::const_iterator last = --s.end();
while (last != s.begin() && isspace(*last))
--last;
++last;
return string(first, last);
}
|