91 lines
3.5 KiB
C++
91 lines
3.5 KiB
C++
// 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: jasonh@google.com (Jason Hsueh)
|
|
//
|
|
// Implements methods of coded_stream.h that need to be inlined for performance
|
|
// reasons, but should not be defined in a public header.
|
|
|
|
#ifndef GOOGLE_PROTOBUF_IO_CODED_STREAM_INL_H__
|
|
#define GOOGLE_PROTOBUF_IO_CODED_STREAM_INL_H__
|
|
|
|
#include <google/protobuf/stubs/logging.h>
|
|
#include <google/protobuf/stubs/common.h>
|
|
#include <google/protobuf/io/coded_stream.h>
|
|
#include <google/protobuf/io/zero_copy_stream_impl_lite.h>
|
|
#include <string>
|
|
#include <google/protobuf/stubs/stl_util.h>
|
|
|
|
namespace google {
|
|
namespace protobuf {
|
|
namespace io {
|
|
|
|
inline bool CodedInputStream::InternalReadStringInline(string* buffer,
|
|
int size) {
|
|
if (size < 0) return false; // security: size is often user-supplied
|
|
|
|
if (BufferSize() >= size) {
|
|
STLStringResizeUninitialized(buffer, size);
|
|
std::pair<char*, bool> z = as_string_data(buffer);
|
|
if (z.second) {
|
|
// Oddly enough, memcpy() requires its first two args to be non-NULL even
|
|
// if we copy 0 bytes. So, we have ensured that z.first is non-NULL here.
|
|
GOOGLE_DCHECK(z.first != NULL);
|
|
memcpy(z.first, buffer_, size);
|
|
Advance(size);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
return ReadStringFallback(buffer, size);
|
|
}
|
|
|
|
inline bool CodedInputStream::InternalReadRawInline(void* buffer, int size) {
|
|
int current_buffer_size;
|
|
while ((current_buffer_size = BufferSize()) < size) {
|
|
// Reading past end of buffer. Copy what we have, then refresh.
|
|
memcpy(buffer, buffer_, current_buffer_size);
|
|
buffer = reinterpret_cast<uint8*>(buffer) + current_buffer_size;
|
|
size -= current_buffer_size;
|
|
Advance(current_buffer_size);
|
|
if (!Refresh()) return false;
|
|
}
|
|
|
|
memcpy(buffer, buffer_, size);
|
|
Advance(size);
|
|
|
|
return true;
|
|
}
|
|
|
|
} // namespace io
|
|
} // namespace protobuf
|
|
} // namespace google
|
|
#endif // GOOGLE_PROTOBUF_IO_CODED_STREAM_INL_H__
|