counters.mu - mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

about summary refs log blame commit diff stats

path: root/counters.mu

blob: b69b2eee94eb9d4fb936fe373c8099e75a196be7 (plain) (tree)

b96af395 ^

d1c12218 ^

455fbac6 ^

1ae2ff1c ^

b96af395 ^

d1c12218 ^

455fbac6 ^

77d5b5d6 ^

1ae2ff1c ^

455fbac6 ^

b7830945 ^

b96af395 ^

d1c12218 ^

b96af395 ^

77d5b5d6 ^

b96af395 ^

455fbac6 ^

b96af395 ^

455fbac6 ^

b96af395 ^

ce87c19e ^

b96af395 ^

d2244a2f ^

ce87c19e ^

b96af# example program: maintain multiple counters with isolated lexical scopes
# (spaces)

recipe new-counter n:number -> default-space:address:shared:array:location [
  default-space <- new location:type, 30
  load-ingredients
]

recipe increment-counter outer:address:shared:array:location/names:new-counter, x:number -> n:number/space:1 [
  local-scope
  load-ingredients
  0:address:shared:array:location/names:new-counter <- copy outer  # setup outer space; it *must* come from 'new-counter'
  n/space:1 <- add n/space:1, x
]

recipe main [
  local-scope
  # counter A
  a:address:shared:array:location <- new-counter 34
  # counter B
  b:address:shared:array:location <- new-counter 23
  # increment both by 2 but in different ways
  increment-counter a, 1
  b-value:number <- increment-counter b, 2
  a-value:number <- increment-counter a, 1
  # check results
  $print [Contents of counters
]
  # trailing space in next line is to help with syntax highlighting
  $print [a: ], a-value, [ b: ], b-value, [ 
]
]

