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