profio.c File Reference

#include "c.h"

Include dependency graph for profio.c:

Go to the source code of this file.

Data Structures
struct	count
struct	file
struct	file::func
struct	file::func::caller
Defines
#define	MAXTOKEN   64
Functions
void	acaller (char *caller, char *file, int x, int y, int count, struct func *callee)
func *	afunction (char *name, char *file, int x, int y, int count)
void	apoint (int i, char *file, int x, int y, int count)
int	compare (struct count *a, struct count *b)
int	findcount (char *file, int x, int y)
file *	findfile (char *name)
int	findfunc (char *name, char *file)
int	gather (void)
int	getd (void)
char *	getstr (void)
int	process (char *file)
Variables
file *	filelist
FILE *	fp

---

Define Documentation

#define MAXTOKEN   64

Definition at line 22 of file profio.c.

---

Function Documentation

void acaller (  char *  caller, char *  file, int  x, int  y, int  count, struct func *  callee )  [static]

Definition at line 46 of file profio.c. References assert, func::callers, count::count, file, func::link, NEW, PERM, q, r, strcmp(), count::x, x, count::y, and y. Referenced by gather(). { struct caller *q; assert(callee); for (q = callee->callers; q && (caller != q->name || file != q->file || x != q->x || y != q->y); q = q->link) ; if (!q) { struct caller **r; NEW(q, PERM); q->name = caller; q->file = file; q->x = x; q->y = y; q->count = 0; for (r = &callee->callers; *r && (strcmp(q->name, (*r)->name) > 0 || strcmp(q->file, (*r)->file) > 0 || q->y > (*r)->y || q->y > (*r)->y); r = &(*r)->link) ; q->link = *r; *r = q; } q->count += count; }

Here is the call graph for this function:

struct func* afunction (  char *  name, char *  file, int  x, int  y, int  count )  [static]

Definition at line 88 of file profio.c. References assert, func::callers, compare(), file, findfile(), file::funcs, func::link, func::name, name, NEW, p, PERM, q, and r. Referenced by gather(). { struct file *p = findfile(file); struct func *q; assert(p); for (q = p->funcs; q && name != q->name; q = q->link) ; if (!q) { struct func **r; NEW(q, PERM); q->name = name; q->count.x = x; q->count.y = y; q->count.count = 0; q->callers = 0; for (r = &p->funcs; *r && compare(&q->count, &(*r)->count) > 0; r = &(*r)->link) ; q->link = *r; *r = q; } q->count.count += count; return q; }

Here is the call graph for this function:

void apoint (  int  i, char *  file, int  x, int  y, int  count )  [static]

Definition at line 113 of file profio.c. References assert, count::count, file::count, count, file::counts, file, findfile(), i, j, newarray, p, PERM, file::size, count::x, count::y, and z. Referenced by gather(). { struct file *p = findfile(file); assert(p); if (i >= p->size) { int j; if (p->size == 0) { p->size = i >= 200 ? 2*i : 200; p->counts = newarray(p->size, sizeof *p->counts, PERM); } else { struct count *new; p->size = 2*i; new = newarray(p->size, sizeof *new, PERM); for (j = 0; j < p->count; j++) new[j] = p->counts[j]; p->counts = new; } for (j = p->count; j < p->size; j++) { static struct count z; p->counts[j] = z; } } p->counts[i].x = x; p->counts[i].y = y; p->counts[i].count += count; if (i >= p->count) p->count = i + 1; }

Here is the call graph for this function:

int compare (  struct count *  a, struct count *  b )  [static]

Definition at line 71 of file profio.c. References a, b, count::x, and count::y. Referenced by afunction(), and process(). { if (a->y == b->y) return a->x - b->x; return a->y - b->y; }

int findcount (  char *  file, int  x, int  y )

Definition at line 143 of file profio.c. References c, count::count, file::count, file::counts, file, findfile(), k, l, file::name, count::x, y, and count::y. Referenced by definept(). { static struct file *cursor; if (cursor == 0 || cursor->name != file) cursor = findfile(file); if (cursor) { int l, u; struct count *c = cursor->counts; for (l = 0, u = cursor->count - 1; l <= u; ) { int k = (l + u)/2; if (c[k].y > y || c[k].y == y && c[k].x > x) u = k - 1; else if (c[k].y < y || c[k].y == y && c[k].x < x) l = k + 1; else return c[k].count; } } return -1; }

