Commit | Line | Data |
---|---|---|
bbc0d894 PK |
1 | \" @(#)abstract.me 1.1 %G% |
2 | .ls 1 | |
3 | .lp | |
4 | .sp 1 | |
5 | .ce 1000 | |
6 | \fB\s+2gprof: a Call Graph Execution Profiler\s-2\fP\** | |
7 | .(f | |
8 | \**This work was supported by grant MCS80-05144 | |
9 | from the National Science Foundation. | |
10 | .)f | |
11 | .sp 1 | |
12 | by | |
13 | \fISusan L. Graham\fP | |
14 | \fIPeter B. Kessler\fP | |
15 | \fIMarshall K. McKusick\fP | |
16 | .sp 1 | |
17 | Computer Science Division | |
18 | Electrical Engineering and Computer Science Department | |
19 | University of California, Berkeley | |
20 | Berkeley, California 94720 | |
21 | .ce 0 | |
22 | .sp 1 | |
23 | .sh 0 "Abstract" | |
24 | .pp | |
25 | Programs the size and complexity of compilers | |
26 | are composed of a large number of small routines, | |
27 | each implementing an abstraction for the routines | |
28 | that call it. | |
29 | To be useful, an execution profiler must attribute | |
30 | execution time in a way that is meaningful in terms of the | |
31 | logical structure of a program | |
32 | as well as its decomposition. | |
33 | The information must then be displayed to the user | |
34 | in a convenient and informative way. | |
35 | The \fBgprof\fP profiler described in this paper | |
36 | incorporates the running time of called routines | |
37 | in the running time of the routines that call them. | |
38 | The design and use of this profiler is described. |