1Flat profile: 2 3Each 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 200 0.00 0.00 boost::archive::iterators::transform_width<char*, 6, 8, char>::fill() 9 0.00 0.00 0.00 150 0.00 0.00 boost::archive::iterators::transform_width<boost::archive::iterators::binary_from_base64<boost::archive::iterators::remove_whitespace<std::_List_iterator<char> >, char>, 8, 6, char>::fill() 10 0.00 0.00 0.00 2 0.00 0.00 __static_initialization_and_destruction_0(int, int) 11 0.00 0.00 0.00 1 0.00 0.00 void test_base64<char>() 12 0.00 0.00 0.00 1 0.00 0.00 std::_List_base<char, std::allocator<char> >::_M_clear() 13 14 % the percentage of the total running time of the 15time program used by this function. 16 17cumulative a running sum of the number of seconds accounted 18 seconds for by this function and those listed above it. 19 20 self the number of seconds accounted for by this 21seconds function alone. This is the major sort for this 22 listing. 23 24calls the number of times this function was invoked, if 25 this function is profiled, else blank. 26 27 self the average number of milliseconds spent in this 28ms/call function per call, if this function is profiled, 29 else blank. 30 31 total the average number of milliseconds spent in this 32ms/call function and its descendents per call, if this 33 function is profiled, else blank. 34 35name the name of the function. This is the minor sort 36 for this listing. The index shows the location of 37 the function in the gprof listing. If the index is 38 in parenthesis it shows where it would appear in 39 the gprof listing if it were to be printed. 40 41 Call graph (explanation follows) 42 43 44granularity: each sample hit covers 4 byte(s) no time propagated 45 46index % time self children called name 47 0.00 0.00 200/200 void test_base64<char>() [7] 48[4] 0.0 0.00 0.00 200 boost::archive::iterators::transform_width<char*, 6, 8, char>::fill() [4] 49----------------------------------------------- 50 0.00 0.00 150/150 void test_base64<char>() [7] 51[5] 0.0 0.00 0.00 150 boost::archive::iterators::transform_width<boost::archive::iterators::binary_from_base64<boost::archive::iterators::remove_whitespace<std::_List_iterator<char> >, char>, 8, 6, char>::fill() [5] 52----------------------------------------------- 53 0.00 0.00 1/2 global constructors keyed to main [27] 54 0.00 0.00 1/2 global destructors keyed to main [24] 55[6] 0.0 0.00 0.00 2 __static_initialization_and_destruction_0(int, int) [6] 56----------------------------------------------- 57 0.00 0.00 1/1 main [1156] 58[7] 0.0 0.00 0.00 1 void test_base64<char>() [7] 59 0.00 0.00 200/200 boost::archive::iterators::transform_width<char*, 6, 8, char>::fill() [4] 60 0.00 0.00 150/150 boost::archive::iterators::transform_width<boost::archive::iterators::binary_from_base64<boost::archive::iterators::remove_whitespace<std::_List_iterator<char> >, char>, 8, 6, char>::fill() [5] 61 0.00 0.00 1/1 std::_List_base<char, std::allocator<char> >::_M_clear() [8] 62----------------------------------------------- 63 0.00 0.00 1/1 void test_base64<char>() [7] 64[8] 0.0 0.00 0.00 1 std::_List_base<char, std::allocator<char> >::_M_clear() [8] 65----------------------------------------------- 66 67 This table describes the call tree of the program, and was sorted by 68 the total amount of time spent in each function and its children. 69 70 Each entry in this table consists of several lines. The line with the 71 index number at the left hand margin lists the current function. 72 The lines above it list the functions that called this function, 73 and the lines below it list the functions this one called. 74 This line lists: 75 index A unique number given to each element of the table. 76 Index numbers are sorted numerically. 77 The index number is printed next to every function name so 78 it is easier to look up where the function in the table. 79 80 % time This is the percentage of the `total' time that was spent 81 in this function and its children. Note that due to 82 different viewpoints, functions excluded by options, etc, 83 these numbers will NOT add up to 100%. 84 85 self This is the total amount of time spent in this function. 86 87 children This is the total amount of time propagated into this 88 function by its children. 89 90 called This is the number of times the function was called. 91 If the function called itself recursively, the number 92 only includes non-recursive calls, and is followed by 93 a `+' and the number of recursive calls. 94 95 name The name of the current function. The index number is 96 printed after it. If the function is a member of a 97 cycle, the cycle number is printed between the 98 function's name and the index number. 99 100 101 For the function's parents, the fields have the following meanings: 102 103 self This is the amount of time that was propagated directly 104 from the function into this parent. 105 106 children This is the amount of time that was propagated from 107 the function's children into this parent. 108 109 called This is the number of times this parent called the 110 function `/' the total number of times the function 111 was called. Recursive calls to the function are not 112 included in the number after the `/'. 113 114 name This is the name of the parent. The parent's index 115 number is printed after it. If the parent is a 116 member of a cycle, the cycle number is printed between 117 the name and the index number. 118 119 If the parents of the function cannot be determined, the word 120 `<spontaneous>' is printed in the `name' field, and all the other 121 fields are blank. 122 123 For the function's children, the fields have the following meanings: 124 125 self This is the amount of time that was propagated directly 126 from the child into the function. 127 128 children This is the amount of time that was propagated from the 129 child's children to the function. 130 131 called This is the number of times the function called 132 this child `/' the total number of times the child 133 was called. Recursive calls by the child are not 134 listed in the number after the `/'. 135 136 name This is the name of the child. The child's index 137 number is printed after it. If the child is a 138 member of a cycle, the cycle number is printed 139 between the name and the index number. 140 141 If there are any cycles (circles) in the call graph, there is an 142 entry for the cycle-as-a-whole. This entry shows who called the 143 cycle (as parents) and the members of the cycle (as children.) 144 The `+' recursive calls entry shows the number of function calls that 145 were internal to the cycle, and the calls entry for each member shows, 146 for that member, how many times it was called from other members of 147 the cycle. 148 149 150Index by function name 151 152 [7] void test_base64<char>() [5] boost::archive::iterators::transform_width<boost::archive::iterators::binary_from_base64<boost::archive::iterators::remove_whitespace<std::_List_iterator<char> >, char>, 8, 6, char>::fill() [8] std::_List_base<char, std::allocator<char> >::_M_clear() 153 [6] __static_initialization_and_destruction_0(int, int) (performance_iterators_base64.cpp) [4] boost::archive::iterators::transform_width<char*, 6, 8, char>::fill() 154