This is the mail archive of the
gcc-help@gcc.gnu.org
mailing list for the GCC project.
RE: Understanding Macro Pre-processor
- From: "Dave Korn" <dave dot korn at artimi dot com>
- To: "'Bruno Moreira Guedes'" <thbmatrix at gmail dot com>, <gcc-help at gcc dot gnu dot org>
- Date: Fri, 21 Sep 2007 13:29:43 +0100
- Subject: RE: Understanding Macro Pre-processor
- References: <3fdd6ce00709201243u576ec2d6u4d2224ddeca5cc0d@mail.gmail.com>
- Reply-to: <gcc-help at gcc dot gnu dot org>
On 20 September 2007 20:44, Bruno Moreira Guedes wrote:
> Bu I've been made some tests... By example... A macro:
>
> #define mul(X,Y) (X*Y)
>
>
> It makes the processing faster...
Your test methodology is broken.
> But... Why executing that a milion of times is faster than using the
> simple a*b itself???
It isn't.
> It really happens?
It doesn't.
> Why?
Because you did one timing run when your system was under very heavy load of
background tasks and the other when it was under very light load, most likely.
cheers,
DaveK
--
Can't think of a witty .sigline today....