> On 22 Oct 2014, at 21:12, Andrea Faulds <a...@ajf.me> wrote:
>
> I ran the script several times, then took the results and put them into Excel
> to produce the above table with its averages.
>
> So common scripts are either unaffected, or will run ever-so-slightly faster.
Just to be clear, though, that didn’t tell the whole story. With that number of
iterations, there’s no speed difference that isn’t within the margin of error.
However, up the iterations by 100x and the bigint branch is consistently very
slightly slower. Remove the body of the loop so it’s just `for ($i = 0; $i <
100000000; $i++) {}` and the bigint branch is consistently very slightly
faster. No idea why either of these is the case.
So, apparently, the bigint branch both makes things slower and makes them
faster! But it’s not a big enough difference for me to be worried about it. The
differences that do exist might disappear if the fast_* functions can have
their inline asm rewritten and be uncommented. Currently, master has custom asm
for these, while the bigint branch has to use the probably slower C
implementations because I don’t understand x86 or x64 asm and am unable to
rewrite it.
--
Andrea Faulds
http://ajf.me/
--
PHP Internals - PHP Runtime Development Mailing List
To unsubscribe, visit: http://www.php.net/unsub.php