Here is the call graph for this function:

struct file* findfile (  char *  name  )  [static]

Definition at line 78 of file profio.c. References file::link, file::name, and p. Referenced by afunction(), apoint(), findcount(), findfunc(), gather(), and main(). { struct file *p; for (p = filelist; p; p = p->link) if (p->name == name) return p; return 0; }

int findfunc (  char *  name, char *  file )

Definition at line 165 of file profio.c. References file, findfile(), file::funcs, func::link, func::name, file::name, and p. Referenced by funcdefn(). { static struct file *cursor; if (cursor == 0 || cursor->name != file) cursor = findfile(file); if (cursor) { struct func *p; for (p = cursor->funcs; p; p = p->link) if (p->name == name) return p->count.count; } return -1; }

Here is the call graph for this function:

int gather (  void   )  [static]

Definition at line 207 of file profio.c. References acaller(), afunction(), apoint(), assert, count, f, file, filelist, findfile(), getd(), getstr(), i, func::link, name, func::name, NELEMS, NEW, npoints, PERM, q, x, and y. { int i, nfiles, nfuncs, npoints; char *files[64]; if ((nfiles = getd()) < 0) return 0; assert(nfiles < NELEMS(files)); for (i = 0; i < nfiles; i++) { if ((files[i] = getstr()) == 0) return -1; if (!findfile(files[i])) { struct file *new; NEW(new, PERM); new->name = files[i]; new->size = new->count = 0; new->counts = 0; new->funcs = 0; new->link = filelist; filelist = new; } } if ((nfuncs = getd()) < 0) return -1; for (i = 0; i < nfuncs; i++) { struct func *q; char *name, *file; int f, x, y, count; if ((name = getstr()) == 0 || (f = getd()) <= 0 || (x = getd()) < 0 || (y = getd()) < 0 || (count = getd()) < 0) return -1; q = afunction(name, files[f-1], x, y, count); if ((name = getstr()) == 0 || (file = getstr()) == 0 || (x = getd()) < 0 || (y = getd()) < 0) return -1; if (*name != '?') acaller(name, file, x, y, count, q); } if ((npoints = getd()) < 0) return -1; for (i = 0; i < npoints; i++) { int f, x, y, count; if ((f = getd()) < 0 || (x = getd()) < 0 || (y = getd()) < 0 || (count = getd()) < 0) return -1; if (f) apoint(i, files[f-1], x, y, count); } return 1; }

Here is the call graph for this function:

int getd (  void   )  [static]

Definition at line 180 of file profio.c. References c, EOF, fp, getc, and n. { int c, n = 0; while ((c = getc(fp)) != EOF && (c == ' ' || c == '\n' || c == '\t')) ; if (c >= '0' && c <= '9') { do n = 10*n + (c - '0'); while ((c = getc(fp)) >= '0' && c <= '9'); return n; } return -1; }

char* getstr (  void   )  [static]

Definition at line 195 of file profio.c. References c, EOF, fp, getc, s, and string(). { int c; char buf[MAXTOKEN], *s = buf; while ((c = getc(fp)) != EOF && c != ' ' && c != '\n' && c != '\t') if (s - buf < (int)sizeof buf - 2) *s++ = c; *s = 0; return s == buf ? (char *)0 : string(buf); }

Here is the call graph for this function:

int process (  char *  file  )

Definition at line 258 of file profio.c. References compare(), file::count, file::counts, fclose(), file, fopen(), fp, gather(), int, file::link, p, and qsort(). Referenced by main(), and prof_init(). { int more; if ((fp = fopen(file, "r")) != NULL) { struct file *p; while ((more = gather()) > 0) ; fclose(fp); if (more < 0) return more; for (p = filelist; p; p = p->link) qsort(p->counts, p->count, sizeof *p->counts, (int (*)(const void *, const void *)) compare); return 1; } return 0; }

Here is the call graph for this function:

---

Variable Documentation

struct file * filelist

FILE* fp

Definition at line 43 of file profio.c.

---