Made FlexBuffers reuse tracker track types

This commit is contained in:
Wouter van Oortmerssen
2021-12-14 10:00:56 -08:00
parent a22b1b6267
commit f8148b8dad
4 changed files with 54 additions and 42 deletions

View File

@@ -373,7 +373,7 @@ class Reference {
Reference() Reference()
: data_(nullptr), : data_(nullptr),
parent_width_(0), parent_width_(0),
byte_width_(BIT_WIDTH_8), byte_width_(0),
type_(FBT_NULL) {} type_(FBT_NULL) {}
Reference(const uint8_t *data, uint8_t parent_width, uint8_t byte_width, Reference(const uint8_t *data, uint8_t parent_width, uint8_t byte_width,
@@ -1632,6 +1632,8 @@ class Builder FLATBUFFERS_FINAL_CLASS {
KeyOffsetMap key_pool; KeyOffsetMap key_pool;
StringOffsetMap string_pool; StringOffsetMap string_pool;
friend class Verifier;
}; };
// Helper class to verify the integrity of a FlexBuffer // Helper class to verify the integrity of a FlexBuffer
@@ -1640,19 +1642,14 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
Verifier(const uint8_t *buf, size_t buf_len, Verifier(const uint8_t *buf, size_t buf_len,
// Supplying this vector likely results in faster verification // Supplying this vector likely results in faster verification
// of larger buffers with many shared keys/strings, but // of larger buffers with many shared keys/strings, but
// comes at the cost of using additional memory 1/8th the size of // comes at the cost of using additional memory the same size of
// the buffer being verified, so it is allowed to be null // the buffer being verified, so it is by default off.
// for special situations (memory constrained devices or std::vector<uint8_t> *reuse_tracker = nullptr)
// really small buffers etc). Do note that when not supplying
// this buffer, you are not protected against buffers crafted
// specifically to DoS you, i.e. recursive sharing that causes
// exponential amounts of verification CPU time.
std::vector<bool> *reuse_tracker)
: buf_(buf), size_(buf_len), reuse_tracker_(reuse_tracker) { : buf_(buf), size_(buf_len), reuse_tracker_(reuse_tracker) {
FLATBUFFERS_ASSERT(size_ < FLATBUFFERS_MAX_BUFFER_SIZE); FLATBUFFERS_ASSERT(size_ < FLATBUFFERS_MAX_BUFFER_SIZE);
if (reuse_tracker_) { if (reuse_tracker_) {
reuse_tracker_->clear(); reuse_tracker_->clear();
reuse_tracker_->resize(size_); reuse_tracker_->resize(size_, PackedType(BIT_WIDTH_8, FBT_NULL));
} }
} }
@@ -1697,23 +1694,28 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
off <= static_cast<uint64_t>(p - buf_); off <= static_cast<uint64_t>(p - buf_);
} }
bool CheckVerified(const uint8_t *p) { // Macro, since we want to escape from parent function & use lazy args.
if (!reuse_tracker_) return false; #define FLEX_CHECK_VERIFIED(P, PACKED_TYPE) \
if ((*reuse_tracker_)[p - buf_]) return true; if (reuse_tracker_) { \
(*reuse_tracker_)[p - buf_] = true; auto packed_type = PACKED_TYPE; \
return false; auto existing = (*reuse_tracker_)[P - buf_]; \
} if (existing == packed_type) return true; \
/* Fail verification if already set with different type! */ \
if (!Check(existing == 0)) return false; \
(*reuse_tracker_)[P - buf_] = packed_type; \
}
bool VerifyVector(const uint8_t *p, Type elem_type, uint8_t size_byte_width, bool VerifyVector(Reference r, const uint8_t *p, Type elem_type) {
uint8_t elem_byte_width) {
// Any kind of nesting goes thru this function, so guard against that // Any kind of nesting goes thru this function, so guard against that
// here. // here.
if (CheckVerified(p)) auto size_byte_width = r.byte_width_;
return true; FLEX_CHECK_VERIFIED(p, PackedType(Builder::WidthB(size_byte_width), r.type_));
if (!VerifyBeforePointer(p, size_byte_width)) if (!VerifyBeforePointer(p, size_byte_width))
return false; return false;
auto sized = Sized(p, size_byte_width); auto sized = Sized(p, size_byte_width);
auto num_elems = sized.size(); auto num_elems = sized.size();
auto elem_byte_width =
r.type_ == FBT_STRING || r.type_ == FBT_BLOB ? uint8_t(1) : r.byte_width_;
auto max_elems = SIZE_MAX / elem_byte_width; auto max_elems = SIZE_MAX / elem_byte_width;
if (!Check(num_elems < max_elems)) if (!Check(num_elems < max_elems))
return false; // Protect against byte_size overflowing. return false; // Protect against byte_size overflowing.
@@ -1749,17 +1751,19 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
static_cast<uint8_t>(ReadUInt64(p + byte_width, byte_width)); static_cast<uint8_t>(ReadUInt64(p + byte_width, byte_width));
if (!VerifyByteWidth(key_byte_with)) if (!VerifyByteWidth(key_byte_with))
return false; return false;
return VerifyVector(p - off, FBT_KEY, key_byte_with, key_byte_with); return VerifyVector(Reference(p, byte_width, key_byte_with, FBT_VECTOR_KEY),
p - off, FBT_KEY);
} }
bool VerifyKey(const uint8_t* p) { bool VerifyKey(const uint8_t* p) {
if (CheckVerified(p)) FLEX_CHECK_VERIFIED(p, PackedType(BIT_WIDTH_8, FBT_KEY));
return true;
while (p < buf_ + size_) while (p < buf_ + size_)
if (*p++) return true; if (*p++) return true;
return false; return false;
} }
#undef FLEX_CHECK_VERIFIED
bool VerifyTerminator(const String &s) { bool VerifyTerminator(const String &s) {
return VerifyFromPointer(reinterpret_cast<const uint8_t *>(s.c_str()), return VerifyFromPointer(reinterpret_cast<const uint8_t *>(s.c_str()),
s.size() + 1); s.size() + 1);
@@ -1787,26 +1791,26 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
case FBT_KEY: case FBT_KEY:
return VerifyKey(p); return VerifyKey(p);
case FBT_MAP: case FBT_MAP:
return VerifyVector(p, FBT_NULL, r.byte_width_, r.byte_width_) && return VerifyVector(r, p, FBT_NULL) &&
VerifyKeys(p, r.byte_width_); VerifyKeys(p, r.byte_width_);
case FBT_VECTOR: case FBT_VECTOR:
return VerifyVector(p, FBT_NULL, r.byte_width_, r.byte_width_); return VerifyVector(r, p, FBT_NULL);
case FBT_VECTOR_INT: case FBT_VECTOR_INT:
return VerifyVector(p, FBT_INT, r.byte_width_, r.byte_width_); return VerifyVector(r, p, FBT_INT);
case FBT_VECTOR_BOOL: case FBT_VECTOR_BOOL:
case FBT_VECTOR_UINT: case FBT_VECTOR_UINT:
return VerifyVector(p, FBT_UINT, r.byte_width_, r.byte_width_); return VerifyVector(r, p, FBT_UINT);
case FBT_VECTOR_FLOAT: case FBT_VECTOR_FLOAT:
return VerifyVector(p, FBT_FLOAT, r.byte_width_, r.byte_width_); return VerifyVector(r, p, FBT_FLOAT);
case FBT_VECTOR_KEY: case FBT_VECTOR_KEY:
return VerifyVector(p, FBT_KEY, r.byte_width_, r.byte_width_); return VerifyVector(r, p, FBT_KEY);
case FBT_VECTOR_STRING_DEPRECATED: case FBT_VECTOR_STRING_DEPRECATED:
// Use of FBT_KEY here intentional, see elsewhere. // Use of FBT_KEY here intentional, see elsewhere.
return VerifyVector(p, FBT_KEY, r.byte_width_, r.byte_width_); return VerifyVector(r, p, FBT_KEY);
case FBT_BLOB: case FBT_BLOB:
return VerifyVector(p, FBT_UINT, r.byte_width_, 1); return VerifyVector(r, p, FBT_UINT);
case FBT_STRING: case FBT_STRING:
return VerifyVector(p, FBT_UINT, r.byte_width_, 1) && return VerifyVector(r, p, FBT_UINT) &&
VerifyTerminator(String(p, r.byte_width_)); VerifyTerminator(String(p, r.byte_width_));
case FBT_VECTOR_INT2: case FBT_VECTOR_INT2:
case FBT_VECTOR_UINT2: case FBT_VECTOR_UINT2:
@@ -1842,11 +1846,12 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
private: private:
const uint8_t *buf_; const uint8_t *buf_;
size_t size_; size_t size_;
std::vector<bool> *reuse_tracker_; std::vector<uint8_t> *reuse_tracker_;
}; };
// Utility function that contructs the Verifier for you, see above for parameters. // Utility function that contructs the Verifier for you, see above for parameters.
inline bool VerifyBuffer(const uint8_t *buf, size_t buf_len, std::vector<bool> *reuse_tracker) { inline bool VerifyBuffer(const uint8_t *buf, size_t buf_len,
std::vector<uint8_t> *reuse_tracker = nullptr) {
Verifier verifier(buf, buf_len, reuse_tracker); Verifier verifier(buf, buf_len, reuse_tracker);
return verifier.VerifyBuffer(); return verifier.VerifyBuffer();
} }
@@ -1861,7 +1866,7 @@ inline bool VerifyNestedFlexBuffer(const flatbuffers::Vector<uint8_t> *nv,
if (!nv) return true; if (!nv) return true;
return verifier.Check( return verifier.Check(
flexbuffers::VerifyBuffer(nv->data(), nv->size(), flexbuffers::VerifyBuffer(nv->data(), nv->size(),
&verifier.GetReuseVector())); verifier.GetFlexReuseTracker()));
} }
#endif #endif

