2015-03-17 03:26:59 +00:00
|
|
|
|
//: The goal of this skeleton is to make programs more easy to understand and
|
|
|
|
|
//: more malleable, easy to rewrite in radical ways without accidentally
|
|
|
|
|
//: breaking some corner case. Tests further both goals. They help
|
|
|
|
|
//: understandability by letting one make small changes and get feedback. What
|
|
|
|
|
//: if I wrote this line like so? What if I removed this function call, is it
|
|
|
|
|
//: really necessary? Just try it, see if the tests pass. Want to explore
|
|
|
|
|
//: rewriting this bit in this way? Tests put many refactorings on a firmer
|
|
|
|
|
//: footing.
|
|
|
|
|
//:
|
|
|
|
|
//: But the usual way we write tests seems incomplete. Refactorings tend to
|
|
|
|
|
//: work in the small, but don't help with changes to function boundaries. If
|
|
|
|
|
//: you want to extract a new function you have to manually test-drive it to
|
|
|
|
|
//: create tests for it. If you want to inline a function its tests are no
|
|
|
|
|
//: longer valid. In both cases you end up having to reorganize code as well as
|
|
|
|
|
//: tests, an error-prone activity.
|
|
|
|
|
//:
|
|
|
|
|
//: This file tries to fix this problem by supporting domain-driven testing
|
|
|
|
|
//: We try to focus on the domain of inputs the program should work on. All
|
|
|
|
|
//: tests invoke the program in a single way: by calling run() with different
|
|
|
|
|
//: inputs. The program operates on the input and logs _facts_ it deduces to a
|
|
|
|
|
//: trace:
|
|
|
|
|
//: trace("label") << "fact 1: " << val;
|
|
|
|
|
//:
|
|
|
|
|
//: The tests check for facts:
|
2015-05-03 18:53:15 +00:00
|
|
|
|
//: :(scenario foo)
|
2015-03-17 03:26:59 +00:00
|
|
|
|
//: 34 # call run() with this input
|
|
|
|
|
//: +label: fact 1: 34 # trace should have logged this at the end
|
|
|
|
|
//: -label: fact 1: 35 # trace should never contain such a line
|
|
|
|
|
//:
|
|
|
|
|
//: Since we never call anything but the run() function directly, we never have
|
|
|
|
|
//: to rewrite the tests when we reorganize the internals of the program. We
|
|
|
|
|
//: just have to make sure our rewrite deduces the same facts about the domain,
|
|
|
|
|
//: and that's something we're going to have to do anyway.
|
|
|
|
|
//:
|
|
|
|
|
//: To avoid the combinatorial explosion of integration tests, we organize the
|
|
|
|
|
//: program into different layers, and each fact is logged to the trace with a
|
|
|
|
|
//: specific label. Individual tests can focus on specific labels. In essence,
|
|
|
|
|
//: validating the facts logged with a specific label is identical to calling
|
|
|
|
|
//: some internal subsystem.
|
|
|
|
|
//:
|
|
|
|
|
//: Traces interact salubriously with layers. Thanks to our ordering
|
|
|
|
|
//: directives, each layer can contain its own tests. They may rely on other
|
|
|
|
|
//: layers, but when a test fails its usually due to breakage in the same
|
|
|
|
|
//: layer. When multiple tests fail, it's usually useful to debug the very
|
|
|
|
|
//: first test to fail. This is in contrast with the traditional approach,
|
|
|
|
|
//: where changes can cause breakages in faraway subsystems, and picking the
|
|
|
|
|
//: right test to debug can be an important skill to pick up.
|
|
|
|
|
//:
|
|
|
|
|
//: To build robust tests, trace facts about your domain rather than details of
|
|
|
|
|
//: how you computed them.
|
|
|
|
|
//:
|
|
|
|
|
//: More details: http://akkartik.name/blog/tracing-tests
|
|
|
|
|
//:
|
|
|
|
|
//: ---
|
|
|
|
|
//:
|
|
|
|
|
//: Between layers and domain-driven testing, programming starts to look like a
|
|
|
|
|
//: fundamentally different activity. Instead of a) superficial, b) local rules
|
|
|
|
|
//: on c) code [like http://blog.bbv.ch/2013/06/05/clean-code-cheat-sheet],
|
|
|
|
|
//: we allow programmers to engage with the a) deep, b) global structure of the
|
|
|
|
|
//: c) domain. If you can systematically track discontinuities in the domain
|
|
|
|
|
//: you don't care if the code used gotos as long as it passed the tests. If
|
|
|
|
|
//: tests become more robust to run it becomes easier to try out radically
|
|
|
|
|
//: different implementations for the same program. If code is super-easy to
|
|
|
|
|
//: rewrite, it becomes less important what indentation style it uses, or that
|
|
|
|
|
//: the objects are appropriately encapsulated, or that the functions are
|
|
|
|
|
//: referentially transparent.
|
|
|
|
|
//:
|
|
|
|
|
//: Instead of plumbing, programming becomes building and gradually refining a
|
|
|
|
|
//: map of the environment the program must operate under. Whether a program is
|
|
|
|
|
//: 'correct' at a given point in time is a red herring; what matters is
|
|
|
|
|
//: avoiding regression by monotonically nailing down the more 'eventful' parts
|
|
|
|
|
//: of the terrain. It helps readers new and old and rewards curiosity to
|
|
|
|
|
//: organize large programs in self-similar hiearchies of example scenarios
|
|
|
|
|
//: colocated with the code that makes them work.
|
|
|
|
|
//:
|
|
|
|
|
//: "Programming properly should be regarded as an activity by which
|
|
|
|
|
//: programmers form a mental model, rather than as production of a program."
|
|
|
|
|
//: -- Peter Naur (http://alistair.cockburn.us/ASD+book+extract%3A+%22Naur,+Ehn,+Musashi%22)
|
2015-02-18 00:57:37 +00:00
|
|
|
|
|
|
|
|
|
:(before "int main")
|
|
|
|
|
// End Tracing // hack to ensure most code in this layer comes before anything else
|
|
|
|
|
|
|
|
|
|
:(before "End Tracing")
|
|
|
|
|
bool Hide_warnings = false;
|
|
|
|
|
:(before "End Setup")
|
|
|
|
|
Hide_warnings = false;
|
|
|
|
|
|
2015-05-22 01:10:17 +00:00
|
|
|
|
:(before "End Types")
|
|
|
|
|
struct trace_line {
|
2015-05-22 01:57:25 +00:00
|
|
|
|
int depth; // optional field just to help browse traces later
|
2015-05-22 01:10:17 +00:00
|
|
|
|
string label;
|
|
|
|
|
string contents;
|
2015-05-22 01:57:25 +00:00
|
|
|
|
trace_line(string l, string c) :depth(0), label(l), contents(c) {}
|
|
|
|
|
trace_line(int d, string l, string c) :depth(d), label(l), contents(c) {}
|
2015-05-22 01:10:17 +00:00
|
|
|
|
};
|
|
|
|
|
|
2015-02-18 00:57:37 +00:00
|
|
|
|
:(before "End Tracing")
|
|
|
|
|
struct trace_stream {
|
2015-05-22 01:10:17 +00:00
|
|
|
|
vector<trace_line> past_lines;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
// accumulator for current line
|
|
|
|
|
ostringstream* curr_stream;
|
|
|
|
|
string curr_layer;
|
2015-05-22 01:57:25 +00:00
|
|
|
|
int curr_depth;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
string dump_layer;
|
2015-08-02 22:26:58 +00:00
|
|
|
|
set<string> collect_layers; // if not empty, ignore all absent layers
|
2015-07-14 22:51:15 +00:00
|
|
|
|
ofstream null_stream; // never opens a file, so writes silently fail
|
2015-05-22 01:57:25 +00:00
|
|
|
|
trace_stream() :curr_stream(NULL), curr_depth(0) {}
|
2015-02-18 00:57:37 +00:00
|
|
|
|
~trace_stream() { if (curr_stream) delete curr_stream; }
|
|
|
|
|
|
2015-07-14 22:51:15 +00:00
|
|
|
|
ostream& stream(string layer) {
|
2015-05-22 01:57:25 +00:00
|
|
|
|
return stream(0, layer);
|
|
|
|
|
}
|
|
|
|
|
|
2015-07-14 22:51:15 +00:00
|
|
|
|
ostream& stream(int depth, string layer) {
|
2015-08-02 22:26:58 +00:00
|
|
|
|
if (!is_collecting(layer)) return null_stream;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
curr_stream = new ostringstream;
|
|
|
|
|
curr_layer = layer;
|
2015-05-22 01:57:25 +00:00
|
|
|
|
curr_depth = depth;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
return *curr_stream;
|
|
|
|
|
}
|
|
|
|
|
|
2015-08-02 22:26:58 +00:00
|
|
|
|
bool is_collecting(const string& layer) {
|
|
|
|
|
return collect_layers.empty() || collect_layers.find(layer) != collect_layers.end();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool is_narrowly_collecting(const string& layer) {
|
|
|
|
|
return collect_layers.find(layer) != collect_layers.end();
|
|
|
|
|
}
|
|
|
|
|
|
2015-05-21 18:29:19 +00:00
|
|
|
|
// be sure to call this before messing with curr_stream or curr_layer
|
2015-02-18 00:57:37 +00:00
|
|
|
|
void newline() {
|
|
|
|
|
if (!curr_stream) return;
|
2015-04-13 06:29:34 +00:00
|
|
|
|
string curr_contents = curr_stream->str();
|
2015-07-25 07:02:20 +00:00
|
|
|
|
if (curr_contents.empty()) return;
|
2015-05-22 01:57:25 +00:00
|
|
|
|
past_lines.push_back(trace_line(curr_depth, trim(curr_layer), curr_contents)); // preserve indent in contents
|
2015-03-15 16:43:05 +00:00
|
|
|
|
if (curr_layer == dump_layer || curr_layer == "dump" || dump_layer == "all" ||
|
2015-02-18 00:57:37 +00:00
|
|
|
|
(!Hide_warnings && curr_layer == "warn"))
|
2015-05-21 18:29:19 +00:00
|
|
|
|
cerr << curr_layer << ": " << curr_contents << '\n';
|
2015-02-18 00:57:37 +00:00
|
|
|
|
delete curr_stream;
|
|
|
|
|
curr_stream = NULL;
|
2015-05-22 01:57:25 +00:00
|
|
|
|
curr_layer.clear();
|
|
|
|
|
curr_depth = 0;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Useful for debugging.
|
2015-05-22 00:56:26 +00:00
|
|
|
|
string readable_contents(string layer) { // missing layer = everything
|
2015-02-18 00:57:37 +00:00
|
|
|
|
ostringstream output;
|
2015-05-22 00:56:26 +00:00
|
|
|
|
layer = trim(layer);
|
2015-05-22 01:10:17 +00:00
|
|
|
|
for (vector<trace_line>::iterator p = past_lines.begin(); p != past_lines.end(); ++p)
|
|
|
|
|
if (layer.empty() || layer == p->label) {
|
2015-05-22 01:57:25 +00:00
|
|
|
|
if (p->depth)
|
|
|
|
|
output << std::setw(4) << p->depth << ' ';
|
2015-05-22 01:10:17 +00:00
|
|
|
|
output << p->label << ": " << p->contents << '\n';
|
|
|
|
|
}
|
2015-02-18 00:57:37 +00:00
|
|
|
|
return output.str();
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
trace_stream* Trace_stream = NULL;
|
|
|
|
|
|
|
|
|
|
// Top-level helper. IMPORTANT: can't nest.
|
2015-05-22 01:57:25 +00:00
|
|
|
|
#define trace(...) !Trace_stream ? cerr /*print nothing*/ : Trace_stream->stream(__VA_ARGS__)
|
2015-02-18 00:57:37 +00:00
|
|
|
|
// Warnings should go straight to cerr by default since calls to trace() have
|
|
|
|
|
// some unfriendly constraints (they delay printing, they can't nest)
|
2015-06-24 23:55:18 +00:00
|
|
|
|
#define raise ((!Trace_stream || !Hide_warnings) ? (tb_shutdown(),cerr) /*do print*/ : Trace_stream->stream("warn"))
|
2015-02-18 00:57:37 +00:00
|
|
|
|
|
|
|
|
|
:(before "End Types")
|
2015-07-25 07:02:20 +00:00
|
|
|
|
struct end {};
|
2015-02-18 00:57:37 +00:00
|
|
|
|
:(before "End Tracing")
|
2015-07-25 07:02:20 +00:00
|
|
|
|
ostream& operator<<(ostream& os, unused end) {
|
2015-02-18 00:57:37 +00:00
|
|
|
|
if (Trace_stream) Trace_stream->newline();
|
2015-07-25 07:02:20 +00:00
|
|
|
|
return os;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define CLEAR_TRACE delete Trace_stream, Trace_stream = new trace_stream;
|
|
|
|
|
|
2015-03-15 02:34:17 +00:00
|
|
|
|
#define DUMP(layer) if (Trace_stream) cerr << Trace_stream->readable_contents(layer);
|
2015-02-18 00:57:37 +00:00
|
|
|
|
|
2015-05-28 20:25:23 +00:00
|
|
|
|
// All scenarios save their traces in the repo, just like code. This gives
|
|
|
|
|
// future readers more meat when they try to make sense of a new project.
|
2015-02-19 23:36:49 +00:00
|
|
|
|
static string Trace_dir = ".traces/";
|
2015-05-28 20:25:23 +00:00
|
|
|
|
string Trace_file;
|
|
|
|
|
|
|
|
|
|
// Trace_stream is a resource, lease_tracer uses RAII to manage it.
|
2015-02-18 00:57:37 +00:00
|
|
|
|
struct lease_tracer {
|
|
|
|
|
lease_tracer() { Trace_stream = new trace_stream; }
|
2015-02-19 23:36:49 +00:00
|
|
|
|
~lease_tracer() {
|
2015-08-25 02:38:02 +00:00
|
|
|
|
if (!Trace_stream) return; // in case tests close Trace_stream
|
2015-02-19 23:36:49 +00:00
|
|
|
|
if (!Trace_file.empty()) {
|
|
|
|
|
ofstream fout((Trace_dir+Trace_file).c_str());
|
|
|
|
|
fout << Trace_stream->readable_contents("");
|
|
|
|
|
fout.close();
|
|
|
|
|
}
|
|
|
|
|
delete Trace_stream, Trace_stream = NULL, Trace_file = "";
|
|
|
|
|
}
|
2015-02-18 00:57:37 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#define START_TRACING_UNTIL_END_OF_SCOPE lease_tracer leased_tracer;
|
|
|
|
|
:(before "End Test Setup")
|
2015-04-08 18:17:00 +00:00
|
|
|
|
START_TRACING_UNTIL_END_OF_SCOPE
|
2015-02-18 00:57:37 +00:00
|
|
|
|
|
2015-09-12 21:58:33 +00:00
|
|
|
|
:(before "End Includes")
|
2015-05-21 18:37:50 +00:00
|
|
|
|
#define CHECK_TRACE_CONTENTS(...) check_trace_contents(__FUNCTION__, __FILE__, __LINE__, __VA_ARGS__)
|
|
|
|
|
|
2015-02-18 00:57:37 +00:00
|
|
|
|
:(before "End Tracing")
|
2015-05-21 18:29:19 +00:00
|
|
|
|
bool check_trace_contents(string FUNCTION, string FILE, int LINE, string expected) { // missing layer == anywhere
|
2015-09-16 02:48:53 +00:00
|
|
|
|
if (!Trace_stream) return false;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
vector<string> expected_lines = split(expected, "");
|
2015-05-17 09:22:41 +00:00
|
|
|
|
long long int curr_expected_line = 0;
|
|
|
|
|
while (curr_expected_line < SIZE(expected_lines) && expected_lines.at(curr_expected_line).empty())
|
2015-02-18 00:57:37 +00:00
|
|
|
|
++curr_expected_line;
|
2015-05-17 09:22:41 +00:00
|
|
|
|
if (curr_expected_line == SIZE(expected_lines)) return true;
|
2015-05-21 18:29:19 +00:00
|
|
|
|
string layer, contents;
|
|
|
|
|
split_layer_contents(expected_lines.at(curr_expected_line), &layer, &contents);
|
2015-05-22 01:10:17 +00:00
|
|
|
|
for (vector<trace_line>::iterator p = Trace_stream->past_lines.begin(); p != Trace_stream->past_lines.end(); ++p) {
|
|
|
|
|
if (layer != p->label)
|
2015-02-18 00:57:37 +00:00
|
|
|
|
continue;
|
|
|
|
|
|
2015-05-22 01:10:17 +00:00
|
|
|
|
if (contents != trim(p->contents))
|
2015-02-18 00:57:37 +00:00
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
++curr_expected_line;
|
2015-05-17 09:22:41 +00:00
|
|
|
|
while (curr_expected_line < SIZE(expected_lines) && expected_lines.at(curr_expected_line).empty())
|
2015-02-18 00:57:37 +00:00
|
|
|
|
++curr_expected_line;
|
2015-05-17 09:22:41 +00:00
|
|
|
|
if (curr_expected_line == SIZE(expected_lines)) return true;
|
2015-05-21 18:29:19 +00:00
|
|
|
|
split_layer_contents(expected_lines.at(curr_expected_line), &layer, &contents);
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
++Num_failures;
|
2015-05-12 15:47:06 +00:00
|
|
|
|
cerr << "\nF - " << FUNCTION << "(" << FILE << ":" << LINE << "): missing [" << contents << "] in trace:\n";
|
2015-02-18 00:57:37 +00:00
|
|
|
|
DUMP(layer);
|
|
|
|
|
Passed = false;
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2015-05-21 18:29:19 +00:00
|
|
|
|
void split_layer_contents(const string& s, string* layer, string* contents) {
|
|
|
|
|
static const string delim(": ");
|
2015-05-17 09:22:41 +00:00
|
|
|
|
size_t pos = s.find(delim);
|
|
|
|
|
if (pos == string::npos) {
|
2015-05-21 18:29:19 +00:00
|
|
|
|
*layer = "";
|
2015-05-21 19:36:59 +00:00
|
|
|
|
*contents = trim(s);
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
else {
|
2015-05-21 19:36:59 +00:00
|
|
|
|
*layer = trim(s.substr(0, pos));
|
|
|
|
|
*contents = trim(s.substr(pos+SIZE(delim)));
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int trace_count(string layer) {
|
|
|
|
|
return trace_count(layer, "");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int trace_count(string layer, string line) {
|
|
|
|
|
long result = 0;
|
2015-05-22 01:10:17 +00:00
|
|
|
|
for (vector<trace_line>::iterator p = Trace_stream->past_lines.begin(); p != Trace_stream->past_lines.end(); ++p) {
|
2015-06-28 01:06:28 +00:00
|
|
|
|
if (layer == p->label) {
|
|
|
|
|
if (line == "" || line == trim(p->contents))
|
2015-02-18 00:57:37 +00:00
|
|
|
|
++result;
|
2015-06-28 01:06:28 +00:00
|
|
|
|
}
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define CHECK_TRACE_WARNS() CHECK(trace_count("warn") > 0)
|
|
|
|
|
#define CHECK_TRACE_DOESNT_WARN() \
|
|
|
|
|
if (trace_count("warn") > 0) { \
|
|
|
|
|
++Num_failures; \
|
2015-05-12 15:47:06 +00:00
|
|
|
|
cerr << "\nF - " << __FUNCTION__ << "(" << __FILE__ << ":" << __LINE__ << "): unexpected warnings\n"; \
|
2015-02-18 00:57:37 +00:00
|
|
|
|
DUMP("warn"); \
|
|
|
|
|
Passed = false; \
|
|
|
|
|
return; \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool trace_doesnt_contain(string layer, string line) {
|
|
|
|
|
return trace_count(layer, line) == 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool trace_doesnt_contain(string expected) {
|
2015-09-12 21:39:20 +00:00
|
|
|
|
vector<string> tmp = split_first(expected, ": ");
|
2015-05-07 22:49:40 +00:00
|
|
|
|
return trace_doesnt_contain(tmp.at(0), tmp.at(1));
|
2015-02-18 00:57:37 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define CHECK_TRACE_DOESNT_CONTAIN(...) CHECK(trace_doesnt_contain(__VA_ARGS__))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
vector<string> split(string s, string delim) {
|
|
|
|
|
vector<string> result;
|
2015-05-17 09:22:41 +00:00
|
|
|
|
size_t begin=0, end=s.find(delim);
|
2015-02-18 00:57:37 +00:00
|
|
|
|
while (true) {
|
2015-05-17 09:22:41 +00:00
|
|
|
|
if (end == string::npos) {
|
|
|
|
|
result.push_back(string(s, begin, string::npos));
|
2015-02-18 00:57:37 +00:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
result.push_back(string(s, begin, end-begin));
|
2015-09-12 21:39:20 +00:00
|
|
|
|
begin = end+SIZE(delim);
|
2015-02-18 00:57:37 +00:00
|
|
|
|
end = s.find(delim, begin);
|
|
|
|
|
}
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
2015-09-12 21:39:20 +00:00
|
|
|
|
vector<string> split_first(string s, string delim) {
|
|
|
|
|
vector<string> result;
|
|
|
|
|
size_t end=s.find(delim);
|
|
|
|
|
result.push_back(string(s, 0, end));
|
|
|
|
|
if (end != string::npos)
|
|
|
|
|
result.push_back(string(s, end+SIZE(delim), string::npos));
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
2015-05-21 19:36:59 +00:00
|
|
|
|
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);
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-18 00:57:37 +00:00
|
|
|
|
:(before "End Includes")
|
|
|
|
|
#include<vector>
|
|
|
|
|
using std::vector;
|
|
|
|
|
#include<list>
|
|
|
|
|
using std::list;
|
2015-04-25 00:09:17 +00:00
|
|
|
|
#include<map>
|
|
|
|
|
using std::map;
|
|
|
|
|
#include<set>
|
|
|
|
|
using std::set;
|
2015-02-18 00:57:37 +00:00
|
|
|
|
#include<algorithm>
|
|
|
|
|
|
|
|
|
|
#include<iostream>
|
|
|
|
|
using std::istream;
|
|
|
|
|
using std::ostream;
|
|
|
|
|
using std::cin;
|
|
|
|
|
using std::cout;
|
|
|
|
|
using std::cerr;
|
2015-05-22 01:10:17 +00:00
|
|
|
|
#include<iomanip>
|
2015-02-18 00:57:37 +00:00
|
|
|
|
|
|
|
|
|
#include<sstream>
|
|
|
|
|
using std::istringstream;
|
|
|
|
|
using std::ostringstream;
|
|
|
|
|
|
|
|
|
|
#include<fstream>
|
|
|
|
|
using std::ifstream;
|
|
|
|
|
using std::ofstream;
|
|
|
|
|
|
2015-06-21 07:24:12 +00:00
|
|
|
|
#include"termbox/termbox.h"
|
|
|
|
|
|
2015-02-18 00:57:37 +00:00
|
|
|
|
#define unused __attribute__((unused))
|
2015-05-22 01:57:25 +00:00
|
|
|
|
|
|
|
|
|
:(before "End Globals")
|
|
|
|
|
//: In future layers we'll use the depth field as follows:
|
|
|
|
|
//:
|
|
|
|
|
//: Mu 'applications' will be able to use depths 1-99 as they like.
|
|
|
|
|
//: Depth 100 will be for scheduling (more on that later).
|
|
|
|
|
const int Scheduling_depth = 100;
|
|
|
|
|
//: Primitive statements will occupy 101-9998
|
|
|
|
|
const int Initial_callstack_depth = 101;
|
|
|
|
|
const int Max_callstack_depth = 9998;
|
|
|
|
|
//: (ignore this until the call layer)
|
|
|
|
|
:(before "End Globals")
|
|
|
|
|
int Callstack_depth = 0;
|
|
|
|
|
:(before "End Setup")
|
|
|
|
|
Callstack_depth = 0;
|
|
|
|
|
//: Finally, details of primitive mu statements will occupy depth 9999 (more on that later as well)
|
|
|
|
|
:(before "End Globals")
|
|
|
|
|
const int Primitive_recipe_depth = 9999;
|
|
|
|
|
//:
|
|
|
|
|
//: This framework should help us hide some details at each level, mixing
|
|
|
|
|
//: static ideas like layers with the dynamic notion of call-stack depth.
|