| gprof.1 (21748) | gprof.1 (38928) |
|---|---|
| 1.\" Copyright (c) 1983, 1990, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 99 unchanged lines hidden (view full) --- 108file. 109.It Fl b 110Suppresses the printing of a description of each field in the profile. 111.It Fl c 112The static call graph of the program is discovered by a heuristic 113that examines the text space of the object file. 114Static-only parents or children are shown 115with call counts of 0. | 1.\" Copyright (c) 1983, 1990, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 99 unchanged lines hidden (view full) --- 108file. 109.It Fl b 110Suppresses the printing of a description of each field in the profile. 111.It Fl c 112The static call graph of the program is discovered by a heuristic 113that examines the text space of the object file. 114Static-only parents or children are shown 115with call counts of 0. |
| 116This option is not supported on some architectures. |
|
| 116.It Fl C Ar count 117Find a minimal set of arcs that can be broken to eliminate all cycles with 118.Ar count 119or more members. 120Caution: the algorithm used to break cycles is exponential, 121so using this option may cause 122.Nm gprof 123to run for a very long time. --- 81 unchanged lines hidden (view full) --- 205the sum of the profile information in all the specified profile files. 206This summary profile file may be given to later 207executions of gprof (probably also with a 208.Fl s ) 209to accumulate profile data across several runs of an 210.Pa a.out 211file. 212.It Fl u | 117.It Fl C Ar count 118Find a minimal set of arcs that can be broken to eliminate all cycles with 119.Ar count 120or more members. 121Caution: the algorithm used to break cycles is exponential, 122so using this option may cause 123.Nm gprof 124to run for a very long time. --- 81 unchanged lines hidden (view full) --- 206the sum of the profile information in all the specified profile files. 207This summary profile file may be given to later 208executions of gprof (probably also with a 209.Fl s ) 210to accumulate profile data across several runs of an 211.Pa a.out 212file. 213.It Fl u |
| 213Suppresses the printing of functions whose name does not begin with 214an underscore. | 214Suppresses the printing of functions whose names are not visible to 215C programs. For the ELF object format, this means names that 216contain the 217.Ql \&. 218character. For the a.out object format, it means names that do not 219begin with a 220.Ql _ 221character. |
| 215All relevant information about such functions belongs to the 216(non-suppressed) function with the next lowest address. 217This is useful for eliminating "functions" that are just labels 218inside other functions. 219.It Fl z 220Displays routines that have zero usage (as shown by call counts 221and accumulated time). 222This is useful with the --- 71 unchanged lines hidden --- | 222All relevant information about such functions belongs to the 223(non-suppressed) function with the next lowest address. 224This is useful for eliminating "functions" that are just labels 225inside other functions. 226.It Fl z 227Displays routines that have zero usage (as shown by call counts 228and accumulated time). 229This is useful with the --- 71 unchanged lines hidden --- |