View File

@@ -35,7 +35,8 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
num_tables_(0), num_tables_(0),
max_tables_(_max_tables), max_tables_(_max_tables),
upper_bound_(0), upper_bound_(0),
check_alignment_(_check_alignment) { check_alignment_(_check_alignment),
flex_reuse_tracker_(nullptr) {
FLATBUFFERS_ASSERT(size_ < FLATBUFFERS_MAX_BUFFER_SIZE); FLATBUFFERS_ASSERT(size_ < FLATBUFFERS_MAX_BUFFER_SIZE);
} }
@@ -254,7 +255,13 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
// clang-format on // clang-format on
} }
std::vector<bool> &GetReuseVector() { return reuse_tracker_; } std::vector<uint8_t> *GetFlexReuseTracker() {
return flex_reuse_tracker_;
}
void SetFlexReuseTracker(std::vector<uint8_t> *rt) {
flex_reuse_tracker_ = rt;
}
private: private:
const uint8_t *buf_; const uint8_t *buf_;
@@ -265,9 +272,7 @@ class Verifier FLATBUFFERS_FINAL_CLASS {
uoffset_t max_tables_; uoffset_t max_tables_;
mutable size_t upper_bound_; mutable size_t upper_bound_;
bool check_alignment_; bool check_alignment_;
// This is here for nested FlexBuffers, cheap if not touched. std::vector<uint8_t> *flex_reuse_tracker_;
// TODO: allow user to supply memory for this.
std::vector<bool> reuse_tracker_;
}; };
} // namespace flatbuffers } // namespace flatbuffers

