1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
/*
* Copyright (C) 2014-2015 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "NetworkCacheKey.h"
#if ENABLE(NETWORK_CACHE)
#include "NetworkCacheCoders.h"
#include <wtf/ASCIICType.h>
#include <wtf/text/CString.h>
#include <wtf/text/StringBuilder.h>
namespace WebKit {
namespace NetworkCache {
Key::Key(const Key& o)
: m_partition(o.m_partition.isolatedCopy())
, m_type(o.m_type.isolatedCopy())
, m_identifier(o.m_identifier.isolatedCopy())
, m_range(o.m_range.isolatedCopy())
, m_hash(o.m_hash)
{
}
Key::Key(const String& partition, const String& type, const String& range, const String& identifier)
: m_partition(partition.isolatedCopy())
, m_type(type.isolatedCopy())
, m_identifier(identifier.isolatedCopy())
, m_range(range.isolatedCopy())
, m_hash(computeHash())
{
}
Key::Key(WTF::HashTableDeletedValueType)
: m_identifier(WTF::HashTableDeletedValue)
{
}
Key& Key::operator=(const Key& other)
{
m_partition = other.m_partition.isolatedCopy();
m_type = other.m_type.isolatedCopy();
m_identifier = other.m_identifier.isolatedCopy();
m_range = other.m_range.isolatedCopy();
m_hash = other.m_hash;
return *this;
}
static void hashString(SHA1& sha1, const String& string)
{
if (string.isNull())
return;
if (string.is8Bit() && string.containsOnlyASCII()) {
const uint8_t nullByte = 0;
sha1.addBytes(string.characters8(), string.length());
sha1.addBytes(&nullByte, 1);
return;
}
auto cString = string.utf8();
// Include terminating null byte.
sha1.addBytes(reinterpret_cast<const uint8_t*>(cString.data()), cString.length() + 1);
}
Key::HashType Key::computeHash() const
{
// We don't really need a cryptographic hash. The key is always verified against the entry header.
// SHA1 just happens to be suitably sized, fast and available.
SHA1 sha1;
hashString(sha1, m_partition);
hashString(sha1, m_type);
hashString(sha1, m_identifier);
hashString(sha1, m_range);
SHA1::Digest hash;
sha1.computeHash(hash);
return hash;
}
String Key::hashAsString() const
{
StringBuilder builder;
builder.reserveCapacity(hashStringLength());
for (auto byte : m_hash) {
builder.append(upperNibbleToASCIIHexDigit(byte));
builder.append(lowerNibbleToASCIIHexDigit(byte));
}
return builder.toString();
}
template <typename CharType> bool hexDigitsToHash(CharType* characters, Key::HashType& hash)
{
for (unsigned i = 0; i < sizeof(hash); ++i) {
auto high = characters[2 * i];
auto low = characters[2 * i + 1];
if (!isASCIIHexDigit(high) || !isASCIIHexDigit(low))
return false;
hash[i] = toASCIIHexValue(high, low);
}
return true;
}
bool Key::stringToHash(const String& string, HashType& hash)
{
if (string.length() != hashStringLength())
return false;
if (string.is8Bit())
return hexDigitsToHash(string.characters8(), hash);
return hexDigitsToHash(string.characters16(), hash);
}
bool Key::operator==(const Key& other) const
{
return m_hash == other.m_hash && m_partition == other.m_partition && m_type == other.m_type && m_identifier == other.m_identifier && m_range == other.m_range;
}
void Key::encode(Encoder& encoder) const
{
encoder << m_partition;
encoder << m_type;
encoder << m_identifier;
encoder << m_range;
encoder << m_hash;
}
bool Key::decode(Decoder& decoder, Key& key)
{
return decoder.decode(key.m_partition) && decoder.decode(key.m_type) && decoder.decode(key.m_identifier) && decoder.decode(key.m_range) && decoder.decode(key.m_hash);
}
}
}
#endif
|
