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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
#include <u.h>
#include <libc.h>
#include <bio.h>
#include <mach.h>
#define Extern extern
#include "sparc.h"
#define prof profki
#define Percent(num, max) (((num)*100)/(max))
extern Inst op0[], op2[], op3[];
Inst *tables[] = { op0, op2, op3, 0 };
void
isum(void)
{
Inst *i;
int pct, j;
int total, loads, stores, arith, branch;
int useddelay, taken, sparcreg, syscall, realarith;
total = 0;
loads = 0;
stores = 0;
arith = 0;
branch = 0;
useddelay = 0;
taken = 0;
sparcreg = 0;
syscall = 0;
realarith = 0;
/* Compute the total so we can have percentages */
for(j = 0; tables[j]; j++)
for(i = tables[j]; i->func; i++)
if(i->name && i->count)
total += i->count;
Bprint(bioout, "\nInstruction summary.\n\n");
for(j = 0; tables[j]; j++) {
for(i =tables[j]; i->func; i++) {
if(i->name) {
if(i->count == 0)
continue;
pct = Percent(i->count, total);
if(pct != 0)
Bprint(bioout, "%-8ud %3d%% %s\n",
i->count, Percent(i->count, total), i->name);
else
Bprint(bioout, "%-8ud %s\n",
i->count, i->name);
switch(i->type) {
default:
fatal(0, "isum bad stype %d\n", i->type);
case Iload:
loads += i->count;
break;
case Istore:
stores += i->count;
break;
case Iarith:
arith += i->count;
break;
case Ibranch:
branch += i->count;
taken += i->taken;
useddelay += i->useddelay;
break;
case Ireg:
sparcreg += i->count;
break;
case Isyscall:
syscall += i->count;
break;
case Ifloat:
realarith += i->count;
break;
case Inop:
arith += i->count;
i->count -= nopcount;
break;
}
}
}
}
total += anulled;
Bprint(bioout, "\n%-8ud Memory cycles\n", loads+stores+total);
Bprint(bioout, "%-8ud %3d%% Instruction cycles\n",
total, Percent(total, loads+stores+total));
Bprint(bioout, "%-8lud %3ld%% Annulled branch cycles\n",
anulled, Percent(anulled, total));
Bprint(bioout, "%-8ud %3d%% Data cycles\n\n",
loads+stores, Percent(loads+stores, loads+stores+total));
Bprint(bioout, "%-8ud %3d%% Stores\n", stores, Percent(stores, total));
Bprint(bioout, "%-8ud %3d%% Loads\n", loads, Percent(loads, total));
Bprint(bioout, " %-8ud Store stall\n", stores*2);
Bprint(bioout, " %-8lud Load stall\n", loadlock);
Bprint(bioout, "%-8ud %3d%% Arithmetic\n", arith, Percent(arith, total));
Bprint(bioout, "%-8ud %3d%% Floating point\n",
realarith, Percent(realarith, total));
Bprint(bioout, "%-8ud %3d%% Sparc special register load/stores\n",
sparcreg, Percent(sparcreg, total));
Bprint(bioout, "%-8ud %3d%% System calls\n", syscall, Percent(syscall, total));
Bprint(bioout, "%-8ud %3d%% Branches\n", branch, Percent(branch, total));
Bprint(bioout, " %-8ud %3d%% Branches taken\n",
taken, Percent(taken, branch));
Bprint(bioout, " %-8ud %3d%% Delay slots\n",
useddelay, Percent(useddelay, branch));
Bprint(bioout, " %-8ud %3d%% Unused delay slots\n",
nopcount, Percent(nopcount, branch));
Bprint(bioout, "%-8ud %3d%% Program total delay slots\n",
nopcount, Percent(nopcount, total));
}
char *stype[] = { "Stack", "Text", "Data", "Bss" };
void
segsum(void)
{
Segment *s;
int i;
Bprint(bioout, "\n\nMemory Summary\n\n");
Bprint(bioout, " Base End Resident References\n");
for(i = 0; i < Nseg; i++) {
s = &memory.seg[i];
Bprint(bioout, "%-5s %.8lux %.8lux %-8d %-8d\n",
stype[i], s->base, s->end, s->rss*BY2PG, s->refs);
}
}
typedef struct Prof Prof;
struct Prof
{
Symbol s;
long count;
};
Prof prof[5000];
int
profcmp(void *va, void *vb)
{
Prof *a, *b;
a = va;
b = vb;
return b->count - a->count;
}
void
iprofile(void)
{
Prof *p, *n;
int i, b, e;
ulong total;
extern ulong textbase;
i = 0;
p = prof;
if(textsym(&p->s, i) == 0)
return;
i++;
for(;;) {
n = p+1;
if(textsym(&n->s, i) == 0)
break;
b = (p->s.value-textbase)/PROFGRAN;
e = (n->s.value-textbase)/PROFGRAN;
while(b < e)
p->count += iprof[b++];
i++;
p = n;
}
qsort(prof, i, sizeof(Prof), profcmp);
total = 0;
for(b = 0; b < i; b++)
total += prof[b].count;
Bprint(bioout, " cycles %% symbol file\n");
for(b = 0; b < i; b++) {
if(prof[b].count == 0)
continue;
Bprint(bioout, "%8ld %3ld.%ld %-15s ",
prof[b].count,
100*prof[b].count/total,
(1000*prof[b].count/total)%10,
prof[b].s.name);
printsource(prof[b].s.value);
Bputc(bioout, '\n');
}
memset(prof, 0, sizeof(Prof)*i);
}
|
