API tools faq
paste
Advertisement
lamiastella

SVM gprof result

lamiastella
Jun 22nd, 2013
131
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 13.11 KB | None | 0 0
raw download clone embed print report
  1. Flat profile:
  2.  
  3. Each sample counts as 0.01 seconds.
  4. % cumulative self self total
  5. time seconds seconds calls us/call us/call name
  6. 25.64 0.10 0.10 _IO_vfscanf_internal
  7. 17.95 0.17 0.07 124114 0.56 0.60 fMtimes
  8. 10.26 0.21 0.04 99414 0.40 1.21 polynomial
  9. 10.26 0.25 0.04 6441 6.21 25.76 cal_learned_func
  10. 7.69 0.28 0.03 ____strtof_l_internal
  11. 5.13 0.30 0.02 497706 0.04 0.04 fMallocHandle
  12. 5.13 0.32 0.02 __close_nocancel
  13. 5.13 0.34 0.02 __ieee754_pow_sse2
  14. 5.13 0.36 0.02 __open_nocancel
  15. 5.13 0.38 0.02 fDeepCopyRange
  16. 2.56 0.39 0.01 top_check
  17. 0.00 0.39 0.00 252507 0.00 0.00 fFreeHandle
  18. 0.00 0.39 0.00 4564 0.00 36.81 examineExample
  19. 0.00 0.39 0.00 1969 0.00 0.04 fDeepCopy
  20. 0.00 0.39 0.00 1729 0.00 45.94 takeStep
  21. 0.00 0.39 0.00 236 0.00 0.06 fSetArray
  22. 0.00 0.39 0.00 207 0.00 0.04 ffVertcat
  23. 0.00 0.39 0.00 11 0.00 2.84 usps_read_partial
  24. 0.00 0.39 0.00 1 0.00 0.00 main
  25.  
  26. % the percentage of the total running time of the
  27. time program used by this function.
  28.  
  29. cumulative a running sum of the number of seconds accounted
  30. seconds for by this function and those listed above it.
  31.  
  32. self the number of seconds accounted for by this
  33. seconds function alone. This is the major sort for this
  34. listing.
  35.  
  36. calls the number of times this function was invoked, if
  37. this function is profiled, else blank.
  38.  
  39. self the average number of milliseconds spent in this
  40. ms/call function per call, if this function is profiled,
  41. else blank.
  42.  
  43. total the average number of milliseconds spent in this
  44. ms/call function and its descendents per call, if this
  45. function is profiled, else blank.
  46.  
  47. name the name of the function. This is the minor sort
  48. for this listing. The index shows the location of
  49. the function in the gprof listing. If the index is
  50. in parenthesis it shows where it would appear in
  51. the gprof listing if it were to be printed.
  53. Call graph (explanation follows)
  54.  
  55.  
  56. granularity: each sample hit covers 2 byte(s) for 2.56% of 0.39 seconds
  57.  
  58. index % time self children called name
  59. <spontaneous>
  60. [1] 43.1 0.00 0.17 getAlphaFromTrainSet [1]
  61. 0.00 0.17 4564/4564 examineExample [2]
  62. 0.00 0.00 11/11 usps_read_partial [16]
  63. 0.00 0.00 22/236 fSetArray [17]
  64. 0.00 0.00 30/252507 fFreeHandle [20]
  65. -----------------------------------------------
  66. 0.00 0.17 4564/4564 getAlphaFromTrainSet [1]
  67. [2] 43.1 0.00 0.17 4564 examineExample [2]
  68. 0.02 0.07 3437/6441 cal_learned_func [3]
  69. 0.00 0.08 1729/1729 takeStep [6]
  70. -----------------------------------------------
  71. 0.02 0.06 3004/6441 takeStep [6]
  72. 0.02 0.07 3437/6441 examineExample [2]
  73. [3] 42.5 0.04 0.13 6441 cal_learned_func [3]
  74. 0.04 0.08 97839/99414 polynomial [4]
  75. 0.01 0.00 195678/497706 fMallocHandle [10]
  76. -----------------------------------------------
  77. 0.00 0.00 1575/99414 takeStep [6]
  78. 0.04 0.08 97839/99414 cal_learned_func [3]
  79. [4] 30.8 0.04 0.08 99414 polynomial [4]
  80. 0.07 0.00 124114/124114 fMtimes [7]
  81. 0.00 0.00 124114/497706 fMallocHandle [10]
  82. 0.00 0.00 248228/252507 fFreeHandle [20]
  83. -----------------------------------------------
  84. <spontaneous>
  85. [5] 25.6 0.10 0.00 _IO_vfscanf_internal [5]
  86. -----------------------------------------------
  87. 0.00 0.08 1729/1729 examineExample [2]
  88. [6] 20.4 0.00 0.08 1729 takeStep [6]
  89. 0.02 0.06 3004/6441 cal_learned_func [3]
  90. 0.00 0.00 1575/99414 polynomial [4]
  91. 0.00 0.00 1866/497706 fMallocHandle [10]
  92. 0.00 0.00 1718/1969 fDeepCopy [15]
  93. 0.00 0.00 3584/252507 fFreeHandle [20]
  94. -----------------------------------------------
  95. 0.07 0.00 124114/124114 polynomial [4]
  96. [7] 19.2 0.07 0.00 124114 fMtimes [7]
  97. 0.00 0.00 124114/497706 fMallocHandle [10]
  98. -----------------------------------------------
  99. <spontaneous>
  100. [8] 7.7 0.03 0.00 ____strtof_l_internal [8]
  101. -----------------------------------------------
  102. <spontaneous>
  103. [9] 5.6 0.02 0.00 fDeepCopyRange [9]
  104. 0.00 0.00 49400/497706 fMallocHandle [10]
  105. -----------------------------------------------
  106. 0.00 0.00 20/497706 usps_read_partial [16]
  107. 0.00 0.00 207/497706 ffVertcat [18]
  108. 0.00 0.00 338/497706 fSetArray [17]
  109. 0.00 0.00 1866/497706 takeStep [6]
  110. 0.00 0.00 1969/497706 fDeepCopy [15]
  111. 0.00 0.00 49400/497706 fDeepCopyRange [9]
  112. 0.00 0.00 124114/497706 polynomial [4]
  113. 0.00 0.00 124114/497706 fMtimes [7]
  114. 0.01 0.00 195678/497706 cal_learned_func [3]
  115. [10] 5.1 0.02 0.00 497706 fMallocHandle [10]
  116. -----------------------------------------------
  117. <spontaneous>
  118. [11] 5.1 0.02 0.00 __close_nocancel [11]
  119. -----------------------------------------------
  120. <spontaneous>
  121. [12] 5.1 0.02 0.00 __ieee754_pow_sse2 [12]
  122. -----------------------------------------------
  123. <spontaneous>
  124. [13] 5.1 0.02 0.00 __open_nocancel [13]
  125. -----------------------------------------------
  126. <spontaneous>
  127. [14] 2.6 0.01 0.00 top_check [14]
  128. -----------------------------------------------
  129. 0.00 0.00 251/1969 usps_read_partial [16]
  130. 0.00 0.00 1718/1969 takeStep [6]
  131. [15] 0.0 0.00 0.00 1969 fDeepCopy [15]
  132. 0.00 0.00 1969/497706 fMallocHandle [10]
  133. -----------------------------------------------
  134. 0.00 0.00 11/11 getAlphaFromTrainSet [1]
  135. [16] 0.0 0.00 0.00 11 usps_read_partial [16]
  136. 0.00 0.00 210/236 fSetArray [17]
  137. 0.00 0.00 251/1969 fDeepCopy [15]
  138. 0.00 0.00 207/207 ffVertcat [18]
  139. 0.00 0.00 20/497706 fMallocHandle [10]
  140. 0.00 0.00 665/252507 fFreeHandle [20]
  141. -----------------------------------------------
  142. 0.00 0.00 4/236 readFile [19]
  143. 0.00 0.00 22/236 getAlphaFromTrainSet [1]
  144. 0.00 0.00 210/236 usps_read_partial [16]
  145. [17] 0.0 0.00 0.00 236 fSetArray [17]
  146. 0.00 0.00 338/497706 fMallocHandle [10]
  147. -----------------------------------------------
  148. 0.00 0.00 207/207 usps_read_partial [16]
  149. [18] 0.0 0.00 0.00 207 ffVertcat [18]
  150. 0.00 0.00 207/497706 fMallocHandle [10]
  151. -----------------------------------------------
  152. <spontaneous>
  153. [19] 0.0 0.00 0.00 readFile [19]
  154. 0.00 0.00 4/236 fSetArray [17]
  155. -----------------------------------------------
  156. 0.00 0.00 30/252507 getAlphaFromTrainSet [1]
  157. 0.00 0.00 665/252507 usps_read_partial [16]
  158. 0.00 0.00 3584/252507 takeStep [6]
  159. 0.00 0.00 248228/252507 polynomial [4]
  160. [20] 0.0 0.00 0.00 252507 fFreeHandle [20]
  161. -----------------------------------------------
  162. 0.00 0.00 1/1 __libc_start_main [1069]
  163. [21] 0.0 0.00 0.00 1 main [21]
  164. -----------------------------------------------
  165.  
  166. This table describes the call tree of the program, and was sorted by
  167. the total amount of time spent in each function and its children.
  168.  
  169. Each entry in this table consists of several lines. The line with the
  170. index number at the left hand margin lists the current function.
  171. The lines above it list the functions that called this function,
  172. and the lines below it list the functions this one called.
  173. This line lists:
  174. index A unique number given to each element of the table.
  175. Index numbers are sorted numerically.
  176. The index number is printed next to every function name so
  177. it is easier to look up where the function in the table.
  178.  
  179. % time This is the percentage of the `total' time that was spent
  180. in this function and its children. Note that due to
  181. different viewpoints, functions excluded by options, etc,
  182. these numbers will NOT add up to 100%.
  183.  
  184. self This is the total amount of time spent in this function.
  185.  
  186. children This is the total amount of time propagated into this
  187. function by its children.
  188.  
  189. called This is the number of times the function was called.
  190. If the function called itself recursively, the number
  191. only includes non-recursive calls, and is followed by
  192. a `+' and the number of recursive calls.
  193.  
  194. name The name of the current function. The index number is
  195. printed after it. If the function is a member of a
  196. cycle, the cycle number is printed between the
  197. function's name and the index number.
  198.  
  199.  
  200. For the function's parents, the fields have the following meanings:
  201.  
  202. self This is the amount of time that was propagated directly
  203. from the function into this parent.
  204.  
  205. children This is the amount of time that was propagated from
  206. the function's children into this parent.
  207.  
  208. called This is the number of times this parent called the
  209. function `/' the total number of times the function
  210. was called. Recursive calls to the function are not
  211. included in the number after the `/'.
  212.  
  213. name This is the name of the parent. The parent's index
  214. number is printed after it. If the parent is a
  215. member of a cycle, the cycle number is printed between
  216. the name and the index number.
  217.  
  218. If the parents of the function cannot be determined, the word
  219. `<spontaneous>' is printed in the `name' field, and all the other
  220. fields are blank.
  221.  
  222. For the function's children, the fields have the following meanings:
  223.  
  224. self This is the amount of time that was propagated directly
  225. from the child into the function.
  226.  
  227. children This is the amount of time that was propagated from the
  228. child's children to the function.
  229.  
  230. called This is the number of times the function called
  231. this child `/' the total number of times the child
  232. was called. Recursive calls by the child are not
  233. listed in the number after the `/'.
  234.  
  235. name This is the name of the child. The child's index
  236. number is printed after it. If the child is a
  237. member of a cycle, the cycle number is printed
  238. between the name and the index number.
  239.  
  240. If there are any cycles (circles) in the call graph, there is an
  241. entry for the cycle-as-a-whole. This entry shows who called the
  242. cycle (as parents) and the members of the cycle (as children.)
  243. The `+' recursive calls entry shows the number of function calls that
  244. were internal to the cycle, and the calls entry for each member shows,
  245. for that member, how many times it was called from other members of
  246. the cycle.
  247.  
  249. Index by function name
  250.  
  251. [5] _IO_vfscanf_internal [15] fDeepCopy [21] main
  252. [8] ____strtof_l_internal [9] fDeepCopyRange [4] polynomial
  253. [11] __close_nocancel [20] fFreeHandle [6] takeStep
  254. [12] __ieee754_pow_sse2 [10] fMallocHandle [14] top_check
  255. [13] __open_nocancel [7] fMtimes [16] usps_read_partial
  256. [3] cal_learned_func [17] fSetArray
  257. [2] examineExample [18] ffVertcat
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!