67 lines
2.8 KiB
Plaintext
67 lines
2.8 KiB
Plaintext
.\" Copyright (c) 1982, 1993
|
|
.\" The Regents of the University of California. All rights reserved.
|
|
.\"
|
|
.\" Redistribution and use in source and binary forms, with or without
|
|
.\" modification, are permitted provided that the following conditions
|
|
.\" are met:
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
|
.\" notice, this list of conditions and the following disclaimer.
|
|
.\" 2. Redistributions in binary form must reproduce the above copyright
|
|
.\" notice, this list of conditions and the following disclaimer in the
|
|
.\" documentation and/or other materials provided with the distribution.
|
|
.\" 3. All advertising materials mentioning features or use of this software
|
|
.\" must display the following acknowledgement:
|
|
.\" This product includes software developed by the University of
|
|
.\" California, Berkeley and its contributors.
|
|
.\" 4. Neither the name of the University nor the names of its contributors
|
|
.\" may be used to endorse or promote products derived from this software
|
|
.\" without specific prior written permission.
|
|
.\"
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
.\" SUCH DAMAGE.
|
|
.\"
|
|
.\" @(#)abstract.me 8.1 (Berkeley) 6/8/93
|
|
.\"
|
|
.sp 1
|
|
\fB\s+2gprof: a Call Graph Execution Profiler\s-2\fP\**
|
|
.(f
|
|
\**This work was supported by grant MCS80-05144
|
|
from the National Science Foundation.
|
|
.)f
|
|
.sp 1
|
|
by
|
|
\fISusan L. Graham\fP
|
|
\fIPeter B. Kessler\fP
|
|
\fIMarshall K. McKusick\fP
|
|
.sp 1
|
|
Computer Science Division
|
|
Electrical Engineering and Computer Science Department
|
|
University of California, Berkeley
|
|
Berkeley, California 94720
|
|
.ce 0
|
|
.sp 1
|
|
.sp 0.5i
|
|
.sh 0 "Abstract"
|
|
.pp
|
|
Large complex programs are composed of many small routines
|
|
that implement abstractions for the routines that call them.
|
|
To be useful, an execution profiler must attribute
|
|
execution time in a way that is significant for the
|
|
logical structure of a program
|
|
as well as for its textual decomposition.
|
|
This data must then be displayed to the user
|
|
in a convenient and informative way.
|
|
The \fBgprof\fP profiler
|
|
accounts for the running time of called routines
|
|
in the running time of the routines that call them.
|
|
The design and use of this profiler is described.
|