81 lines
3.1 KiB
C++
81 lines
3.1 KiB
C++
// 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/code_generator.h>
|
|
|
|
#include <google/protobuf/stubs/common.h>
|
|
#include <google/protobuf/stubs/strutil.h>
|
|
|
|
namespace google {
|
|
namespace protobuf {
|
|
namespace compiler {
|
|
|
|
CodeGenerator::~CodeGenerator() {}
|
|
GeneratorContext::~GeneratorContext() {}
|
|
|
|
io::ZeroCopyOutputStream* GeneratorContext::OpenForInsert(
|
|
const string& filename, const string& insertion_point) {
|
|
GOOGLE_LOG(FATAL) << "This GeneratorContext does not support insertion.";
|
|
return NULL; // make compiler happy
|
|
}
|
|
|
|
void GeneratorContext::ListParsedFiles(
|
|
vector<const FileDescriptor*>* output) {
|
|
GOOGLE_LOG(FATAL) << "This GeneratorContext does not support ListParsedFiles";
|
|
}
|
|
|
|
// Parses a set of comma-delimited name/value pairs.
|
|
void ParseGeneratorParameter(const string& text,
|
|
vector<pair<string, string> >* output) {
|
|
vector<string> parts;
|
|
SplitStringUsing(text, ",", &parts);
|
|
|
|
for (int i = 0; i < parts.size(); i++) {
|
|
string::size_type equals_pos = parts[i].find_first_of('=');
|
|
pair<string, string> value;
|
|
if (equals_pos == string::npos) {
|
|
value.first = parts[i];
|
|
value.second = "";
|
|
} else {
|
|
value.first = parts[i].substr(0, equals_pos);
|
|
value.second = parts[i].substr(equals_pos + 1);
|
|
}
|
|
output->push_back(value);
|
|
}
|
|
}
|
|
|
|
} // namespace compiler
|
|
} // namespace protobuf
|
|
} // namespace google
|