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 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
|
/*
* Copyright (C) 2014 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 "IDBKeyData.h"
#include "KeyedCoding.h"
#include <wtf/CrossThreadCopier.h>
#include <wtf/TZoneMallocInlines.h>
#include <wtf/text/MakeString.h>
#include <wtf/text/StringBuilder.h>
namespace WebCore {
WTF_MAKE_TZONE_ALLOCATED_IMPL(IDBKeyData);
IDBKeyData::IDBKeyData(const IDBKey* key)
{
if (!key)
return;
switch (key->type()) {
case IndexedDB::KeyType::Invalid:
m_value = Invalid { };
break;
case IndexedDB::KeyType::Array: {
m_value = Vector<IDBKeyData>();
auto& array = std::get<Vector<IDBKeyData>>(m_value);
for (auto& key2 : key->array())
array.append(IDBKeyData(key2.get()));
break;
}
case IndexedDB::KeyType::Binary:
m_value = key->binary();
break;
case IndexedDB::KeyType::String:
m_value = key->string();
break;
case IndexedDB::KeyType::Date:
m_value = Date { key->date() };
break;
case IndexedDB::KeyType::Number:
m_value = key->number();
break;
case IndexedDB::KeyType::Max:
case IndexedDB::KeyType::Min:
break;
}
}
IDBKeyData::IDBKeyData(const IDBKeyData& data, IsolatedCopyTag)
: m_isDeletedValue(data.m_isDeletedValue)
, m_isPlaceholder(data.m_isPlaceholder)
, m_value(crossThreadCopy(data.m_value))
{
}
IndexedDB::KeyType IDBKeyData::type() const
{
switch (m_value.index()) {
case WTF::alternativeIndexV<std::nullptr_t, ValueVariant>:
case WTF::alternativeIndexV<Invalid, ValueVariant>:
return IndexedDB::KeyType::Invalid;
case WTF::alternativeIndexV<Vector<IDBKeyData>, ValueVariant>:
return IndexedDB::KeyType::Array;
case WTF::alternativeIndexV<String, ValueVariant>:
return IndexedDB::KeyType::String;
case WTF::alternativeIndexV<double, ValueVariant>:
return IndexedDB::KeyType::Number;
case WTF::alternativeIndexV<Date, ValueVariant>:
return IndexedDB::KeyType::Date;
case WTF::alternativeIndexV<ThreadSafeDataBuffer, ValueVariant>:
return IndexedDB::KeyType::Binary;
case WTF::alternativeIndexV<Min, ValueVariant>:
return IndexedDB::KeyType::Min;
case WTF::alternativeIndexV<Max, ValueVariant>:
return IndexedDB::KeyType::Max;
}
RELEASE_ASSERT_NOT_REACHED();
}
RefPtr<IDBKey> IDBKeyData::maybeCreateIDBKey() const
{
if (isNull())
return nullptr;
switch (type()) {
case IndexedDB::KeyType::Invalid:
return IDBKey::createInvalid();
case IndexedDB::KeyType::Array: {
Vector<RefPtr<IDBKey>> array;
for (auto& keyData : std::get<Vector<IDBKeyData>>(m_value)) {
array.append(keyData.maybeCreateIDBKey());
ASSERT(array.last());
}
return IDBKey::createArray(array);
}
case IndexedDB::KeyType::Binary:
return IDBKey::createBinary(std::get<ThreadSafeDataBuffer>(m_value));
case IndexedDB::KeyType::String:
return IDBKey::createString(std::get<String>(m_value));
case IndexedDB::KeyType::Date:
return IDBKey::createDate(std::get<Date>(m_value).value);
case IndexedDB::KeyType::Number:
return IDBKey::createNumber(std::get<double>(m_value));
case IndexedDB::KeyType::Max:
case IndexedDB::KeyType::Min:
ASSERT_NOT_REACHED();
return nullptr;
}
ASSERT_NOT_REACHED();
return nullptr;
}
IDBKeyData IDBKeyData::isolatedCopy() const
{
return { *this, IsolatedCopy };
}
void IDBKeyData::encode(KeyedEncoder& encoder) const
{
encoder.encodeBool("null"_s, isNull());
if (isNull())
return;
encoder.encodeEnum("type"_s, type());
switch (type()) {
case IndexedDB::KeyType::Invalid:
return;
case IndexedDB::KeyType::Array: {
auto& array = std::get<Vector<IDBKeyData>>(m_value);
encoder.encodeObjects("array"_s, array, [](KeyedEncoder& encoder, const IDBKeyData& key) {
key.encode(encoder);
});
return;
}
case IndexedDB::KeyType::Binary: {
auto* data = std::get<ThreadSafeDataBuffer>(m_value).data();
encoder.encodeBool("hasBinary"_s, !!data);
if (data)
encoder.encodeBytes("binary"_s, data->span());
return;
}
case IndexedDB::KeyType::String:
encoder.encodeString("string"_s, std::get<String>(m_value));
return;
case IndexedDB::KeyType::Date:
case IndexedDB::KeyType::Number:
encoder.encodeDouble("number"_s, std::get<double>(m_value));
return;
case IndexedDB::KeyType::Max:
case IndexedDB::KeyType::Min:
return;
}
ASSERT_NOT_REACHED();
}
bool IDBKeyData::decode(KeyedDecoder& decoder, IDBKeyData& result)
{
bool isNull;
if (!decoder.decodeBool("null"_s, isNull))
return false;
if (isNull)
return true;
auto enumFunction = [](IndexedDB::KeyType value) {
return value == IndexedDB::KeyType::Max
|| value == IndexedDB::KeyType::Invalid
|| value == IndexedDB::KeyType::Array
|| value == IndexedDB::KeyType::Binary
|| value == IndexedDB::KeyType::String
|| value == IndexedDB::KeyType::Date
|| value == IndexedDB::KeyType::Number
|| value == IndexedDB::KeyType::Min;
};
IndexedDB::KeyType type;
if (!decoder.decodeEnum("type"_s, type, enumFunction))
return false;
switch (type) {
case IndexedDB::KeyType::Invalid:
return true;
case IndexedDB::KeyType::Max:
result.m_value = Max { };
return true;
case IndexedDB::KeyType::Min:
result.m_value = Min { };
return true;
case IndexedDB::KeyType::String:
result.m_value = String();
return decoder.decodeString("string"_s, std::get<String>(result.m_value));
case IndexedDB::KeyType::Number:
result.m_value = 0.0;
return decoder.decodeDouble("number"_s, std::get<double>(result.m_value));
case IndexedDB::KeyType::Date:
result.m_value = Date { };
return decoder.decodeDouble("number"_s, std::get<Date>(result.m_value).value);
case IndexedDB::KeyType::Binary: {
result.m_value = ThreadSafeDataBuffer();
bool hasBinaryData;
if (!decoder.decodeBool("hasBinary"_s, hasBinaryData))
return false;
if (!hasBinaryData)
return true;
Vector<uint8_t> bytes;
if (!decoder.decodeBytes("binary"_s, bytes))
return false;
result.m_value = ThreadSafeDataBuffer::create(WTFMove(bytes));
return true;
}
case IndexedDB::KeyType::Array:
auto arrayFunction = [](KeyedDecoder& decoder, IDBKeyData& result) {
return decode(decoder, result);
};
result.m_value = Vector<IDBKeyData>();
return decoder.decodeObjects("array"_s, std::get<Vector<IDBKeyData>>(result.m_value), arrayFunction);
}
RELEASE_ASSERT_NOT_REACHED();
}
int IDBKeyData::compare(const IDBKeyData& other) const
{
auto type = this->type();
auto otherType = other.type();
if (type == IndexedDB::KeyType::Invalid) {
if (otherType != IndexedDB::KeyType::Invalid)
return -1;
if (otherType == IndexedDB::KeyType::Invalid)
return 0;
} else if (otherType == IndexedDB::KeyType::Invalid)
return 1;
// The IDBKey::type() enum is in reverse sort order.
if (type != otherType)
return type < otherType ? 1 : -1;
// The types are the same, so handle actual value comparison.
switch (type) {
case IndexedDB::KeyType::Invalid:
// Invalid type should have been fully handled above
ASSERT_NOT_REACHED();
return 0;
case IndexedDB::KeyType::Array: {
auto& array = std::get<Vector<IDBKeyData>>(m_value);
auto& otherArray = std::get<Vector<IDBKeyData>>(other.m_value);
for (size_t i = 0; i < array.size() && i < otherArray.size(); ++i) {
if (int result = array[i].compare(otherArray[i]))
return result;
}
if (array.size() < otherArray.size())
return -1;
if (array.size() > otherArray.size())
return 1;
return 0;
}
case IndexedDB::KeyType::Binary:
return compareBinaryKeyData(std::get<ThreadSafeDataBuffer>(m_value), std::get<ThreadSafeDataBuffer>(other.m_value));
case IndexedDB::KeyType::String:
return codePointCompare(std::get<String>(m_value), std::get<String>(other.m_value));
case IndexedDB::KeyType::Date: {
auto number = std::get<Date>(m_value).value;
auto otherNumber = std::get<Date>(other.m_value).value;
if (number == otherNumber)
return 0;
return number > otherNumber ? 1 : -1;
}
case IndexedDB::KeyType::Number: {
auto number = std::get<double>(m_value);
auto otherNumber = std::get<double>(other.m_value);
if (number == otherNumber)
return 0;
return number > otherNumber ? 1 : -1;
}
case IndexedDB::KeyType::Max:
case IndexedDB::KeyType::Min:
return 0;
}
ASSERT_NOT_REACHED();
return 0;
}
String IDBKeyData::loggingString() const
{
if (isNull())
return "<null>"_s;
String result;
switch (type()) {
case IndexedDB::KeyType::Invalid:
return "<invalid>"_s;
case IndexedDB::KeyType::Array:
result = makeString("<array> - { "_s, interleave(std::get<Vector<IDBKeyData>>(m_value), [](auto& builder, auto& item) { builder.append(item.loggingString()); }, ", "_s), " }"_s);
break;
case IndexedDB::KeyType::Binary: {
StringBuilder builder;
builder.append("<binary> - "_s);
auto* data = std::get<ThreadSafeDataBuffer>(m_value).data();
if (!data) {
builder.append("(null)"_s);
result = builder.toString();
break;
}
size_t i = 0;
for (; i < 8 && i < data->size(); ++i) {
uint8_t byte = data->at(i);
builder.append(upperNibbleToLowercaseASCIIHexDigit(byte),
lowerNibbleToLowercaseASCIIHexDigit(byte));
}
if (data->size() > 8)
builder.append("..."_s);
result = builder.toString();
break;
}
case IndexedDB::KeyType::String:
result = makeString("<string> - "_s, std::get<String>(m_value));
break;
case IndexedDB::KeyType::Date:
return makeString("<date> - "_s, std::get<Date>(m_value).value);
case IndexedDB::KeyType::Number:
return makeString("<number> - "_s, std::get<double>(m_value));
case IndexedDB::KeyType::Max:
return "<maximum>"_s;
case IndexedDB::KeyType::Min:
return "<minimum>"_s;
}
if (result.length() > 150)
result = makeString(StringView(result).left(147), "..."_s);
return result;
}
void IDBKeyData::setArrayValue(const Vector<IDBKeyData>& value)
{
m_value = value;
}
void IDBKeyData::setBinaryValue(const ThreadSafeDataBuffer& value)
{
m_value = value;
}
void IDBKeyData::setStringValue(const String& value)
{
m_value = value;
}
void IDBKeyData::setDateValue(double value)
{
m_value = Date { value };
}
void IDBKeyData::setNumberValue(double value)
{
m_value = value;
}
bool IDBKeyData::isValid() const
{
if (type() == IndexedDB::KeyType::Invalid)
return false;
if (type() == IndexedDB::KeyType::Array) {
for (auto& key : array()) {
if (!key.isValid())
return false;
}
}
return true;
}
bool IDBKeyData::operator<(const IDBKeyData& rhs) const
{
return compare(rhs) < 0;
}
bool IDBKeyData::operator==(const IDBKeyData& other) const
{
if (type() != other.type() || isNull() != other.isNull() || m_isDeletedValue != other.m_isDeletedValue)
return false;
switch (type()) {
case IndexedDB::KeyType::Invalid:
case IndexedDB::KeyType::Max:
case IndexedDB::KeyType::Min:
return true;
case IndexedDB::KeyType::Number:
return std::get<double>(m_value) == std::get<double>(other.m_value);
case IndexedDB::KeyType::Date:
return std::get<Date>(m_value).value == std::get<Date>(other.m_value).value;
case IndexedDB::KeyType::String:
return std::get<String>(m_value) == std::get<String>(other.m_value);
case IndexedDB::KeyType::Binary:
return std::get<ThreadSafeDataBuffer>(m_value) == std::get<ThreadSafeDataBuffer>(other.m_value);
case IndexedDB::KeyType::Array:
return std::get<Vector<IDBKeyData>>(m_value) == std::get<Vector<IDBKeyData>>(other.m_value);
}
RELEASE_ASSERT_NOT_REACHED();
}
size_t IDBKeyData::size() const
{
if (isNull())
return 0;
switch (type()) {
case IndexedDB::KeyType::Invalid:
return 0;
case IndexedDB::KeyType::Array: {
Vector<RefPtr<IDBKey>> array;
size_t totalSize = 0;
for (auto& keyData : std::get<Vector<IDBKeyData>>(m_value))
totalSize += keyData.size();
return totalSize;
}
case IndexedDB::KeyType::Binary:
return std::get<ThreadSafeDataBuffer>(m_value).size();
case IndexedDB::KeyType::String:
return std::get<String>(m_value).sizeInBytes();
case IndexedDB::KeyType::Date:
return sizeof(Date);
case IndexedDB::KeyType::Number:
return sizeof(double);
case IndexedDB::KeyType::Max:
case IndexedDB::KeyType::Min:
return 0;
}
ASSERT_NOT_REACHED();
return 0;
}
} // namespace WebCore
|