Protocol Buffers - Google's data interchange format (grpc依赖) https://developers.google.com/protocol-buffers/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

214 lines
7.3 KiB

/*
* Copyright (c) 2009-2022, Google LLC
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google LLC nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 Google LLC 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 "upb/test/fuzz_util.h"
#include "upb/message/message.h"
#include "upb/mini_table/decode.h"
#include "upb/mini_table/extension_internal.h"
#include "upb/mini_table/extension_registry.h"
#include "upb/upb.hpp"
namespace upb {
namespace fuzz {
namespace {
class Builder {
public:
Builder(const MiniTableFuzzInput& input, upb_Arena* arena)
: input_(&input), arena_(arena) {}
const upb_MiniTable* Build(upb_ExtensionRegistry** exts) {
BuildMessages();
BuildEnums();
BuildExtensions(exts);
if (!LinkMessages()) return nullptr;
return mini_tables_.empty() ? nullptr : mini_tables_.front();
}
private:
void BuildMessages();
void BuildEnums();
void BuildExtensions(upb_ExtensionRegistry** exts);
bool LinkExtension(upb_MiniTableExtension* ext);
bool LinkMessages();
size_t NextLink() {
if (input_->links.empty()) return 0;
if (link_ == input_->links.size()) link_ = 0;
return input_->links[link_++];
}
const upb_MiniTable* NextNonMapEntryMiniTable() {
if (mini_tables_.empty()) return nullptr;
size_t start = NextLink() % mini_tables_.size();
size_t next = start;
do {
const upb_MiniTable* mini_table = mini_tables_[next];
if ((mini_table->ext & kUpb_ExtMode_IsMapEntry) == 0) {
return mini_table;
}
next = NextLink() % mini_tables_.size();
} while (next != start);
return nullptr;
}
const upb_MiniTable* NextMiniTable() {
return mini_tables_.empty()
? nullptr
: mini_tables_[NextLink() % mini_tables_.size()];
}
const upb_MiniTableEnum* NextEnumTable() {
return enum_tables_.empty()
? nullptr
: enum_tables_[NextLink() % enum_tables_.size()];
}
const MiniTableFuzzInput* input_;
upb_Arena* arena_;
std::vector<const upb_MiniTable*> mini_tables_;
std::vector<const upb_MiniTableEnum*> enum_tables_;
size_t link_ = 0;
};
void Builder::BuildMessages() {
upb::Status status;
mini_tables_.reserve(input_->mini_descriptors.size());
for (const auto& d : input_->mini_descriptors) {
upb_MiniTable* table =
upb_MiniTable_Build(d.data(), d.size(), arena_, status.ptr());
if (table) mini_tables_.push_back(table);
}
}
void Builder::BuildEnums() {
upb::Status status;
enum_tables_.reserve(input_->enum_mini_descriptors.size());
for (const auto& d : input_->enum_mini_descriptors) {
upb_MiniTableEnum* enum_table =
upb_MiniTableEnum_Build(d.data(), d.size(), arena_, status.ptr());
if (enum_table) enum_tables_.push_back(enum_table);
}
}
bool Builder::LinkExtension(upb_MiniTableExtension* ext) {
upb_MiniTableField* field = &ext->field;
if (field->descriptortype == kUpb_FieldType_Message ||
field->descriptortype == kUpb_FieldType_Group) {
auto mt = NextMiniTable();
if (!mt) field->descriptortype = kUpb_FieldType_Int32;
ext->sub.submsg = mt;
}
if (field->descriptortype == kUpb_FieldType_Enum) {
auto et = NextEnumTable();
if (!et) field->descriptortype = kUpb_FieldType_Int32;
ext->sub.subenum = et;
}
return true;
}
void Builder::BuildExtensions(upb_ExtensionRegistry** exts) {
upb::Status status;
if (input_->extensions.empty()) {
*exts = nullptr;
} else {
*exts = upb_ExtensionRegistry_New(arena_);
const char* ptr = input_->extensions.data();
const char* end = ptr + input_->extensions.size();
// Iterate through the buffer, building extensions as long as we can.
while (ptr < end) {
upb_MiniTableExtension* ext = reinterpret_cast<upb_MiniTableExtension*>(
upb_Arena_Malloc(arena_, sizeof(*ext)));
upb_MiniTableSub sub;
const upb_MiniTable* extendee = NextMiniTable();
if (!extendee) break;
ptr = upb_MiniTableExtension_Build(ptr, end - ptr, ext, extendee, sub,
status.ptr());
if (!ptr) break;
if (!LinkExtension(ext)) continue;
if (upb_ExtensionRegistry_Lookup(*exts, ext->extendee, ext->field.number))
continue;
upb_ExtensionRegistry_AddArray(
*exts, const_cast<const upb_MiniTableExtension**>(&ext), 1);
}
}
}
bool Builder::LinkMessages() {
for (auto* t : mini_tables_) {
upb_MiniTable* table = const_cast<upb_MiniTable*>(t);
// For each field that requires a sub-table, assign one as appropriate.
for (size_t i = 0; i < table->field_count; i++) {
upb_MiniTableField* field =
const_cast<upb_MiniTableField*>(&table->fields[i]);
if (link_ == input_->links.size()) link_ = 0;
switch (field->descriptortype) {
case kUpb_FieldType_Message: {
const upb_MiniTable* sub = NextMiniTable();
// We should always have at least one message.
assert(sub);
if (!upb_MiniTable_SetSubMessage(table, field, sub)) return false;
break;
}
case kUpb_FieldType_Group: {
const upb_MiniTable* sub = NextNonMapEntryMiniTable();
// sub will be nullptr if no non-map entry messages are available.
if (sub) {
if (!upb_MiniTable_SetSubMessage(table, field, sub)) return false;
}
break;
}
case kUpb_FieldType_Enum: {
auto* et = NextEnumTable();
if (et) {
if (!upb_MiniTable_SetSubEnum(table, field, et)) return false;
} else {
// We don't have any sub-enums. Override the field type so that it
// is not needed.
field->descriptortype = kUpb_FieldType_Int32;
}
}
}
}
}
return true;
}
} // namespace
const upb_MiniTable* BuildMiniTable(const MiniTableFuzzInput& input,
upb_ExtensionRegistry** exts,
upb_Arena* arena) {
Builder builder(input, arena);
return builder.Build(exts);
}
} // namespace fuzz
} // namespace upb