...

Source file src/hash/adler32/adler32_test.go

Documentation: hash/adler32

		 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 adler32
		 6  
		 7  import (
		 8  	"encoding"
		 9  	"io"
		10  	"strings"
		11  	"testing"
		12  )
		13  
		14  var golden = []struct {
		15  	out			 uint32
		16  	in				string
		17  	halfState string // marshaled hash state after first half of in written, used by TestGoldenMarshal
		18  }{
		19  	{0x00000001, "", "adl\x01\x00\x00\x00\x01"},
		20  	{0x00620062, "a", "adl\x01\x00\x00\x00\x01"},
		21  	{0x012600c4, "ab", "adl\x01\x00b\x00b"},
		22  	{0x024d0127, "abc", "adl\x01\x00b\x00b"},
		23  	{0x03d8018b, "abcd", "adl\x01\x01&\x00\xc4"},
		24  	{0x05c801f0, "abcde", "adl\x01\x01&\x00\xc4"},
		25  	{0x081e0256, "abcdef", "adl\x01\x02M\x01'"},
		26  	{0x0adb02bd, "abcdefg", "adl\x01\x02M\x01'"},
		27  	{0x0e000325, "abcdefgh", "adl\x01\x03\xd8\x01\x8b"},
		28  	{0x118e038e, "abcdefghi", "adl\x01\x03\xd8\x01\x8b"},
		29  	{0x158603f8, "abcdefghij", "adl\x01\x05\xc8\x01\xf0"},
		30  	{0x3f090f02, "Discard medicine more than two years old.", "adl\x01NU\a\x87"},
		31  	{0x46d81477, "He who has a shady past knows that nice guys finish last.", "adl\x01\x89\x8e\t\xe9"},
		32  	{0x40ee0ee1, "I wouldn't marry him with a ten foot pole.", "adl\x01R\t\ag"},
		33  	{0x16661315, "Free! Free!/A trip/to Mars/for 900/empty jars/Burma Shave", "adl\x01\u007f\xbb\t\x10"},
		34  	{0x5b2e1480, "The days of the digital watch are numbered.	-Tom Stoppard", "adl\x01\x99:\n~"},
		35  	{0x8c3c09ea, "Nepal premier won't resign.", "adl\x01\"\x05\x05\x05"},
		36  	{0x45ac18fd, "For every action there is an equal and opposite government program.", "adl\x01\xcc\xfa\f\x00"},
		37  	{0x53c61462, "His money is twice tainted: 'taint yours and 'taint mine.", "adl\x01\x93\xa9\n\b"},
		38  	{0x7e511e63, "There is no reason for any individual to have a computer in their home. -Ken Olsen, 1977", "adl\x01e\xf5\x10\x14"},
		39  	{0xe4801a6a, "It's a tiny change to the code and not completely disgusting. - Bob Manchek", "adl\x01\xee\x00\f\xb2"},
		40  	{0x61b507df, "size:	a.out:	bad magic", "adl\x01\x1a\xfc\x04\x1d"},
		41  	{0xb8631171, "The major problem is with sendmail.	-Mark Horton", "adl\x01mi\b\xdc"},
		42  	{0x8b5e1904, "Give me a rock, paper and scissors and I will move the world.	CCFestoon", "adl\x01\xe3\n\f\x9f"},
		43  	{0x7cc6102b, "If the enemy is within range, then so are you.", "adl\x01_\xe0\b\x1e"},
		44  	{0x700318e7, "It's well we cannot hear the screams/That we create in others' dreams.", "adl\x01ۘ\f\x87"},
		45  	{0x1e601747, "You remind me of a TV show, but that's all right: I watch it anyway.", "adl\x01\xcc}\v\x83"},
		46  	{0xb55b0b09, "C is as portable as Stonehedge!!", "adl\x01,^\x05\xad"},
		47  	{0x39111dd0, "Even if I could be Shakespeare, I think I should still choose to be Faraday. - A. Huxley", "adl\x01M\xd1\x0e\xc8"},
		48  	{0x91dd304f, "The fugacity of a constituent in a mixture of gases at a given temperature is proportional to its mole fraction.	Lewis-Randall Rule", "adl\x01#\xd8\x17\xd7"},
		49  	{0x2e5d1316, "How can you write a big system without C++?	-Paul Glick", "adl\x01\x8fU\n\x0f"},
		50  	{0xd0201df6, "'Invariant assertions' is the most elegant programming technique!	-Tom Szymanski", "adl\x01/\x98\x0e\xc4"},
		51  	{0x211297c8, strings.Repeat("\xff", 5548) + "8", "adl\x01\x9a\xa6\xcb\xc1"},
		52  	{0xbaa198c8, strings.Repeat("\xff", 5549) + "9", "adl\x01gu\xcc\xc0"},
		53  	{0x553499be, strings.Repeat("\xff", 5550) + "0", "adl\x01gu\xcc\xc0"},
		54  	{0xf0c19abe, strings.Repeat("\xff", 5551) + "1", "adl\x015CͿ"},
		55  	{0x8d5c9bbe, strings.Repeat("\xff", 5552) + "2", "adl\x015CͿ"},
		56  	{0x2af69cbe, strings.Repeat("\xff", 5553) + "3", "adl\x01\x04\x10ξ"},
		57  	{0xc9809dbe, strings.Repeat("\xff", 5554) + "4", "adl\x01\x04\x10ξ"},
		58  	{0x69189ebe, strings.Repeat("\xff", 5555) + "5", "adl\x01\xd3\xcdϽ"},
		59  	{0x86af0001, strings.Repeat("\x00", 1e5), "adl\x01\xc3P\x00\x01"},
		60  	{0x79660b4d, strings.Repeat("a", 1e5), "adl\x01\x81k\x05\xa7"},
		61  	{0x110588ee, strings.Repeat("ABCDEFGHIJKLMNOPQRSTUVWXYZ", 1e4), "adl\x01e\xd2\xc4p"},
		62  }
		63  
		64  // checksum is a slow but simple implementation of the Adler-32 checksum.
		65  // It is a straight port of the sample code in RFC 1950 section 9.
		66  func checksum(p []byte) uint32 {
		67  	s1, s2 := uint32(1), uint32(0)
		68  	for _, x := range p {
		69  		s1 = (s1 + uint32(x)) % mod
		70  		s2 = (s2 + s1) % mod
		71  	}
		72  	return s2<<16 | s1
		73  }
		74  
		75  func TestGolden(t *testing.T) {
		76  	for _, g := range golden {
		77  		in := g.in
		78  		if len(in) > 220 {
		79  			in = in[:100] + "..." + in[len(in)-100:]
		80  		}
		81  		p := []byte(g.in)
		82  		if got := checksum(p); got != g.out {
		83  			t.Errorf("simple implementation: checksum(%q) = 0x%x want 0x%x", in, got, g.out)
		84  			continue
		85  		}
		86  		if got := Checksum(p); got != g.out {
		87  			t.Errorf("optimized implementation: Checksum(%q) = 0x%x want 0x%x", in, got, g.out)
		88  			continue
		89  		}
		90  	}
		91  }
		92  
		93  func TestGoldenMarshal(t *testing.T) {
		94  	for _, g := range golden {
		95  		h := New()
		96  		h2 := New()
		97  
		98  		io.WriteString(h, g.in[:len(g.in)/2])
		99  
	 100  		state, err := h.(encoding.BinaryMarshaler).MarshalBinary()
	 101  		if err != nil {
	 102  			t.Errorf("could not marshal: %v", err)
	 103  			continue
	 104  		}
	 105  
	 106  		if string(state) != g.halfState {
	 107  			t.Errorf("checksum(%q) state = %q, want %q", g.in, state, g.halfState)
	 108  			continue
	 109  		}
	 110  
	 111  		if err := h2.(encoding.BinaryUnmarshaler).UnmarshalBinary(state); err != nil {
	 112  			t.Errorf("could not unmarshal: %v", err)
	 113  			continue
	 114  		}
	 115  
	 116  		io.WriteString(h, g.in[len(g.in)/2:])
	 117  		io.WriteString(h2, g.in[len(g.in)/2:])
	 118  
	 119  		if h.Sum32() != h2.Sum32() {
	 120  			t.Errorf("checksum(%q) = 0x%x != marshaled (0x%x)", g.in, h.Sum32(), h2.Sum32())
	 121  		}
	 122  	}
	 123  }
	 124  
	 125  func BenchmarkAdler32KB(b *testing.B) {
	 126  	b.SetBytes(1024)
	 127  	data := make([]byte, 1024)
	 128  	for i := range data {
	 129  		data[i] = byte(i)
	 130  	}
	 131  	h := New()
	 132  	in := make([]byte, 0, h.Size())
	 133  
	 134  	b.ResetTimer()
	 135  	for i := 0; i < b.N; i++ {
	 136  		h.Reset()
	 137  		h.Write(data)
	 138  		h.Sum(in)
	 139  	}
	 140  }
	 141  

View as plain text