BSD 4_3_Tahoe development
[unix-history] / usr / man / cat1 / gprof.0
CommitLineData
362b077f
C
1
2
3
4GPROF(1) UNIX Programmer's Manual GPROF(1)
5
6
7
8N\bNA\bAM\bME\bE
9 gprof - display call graph profile data
10
11S\bSY\bYN\bNO\bOP\bPS\bSI\bIS\bS
12 g\bgp\bpr\bro\bof\bf [ options ] [ a.out [ gmon.out ... ] ]
13
14D\bDE\bES\bSC\bCR\bRI\bIP\bPT\bTI\bIO\bON\bN
15 _\bg_\bp_\br_\bo_\bf produces an execution profile of C, Pascal, or For-
16 tran77 programs. The effect of called routines is incor-
17 porated in the profile of each caller. The profile data is
18 taken from the call graph profile file (_\bg_\bm_\bo_\bn._\bo_\bu_\bt default)
19 which is created by programs that are compiled with the -\b-p\bpg\bg
20 option of _\bc_\bc, _\bp_\bc, and _\bf_\b7_\b7. The -\b-p\bpg\bg option also links in
21 versions of the library routines that are compiled for pro-
22 filing. The symbol table in the named object file (_\ba._\bo_\bu_\bt
23 default) is read and correlated with the call graph profile
24 file. If more than one profile file is specified, the _\bg_\bp_\br_\bo_\bf
25 output shows the sum of the profile information in the given
26 profile files.
27
28 _\bG_\bp_\br_\bo_\bf calculates the amount of time spent in each routine.
29 Next, these times are propagated along the edges of the call
30 graph. Cycles are discovered, and calls into a cycle are
31 made to share the time of the cycle. The first listing
32 shows the functions sorted according to the time they
33 represent including the time of their call graph descen-
34 dents. Below each function entry is shown its (direct) call
35 graph children, and how their times are propagated to this
36 function. A similar display above the function shows how
37 this function's time and the time of its descendents is pro-
38 pagated to its (direct) call graph parents.
39
40 Cycles are also shown, with an entry for the cycle as a
41 whole and a listing of the members of the cycle and their
42 contributions to the time and call counts of the cycle.
43
44 Second, a flat profile is given, similar to that provided by
45 _\bp_\br_\bo_\bf(1). This listing gives the total execution times, the
46 call counts, the number of milliseconds per call in the rou-
47 tine itself, and the number of milliseconds per call in the
48 routine itself including its descendents.
49
50 Finally, an index of the function names is provided.
51
52 The following options are available:
53
54 -\b-a\ba suppresses the printing of statically declared func-
55 tions. If this option is given, all relevant informa-
56 tion about the static function (_\be._\bg., time samples,
57 calls to other functions, calls from other functions)
58 belongs to the function loaded just before the static
59 function in the _\ba._\bo_\bu_\bt file.
60
61
62
63Printed 7/9/88 September 30, 1987 1
64
65
66
67
68
69
70GPROF(1) UNIX Programmer's Manual GPROF(1)
71
72
73
74 -\b-b\bb suppresses the printing of a description of each field
75 in the profile.
76
77 -\b-c\bc the static call graph of the program is discovered by a
78 heuristic that examines the text space of the object
79 file. Static-only parents or children are shown with
80 call counts of 0.
81
82 -\b-e\be _\bn_\ba_\bm_\be
83 suppresses the printing of the graph profile entry for
84 routine _\bn_\ba_\bm_\be and all its descendants (unless they have
85 other ancestors that aren't suppressed). More than one
86 -\b-e\be option may be given. Only one _\bn_\ba_\bm_\be may be given
87 with each -\b-e\be option.
88
89 -\b-E\bE _\bn_\ba_\bm_\be
90 suppresses the printing of the graph profile entry for
91 routine _\bn_\ba_\bm_\be (and its descendants) as -\b-e\be, above, and
92 also excludes the time spent in _\bn_\ba_\bm_\be (and its descen-
93 dants) from the total and percentage time computations.
94 (For example, -\b-E\bE _\bm_\bc_\bo_\bu_\bn_\bt -\b-E\bE _\bm_\bc_\bl_\be_\ba_\bn_\bu_\bp is the default.)
95
96 -\b-f\bf _\bn_\ba_\bm_\be
97 prints the graph profile entry of only the specified
98 routine _\bn_\ba_\bm_\be and its descendants. More than one -\b-f\bf
99 option may be given. Only one _\bn_\ba_\bm_\be may be given with
100 each -\b-f\bf option.
101
102 -\b-F\bF _\bn_\ba_\bm_\be
103 prints the graph profile entry of only the routine _\bn_\ba_\bm_\be
104 and its descendants (as -\b-f\bf,\b, above) and also uses only
105 the times of the printed routines in total time and
106 percentage computations. More than one -\b-F\bF option may
107 be given. Only one _\bn_\ba_\bm_\be may be given with each -\b-F\bF
108 option. The -\b-F\bF option overrides the -\b-E\bE option.
109
110 -\b-k\bk _\bf_\br_\bo_\bm_\bn_\ba_\bm_\be _\bt_\bo_\bn_\ba_\bm_\be
111 will delete any arcs from routine _\bf_\br_\bo_\bm_\bn_\ba_\bm_\be to routine
112 _\bt_\bo_\bn_\ba_\bm_\be. This can be used to break undesired cycles.
113 More than one -\b-k\bk option may be given. Only one pair of
114 routine names may be given with each -\b-k\bk option.
115
116 -\b-s\bs a profile file _\bg_\bm_\bo_\bn._\bs_\bu_\bm is produced that represents the
117 sum of the profile information in all the specified
118 profile files. This summary profile file may be given
119 to later executions of gprof (probably also with a -\b-s\bs)
120 to accumulate profile data across several runs of an
121 _\ba._\bo_\bu_\bt file.
122
123 -\b-z\bz displays routines that have zero usage (as shown by
124 call counts and accumulated time). This is useful with
125 the -\b-c\bc option for discovering which routines were never
126
127
128
129Printed 7/9/88 September 30, 1987 2
130
131
132
133
134
135
136GPROF(1) UNIX Programmer's Manual GPROF(1)
137
138
139
140 called.
141
142F\bFI\bIL\bLE\bES\bS
143 _\ba._\bo_\bu_\bt the namelist and text space.
144 _\bg_\bm_\bo_\bn._\bo_\bu_\bt dynamic call graph and profile.
145 _\bg_\bm_\bo_\bn._\bs_\bu_\bm summarized dynamic call graph and profile.
146
147S\bSE\bEE\bE A\bAL\bLS\bSO\bO
148 monitor(3), profil(2), cc(1), prof(1)
149 ``gprof: A Call Graph Execution Profiler'', by Graham, S.L.,
150 Kessler, P.B., McKusick, M.K.; _\bP_\br_\bo_\bc_\be_\be_\bd_\bi_\bn_\bg_\bs _\bo_\bf _\bt_\bh_\be _\bS_\bI_\bG_\bP_\bL_\bA_\bN
151 '_\b8_\b2 _\bS_\by_\bm_\bp_\bo_\bs_\bi_\bu_\bm _\bo_\bn _\bC_\bo_\bm_\bp_\bi_\bl_\be_\br _\bC_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bi_\bo_\bn, SIGPLAN Notices,
152 Vol. 17, No. 6, pp. 120-126, June 1982.
153
154B\bBU\bUG\bGS\bS
155 Beware of quantization errors. The granularity of the sam-
156 pling is shown, but remains statistical at best. We assume
157 that the time for each execution of a function can be
158 expressed by the total time for the function divided by the
159 number of times the function is called. Thus the time pro-
160 pagated along the call graph arcs to the function's parents
161 is directly proportional to the number of times that arc is
162 traversed.
163
164 Parents that are not themselves profiled will have the time
165 of their profiled children propagated to them, but they will
166 appear to be spontaneously invoked in the call graph list-
167 ing, and will not have their time propagated further. Simi-
168 larly, signal catchers, even though profiled, will appear to
169 be spontaneous (although for more obscure reasons). Any
170 profiled children of signal catchers should have their times
171 propagated properly, unless the signal catcher was invoked
172 during the execution of the profiling routine, in which case
173 all is lost.
174
175 The profiled program must call _\be_\bx_\bi_\bt(2) or return normally
176 for the profiling information to be saved in the gmon.out
177 file.
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195Printed 7/9/88 September 30, 1987 3
196
197
198