Return to bbexit.c CVS log

Up to [Research Unix] / researchv10no / cmd / lcc / etc

researchv10 Norman

#include <stdio.h>

struct callsite {
	char *file, *name;
	union coordinate {
		struct {
#if MIPSEB || mc68020 || mc68030 || NeXT || sparc
			unsigned int index:6,x:10,y:16;
#endif
#if MIPSEL || vax
			unsigned int y:16,x:10,index:6;
#endif
		} c;
		unsigned int coord;
	} u;
} *_caller;

static struct _bbdata {
	struct _bbdata *link;
	unsigned npoints, *counts;
	union coordinate *coords;
	char **files;
	struct func {
		struct func *link;
		struct caller {
			struct caller *link;
			struct callsite *caller;
			unsigned count;
		} *callers;
		char *name;
		union coordinate src;
	} *funcs;
} tail, *_bblist = &tail;

_epilogue(callee) struct func *callee; {
	_caller = 0;
}

_prologue(callee, yylink) struct func *callee; struct _bbdata *yylink; {
	static struct caller callers[4096];
	static int next;
	struct caller *p;

	if (!yylink->link) {
		yylink->link = _bblist;
		_bblist = yylink;
	}
	for (p = callee->callers; p; p = p->link)
		if (p->caller == _caller) {
			p->count++;
			break;
		}
	if (!p && next < sizeof callers/sizeof callers[0]) {
		p = &callers[next++];
		p->caller = _caller;
		p->count = 1;
		p->link = callee->callers;
		callee->callers = p;
	}
	_caller = 0;
}

static void profout(p, fp) struct _bbdata *p; FILE *fp; {
	int i;
	struct func *f;
	struct caller *q;

	for (i = 0; p->files[i]; i++)
		;
	fprintf(fp, "%d\n", i);
	for (i = 0; p->files[i]; i++)
		fprintf(fp, "%s\n", p->files[i]);
	for (i = 0, f = p->funcs; f; i++, f = f->link)
		if (q = f->callers)
			for (i--; q; q = q->link)
				i++;
	fprintf(fp, "%d\n", i);
	for (f = p->funcs; f; f = f->link) {
		int n = 0;
		for (q = f->callers; q; n += q->count, q = q->link) {
			fprintf(fp, "%s %d %d %d %d", f->name, f->src.c.index,
				f->src.c.x, f->src.c.y, q->count);
			if (q->caller)
				fprintf(fp, " %s %s %d %d\n", q->caller->name, q->caller->file,
					q->caller->u.c.x, q->caller->u.c.y);
			else
				fprintf(fp, " ? ? 0 0\n");
		}
		if (n == 0)
			fprintf(fp, "%s %d %d %d 0 ? ? 0 0\n", f->name, f->src.c.index,
				f->src.c.x, f->src.c.y);
	}		
	fprintf(fp, "%d\n", p->npoints);
	for (i = 0; i < p->npoints; i++)
		fprintf(fp, "%d %d %d %d\n", p->coords[i].c.index, p->coords[i].c.x,
			p->coords[i].c.y, p->counts[i]);
}

exit(code) {
	FILE *fp;

	if (_bblist != &tail && (fp = fopen("prof.out", "a"))) {
		for ( ; _bblist != &tail; _bblist = _bblist->link)
			profout(_bblist, fp);
		fclose(fp);
	}
#if mips || vax || sparc
	_cleanup();
#endif
	_exit(code);
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.