|
|
|
// 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/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: 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;
|
|
|
|
}
|