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.
896 lines
33 KiB
896 lines
33 KiB
// Protocol Buffers - Google's data interchange format |
|
// Copyright 2023 Google LLC. All rights reserved. |
|
// |
|
// Use of this source code is governed by a BSD-style |
|
// license that can be found in the LICENSE file or at |
|
// https://developers.google.com/open-source/licenses/bsd |
|
|
|
#include "upb/mini_descriptor/decode.h" |
|
|
|
#include <inttypes.h> |
|
#include <stddef.h> |
|
#include <stdint.h> |
|
#include <stdlib.h> |
|
|
|
#include "upb/base/descriptor_constants.h" |
|
#include "upb/base/internal/log2.h" |
|
#include "upb/base/status.h" |
|
#include "upb/base/string_view.h" |
|
#include "upb/mem/arena.h" |
|
#include "upb/message/internal/map_entry.h" |
|
#include "upb/message/internal/types.h" |
|
#include "upb/mini_descriptor/internal/base92.h" |
|
#include "upb/mini_descriptor/internal/decoder.h" |
|
#include "upb/mini_descriptor/internal/modifiers.h" |
|
#include "upb/mini_descriptor/internal/wire_constants.h" |
|
#include "upb/mini_table/extension.h" |
|
#include "upb/mini_table/field.h" |
|
#include "upb/mini_table/internal/field.h" |
|
#include "upb/mini_table/internal/message.h" |
|
#include "upb/mini_table/message.h" |
|
#include "upb/mini_table/sub.h" |
|
|
|
// Must be last. |
|
#include "upb/port/def.inc" |
|
|
|
// We reserve unused hasbits to make room for upb_Message fields. |
|
#define kUpb_Reserved_Hasbytes sizeof(struct upb_Message) |
|
|
|
// 64 is the first hasbit that we currently use. |
|
#define kUpb_Reserved_Hasbits (kUpb_Reserved_Hasbytes * 8) |
|
|
|
// Note: we sort by this number when calculating layout order. |
|
typedef enum { |
|
kUpb_LayoutItemType_OneofCase, // Oneof case. |
|
kUpb_LayoutItemType_OneofField, // Oneof field data. |
|
kUpb_LayoutItemType_Field, // Non-oneof field data. |
|
|
|
kUpb_LayoutItemType_Max = kUpb_LayoutItemType_Field, |
|
} upb_LayoutItemType; |
|
|
|
#define kUpb_LayoutItem_IndexSentinel ((uint16_t)-1) |
|
|
|
typedef struct { |
|
// Index of the corresponding field. When this is a oneof field, the field's |
|
// offset will be the index of the next field in a linked list. |
|
uint16_t field_index; |
|
uint16_t offset; |
|
upb_FieldRep rep; |
|
upb_LayoutItemType type; |
|
} upb_LayoutItem; |
|
|
|
typedef struct { |
|
upb_LayoutItem* data; |
|
size_t size; |
|
size_t capacity; |
|
} upb_LayoutItemVector; |
|
|
|
typedef struct { |
|
upb_MdDecoder base; |
|
upb_MiniTable* table; |
|
upb_MiniTableField* fields; |
|
upb_MiniTablePlatform platform; |
|
upb_LayoutItemVector vec; |
|
upb_Arena* arena; |
|
} upb_MtDecoder; |
|
|
|
// In each field's offset, we temporarily store a presence classifier: |
|
enum PresenceClass { |
|
kNoPresence = 0, |
|
kHasbitPresence = 1, |
|
kRequiredPresence = 2, |
|
kOneofBase = 3, |
|
// Negative values refer to a specific oneof with that number. Positive |
|
// values >= kOneofBase indicate that this field is in a oneof, and specify |
|
// the next field in this oneof's linked list. |
|
}; |
|
|
|
static bool upb_MtDecoder_FieldIsPackable(upb_MiniTableField* field) { |
|
return (field->UPB_PRIVATE(mode) & kUpb_FieldMode_Array) && |
|
upb_FieldType_IsPackable(field->UPB_PRIVATE(descriptortype)); |
|
} |
|
|
|
typedef struct { |
|
uint16_t submsg_count; |
|
uint16_t subenum_count; |
|
} upb_SubCounts; |
|
|
|
static void upb_MiniTable_SetTypeAndSub(upb_MiniTableField* field, |
|
upb_FieldType type, |
|
upb_SubCounts* sub_counts, |
|
uint64_t msg_modifiers, |
|
bool is_proto3_enum) { |
|
if (is_proto3_enum) { |
|
UPB_ASSERT(type == kUpb_FieldType_Enum); |
|
type = kUpb_FieldType_Int32; |
|
field->UPB_PRIVATE(mode) |= kUpb_LabelFlags_IsAlternate; |
|
} else if (type == kUpb_FieldType_String && |
|
!(msg_modifiers & kUpb_MessageModifier_ValidateUtf8)) { |
|
type = kUpb_FieldType_Bytes; |
|
field->UPB_PRIVATE(mode) |= kUpb_LabelFlags_IsAlternate; |
|
} |
|
|
|
field->UPB_PRIVATE(descriptortype) = type; |
|
|
|
if (upb_MtDecoder_FieldIsPackable(field) && |
|
(msg_modifiers & kUpb_MessageModifier_DefaultIsPacked)) { |
|
field->UPB_PRIVATE(mode) |= kUpb_LabelFlags_IsPacked; |
|
} |
|
|
|
if (type == kUpb_FieldType_Message || type == kUpb_FieldType_Group) { |
|
field->UPB_PRIVATE(submsg_index) = sub_counts->submsg_count++; |
|
} else if (type == kUpb_FieldType_Enum) { |
|
// We will need to update this later once we know the total number of |
|
// submsg fields. |
|
field->UPB_PRIVATE(submsg_index) = sub_counts->subenum_count++; |
|
} else { |
|
field->UPB_PRIVATE(submsg_index) = kUpb_NoSub; |
|
} |
|
} |
|
|
|
static const char kUpb_EncodedToType[] = { |
|
[kUpb_EncodedType_Double] = kUpb_FieldType_Double, |
|
[kUpb_EncodedType_Float] = kUpb_FieldType_Float, |
|
[kUpb_EncodedType_Int64] = kUpb_FieldType_Int64, |
|
[kUpb_EncodedType_UInt64] = kUpb_FieldType_UInt64, |
|
[kUpb_EncodedType_Int32] = kUpb_FieldType_Int32, |
|
[kUpb_EncodedType_Fixed64] = kUpb_FieldType_Fixed64, |
|
[kUpb_EncodedType_Fixed32] = kUpb_FieldType_Fixed32, |
|
[kUpb_EncodedType_Bool] = kUpb_FieldType_Bool, |
|
[kUpb_EncodedType_String] = kUpb_FieldType_String, |
|
[kUpb_EncodedType_Group] = kUpb_FieldType_Group, |
|
[kUpb_EncodedType_Message] = kUpb_FieldType_Message, |
|
[kUpb_EncodedType_Bytes] = kUpb_FieldType_Bytes, |
|
[kUpb_EncodedType_UInt32] = kUpb_FieldType_UInt32, |
|
[kUpb_EncodedType_OpenEnum] = kUpb_FieldType_Enum, |
|
[kUpb_EncodedType_SFixed32] = kUpb_FieldType_SFixed32, |
|
[kUpb_EncodedType_SFixed64] = kUpb_FieldType_SFixed64, |
|
[kUpb_EncodedType_SInt32] = kUpb_FieldType_SInt32, |
|
[kUpb_EncodedType_SInt64] = kUpb_FieldType_SInt64, |
|
[kUpb_EncodedType_ClosedEnum] = kUpb_FieldType_Enum, |
|
}; |
|
|
|
static void upb_MiniTable_SetField(upb_MtDecoder* d, uint8_t ch, |
|
upb_MiniTableField* field, |
|
uint64_t msg_modifiers, |
|
upb_SubCounts* sub_counts) { |
|
static const char kUpb_EncodedToFieldRep[] = { |
|
[kUpb_EncodedType_Double] = kUpb_FieldRep_8Byte, |
|
[kUpb_EncodedType_Float] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_Int64] = kUpb_FieldRep_8Byte, |
|
[kUpb_EncodedType_UInt64] = kUpb_FieldRep_8Byte, |
|
[kUpb_EncodedType_Int32] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_Fixed64] = kUpb_FieldRep_8Byte, |
|
[kUpb_EncodedType_Fixed32] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_Bool] = kUpb_FieldRep_1Byte, |
|
[kUpb_EncodedType_String] = kUpb_FieldRep_StringView, |
|
[kUpb_EncodedType_Bytes] = kUpb_FieldRep_StringView, |
|
[kUpb_EncodedType_UInt32] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_OpenEnum] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_SFixed32] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_SFixed64] = kUpb_FieldRep_8Byte, |
|
[kUpb_EncodedType_SInt32] = kUpb_FieldRep_4Byte, |
|
[kUpb_EncodedType_SInt64] = kUpb_FieldRep_8Byte, |
|
[kUpb_EncodedType_ClosedEnum] = kUpb_FieldRep_4Byte, |
|
}; |
|
|
|
char pointer_rep = d->platform == kUpb_MiniTablePlatform_32Bit |
|
? kUpb_FieldRep_4Byte |
|
: kUpb_FieldRep_8Byte; |
|
|
|
int8_t type = _upb_FromBase92(ch); |
|
if (ch >= _upb_ToBase92(kUpb_EncodedType_RepeatedBase)) { |
|
type -= kUpb_EncodedType_RepeatedBase; |
|
field->UPB_PRIVATE(mode) = kUpb_FieldMode_Array; |
|
field->UPB_PRIVATE(mode) |= pointer_rep << kUpb_FieldRep_Shift; |
|
field->UPB_PRIVATE(offset) = kNoPresence; |
|
} else { |
|
field->UPB_PRIVATE(mode) = kUpb_FieldMode_Scalar; |
|
field->UPB_PRIVATE(offset) = kHasbitPresence; |
|
if (type == kUpb_EncodedType_Group || type == kUpb_EncodedType_Message) { |
|
field->UPB_PRIVATE(mode) |= pointer_rep << kUpb_FieldRep_Shift; |
|
} else if ((unsigned long)type >= sizeof(kUpb_EncodedToFieldRep)) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Invalid field type: %d", (int)type); |
|
} else { |
|
field->UPB_PRIVATE(mode) |= kUpb_EncodedToFieldRep[type] |
|
<< kUpb_FieldRep_Shift; |
|
} |
|
} |
|
if ((unsigned long)type >= sizeof(kUpb_EncodedToType)) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Invalid field type: %d", (int)type); |
|
} |
|
upb_MiniTable_SetTypeAndSub(field, kUpb_EncodedToType[type], sub_counts, |
|
msg_modifiers, type == kUpb_EncodedType_OpenEnum); |
|
} |
|
|
|
static void upb_MtDecoder_ModifyField(upb_MtDecoder* d, |
|
uint32_t message_modifiers, |
|
uint32_t field_modifiers, |
|
upb_MiniTableField* field) { |
|
if (field_modifiers & kUpb_EncodedFieldModifier_FlipPacked) { |
|
if (!upb_MtDecoder_FieldIsPackable(field)) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"Cannot flip packed on unpackable field %" PRIu32, |
|
upb_MiniTableField_Number(field)); |
|
} |
|
field->UPB_PRIVATE(mode) ^= kUpb_LabelFlags_IsPacked; |
|
} |
|
|
|
if (field_modifiers & kUpb_EncodedFieldModifier_FlipValidateUtf8) { |
|
if (field->UPB_PRIVATE(descriptortype) != kUpb_FieldType_Bytes || |
|
!(field->UPB_PRIVATE(mode) & kUpb_LabelFlags_IsAlternate)) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"Cannot flip ValidateUtf8 on field %" PRIu32 |
|
", type=%d, mode=%d", |
|
upb_MiniTableField_Number(field), |
|
(int)field->UPB_PRIVATE(descriptortype), |
|
(int)field->UPB_PRIVATE(mode)); |
|
} |
|
field->UPB_PRIVATE(descriptortype) = kUpb_FieldType_String; |
|
field->UPB_PRIVATE(mode) &= ~kUpb_LabelFlags_IsAlternate; |
|
} |
|
|
|
bool singular = field_modifiers & kUpb_EncodedFieldModifier_IsProto3Singular; |
|
bool required = field_modifiers & kUpb_EncodedFieldModifier_IsRequired; |
|
|
|
// Validate. |
|
if ((singular || required) && field->UPB_PRIVATE(offset) != kHasbitPresence) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"Invalid modifier(s) for repeated field %" PRIu32, |
|
upb_MiniTableField_Number(field)); |
|
} |
|
if (singular && required) { |
|
upb_MdDecoder_ErrorJmp( |
|
&d->base, "Field %" PRIu32 " cannot be both singular and required", |
|
upb_MiniTableField_Number(field)); |
|
} |
|
|
|
if (singular && upb_MiniTableField_IsSubMessage(field)) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"Field %" PRIu32 " cannot be a singular submessage", |
|
upb_MiniTableField_Number(field)); |
|
} |
|
|
|
if (singular) field->UPB_PRIVATE(offset) = kNoPresence; |
|
if (required) { |
|
field->UPB_PRIVATE(offset) = kRequiredPresence; |
|
} |
|
} |
|
|
|
static void upb_MtDecoder_PushItem(upb_MtDecoder* d, upb_LayoutItem item) { |
|
if (d->vec.size == d->vec.capacity) { |
|
size_t new_cap = UPB_MAX(8, d->vec.size * 2); |
|
d->vec.data = realloc(d->vec.data, new_cap * sizeof(*d->vec.data)); |
|
upb_MdDecoder_CheckOutOfMemory(&d->base, d->vec.data); |
|
d->vec.capacity = new_cap; |
|
} |
|
d->vec.data[d->vec.size++] = item; |
|
} |
|
|
|
static void upb_MtDecoder_PushOneof(upb_MtDecoder* d, upb_LayoutItem item) { |
|
if (item.field_index == kUpb_LayoutItem_IndexSentinel) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Empty oneof"); |
|
} |
|
item.field_index -= kOneofBase; |
|
|
|
// Push oneof data. |
|
item.type = kUpb_LayoutItemType_OneofField; |
|
upb_MtDecoder_PushItem(d, item); |
|
|
|
// Push oneof case. |
|
item.rep = kUpb_FieldRep_4Byte; // Field Number. |
|
item.type = kUpb_LayoutItemType_OneofCase; |
|
upb_MtDecoder_PushItem(d, item); |
|
} |
|
|
|
static size_t upb_MtDecoder_SizeOfRep(upb_FieldRep rep, |
|
upb_MiniTablePlatform platform) { |
|
static const uint8_t kRepToSize32[] = { |
|
[kUpb_FieldRep_1Byte] = 1, |
|
[kUpb_FieldRep_4Byte] = 4, |
|
[kUpb_FieldRep_StringView] = 8, |
|
[kUpb_FieldRep_8Byte] = 8, |
|
}; |
|
static const uint8_t kRepToSize64[] = { |
|
[kUpb_FieldRep_1Byte] = 1, |
|
[kUpb_FieldRep_4Byte] = 4, |
|
[kUpb_FieldRep_StringView] = 16, |
|
[kUpb_FieldRep_8Byte] = 8, |
|
}; |
|
UPB_ASSERT(sizeof(upb_StringView) == |
|
UPB_SIZE(kRepToSize32, kRepToSize64)[kUpb_FieldRep_StringView]); |
|
return platform == kUpb_MiniTablePlatform_32Bit ? kRepToSize32[rep] |
|
: kRepToSize64[rep]; |
|
} |
|
|
|
static size_t upb_MtDecoder_AlignOfRep(upb_FieldRep rep, |
|
upb_MiniTablePlatform platform) { |
|
static const uint8_t kRepToAlign32[] = { |
|
[kUpb_FieldRep_1Byte] = 1, |
|
[kUpb_FieldRep_4Byte] = 4, |
|
[kUpb_FieldRep_StringView] = 4, |
|
[kUpb_FieldRep_8Byte] = 8, |
|
}; |
|
static const uint8_t kRepToAlign64[] = { |
|
[kUpb_FieldRep_1Byte] = 1, |
|
[kUpb_FieldRep_4Byte] = 4, |
|
[kUpb_FieldRep_StringView] = 8, |
|
[kUpb_FieldRep_8Byte] = 8, |
|
}; |
|
UPB_ASSERT(UPB_ALIGN_OF(upb_StringView) == |
|
UPB_SIZE(kRepToAlign32, kRepToAlign64)[kUpb_FieldRep_StringView]); |
|
return platform == kUpb_MiniTablePlatform_32Bit ? kRepToAlign32[rep] |
|
: kRepToAlign64[rep]; |
|
} |
|
|
|
static const char* upb_MtDecoder_DecodeOneofField(upb_MtDecoder* d, |
|
const char* ptr, |
|
char first_ch, |
|
upb_LayoutItem* item) { |
|
uint32_t field_num; |
|
ptr = upb_MdDecoder_DecodeBase92Varint( |
|
&d->base, ptr, first_ch, kUpb_EncodedValue_MinOneofField, |
|
kUpb_EncodedValue_MaxOneofField, &field_num); |
|
upb_MiniTableField* f = |
|
(void*)upb_MiniTable_FindFieldByNumber(d->table, field_num); |
|
|
|
if (!f) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"Couldn't add field number %" PRIu32 |
|
" to oneof, no such field number.", |
|
field_num); |
|
} |
|
if (f->UPB_PRIVATE(offset) != kHasbitPresence) { |
|
upb_MdDecoder_ErrorJmp( |
|
&d->base, |
|
"Cannot add repeated, required, or singular field %" PRIu32 |
|
" to oneof.", |
|
field_num); |
|
} |
|
|
|
// Oneof storage must be large enough to accommodate the largest member. |
|
int rep = f->UPB_PRIVATE(mode) >> kUpb_FieldRep_Shift; |
|
if (upb_MtDecoder_SizeOfRep(rep, d->platform) > |
|
upb_MtDecoder_SizeOfRep(item->rep, d->platform)) { |
|
item->rep = rep; |
|
} |
|
// Prepend this field to the linked list. |
|
f->UPB_PRIVATE(offset) = item->field_index; |
|
item->field_index = (f - d->fields) + kOneofBase; |
|
return ptr; |
|
} |
|
|
|
static const char* upb_MtDecoder_DecodeOneofs(upb_MtDecoder* d, |
|
const char* ptr) { |
|
upb_LayoutItem item = {.rep = 0, |
|
.field_index = kUpb_LayoutItem_IndexSentinel}; |
|
while (ptr < d->base.end) { |
|
char ch = *ptr++; |
|
if (ch == kUpb_EncodedValue_FieldSeparator) { |
|
// Field separator, no action needed. |
|
} else if (ch == kUpb_EncodedValue_OneofSeparator) { |
|
// End of oneof. |
|
upb_MtDecoder_PushOneof(d, item); |
|
item.field_index = kUpb_LayoutItem_IndexSentinel; // Move to next oneof. |
|
} else { |
|
ptr = upb_MtDecoder_DecodeOneofField(d, ptr, ch, &item); |
|
} |
|
} |
|
|
|
// Push final oneof. |
|
upb_MtDecoder_PushOneof(d, item); |
|
return ptr; |
|
} |
|
|
|
static const char* upb_MtDecoder_ParseModifier(upb_MtDecoder* d, |
|
const char* ptr, char first_ch, |
|
upb_MiniTableField* last_field, |
|
uint64_t* msg_modifiers) { |
|
uint32_t mod; |
|
ptr = upb_MdDecoder_DecodeBase92Varint(&d->base, ptr, first_ch, |
|
kUpb_EncodedValue_MinModifier, |
|
kUpb_EncodedValue_MaxModifier, &mod); |
|
if (last_field) { |
|
upb_MtDecoder_ModifyField(d, *msg_modifiers, mod, last_field); |
|
} else { |
|
if (!d->table) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"Extensions cannot have message modifiers"); |
|
} |
|
*msg_modifiers = mod; |
|
} |
|
|
|
return ptr; |
|
} |
|
|
|
static void upb_MtDecoder_AllocateSubs(upb_MtDecoder* d, |
|
upb_SubCounts sub_counts) { |
|
uint32_t total_count = sub_counts.submsg_count + sub_counts.subenum_count; |
|
size_t subs_bytes = sizeof(*d->table->UPB_PRIVATE(subs)) * total_count; |
|
upb_MiniTableSub* subs = upb_Arena_Malloc(d->arena, subs_bytes); |
|
upb_MdDecoder_CheckOutOfMemory(&d->base, subs); |
|
uint32_t i = 0; |
|
for (; i < sub_counts.submsg_count; i++) { |
|
subs[i].UPB_PRIVATE(submsg) = UPB_PRIVATE(_upb_MiniTable_Empty)(); |
|
} |
|
if (sub_counts.subenum_count) { |
|
upb_MiniTableField* f = d->fields; |
|
upb_MiniTableField* end_f = f + d->table->UPB_PRIVATE(field_count); |
|
for (; f < end_f; f++) { |
|
if (f->UPB_PRIVATE(descriptortype) == kUpb_FieldType_Enum) { |
|
f->UPB_PRIVATE(submsg_index) += sub_counts.submsg_count; |
|
} |
|
} |
|
for (; i < sub_counts.submsg_count + sub_counts.subenum_count; i++) { |
|
subs[i].UPB_PRIVATE(subenum) = NULL; |
|
} |
|
} |
|
d->table->UPB_PRIVATE(subs) = subs; |
|
} |
|
|
|
static const char* upb_MtDecoder_Parse(upb_MtDecoder* d, const char* ptr, |
|
size_t len, void* fields, |
|
size_t field_size, uint16_t* field_count, |
|
upb_SubCounts* sub_counts) { |
|
uint64_t msg_modifiers = 0; |
|
uint32_t last_field_number = 0; |
|
upb_MiniTableField* last_field = NULL; |
|
bool need_dense_below = d->table != NULL; |
|
|
|
d->base.end = UPB_PTRADD(ptr, len); |
|
|
|
while (ptr < d->base.end) { |
|
char ch = *ptr++; |
|
if (ch <= kUpb_EncodedValue_MaxField) { |
|
if (!d->table && last_field) { |
|
// For extensions, consume only a single field and then return. |
|
return --ptr; |
|
} |
|
upb_MiniTableField* field = fields; |
|
*field_count += 1; |
|
fields = (char*)fields + field_size; |
|
field->UPB_PRIVATE(number) = ++last_field_number; |
|
last_field = field; |
|
upb_MiniTable_SetField(d, ch, field, msg_modifiers, sub_counts); |
|
} else if (kUpb_EncodedValue_MinModifier <= ch && |
|
ch <= kUpb_EncodedValue_MaxModifier) { |
|
ptr = upb_MtDecoder_ParseModifier(d, ptr, ch, last_field, &msg_modifiers); |
|
if (msg_modifiers & kUpb_MessageModifier_IsExtendable) { |
|
d->table->UPB_PRIVATE(ext) |= kUpb_ExtMode_Extendable; |
|
} |
|
} else if (ch == kUpb_EncodedValue_End) { |
|
if (!d->table) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Extensions cannot have oneofs."); |
|
} |
|
ptr = upb_MtDecoder_DecodeOneofs(d, ptr); |
|
} else if (kUpb_EncodedValue_MinSkip <= ch && |
|
ch <= kUpb_EncodedValue_MaxSkip) { |
|
if (need_dense_below) { |
|
d->table->UPB_PRIVATE(dense_below) = d->table->UPB_PRIVATE(field_count); |
|
need_dense_below = false; |
|
} |
|
uint32_t skip; |
|
ptr = upb_MdDecoder_DecodeBase92Varint(&d->base, ptr, ch, |
|
kUpb_EncodedValue_MinSkip, |
|
kUpb_EncodedValue_MaxSkip, &skip); |
|
last_field_number += skip; |
|
last_field_number--; // Next field seen will increment. |
|
} else { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Invalid char: %c", ch); |
|
} |
|
} |
|
|
|
if (need_dense_below) { |
|
d->table->UPB_PRIVATE(dense_below) = d->table->UPB_PRIVATE(field_count); |
|
} |
|
|
|
return ptr; |
|
} |
|
|
|
static void upb_MtDecoder_ParseMessage(upb_MtDecoder* d, const char* data, |
|
size_t len) { |
|
// Buffer length is an upper bound on the number of fields. We will return |
|
// what we don't use. |
|
d->fields = upb_Arena_Malloc(d->arena, sizeof(*d->fields) * len); |
|
upb_MdDecoder_CheckOutOfMemory(&d->base, d->fields); |
|
|
|
upb_SubCounts sub_counts = {0, 0}; |
|
d->table->UPB_PRIVATE(field_count) = 0; |
|
d->table->UPB_PRIVATE(fields) = d->fields; |
|
upb_MtDecoder_Parse(d, data, len, d->fields, sizeof(*d->fields), |
|
&d->table->UPB_PRIVATE(field_count), &sub_counts); |
|
|
|
upb_Arena_ShrinkLast(d->arena, d->fields, sizeof(*d->fields) * len, |
|
sizeof(*d->fields) * d->table->UPB_PRIVATE(field_count)); |
|
d->table->UPB_PRIVATE(fields) = d->fields; |
|
upb_MtDecoder_AllocateSubs(d, sub_counts); |
|
} |
|
|
|
static int upb_MtDecoder_CompareFields(const void* _a, const void* _b) { |
|
const upb_LayoutItem* a = _a; |
|
const upb_LayoutItem* b = _b; |
|
// Currently we just sort by: |
|
// 1. rep (smallest fields first) |
|
// 2. type (oneof cases first) |
|
// 2. field_index (smallest numbers first) |
|
// The main goal of this is to reduce space lost to padding. |
|
// Later we may have more subtle reasons to prefer a different ordering. |
|
const int rep_bits = upb_Log2Ceiling(kUpb_FieldRep_Max); |
|
const int type_bits = upb_Log2Ceiling(kUpb_LayoutItemType_Max); |
|
const int idx_bits = (sizeof(a->field_index) * 8); |
|
UPB_ASSERT(idx_bits + rep_bits + type_bits < 32); |
|
#define UPB_COMBINE(rep, ty, idx) (((rep << type_bits) | ty) << idx_bits) | idx |
|
uint32_t a_packed = UPB_COMBINE(a->rep, a->type, a->field_index); |
|
uint32_t b_packed = UPB_COMBINE(b->rep, b->type, b->field_index); |
|
UPB_ASSERT(a_packed != b_packed); |
|
#undef UPB_COMBINE |
|
return a_packed < b_packed ? -1 : 1; |
|
} |
|
|
|
static bool upb_MtDecoder_SortLayoutItems(upb_MtDecoder* d) { |
|
// Add items for all non-oneof fields (oneofs were already added). |
|
int n = d->table->UPB_PRIVATE(field_count); |
|
for (int i = 0; i < n; i++) { |
|
upb_MiniTableField* f = &d->fields[i]; |
|
if (f->UPB_PRIVATE(offset) >= kOneofBase) continue; |
|
upb_LayoutItem item = {.field_index = i, |
|
.rep = f->UPB_PRIVATE(mode) >> kUpb_FieldRep_Shift, |
|
.type = kUpb_LayoutItemType_Field}; |
|
upb_MtDecoder_PushItem(d, item); |
|
} |
|
|
|
if (d->vec.size) { |
|
qsort(d->vec.data, d->vec.size, sizeof(*d->vec.data), |
|
upb_MtDecoder_CompareFields); |
|
} |
|
|
|
return true; |
|
} |
|
|
|
static size_t upb_MiniTable_DivideRoundUp(size_t n, size_t d) { |
|
return (n + d - 1) / d; |
|
} |
|
|
|
static void upb_MtDecoder_AssignHasbits(upb_MtDecoder* d) { |
|
upb_MiniTable* ret = d->table; |
|
int n = ret->UPB_PRIVATE(field_count); |
|
size_t last_hasbit = kUpb_Reserved_Hasbits - 1; |
|
|
|
// First assign required fields, which must have the lowest hasbits. |
|
for (int i = 0; i < n; i++) { |
|
upb_MiniTableField* field = |
|
(upb_MiniTableField*)&ret->UPB_PRIVATE(fields)[i]; |
|
if (field->UPB_PRIVATE(offset) == kRequiredPresence) { |
|
field->presence = ++last_hasbit; |
|
} else if (field->UPB_PRIVATE(offset) == kNoPresence) { |
|
field->presence = 0; |
|
} |
|
} |
|
if (last_hasbit > kUpb_Reserved_Hasbits + 63) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Too many required fields"); |
|
} |
|
|
|
ret->UPB_PRIVATE(required_count) = last_hasbit - (kUpb_Reserved_Hasbits - 1); |
|
|
|
// Next assign non-required hasbit fields. |
|
for (int i = 0; i < n; i++) { |
|
upb_MiniTableField* field = |
|
(upb_MiniTableField*)&ret->UPB_PRIVATE(fields)[i]; |
|
if (field->UPB_PRIVATE(offset) == kHasbitPresence) { |
|
field->presence = ++last_hasbit; |
|
} |
|
} |
|
|
|
ret->UPB_PRIVATE(size) = |
|
last_hasbit ? upb_MiniTable_DivideRoundUp(last_hasbit + 1, 8) : 0; |
|
} |
|
|
|
static size_t upb_MtDecoder_Place(upb_MtDecoder* d, upb_FieldRep rep) { |
|
size_t size = upb_MtDecoder_SizeOfRep(rep, d->platform); |
|
size_t align = upb_MtDecoder_AlignOfRep(rep, d->platform); |
|
size_t ret = UPB_ALIGN_UP(d->table->UPB_PRIVATE(size), align); |
|
static const size_t max = UINT16_MAX; |
|
size_t new_size = ret + size; |
|
if (new_size > max) { |
|
upb_MdDecoder_ErrorJmp( |
|
&d->base, "Message size exceeded maximum size of %zu bytes", max); |
|
} |
|
d->table->UPB_PRIVATE(size) = new_size; |
|
return ret; |
|
} |
|
|
|
static void upb_MtDecoder_AssignOffsets(upb_MtDecoder* d) { |
|
upb_LayoutItem* end = UPB_PTRADD(d->vec.data, d->vec.size); |
|
|
|
// Compute offsets. |
|
for (upb_LayoutItem* item = d->vec.data; item < end; item++) { |
|
item->offset = upb_MtDecoder_Place(d, item->rep); |
|
} |
|
|
|
// Assign oneof case offsets. We must do these first, since assigning |
|
// actual offsets will overwrite the links of the linked list. |
|
for (upb_LayoutItem* item = d->vec.data; item < end; item++) { |
|
if (item->type != kUpb_LayoutItemType_OneofCase) continue; |
|
upb_MiniTableField* f = &d->fields[item->field_index]; |
|
while (true) { |
|
f->presence = ~item->offset; |
|
if (f->UPB_PRIVATE(offset) == kUpb_LayoutItem_IndexSentinel) break; |
|
UPB_ASSERT(f->UPB_PRIVATE(offset) - kOneofBase < |
|
d->table->UPB_PRIVATE(field_count)); |
|
f = &d->fields[f->UPB_PRIVATE(offset) - kOneofBase]; |
|
} |
|
} |
|
|
|
// Assign offsets. |
|
for (upb_LayoutItem* item = d->vec.data; item < end; item++) { |
|
upb_MiniTableField* f = &d->fields[item->field_index]; |
|
switch (item->type) { |
|
case kUpb_LayoutItemType_OneofField: |
|
while (true) { |
|
uint16_t next_offset = f->UPB_PRIVATE(offset); |
|
f->UPB_PRIVATE(offset) = item->offset; |
|
if (next_offset == kUpb_LayoutItem_IndexSentinel) break; |
|
f = &d->fields[next_offset - kOneofBase]; |
|
} |
|
break; |
|
case kUpb_LayoutItemType_Field: |
|
f->UPB_PRIVATE(offset) = item->offset; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
|
// The fasttable parser (supported on 64-bit only) depends on this being a |
|
// multiple of 8 in order to satisfy UPB_MALLOC_ALIGN, which is also 8. |
|
// |
|
// On 32-bit we could potentially make this smaller, but there is no |
|
// compelling reason to optimize this right now. |
|
d->table->UPB_PRIVATE(size) = UPB_ALIGN_UP(d->table->UPB_PRIVATE(size), 8); |
|
} |
|
|
|
static void upb_MtDecoder_ValidateEntryField(upb_MtDecoder* d, |
|
const upb_MiniTableField* f, |
|
uint32_t expected_num) { |
|
const char* name = expected_num == 1 ? "key" : "val"; |
|
const uint32_t f_number = upb_MiniTableField_Number(f); |
|
if (f_number != expected_num) { |
|
upb_MdDecoder_ErrorJmp(&d->base, |
|
"map %s did not have expected number (%d vs %d)", |
|
name, expected_num, f_number); |
|
} |
|
|
|
if (!upb_MiniTableField_IsScalar(f)) { |
|
upb_MdDecoder_ErrorJmp( |
|
&d->base, "map %s cannot be repeated or map, or be in oneof", name); |
|
} |
|
|
|
uint32_t not_ok_types; |
|
if (expected_num == 1) { |
|
not_ok_types = (1 << kUpb_FieldType_Float) | (1 << kUpb_FieldType_Double) | |
|
(1 << kUpb_FieldType_Message) | (1 << kUpb_FieldType_Group) | |
|
(1 << kUpb_FieldType_Bytes) | (1 << kUpb_FieldType_Enum); |
|
} else { |
|
not_ok_types = 1 << kUpb_FieldType_Group; |
|
} |
|
|
|
if ((1 << upb_MiniTableField_Type(f)) & not_ok_types) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "map %s cannot have type %d", name, |
|
(int)f->UPB_PRIVATE(descriptortype)); |
|
} |
|
} |
|
|
|
static void upb_MtDecoder_ParseMap(upb_MtDecoder* d, const char* data, |
|
size_t len) { |
|
upb_MtDecoder_ParseMessage(d, data, len); |
|
upb_MtDecoder_AssignHasbits(d); |
|
|
|
if (UPB_UNLIKELY(d->table->UPB_PRIVATE(field_count) != 2)) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "%hu fields in map", |
|
d->table->UPB_PRIVATE(field_count)); |
|
UPB_UNREACHABLE(); |
|
} |
|
|
|
upb_LayoutItem* end = UPB_PTRADD(d->vec.data, d->vec.size); |
|
for (upb_LayoutItem* item = d->vec.data; item < end; item++) { |
|
if (item->type == kUpb_LayoutItemType_OneofCase) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Map entry cannot have oneof"); |
|
} |
|
} |
|
|
|
upb_MtDecoder_ValidateEntryField(d, &d->table->UPB_PRIVATE(fields)[0], 1); |
|
upb_MtDecoder_ValidateEntryField(d, &d->table->UPB_PRIVATE(fields)[1], 2); |
|
|
|
d->fields[0].UPB_PRIVATE(offset) = offsetof(upb_MapEntry, k); |
|
d->fields[1].UPB_PRIVATE(offset) = offsetof(upb_MapEntry, v); |
|
d->table->UPB_PRIVATE(size) = sizeof(upb_MapEntry); |
|
|
|
// Map entries have a special bit set to signal it's a map entry, used in |
|
// upb_MiniTable_SetSubMessage() below. |
|
d->table->UPB_PRIVATE(ext) |= kUpb_ExtMode_IsMapEntry; |
|
} |
|
|
|
static void upb_MtDecoder_ParseMessageSet(upb_MtDecoder* d, const char* data, |
|
size_t len) { |
|
if (len > 0) { |
|
upb_MdDecoder_ErrorJmp(&d->base, "Invalid message set encode length: %zu", |
|
len); |
|
} |
|
|
|
upb_MiniTable* ret = d->table; |
|
ret->UPB_PRIVATE(size) = kUpb_Reserved_Hasbytes; |
|
ret->UPB_PRIVATE(field_count) = 0; |
|
ret->UPB_PRIVATE(ext) = kUpb_ExtMode_IsMessageSet; |
|
ret->UPB_PRIVATE(dense_below) = 0; |
|
ret->UPB_PRIVATE(table_mask) = -1; |
|
ret->UPB_PRIVATE(required_count) = 0; |
|
} |
|
|
|
static upb_MiniTable* upb_MtDecoder_DoBuildMiniTableWithBuf( |
|
upb_MtDecoder* decoder, const char* data, size_t len, void** buf, |
|
size_t* buf_size) { |
|
upb_MdDecoder_CheckOutOfMemory(&decoder->base, decoder->table); |
|
|
|
decoder->table->UPB_PRIVATE(size) = kUpb_Reserved_Hasbytes; |
|
decoder->table->UPB_PRIVATE(field_count) = 0; |
|
decoder->table->UPB_PRIVATE(ext) = kUpb_ExtMode_NonExtendable; |
|
decoder->table->UPB_PRIVATE(dense_below) = 0; |
|
decoder->table->UPB_PRIVATE(table_mask) = -1; |
|
decoder->table->UPB_PRIVATE(required_count) = 0; |
|
|
|
// Strip off and verify the version tag. |
|
if (!len--) goto done; |
|
const char vers = *data++; |
|
|
|
switch (vers) { |
|
case kUpb_EncodedVersion_MapV1: |
|
upb_MtDecoder_ParseMap(decoder, data, len); |
|
break; |
|
|
|
case kUpb_EncodedVersion_MessageV1: |
|
upb_MtDecoder_ParseMessage(decoder, data, len); |
|
upb_MtDecoder_AssignHasbits(decoder); |
|
upb_MtDecoder_SortLayoutItems(decoder); |
|
upb_MtDecoder_AssignOffsets(decoder); |
|
break; |
|
|
|
case kUpb_EncodedVersion_MessageSetV1: |
|
upb_MtDecoder_ParseMessageSet(decoder, data, len); |
|
break; |
|
|
|
default: |
|
upb_MdDecoder_ErrorJmp(&decoder->base, "Invalid message version: %c", |
|
vers); |
|
} |
|
|
|
done: |
|
*buf = decoder->vec.data; |
|
*buf_size = decoder->vec.capacity * sizeof(*decoder->vec.data); |
|
return decoder->table; |
|
} |
|
|
|
static upb_MiniTable* upb_MtDecoder_BuildMiniTableWithBuf( |
|
upb_MtDecoder* const decoder, const char* const data, const size_t len, |
|
void** const buf, size_t* const buf_size) { |
|
if (UPB_SETJMP(decoder->base.err) != 0) { |
|
*buf = decoder->vec.data; |
|
*buf_size = decoder->vec.capacity * sizeof(*decoder->vec.data); |
|
return NULL; |
|
} |
|
|
|
return upb_MtDecoder_DoBuildMiniTableWithBuf(decoder, data, len, buf, |
|
buf_size); |
|
} |
|
|
|
upb_MiniTable* upb_MiniTable_BuildWithBuf(const char* data, size_t len, |
|
upb_MiniTablePlatform platform, |
|
upb_Arena* arena, void** buf, |
|
size_t* buf_size, |
|
upb_Status* status) { |
|
upb_MtDecoder decoder = { |
|
.base = {.status = status}, |
|
.platform = platform, |
|
.vec = |
|
{ |
|
.data = *buf, |
|
.capacity = *buf_size / sizeof(*decoder.vec.data), |
|
.size = 0, |
|
}, |
|
.arena = arena, |
|
.table = upb_Arena_Malloc(arena, sizeof(*decoder.table)), |
|
}; |
|
|
|
return upb_MtDecoder_BuildMiniTableWithBuf(&decoder, data, len, buf, |
|
buf_size); |
|
} |
|
|
|
static const char* upb_MtDecoder_DoBuildMiniTableExtension( |
|
upb_MtDecoder* decoder, const char* data, size_t len, |
|
upb_MiniTableExtension* ext, const upb_MiniTable* extendee, |
|
upb_MiniTableSub sub) { |
|
// If the string is non-empty then it must begin with a version tag. |
|
if (len) { |
|
if (*data != kUpb_EncodedVersion_ExtensionV1) { |
|
upb_MdDecoder_ErrorJmp(&decoder->base, "Invalid ext version: %c", *data); |
|
} |
|
data++; |
|
len--; |
|
} |
|
|
|
uint16_t count = 0; |
|
upb_SubCounts sub_counts = {0, 0}; |
|
const char* ret = upb_MtDecoder_Parse(decoder, data, len, ext, sizeof(*ext), |
|
&count, &sub_counts); |
|
if (!ret || count != 1) return NULL; |
|
|
|
upb_MiniTableField* f = &ext->UPB_PRIVATE(field); |
|
|
|
f->UPB_PRIVATE(mode) |= kUpb_LabelFlags_IsExtension; |
|
f->UPB_PRIVATE(offset) = 0; |
|
f->presence = 0; |
|
|
|
if (extendee->UPB_PRIVATE(ext) & kUpb_ExtMode_IsMessageSet) { |
|
// Extensions of MessageSet must be messages. |
|
if (!upb_MiniTableField_IsSubMessage(f)) return NULL; |
|
|
|
// Extensions of MessageSet must be non-repeating. |
|
if (upb_MiniTableField_IsArray(f)) return NULL; |
|
} |
|
|
|
ext->UPB_PRIVATE(extendee) = extendee; |
|
ext->UPB_PRIVATE(sub) = sub; |
|
|
|
return ret; |
|
} |
|
|
|
static const char* upb_MtDecoder_BuildMiniTableExtension( |
|
upb_MtDecoder* const decoder, const char* const data, const size_t len, |
|
upb_MiniTableExtension* const ext, const upb_MiniTable* const extendee, |
|
const upb_MiniTableSub sub) { |
|
if (UPB_SETJMP(decoder->base.err) != 0) return NULL; |
|
return upb_MtDecoder_DoBuildMiniTableExtension(decoder, data, len, ext, |
|
extendee, sub); |
|
} |
|
|
|
const char* _upb_MiniTableExtension_Init(const char* data, size_t len, |
|
upb_MiniTableExtension* ext, |
|
const upb_MiniTable* extendee, |
|
upb_MiniTableSub sub, |
|
upb_MiniTablePlatform platform, |
|
upb_Status* status) { |
|
upb_MtDecoder decoder = { |
|
.base = {.status = status}, |
|
.arena = NULL, |
|
.table = NULL, |
|
.platform = platform, |
|
}; |
|
|
|
return upb_MtDecoder_BuildMiniTableExtension(&decoder, data, len, ext, |
|
extendee, sub); |
|
} |
|
|
|
upb_MiniTableExtension* _upb_MiniTableExtension_Build( |
|
const char* data, size_t len, const upb_MiniTable* extendee, |
|
upb_MiniTableSub sub, upb_MiniTablePlatform platform, upb_Arena* arena, |
|
upb_Status* status) { |
|
upb_MiniTableExtension* ext = |
|
upb_Arena_Malloc(arena, sizeof(upb_MiniTableExtension)); |
|
if (UPB_UNLIKELY(!ext)) return NULL; |
|
|
|
const char* ptr = _upb_MiniTableExtension_Init(data, len, ext, extendee, sub, |
|
platform, status); |
|
if (UPB_UNLIKELY(!ptr)) return NULL; |
|
|
|
return ext; |
|
} |
|
|
|
upb_MiniTable* _upb_MiniTable_Build(const char* data, size_t len, |
|
upb_MiniTablePlatform platform, |
|
upb_Arena* arena, upb_Status* status) { |
|
void* buf = NULL; |
|
size_t size = 0; |
|
upb_MiniTable* ret = upb_MiniTable_BuildWithBuf(data, len, platform, arena, |
|
&buf, &size, status); |
|
free(buf); |
|
return ret; |
|
}
|
|
|