|
|
|
// 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.
|
|
|
|
|
|
|
|
#ifndef UPB_UTIL_COMPARE_H_
|
|
|
|
#define UPB_UTIL_COMPARE_H_
|
|
|
|
|
|
|
|
#include <stddef.h>
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// Returns true if unknown fields from the two messages are equal when sorted
|
|
|
|
// and varints are made canonical.
|
|
|
|
//
|
|
|
|
// This function is discouraged, as the comparison is inherently lossy without
|
|
|
|
// schema data:
|
|
|
|
//
|
|
|
|
// 1. We don't know whether delimited fields are sub-messages. Unknown
|
|
|
|
// sub-messages will therefore not have their fields sorted and varints
|
|
|
|
// canonicalized.
|
|
|
|
// 2. We don't know about oneof/non-repeated fields, which should semantically
|
|
|
|
// discard every value except the last.
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
kUpb_UnknownCompareResult_Equal = 0,
|
|
|
|
kUpb_UnknownCompareResult_NotEqual = 1,
|
|
|
|
kUpb_UnknownCompareResult_OutOfMemory = 2,
|
|
|
|
kUpb_UnknownCompareResult_MaxDepthExceeded = 3,
|
|
|
|
} upb_UnknownCompareResult;
|
|
|
|
|
|
|
|
upb_UnknownCompareResult upb_Message_UnknownFieldsAreEqual(const char* buf1,
|
|
|
|
size_t size1,
|
|
|
|
const char* buf2,
|
|
|
|
size_t size2,
|
|
|
|
int max_depth);
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
} /* extern "C" */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* UPB_UTIL_COMPARE_H_ */
|