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 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214
|
/*
* Copyright (C) 2017 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 "SubresourceIntegrity.h"
#include "CachedResource.h"
#include "ParsingUtilities.h"
#include "ResourceCryptographicDigest.h"
#include "SharedBuffer.h"
#include <wtf/text/StringParsingBuffer.h>
namespace WebCore {
namespace {
template<typename CharacterType>
static bool isVCHAR(CharacterType c)
{
return c >= 0x21 && c <= 0x7e;
}
template<typename CharacterType>
struct IntegrityMetadataParser {
public:
IntegrityMetadataParser(std::optional<Vector<EncodedResourceCryptographicDigest>>& digests)
: m_digests(digests)
{
}
bool operator()(StringParsingBuffer<CharacterType>& buffer)
{
// Initialize hashes to be something other std::nullopt, to indicate
// that at least one token was seen, and thus setting the empty flag
// from section 3.3.3 Parse metadata, to false.
if (!m_digests)
m_digests = Vector<EncodedResourceCryptographicDigest> { };
auto digest = parseEncodedCryptographicDigest(buffer);
if (!digest)
return false;
// The spec allows for options following the digest, but so far, no
// specific options have been specified. Thus, we just parse and ignore
// them. Their syntax is a '?' follow by any number of VCHARs.
if (skipExactly(buffer, '?'))
skipWhile<isVCHAR>(buffer);
// After the base64 value and options, the current character pointed to by position
// should either be the end or a space.
if (!buffer.atEnd() && !isASCIIWhitespace(*buffer))
return false;
m_digests->append(WTFMove(*digest));
return true;
}
private:
std::optional<Vector<EncodedResourceCryptographicDigest>>& m_digests;
};
}
template <typename CharacterType, typename Functor>
static inline void splitOnSpaces(StringParsingBuffer<CharacterType> buffer, Functor&& functor)
{
skipWhile<isASCIIWhitespace>(buffer);
while (buffer.hasCharactersRemaining()) {
if (!functor(buffer))
skipWhile<isNotASCIIWhitespace>(buffer);
skipWhile<isASCIIWhitespace>(buffer);
}
}
std::optional<Vector<EncodedResourceCryptographicDigest>> parseIntegrityMetadata(const String& integrityMetadata)
{
if (integrityMetadata.isEmpty())
return std::nullopt;
std::optional<Vector<EncodedResourceCryptographicDigest>> result;
readCharactersForParsing(integrityMetadata, [&result] (auto buffer) {
using CharacterType = typename decltype(buffer)::CharacterType;
splitOnSpaces(buffer, IntegrityMetadataParser<CharacterType> { result });
});
return result;
}
static bool isResponseEligible(const CachedResource& resource)
{
// FIXME: The spec says this should check XXX.
return resource.isCORSSameOrigin();
}
static std::optional<EncodedResourceCryptographicDigest::Algorithm> prioritizedHashFunction(EncodedResourceCryptographicDigest::Algorithm a, EncodedResourceCryptographicDigest::Algorithm b)
{
if (a == b)
return std::nullopt;
return (a > b) ? a : b;
}
static Vector<EncodedResourceCryptographicDigest> strongestMetadataFromSet(Vector<EncodedResourceCryptographicDigest>&& set)
{
// 1. Let result be the empty set and strongest be the empty string.
Vector<EncodedResourceCryptographicDigest> result;
auto strongest = EncodedResourceCryptographicDigest::Algorithm::SHA256;
// 2. For each item in set:
for (auto& item : set) {
// 1. If result is the empty set, add item to result and set strongest to item, skip to the next item.
if (result.isEmpty()) {
strongest = item.algorithm;
result.append(WTFMove(item));
continue;
}
// 2. Let currentAlgorithm be the alg component of strongest.
auto currentAlgorithm = strongest;
// 3. Let newAlgorithm be the alg component of item.
auto newAlgorithm = item.algorithm;
// 4. If the result of getPrioritizedHashFunction(currentAlgorithm, newAlgorithm) is
// the empty string, add item to result. If the result is newAlgorithm, set strongest
// to item, set result to the empty set, and add item to result.
auto priority = prioritizedHashFunction(currentAlgorithm, newAlgorithm);
if (!priority)
result.append(WTFMove(item));
else if (priority.value() == newAlgorithm) {
strongest = item.algorithm;
result.clear();
result.append(WTFMove(item));
}
}
return result;
}
bool matchIntegrityMetadataSlow(const CachedResource& resource, const String& integrityMetadataList)
{
// 1. Let parsedMetadata be the result of parsing metadataList.
auto parsedMetadata = parseIntegrityMetadata(integrityMetadataList);
// 2. If parsedMetadata is no metadata, return true.
if (!parsedMetadata)
return true;
// 3. If response is not eligible for integrity validation, return false.
if (!isResponseEligible(resource))
return false;
// 4. If parsedMetadata is the empty set, return true.
if (parsedMetadata->isEmpty())
return true;
// 5. Let metadata be the result of getting the strongest metadata from parsedMetadata.
auto metadata = strongestMetadataFromSet(WTFMove(*parsedMetadata));
// 6. For each item in metadata:
for (auto& item : metadata) {
// 1. Let algorithm be the alg component of item.
auto algorithm = item.algorithm;
// 2. Let expectedValue be the val component of item.
auto expectedValue = decodeEncodedResourceCryptographicDigest(item);
// 3. Let actualValue be the result of applying algorithm to response.
auto actualValue = resource.cryptographicDigest(algorithm);
// 4. If actualValue is a case-sensitive match for expectedValue, return true.
if (expectedValue && actualValue.value == expectedValue->value)
return true;
}
return false;
}
String integrityMismatchDescription(const CachedResource& resource, const String& integrityMetadata)
{
auto resourceURL = resource.url().stringCenterEllipsizedToLength();
if (auto resourceBuffer = resource.resourceBuffer()) {
return makeString(resourceURL, ". Failed integrity metadata check. Content length: ", resourceBuffer->size(), ", Expected content length: ",
resource.response().expectedContentLength(), ", Expected metadata: ", integrityMetadata);
}
return makeString(resourceURL, ". Failed integrity metadata check. Content length: (no content), Expected content length: ",
resource.response().expectedContentLength(), ", Expected metadata: ", integrityMetadata);
}
}
|