Front page | perl.perl5.porters |
Postings from December 2000
>pp_divide seems to slow down a lot if given the integer first else FP
>treatment, so I've not done that yet (will need to be FP if first operand
>is integer and greater than the size NV preserves to make
>0xFFFFFFFFFFFFFFFF / 3 work, but needing to even have that code can be
>conditionally compiled in)
Many machines are very slow doing integer divide. With a harware
(floating point) multiplier it is quite easy to do
N/M = N * (1/M) in floating point but you have to do tedious
for 0..wordwidth
subtract
conditional fossicking
shift
for integer.
>
>I've not touched pp_modulo (yet)
>Simon's profiles seemed to show it taking a very long time, so it appears
>there's something really bad happening there. Did anyone have any idea
>why it seemed to be so slow?
>
>Nicholas Clark
--
Nick Ing-Simmons
Thread Previous
|
Thread Next