summaryrefslogtreecommitdiff
path: root/crypto
diff options
context:
space:
mode:
authorJoel Becker <joel.becker@oracle.com>2008-12-16 01:13:48 (GMT)
committerMark Fasheh <mfasheh@suse.com>2009-01-05 16:40:34 (GMT)
commite798b3f8a920c82a8e556dd54df97f0d3d0f9144 (patch)
tree1f9c19ba29f65e44c10d77597a746224e0e72c72 /crypto
parent9d28cfb73f3abccce001daf2d247b16bf20e2248 (diff)
downloadlinux-e798b3f8a920c82a8e556dd54df97f0d3d0f9144.tar.xz
ocfs2: Don't hand-code xor in ocfs2_hamming_encode().
When I wrote ocfs2_hamming_encode(), I was following documentation of the algorithm and didn't have quite the (possibly still imperfect) grasp of it I do now. As part of this, I literally hand-coded xor. I would test a bit, and then add that bit via xor to the parity word. I can, of course, just do a single xor of the parity word and the source word (the code buffer bit offset). This cuts CPU usage by 53% on a mostly populated buffer (an inode containing utmp.h inline). Joel Signed-off-by: Joel Becker <joel.becker@oracle.com> Signed-off-by: Mark Fasheh <mfasheh@suse.com>
Diffstat (limited to 'crypto')
0 files changed, 0 insertions, 0 deletions