/* * Copyright 2015 Google Inc. All rights reserved. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #ifndef FLATBUFFERS_REFLECTION_H_ #define FLATBUFFERS_REFLECTION_H_ #include "flatbuffers/util.h" // This is somewhat of a circular dependency because flatc (and thus this // file) is needed to generate this header in the first place. // Should normally not be a problem since it can be generated by the // previous version of flatc whenever this code needs to change. // See reflection/generate_code.sh #include "flatbuffers/reflection_generated.h" // Helper functionality for reflection. namespace flatbuffers { inline size_t GetTypeSize(reflection::BaseType base_type) { // This needs to correspond to the BaseType enum. static size_t sizes[] = { 0, 1, 1, 1, 1, 2, 2, 4, 4, 8, 8, 4, 8, 4, 4, 4, 4 }; return sizes[base_type]; } // Get the root, regardless of what type it is. inline Table *GetAnyRoot(uint8_t *flatbuf) { return GetMutableRoot(flatbuf); } inline const Table *GetAnyRoot(const uint8_t *flatbuf) { return GetRoot
(flatbuf); } // Get a field, if you know it's an integer, and its exact type. template T GetFieldI(const Table &table, const reflection::Field &field) { assert(sizeof(T) == GetTypeSize(field.type()->base_type())); return table.GetField(field.offset(), static_cast(field.default_integer())); } // Get a field, if you know it's floating point and its exact type. template T GetFieldF(const Table &table, const reflection::Field &field) { assert(sizeof(T) == GetTypeSize(field.type()->base_type())); return table.GetField(field.offset(), static_cast(field.default_real())); } // Get a field, if you know it's a string. inline const String *GetFieldS(const Table &table, const reflection::Field &field) { assert(field.type()->base_type() == reflection::String); return table.GetPointer(field.offset()); } // Get a field, if you know it's a vector. template const Vector *GetFieldV(const Table &table, const reflection::Field &field) { assert(field.type()->base_type() == reflection::Vector && sizeof(T) == GetTypeSize(field.type()->element())); return table.GetPointer *>(field.offset()); } // Get a field, if you know it's a table. inline const Table *GetFieldT(const Table &table, const reflection::Field &field) { assert(field.type()->base_type() == reflection::Obj || field.type()->base_type() == reflection::Union); return table.GetPointer(field.offset()); } // Get any field as a 64bit int, regardless of what it is (bool/int/float/str). inline int64_t GetAnyFieldI(const Table &table, const reflection::Field &field) { # define FLATBUFFERS_GET(C, T) \ static_cast(GetField##C(table, field)) switch (field.type()->base_type()) { case reflection::UType: case reflection::Bool: case reflection::UByte: return FLATBUFFERS_GET(I, uint8_t); case reflection::Byte: return FLATBUFFERS_GET(I, int8_t); case reflection::Short: return FLATBUFFERS_GET(I, int16_t); case reflection::UShort: return FLATBUFFERS_GET(I, uint16_t); case reflection::Int: return FLATBUFFERS_GET(I, int32_t); case reflection::UInt: return FLATBUFFERS_GET(I, uint32_t); case reflection::Long: return FLATBUFFERS_GET(I, int64_t); case reflection::ULong: return FLATBUFFERS_GET(I, uint64_t); case reflection::Float: return FLATBUFFERS_GET(F, float); case reflection::Double: return FLATBUFFERS_GET(F, double); case reflection::String: { auto s = GetFieldS(table, field); return s ? StringToInt(s->c_str()) : 0; } default: return 0; } # undef FLATBUFFERS_GET } // Get any field as a double, regardless of what it is (bool/int/float/str). inline double GetAnyFieldF(const Table &table, const reflection::Field &field) { switch (field.type()->base_type()) { case reflection::Float: return GetFieldF(table, field); case reflection::Double: return GetFieldF(table, field); case reflection::String: { auto s = GetFieldS(table, field); return s ? strtod(s->c_str(), nullptr) : 0.0; } default: return static_cast(GetAnyFieldI(table, field)); } } // Get any field as a string, regardless of what it is (bool/int/float/str). inline std::string GetAnyFieldS(const Table &table, const reflection::Field &field, const reflection::Schema &schema) { switch (field.type()->base_type()) { case reflection::Float: case reflection::Double: return NumToString(GetAnyFieldF(table, field)); case reflection::String: { auto s = GetFieldS(table, field); return s ? s->c_str() : ""; } case reflection::Obj: { // Convert the table to a string. This is mostly for debugging purposes, // and does NOT promise to be JSON compliant. // Also prefixes the type. auto &objectdef = *schema.objects()->Get(field.type()->index()); auto s = objectdef.name()->str(); if (objectdef.is_struct()) { s += "(struct)"; // TODO: implement this as well. } else { auto table_field = GetFieldT(table, field); s += " { "; auto fielddefs = objectdef.fields(); for (auto it = fielddefs->begin(); it != fielddefs->end(); ++it) { auto &fielddef = **it; if (!table.CheckField(fielddef.offset())) continue; auto val = GetAnyFieldS(*table_field, fielddef, schema); if (fielddef.type()->base_type() == reflection::String) val = "\"" + val + "\""; // Doesn't deal with escape codes etc. s += fielddef.name()->str(); s += ": "; s += val; s += ", "; } s += "}"; } return s; } case reflection::Vector: return "[(elements)]"; // TODO: implement this as well. case reflection::Union: return "(union)"; // TODO: implement this as well. default: return NumToString(GetAnyFieldI(table, field)); } } // Set any scalar field, if you know its exact type. template bool SetField(Table *table, const reflection::Field &field, T val) { assert(sizeof(T) == GetTypeSize(field.type()->base_type())); return table->SetField(field.offset(), val); } // Set any field as a 64bit int, regardless of what it is (bool/int/float/str). inline void SetAnyFieldI(Table *table, const reflection::Field &field, int64_t val) { # define FLATBUFFERS_SET(T) SetField(table, field, static_cast(val)) switch (field.type()->base_type()) { case reflection::UType: case reflection::Bool: case reflection::UByte: FLATBUFFERS_SET(uint8_t ); break; case reflection::Byte: FLATBUFFERS_SET(int8_t ); break; case reflection::Short: FLATBUFFERS_SET(int16_t ); break; case reflection::UShort: FLATBUFFERS_SET(uint16_t ); break; case reflection::Int: FLATBUFFERS_SET(int32_t ); break; case reflection::UInt: FLATBUFFERS_SET(uint32_t ); break; case reflection::Long: FLATBUFFERS_SET(int64_t ); break; case reflection::ULong: FLATBUFFERS_SET(uint64_t ); break; case reflection::Float: FLATBUFFERS_SET(float ); break; case reflection::Double: FLATBUFFERS_SET(double ); break; // TODO: support strings default: break; } # undef FLATBUFFERS_SET } // Set any field as a double, regardless of what it is (bool/int/float/str). inline void SetAnyFieldF(Table *table, const reflection::Field &field, double val) { switch (field.type()->base_type()) { case reflection::Float: SetField (table, field, static_cast(val)); break; case reflection::Double: SetField(table, field, val); break; // TODO: support strings. default: SetAnyFieldI(table, field, static_cast(val)); break; } } // Set any field as a string, regardless of what it is (bool/int/float/str). inline void SetAnyFieldS(Table *table, const reflection::Field &field, const char *val) { switch (field.type()->base_type()) { case reflection::Float: case reflection::Double: SetAnyFieldF(table, field, strtod(val, nullptr)); // TODO: support strings. default: SetAnyFieldI(table, field, StringToInt(val)); break; } } // "smart" pointer for use with resizing vectors: turns a pointer inside // a vector into a relative offset, such that it is not affected by resizes. template class pointer_inside_vector { public: pointer_inside_vector(const T *ptr, const std::vector &vec) : offset_(reinterpret_cast(ptr) - reinterpret_cast(vec.data())), vec_(vec) {} const T *operator*() const { return reinterpret_cast( reinterpret_cast(vec_.data()) + offset_); } const T *operator->() const { return operator*(); } void operator=(const pointer_inside_vector &piv); private: size_t offset_; const std::vector &vec_; }; // Helper to create the above easily without specifying template args. template pointer_inside_vector piv( const T *ptr, const std::vector &vec) { return pointer_inside_vector(ptr, vec); } // Helper to figure out the actual table type a union refers to. inline const reflection::Object &GetUnionType( const reflection::Schema &schema, const reflection::Object &parent, const reflection::Field &unionfield, const Table &table) { auto enumdef = schema.enums()->Get(unionfield.type()->index()); // TODO: this is clumsy and slow, but no other way to find it? auto type_field = parent.fields()->LookupByKey( (unionfield.name()->str() + "_type").c_str()); assert(type_field); auto union_type = GetFieldI(table, *type_field); auto enumval = enumdef->values()->LookupByKey(union_type); return *enumval->object(); } // Resize a FlatBuffer in-place by iterating through all offsets in the buffer // and adjusting them by "delta" if they straddle the start offset. // Once that is done, bytes can now be inserted/deleted safely. // "delta" may be negative (shrinking). // Unless "delta" is a multiple of the largest alignment, you'll create a small // amount of garbage space in the buffer (usually 0..7 bytes). class ResizeContext { public: ResizeContext(const reflection::Schema &schema, uoffset_t start, int delta, std::vector *flatbuf) : schema_(schema), startptr_(flatbuf->data() + start), delta_(delta), buf_(*flatbuf), dag_check_(flatbuf->size() / sizeof(uoffset_t), false) { auto mask = static_cast(sizeof(largest_scalar_t) - 1); delta_ = (delta_ + mask) & ~mask; if (!delta_) return; // We can't shrink by less than largest_scalar_t. // Now change all the offsets by delta_. auto root = GetAnyRoot(buf_.data()); Straddle(buf_.data(), root, buf_.data()); ResizeTable(*schema.root_table(), root); // We can now add or remove bytes at start. if (delta_ > 0) buf_.insert(buf_.begin() + start, delta_, 0); else buf_.erase(buf_.begin() + start, buf_.begin() + start - delta_); } // Check if the range between first (lower address) and second straddles // the insertion point. If it does, change the offset at offsetloc (of // type T, with direction D). template void Straddle(void *first, void *second, void *offsetloc) { if (first <= startptr_ && second >= startptr_) { WriteScalar(offsetloc, ReadScalar(offsetloc) + delta_ * D); DagCheck(offsetloc) = true; } } // This returns a boolean that records if the corresponding offset location // has been modified already. If so, we can't even read the corresponding // offset, since it is pointing to a location that is illegal until the // resize actually happens. // This must be checked for every offset, since we can't know which offsets // will straddle and which won't. uint8_t &DagCheck(void *offsetloc) { auto dag_idx = reinterpret_cast(offsetloc) - reinterpret_cast(buf_.data()); return dag_check_[dag_idx]; } void ResizeTable(const reflection::Object &objectdef, Table *table) { if (DagCheck(table)) return; // Table already visited. auto vtable = table->GetVTable(); // Check if the vtable offset points beyond the insertion point. Straddle(table, vtable, table); // This direction shouldn't happen because vtables that sit before tables // are always directly adjacent, but check just in case we ever change the // way flatbuffers are built. Straddle(vtable, table, table); // Early out: since all fields inside the table must point forwards in // memory, if the insertion point is before the table we can stop here. auto tableloc = reinterpret_cast(table); if (startptr_ <= tableloc) return; // Check each field. auto fielddefs = objectdef.fields(); for (auto it = fielddefs->begin(); it != fielddefs->end(); ++it) { auto &fielddef = **it; auto base_type = fielddef.type()->base_type(); // Ignore scalars. if (base_type <= reflection::Double) continue; // Ignore fields that are not stored. auto offset = table->GetOptionalFieldOffset(fielddef.offset()); if (!offset) continue; // Ignore structs. auto subobjectdef = base_type == reflection::Obj ? schema_.objects()->Get(fielddef.type()->index()) : nullptr; if (subobjectdef && subobjectdef->is_struct()) continue; // Get this fields' offset, and read it if safe. auto offsetloc = tableloc + offset; if (DagCheck(offsetloc)) continue; // This offset already visited. auto ref = offsetloc + ReadScalar(offsetloc); Straddle(offsetloc, ref, offsetloc); // Recurse. switch (base_type) { case reflection::Obj: { ResizeTable(*subobjectdef, reinterpret_cast
(ref)); break; } case reflection::Vector: { if (fielddef.type()->element() != reflection::Obj) break; auto vec = reinterpret_cast *>(ref); auto elemobjectdef = schema_.objects()->Get(fielddef.type()->index()); if (elemobjectdef->is_struct()) break; for (uoffset_t i = 0; i < vec->size(); i++) { auto loc = vec->Data() + i * sizeof(uoffset_t); if (DagCheck(loc)) continue; // This offset already visited. auto dest = loc + vec->Get(i); Straddle(loc, dest ,loc); ResizeTable(*elemobjectdef, reinterpret_cast
(dest)); } break; } case reflection::Union: { ResizeTable(GetUnionType(schema_, objectdef, fielddef, *table), reinterpret_cast
(ref)); break; } case reflection::String: break; default: assert(false); } } } void operator=(const ResizeContext &rc); private: const reflection::Schema &schema_; uint8_t *startptr_; int delta_; std::vector &buf_; std::vector dag_check_; }; // Changes the contents of a string inside a FlatBuffer. FlatBuffer must // live inside a std::vector so we can resize the buffer if needed. // "str" must live inside "flatbuf" and may be invalidated after this call. inline void SetString(const reflection::Schema &schema, const std::string &val, const String *str, std::vector *flatbuf) { auto delta = static_cast(val.size()) - static_cast(str->Length()); auto start = static_cast(reinterpret_cast(str) - flatbuf->data() + sizeof(uoffset_t)); if (delta) { // Different size, we must expand (or contract). ResizeContext(schema, start, delta, flatbuf); if (delta < 0) { // Clear the old string, since we don't want parts of it remaining. memset(flatbuf->data() + start, 0, str->Length()); } } // Copy new data. Safe because we created the right amount of space. memcpy(flatbuf->data() + start, val.c_str(), val.size() + 1); } // Resizes a flatbuffers::Vector inside a FlatBuffer. FlatBuffer must // live inside a std::vector so we can resize the buffer if needed. // "vec" must live inside "flatbuf" and may be invalidated after this call. template void ResizeVector(const reflection::Schema &schema, uoffset_t newsize, T val, const Vector *vec, std::vector *flatbuf) { auto delta_elem = static_cast(newsize) - static_cast(vec->size()); auto delta_bytes = delta_elem * static_cast(sizeof(T)); auto vec_start = reinterpret_cast(vec) - flatbuf->data(); auto start = static_cast(vec_start + sizeof(uoffset_t) + sizeof(T) * vec->size()); if (delta_bytes) { ResizeContext(schema, start, delta_bytes, flatbuf); WriteScalar(flatbuf->data() + vec_start, newsize); // Length field. // Set new elements to "val". for (int i = 0; i < delta_elem; i++) { auto loc = flatbuf->data() + start + i * sizeof(T); auto is_scalar = std::is_scalar::value; if (is_scalar) { WriteScalar(loc, val); } else { // struct *reinterpret_cast(loc) = val; } } } } // Generic copying of tables from a FlatBuffer into a FlatBuffer builder. // Can be used to do any kind of merging/selecting you may want to do out // of existing buffers. Also useful to reconstruct a whole buffer if the // above resizing functionality has introduced garbage in a buffer you want // to remove. // Note: this does not deal with DAGs correctly. If the table passed forms a // DAG, the copy will be a tree instead (with duplicates). inline void CopyInline(FlatBufferBuilder &fbb, const reflection::Field &fielddef, const Table &table, size_t align, size_t size) { fbb.Align(align); fbb.PushBytes(table.GetStruct(fielddef.offset()), size); fbb.TrackField(fielddef.offset(), fbb.GetSize()); } inline Offset CopyTable(FlatBufferBuilder &fbb, const reflection::Schema &schema, const reflection::Object &objectdef, const Table &table) { // Before we can construct the table, we have to first generate any // subobjects, and collect their offsets. std::vector offsets; auto fielddefs = objectdef.fields(); for (auto it = fielddefs->begin(); it != fielddefs->end(); ++it) { auto &fielddef = **it; // Skip if field is not present in the source. if (!table.CheckField(fielddef.offset())) continue; uoffset_t offset = 0; switch (fielddef.type()->base_type()) { case reflection::String: { offset = fbb.CreateString(GetFieldS(table, fielddef)).o; break; } case reflection::Obj: { auto &subobjectdef = *schema.objects()->Get(fielddef.type()->index()); if (!subobjectdef.is_struct()) { offset = CopyTable(fbb, schema, subobjectdef, *GetFieldT(table, fielddef)).o; } break; } case reflection::Union: { auto &subobjectdef = GetUnionType(schema, objectdef, fielddef, table); offset = CopyTable(fbb, schema, subobjectdef, *GetFieldT(table, fielddef)).o; break; } case reflection::Vector: { auto vec = table.GetPointer> *>( fielddef.offset()); auto element_base_type = fielddef.type()->element(); auto elemobjectdef = element_base_type == reflection::Obj ? schema.objects()->Get(fielddef.type()->index()) : nullptr; switch (element_base_type) { case reflection::String: { std::vector> elements(vec->size()); auto vec_s = reinterpret_cast> *>(vec); for (uoffset_t i = 0; i < vec_s->size(); i++) { elements[i] = fbb.CreateString(vec_s->Get(i)).o; } offset = fbb.CreateVector(elements).o; break; } case reflection::Obj: { if (!elemobjectdef->is_struct()) { std::vector> elements(vec->size()); for (uoffset_t i = 0; i < vec->size(); i++) { elements[i] = CopyTable(fbb, schema, *elemobjectdef, *vec->Get(i)); } offset = fbb.CreateVector(elements).o; break; } // FALL-THRU: } default: { // Scalars and structs. auto element_size = GetTypeSize(element_base_type); if (elemobjectdef && elemobjectdef->is_struct()) element_size = elemobjectdef->bytesize(); fbb.StartVector(element_size, vec->size()); fbb.PushBytes(vec->Data(), element_size * vec->size()); offset = fbb.EndVector(vec->size()); break; } } break; } default: // Scalars. break; } if (offset) { offsets.push_back(offset); } } // Now we can build the actual table from either offsets or scalar data. auto start = objectdef.is_struct() ? fbb.StartStruct(objectdef.minalign()) : fbb.StartTable(); size_t offset_idx = 0; for (auto it = fielddefs->begin(); it != fielddefs->end(); ++it) { auto &fielddef = **it; if (!table.CheckField(fielddef.offset())) continue; auto base_type = fielddef.type()->base_type(); switch (base_type) { case reflection::Obj: { auto &subobjectdef = *schema.objects()->Get(fielddef.type()->index()); if (subobjectdef.is_struct()) { CopyInline(fbb, fielddef, table, subobjectdef.minalign(), subobjectdef.bytesize()); break; } // else: FALL-THRU: } case reflection::Union: case reflection::String: case reflection::Vector: fbb.AddOffset(fielddef.offset(), Offset(offsets[offset_idx++])); break; default: { // Scalars. auto size = GetTypeSize(base_type); CopyInline(fbb, fielddef, table, size, size); break; } } } assert(offset_idx == offsets.size()); if (objectdef.is_struct()) { fbb.ClearOffsets(); return fbb.EndStruct(); } else { return fbb.EndTable(start, static_cast(fielddefs->size())); } } } // namespace flatbuffers #endif // FLATBUFFERS_REFLECTION_H_