This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: C++ compile and execution times

From: Mike Stump <mrs at apple dot com>
To: Roger Sayle <roger at eyesopen dot com>
Cc: Wolfgang Bangerth <bangerth at ticam dot utexas dot edu>, Zack Weinberg <zack at codesourcery dot com>, gcc at gcc dot gnu dot org
Date: Thu, 21 Nov 2002 17:16:28 -0800
Subject: Re: C++ compile and execution times

Please see my previous email on the topic. http://gcc.gnu.org/ml/gcc/2002-08/msg00717.html Net result, 0.03% speedup. Not worth it, in general. Feel free to update the patches and try it on your benchmark. Maybe you can find code that shows a much better improvement.

On Thursday, November 21, 2002, at 05:37 PM, Roger Sayle wrote:

The problem I've noticed is that the recursion in "fold" appears
to be O(n^2) instead of O(n).

I don't believe it is. Try it out. I think one the first ply is folded, thus limiting the amount of work done.

Follow-Ups:
- Re: C++ compile and execution times
  - From: Roger Sayle

References:
- Re: C++ compile and execution times
  - From: Roger Sayle

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]