This is the mail archive of the
mailing list for the GCC project.
comparing the runtime performance of different gcc's, flags and libstdc++'s
- From: Joerg Beyer <j dot beyer at web dot de>
- To: gcc at gcc dot gnu dot org
- Date: Wed, 22 May 2002 08:37:24 +0200
- Subject: comparing the runtime performance of different gcc's, flags and libstdc++'s
- Organization: http://freemail.web.de/
I compared the runtime of ~50 Testcases of C++ code, mainly small STL
using synthetic testcases with gcc 2.95.3 and the current 3.1. I used
gcc's libstdc++ and STLPort as well as a different compile time Flags
(from nothing to "-O3 -fexpensive-optimizations -fpeephole -march=i686
-fgcse -fomit-frame-pointer -funroll-loops").
to give you an idea: each testcase is a function that runs in less
than a second (usually 10th or 1000th times per second). The testcase
is called as long as a given time (e.g. 1 minute) is not over. The
number of calls to the testcase is counted (the loop counter), higher
loop counts are better results. The loop counts are compared for
each set of compile options.
Testcase focus on STL use, like reverse a std::list, appending
chars to a std::string, sorting a vector<int> and so on.
I dont want to go into endless flamewars, but if you think the results
(including the code that produced them) may help to improve gcc, then
I could share them.
ps: please cc me, since I am not on the list