1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
#include <stdio.h>
#include <stdlib.h>
struct callsite {
char *file, *name;
union coordinate {
struct { unsigned int index:6,x:10,y:16; } be;
struct { unsigned int y:16,x:10,index:6; } le;
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;
static void unpack(unsigned int coord, int *index, int *x, int *y) {
static union { int x; char endian; } little = { 1 };
union coordinate u;
u.coord = coord;
if (little.endian) {
*index = u.le.index;
*x = u.le.x;
*y = u.le.y;
} else {
*index = u.be.index;
*x = u.be.x;
*y = u.be.y;
}
}
static void profout(struct _bbdata *p, FILE *fp) {
int i, index, x, y;
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) {
unpack(f->src.coord, &index, &x, &y);
fprintf(fp, "%s %d %d %d %d", f->name, index, x, y, q->count);
if (q->caller) {
unpack(q->caller->u.coord, &index, &x, &y);
fprintf(fp, " %s %s %d %d\n", q->caller->name, q->caller->file, x, y);
} else
fprintf(fp, " ? ? 0 0\n");
}
if (n == 0) {
unpack(f->src.coord, &index, &x, &y);
fprintf(fp, "%s %d %d %d 0 ? ? 0 0\n", f->name, index, x, y);
}
}
fprintf(fp, "%d\n", p->npoints);
for (i = 0; i < p->npoints; i++) {
unpack(p->coords[i].coord, &index, &x, &y);
fprintf(fp, "%d %d %d %d\n", index, x, y, p->counts[i]);
}
}
static void bbexit(void) {
FILE *fp;
if (_bblist != &tail && (fp = fopen("prof.out", "a"))) {
for ( ; _bblist != &tail; _bblist = _bblist->link)
profout(_bblist, fp);
fclose(fp);
}
}
void _epilogue(struct func *callee) {
_caller = 0;
}
void _prologue(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;
if (next == 0)
atexit(bbexit);
}
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;
}
|
