From: Message-Id: <200306291425.h5TEP4iB021922@speedy.ludd.luth.se> Subject: Re: strtod test takes a long time In-Reply-To: <3EFEF32B.D01A3C0E@phekda.freeserve.co.uk> "from Richard Dawe at Jun 29, 2003 03:09:47 pm" To: djgpp-workers AT delorie DOT com Date: Sun, 29 Jun 2003 16:25:03 +0200 (CEST) X-Mailer: ELM [version 2.4ME+ PL78 (25)] MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=US-ASCII X-MailScanner: Found to be clean Reply-To: djgpp-workers AT delorie DOT com Errors-To: nobody AT delorie DOT com X-Mailing-List: djgpp-workers AT delorie DOT com X-Unsubscribes-To: listserv AT delorie DOT com Precedence: bulk According to Richard Dawe: > The strtod test (tests/libc/ansi/stdlib/strtod.c) seems to take a long time. I've seen this too. And in my case it's gcc 2.95.{2,3}. > DJGPP CVS built with gcc 3.2.2, binutils 2.13 on an Athlon 850MHz: > > bash-2.04$ time ./strtod.exe > 0e20 -> 0 > 1e200 -> 1e+200 > 0e2000000000 -> 0 IIRC, this was a bad one considering the result should be 0 which can be seen early. > I'm wondering if we could exit strto* faster, when the exponent is larger than > one we support (*_MAX_EXP from . Sounds good. Right, MartinS