Raise the N in crc32's slicing-by-N from 8 to 16

name                          old speed      new speed      delta
wuffs_crc32_ieee_10k/clang    2.35GB/s ± 0%  2.86GB/s ± 1%  +21.45%  (p=0.000 n=47+5)
wuffs_crc32_ieee_100k/clang   2.35GB/s ± 0%  2.86GB/s ± 2%  +21.84%  (p=0.000 n=48+5)
wuffs_crc32_ieee_10k/gcc      2.69GB/s ± 0%  3.36GB/s ± 1%  +25.10%  (p=0.000 n=47+5)
wuffs_crc32_ieee_100k/gcc     2.68GB/s ± 1%  3.39GB/s ± 0%  +26.39%  (p=0.000 n=44+5)
wuffs_gzip_decode_10k/clang    213MB/s ± 0%   215MB/s ± 0%   +0.95%  (p=0.000 n=46+5)
wuffs_gzip_decode_100k/clang   237MB/s ± 0%   240MB/s ± 0%   +1.31%  (p=0.000 n=48+5)
wuffs_gzip_decode_10k/gcc      241MB/s ± 1%   246MB/s ± 0%   +2.00%  (p=0.000 n=45+5)
wuffs_gzip_decode_100k/gcc     283MB/s ± 1%   290MB/s ± 0%   +2.25%  (p=0.000 n=48+5)
This commit is contained in:
Nigel Tao committed 2018-10-07 21:01:18 +11:00
1 parent 07151f88ce
commit 99597e1ff1
3 files changed
+709 -123

No files matched your search

+6 -4
View File
@@ -34,14 +34,16 @@ func main() {
}
func main1() error {
tables := [8]crc32.Table{}
tables := [16]crc32.Table{}
tables[0] = *crc32.MakeTable(crc32.IEEE)
// This slicing-by-8 table generation algorithm is based on that from Go's
// This slicing-by-N table generation algorithm is based on that from Go's
// standard library (the hash/crc32 package).
//
// See also https://create.stephan-brumme.com/crc32/#slicing-by-16-overview
for i := 0; i < 256; i++ {
crc := tables[0][i]
for j := 1; j < 8; j++ {
for j := 1; j < 16; j++ {
crc = tables[0][crc&0xFF] ^ (crc >> 8)
tables[j][i] = crc
}
@@ -49,7 +51,7 @@ func main1() error {
for i, t := range tables {
if i != 0 {
fmt.Println()
fmt.Println("],[")
}
for j, x := range t {
fmt.Printf("0x%08X,", x)