View File

@@ -618,7 +618,7 @@ int FlatCompiler::Compile(int argc, const char **argv) {
if (opts.lang_to_generate == IDLOptions::kJson) { if (opts.lang_to_generate == IDLOptions::kJson) {
auto data = reinterpret_cast<const uint8_t *>(contents.c_str()); auto data = reinterpret_cast<const uint8_t *>(contents.c_str());
auto size = contents.size(); auto size = contents.size();
std::vector<bool> reuse_tracker; std::vector<uint8_t> reuse_tracker;
if (!flexbuffers::VerifyBuffer(data, size, &reuse_tracker)) if (!flexbuffers::VerifyBuffer(data, size, &reuse_tracker))
Error("flexbuffers file failed to verify: " + filename, false); Error("flexbuffers file failed to verify: " + filename, false);
parser->flex_root_ = flexbuffers::GetRoot(data, size); parser->flex_root_ = flexbuffers::GetRoot(data, size);

View File

@@ -233,6 +233,8 @@ void AccessFlatBufferTest(const uint8_t *flatbuf, size_t length,
bool pooled = true) { bool pooled = true) {
// First, verify the buffers integrity (optional) // First, verify the buffers integrity (optional)
flatbuffers::Verifier verifier(flatbuf, length); flatbuffers::Verifier verifier(flatbuf, length);
std::vector<uint8_t> flex_reuse_tracker;
verifier.SetFlexReuseTracker(&flex_reuse_tracker);
TEST_EQ(VerifyMonsterBuffer(verifier), true); TEST_EQ(VerifyMonsterBuffer(verifier), true);
// clang-format off // clang-format off
@@ -3022,7 +3024,7 @@ void FlexBuffersTest() {
#endif #endif
// clang-format on // clang-format on
std::vector<bool> reuse_tracker; std::vector<uint8_t> reuse_tracker;
TEST_EQ(flexbuffers::VerifyBuffer(slb.GetBuffer().data(), slb.GetBuffer().size(), TEST_EQ(flexbuffers::VerifyBuffer(slb.GetBuffer().data(), slb.GetBuffer().size(),
&reuse_tracker), true); &reuse_tracker), true);