// 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. // Author: [email protected] (Kenton Varda) // Based on original Protocol Buffers design by // Sanjay Ghemawat, Jeff Dean, and others. #include <google/protobuf/compiler/java/file.h> #include <memory> #include <set> #include <google/protobuf/compiler/code_generator.h> #include <google/protobuf/io/printer.h> #include <google/protobuf/io/zero_copy_stream.h> #include <google/protobuf/dynamic_message.h> #include <google/protobuf/stubs/strutil.h> #include <google/protobuf/compiler/java/context.h> #include <google/protobuf/compiler/java/enum.h> #include <google/protobuf/compiler/java/enum_lite.h> #include <google/protobuf/compiler/java/extension.h> #include <google/protobuf/compiler/java/generator_factory.h> #include <google/protobuf/compiler/java/helpers.h> #include <google/protobuf/compiler/java/message.h> #include <google/protobuf/compiler/java/name_resolver.h> #include <google/protobuf/compiler/java/service.h> #include <google/protobuf/compiler/java/shared_code_generator.h> #include <google/protobuf/descriptor.pb.h> // Must be last. #include <google/protobuf/port_def.inc> namespace google { namespace protobuf { namespace compiler { namespace java { namespace { struct FieldDescriptorCompare { … }; FieldDescriptorSet; // Recursively searches the given message to collect extensions. // Returns true if all the extensions can be recognized. The extensions will be // appended in to the extensions parameter. // Returns false when there are unknown fields, in which case the data in the // extensions output parameter is not reliable and should be discarded. bool CollectExtensions(const Message& message, FieldDescriptorSet* extensions) { … } // Finds all extensions in the given message and its sub-messages. If the // message contains unknown fields (which could be extensions), then those // extensions are defined in alternate_pool. // The message will be converted to a DynamicMessage backed by alternate_pool // in order to handle this case. void CollectExtensions(const FileDescriptorProto& file_proto, const DescriptorPool& alternate_pool, FieldDescriptorSet* extensions, const std::string& file_data) { … } // Our static initialization methods can become very, very large. // So large that if we aren't careful we end up blowing the JVM's // 64K bytes of bytecode/method. Fortunately, since these static // methods are executed only once near the beginning of a program, // there's usually plenty of stack space available and we can // extend our methods by simply chaining them to another method // with a tail call. This inserts the sequence call-next-method, // end this one, begin-next-method as needed. void MaybeRestartJavaMethod(io::Printer* printer, int* bytecode_estimate, int* method_num, const char* chain_statement, const char* method_decl) { … } } // namespace FileGenerator::FileGenerator(const FileDescriptor* file, const Options& options, bool immutable_api) : … { … } FileGenerator::~FileGenerator() { … } bool FileGenerator::Validate(std::string* error) { … } void FileGenerator::Generate(io::Printer* printer) { … } void FileGenerator::GenerateDescriptorInitializationCodeForImmutable( io::Printer* printer) { … } void FileGenerator::GenerateDescriptorInitializationCodeForMutable( io::Printer* printer) { … } template <typename GeneratorClass, typename DescriptorClass> static void GenerateSibling( const std::string& package_dir, const std::string& java_package, const DescriptorClass* descriptor, GeneratorContext* context, std::vector<std::string>* file_list, bool annotate_code, std::vector<std::string>* annotation_list, const std::string& name_suffix, GeneratorClass* generator, void (GeneratorClass::*pfn)(io::Printer* printer)) { … } void FileGenerator::GenerateSiblings( const std::string& package_dir, GeneratorContext* context, std::vector<std::string>* file_list, std::vector<std::string>* annotation_list) { … } std::string FileGenerator::GetKotlinClassname() { … } void FileGenerator::GenerateKotlinSiblings( const std::string& package_dir, GeneratorContext* context, std::vector<std::string>* file_list, std::vector<std::string>* annotation_list) { … } bool FileGenerator::ShouldIncludeDependency(const FileDescriptor* descriptor, bool immutable_api) { … } } // namespace java } // namespace compiler } // namespace protobuf } // namespace google #include <google/protobuf/port_undef.inc>