about summary refs log tree commit diff stats
path: root/apps
Commit message (Expand)AuthorAgeFilesLines
* 5792Kartik Agaram2019-12-0514-0/+0
* 5790Kartik Agaram2019-12-0511-318/+318
* 5785 - initial skeleton for parsing fn bodiesKartik Agaram2019-11-302-5/+21
* 5784Kartik Agaram2019-11-302-7/+27
* 5782 - fix a widespread bug with Heap-sizeKartik Agaram2019-11-3028-14/+14
* 5781Kartik Agaram2019-11-302-3/+194
* 5780Kartik Agaram2019-11-291-43/+50
* 5779Kartik Agaram2019-11-291-100/+308
* 5778Kartik Agaram2019-11-2915-19/+19
* 5777Kartik Agaram2019-11-292-3/+159
* 5776Kartik Agaram2019-11-292-34/+48
* 5775Kartik Agaram2019-11-292-9/+105
* 5774Kartik Agaram2019-11-291-26/+82
* 5773Kartik Agaram2019-11-282-0/+205
* 5772Kartik Agaram2019-11-282-0/+110
* 5770Kartik Agaram2019-11-282-0/+189
* 5769 - support uppercase hex in SubXKartik Agaram2019-11-2814-0/+0
* 5768 - start parsing fn headersKartik Agaram2019-11-272-14/+63
* 5767Kartik Agaram2019-11-272-16/+175
* 5765Kartik Agaram2019-11-2613-3/+119
* 5763Kartik Agaram2019-11-262-12/+64
* 5762Kartik Agaram2019-11-261-5/+0
* 5761Kartik Agaram2019-11-262-2/+43
* 5760Kartik Agaram2019-11-252-8/+31
* 5759 - design statement data structureKartik Agaram2019-11-251-14/+80
* 5756Kartik Agaram2019-11-182-12/+30
* 5755Kartik Agaram2019-11-182-0/+66
* 5754Kartik Agaram2019-11-182-3/+81
* 5753Kartik Agaram2019-11-184-6/+15
* 5752Kartik Agaram2019-11-1816-93/+97
* 5751 - start of table of Mu primitivesKartik Agaram2019-11-182-0/+168
* 5750Kartik Agaram2019-11-172-25/+411
* 5746Kartik Agaram2019-11-152-37/+336
* 5745Kartik Agaram2019-11-142-35/+71
* 5744Kartik Agaram2019-11-141-9/+5
* 5743Kartik Agaram2019-11-142-1/+1
* 5742Kartik Agaram2019-11-141-7/+5
* 5741Kartik Agaram2019-11-142-9/+19
* 5740Kartik Agaram2019-11-141-4/+0
* 5739Kartik Agaram2019-11-101-0/+0
* 5737 - first 2 Mu statements translating to SubXKartik Agaram2019-11-101-15/+64
* 5736Kartik Agaram2019-11-101-47/+69
* 5735Kartik Agaram2019-11-091-17/+44
* 5734Kartik Agaram2019-11-091-13/+49
* 5733Kartik Agaram2019-11-091-11/+60
* 5732Kartik Agaram2019-11-091-56/+29
* 5731Kartik Agaram2019-11-091-11/+0
* 5729Kartik Agaram2019-11-091-16/+155
* 5728Kartik Agaram2019-11-081-7/+153
* 5727Kartik Agaram2019-11-081-6/+157
ss="p">) void transform_labels(const recipe_ordinal r) { map<string, int> offset; for (int i = 0; i < SIZE(get(Recipe, r).steps); ++i) { const instruction& inst = get(Recipe, r).steps.at(i); if (!inst.is_label) continue; if (is_jump_target(inst.label)) { if (!contains_key(offset, inst.label)) { put(offset, inst.label, i); } else { raise << maybe(get(Recipe, r).name) << "duplicate label '" << inst.label << "'" << end(); // have all jumps skip some random but noticeable and deterministic amount of code put(offset, inst.label, 9999); } } } for (int i = 0; i < SIZE(get(Recipe, r).steps); ++i) { instruction& inst = get(Recipe, r).steps.at(i); if (inst.name == "jump") { if (inst.ingredients.empty()) { raise << maybe(get(Recipe, r).name) << "'" << to_original_string(inst) << "' expects an ingredient but got 0\n" << end(); return; } replace_offset(inst.ingredients.at(0), offset, i, r); } if (inst.name == "jump-if" || inst.name == "jump-unless") { if (SIZE(inst.ingredients) < 2) { raise << maybe(get(Recipe, r).name) << "'" << to_original_string(inst) << "' expects 2 ingredients but got " << SIZE(inst.ingredients) << '\n' << end(); return; } replace_offset(inst.ingredients.at(1), offset, i, r); } if ((inst.name == "loop" || inst.name == "break") && SIZE(inst.ingredients) >= 1) { replace_offset(inst.ingredients.at(0), offset, i, r); } if ((inst.name == "loop-if" || inst.name == "loop-unless" || inst.name == "break-if" || inst.name == "break-unless") && SIZE(inst.ingredients) >= 2) { replace_offset(inst.ingredients.at(1), offset, i, r); } } } void replace_offset(reagent& x, /*const*/ map<string, int>& offset, const int current_offset, const recipe_ordinal r) { if (!is_literal(x)) { raise << maybe(get(Recipe, r).name) << "jump target must be offset or label but is '" << x.original_string << "'\n" << end(); x.set_value(0); // no jump by default return; } if (x.initialized) return; if (is_integer(x.name)) return; // non-labels will be handled like other number operands if (!is_jump_target(x.name)) { raise << maybe(get(Recipe, r).name) << "can't jump to label '" << x.name << "'\n" << end(); x.set_value(0); // no jump by default return; } if (!contains_key(offset, x.name)) { raise << maybe(get(Recipe, r).name) << "can't find label '" << x.name << "'\n" << end(); x.set_value(0); // no jump by default return; } x.set_value(get(offset, x.name) - current_offset); } void test_break_to_label() { run( "def main [\n" " {\n" " {\n" " break +target:label\n" " 1:num <- copy 0\n" " }\n" " }\n" " +target\n" "]\n" ); CHECK_TRACE_DOESNT_CONTAIN("mem: storing 0 in location 1"); } void test_jump_if_to_label() { run( "def main [\n" " {\n" " {\n" " jump-if 1, +target:label\n" " 1:num <- copy 0\n" " }\n" " }\n" " +target\n" "]\n" ); CHECK_TRACE_DOESNT_CONTAIN("mem: storing 0 in location 1"); } void test_loop_unless_to_label() { run( "def main [\n" " {\n" " {\n" " loop-unless 0, +target:label\n" // loop/break with a label don't care about braces " 1:num <- copy 0\n" " }\n" " }\n" " +target\n" "]\n" ); CHECK_TRACE_DOESNT_CONTAIN("mem: storing 0 in location 1"); } void test_jump_runs_code_after_label() { run( "def main [\n" // first a few lines of padding to exercise the offset computation " 1:num <- copy 0\n" " 2:num <- copy 0\n" " 3:num <- copy 0\n" " jump +target:label\n" " 4:num <- copy 0\n" " +target\n" " 5:num <- copy 0\n" "]\n" ); CHECK_TRACE_CONTENTS( "mem: storing 0 in location 5\n" ); CHECK_TRACE_DOESNT_CONTAIN("mem: storing 0 in location 4"); } void test_jump_fails_without_target() { Hide_errors = true; run( "def main [\n" " jump\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: main: 'jump' expects an ingredient but got 0\n" ); } void test_jump_fails_without_target_2() { Hide_errors = true; run( "def main [\n" " jump-if true\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: main: 'jump-if true' expects 2 ingredients but got 1\n" ); } void test_recipe_fails_on_duplicate_jump_target() { Hide_errors = true; run( "def main [\n" " +label\n" " 1:num <- copy 0\n" " +label\n" " 2:num <- copy 0\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: main: duplicate label '+label'\n" ); } void test_jump_ignores_nontarget_label() { Hide_errors = true; run( "def main [\n" // first a few lines of padding to exercise the offset computation " 1:num <- copy 0\n" " 2:num <- copy 0\n" " 3:num <- copy 0\n" " jump $target:label\n" " 4:num <- copy 0\n" " $target\n" " 5:num <- copy 0\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: main: can't jump to label '$target'\n" ); }