Main index | Section 1 | 日本語 | Options |
The gprof utility calculates the amount of time spent in each routine. Next, these times are propagated along the edges of the call graph. Cycles are discovered, and calls into a cycle are made to share the time of the cycle. The first listing shows the functions sorted according to the time they represent including the time of their call graph descendants. Below each function entry is shown its (direct) call graph children, and how their times are propagated to this function. A similar display above the function shows how this function's time and the time of its descendants is propagated to its (direct) call graph parents.
Cycles are also shown, with an entry for the cycle as a whole and a listing of the members of the cycle and their contributions to the time and call counts of the cycle.
Second, a flat profile is given, similar to that provided by prof(1). This listing gives the total execution times, the call counts, the time that the call spent in the routine itself, and the time that the call spent in the routine itself including its descendants. The units for the per-call times are normally milliseconds, but they are nanoseconds if the profiling clock frequency is 10 million or larger, and if a function appears to be never called then its total self time is printed as a percentage in the self time per call column. The very high profiling clock frequencies needed to get sufficient accuracy in the per-call times for short-lived programs are only implemented for "high resolution" (non-statistical) kernel profiling.
Finally, an index of the function names is provided.
The following options are available:
| |
Suppress the printing of statically declared functions. If this option is given, all relevant information about the static function (e.g., time samples, calls to other functions, calls from other functions) belongs to the function loaded just before the static function in the a.out file. | |
| |
Suppress the printing of a description of each field in the profile. | |
| |
Find a minimal set of arcs that can be broken to eliminate all cycles with count or more members. Caution: the algorithm used to break cycles is exponential, so using this option may cause gprof to run for a very long time. | |
| |
Suppress the printing of the graph profile entry for routine
name
and all its descendants
(unless they have other ancestors that are not suppressed).
More than one
| |
| |
Suppress the printing of the graph profile entry for routine
name
(and its descendants) as
| |
| |
Print the graph profile entry of only the specified routine
name
and its descendants.
More than one
| |
| |
Print the graph profile entry of only the routine
name
and its descendants (as
| |
| |
Will delete any arcs from routine
fromname
to routine
toname.
This can be used to break undesired cycles.
More than one
| |
| |
Gather information about symbols from the currently-running kernel using the sysctl(3) and kldsym(2) interfaces. This forces the a.out argument to be ignored, and allows for symbols in kld(4) modules to be used. | |
| |
Suppress the printing of the call-graph profile. | |
| |
Suppress the printing of the flat profile. | |
| |
A profile file
gmon.sum
is produced that represents
the sum of the profile information in all the specified profile files.
This summary profile file may be given to later
executions of gprof (probably also with a
| |
| |
Suppress the printing of functions whose names are not visible to C programs. For the ELF object format, this means names that contain the ‘.amp;’ character. For the a.out object format, it means names that do not begin with a ‘_’ character. All relevant information about such functions belongs to the (non-suppressed) function with the next lowest address. This is useful for eliminating "functions" that are just labels inside other functions. | |
| |
Display routines that have zero usage (as shown by call counts and accumulated time). | |
a.out | The namelist and text space. |
a.out.gmon | |
Dynamic call graph and profile. | |
gmon.sum | Summarized dynamic call graph and profile. |
Software - Practice and Experience, pp. 671-685, An Execution Profiler for Modular Programs, 13, 1983.
, , ,6, Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, SIGPLAN Notices, pp. 120-126, gprof: A Call Graph Execution Profiler, 17, June 1982.
, , ,Parents that are not themselves profiled will have the time of their profiled children propagated to them, but they will appear to be spontaneously invoked in the call graph listing, and will not have their time propagated further. Similarly, signal catchers, even though profiled, will appear to be spontaneous (although for more obscure reasons). Any profiled children of signal catchers should have their times propagated properly, unless the signal catcher was invoked during the execution of the profiling routine, in which case all is lost.
The profiled program must call exit(3) or return normally for the profiling information to be saved in the graph profile file.
GPROF (1) | November 27, 2017 |
Main index | Section 1 | 日本語 | Options |
Please direct any comments about this manual page service to Ben Bullock. Privacy policy.
“ | Do you laugh when the waiter drops a tray full of dishes? Unix weenies do. They're the first ones to laugh at hapless users, trying to figure out an error message that doesn't have anything to do with what they just typed. | ” |
— The Unix Haters' handbook |