mirror of
https://github.com/facebook/react-native.git
synced 2025-11-01 09:14:26 +00:00
Andrei Shikov
d287598d23
Summary: Removes the need to store keys in incremental order by sorting them after before inserting into MapBuffer. Updates MapBuffer to support random access on C++ side, actually retrieving values by keys and not bucket index. Changelog: [Internal] Reviewed By: mdvacca Differential Revision: D33611758 fbshipit-source-id: c81e970613c8ecc688bfacb29ba038bf081a0c0f
125 lines
3.3 KiB
C++
125 lines
3.3 KiB
C++
/*
|
|
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
|
|
#include "MapBufferBuilder.h"
|
|
#include <algorithm>
|
|
|
|
using namespace facebook::react;
|
|
|
|
namespace facebook {
|
|
namespace react {
|
|
|
|
MapBuffer MapBufferBuilder::EMPTY() {
|
|
return MapBufferBuilder(0).build();
|
|
}
|
|
|
|
MapBufferBuilder::MapBufferBuilder(uint32_t initialSize) {
|
|
buckets_.reserve(initialSize);
|
|
}
|
|
|
|
void MapBufferBuilder::storeKeyValue(
|
|
Key key,
|
|
uint8_t const *value,
|
|
uint32_t valueSize) {
|
|
if (valueSize > MAX_VALUE_SIZE) {
|
|
LOG(ERROR) << "Error: size of value must be <= MAX_VALUE_SIZE. ValueSize: "
|
|
<< valueSize;
|
|
abort();
|
|
}
|
|
|
|
uint64_t data = 0;
|
|
auto *dataPtr = reinterpret_cast<uint8_t *>(&data);
|
|
memcpy(dataPtr, value, valueSize);
|
|
|
|
buckets_.emplace_back(key, data);
|
|
|
|
header_.count++;
|
|
|
|
if (lastKey_ > key) {
|
|
needsSort_ = true;
|
|
}
|
|
lastKey_ = key;
|
|
}
|
|
|
|
void MapBufferBuilder::putBool(Key key, bool value) {
|
|
putInt(key, (int)value);
|
|
}
|
|
|
|
void MapBufferBuilder::putDouble(Key key, double value) {
|
|
auto const *bytePointer = reinterpret_cast<uint8_t *>(&value);
|
|
storeKeyValue(key, bytePointer, DOUBLE_SIZE);
|
|
}
|
|
|
|
void MapBufferBuilder::putNull(Key key) {
|
|
putInt(key, NULL_VALUE);
|
|
}
|
|
|
|
void MapBufferBuilder::putInt(Key key, int32_t value) {
|
|
auto const *bytePointer = reinterpret_cast<uint8_t *>(&(value));
|
|
storeKeyValue(key, bytePointer, INT_SIZE);
|
|
}
|
|
|
|
void MapBufferBuilder::putString(Key key, std::string const &value) {
|
|
int32_t strSize = value.size();
|
|
const char *strData = value.data();
|
|
|
|
// format [length of string (int)] + [Array of Characters in the string]
|
|
auto offset = dynamicData_.size();
|
|
dynamicData_.resize(offset + INT_SIZE + strSize, 0);
|
|
memcpy(dynamicData_.data() + offset, &strSize, INT_SIZE);
|
|
memcpy(dynamicData_.data() + offset + INT_SIZE, strData, strSize);
|
|
|
|
// Store Key and pointer to the string
|
|
putInt(key, offset);
|
|
}
|
|
|
|
void MapBufferBuilder::putMapBuffer(Key key, MapBuffer const &map) {
|
|
int32_t mapBufferSize = map.size();
|
|
|
|
auto offset = dynamicData_.size();
|
|
|
|
// format [length of buffer (int)] + [bytes of MapBuffer]
|
|
dynamicData_.resize(offset + INT_SIZE + mapBufferSize, 0);
|
|
memcpy(dynamicData_.data() + offset, &mapBufferSize, INT_SIZE);
|
|
// Copy the content of the map into dynamicData_
|
|
memcpy(dynamicData_.data() + offset + INT_SIZE, map.data(), mapBufferSize);
|
|
|
|
// Store Key and pointer to the string
|
|
putInt(key, offset);
|
|
}
|
|
|
|
static inline bool compareBuckets(Bucket const &a, Bucket const &b) {
|
|
return a.key < b.key;
|
|
}
|
|
|
|
MapBuffer MapBufferBuilder::build() {
|
|
// Create buffer: [header] + [key, values] + [dynamic data]
|
|
auto bucketSize = buckets_.size() * BUCKET_SIZE;
|
|
uint32_t bufferSize = HEADER_SIZE + bucketSize + dynamicData_.size();
|
|
|
|
header_.bufferSize = bufferSize;
|
|
|
|
if (needsSort_) {
|
|
std::sort(buckets_.begin(), buckets_.end(), compareBuckets);
|
|
}
|
|
|
|
// TODO(T83483191): add pass to check for duplicates
|
|
|
|
std::vector<uint8_t> buffer(bufferSize);
|
|
memcpy(buffer.data(), &header_, HEADER_SIZE);
|
|
memcpy(buffer.data() + HEADER_SIZE, buckets_.data(), bucketSize);
|
|
memcpy(
|
|
buffer.data() + HEADER_SIZE + bucketSize,
|
|
dynamicData_.data(),
|
|
dynamicData_.size());
|
|
|
|
return MapBuffer(std::move(buffer));
|
|
}
|
|
|
|
} // namespace react
|
|
} // namespace facebook
|