1 .\" Copyright (c) 1983, 1990 The Regents of the University of California.
2 .\" All rights reserved.
4 .\" Redistribution and use in source and binary forms are permitted provided
5 .\" that: (1) source distributions retain this entire copyright notice and
6 .\" comment, and (2) distributions including binaries display the following
7 .\" acknowledgement: ``This product includes software developed by the
8 .\" University of California, Berkeley and its contributors'' in the
9 .\" documentation or other materials provided with the distribution and in
10 .\" all advertising materials mentioning features or use of this software.
11 .\" Neither the name of the University nor the names of its contributors may
12 .\" be used to endorse or promote products derived from this software without
13 .\" specific prior written permission.
14 .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
15 .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
16 .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18 .\" @(#)gprof.1 6.6 (Berkeley) 7/24/90
20 .TH GPROF 1 "January 29, 1993"
22 gprof \- display call graph profile data
24 .B gprof [ \-abcsz ] [ \-e|\-E
39 produces an execution profile of C, Pascal, or Fortran77 programs.
40 The effect of called routines is incorporated in the profile of each caller.
41 The profile data is taken from the call graph profile file
42 \&(`gmon.out' default) which is created by programs
43 that are compiled with the
52 option also links in versions of the library routines
53 that are compiled for profiling.
55 reads the given object file (the default is `a.out')
56 and establishes the relation between its symbol table
57 and the call graph profile from `gmon.out'.
58 If more than one profile file is specified,
61 output shows the sum of the profile information in the given profile files.
64 calculates the amount of time spent in each routine.
65 Next, these times are propagated along the edges of the call graph.
66 Cycles are discovered, and calls into a cycle are made to share the time
68 The first listing shows the functions
69 sorted according to the time they represent
70 including the time of their call graph descendents.
71 Below each function entry is shown its (direct) call graph children,
72 and how their times are propagated to this function.
73 A similar display above the function shows how this function's time and the
74 time of its descendents is propagated to its (direct) call graph parents.
76 Cycles are also shown, with an entry for the cycle as a whole and
77 a listing of the members of the cycle and their contributions to the
78 time and call counts of the cycle.
80 Second, a flat profile is given,
81 similar to that provided by
83 This listing gives the total execution times, the call counts,
84 the time in milleseconds the call spent in the routine itself, and
85 the time in milleseconds the call spent in the routine itself including
88 Finally, an index of the function names is provided.
90 The following options are available:
93 suppresses the printing of statically declared functions.
94 If this option is given, all relevant information about the static function
95 (e.g., time samples, calls to other functions, calls from other functions)
96 belongs to the function loaded just before the static function in the
100 suppresses the printing of a description of each field in the profile.
103 the static call graph of the program is discovered by a heuristic
104 that examines the text space of the object file.
105 Static-only parents or children are shown
106 with call counts of 0.
109 suppresses the printing of the graph profile entry for routine
111 and all its descendants
112 (unless they have other ancestors that aren't suppressed).
118 may be given with each
123 suppresses the printing of the graph profile entry for routine
125 (and its descendants) as
127 above, and also excludes the time spent in
129 (and its descendants) from the total and percentage time computations.
136 prints the graph profile entry of only the specified routine
144 may be given with each
149 prints the graph profile entry of only the routine
151 and its descendants (as
153 above) and also uses only the times of the printed routines
154 in total time and percentage computations.
160 may be given with each
171 .BI "\-k " "fromname toname"
172 will delete any arcs from routine
176 This can be used to break undesired cycles.
180 Only one pair of routine names may be given with each
185 a profile file `gmon.sum' is produced that represents
186 the sum of the profile information in all the specified profile files.
187 This summary profile file may be given to later
188 executions of gprof (probably also with a
190 to accumulate profile data across several runs of an `objfile' file.
193 prints the version number for gprof, and then exits.
196 displays routines that have zero usage (as shown by call counts
197 and accumulated time).
198 This is useful with the
200 option for discovering which routines were never called.
204 a.out the namelist and text space.
206 gmon.out dynamic call graph and profile.
208 gmon.sum summarized dynamic call graph and profile.
215 ``An Execution Profiler for Modular Programs'',
216 by S. Graham, P. Kessler, M. McKusick;
218 Software \- Practice and Experience,
219 Vol. 13, pp. 671-685, 1983.
221 ``gprof: A Call Graph Execution Profiler'',
222 by S. Graham, P. Kessler, M. McKusick;
224 Proceedings of the SIGPLAN '82 Symposium on Compiler Construction,
225 SIGPLAN Notices, Vol. 17, No 6, pp. 120-126, June 1982.
230 The granularity of the sampling is shown, but remains
232 We assume that the time for each execution of a function
233 can be expressed by the total time for the function divided
234 by the number of times the function is called.
235 Thus the time propagated along the call graph arcs to the function's
236 parents is directly proportional to the number of times that
239 Parents that are not themselves profiled will have the time of
240 their profiled children propagated to them, but they will appear
241 to be spontaneously invoked in the call graph listing, and will
242 not have their time propagated further.
243 Similarly, signal catchers, even though profiled, will appear
244 to be spontaneous (although for more obscure reasons).
245 Any profiled children of signal catchers should have their times
246 propagated properly, unless the signal catcher was invoked during
247 the execution of the profiling routine, in which case all is lost.
249 The profiled program must call
251 or return normally for the profiling information to be saved
252 in the `gmon.out' file.