github.com/euank/go@v0.0.0-20160829210321-495514729181/src/hash/crc32/crc32_test.go (about) 1 // Copyright 2009 The Go Authors. All rights reserved. 2 // Use of this source code is governed by a BSD-style 3 // license that can be found in the LICENSE file. 4 5 package crc32 6 7 import ( 8 "hash" 9 "io" 10 "testing" 11 ) 12 13 type test struct { 14 ieee, castagnoli uint32 15 in string 16 } 17 18 var golden = []test{ 19 {0x0, 0x0, ""}, 20 {0xe8b7be43, 0xc1d04330, "a"}, 21 {0x9e83486d, 0xe2a22936, "ab"}, 22 {0x352441c2, 0x364b3fb7, "abc"}, 23 {0xed82cd11, 0x92c80a31, "abcd"}, 24 {0x8587d865, 0xc450d697, "abcde"}, 25 {0x4b8e39ef, 0x53bceff1, "abcdef"}, 26 {0x312a6aa6, 0xe627f441, "abcdefg"}, 27 {0xaeef2a50, 0xa9421b7, "abcdefgh"}, 28 {0x8da988af, 0x2ddc99fc, "abcdefghi"}, 29 {0x3981703a, 0xe6599437, "abcdefghij"}, 30 {0x6b9cdfe7, 0xb2cc01fe, "Discard medicine more than two years old."}, 31 {0xc90ef73f, 0xe28207f, "He who has a shady past knows that nice guys finish last."}, 32 {0xb902341f, 0xbe93f964, "I wouldn't marry him with a ten foot pole."}, 33 {0x42080e8, 0x9e3be0c3, "Free! Free!/A trip/to Mars/for 900/empty jars/Burma Shave"}, 34 {0x154c6d11, 0xf505ef04, "The days of the digital watch are numbered. -Tom Stoppard"}, 35 {0x4c418325, 0x85d3dc82, "Nepal premier won't resign."}, 36 {0x33955150, 0xc5142380, "For every action there is an equal and opposite government program."}, 37 {0x26216a4b, 0x75eb77dd, "His money is twice tainted: 'taint yours and 'taint mine."}, 38 {0x1abbe45e, 0x91ebe9f7, "There is no reason for any individual to have a computer in their home. -Ken Olsen, 1977"}, 39 {0xc89a94f7, 0xf0b1168e, "It's a tiny change to the code and not completely disgusting. - Bob Manchek"}, 40 {0xab3abe14, 0x572b74e2, "size: a.out: bad magic"}, 41 {0xbab102b6, 0x8a58a6d5, "The major problem is with sendmail. -Mark Horton"}, 42 {0x999149d7, 0x9c426c50, "Give me a rock, paper and scissors and I will move the world. CCFestoon"}, 43 {0x6d52a33c, 0x735400a4, "If the enemy is within range, then so are you."}, 44 {0x90631e8d, 0xbec49c95, "It's well we cannot hear the screams/That we create in others' dreams."}, 45 {0x78309130, 0xa95a2079, "You remind me of a TV show, but that's all right: I watch it anyway."}, 46 {0x7d0a377f, 0xde2e65c5, "C is as portable as Stonehedge!!"}, 47 {0x8c79fd79, 0x297a88ed, "Even if I could be Shakespeare, I think I should still choose to be Faraday. - A. Huxley"}, 48 {0xa20b7167, 0x66ed1d8b, "The fugacity of a constituent in a mixture of gases at a given temperature is proportional to its mole fraction. Lewis-Randall Rule"}, 49 {0x8e0bb443, 0xdcded527, "How can you write a big system without C++? -Paul Glick"}, 50 } 51 52 func TestGolden(t *testing.T) { 53 castagnoliTab := MakeTable(Castagnoli) 54 if castagnoliTab == nil { 55 t.Errorf("nil Castagnoli Table") 56 } 57 58 for _, g := range golden { 59 ieee := NewIEEE() 60 io.WriteString(ieee, g.in) 61 s := ieee.Sum32() 62 if s != g.ieee { 63 t.Errorf("IEEE(%s) = 0x%x want 0x%x", g.in, s, g.ieee) 64 } 65 66 castagnoli := New(castagnoliTab) 67 io.WriteString(castagnoli, g.in) 68 s = castagnoli.Sum32() 69 if s != g.castagnoli { 70 t.Errorf("Castagnoli(%s) = 0x%x want 0x%x", g.in, s, g.castagnoli) 71 } 72 73 // The SSE4.2 implementation of this has code to deal 74 // with misaligned data so we ensure that we test that 75 // too. 76 for delta := 1; delta <= 7; delta++ { 77 if len(g.in) > delta { 78 in := []byte(g.in) 79 castagnoli = New(castagnoliTab) 80 castagnoli.Write(in[:delta]) 81 castagnoli.Write(in[delta:]) 82 s = castagnoli.Sum32() 83 if s != g.castagnoli { 84 t.Errorf("Castagnoli[misaligned](%s) = 0x%x want 0x%x", g.in, s, g.castagnoli) 85 } 86 } 87 } 88 } 89 } 90 91 func BenchmarkIEEECrc40B(b *testing.B) { 92 benchmark(b, NewIEEE(), 40, 0) 93 } 94 95 func BenchmarkIEEECrc1KB(b *testing.B) { 96 benchmark(b, NewIEEE(), 1<<10, 0) 97 } 98 99 func BenchmarkIEEECrc4KB(b *testing.B) { 100 benchmark(b, NewIEEE(), 4<<10, 0) 101 } 102 103 func BenchmarkIEEECrc32KB(b *testing.B) { 104 benchmark(b, NewIEEE(), 32<<10, 0) 105 } 106 107 func BenchmarkCastagnoliCrc15B(b *testing.B) { 108 benchmark(b, New(MakeTable(Castagnoli)), 15, 0) 109 } 110 111 func BenchmarkCastagnoliCrc15BMisaligned(b *testing.B) { 112 benchmark(b, New(MakeTable(Castagnoli)), 15, 1) 113 } 114 115 func BenchmarkCastagnoliCrc40B(b *testing.B) { 116 benchmark(b, New(MakeTable(Castagnoli)), 40, 0) 117 } 118 119 func BenchmarkCastagnoliCrc40BMisaligned(b *testing.B) { 120 benchmark(b, New(MakeTable(Castagnoli)), 40, 1) 121 } 122 123 func BenchmarkCastagnoliCrc512(b *testing.B) { 124 benchmark(b, New(MakeTable(Castagnoli)), 512, 0) 125 } 126 127 func BenchmarkCastagnoliCrc512Misaligned(b *testing.B) { 128 benchmark(b, New(MakeTable(Castagnoli)), 512, 1) 129 } 130 131 func BenchmarkCastagnoliCrc1KB(b *testing.B) { 132 benchmark(b, New(MakeTable(Castagnoli)), 1<<10, 0) 133 } 134 135 func BenchmarkCastagnoliCrc1KBMisaligned(b *testing.B) { 136 benchmark(b, New(MakeTable(Castagnoli)), 1<<10, 1) 137 } 138 139 func BenchmarkCastagnoliCrc4KB(b *testing.B) { 140 benchmark(b, New(MakeTable(Castagnoli)), 4<<10, 0) 141 } 142 143 func BenchmarkCastagnoliCrc4KBMisaligned(b *testing.B) { 144 benchmark(b, New(MakeTable(Castagnoli)), 4<<10, 1) 145 } 146 147 func BenchmarkCastagnoliCrc32KB(b *testing.B) { 148 benchmark(b, New(MakeTable(Castagnoli)), 32<<10, 0) 149 } 150 151 func BenchmarkCastagnoliCrc32KBMisaligned(b *testing.B) { 152 benchmark(b, New(MakeTable(Castagnoli)), 32<<10, 1) 153 } 154 155 func benchmark(b *testing.B, h hash.Hash32, n, alignment int64) { 156 b.SetBytes(n) 157 data := make([]byte, n+alignment) 158 data = data[alignment:] 159 for i := range data { 160 data[i] = byte(i) 161 } 162 in := make([]byte, 0, h.Size()) 163 164 // Warm up 165 h.Reset() 166 h.Write(data) 167 h.Sum(in) 168 169 b.ResetTimer() 170 for i := 0; i < b.N; i++ { 171 h.Reset() 172 h.Write(data) 173 h.Sum(in) 174 } 175 }