Suppress printing statically declared functions. If this option is given, all relevant information about the static function (such as time samples, calls to other functions, and calls from other functions) belongs to the function loaded just before the static function in the a.out ®le.
Suppress printing a description of each ®eld in the pro®le.
Suppress printing the graph pro®le entry for routine name and all its descendants (unless they have other ancestors that are not suppressed). More than one -eoption can be given. Only one name can be given with each -eoption.
Suppress printing the graph pro®le entry for routine name (and its descendants) as - e above, and also exclude the time spent in name (and its descendants) from the total and percentage time computations. -E mcount -E mcleanup is the default.
Print only the graph pro®le entry of the speci®ed routine name and its descendants. More than one -foption can be given. Only one name can be given with each -foption.
Print only the graph pro®le entry of the routine name and its descendants (as -fabove) and also use only the times of the printed routines in total time and percentage computations. More than one -Foption can be given. Only one name can be given with each -Foption. The -Foption overrides the -Eoption.

g

gprof(1)

gprof(1)

NAME

gprof - display call graph pro®le data

SYNOPSIS

gprof [options] [a.out [gmon.out ... ] ] [shared_library shared_library_pro®le ]

DESCRIPTION

The gprof command produces an execution pro®le of C++, C, Pascal, and FORTRAN programs. The effect of called routines is incorporated into the pro®le of each caller. Pro®le data is taken from the call graph pro®le ®le (gmon.out default) that is created by programs compiled with the -Goption of aCC, CC,

cc, pc, and f77. That option also links in versions of the library routines that are compiled for pro®ling. The symbol table in the named object ®le (a.out default) is read and correlated with the call graph pro®le ®le. If more than one pro®le ®le is speci®ed, gprof output shows the sum of the pro®le information in the given pro®le ®les.

First, a ¯at pro®le is given, similar to that provided by prof (see prof(1)). This listing gives the total execution times and call counts for each function in the program, sorted by decreasing time.

Next, these times are propagated along the edges of the call graph. gprof discovers all cycles in the call graph. All calls made into the cycle share the time of that cycle. A second 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 the time of this function and the time of its descendants are 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, each with their contributions to the time and call counts of the cycle.

Shared Library Pro®ling (32-bit only)

Support for gprof pro®ling of shared libraries is available on 32-bit systems only.

To pro®le shared libraries, set the environment variable LD_PROFILE to the path of the shared library to be pro®led. (See HP-UX Linker and Libraries Online User's Guide for details.) Do not use the -Goption to compile programs for shared libraries pro®ling. Do not link the executable gcrt0.o or mcrt0.o. This turns on pro®ling of a.out, which is not compatible with pro®ling of shared libraries. You can either pro®le your executable or a shared library, but not both.

At the termination of the program, a pro®le ®le with the name of the shared library prepended to it is generated by a run-time library. To get the complete listing, provide the gprof command with names of the shared library and the pro®le ®le for the shared library as arguments.

Options

The gprof command recognizes the following options:

-a

-b

-ename

-Ename

-fname

-Fname

Section 1−336

− 1 −

HP-UX Release 11i: December 2000