Sender: nate AT cartsys DOT com
Message-ID: <36BA70AD.BC0C51AD@cartsys.com>
Date: Thu, 04 Feb 1999 20:16:45 -0800
From: Nate Eldredge <nate AT cartsys DOT com>
X-Mailer: Mozilla 4.08 [en] (X11; I; Linux 2.0.36 i586)
MIME-Version: 1.0
To: djgpp AT delorie DOT com
Subject: Re: Question about long long math on intel archs
References: <3 DOT 0 DOT 6 DOT 32 DOT 19990202153421 DOT 0091a590 AT pop DOT netaddress DOT com>
	 <3 DOT 0 DOT 6 DOT 32 DOT 19990202173547 DOT 00915bb0 AT pop DOT netaddress DOT com>
	 <3 DOT 0 DOT 6 DOT 32 DOT 19990202223415 DOT 0094bda0 AT pop DOT netaddress DOT com> <3 DOT 0 DOT 6 DOT 32 DOT 19990204024816 DOT 008d9720 AT pop DOT netaddress DOT com>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Reply-To: djgpp AT delorie DOT com

Paul Derbyshire wrote:
> 
> At 01:22 PM 2/3/99 -0800, you wrote:
> >So perhaps you could write the benchmarks, and put them somewhere that
> >others with such machines can run them.  I have a 300MHz K6-2 that I'd
> >put through its paces.
> 
> Okay... here it is. On my P166 it does 50 million long long multiplies in
> 20 seconds. This compiles and works using
> gcc int64.cc -o int64.exe -wall -liostr

Would it be better to optimize it?  -O2 or so?  And which compiler
version are you using?  -liostr looks suspiciously 2.7-ish.
-- 

Nate Eldredge
nate AT cartsys DOT com