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.
82 lines
3.2 KiB
82 lines
3.2 KiB
2 years ago
|
/*
|
||
|
|
* Copyright (c) 2007-2021, 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 "upbc/names.h"
|
||
|
|
|
||
|
|
#include <string>
|
||
|
|
|
||
|
|
#include "google/protobuf/descriptor.h"
|
||
|
|
#include "absl/strings/match.h"
|
||
|
|
|
||
|
|
namespace upbc {
|
||
|
|
|
||
|
|
namespace protobuf = ::google::protobuf;
|
||
|
|
|
||
|
|
// List of generated accessor prefixes to check against.
|
||
|
|
// Example:
|
||
|
|
// optional repeated string phase = 236;
|
||
|
|
// optional bool clear_phase = 237;
|
||
|
|
static constexpr absl::string_view kAccessorPrefixes[] = {
|
||
|
|
"clear_",
|
||
|
|
"delete_",
|
||
|
|
"add_",
|
||
|
|
"resize_",
|
||
|
|
};
|
||
|
|
|
||
|
|
std::string ResolveFieldName(const protobuf::FieldDescriptor* field,
|
||
|
|
const NameToFieldDescriptorMap& field_names) {
|
||
|
|
absl::string_view field_name = field->name();
|
||
|
|
for (const auto prefix : kAccessorPrefixes) {
|
||
|
|
// If field name starts with a prefix such as clear_ and the proto
|
||
|
|
// contains a field name with trailing end, depending on type of field
|
||
|
|
// (repeated, map, message) we have a conflict to resolve.
|
||
|
|
if (absl::StartsWith(field_name, prefix)) {
|
||
|
|
auto match = field_names.find(field_name.substr(prefix.size()));
|
||
|
|
if (match != field_names.end()) {
|
||
|
|
const auto* candidate = match->second;
|
||
|
|
if (candidate->is_repeated() || candidate->is_map()) {
|
||
|
|
return absl::StrCat(field_name, "_");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return std::string(field_name);
|
||
|
|
}
|
||
|
|
|
||
|
|
// Returns field map by name to use for conflict checks.
|
||
|
|
NameToFieldDescriptorMap CreateFieldNameMap(
|
||
|
|
const protobuf::Descriptor* message) {
|
||
|
|
NameToFieldDescriptorMap field_names;
|
||
|
|
for (int i = 0; i < message->field_count(); i++) {
|
||
|
|
const protobuf::FieldDescriptor* field = message->field(i);
|
||
|
|
field_names.emplace(field->name(), field);
|
||
|
|
}
|
||
|
|
return field_names;
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace upbc
|