Home | History | Annotate | Download | only in info

Lines Matching full:calls

97 function calls that use a lot of time.  *Note Call Graph::.
146 time seconds seconds calls Ts/call Ts/call name
159 you number-of-calls information for standard library functions such as
170 (except that the `calls' field for the functions will be blank), but
195 to insert calls to special user supplied instrumentation routines at
232 directory_ at the time it exits. This means that if your program calls
483 spent in these functions, calls to/from them, etc, will all be
492 object file and identifies function calls in the binary machine
495 have been called, but never were. Calls to functions that were
497 if symbol table entries are present for them. Calls to dynamic
704 when its subroutine calls are included.
717 with no apparent time spent in them, and no apparent calls to them, are
728 time seconds seconds calls ms/call ms/call name
746 then by decreasing number of calls, then alphabetically by name. The
770 they are listed, sorted in decreasing order by the `calls' field.
790 `calls'
794 compiled with profiling enabled), the "calls" field is blank.
810 this field alphabetically after the "self seconds" and "calls"
877 such as `a' calls `b' calls `a'...
924 This is the total amount of time spent in the subroutine calls
933 separated by a `+'. The first number counts non-recursive calls,
934 and the second counts recursive calls.
982 amount of time spent within calls to `report' from `main'.
986 followed by the total number of non-recursive calls to `report'
996 of the functions it calls.
1037 total time spent in calls to `report' from `main'.
1040 Two numbers, the number of calls to `report' from `main' followed
1041 by the total number of non-recursive calls to `report'. This
1059 in the call graph. A cycle exists if a function calls another function
1060 that (directly or indirectly) calls (or appears to call) the original
1061 function. For example: if `a' calls `b', and `b' calls `a', then `a'
1067 `b' only calls `a' if it was not called from `a', `gprof' cannot
1113 for `main', which calls `a', and an entry for `c', with callers `a' and
1153 lines count only subroutines outside the cycle. Even though `a' calls
1154 `b', the time spent in those calls to `b' is not counted in `a''s
1156 when the time in those calls to `b' includes indirect recursive calls
1164 The `calls' field in the primary line for the cycle has two numbers:
1168 the cycle calls itself). This is a generalization of the usual split
1169 into non-recursive and recursive calls.
1171 The `calls' field of a subroutine-line for a cycle member in the
1174 the primary line's `calls' field.
1203 13327 calls to `init_block'.
1209 time seconds seconds calls us/call us/call name
1230 graph, note how `ct_init''s 13327 calls to `init_block' are broken down
1231 into one call from line 396, 3071 calls from line 384, 3730 calls from
1232 line 385, and 6525 calls from 387.
1238 time seconds seconds calls name
1366 By contrast, the number-of-calls and basic-block figures are derived
1430 used 5 seconds in all, and 2/5 of the calls to `foo' came from `a',
1438 all the time spent in `foo' is in the calls from callers other than `a'.
1457 of calls to smaller ones. Beware however that this can introduce
1459 overhead to function calls. An alternative solution is to use a
1509 parent and as a child, with a `calls' field that lists the number
1510 of recursive calls. GNU `gprof' omits these lines and puts the
1511 number of recursive calls in the primary line.
1562 and then calls `__mcount_internal' (a normal C function) with two
1574 Number-of-calls information for library routines is collected by
1609 either calls `profil()' or sets up a clock signal handler. This
1616 (typically when `main' is called), calls `monstartup'.
1716 exactly which line of source code performed calls to a function.
1895 calls to each function are tallied