github.com/varialus/godfly@v0.0.0-20130904042352-1934f9f095ab/src/pkg/crypto/md5/md5_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 md5
     6  
     7  import (
     8  	"fmt"
     9  	"io"
    10  	"testing"
    11  	"unsafe"
    12  )
    13  
    14  type md5Test struct {
    15  	out string
    16  	in  string
    17  }
    18  
    19  var golden = []md5Test{
    20  	{"d41d8cd98f00b204e9800998ecf8427e", ""},
    21  	{"0cc175b9c0f1b6a831c399e269772661", "a"},
    22  	{"187ef4436122d1cc2f40dc2b92f0eba0", "ab"},
    23  	{"900150983cd24fb0d6963f7d28e17f72", "abc"},
    24  	{"e2fc714c4727ee9395f324cd2e7f331f", "abcd"},
    25  	{"ab56b4d92b40713acc5af89985d4b786", "abcde"},
    26  	{"e80b5017098950fc58aad83c8c14978e", "abcdef"},
    27  	{"7ac66c0f148de9519b8bd264312c4d64", "abcdefg"},
    28  	{"e8dc4081b13434b45189a720b77b6818", "abcdefgh"},
    29  	{"8aa99b1f439ff71293e95357bac6fd94", "abcdefghi"},
    30  	{"a925576942e94b2ef57a066101b48876", "abcdefghij"},
    31  	{"d747fc1719c7eacb84058196cfe56d57", "Discard medicine more than two years old."},
    32  	{"bff2dcb37ef3a44ba43ab144768ca837", "He who has a shady past knows that nice guys finish last."},
    33  	{"0441015ecb54a7342d017ed1bcfdbea5", "I wouldn't marry him with a ten foot pole."},
    34  	{"9e3cac8e9e9757a60c3ea391130d3689", "Free! Free!/A trip/to Mars/for 900/empty jars/Burma Shave"},
    35  	{"a0f04459b031f916a59a35cc482dc039", "The days of the digital watch are numbered.  -Tom Stoppard"},
    36  	{"e7a48e0fe884faf31475d2a04b1362cc", "Nepal premier won't resign."},
    37  	{"637d2fe925c07c113800509964fb0e06", "For every action there is an equal and opposite government program."},
    38  	{"834a8d18d5c6562119cf4c7f5086cb71", "His money is twice tainted: 'taint yours and 'taint mine."},
    39  	{"de3a4d2fd6c73ec2db2abad23b444281", "There is no reason for any individual to have a computer in their home. -Ken Olsen, 1977"},
    40  	{"acf203f997e2cf74ea3aff86985aefaf", "It's a tiny change to the code and not completely disgusting. - Bob Manchek"},
    41  	{"e1c1384cb4d2221dfdd7c795a4222c9a", "size:  a.out:  bad magic"},
    42  	{"c90f3ddecc54f34228c063d7525bf644", "The major problem is with sendmail.  -Mark Horton"},
    43  	{"cdf7ab6c1fd49bd9933c43f3ea5af185", "Give me a rock, paper and scissors and I will move the world.  CCFestoon"},
    44  	{"83bc85234942fc883c063cbd7f0ad5d0", "If the enemy is within range, then so are you."},
    45  	{"277cbe255686b48dd7e8f389394d9299", "It's well we cannot hear the screams/That we create in others' dreams."},
    46  	{"fd3fb0a7ffb8af16603f3d3af98f8e1f", "You remind me of a TV show, but that's all right: I watch it anyway."},
    47  	{"469b13a78ebf297ecda64d4723655154", "C is as portable as Stonehedge!!"},
    48  	{"63eb3a2f466410104731c4b037600110", "Even if I could be Shakespeare, I think I should still choose to be Faraday. - A. Huxley"},
    49  	{"72c2ed7592debca1c90fc0100f931a2f", "The fugacity of a constituent in a mixture of gases at a given temperature is proportional to its mole fraction.  Lewis-Randall Rule"},
    50  	{"132f7619d33b523b1d9e5bd8e0928355", "How can you write a big system without C++?  -Paul Glick"},
    51  }
    52  
    53  func TestGolden(t *testing.T) {
    54  	for i := 0; i < len(golden); i++ {
    55  		g := golden[i]
    56  		s := fmt.Sprintf("%x", Sum([]byte(g.in)))
    57  		if s != g.out {
    58  			t.Fatalf("Sum function: md5(%s) = %s want %s", g.in, s, g.out)
    59  		}
    60  		c := New()
    61  		buf := make([]byte, len(g.in)+4)
    62  		for j := 0; j < 3+4; j++ {
    63  			if j < 2 {
    64  				io.WriteString(c, g.in)
    65  			} else if j == 2 {
    66  				io.WriteString(c, g.in[0:len(g.in)/2])
    67  				c.Sum(nil)
    68  				io.WriteString(c, g.in[len(g.in)/2:])
    69  			} else if j > 2 {
    70  				// test unaligned write
    71  				buf = buf[1:]
    72  				copy(buf, g.in)
    73  				c.Write(buf[:len(g.in)])
    74  			}
    75  			s := fmt.Sprintf("%x", c.Sum(nil))
    76  			if s != g.out {
    77  				t.Fatalf("md5[%d](%s) = %s want %s", j, g.in, s, g.out)
    78  			}
    79  			c.Reset()
    80  		}
    81  	}
    82  }
    83  
    84  func TestLarge(t *testing.T) {
    85  	const N = 10000
    86  	ok := "2bb571599a4180e1d542f76904adc3df" // md5sum of "0123456789" * 1000
    87  	block := make([]byte, 10004)
    88  	c := New()
    89  	for offset := 0; offset < 4; offset++ {
    90  		for i := 0; i < N; i++ {
    91  			block[offset+i] = '0' + byte(i%10)
    92  		}
    93  		for blockSize := 10; blockSize <= N; blockSize *= 10 {
    94  			blocks := N / blockSize
    95  			b := block[offset : offset+blockSize]
    96  			c.Reset()
    97  			for i := 0; i < blocks; i++ {
    98  				c.Write(b)
    99  			}
   100  			s := fmt.Sprintf("%x", c.Sum(nil))
   101  			if s != ok {
   102  				t.Fatalf("md5 TestLarge offset=%d, blockSize=%d = %s want %s", offset, blockSize, s, ok)
   103  			}
   104  		}
   105  	}
   106  }
   107  
   108  var bench = New()
   109  var buf = make([]byte, 8192+1)
   110  var sum = make([]byte, bench.Size())
   111  
   112  func benchmarkSize(b *testing.B, size int, unaligned bool) {
   113  	b.SetBytes(int64(size))
   114  	buf := buf
   115  	if unaligned {
   116  		if uintptr(unsafe.Pointer(&buf[0]))&(unsafe.Alignof(uint32(0))-1) == 0 {
   117  			buf = buf[1:]
   118  		}
   119  	}
   120  	b.ResetTimer()
   121  	for i := 0; i < b.N; i++ {
   122  		bench.Reset()
   123  		bench.Write(buf[:size])
   124  		bench.Sum(sum[:0])
   125  	}
   126  }
   127  
   128  func BenchmarkHash8Bytes(b *testing.B) {
   129  	benchmarkSize(b, 8, false)
   130  }
   131  
   132  func BenchmarkHash1K(b *testing.B) {
   133  	benchmarkSize(b, 1024, false)
   134  }
   135  
   136  func BenchmarkHash8K(b *testing.B) {
   137  	benchmarkSize(b, 8192, false)
   138  }
   139  
   140  func BenchmarkHash8BytesUnaligned(b *testing.B) {
   141  	benchmarkSize(b, 8, true)
   142  }
   143  
   144  func BenchmarkHash1KUnaligned(b *testing.B) {
   145  	benchmarkSize(b, 1024, true)
   146  }
   147  
   148  func BenchmarkHash8KUnaligned(b *testing.B) {
   149  	benchmarkSize(b, 8192, true)
   150  }