| // Protocol Buffers - Google's data interchange format |
| // Copyright 2008 Google Inc. All rights reserved. |
| // http://code.google.com/p/protobuf/ |
| // |
| // 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: kenton@google.com (Kenton Varda) |
| // Based on original Protocol Buffers design by |
| // Sanjay Ghemawat, Jeff Dean, and others. |
| |
| #include <google/protobuf/compiler/java/java_field.h> |
| #include <google/protobuf/compiler/java/java_helpers.h> |
| #include <google/protobuf/compiler/java/java_primitive_field.h> |
| #include <google/protobuf/compiler/java/java_enum_field.h> |
| #include <google/protobuf/compiler/java/java_message_field.h> |
| #include <google/protobuf/compiler/java/java_string_field.h> |
| #include <google/protobuf/stubs/common.h> |
| |
| namespace google { |
| namespace protobuf { |
| namespace compiler { |
| namespace java { |
| |
| FieldGenerator::~FieldGenerator() {} |
| |
| void FieldGenerator::GenerateParsingCodeFromPacked(io::Printer* printer) const { |
| // Reaching here indicates a bug. Cases are: |
| // - This FieldGenerator should support packing, but this method should be |
| // overridden. |
| // - This FieldGenerator doesn't support packing, and this method should |
| // never have been called. |
| GOOGLE_LOG(FATAL) << "GenerateParsingCodeFromPacked() " |
| << "called on field generator that does not support packing."; |
| } |
| |
| FieldGeneratorMap::FieldGeneratorMap(const Descriptor* descriptor) |
| : descriptor_(descriptor), |
| field_generators_( |
| new scoped_ptr<FieldGenerator>[descriptor->field_count()]), |
| extension_generators_( |
| new scoped_ptr<FieldGenerator>[descriptor->extension_count()]) { |
| |
| // Construct all the FieldGenerators and assign them bit indices for their |
| // bit fields. |
| int messageBitIndex = 0; |
| int builderBitIndex = 0; |
| for (int i = 0; i < descriptor->field_count(); i++) { |
| FieldGenerator* generator = MakeGenerator(descriptor->field(i), |
| messageBitIndex, builderBitIndex); |
| field_generators_[i].reset(generator); |
| messageBitIndex += generator->GetNumBitsForMessage(); |
| builderBitIndex += generator->GetNumBitsForBuilder(); |
| } |
| for (int i = 0; i < descriptor->extension_count(); i++) { |
| FieldGenerator* generator = MakeGenerator(descriptor->extension(i), |
| messageBitIndex, builderBitIndex); |
| extension_generators_[i].reset(generator); |
| messageBitIndex += generator->GetNumBitsForMessage(); |
| builderBitIndex += generator->GetNumBitsForBuilder(); |
| } |
| } |
| |
| FieldGenerator* FieldGeneratorMap::MakeGenerator( |
| const FieldDescriptor* field, int messageBitIndex, int builderBitIndex) { |
| if (field->is_repeated()) { |
| switch (GetJavaType(field)) { |
| case JAVATYPE_MESSAGE: |
| return new RepeatedMessageFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| case JAVATYPE_ENUM: |
| return new RepeatedEnumFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| case JAVATYPE_STRING: |
| return new RepeatedStringFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| default: |
| return new RepeatedPrimitiveFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| } |
| } else { |
| switch (GetJavaType(field)) { |
| case JAVATYPE_MESSAGE: |
| return new MessageFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| case JAVATYPE_ENUM: |
| return new EnumFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| case JAVATYPE_STRING: |
| return new StringFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| default: |
| return new PrimitiveFieldGenerator( |
| field, messageBitIndex, builderBitIndex); |
| } |
| } |
| } |
| |
| FieldGeneratorMap::~FieldGeneratorMap() {} |
| |
| const FieldGenerator& FieldGeneratorMap::get( |
| const FieldDescriptor* field) const { |
| GOOGLE_CHECK_EQ(field->containing_type(), descriptor_); |
| return *field_generators_[field->index()]; |
| } |
| |
| const FieldGenerator& FieldGeneratorMap::get_extension(int index) const { |
| return *extension_generators_[index]; |
| } |
| |
| } // namespace java |
| } // namespace compiler |
| } // namespace protobuf |
| } // namespace google |