github.com/varialus/godfly@v0.0.0-20130904042352-1934f9f095ab/src/pkg/crypto/sha1/sha1_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 // SHA1 hash algorithm. See RFC 3174. 6 7 package sha1 8 9 import ( 10 "fmt" 11 "io" 12 "testing" 13 ) 14 15 type sha1Test struct { 16 out string 17 in string 18 } 19 20 var golden = []sha1Test{ 21 {"da39a3ee5e6b4b0d3255bfef95601890afd80709", ""}, 22 {"86f7e437faa5a7fce15d1ddcb9eaeaea377667b8", "a"}, 23 {"da23614e02469a0d7c7bd1bdab5c9c474b1904dc", "ab"}, 24 {"a9993e364706816aba3e25717850c26c9cd0d89d", "abc"}, 25 {"81fe8bfe87576c3ecb22426f8e57847382917acf", "abcd"}, 26 {"03de6c570bfe24bfc328ccd7ca46b76eadaf4334", "abcde"}, 27 {"1f8ac10f23c5b5bc1167bda84b833e5c057a77d2", "abcdef"}, 28 {"2fb5e13419fc89246865e7a324f476ec624e8740", "abcdefg"}, 29 {"425af12a0743502b322e93a015bcf868e324d56a", "abcdefgh"}, 30 {"c63b19f1e4c8b5f76b25c49b8b87f57d8e4872a1", "abcdefghi"}, 31 {"d68c19a0a345b7eab78d5e11e991c026ec60db63", "abcdefghij"}, 32 {"ebf81ddcbe5bf13aaabdc4d65354fdf2044f38a7", "Discard medicine more than two years old."}, 33 {"e5dea09392dd886ca63531aaa00571dc07554bb6", "He who has a shady past knows that nice guys finish last."}, 34 {"45988f7234467b94e3e9494434c96ee3609d8f8f", "I wouldn't marry him with a ten foot pole."}, 35 {"55dee037eb7460d5a692d1ce11330b260e40c988", "Free! Free!/A trip/to Mars/for 900/empty jars/Burma Shave"}, 36 {"b7bc5fb91080c7de6b582ea281f8a396d7c0aee8", "The days of the digital watch are numbered. -Tom Stoppard"}, 37 {"c3aed9358f7c77f523afe86135f06b95b3999797", "Nepal premier won't resign."}, 38 {"6e29d302bf6e3a5e4305ff318d983197d6906bb9", "For every action there is an equal and opposite government program."}, 39 {"597f6a540010f94c15d71806a99a2c8710e747bd", "His money is twice tainted: 'taint yours and 'taint mine."}, 40 {"6859733b2590a8a091cecf50086febc5ceef1e80", "There is no reason for any individual to have a computer in their home. -Ken Olsen, 1977"}, 41 {"514b2630ec089b8aee18795fc0cf1f4860cdacad", "It's a tiny change to the code and not completely disgusting. - Bob Manchek"}, 42 {"c5ca0d4a7b6676fc7aa72caa41cc3d5df567ed69", "size: a.out: bad magic"}, 43 {"74c51fa9a04eadc8c1bbeaa7fc442f834b90a00a", "The major problem is with sendmail. -Mark Horton"}, 44 {"0b4c4ce5f52c3ad2821852a8dc00217fa18b8b66", "Give me a rock, paper and scissors and I will move the world. CCFestoon"}, 45 {"3ae7937dd790315beb0f48330e8642237c61550a", "If the enemy is within range, then so are you."}, 46 {"410a2b296df92b9a47412b13281df8f830a9f44b", "It's well we cannot hear the screams/That we create in others' dreams."}, 47 {"841e7c85ca1adcddbdd0187f1289acb5c642f7f5", "You remind me of a TV show, but that's all right: I watch it anyway."}, 48 {"163173b825d03b952601376b25212df66763e1db", "C is as portable as Stonehedge!!"}, 49 {"32b0377f2687eb88e22106f133c586ab314d5279", "Even if I could be Shakespeare, I think I should still choose to be Faraday. - A. Huxley"}, 50 {"0885aaf99b569542fd165fa44e322718f4a984e0", "The fugacity of a constituent in a mixture of gases at a given temperature is proportional to its mole fraction. Lewis-Randall Rule"}, 51 {"6627d6904d71420b0bf3886ab629623538689f45", "How can you write a big system without C++? -Paul Glick"}, 52 } 53 54 func TestGolden(t *testing.T) { 55 for i := 0; i < len(golden); i++ { 56 g := golden[i] 57 s := fmt.Sprintf("%x", Sum([]byte(g.in))) 58 if s != g.out { 59 t.Fatalf("Sum function: sha1(%s) = %s want %s", g.in, s, g.out) 60 } 61 c := New() 62 for j := 0; j < 3; j++ { 63 if j < 2 { 64 io.WriteString(c, g.in) 65 } else { 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 } 70 s := fmt.Sprintf("%x", c.Sum(nil)) 71 if s != g.out { 72 t.Fatalf("sha1[%d](%s) = %s want %s", j, g.in, s, g.out) 73 } 74 c.Reset() 75 } 76 } 77 } 78 79 var bench = New() 80 var buf = make([]byte, 8192) 81 82 func benchmarkSize(b *testing.B, size int) { 83 b.SetBytes(int64(size)) 84 sum := make([]byte, bench.Size()) 85 for i := 0; i < b.N; i++ { 86 bench.Reset() 87 bench.Write(buf[:size]) 88 bench.Sum(sum[:0]) 89 } 90 } 91 92 func BenchmarkHash8Bytes(b *testing.B) { 93 benchmarkSize(b, 8) 94 } 95 96 func BenchmarkHash1K(b *testing.B) { 97 benchmarkSize(b, 1024) 98 } 99 100 func BenchmarkHash8K(b *testing.B) { 101 benchmarkSize(b, 8192) 102 }