Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Flat profile:
- Each sample counts as 0.01 seconds.
- no time accumulated
- % cumulative self self total
- time seconds seconds calls Ts/call Ts/call name
- 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})
- 0.00 0.00 0.00 48 0.00 0.00 test()
- 0.00 0.00 0.00 33 0.00 0.00 _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_
- 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)
- 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&)
- 0.00 0.00 0.00 17 0.00 0.00 std::list<char, std::allocator<char> >::size() const
- 0.00 0.00 0.00 17 0.00 0.00 std::_List_base<char, std::allocator<char> >::~_List_base()
- 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)
- 0.00 0.00 0.00 12 0.00 0.00 std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&)
- 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&)
- 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)
- 0.00 0.00 0.00 6 0.00 0.00 std::_Vector_base<int, std::allocator<int> >::~_Vector_base()
- % the percentage of the total running time of the
- time program used by this function.
- cumulative a running sum of the number of seconds accounted
- seconds for by this function and those listed above it.
- self the number of seconds accounted for by this
- seconds function alone. This is the major sort for this
- listing.
- calls the number of times this function was invoked, if
- this function is profiled, else blank.
- self the average number of milliseconds spent in this
- ms/call function per call, if this function is profiled,
- else blank.
- total the average number of milliseconds spent in this
- ms/call function and its descendents per call, if this
- function is profiled, else blank.
- name the name of the function. This is the minor sort
- for this listing. The index shows the location of
- the function in the gprof listing. If the index is
- in parenthesis it shows where it would appear in
- the gprof listing if it were to be printed.
- Call graph (explanation follows)
- granularity: each sample hit covers 4 byte(s) no time propagated
- index % time self children called name
- 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]
- [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]
- -----------------------------------------------
- 0.00 0.00 48/48 main [123]
- [3] 0.0 0.00 0.00 48 test() [3]
- 0.00 0.00 33/33 _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_ [4]
- 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]
- 0.00 0.00 17/17 std::_List_base<char, std::allocator<char> >::~_List_base() [8]
- 0.00 0.00 12/12 std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&) [10]
- 0.00 0.00 11/11 std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&) [11]
- 0.00 0.00 6/6 std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [13]
- -----------------------------------------------
- 0.00 0.00 33/33 test() [3]
- [4] 0.0 0.00 0.00 33 _ZNSt4listIcSaIcEE14_M_create_nodeIJRKcEEEPSt10_List_nodeIcEDpOT_ [4]
- -----------------------------------------------
- 0.00 0.00 25/25 std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&) [11]
- [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]
- -----------------------------------------------
- 0.00 0.00 17/17 test() [3]
- [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]
- 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]
- 0.00 0.00 17/17 std::list<char, std::allocator<char> >::size() const [7]
- 0.00 0.00 17/17 std::vector<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_M_default_initialize(unsigned int) [9]
- 0.00 0.00 8/8 std::_Vector_base<std::pair<int, char>, std::allocator<std::pair<int, char> > >::_Vector_base(unsigned int) [12]
- -----------------------------------------------
- 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]
- [7] 0.0 0.00 0.00 17 std::list<char, std::allocator<char> >::size() const [7]
- -----------------------------------------------
- 0.00 0.00 17/17 test() [3]
- [8] 0.0 0.00 0.00 17 std::_List_base<char, std::allocator<char> >::~_List_base() [8]
- -----------------------------------------------
- 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]
- [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]
- -----------------------------------------------
- 0.00 0.00 12/12 test() [3]
- [10] 0.0 0.00 0.00 12 std::_List_base<char, std::allocator<char> >::_List_base(std::allocator<char> const&) [10]
- -----------------------------------------------
- 0.00 0.00 11/11 test() [3]
- [11] 0.0 0.00 0.00 11 std::vector<int, std::allocator<int> >::vector(std::initializer_list<int>, std::allocator<int> const&) [11]
- 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]
- -----------------------------------------------
- 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]
- [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]
- -----------------------------------------------
- 0.00 0.00 6/6 test() [3]
- [13] 0.0 0.00 0.00 6 std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [13]
- -----------------------------------------------
- This table describes the call tree of the program, and was sorted by
- the total amount of time spent in each function and its children.
- Each entry in this table consists of several lines. The line with the
- index number at the left hand margin lists the current function.
- The lines above it list the functions that called this function,
- and the lines below it list the functions this one called.
- This line lists:
- index A unique number given to each element of the table.
- Index numbers are sorted numerically.
- The index number is printed next to every function name so
- it is easier to look up where the function in the table.
- % time This is the percentage of the `total' time that was spent
- in this function and its children. Note that due to
- different viewpoints, functions excluded by options, etc,
- these numbers will NOT add up to 100%.
- self This is the total amount of time spent in this function.
- children This is the total amount of time propagated into this
- function by its children.
- called This is the number of times the function was called.
- If the function called itself recursively, the number
- only includes non-recursive calls, and is followed by
- a `+' and the number of recursive calls.
- name The name of the current function. The index number is
- printed after it. If the function is a member of a
- cycle, the cycle number is printed between the
- function's name and the index number.
- For the function's parents, the fields have the following meanings:
- self This is the amount of time that was propagated directly
- from the function into this parent.
- children This is the amount of time that was propagated from
- the function's children into this parent.
- called This is the number of times this parent called the
- function `/' the total number of times the function
- was called. Recursive calls to the function are not
- included in the number after the `/'.
- name This is the name of the parent. The parent's index
- number is printed after it. If the parent is a
- member of a cycle, the cycle number is printed between
- the name and the index number.
- If the parents of the function cannot be determined, the word
- `<spontaneous>' is printed in the `name' field, and all the other
- fields are blank.
- For the function's children, the fields have the following meanings:
- self This is the amount of time that was propagated directly
- from the child into the function.
- children This is the amount of time that was propagated from the
- child's children to the function.
- called This is the number of times the function called
- this child `/' the total number of times the child
- was called. Recursive calls by the child are not
- listed in the number after the `/'.
- name This is the name of the child. The child's index
- number is printed after it. If the child is a
- member of a cycle, the cycle number is printed
- between the name and the index number.
- If there are any cycles (circles) in the call graph, there is an
- entry for the cycle-as-a-whole. This entry shows who called the
- cycle (as parents) and the members of the cycle (as children.)
- The `+' recursive calls entry shows the number of function calls that
- were internal to the cycle, and the calls entry for each member shows,
- for that member, how many times it was called from other members of
- the cycle.
- Index by function name
- [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)
- [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)
- [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&)
- [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