Mail Archives: djgpp/1997/01/19/01:21:39
G.P. Tootell wrote:
>
> 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.
I don't know about integers but I know that floating point is faster
than fixed point on high end machines like a pentium.But since AFAIK a
fixed point is treated as an int, I guess,yes,they're faster.
--
tudor 'at' cam 'dot' org
yoda69 'at' hotmail 'dot' com
http://www.cam.org/~tudor
-----BEGIN GEEK CODE BLOCK-----
Version: 3.1
GCS d-(--) s(-):(+) a? C+ UL>++++ P L>+++++ E- W++ N o K---(----) w---
O---- M-- V-? PS+++ PE Y PGP t+ 5-- X+++>++++ R tv b+ DI D+ G e->++
h>++ r- y>+++++
------END GEEK CODE BLOCK------
- Raw text -