On Tue, Sep 27, 2011 at 03:12:53PM -0700, Darrick J. Wong wrote:
> Provide a big-endian version of crc32c for modules that want it.
Who is going to use this?
Thanks,
--
Email: Herbert Xu
Home Page: http://gondor.apana.org.au/~herbert/
PGP Key: http://gondor.apana.org.au/~herbert/pubkey.txt
--
T
On Tue, Sep 27, 2011 at 03:12:39PM -0700, Darrick J. Wong wrote:
> Hi all,
>
> This patchset replaces the current crc32c software implementation, which uses
> a
> slow per-byte lookup table algorithm, with a faster implementation that uses
> an
> adaptation of the slice-by-8 algorithm that Bob P
Provide a big-endian version of crc32c for modules that want it.
Signed-off-by: Darrick J. Wong
---
include/linux/crc32c.h |5 +++--
lib/libcrc32c.c| 43 ++-
2 files changed, 37 insertions(+), 11 deletions(-)
diff --git a/include/linux/crc3
Hi all,
This patchset replaces the current crc32c software implementation, which uses a
slow per-byte lookup table algorithm, with a faster implementation that uses an
adaptation of the slice-by-8 algorithm that Bob Pearson has been pushing for
crc32.
The motivation for this patchset is that I am
This is a self-test for the CRC32c code.
Signed-off-by: Darrick J. Wong
---
crypto/tcrypt.c |6 ++
crypto/testmgr.c | 36 +--
crypto/testmgr.h | 177 +-
3 files changed, 211 insertions(+), 8 deletions(-)
diff --git a/crypto/tc
The existing CRC32c implementation uses Sarwate's algorithm to calculate the
code one byte at a time. Using slicing-by-8, we can process buffers 8 bytes at
a time, for a substantial increase in performance.
Signed-off-by: Darrick J. Wong
---
crypto/Makefile | 11 +
crypto/crc32c.c |
