OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #include "config.h" | |
32 #include "wtf/SHA1.h" | |
33 | |
34 #include "wtf/StringExtras.h" | |
35 | |
36 #include <gtest/gtest.h> | |
37 | |
38 namespace { | |
39 | |
40 class SHA1Test : public testing::Test { | |
41 char m_buffer[41]; | |
42 | |
43 protected: | |
44 const char* SHA1HexDigest(const char* input, int repeat) | |
45 { | |
46 SHA1 sha1; | |
47 for (int i = 0; i < repeat; i++) | |
48 sha1.addBytes(input); | |
49 Vector<uint8_t, 20> digest; | |
50 sha1.computeHash(digest); | |
51 | |
52 char* buffer = &m_buffer[0]; | |
53 for (size_t i = 0; i < 20; ++i) { | |
54 snprintf(buffer, 3, "%02X", digest.at(i)); | |
55 buffer += 2; | |
56 } | |
57 return &m_buffer[0]; | |
58 } | |
59 }; | |
60 | |
61 TEST_F(SHA1Test, RFC3174) | |
62 { | |
63 // Examples taken from sample code in RFC 3174. | |
64 EXPECT_STREQ("A9993E364706816ABA3E25717850C26C9CD0D89D", SHA1HexDigest("abc"
, 1)); | |
65 EXPECT_STREQ("84983E441C3BD26EBAAE4AA1F95129E5E54670F1", SHA1HexDigest("abcd
bcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 1)); | |
66 EXPECT_STREQ("34AA973CD4C4DAA4F61EEB2BDBAD27316534016F", SHA1HexDigest("a",
1000000)); | |
67 EXPECT_STREQ("DEA356A2CDDD90C7A7ECEDC5EBB563934F460452", SHA1HexDigest("0123
456701234567012345670123456701234567012345670123456701234567", 10)); | |
68 } | |
69 | |
70 } // namespace | |
OLD | NEW |