Systemnahe Programmierung in Chome  Prof. Dr. Uwe Schmidt FH Wedel

exec: make prun CARD=20000


> make prun CARD=20000
rm -f gmon.out
./ProfTest 20000
run binary search trees with inserting 20000 elements in ascending order (worst case)
card(s)          = 20000
minPathLength(s) = 1
maxPathLength(s) = 20000
gprof --brief ./ProfTest gmon.out
Flat profile:
 
Each sample counts as 0.01 seconds.
  %   cumulative   self              self     total           
 time   seconds   seconds    calls  us/call  us/call  name    
 65.23      2.34     2.34    20000   117.09   172.49  insertElem
 19.69      3.05     0.71 199990000     0.00     0.00  compare
  6.56      3.28     0.24 200130003     0.00     0.00  isEmptySet
  4.47      3.44     0.16    40001     4.01     4.01  mkEmptySet
  2.37      3.53     0.09                             frame_dummy
  1.82      3.60     0.07                             isInSet
  0.14      3.60     0.01    20000     0.25     8.27  mkOneElemSet
  0.00      3.60     0.00    20000     0.00     0.00  max
  0.00      3.60     0.00    20000     0.00     0.00  min
  0.00      3.60     0.00        1     0.00    47.11  card
  0.00      3.60     0.00        1     0.00    47.11  maxPathLength
  0.00      3.60     0.00        1     0.00    47.11  minPathLength

                        Call graph
 
 
granularity: each sample hit covers 2 byte(s) for 0.28% of 3.60 seconds
 
index % time    self  children    called     name
                                                 <spontaneous>
[1]     95.8    0.00    3.45                 main [1]
                2.34    1.11   20000/20000       insertElem [2]
                0.00    0.00       1/1           card [9]
                0.00    0.00       1/1           minPathLength [11]
                0.00    0.00       1/1           maxPathLength [10]
                0.00    0.00       1/40001       mkEmptySet [6]
-----------------------------------------------
                             199990000             insertElem [2]
                2.34    1.11   20000/20000       main [1]
[2]     95.8    2.34    1.11   20000+199990000 insertElem [2]
                0.71    0.00 199990000/199990000     compare [3]
                0.24    0.00 200010000/200130003     isEmptySet [4]
                0.01    0.16   20000/20000       mkOneElemSet [5]
                             199990000             insertElem [2]
-----------------------------------------------
                0.71    0.00 199990000/199990000     insertElem [2]
[3]     19.6    0.71    0.00 199990000         compare [3]
-----------------------------------------------
                0.00    0.00   40001/200130003     card [9]
                0.00    0.00   40001/200130003     maxPathLength [10]
                0.00    0.00   40001/200130003     minPathLength [11]
                0.24    0.00 200010000/200130003     insertElem [2]
[4]      6.5    0.24    0.00 200130003         isEmptySet [4]
-----------------------------------------------
                0.01    0.16   20000/20000       insertElem [2]
[5]      4.6    0.01    0.16   20000         mkOneElemSet [5]
                0.16    0.00   40000/40001       mkEmptySet [6]
-----------------------------------------------
                0.00    0.00       1/40001       main [1]
                0.16    0.00   40000/40001       mkOneElemSet [5]
[6]      4.5    0.16    0.00   40001         mkEmptySet [6]
-----------------------------------------------
                                                 <spontaneous>
[7]      2.4    0.09    0.00                 frame_dummy [7]
-----------------------------------------------
                                                 <spontaneous>
[8]      1.8    0.07    0.00                 isInSet [8]
-----------------------------------------------
                               40000             card [9]
                0.00    0.00       1/1           main [1]
[9]      0.0    0.00    0.00       1+40000   card [9]
                0.00    0.00   40001/200130003     isEmptySet [4]
                               40000             card [9]
-----------------------------------------------
                               40000             maxPathLength [10]
                0.00    0.00       1/1           main [1]
[10]     0.0    0.00    0.00       1+40000   maxPathLength [10]
                0.00    0.00   40001/200130003     isEmptySet [4]
                0.00    0.00   20000/20000       max [12]
                               40000             maxPathLength [10]
-----------------------------------------------
                               40000             minPathLength [11]
                0.00    0.00       1/1           main [1]
[11]     0.0    0.00    0.00       1+40000   minPathLength [11]
                0.00    0.00   40001/200130003     isEmptySet [4]
                0.00    0.00   20000/20000       min [13]
                               40000             minPathLength [11]
-----------------------------------------------
                0.00    0.00   20000/20000       maxPathLength [10]
[12]     0.0    0.00    0.00   20000         max [12]
-----------------------------------------------
                0.00    0.00   20000/20000       minPathLength [11]
[13]     0.0    0.00    0.00   20000         min [13]
-----------------------------------------------
&#012;
Index by function name
 
   [9] card                    [4] isEmptySet             [13] min
   [3] compare                 [8] isInSet                [11] minPathLength
   [7] frame_dummy            [12] max                     [6] mkEmptySet
   [2] insertElem             [10] maxPathLength           [5] mkOneElemSet
>
Dieses ist das Protokoll eines Testlaufs

Letzte Änderung: 29.03.2024 06:43:17
© Prof. Dr. Uwe Schmidt
Prof. Dr. Uwe Schmidt FH Wedel