profile1.txt 6.3 KB

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