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: std::pow implementation

From: Daniel Berlin <dberlin at dberlin dot org>
To: Richard Guenther <rguenth at tat dot physik dot uni-tuebingen dot de>
Cc: Joe Buck <jbuck at synopsys dot com>,Scott Robert Ladd <coyote at coyotegulch dot com>,Gabriel Dos Reis <gdr at integrable-solutions dot net>,Alexandre Oliva <aoliva at redhat dot com>,Steven Bosscher <s dot bosscher at student dot tudelft dot nl>, <gcc at gcc dot gnu dot org>
Date: Wed, 30 Jul 2003 14:06:13 -0400
Subject: Re: std::pow implementation
References: <Pine.LNX.4.44.0307301945180.561-100000@goofy>


Actually, the heuristic is usually something like:
If number of calls to function with constant arguments is estimated or
actually high (IE function is on some critical performance path):
<clone and optimize>

Otherwise, you would waste so much time trying to determine what to
clone, it's absurd.

So this would be only practical with profiling feedback then?

Or static profiling, to determine the number of calls and whatnot.

Richard.

References:
- Re: std::pow implementation
  - From: Richard Guenther

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