Hojun-Cho
1657bdeda3
C bootstrap (phases 0-9):
cmd/wwc, cmd/6c, cmd/6a, cmd/6l, cmd/ww, rt, lib/*.
ww-side self-host (phase 10):
selfhost/cmd/wwc — ww-cgen frontend; bootstrap fixed point.
selfhost/cmd/6a — assembler; byte-identical to C 6a (test 991).
selfhost/cmd/6l — linker w/ archive (.a) support; byte-identical
to C 6l (test 992).
selfhost/cmd/ww — driver (build/run/version); byte-identical to
C ww (test 993).
make test: 15/15. make bootstrap: ww2.s == ww3.s, ww2.o == ww3.o,
ww2 == ww3 byte-identical, with the full ww-tooled chain.
91 lines
2.5 KiB
C
91 lines
2.5 KiB
C
/*
|
|
* 400_6c — codegen smoke tests. Each row supplies a tiny ww source
|
|
* and a list of substrings expected in the emitted .s. We don't
|
|
* golden-match the whole file (too brittle); we just verify that
|
|
* key opcodes and operand shapes show up.
|
|
*/
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
static int
|
|
run6c(const char *src, char **out)
|
|
{
|
|
char path[64];
|
|
snprintf(path, sizeof path, "/tmp/wwt_%d.ww", getpid());
|
|
FILE *f = fopen(path, "wb");
|
|
if (f == NULL) return -1;
|
|
fputs(src, f);
|
|
fclose(f);
|
|
|
|
char cmd[256];
|
|
const char *bin = getenv("BIN");
|
|
if (!bin) bin = "out/bin";
|
|
snprintf(cmd, sizeof cmd, "%s/6c %s 2>&1", bin, path);
|
|
FILE *p = popen(cmd, "r");
|
|
if (p == NULL) { unlink(path); return -1; }
|
|
size_t cap = 4096, n = 0;
|
|
char *buf = malloc(cap);
|
|
int c;
|
|
while ((c = fgetc(p)) != EOF) {
|
|
if (n + 1 >= cap) { cap *= 2; buf = realloc(buf, cap); }
|
|
buf[n++] = (char)c;
|
|
}
|
|
buf[n] = '\0';
|
|
int rc = pclose(p);
|
|
unlink(path);
|
|
*out = buf;
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
contains(const char *hay, const char *needle)
|
|
{
|
|
return strstr(hay, needle) != NULL;
|
|
}
|
|
|
|
struct row { const char *src; const char *needle; };
|
|
|
|
static const struct row rows[] = {
|
|
{ "fn main() i32 = { return 42; };", "MOVQ\t$42, AX" },
|
|
{ "fn main() i32 = { return 42; };", "RET" },
|
|
{ "fn id(x: i32) i32 = { return x; };","MOVQ\tDI, -8(BP)" },
|
|
{ "fn add(a: i32, b: i32) i32 = { return a + b; };", "ADDQ\tBX, AX" },
|
|
{ "fn sub(a: i32, b: i32) i32 = { return a - b; };", "SUBQ\tBX, AX" },
|
|
{ "fn mul(a: i32, b: i32) i32 = { return a * b; };", "IMULQ\tBX, AX" },
|
|
{ "fn neg(x: i32) i32 = { return -x; };", "NEGQ\tAX" },
|
|
{ "fn cmp(a: i32, b: i32) bool = { return a == b; };", "CMPQ\tBX, AX" },
|
|
{ "fn cmp(a: i32, b: i32) bool = { return a == b; };", "JE" },
|
|
{ "fn cond(x: i32) i32 = { if (x > 0) { return 1; }; return 0; };",
|
|
"CMPQ\t$0, AX" },
|
|
{ "fn lo() void = { for (let i: i32 = 0; i < 10; i += 1) { }; };", "JMP" },
|
|
{ "fn callit() i32 = { return 1; };", "TEXT callit,$0" },
|
|
};
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int n = sizeof rows / sizeof rows[0];
|
|
int fail = 0;
|
|
for (int i = 0; i < n; i++) {
|
|
char *out = NULL;
|
|
int rc = run6c(rows[i].src, &out);
|
|
if (rc != 0) {
|
|
fprintf(stderr, "row %d: 6c rc=%d\n", i, rc);
|
|
fail++;
|
|
free(out);
|
|
continue;
|
|
}
|
|
if (!contains(out, rows[i].needle)) {
|
|
fprintf(stderr, "row %d: missing '%s' in:\n%s\n",
|
|
i, rows[i].needle, out);
|
|
fail++;
|
|
}
|
|
free(out);
|
|
}
|
|
if (fail) { fprintf(stderr, "%d/%d 6c tests failed\n", fail, n); return 1; }
|
|
printf("6c: %d/%d ok\n", n, n);
|
|
return 0;
|
|
}
|