From:	gpt20 AT thor DOT cam DOT ac DOT uk (G.P. Tootell)
Newsgroups:	comp.os.msdos.djgpp
Subject:	floating point is... fast???
Date:	18 Jan 1997 20:50:22 GMT
Organization:	University of Cambridge, England
Lines:	14
Sender:	gpt20 AT hammer DOT thor DOT cam DOT ac DOT uk (G.P. Tootell)
Message-ID:	<5brd2e$dap@lyra.csx.cam.ac.uk>
NNTP-Posting-Host:	hammer.thor.cam.ac.uk
To:	djgpp AT delorie DOT com
DJ-Gateway:	from newsgroup comp.os.msdos.djgpp

while using the profiler on some code i had written i noticed that changing a
floating point multiply to an unsigned multiply of 2 longs turned out to be
slower. in fact floating point multiply appears to be faster than ordinary
integer multiply for any case. is this actually true? and if so is there any
reason i shouldn't just change every multiply in my code to make sure it's
floating point?

i don't have my big book of cycles on me so i have no idea how many cycles a fmul
is sadly.

regards,
nik

-- 

- Raw text -