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.
103 lines
4.3 KiB
103 lines
4.3 KiB
// Protocol Buffers - Google's data interchange format |
|
// Copyright 2008 Google Inc. 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 Inc. 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 GOOGLE_PROTOBUF_COMPILER_JAVA_MESSAGE_SERIALIZATION_H__ |
|
#define GOOGLE_PROTOBUF_COMPILER_JAVA_MESSAGE_SERIALIZATION_H__ |
|
|
|
#include <algorithm> |
|
#include <cstddef> |
|
#include <vector> |
|
|
|
#include <google/protobuf/io/printer.h> |
|
#include <google/protobuf/descriptor.h> |
|
#include <google/protobuf/compiler/java/field.h> |
|
#include <google/protobuf/compiler/java/helpers.h> |
|
|
|
namespace google { |
|
namespace protobuf { |
|
namespace compiler { |
|
namespace java { |
|
|
|
// Generates code to serialize a single extension range. |
|
void GenerateSerializeExtensionRange(io::Printer* printer, |
|
const Descriptor::ExtensionRange* range); |
|
|
|
// Generates code to serialize all fields and extension ranges for the specified |
|
// message descriptor, sorting serialization calls in increasing order by field |
|
// number. |
|
// |
|
// Templatized to support different field generator implementations. |
|
template <typename FieldGenerator> |
|
void GenerateSerializeFieldsAndExtensions( |
|
io::Printer* printer, |
|
const FieldGeneratorMap<FieldGenerator>& field_generators, |
|
const Descriptor* descriptor, const FieldDescriptor** sorted_fields) { |
|
std::vector<const Descriptor::ExtensionRange*> sorted_extensions; |
|
sorted_extensions.reserve(descriptor->extension_range_count()); |
|
for (int i = 0; i < descriptor->extension_range_count(); ++i) { |
|
sorted_extensions.push_back(descriptor->extension_range(i)); |
|
} |
|
std::sort(sorted_extensions.begin(), sorted_extensions.end(), |
|
ExtensionRangeOrdering()); |
|
|
|
std::size_t range_idx = 0; |
|
|
|
// Merge the fields and the extension ranges, both sorted by field number. |
|
for (int i = 0; i < descriptor->field_count(); ++i) { |
|
const FieldDescriptor* field = sorted_fields[i]; |
|
|
|
// Collapse all extension ranges up until the next field. This leads to |
|
// shorter and more efficient codegen for messages containing a large |
|
// number of extension ranges without fields in between them. |
|
const Descriptor::ExtensionRange* range = nullptr; |
|
while (range_idx < sorted_extensions.size() && |
|
sorted_extensions[range_idx]->end <= field->number()) { |
|
range = sorted_extensions[range_idx++]; |
|
} |
|
|
|
if (range != nullptr) { |
|
GenerateSerializeExtensionRange(printer, range); |
|
} |
|
field_generators.get(field).GenerateSerializationCode(printer); |
|
} |
|
|
|
// After serializing all fields, serialize any remaining extensions via a |
|
// single writeUntil call. |
|
if (range_idx < sorted_extensions.size()) { |
|
GenerateSerializeExtensionRange(printer, sorted_extensions.back()); |
|
} |
|
} |
|
|
|
} // namespace java |
|
} // namespace compiler |
|
} // namespace protobuf |
|
} // namespace google |
|
|
|
#endif // GOOGLE_PROTOBUF_COMPILER_JAVA_MESSAGE_SERIALIZATION_H__
|
|
|