ocfs2: Another hamming code optimization.

Browse source

In the calc_code_bit() function, we must find all powers of two beneath
the code bit number, *after* it's shifted by those powers of two.  This
requires a loop to see where it ends up.

We can optimize it by starting at its most significant bit.  This shaves
32% off the time, for a total of 67.6% shaved off of the original, naive
implementation.

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

...

This commit is contained in:

Joel Becker 2008-12-15 18:24:33 -08:00 • committed by Mark Fasheh

parent e798b3f8a9

commit 7bb458a585

1 changed files with 39 additions and 1 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download patch file Download diff file Expand all files Collapse all files

40

fs/ocfs2/blockcheck.c

View file