Research 124's suite: seven kinds of work in one event each (roots, knapsack, sort, join, words, matmul, BFS), each against the C one would write, in one process with the same inputs and answers; PURE_AHEAD=0 to measure the code without reading ahead

1 files changed, 2 insertions, 0 deletions

diff --git a/core/module-jit.c b/core/module-jit.c
index 140d9b4..415f1ff 100644
--- a/core/module-jit.c
+++ b/core/module-jit.c
@@ -2472,6 +2472,8 @@ static bool has_round(const Ahead *a, int n) {
 static void plan_ahead(Block *k, unsigned li) {
     const PureModule *m = k->m;
     LoopAt *l = &k->loops[li];
+    const char *ahead = getenv("PURE_AHEAD"); /* 0: none (measuring what the code costs without it, research 124) */
+    if (ahead && !strcmp(ahead, "0")) return;
     if (!l->walk && m->code[l->at].arg & PURE_LOOP_INTEGER) return;
     Ahead a = {0};
     int stack[PURE_MODULE_STACK + 2], local[PURE_MODULE_LOCALS];