| // 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: kenton@google.com (Kenton Varda) |
| // Based on original Protocol Buffers design by |
| // Sanjay Ghemawat, Jeff Dean, and others. |
| |
| #include <google/protobuf/io/printer.h> |
| #include <google/protobuf/io/zero_copy_stream.h> |
| #include <google/protobuf/stubs/common.h> |
| |
| namespace google { |
| namespace protobuf { |
| namespace io { |
| |
| Printer::Printer(ZeroCopyOutputStream* output, char variable_delimiter) |
| : variable_delimiter_(variable_delimiter), |
| output_(output), |
| buffer_(NULL), |
| buffer_size_(0), |
| at_start_of_line_(true), |
| failed_(false) { |
| } |
| |
| Printer::~Printer() { |
| // Only BackUp() if we have called Next() at least once and never failed. |
| if (buffer_size_ > 0 && !failed_) { |
| output_->BackUp(buffer_size_); |
| } |
| } |
| |
| void Printer::Print(const map<string, string>& variables, const char* text) { |
| int size = strlen(text); |
| int pos = 0; // The number of bytes we've written so far. |
| |
| for (int i = 0; i < size; i++) { |
| if (text[i] == '\n') { |
| // Saw newline. If there is more text, we may need to insert an indent |
| // here. So, write what we have so far, including the '\n'. |
| WriteRaw(text + pos, i - pos + 1); |
| pos = i + 1; |
| |
| // Setting this true will cause the next WriteRaw() to insert an indent |
| // first. |
| at_start_of_line_ = true; |
| |
| } else if (text[i] == variable_delimiter_) { |
| // Saw the start of a variable name. |
| |
| // Write what we have so far. |
| WriteRaw(text + pos, i - pos); |
| pos = i + 1; |
| |
| // Find closing delimiter. |
| const char* end = strchr(text + pos, variable_delimiter_); |
| if (end == NULL) { |
| GOOGLE_LOG(DFATAL) << " Unclosed variable name."; |
| end = text + pos; |
| } |
| int endpos = end - text; |
| |
| string varname(text + pos, endpos - pos); |
| if (varname.empty()) { |
| // Two delimiters in a row reduce to a literal delimiter character. |
| WriteRaw(&variable_delimiter_, 1); |
| } else { |
| // Replace with the variable's value. |
| map<string, string>::const_iterator iter = variables.find(varname); |
| if (iter == variables.end()) { |
| GOOGLE_LOG(DFATAL) << " Undefined variable: " << varname; |
| } else { |
| WriteRaw(iter->second.data(), iter->second.size()); |
| } |
| } |
| |
| // Advance past this variable. |
| i = endpos; |
| pos = endpos + 1; |
| } |
| } |
| |
| // Write the rest. |
| WriteRaw(text + pos, size - pos); |
| } |
| |
| void Printer::Print(const char* text) { |
| static map<string, string> empty; |
| Print(empty, text); |
| } |
| |
| void Printer::Print(const char* text, |
| const char* variable, const string& value) { |
| map<string, string> vars; |
| vars[variable] = value; |
| Print(vars, text); |
| } |
| |
| void Printer::Print(const char* text, |
| const char* variable1, const string& value1, |
| const char* variable2, const string& value2) { |
| map<string, string> vars; |
| vars[variable1] = value1; |
| vars[variable2] = value2; |
| Print(vars, text); |
| } |
| |
| void Printer::Print(const char* text, |
| const char* variable1, const string& value1, |
| const char* variable2, const string& value2, |
| const char* variable3, const string& value3) { |
| map<string, string> vars; |
| vars[variable1] = value1; |
| vars[variable2] = value2; |
| vars[variable3] = value3; |
| Print(vars, text); |
| } |
| |
| void Printer::Print(const char* text, |
| const char* variable1, const string& value1, |
| const char* variable2, const string& value2, |
| const char* variable3, const string& value3, |
| const char* variable4, const string& value4) { |
| map<string, string> vars; |
| vars[variable1] = value1; |
| vars[variable2] = value2; |
| vars[variable3] = value3; |
| vars[variable4] = value4; |
| Print(vars, text); |
| } |
| |
| void Printer::Indent() { |
| indent_ += " "; |
| } |
| |
| void Printer::Outdent() { |
| if (indent_.empty()) { |
| GOOGLE_LOG(DFATAL) << " Outdent() without matching Indent()."; |
| return; |
| } |
| |
| indent_.resize(indent_.size() - 2); |
| } |
| |
| void Printer::PrintRaw(const string& data) { |
| WriteRaw(data.data(), data.size()); |
| } |
| |
| void Printer::PrintRaw(const char* data) { |
| if (failed_) return; |
| WriteRaw(data, strlen(data)); |
| } |
| |
| void Printer::WriteRaw(const char* data, int size) { |
| if (failed_) return; |
| if (size == 0) return; |
| |
| if (at_start_of_line_ && (size > 0) && (data[0] != '\n')) { |
| // Insert an indent. |
| at_start_of_line_ = false; |
| WriteRaw(indent_.data(), indent_.size()); |
| if (failed_) return; |
| } |
| |
| while (size > buffer_size_) { |
| // Data exceeds space in the buffer. Copy what we can and request a |
| // new buffer. |
| memcpy(buffer_, data, buffer_size_); |
| data += buffer_size_; |
| size -= buffer_size_; |
| void* void_buffer; |
| failed_ = !output_->Next(&void_buffer, &buffer_size_); |
| if (failed_) return; |
| buffer_ = reinterpret_cast<char*>(void_buffer); |
| } |
| |
| // Buffer is big enough to receive the data; copy it. |
| memcpy(buffer_, data, size); |
| buffer_ += size; |
| buffer_size_ -= size; |
| } |
| |
| } // namespace io |
| } // namespace protobuf |
| } // namespace google |