libqbe/lisc/main.c

#include "lisc.h"


char debug['Z'+1] = {
	['S'] = 0, /* spiller */
	['R'] = 0, /* reg. allocator */
};

void
dumpts(Bits *b, Tmp *tmp, FILE *f)
{
	int t;

	fprintf(f, "[");
	for (t=0; t<BITS*NBit; t++)
		if (BGET(*b, t))
			fprintf(f, " %s", tmp[t].name);
	fprintf(f, " ]\n");
}

int
main(int ac, char *av[])
{
	int opt, pr;
	Fn *fn;

	fn = parse(stdin);

	pr = 1;
	opt = 0;
	if (ac > 1 && av[1][0] == '-')
		opt = av[1][1];

	switch (opt) {
	case 'f': {
		int t, ntmp;

		fprintf(stderr, "[Testing SSA Reconstruction:");
		fillpreds(fn);
		for (ntmp=fn->ntmp, t=0; t<ntmp; t++) {
			fprintf(stderr, " %s", fn->tmp[t].name);
			ssafix(fn, t);
		}
		fprintf(stderr, "]\n");
		break;
	}
	case 'r': {
		int n;

		fprintf(stderr, "[Testing RPO]\n");
	RPODump:
		fillrpo(fn);
		assert(fn->rpo[0] == fn->start);
		for (n=0;; n++)
			if (n == fn->nblk-1) {
				fn->rpo[n]->link = 0;
				break;
			} else
				fn->rpo[n]->link = fn->rpo[n+1];
		break;
	}
	case 'l': {
		Blk *b;

		fprintf(stderr, "[Testing Liveness]\n");
		fillrpo(fn);
		filllive(fn);
		for (b=fn->start; b; b=b->link) {
			printf("> Block %s\n", b->name);
			printf("\t in:   ");
			dumpts(&b->in, fn->tmp, stdout);
			printf("\tout:   ");
			dumpts(&b->out, fn->tmp, stdout);
			printf("\tnlive: %d\n", b->nlive);
		}
		pr = 0;
		break;
	}
	case 'i': {
		fprintf(stderr, "[Testing Instruction Selection]\n");
		isel(fn);
		break;
	}
	case 's': {
		Blk *b;

		fprintf(stderr, "[Testing Spilling]\n");
		debug['S'] = 1;
		isel(fn);
		fillrpo(fn);
		fillpreds(fn);
		filllive(fn);
		fillcost(fn);
		spill(fn);
		printf("> Block information:\n");
		for (b=fn->start; b; b=b->link) {
			printf("\t%-10s (% 5d) ",
				b->name, b->loop);
			dumpts(&b->out, fn->tmp, stdout);
		}
		printf("\n");
		break;
	}
	case 'a': {
		fprintf(stderr, "[Testing Register Allocation]\n");
		debug['R'] = 1;
		isel(fn);
		fillrpo(fn);
		fillpreds(fn);
		filllive(fn);
		fillcost(fn);
		spill(fn);
		rega(fn);
		goto RPODump;
	}
	case 'e': {
		int n;

		fprintf(stderr, "[Testing Code Emission]\n");
		isel(fn);
		fillrpo(fn);
		fillpreds(fn);
		filllive(fn);
		fillcost(fn);
		spill(fn);
		rega(fn);
		fillrpo(fn);
		assert(fn->rpo[0] == fn->start);
		for (n=0;; n++)
			if (n == fn->nblk-1) {
				fn->rpo[n]->link = 0;
				break;
			} else
				fn->rpo[n]->link = fn->rpo[n+1];
		emitfn(fn, stdout);
		pr = 0;
		break;
	}
	default:
		break;
	}

	if (pr)
		printfn(fn, stdout);
	exit(0);
}