/* * 935_str_tuple_elem_cap_run — runtime coverage for the C4.6-S3 fold: a * tuple POSITIONAL str element read `t.N` (N_IDENT base, TY_TUPLE) must load * the full 24B {ptr,len,cap} header, not just {ptr,len}. str is 24B since * Phase 2 (#1); pre-S3 the tuple str-element arm loaded 2 words (ptr in AX, * len in BX) and dropped cap. * * This is the "author-to-ABI" coda of C4.6: UNLIKE S1/S2/caseB there is no * adjacent slice-element arm to fold onto, so the 3-word triple is authored * directly to the canonical slice-header ABI (AX=ptr, BX=len, CX=cap). The * base is BP (the frame, not a target reg), so the canonical ptr/len/cap * order has no clobber subtlety. Sites: cgen.c's "tuple positional field * access" branch and the cgenexpr.ww N_TTUPLE twin. * * The byte-id gates (990-997) can't catch a symmetric 2-word miscompile: if * both stages drop cap identically, byte-id passes silently. So this pins the * *runtime* contract — build through both the cstage `ww` and wwstage `ww_ww` * driver and confirm the assertion holds (exit 0). * * The tuple is built by a (i64, str)-returning mk() so the poisoned cap=8 * rides the 4-word return ABI (AX=scalar, DX=ptr, CX=len, R8=cap) into the * tuple slot's +24 word; `t.1` then reads it back 3-word (cap at slot+8+16). * * DISCRIMINATION (heed the 933/934 lesson): a 2-word read leaves CX untouched, * so the row could coincidentally pass on a stale CX. spoil() interposes a * call between the `let t = mk()` build and the `t.1` read; a call clobbers * caller-saved CX (spoil's own str copy leaves cap=44 in CX), so a broken * 2-word read observes cap=44, not 8, and the row fails (return 1). Verified * fail-before (reverted +16 cap load: exit 1) / pass-after (exit 0), both * drivers. */ #include #include #include #include #include #include static int runwait(const char *cmd) { int rc = system(cmd); if (rc == -1) return -1; if (WIFEXITED(rc)) return WEXITSTATUS(rc); return -1; } struct row { const char *label; const char *src; int want; }; static const struct row rows[] = { /* S3 — `t.N` positional str element. t a local (i64, str) tuple * built by mk() so the poison cap=8 (len=2) rides the return ABI * into the str element's slot. spoil() interposes a CX-clobbering * call between the build and the `t.1` read so a broken 2-word read * cannot coincidentally pass on a stale CX. */ { "tuple_positional_str_elem", "fn mk() (i64, str) = {\n" " let p: str = \"hi\";\n" " p.cap = 8i32;\n" " return (5i64, p);\n" "};\n" "fn spoil() i32 = {\n" " let z: str = \"zzzz\";\n" " z.cap = 44i32;\n" " let w: str = z;\n" " return w.cap: i32;\n" "};\n" "export fn main() i32 = {\n" " let t: (i64, str) = mk();\n" " let junk: i32 = spoil();\n" " let s: str = t.1;\n" " if (s.cap: i32 != 8) { return 1; };\n" " if (s.len: i32 != 2) { return 2; };\n" " if (junk != 44) { return 3; };\n" " return 0;\n" "};\n", 0 }, }; static int run_driver(const char *driver, const struct row *r, int i) { char src[96], tmpdir[96], cmd[1024]; snprintf(src, sizeof src, "/tmp/strtupleelemcap_%d_%d.ww", getpid(), i); snprintf(tmpdir, sizeof tmpdir, "/tmp/strtupleelemcap_%d_d_%d", getpid(), i); FILE *f = fopen(src, "wb"); if (!f) return -1; fputs(r->src, f); fclose(f); mkdir(tmpdir, 0755); snprintf(cmd, sizeof cmd, "cd %s && %s build %s", tmpdir, driver, src); if (runwait(cmd) != 0) { fprintf(stderr, "row[%s]: build via %s failed\n", r->label, driver); unlink(src); rmdir(tmpdir); return -1; } const char *base = strrchr(src, '/'); base = base ? base + 1 : src; char outbin[160]; snprintf(outbin, sizeof outbin, "%s/%s", tmpdir, base); char *dot = strrchr(outbin, '.'); if (dot && strcmp(dot, ".ww") == 0) *dot = '\0'; int got = runwait(outbin); unlink(src); unlink(outbin); rmdir(tmpdir); return got; } int main(void) { const char *bin = getenv("BIN"); if (!bin) bin = "out/bin"; char absbin[512]; if (bin[0] != '/') { char cwd[256]; if (getcwd(cwd, sizeof cwd) == NULL) return 1; snprintf(absbin, sizeof absbin, "%s/%s", cwd, bin); bin = absbin; } char cdrv[640]; snprintf(cdrv, sizeof cdrv, "%s/ww", bin); char wdrv[640]; snprintf(wdrv, sizeof wdrv, "%s/ww_ww", bin); struct { const char *name; const char *path; int gated_on_existence; } drivers[] = { { "cstage", cdrv, 0 }, { "wwstage", wdrv, 1 }, { NULL, NULL, 0 }, }; int n = (int)(sizeof rows / sizeof rows[0]); int total = 0, fail = 0; for (int d = 0; drivers[d].name; d++) { if (drivers[d].gated_on_existence && access(drivers[d].path, X_OK) != 0) { fprintf(stderr, "str_tuple_elem_cap_run: skip %s (no %s)\n", drivers[d].name, drivers[d].path); continue; } for (int i = 0; i < n; i++) { int got = run_driver(drivers[d].path, &rows[i], i); total++; if (got != rows[i].want) { fprintf(stderr, "str_tuple_elem_cap_run[%s][%s]: exit=%d want=%d\n", drivers[d].name, rows[i].label, got, rows[i].want); fail++; } } } if (fail) { fprintf(stderr, "str_tuple_elem_cap_run: %d/%d fixtures failed\n", fail, total); return 1; } printf("str_tuple_elem_cap_run: %d/%d ok\n", total, total); return 0; }