m4n71k0r

Untitled

Jul 18th, 2012
124
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. Flat profile:
  2.  
  3. Each 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       67     0.00     0.00  void std::generate<__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1}>(__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, __gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1})
  9.   0.00      0.00     0.00       48     0.00     0.00  test()
  10.   0.00      0.00     0.00       33     0.00     0.00  _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_
  11.   0.00      0.00     0.00       25     0.00     0.00  void std::vector<int, std::allocator<int> >::_M_range_initialize<int const*>(int const*, int const*, std::forward_iterator_tag)
  12.   0.00      0.00     0.00       17     0.00     0.00  std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)
  13.   0.00      0.00     0.00       17     0.00     0.00  std::list<char, std::allocator<char> >::size() const
  14.   0.00      0.00     0.00       17     0.00     0.00  std::_List_base<char, std::allocator<char> >::~_List_base()
  15.   0.00      0.00     0.00       17     0.00     0.00  std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_M_default_initialize(unsigned int)
  16.   0.00      0.00     0.00       12     0.00     0.00  std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&)
  17.   0.00      0.00     0.00       11     0.00     0.00  std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&)
  18.   0.00      0.00     0.00        8     0.00     0.00  std::_Vector_base<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_Vector_base(unsigned int)
  19.   0.00      0.00     0.00        6     0.00     0.00  std::_Vector_base<int, std::allocator<int> >::~_Vector_base()
  20.  
  21.  %         the percentage of the total running time of the
  22. time       program used by this function.
  23.  
  24. cumulative a running sum of the number of seconds accounted
  25.  seconds   for by this function and those listed above it.
  26.  
  27.  self      the number of seconds accounted for by this
  28. seconds    function alone.  This is the major sort for this
  29.            listing.
  30.  
  31. calls      the number of times this function was invoked, if
  32.            this function is profiled, else blank.
  33.  
  34.  self      the average number of milliseconds spent in this
  35. ms/call    function per call, if this function is profiled,
  36.        else blank.
  37.  
  38.  total     the average number of milliseconds spent in this
  39. ms/call    function and its descendents per call, if this
  40.        function is profiled, else blank.
  41.  
  42. name       the name of the function.  This is the minor sort
  43.            for this listing. The index shows the location of
  44.        the function in the gprof listing. If the index is
  45.        in parenthesis it shows where it would appear in
  46.        the gprof listing if it were to be printed.
  47.              Call graph (explanation follows)
  48.  
  49.  
  50. granularity: each sample hit covers 4 byte(s) no time propagated
  51.  
  52. index % time    self  children    called     name
  53.                 0.00    0.00      67/67          std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [6]
  54. [2]      0.0    0.00    0.00      67         void std::generate<__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1}>(__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, __gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1}) [2]
  55. -----------------------------------------------
  56.                 0.00    0.00      48/48          main [123]
  57. [3]      0.0    0.00    0.00      48         test() [3]
  58.                 0.00    0.00      33/33          _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_ [4]
  59.                 0.00    0.00      17/17          std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [6]
  60.                 0.00    0.00      17/17          std::_List_base<char, std::allocator<char> >::~_List_base() [8]
  61.                 0.00    0.00      12/12          std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&) [10]
  62.                 0.00    0.00      11/11          std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&) [11]
  63.                 0.00    0.00       6/6           std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [13]
  64. -----------------------------------------------
  65.                 0.00    0.00      33/33          test() [3]
  66. [4]      0.0    0.00    0.00      33         _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_ [4]
  67. -----------------------------------------------
  68.                 0.00    0.00      25/25          std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&) [11]
  69. [5]      0.0    0.00    0.00      25         void std::vector<int, std::allocator<int> >::_M_range_initialize<int const*>(int const*, int const*, std::forward_iterator_tag) [5]
  70. -----------------------------------------------
  71.                 0.00    0.00      17/17          test() [3]
  72. [6]      0.0    0.00    0.00      17         std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [6]
  73.                 0.00    0.00      67/67          void std::generate<__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1}>(__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, __gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1}) [2]
  74.                 0.00    0.00      17/17          std::list<char, std::allocator<char> >::size() const [7]
  75.                 0.00    0.00      17/17          std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_M_default_initialize(unsigned int) [9]
  76.                 0.00    0.00       8/8           std::_Vector_base<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_Vector_base(unsigned int) [12]
  77. -----------------------------------------------
  78.                 0.00    0.00      17/17          std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [6]
  79. [7]      0.0    0.00    0.00      17         std::list<char, std::allocator<char> >::size() const [7]
  80. -----------------------------------------------
  81.                 0.00    0.00      17/17          test() [3]
  82. [8]      0.0    0.00    0.00      17         std::_List_base<char, std::allocator<char> >::~_List_base() [8]
  83. -----------------------------------------------
  84.                 0.00    0.00      17/17          std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [6]
  85. [9]      0.0    0.00    0.00      17         std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_M_default_initialize(unsigned int) [9]
  86. -----------------------------------------------
  87.                 0.00    0.00      12/12          test() [3]
  88. [10]     0.0    0.00    0.00      12         std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&) [10]
  89. -----------------------------------------------
  90.                 0.00    0.00      11/11          test() [3]
  91. [11]     0.0    0.00    0.00      11         std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&) [11]
  92.                 0.00    0.00      25/25          void std::vector<int, std::allocator<int> >::_M_range_initialize<int const*>(int const*, int const*, std::forward_iterator_tag) [5]
  93. -----------------------------------------------
  94.                 0.00    0.00       8/8           std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [6]
  95. [12]     0.0    0.00    0.00       8         std::_Vector_base<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_Vector_base(unsigned int) [12]
  96. -----------------------------------------------
  97.                 0.00    0.00       6/6           test() [3]
  98. [13]     0.0    0.00    0.00       6         std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [13]
  99. -----------------------------------------------
  100.  
  101.  This table describes the call tree of the program, and was sorted by
  102.  the total amount of time spent in each function and its children.
  103.  
  104.  Each entry in this table consists of several lines.  The line with the
  105.  index number at the left hand margin lists the current function.
  106.  The lines above it list the functions that called this function,
  107.  and the lines below it list the functions this one called.
  108.  This line lists:
  109.      index  A unique number given to each element of the table.
  110.         Index numbers are sorted numerically.
  111.         The index number is printed next to every function name so
  112.         it is easier to look up where the function in the table.
  113.  
  114.      % time This is the percentage of the `total' time that was spent
  115.         in this function and its children.  Note that due to
  116.         different viewpoints, functions excluded by options, etc,
  117.         these numbers will NOT add up to 100%.
  118.  
  119.      self   This is the total amount of time spent in this function.
  120.  
  121.      children   This is the total amount of time propagated into this
  122.         function by its children.
  123.  
  124.      called This is the number of times the function was called.
  125.         If the function called itself recursively, the number
  126.         only includes non-recursive calls, and is followed by
  127.         a `+' and the number of recursive calls.
  128.  
  129.      name   The name of the current function.  The index number is
  130.         printed after it.  If the function is a member of a
  131.         cycle, the cycle number is printed between the
  132.         function's name and the index number.
  133.  
  134.  
  135. For the function's parents, the fields have the following meanings:
  136.  
  137.      self   This is the amount of time that was propagated directly
  138.         from the function into this parent.
  139.  
  140.      children   This is the amount of time that was propagated from
  141.         the function's children into this parent.
  142.  
  143.      called This is the number of times this parent called the
  144.         function `/' the total number of times the function
  145.         was called.  Recursive calls to the function are not
  146.         included in the number after the `/'.
  147.  
  148.      name   This is the name of the parent.  The parent's index
  149.         number is printed after it.  If the parent is a
  150.         member of a cycle, the cycle number is printed between
  151.         the name and the index number.
  152.  
  153.  If the parents of the function cannot be determined, the word
  154.  `<spontaneous>' is printed in the `name' field, and all the other
  155.  fields are blank.
  156.  
  157.  For the function's children, the fields have the following meanings:
  158.  
  159.      self   This is the amount of time that was propagated directly
  160.         from the child into the function.
  161.  
  162.      children   This is the amount of time that was propagated from the
  163.         child's children to the function.
  164.  
  165.      called This is the number of times the function called
  166.         this child `/' the total number of times the child
  167.         was called.  Recursive calls by the child are not
  168.         listed in the number after the `/'.
  169.  
  170.      name   This is the name of the child.  The child's index
  171.         number is printed after it.  If the child is a
  172.         member of a cycle, the cycle number is printed
  173.         between the name and the index number.
  174.  
  175. If there are any cycles (circles) in the call graph, there is an
  176. entry for the cycle-as-a-whole.  This entry shows who called the
  177. cycle (as parents) and the members of the cycle (as children.)
  178. The `+' recursive calls entry shows the number of function calls that
  179.  were internal to the cycle, and the calls entry for each member shows,
  180.  for that member, how many times it was called from other members of
  181.  the cycle.
  182.  
  183. Index by function name
  184.  
  185.    [3] test()                  [8] std::_List_base<char, std::allocator<char> >::~_List_base() [9] std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_M_default_initialize(unsigned int)
  186.    [6] std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&) [12] std::_Vector_base<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_Vector_base(unsigned int) [5] void std::vector<int, std::allocator<int> >::_M_range_initialize<int const*>(int const*, int const*, std::forward_iterator_tag)
  187.    [7] std::list<char, std::allocator<char> >::size() const [13] std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [11] std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&)
  188.   [10] std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&) [4] _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_ [2] void std::generate<__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1}>(__gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, __gnu_cxx::__normal_iterator<std::pair<int, char>*, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > >, std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > > zip_helper<std::vector, int, char>::create<std::vector<int, std::allocator<int> >, std::list<char, std::allocator<char> > >(std::vector<int, std::allocator<int> > const&, std::list<char, std::allocator<char> > const&)::{lambda()#1})
Advertisement
Add Comment
Please, Sign In to add comment