[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <4E5EB5CC.1010605@systemfabricworks.com>
Date: Wed, 31 Aug 2011 17:29:32 -0500
From: Bob Pearson <rpearson@...temfabricworks.com>
To: linux-kernel@...r.kernel.org
CC: fzago@...temfabricworks.com, rpearson@...temfabricworks.com,
Joakim Tjernlund <joakim.tjernlund@...nsmode.se>,
George Spelvin <linux@...izon.com>, akpm@...ux-foundation.org
Subject: [PATCH v6 00/10] crc32
Hi,
This is an attempt to resolve all the issues that were left in the last review.
There is one proposed change that is still causing a difference of opinion
which has to do with the form of the loops and their performance on x86 and ppc
This version has the change to the form that runs faster on x86 as an ifdef.
This patch series provides improved performance for computing the crc32
polynomial on common hardware by adding the Slicing-by-8 algorithm to the
existing algorithms already included. The new algorithm is very closely
related to the existing algorithm so the extension requires small changes
to implement. Additionally it cleans up some warnings in the existing
code and adds a kernel mode optional self test to replace the existing
user mode self test.
A description of the existing and new algorithm is included in
Documentation/crc32.txt.
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists