Hojun-Cho
48904e5ef3
findall (regex.ha:923-960) over the memio seeker: one fixed stream for the whole string, per-call suffix substring, absolute io.seek(SET) past the scanner readahead after each match. The append-then-mutate m[0] fix-up is verbatim Hare (the appended header shares m's backing); the zero-length-match rune advancement guard (ha:946-952) carries the infinite-loop protection. search's |success|=2 unwrap is the D13 explicit 3-arm match (ww-core #14); nomem propagates. result_freeall (ha:1119-1124) verbatim, frees no-op (#27). Tests port Hare's own findall table (+test.ha:719-731, the three fold-2a-reachable rows) through run_findall_case's checks, plus field rows pinning adjacency, the one-result overlap pick, multibyte zero-length advancement (utf8sz step != 1), idx != bytesize, the tail-match break, and the empty no-match slice. 989's run gets the conventional timeout-180 wrap: a regression of the zero-length guard would otherwise hang the gate (no-op frees, so no quick OOM exit).
59 lines
1.8 KiB
C
59 lines
1.8 KiB
C
/*
|
|
* 989_regex_run — execute the lib/regex @test fixture (fold-1 data
|
|
* model + fold-2a compile() + fold-2b tranche-A scaffolding) under
|
|
* the C-side `ww run` driver and assert exit 0.
|
|
*
|
|
* Sibling to 984_base64_run / 989_sha256_run (9xx is full so this
|
|
* shares the 989 prefix — the `short` name keys the binary, cf the
|
|
* 949_* / 989_sha256 precedent). regex_test.ww carries its own
|
|
* `export fn main()` that drives the data-model @test fns and signals
|
|
* which case failed via the exit code, so this file is a thin wrapper
|
|
* — no @test scanning, no synthetic main generation.
|
|
*/
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include <sys/wait.h>
|
|
|
|
static int
|
|
runwait(const char *cmd)
|
|
{
|
|
int rc = system(cmd);
|
|
if (rc == -1) return -1;
|
|
if (WIFEXITED(rc)) return WEXITSTATUS(rc);
|
|
return 1;
|
|
}
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
const char *bin = getenv("BIN");
|
|
if (!bin) bin = "out/bin";
|
|
char absbin[1024];
|
|
if (bin[0] != '/') {
|
|
char cwd[1024];
|
|
if (getcwd(cwd, sizeof cwd) == NULL) return 1;
|
|
snprintf(absbin, sizeof absbin, "%s/%s", cwd, bin);
|
|
bin = absbin;
|
|
}
|
|
char cwd[1024];
|
|
if (getcwd(cwd, sizeof cwd) == NULL) return 1;
|
|
|
|
const char *src = "lib/regex/regex_test.ww";
|
|
char path[1024], cmd[2048];
|
|
snprintf(path, sizeof path, "%s/%s", cwd, src);
|
|
/* timeout 180 per repo convention (732/775; test/run does not
|
|
* bound runtime): the fold-2c zero-length findall rows turn a
|
|
* regression of the ha:946-952 rune-advancement guard into an
|
|
* infinite loop (frees are no-ops, so OOM is the only other
|
|
* exit) — timeout converts the hang into a loud 124. */
|
|
snprintf(cmd, sizeof cmd, "timeout 180 %s/ww run %s", bin, path);
|
|
int rc = runwait(cmd);
|
|
if (rc != 0) {
|
|
fprintf(stderr, "regex_run FAIL: %s exited %d\n", src, rc);
|
|
return 1;
|
|
}
|
|
printf("regex_run: %s ok\n", src);
|
|
return 0;
|
|
}
|