tree d598e01e07eb5a6a5c45ba45017b41f6d33eed54
parent 7bb458a58588f397068e4166c615e9fcc7480c16
author Joel Becker <joel.becker@oracle.com> 1229464480 -0800
committer Mark Fasheh <mfasheh@suse.com> 1231173635 -0800

ocfs2: One more hamming code optimization.

The previous optimization used a fast find-highest-bit-set operation to
give us a good starting point in calc_code_bit().  This version lets the
caller cache the previous code buffer bit offset.  Thus, the next call
always starts where the last one left off.

This reduces the calculation another 39%, for a total 80% reduction from
the original, naive implementation.  At least, on my machine.  This also
brings the parity calculation to within an order of magnitude of the
crc32 calculation.

Signed-off-by: Joel Becker <joel.becker@oracle.com>
Signed-off-by: Mark Fasheh <mfasheh@suse.com>