n class="p">{} ~trace_stream() { if (curr_stream) delete curr_stream; } ostream& stream(string label) { return stream(Max_depth, label); } ostream& stream(int depth, string label) { if (depth > collect_depth) return null_stream; curr_stream = new ostringstream; curr_label = label; curr_depth = depth; return *curr_stream; } // be sure to call this before messing with curr_stream or curr_label void newline() { if (!curr_stream) return; string curr_contents = curr_stream->str(); if (curr_contents.empty()) return; past_lines.push_back(trace_line(curr_depth, trim(curr_label), curr_contents)); // preserve indent in contents if (!Hide_errors && curr_label == "error") cerr << curr_label << ": " << curr_contents << '\n'; else if (!Hide_warnings && curr_label == "warn") cerr << curr_label << ": " << curr_contents << '\n'; delete curr_stream; curr_stream = NULL; curr_label.clear(); curr_depth = Max_depth; } // Useful for debugging. string readable_contents(string label) { // missing label = everything ostringstream output; label = trim(label); for (vector<trace_line>::iterator p = past_lines.begin(); p != past_lines.end(); ++p) if (label.empty() || label == p->label) { output << std::setw(4) << p->depth << ' ' << p->label << ": " << p->contents << '\n'; } return output.str(); } }; trace_stream* Trace_stream = NULL; // Top-level helper. IMPORTANT: can't nest. #define trace(...) !Trace_stream ? cerr /*print nothing*/ : Trace_stream->stream(__VA_ARGS__) #define raise (!Trace_stream ? (tb_shutdown(),cerr) /*do print*/ : Trace_stream->stream(Warning_depth, "warn")) #define raise_error (!Trace_stream ? (tb_shutdown(),cerr) /*do print*/ : Trace_stream->stream(Error_depth, "error")) :(before "End Types") struct end {}; :(before "End Tracing") ostream& operator<<(ostream& os, unused end) { if (Trace_stream) Trace_stream->newline(); return os; } #define CLEAR_TRACE delete Trace_stream, Trace_stream = new trace_stream; #define DUMP(label) if (Trace_stream) cerr << Trace_stream->readable_contents(label); // 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. static string Trace_dir = ".traces/"; string Trace_file; // Trace_stream is a resource, lease_tracer uses RAII to manage it. struct lease_tracer { lease_tracer() { Trace_stream = new trace_stream; } ~lease_tracer() { if (!Trace_stream) return; // in case tests close Trace_stream 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 = ""; } }; #define START_TRACING_UNTIL_END_OF_SCOPE lease_tracer leased_tracer; :(before "End Test Setup") START_TRACING_UNTIL_END_OF_SCOPE :(before "End Includes") #define CHECK_TRACE_CONTENTS(...) check_trace_contents(__FUNCTION__, __FILE__, __LINE__, __VA_ARGS__) :(before "End Tracing") bool check_trace_contents(string FUNCTION, string FILE, int LINE, string expected) { if (!Trace_stream) return false; vector<string> expected_lines = split(expected, ""); long long int curr_expected_line = 0; while (curr_expected_line < SIZE(expected_lines) && expected_lines.at(curr_expected_line).empty()) ++curr_expected_line; if (curr_expected_line == SIZE(expected_lines)) return true; string label, contents; split_label_contents(expected_lines.at(curr_expected_line), &label, &contents); for (vector<trace_line>::iterator p = Trace_stream->past_lines.begin(); p != Trace_stream->past_lines.end(); ++p) { if (label != p->label) continue; if (contents != trim(p->contents)) continue; ++curr_expected_line; while (curr_expected_line < SIZE(expected_lines) && expected_lines.at(curr_expected_line).empty()) ++curr_expected_line; if (curr_expected_line == SIZE(expected_lines)) return true; split_label_contents(expected_lines.at(curr_expected_line), &label, &contents); } ++Num_failures; cerr << "\nF - " << FUNCTION << "(" << FILE << ":" << LINE << "): missing [" << contents << "] in trace:\n"; DUMP(label); Passed = false; return false; } void split_label_contents(const string& s, string* label, string* contents) { static const string delim(": "); size_t pos = s.find(delim); if (pos == string::npos) { *label = ""; *contents = trim(s); } else { *label = trim(s.substr(0, pos)); *contents = trim(s.substr(pos+SIZE(delim))); } } int trace_count(string label) { return trace_count(label, ""); } int trace_count(string label, string line) { long result = 0; for (vector<trace_line>::iterator p = Trace_stream->past_lines.begin(); p != Trace_stream->past_lines.end(); ++p) { if (label == p->label) { if (line == "" || trim(line) == trim(p->contents)) ++result; } } return result; } #define CHECK_TRACE_CONTAINS_ERROR() CHECK(trace_count("error") > 0) #define CHECK_TRACE_DOESNT_CONTAIN_ERROR() \ if (trace_count("error") > 0) { \ ++Num_failures; \ cerr << "\nF - " << __FUNCTION__ << "(" << __FILE__ << ":" << __LINE__ << "): unexpected errors\n"; \ DUMP("error"); \ Passed = false; \ return; \ } #define CHECK_TRACE_COUNT(label, count) \ if (trace_count(label) != (count)) { \ ++Num_failures; \ cerr << "\nF - " << __FUNCTION__ << "(" << __FILE__ << ":" << __LINE__ << "): trace_count of " << label << " should be " << count << '\n'; \ cerr << " got " << trace_count(label) << '\n'; /* multiple eval */ \ DUMP(label); \ Passed = false; \ return; /* Currently we stop at the very first failure. */ \ } bool trace_doesnt_contain(string label, string line) { return trace_count(label, line) == 0; } bool trace_doesnt_contain(string expected) { vector<string> tmp = split_first(expected, ": "); return trace_doesnt_contain(tmp.at(0), tmp.at(1)); } #define CHECK_TRACE_DOESNT_CONTAIN(...) CHECK(trace_doesnt_contain(__VA_ARGS__)) vector<string> split(string s, string delim) { vector<string> result; size_t begin=0, end=s.find(delim); while (true) { if (end == string::npos) { result.push_back(string(s, begin, string::npos)); break; } result.push_back(string(s, begin, end-begin)); begin = end+SIZE(delim); end = s.find(delim, begin); } return result; } 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; } 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); } :(before "End Includes") #include<vector> using std::vector; #include<list> using std::list; #include<map> using std::map; #include<set> using std::set; #include<algorithm> #include<iostream> using std::istream; using std::ostream; using std::cin; using std::cout; using std::cerr; #include<iomanip> #include<sstream> using std::istringstream; using std::ostringstream; #include<fstream> using std::ifstream; using std::ofstream; #include"termbox/termbox.h" #define unused __attribute__((unused)) :(before "End Globals") //: In future layers we'll use the depth field as follows: //: //: Errors will be depth 0. //: Warnings will be depth 1. //: Mu 'applications' will be able to use depths 2-100 as they like. //: Primitive statements will occupy 101-9989 const int Initial_callstack_depth = 101; const int Max_callstack_depth = 9989; //: Finally, details of primitive mu statements will occupy depth 9990-9999 (more on that later as well) //: //: This framework should help us hide some details at each level, mixing //: static ideas like layers with the dynamic notion of call-stack depth.