Lines Matching refs:which
51 can use it to determine which parts of a program are taking most of the
74 can use it to determine which parts of a program are taking most of the
138 (@file{gmon.out} default) which is created by programs
173 the execution of the profiling routine, in which case all is lost.
206 Profiling allows you to learn where your program spent its time and which
207 functions called which other functions while it was executing. This
208 information can show you which pieces of your program are slower than you
210 execute faster. It can also tell you which functions are being called more
245 which functions burn most of the cycles, it is stated concisely here.
248 The @dfn{call graph} shows, for each function, which functions called it, which
327 If you are running the program on a system which supports shared
333 support code, which for @code{gcc} users can be done via the
360 @samp{-finstrument-functions} command line option which will insert
454 * Deprecated Options:: Options you no longer need to use, but which
463 These options specify which of several output formats
472 which prints a flat profile and call graph analysis
509 which to find source files. Environment variable @var{GPROF_PATH}
525 source filenames, which is determined
527 and is relative to the directory in which the compiler
585 This option suggests an ordering which may improve paging, tlb and
586 cache behavior for the program on systems which support arbitrary
597 This option suggests an ordering which may improve paging, tlb and
598 cache behavior for the program on systems which do not support arbitrary
603 The @var{map_file} argument is a pathname to a file which provides
662 names are not listed as global, and which are not visible outside the
672 augmented by a heuristic which examines the text space of the object
686 The @samp{-D} option causes @code{gprof} to ignore symbols which
697 The @samp{-l} option enables line-by-line profiling, which causes
744 @samp{-c} option for discovering which routines were never called.
773 file called @file{gmon.sum}, which contains all the information from
846 using @dfn{symspecs} (symbol specifications), which observe the
899 most important of which are described below. The simplest output
908 * Call Graph:: The call graph shows which functions called which
1083 in square brackets. The end of this line says which function the entry is
1105 describes the function which the entry is about and gives the overall
1125 therefore has an index number, which appears at the beginning of its
1216 The name of the caller of @code{report} to which this line applies,
1229 dummy caller-line is printed which has @samp{<spontaneous>} as the
1277 The name of the subroutine of @code{main} to which this line applies,
1321 Here is an example portion of a call graph which shows a cycle containing
1348 @code{main}, which calls @code{a}, and an entry for @code{c}, with callers
1521 which lists the program's source code, each function labeled with the
1731 @item How do I find which lines in my program were executed the most times?
1735 @item How do I find which lines in my program called a particular function?
1826 which causes every function to call @code{mcount}
1841 the in-memory call graph, which records @code{frompc}, @code{selfpc},
1845 which allows a generic @code{mcount} function to extract the
1863 provide a @code{profil()} system call, which registers a memory
1873 which had to interrupt the process anyway to handle the clock
1880 which then performs the same operation of examining the
1893 which invokes @code{monstartup} before @code{main},
1913 The profiling library also includes a function (@code{mcleanup}) which is
1946 in a profile data file is in the native format of the target for which
1971 architectures that support performance monitor hardware (which,
1998 identify exactly which line of source code performed calls to a
2016 options are specified which use symspecs.
2018 which will eventually get turned into 12 symbol tables,
2062 First, the @code{qsort} library function (which sorts an array)
2065 which finds symbols
2067 which requires the symbol table to be a sorted array.
2077 (@code{syms}) is created, each entry of which is a symbol table
2083 the tables, which have been malloced between passes.
2135 in which case a fraction of the sample count is allocated
2151 numerical order, which is reverse topological
2154 of which are assigned the same topological number.
2170 Finally, print the various outputs the user requested, which is now fairly
2190 (to stdout) which can be helpful in understanding its operation.