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.
94 lines
4.1 KiB
94 lines
4.1 KiB
// Protocol Buffers - Google's data interchange format |
|
// Copyright 2023 Google LLC. All rights reserved. |
|
// https://developers.google.com/protocol-buffers/ |
|
// |
|
// 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 THE COPYRIGHT |
|
// OWNER OR CONTRIBUTORS 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/message/accessors.h" |
|
|
|
#include "upb/collections/array.h" |
|
#include "upb/collections/internal/array.h" |
|
#include "upb/collections/map.h" |
|
#include "upb/message/message.h" |
|
#include "upb/mini_table/field.h" |
|
#include "upb/wire/decode.h" |
|
#include "upb/wire/encode.h" |
|
#include "upb/wire/eps_copy_input_stream.h" |
|
#include "upb/wire/reader.h" |
|
|
|
// Must be last. |
|
#include "upb/port/def.inc" |
|
|
|
upb_MapInsertStatus upb_Message_InsertMapEntry(upb_Map* map, |
|
const upb_MiniTable* mini_table, |
|
const upb_MiniTableField* field, |
|
upb_Message* map_entry_message, |
|
upb_Arena* arena) { |
|
const upb_MiniTable* map_entry_mini_table = |
|
mini_table->subs[field->UPB_PRIVATE(submsg_index)].submsg; |
|
UPB_ASSERT(map_entry_mini_table); |
|
UPB_ASSERT(map_entry_mini_table->field_count == 2); |
|
const upb_MiniTableField* map_entry_key_field = |
|
&map_entry_mini_table->fields[0]; |
|
const upb_MiniTableField* map_entry_value_field = |
|
&map_entry_mini_table->fields[1]; |
|
// Map key/value cannot have explicit defaults, |
|
// hence assuming a zero default is valid. |
|
upb_MessageValue default_val; |
|
memset(&default_val, 0, sizeof(upb_MessageValue)); |
|
upb_MessageValue map_entry_key; |
|
upb_MessageValue map_entry_value; |
|
_upb_Message_GetField(map_entry_message, map_entry_key_field, &default_val, |
|
&map_entry_key); |
|
_upb_Message_GetField(map_entry_message, map_entry_value_field, &default_val, |
|
&map_entry_value); |
|
return upb_Map_Insert(map, map_entry_key, map_entry_value, arena); |
|
} |
|
|
|
bool upb_Message_IsExactlyEqual(const upb_Message* m1, const upb_Message* m2, |
|
const upb_MiniTable* layout) { |
|
if (m1 == m2) return true; |
|
|
|
int opts = kUpb_EncodeOption_SkipUnknown | kUpb_EncodeOption_Deterministic; |
|
upb_Arena* a = upb_Arena_New(); |
|
|
|
// Compare deterministically serialized payloads with no unknown fields. |
|
size_t size1, size2; |
|
char *data1, *data2; |
|
upb_EncodeStatus status1 = upb_Encode(m1, layout, opts, a, &data1, &size1); |
|
upb_EncodeStatus status2 = upb_Encode(m2, layout, opts, a, &data2, &size2); |
|
|
|
if (status1 != kUpb_EncodeStatus_Ok || status2 != kUpb_EncodeStatus_Ok) { |
|
// TODO(salo): How should we fail here? (In Ruby we throw an exception.) |
|
upb_Arena_Free(a); |
|
return false; |
|
} |
|
|
|
const bool ret = (size1 == size2) && (memcmp(data1, data2, size1) == 0); |
|
upb_Arena_Free(a); |
|
return ret; |
|
}
|
|
|