Re: C++ compile-time regressions (was: GCC 3.0.1 Status Report)

[Gerald Pfeifer <pfeifer at dbai dot tuwien dot ac dot at>]

On Mon, 23 Jul 2001, Joe Buck wrote:
> So the preprocessed code is 21% larger, and for -O0 it compiles 26%
> slower.  After normalization for lines of preprocessed code, 3.0.1-pre is
> only 3.8% slower on a per-line basis than 2.95.3 with optimization off
> (normal mode for the typical compile/debug/fix cycle).

Yes, but as a user you'll still see 26% slowdown, for those 21% increase
of preprocessed source come from libstdc++.

> Smaller binaries too ... maybe the compiler's going to be OK after all. :-)

No. Not yet. :-(  Performance benchmarks are *detrimental*. Desastrous. :-(

Gerald

                     |2.95 -O2|2.95 -O3| 3.0 -O2| 3.0 -O3|3.0.1-O2|3.0.1-O3|
---------------------+-----------------------------------------------------+
      STRATCOMP1-ALL |   8.26 |   8.07 |  94.42 |  94.50 | 107.90 | 103.03 |
   STRATCOMP-770.2-Q |   1.45 |   1.30 |   1.47 |   1.43 |   3.77 |   3.73 |
               2QBF1 |  25.45 |  25.70 |  35.17 |  40.98 |  74.73 |  77.54 |
          PRIMEIMPL2 |  18.93 |  19.04 |  24.20 |  28.00 | 112.64 | 116.13 |
            ANCESTOR |  13.98 |  12.97 |  12.53 |  11.54 |  37.24 |  37.18 |
       3COL-SIMPLEX1 |  13.88 |  11.78 |  12.26 |  11.60 |  33.27 |  33.03 |
        3COL-LADDER1 |  58.59 |  56.47 |  70.89 |  79.84 | 169.75 | 173.26 |
      3COL-N-LADDER1 |  22.60 |  24.39 |  25.49 |  28.32 | 111.93 | 112.95 |
        3COL-RANDOM1 |  18.61 |  19.08 |  23.25 |  26.07 |  92.60 |  96.46 |
          HP-RANDOM1 |  15.78 |  14.55 |  15.72 |  15.19 |  42.04 |  43.02 |
       HAMCYCLE-FREE |   2.61 |   2.11 |   2.92 |   2.49 |   9.97 |  10.32 |
             DECOMP2 |  34.90 |  33.28 |  29.63 |  34.50 | 113.99 | 117.11 |
        BW-P4-Esra-a | 110.08 | 108.56 | 116.19 | 123.85 | 345.82 | 359.78 |
        BW-P5-nopush |   8.69 |   8.56 |   8.99 |   9.56 |  27.41 |  28.53 |
       BW-P5-pushbin |   8.04 |   7.89 |   8.23 |   8.89 |  28.43 |  29.43 |
     BW-P5-nopushbin |   2.89 |   2.76 |   2.83 |   3.03 |   9.67 |  10.00 |
              3SAT-1 |  60.92 |  60.80 |  75.32 |  85.46 | 344.55 | 355.46 |
   3SAT-1-CONSTRAINT |  32.45 |  31.80 |  39.17 |  47.33 | 180.67 | 192.74 |
        HANOI-Towers |   6.78 |   6.29 |   5.82 |   6.64 |  21.53 |  19.00 |
              RAMSEY |  15.74 |  13.95 |  16.78 |  15.08 |  44.17 |  44.33 |
             CRISTAL |  16.49 |  14.76 |  16.50 |  15.41 |  42.85 |  42.53 |
             HANOI-K |  60.29 |  58.87 |  72.22 |  78.86 | 299.82 | 316.15 |
           21-QUEENS |  18.32 |  18.55 |  22.18 |  24.31 |  88.71 |  93.89 |
   MSTDir[V=13,A=40] |  43.67 |  42.22 |  35.77 |  35.58 | 101.60 | 107.67 |
   MSTDir[V=15,A=40] |  44.54 |  42.70 |  35.88 |  35.18 | 100.76 | 106.31 |
 MSTUndir[V=13,A=40] |  22.61 |  21.43 |  19.30 |  18.79 |  60.34 |  64.53 |
 MSTUndir[V=15,A=40] | 368.26 | 352.57 | 313.58 | 304.77 | 942.22 | 997.93 |
         TIMETABLING |  25.94 |  24.42 |  24.76 |  24.95 |  76.62 |  76.69 |
---------------------+-----------------------------------------------------+

STRATCOMP1-ALL:
STRATCOMP, random instance, |companies| = 60, |products| = 180,
all sets

STRATCOMP-770.2-Q:
STRATCOMP, random instance, |companies| = |products| = 770,
first model, with query

2QBF1:
2QBF, 1000 all-quantified, 20 existentially-quantified variables
10000 clauses, 5CNF

PRIMEIMPL2:
Prime Implicants with 180 variables and 774 clauses (all models [246])

ANCESTOR:
Double ancestor board of size 14 (only grounding)

3COL-SIMPLEX1:
3COL simplex graph, |edges| = 1980, |nodes| = 1035, one model

3COL-LADDER1:
3COL ladder graph, |edges| = 2998, |nodes| = 2000, one model

3COL-N-LADDER1:
3COL, propositional Niemelä style
ladder graph, |edges| = 2998, |nodes| = 2000, one model

3COL-RANDOM1:
3COL random graph, |edges| = 1100, |nodes| = 500, one model

HP-RANDOM1:
Hamiltonian Path on a random graph, |edges| = 700, |nodes| = 85, one model
generated with Stanford Graph Base random_graph(85,700,0,0,0,0,0,1,1,33)
undirected graph, represented as a directed one

HAMCYCLE-FREE:
Hamiltonian Cycle with a free guess.
n = 60, one model

DECOMP2:
query decomposition (k=3), one model

BW-P4-Esra-a:
blocksworld problem P4 with Esra's bw_domain_a program

BW-P5-nopush:
blocksworld problem P5 with Axel's C-translation without push

BW-P5-pushbin:
blocksworld problem P5 with Axel's pushed and binarised C-translation

BW-P5-nopushbin:
blocksworld problem P5 with Axel's binarised C-translation without push

3SAT-1:
3SAT with 280 variables and 1204 clauses, randomly generated, one model

3SAT-1-CONSTRAINT:
3SAT with 280 variables and 1204 clauses, randomly generated, one model, constraint encoding

HANOI-Towers:
"Towers of Hanoi" with 3 stacks, 4 disks, and 15 steps.

RAMSEY:
"Ramsey(3,6) != 17"

CRISTAL:
"Deductive database use as done by Christoph Koch in CERN"

HANOI-K:
"Towers of Hanoi" in K with 3 stacks, 4 disks, and 15 steps.

21-QUEENS:
"N-Queens with 21 queens"

MSTDir[V=13,A=40]:
min spanning tree [prim], directed graph with 13 vertices and 40 arcs

MSTDir[V=15,A=40]:
min spanning tree [prim], directed graph with 15 vertices and 40 arcs

MSTUndir[V=13,A=40]:
min spanning tree [prim], undirected graph with 13 vertices and 40 arcs

MSTUndir[V=15,A=40]:
min spanning tree [prim], undirected graph with 15 vertices and 40 arcs

TIMETABLING:
A timetable problem of the first year of the faculty of Science
of University of Calabria for 1 class, one model