1Flat profile:
2
3Each sample counts as
0.
01 seconds.
4 no
time accumulated
5
6 % cumulative self self total
7 time seconds seconds calls Ts
/call Ts
/call name
8 0.
00 0.
00 0.
00 26797 0.
00 0.
00 log_printf
9
10 % the percentage of the total running
time of the
11time program used by
this function.
12
13cumulative a running sum of the number of seconds accounted
14 seconds
for by
this function
and those listed above it.
15
16 self the number of seconds accounted
for by
this
17seconds function alone. This is the major sort
for this
18 listing.
19
20calls the number of
times this function was invoked,
if
21 this function is profiled,
else blank.
22
23 self the average number of milliseconds spent in
this
24ms
/call function per call,
if this function is profiled,
25 else blank.
26
27 total the average number of milliseconds spent in
this
28ms
/call function
and its descendents per call,
if this
29 function is profiled,
else blank.
30
31name the name of the function. This is the minor sort
32 for this listing. The
index shows the location of
33 the function in the gprof listing. If the
index is
34 in parenthesis it shows where it would appear in
35 the gprof listing
if it were to be printed.
36
37 Call graph
(explanation follows
)
38
39
40granularity: each sample hit covers
4 byte
(s
) no
time propagated
41
42index %
time self children called name
43 0.
00 0.
00 279/26797 animate_square
[140]
44 0.
00 0.
00 2109/26797 gen_square
[154]
45 0.
00 0.
00 24409/26797 thread_func
[177]
46[2] 0.
0 0.
00 0.
00 26797 log_printf
[2]
47-----------------------------------------------
48
49 This table describes the call tree of the program,
and was sorted by
50 the total amount of
time spent in each function
and its children.
51
52 Each entry in
this table consists of several lines. The
line with the
53 index number at the left hand margin lists the current function.
54 The lines above it list the functions that called
this function,
55 and the lines below it list the functions
this one called.
56 This
line lists:
57 index A unique number given to each element of the table.
58 Index numbers are sorted numerically.
59 The
index number is printed next to every function name so
60 it is easier to look up where the function in the table.
61
62 %
time This is the percentage of the `total
' time that was spent
63 in this function and its children. Note that due to
64 different viewpoints, functions excluded by options, etc,
65 these numbers will NOT add up to 100%.
66
67 self This is the total amount of time spent in this function.
68
69 children This is the total amount of time propagated into this
70 function by its children.
71
72 called This is the number of times the function was called.
73 If the function called itself recursively, the number
74 only includes non-recursive calls, and is followed by
75 a `+' and the number of recursive calls.
76
77 name The name of the current function. The
index number is
78 printed after it. If the function is a member of a
79 cycle, the cycle number is printed between the
80 function
's name and the index number.
81
82
83 For the function's parents, the fields have the following meanings:
84
85 self This is the amount of
time that was propagated directly
86 from the function into
this parent.
87
88 children This is the amount of
time that was propagated from
89 the function
's children into this parent.
90
91 called This is the number of times this parent called the
92 function `/' the total number of
times the function
93 was called. Recursive calls to the function are
not
94 included in the number after the `
/'.
95
96 name This is the name of the parent. The parent's
index
97 number is printed after it. If the parent is a
98 member of a cycle, the cycle number is printed between
99 the name
and the
index number.
100
101 If the parents of the function cannot be determined, the word
102 `
<spontaneous>
' is printed in the `name' field,
and all the other
103 fields are blank.
104
105 For the function
's children, the fields have the following meanings:
106
107 self This is the amount of time that was propagated directly
108 from the child into the function.
109
110 children This is the amount of time that was propagated from the
111 child's children to the function.
112
113 called This is the number of
times the function called
114 this child `
/' the total number of times the child
115 was called. Recursive calls by the child are not
116 listed in the number after the `/'.
117
118 name This is the name of the child. The child
's index
119 number is printed after it. If the child is a
120 member of a cycle, the cycle number is printed
121 between the name and the index number.
122
123 If there are any cycles (circles) in the call graph, there is an
124 entry for the cycle-as-a-whole. This entry shows who called the
125 cycle (as parents) and the members of the cycle (as children.)
126 The `+' recursive calls entry shows the number of function calls that
127 were internal to the cycle,
and the calls entry
for each member shows,
128 for that member, how many
times it was called from other members of
129 the cycle.
130
131Index by function name
132
133 [2] log_printf
