Lines Matching full:each
89 The "flat profile" shows how much time your program spent in each
94 The "call graph" shows, for each function, which functions called
96 an estimate of how much time was spent in the subroutines of each
102 code, labeled with the number of times each line of the program was
147 Each sample counts as 0.01 seconds.
315 the number of times each was called. If SYMSPEC is specified,
375 The `-t' option causes the NUM most active source lines in each
393 and the number of times each was called. If SYMSPEC is specified,
512 this option will also identify how many times each line of code
597 FUNCTION_NAME may be indicated with each `-e' option.
604 may be given; only one FUNCTION_NAME may be indicated with each
611 FUNCTION_NAME may be indicated with each `-f' option.
618 FUNCTION_NAME may be indicated with each `-F' option. The `-F'
622 Note that only one function can be specified with each `-e', `-E',
696 executing directly in each function.
698 others, and how much time each function used
711 executing each function. Unless the `-z' option is given, functions
721 Each sample counts as 0.01 seconds.
747 much time each sample counted as. This "sampling period" estimates the
748 margin of error in each of the time figures. A time figure that is not
749 much larger than this is not reliable. In this example, each sample
752 `cumulative seconds' field. Since each sample counted for 0.01
755 indicated by the `self seconds' field. Each of the other four samples
756 occurred one each in `offtime', `memccpy', `write', and `mcount'.
767 of histogram samples prevents any determination of how much time each
770 Here is what the fields in each line mean:
814 The "call graph" shows how much time was spent in each function and its
822 granularity: each sample hit covers 2 byte(s) for 20.00% of 0.05 seconds
852 each function. Each entry has one or more lines.
854 In each entry, the primary line is the one that starts with an index
895 Entries are numbered with consecutive integers. Each function
899 Each cross-reference to a function, as a caller or subroutine of
952 A function's entry has a line for each function it was called by.
1006 A function's entry has a line for each of its subroutines--in other
1007 words, a line for each other function that it called. These lines'
1061 they belong to the same cycle. If `a' and `b' call each other and `b'
1062 and `c' call each other, all three make one cycle. Note that even if
1067 belongs to a cycle, each time the function name appears in the call
1174 These lines show how many times each function in the cycle called or
1175 was called from each other function in the cycle. The `self' and
1202 each line of code that called each function, along with a count.
1210 Each sample counts as 0.01 seconds.
1219 granularity: each sample hit covers 4 byte(s) for 7.69% of 0.13 seconds
1232 hit occurred on each of lines 349, 351, 382 and 385. In the call graph,
1239 Each sample counts as 0.01 seconds.
1251 granularity: each sample hit covers 4 byte(s) for 7.69% of 0.13 seconds
1276 the program's source code, each function labeled with the number of
1283 times each line of code was executed. With newer versions of `gcc'
1312 one for each branch of the `if'. A fourth basic-block results from the
1318 `gprof -l -A'. The `-x' option is also helpful, to ensure that each
1343 each branch of the `if' statement. The body of the `do' loop was
1345 annotated. It began execution 26312 times, once for each iteration
1435 The assumption made is that the average time spent in each call to
1490 each run will appear with a call count of 100).
1566 `selfpc', and the number of times each of these call arcs was traversed.
1620 enabled. Each object file is then compiled with a static array of
1625 the starting address of each basic-block. Taken together, the two
1672 records. Each file can contain any number of each record type. When
1674 compatible with each other and compute the union of all records. For
1676 of all execution counts for each basic-block.
1699 Histogram bins are 16-bit numbers and each bin represent an equal
1701 bytes long and if there are ten bins in the histogram, each bin
1740 each for the flat profile (INCL_FLAT/EXCL_FLAT), the call graph arcs
1785 each entry of which is a symbol table of Syms to be included or
1789 twice, once to count the size of each required symbol table, and again
1803 with multiple histogram records) are read, the memory ranges of each
1805 For each pair of histogram records, the resolution (memory region size
1810 As each call graph record is read (`call_graph.c:cg_read_rec'), the
1813 a symspec check against INCL_ARCS/EXCL_ARCS. As each arc is added, a
1819 only if line-by-line profiling has been selected. Each basic-block
1834 which case a fraction of the sample count is allocated to each symbol,
1837 and can cause each of two adjacent lines to be credited with half a
1842 scans through each symbol's machine code, looking for subroutine call
1852 computes the fraction of child time to propagate to each parent and a
1869 if present, to label each line of code with call counts, otherwise only
1896 As the call graph arcs are read, show each arc and how the total
1897 calls to each function are tallied
1900 Details sorting individual parents/children within each call graph
1904 Shows address ranges of histograms as they are read, and each call
2070 machine-readable Transparent copy along with each Opaque copy, or
2071 state in or with each Opaque copy a publicly-accessible
2140 substance and tone of each of the contributor acknowledgements
2191 but different contents, make the title of each such section unique
2210 rules of this License for verbatim copying of each of the
2269 Each version of the License is given a distinguishing version
