🚀 go-pugleaf

I wrote:
> > Better yet, xor the bytes together and then use the fine lookup table.
> > Parity is just the xor of all the bits in any old order, remember.

sra@ecs.soton.ac.uk (Stephen Adams) writes:
>Indeed, you can use this property and `fold' the byte in
>half using shift and xor.  [and so on]
>On a RISC it should be about as fast as a lookup table as
>all the work is done in registers.

I really doubt that is true in general.

>       x = datum;
>       x^=(x>>4);
>       x^=(x>>2);
>       x^=(x>>1);
>       parity_bit = x&1;

I count 7 operations here, which on a typical RISC require 7 clocks.

Typical cost of a load from cache is 2 clocks.  At worst, a
table lookup require 2 loads, one of which is loading the
address of the table from the constant pool.  We can expect the
compiler to move the latter out of surrounding loops.  It is not
unreasonable to expect an often used and small lookup table to
be in cache.

I suspect you are thinking of a RISC like the Archimedes, that
doesn't have cache and has an unusual instruction set, which
allow shifting operands in the same instruction as an other
operation.  (I am not too familiar with the ARM).
-- 
Niels J|rgen Kruse 	DIKU Graduate 	njk@diku.dk