Advertisement
Guest User

Untitled

a guest
Jan 18th, 2020
98
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 7.41 KB | None | 0 0
  1. gcc test1.c -o bruno_prof -pg
  2.  
  3. ./bruno_prof lenna.ppm out.txt
  4.  
  5. gprof bruno_prof
  6.  
  7. Flat profile:
  8.  
  9. Each sample counts as 0.01 seconds.
  10. % cumulative self self total
  11. time seconds seconds calls us/call us/call name
  12. 81.31 0.13 0.13 4096 31.76 31.76 DCT2d
  13. 18.76 0.16 0.03 12288 2.44 2.44 zigZag
  14. 0.00 0.16 0.00 4096 0.00 0.00 getBlock
  15. 0.00 0.16 0.00 4096 0.00 0.00 quant
  16. 0.00 0.16 0.00 4096 0.00 0.00 yuvShift
  17. 0.00 0.16 0.00 1 0.00 0.00 loadFile
  18.  
  19. % the percentage of the total running time of the
  20. time program used by this function.
  21.  
  22. cumulative a running sum of the number of seconds accounted
  23. seconds for by this function and those listed above it.
  24.  
  25. self the number of seconds accounted for by this
  26. seconds function alone. This is the major sort for this
  27. listing.
  28.  
  29. calls the number of times this function was invoked, if
  30. this function is profiled, else blank.
  31.  
  32. self the average number of milliseconds spent in this
  33. ms/call function per call, if this function is profiled,
  34. else blank.
  35.  
  36. total the average number of milliseconds spent in this
  37. ms/call function and its descendents per call, if this
  38. function is profiled, else blank.
  39.  
  40. name the name of the function. This is the minor sort
  41. for this listing. The index shows the location of
  42. the function in the gprof listing. If the index is
  43. in parenthesis it shows where it would appear in
  44. the gprof listing if it were to be printed.
  45.  
  46.  
  47. Copyright (C) 2012-2018 Free Software Foundation, Inc.
  48.  
  49. Copying and distribution of this file, with or without modification,
  50. are permitted in any medium without royalty provided the copyright
  51. notice and this notice are preserved.
  52.  
  53.  
  54. Call graph (explanation follows)
  55.  
  56.  
  57. granularity: each sample hit covers 2 byte(s) for 6.25% of 0.16 seconds
  58.  
  59. index % time self children called name
  60. <spontaneous>
  61. [1] 100.0 0.00 0.16 main [1]
  62. 0.13 0.00 4096/4096 DCT2d [2]
  63. 0.03 0.00 12288/12288 zigZag [3]
  64. 0.00 0.00 4096/4096 getBlock [4]
  65. 0.00 0.00 4096/4096 yuvShift [6]
  66. 0.00 0.00 4096/4096 quant [5]
  67. 0.00 0.00 1/1 loadFile [7]
  68. -----------------------------------------------
  69. 0.13 0.00 4096/4096 main [1]
  70. [2] 81.2 0.13 0.00 4096 DCT2d [2]
  71. -----------------------------------------------
  72. 0.03 0.00 12288/12288 main [1]
  73. [3] 18.7 0.03 0.00 12288 zigZag [3]
  74. -----------------------------------------------
  75. 0.00 0.00 4096/4096 main [1]
  76. [4] 0.0 0.00 0.00 4096 getBlock [4]
  77. -----------------------------------------------
  78. 0.00 0.00 4096/4096 main [1]
  79. [5] 0.0 0.00 0.00 4096 quant [5]
  80. -----------------------------------------------
  81. 0.00 0.00 4096/4096 main [1]
  82. [6] 0.0 0.00 0.00 4096 yuvShift [6]
  83. -----------------------------------------------
  84. 0.00 0.00 1/1 main [1]
  85. [7] 0.0 0.00 0.00 1 loadFile [7]
  86. -----------------------------------------------
  87.  
  88. This table describes the call tree of the program, and was sorted by
  89. the total amount of time spent in each function and its children.
  90.  
  91. Each entry in this table consists of several lines. The line with the
  92. index number at the left hand margin lists the current function.
  93. The lines above it list the functions that called this function,
  94. and the lines below it list the functions this one called.
  95. This line lists:
  96. index A unique number given to each element of the table.
  97. Index numbers are sorted numerically.
  98. The index number is printed next to every function name so
  99. it is easier to look up where the function is in the table.
  100.  
  101. % time This is the percentage of the `total' time that was spent
  102. in this function and its children. Note that due to
  103. different viewpoints, functions excluded by options, etc,
  104. these numbers will NOT add up to 100%.
  105.  
  106. self This is the total amount of time spent in this function.
  107.  
  108. children This is the total amount of time propagated into this
  109. function by its children.
  110.  
  111. called This is the number of times the function was called.
  112. If the function called itself recursively, the number
  113. only includes non-recursive calls, and is followed by
  114. a `+' and the number of recursive calls.
  115.  
  116. name The name of the current function. The index number is
  117. printed after it. If the function is a member of a
  118. cycle, the cycle number is printed between the
  119. function's name and the index number.
  120.  
  121.  
  122. For the function's parents, the fields have the following meanings:
  123.  
  124. self This is the amount of time that was propagated directly
  125. from the function into this parent.
  126.  
  127. children This is the amount of time that was propagated from
  128. the function's children into this parent.
  129.  
  130. called This is the number of times this parent called the
  131. function `/' the total number of times the function
  132. was called. Recursive calls to the function are not
  133. included in the number after the `/'.
  134.  
  135. name This is the name of the parent. The parent's index
  136. number is printed after it. If the parent is a
  137. member of a cycle, the cycle number is printed between
  138. the name and the index number.
  139.  
  140. If the parents of the function cannot be determined, the word
  141. `<spontaneous>' is printed in the `name' field, and all the other
  142. fields are blank.
  143.  
  144. For the function's children, the fields have the following meanings:
  145.  
  146. self This is the amount of time that was propagated directly
  147. from the child into the function.
  148.  
  149. children This is the amount of time that was propagated from the
  150. child's children to the function.
  151.  
  152. called This is the number of times the function called
  153. this child `/' the total number of times the child
  154. was called. Recursive calls by the child are not
  155. listed in the number after the `/'.
  156.  
  157. name This is the name of the child. The child's index
  158. number is printed after it. If the child is a
  159. member of a cycle, the cycle number is printed
  160. between the name and the index number.
  161.  
  162. If there are any cycles (circles) in the call graph, there is an
  163. entry for the cycle-as-a-whole. This entry shows who called the
  164. cycle (as parents) and the members of the cycle (as children.)
  165. The `+' recursive calls entry shows the number of function calls that
  166. were internal to the cycle, and the calls entry for each member shows,
  167. for that member, how many times it was called from other members of
  168. the cycle.
  169.  
  170.  
  171. Copyright (C) 2012-2018 Free Software Foundation, Inc.
  172.  
  173. Copying and distribution of this file, with or without modification,
  174. are permitted in any medium without royalty provided the copyright
  175. notice and this notice are preserved.
  176.  
  177.  
  178. Index by function name
  179.  
  180. [2] DCT2d [7] loadFile [6] yuvShift
  181. [4] getBlock [5] quant [3] zigZag
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement