At 03:02 AM 11/11/2001 -0500, James Mastros wrote:
>On Sat, 10 Nov 2001, Leon Brocard wrote:
> > mops.pasm uses a very simple loop to figure out how many operations a
> > second parrot can go. However, the loop it uses is inefficient: it
> > does a "branch" *and* an "eq" every time around.
>
> > m
On Sat, Nov 10, 2001 at 07:30:25PM +, Leon Brocard wrote:
> The attached patch optimises the loop. Note that MOPS numbers now look
> slightly different. For example, on my laptop:
Independently discovered at the BSD conference this weekend; I'm checking
in my version of the change, which is s
On Sat, 10 Nov 2001, Leon Brocard wrote:
> mops.pasm uses a very simple loop to figure out how many operations a
> second parrot can go. However, the loop it uses is inefficient: it
> does a "branch" *and* an "eq" every time around.
> mops.pasm: 11.713909
>./mops: 108.442655
>
> mops.pasm:
