mirror of
https://github.com/facebook/react-native.git
synced 2025-11-01 09:14:26 +00:00
Andrei Shikov
5b489d5f95
Summary: Replaces dynamic manually managed array with a vector of bytes, removing the need for managing memory manually. This approach is a little bit slower than before, as vector is allocating memory more conservatively. This can be improved in the future by providing an estimate for the data size. Changelog: [Internal] Reviewed By: javache Differential Revision: D33611759 fbshipit-source-id: a0e5e57c4e413206a9f891cd5630ecc9088a9bf7
129 lines
3.2 KiB
C++
129 lines
3.2 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 "MapBuffer.h"
|
|
|
|
using namespace facebook::react;
|
|
|
|
namespace facebook {
|
|
namespace react {
|
|
|
|
// TODO T83483191: Extend MapBuffer C++ implementation to support basic random
|
|
// access
|
|
MapBuffer::MapBuffer(std::vector<uint8_t> data) : bytes_(std::move(data)) {
|
|
memcpy(
|
|
reinterpret_cast<uint8_t *>(&count_),
|
|
bytes_.data() + HEADER_COUNT_OFFSET,
|
|
UINT16_SIZE);
|
|
|
|
// TODO T83483191: extract memcpy calls into an inline function to simplify
|
|
// the code
|
|
uint32_t dataSize;
|
|
memcpy(
|
|
reinterpret_cast<uint8_t *>(&dataSize),
|
|
bytes_.data() + HEADER_BUFFER_SIZE_OFFSET,
|
|
INT_SIZE);
|
|
|
|
if (dataSize != bytes_.size()) {
|
|
LOG(ERROR) << "Error: Data size does not match, expected " << dataSize
|
|
<< " found: " << bytes_.size();
|
|
abort();
|
|
}
|
|
}
|
|
|
|
int32_t MapBuffer::getInt(Key key) const {
|
|
int32_t value = 0;
|
|
memcpy(
|
|
reinterpret_cast<uint8_t *>(&value),
|
|
bytes_.data() + getValueOffset(key),
|
|
INT_SIZE);
|
|
return value;
|
|
}
|
|
|
|
bool MapBuffer::getBool(Key key) const {
|
|
return getInt(key) != 0;
|
|
}
|
|
|
|
double MapBuffer::getDouble(Key key) const {
|
|
// TODO T83483191: extract this code into a "template method" and reuse it for
|
|
// other types
|
|
double value = 0;
|
|
memcpy(
|
|
reinterpret_cast<uint8_t *>(&value),
|
|
bytes_.data() + getValueOffset(key),
|
|
DOUBLE_SIZE);
|
|
return value;
|
|
}
|
|
|
|
int32_t MapBuffer::getDynamicDataOffset() const {
|
|
// The begininig of dynamic data can be calculated as the offset of the next
|
|
// key in the map
|
|
return getKeyOffset(count_);
|
|
}
|
|
|
|
std::string MapBuffer::getString(Key key) const {
|
|
// TODO T83483191:Add checks to verify that offsets are under the boundaries
|
|
// of the map buffer
|
|
int32_t dynamicDataOffset = getDynamicDataOffset();
|
|
int32_t stringLength = 0;
|
|
int32_t offset = getInt(key);
|
|
memcpy(
|
|
reinterpret_cast<uint8_t *>(&stringLength),
|
|
bytes_.data() + dynamicDataOffset + offset,
|
|
INT_SIZE);
|
|
|
|
char *value = new char[stringLength];
|
|
|
|
memcpy(
|
|
reinterpret_cast<char *>(value),
|
|
bytes_.data() + dynamicDataOffset + offset + INT_SIZE,
|
|
stringLength);
|
|
|
|
return std::string(value, 0, stringLength);
|
|
}
|
|
|
|
MapBuffer MapBuffer::getMapBuffer(Key key) const {
|
|
// TODO T83483191: Add checks to verify that offsets are under the boundaries
|
|
// of the map buffer
|
|
int32_t dynamicDataOffset = getDynamicDataOffset();
|
|
|
|
int32_t mapBufferLength = 0;
|
|
int32_t offset = getInt(key);
|
|
memcpy(
|
|
reinterpret_cast<uint8_t *>(&mapBufferLength),
|
|
bytes_.data() + dynamicDataOffset + offset,
|
|
INT_SIZE);
|
|
|
|
std::vector<uint8_t> value(mapBufferLength);
|
|
|
|
memcpy(
|
|
value.data(),
|
|
bytes_.data() + dynamicDataOffset + offset + INT_SIZE,
|
|
mapBufferLength);
|
|
|
|
return MapBuffer(std::move(value));
|
|
}
|
|
|
|
bool MapBuffer::isNull(Key key) const {
|
|
return getInt(key) == NULL_VALUE;
|
|
}
|
|
|
|
uint32_t MapBuffer::size() const {
|
|
return bytes_.size();
|
|
}
|
|
|
|
uint8_t const *MapBuffer::data() const {
|
|
return bytes_.data();
|
|
}
|
|
|
|
uint16_t MapBuffer::count() const {
|
|
return count_;
|
|
}
|
|
|
|
} // namespace react
|
|
} // namespace facebook
|