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.
326 the number of times each was called. If SYMSPEC is specified,
386 The `-t' option causes the NUM most active source lines in each
404 and the number of times each was called. If SYMSPEC is specified,
523 this option will also identify how many times each line of code
615 FUNCTION_NAME may be indicated with each `-e' option.
622 may be given; only one FUNCTION_NAME may be indicated with each
629 FUNCTION_NAME may be indicated with each `-f' option.
636 FUNCTION_NAME may be indicated with each `-F' option. The `-F'
640 Note that only one function can be specified with each `-e', `-E',
714 executing directly in each function.
716 others, and how much time each function used
729 executing each function. Unless the `-z' option is given, functions
739 Each sample counts as 0.01 seconds.
765 much time each sample counted as. This "sampling period" estimates the
766 margin of error in each of the time figures. A time figure that is not
767 much larger than this is not reliable. In this example, each sample
770 `cumulative seconds' field. Since each sample counted for 0.01
773 indicated by the `self seconds' field. Each of the other four samples
774 occurred one each in `offtime', `memccpy', `write', and `mcount'.
785 of histogram samples prevents any determination of how much time each
788 Here is what the fields in each line mean:
832 The "call graph" shows how much time was spent in each function and its
840 granularity: each sample hit covers 2 byte(s) for 20.00% of 0.05 seconds
870 each function. Each entry has one or more lines.
872 In each entry, the primary line is the one that starts with an index
913 Entries are numbered with consecutive integers. Each function
917 Each cross-reference to a function, as a caller or subroutine of
970 A function's entry has a line for each function it was called by.
1024 A function's entry has a line for each of its subroutines--in other
1025 words, a line for each other function that it called. These lines'
1079 they belong to the same cycle. If `a' and `b' call each other and `b'
1080 and `c' call each other, all three make one cycle. Note that even if
1085 belongs to a cycle, each time the function name appears in the call
1192 These lines show how many times each function in the cycle called or
1193 was called from each other function in the cycle. The `self' and
1220 each line of code that called each function, along with a count.
1228 Each sample counts as 0.01 seconds.
1237 granularity: each sample hit covers 4 byte(s) for 7.69% of 0.13 seconds
1250 hit occurred on each of lines 349, 351, 382 and 385. In the call graph,
1257 Each sample counts as 0.01 seconds.
1269 granularity: each sample hit covers 4 byte(s) for 7.69% of 0.13 seconds
1294 the program's source code, each function labeled with the number of
1301 times each line of code was executed. With newer versions of `gcc'
1330 one for each branch of the `if'. A fourth basic-block results from the
1336 `gprof -l -A'. The `-x' option is also helpful, to ensure that each
1361 each branch of the `if' statement. The body of the `do' loop was
1363 annotated. It began execution 26312 times, once for each iteration
1453 The assumption made is that the average time spent in each call to
1508 each run will appear with a call count of 100).
1584 `selfpc', and the number of times each of these call arcs was traversed.
1638 enabled. Each object file is then compiled with a static array of
1643 the starting address of each basic-block. Taken together, the two
1690 records. Each file can contain any number of each record type. When
1692 compatible with each other and compute the union of all records. For
1694 of all execution counts for each basic-block.
1717 Histogram bins are 16-bit numbers and each bin represent an equal
1719 bytes long and if there are ten bins in the histogram, each bin
1758 each for the flat profile (INCL_FLAT/EXCL_FLAT), the call graph arcs
1803 each entry of which is a symbol table of Syms to be included or
1807 twice, once to count the size of each required symbol table, and again
1821 with multiple histogram records) are read, the memory ranges of each
1823 For each pair of histogram records, the resolution (memory region size
1828 As each call graph record is read (`call_graph.c:cg_read_rec'), the
1831 a symspec check against INCL_ARCS/EXCL_ARCS. As each arc is added, a
1837 only if line-by-line profiling has been selected. Each basic-block
1852 which case a fraction of the sample count is allocated to each symbol,
1855 and can cause each of two adjacent lines to be credited with half a
1860 scans through each symbol's machine code, looking for subroutine call
1870 computes the fraction of child time to propagate to each parent and a
1887 if present, to label each line of code with call counts, otherwise only
1914 As the call graph arcs are read, show each arc and how the total
1915 calls to each function are tallied
1918 Details sorting individual parents/children within each call graph
1922 Shows address ranges of histograms as they are read, and each call
2118 machine-readable Transparent copy along with each Opaque copy, or
2119 state in or with each Opaque copy a computer-network location from
2198 section all the substance and tone of each of the contributor
2257 but different contents, make the title of each such section unique
2276 rules of this License for verbatim copying of each of the
2360 Each version of the License is given a distinguishing version
