Joel Becker 58896c4d0e 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>
2009-01-05 08:40:35 -08:00
..
2008-12-25 11:40:09 +11:00
2008-11-14 11:29:12 +11:00
2008-11-20 08:11:52 +11:00
2008-10-13 09:47:43 +11:00
2008-11-25 16:51:45 -08:00
2008-12-31 18:07:43 -05:00
2008-11-14 10:39:25 +11:00
2009-01-05 08:40:30 -08:00
2008-12-31 18:07:44 -05:00
2008-12-30 16:51:43 -05:00
2008-12-30 16:51:43 -05:00
2008-10-17 02:38:36 +11:00
2008-12-01 19:55:25 -08:00
2008-11-18 15:08:56 +01:00
2008-12-04 17:16:36 +11:00
2008-12-29 16:47:18 +11:00
2008-12-29 08:29:50 +01:00
2008-12-31 18:07:43 -05:00
2009-01-03 11:45:54 -08:00
2008-12-29 08:29:53 +01:00
2008-10-23 05:12:59 -04:00
2008-12-31 18:07:38 -05:00
2008-12-25 11:40:09 +11:00
2008-12-31 18:07:43 -05:00
2008-12-31 18:07:41 -05:00
2009-01-04 15:14:41 -05:00
2008-10-30 11:38:45 -07:00