base/pickle.cc

   1 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #include "base/pickle.h"
   6
   7 #include <stdlib.h>
   8
   9 #include <algorithm>  // for max()
  10
  11 #include "base/bits.h"
  12 #include "base/macros.h"
  13
  14 namespace base {
  15
  16 // static
  17 const int Pickle::kPayloadUnit = 64;
  18
  19 static const size_t kCapacityReadOnly = static_cast<size_t>(-1);
  20
  21 PickleIterator::PickleIterator(const Pickle& pickle)
  22     : payload_(pickle.payload()),
  23       read_index_(0),
  24       end_index_(pickle.payload_size()) {
  25 }
  26
  27 template <typename Type>
  28 inline bool PickleIterator::ReadBuiltinType(Type* result) {
  29   const char* read_from = GetReadPointerAndAdvance<Type>();
  30   if (!read_from)
  31     return false;
  32   if (sizeof(Type) > sizeof(uint32))
  33     memcpy(result, read_from, sizeof(*result));
  34   else
  35     *result = *reinterpret_cast<const Type*>(read_from);
  36   return true;
  37 }
  38
  39 inline void PickleIterator::Advance(size_t size) {
  40   size_t aligned_size = bits::Align(size, sizeof(uint32_t));
  41   if (end_index_ - read_index_ < aligned_size) {
  42     read_index_ = end_index_;
  43   } else {
  44     read_index_ += aligned_size;
  45   }
  46 }
  47
  48 template<typename Type>
  49 inline const char* PickleIterator::GetReadPointerAndAdvance() {
  50   if (sizeof(Type) > end_index_ - read_index_) {
  51     read_index_ = end_index_;
  52     return NULL;
  53   }
  54   const char* current_read_ptr = payload_ + read_index_;
  55   Advance(sizeof(Type));
  56   return current_read_ptr;
  57 }
  58
  59 const char* PickleIterator::GetReadPointerAndAdvance(int num_bytes) {
  60   if (num_bytes < 0 ||
  61       end_index_ - read_index_ < static_cast<size_t>(num_bytes)) {
  62     read_index_ = end_index_;
  63     return NULL;
  64   }
  65   const char* current_read_ptr = payload_ + read_index_;
  66   Advance(num_bytes);
  67   return current_read_ptr;
  68 }
  69
  70 inline const char* PickleIterator::GetReadPointerAndAdvance(
  71     int num_elements,
  72     size_t size_element) {
  73   // Check for int32 overflow.
  74   int64 num_bytes = static_cast<int64>(num_elements) * size_element;
  75   int num_bytes32 = static_cast<int>(num_bytes);
  76   if (num_bytes != static_cast<int64>(num_bytes32))
  77     return NULL;
  78   return GetReadPointerAndAdvance(num_bytes32);
  79 }
  80
  81 bool PickleIterator::ReadBool(bool* result) {
  82   return ReadBuiltinType(result);
  83 }
  84
  85 bool PickleIterator::ReadInt(int* result) {
  86   return ReadBuiltinType(result);
  87 }
  88
  89 bool PickleIterator::ReadLong(long* result) {
  90   return ReadBuiltinType(result);
  91 }
  92
  93 bool PickleIterator::ReadUInt16(uint16* result) {
  94   return ReadBuiltinType(result);
  95 }
  96
  97 bool PickleIterator::ReadUInt32(uint32* result) {
  98   return ReadBuiltinType(result);
  99 }
 100
 101 bool PickleIterator::ReadInt64(int64* result) {
 102   return ReadBuiltinType(result);
 103 }
 104
 105 bool PickleIterator::ReadUInt64(uint64* result) {
 106   return ReadBuiltinType(result);
 107 }
 108
 109 bool PickleIterator::ReadSizeT(size_t* result) {
 110   // Always read size_t as a 64-bit value to ensure compatibility between 32-bit
 111   // and 64-bit processes.
 112   uint64 result_uint64 = 0;
 113   bool success = ReadBuiltinType(&result_uint64);
 114   *result = static_cast<size_t>(result_uint64);
 115   // Fail if the cast above truncates the value.
 116   return success && (*result == result_uint64);
 117 }
 118
 119 bool PickleIterator::ReadFloat(float* result) {
 120   // crbug.com/315213
 121   // The source data may not be properly aligned, and unaligned float reads
 122   // cause SIGBUS on some ARM platforms, so force using memcpy to copy the data
 123   // into the result.
 124   const char* read_from = GetReadPointerAndAdvance<float>();
 125   if (!read_from)
 126     return false;
 127   memcpy(result, read_from, sizeof(*result));
 128   return true;
 129 }
 130
 131 bool PickleIterator::ReadDouble(double* result) {
 132   // crbug.com/315213
 133   // The source data may not be properly aligned, and unaligned double reads
 134   // cause SIGBUS on some ARM platforms, so force using memcpy to copy the data
 135   // into the result.
 136   const char* read_from = GetReadPointerAndAdvance<double>();
 137   if (!read_from)
 138     return false;
 139   memcpy(result, read_from, sizeof(*result));
 140   return true;
 141 }
 142
 143 bool PickleIterator::ReadString(std::string* result) {
 144   int len;
 145   if (!ReadInt(&len))
 146     return false;
 147   const char* read_from = GetReadPointerAndAdvance(len);
 148   if (!read_from)
 149     return false;
 150
 151   result->assign(read_from, len);
 152   return true;
 153 }
 154
 155 bool PickleIterator::ReadStringPiece(StringPiece* result) {
 156   int len;
 157   if (!ReadInt(&len))
 158     return false;
 159   const char* read_from = GetReadPointerAndAdvance(len);
 160   if (!read_from)
 161     return false;
 162
 163   *result = StringPiece(read_from, len);
 164   return true;
 165 }
 166
 167 bool PickleIterator::ReadString16(string16* result) {
 168   int len;
 169   if (!ReadInt(&len))
 170     return false;
 171   const char* read_from = GetReadPointerAndAdvance(len, sizeof(char16));
 172   if (!read_from)
 173     return false;
 174
 175   result->assign(reinterpret_cast<const char16*>(read_from), len);
 176   return true;
 177 }
 178
 179 bool PickleIterator::ReadStringPiece16(StringPiece16* result) {
 180   int len;
 181   if (!ReadInt(&len))
 182     return false;
 183   const char* read_from = GetReadPointerAndAdvance(len, sizeof(char16));
 184   if (!read_from)
 185     return false;
 186
 187   *result = StringPiece16(reinterpret_cast<const char16*>(read_from), len);
 188   return true;
 189 }
 190
 191 bool PickleIterator::ReadData(const char** data, int* length) {
 192   *length = 0;
 193   *data = 0;
 194
 195   if (!ReadInt(length))
 196     return false;
 197
 198   return ReadBytes(data, *length);
 199 }
 200
 201 bool PickleIterator::ReadBytes(const char** data, int length) {
 202   const char* read_from = GetReadPointerAndAdvance(length);
 203   if (!read_from)
 204     return false;
 205   *data = read_from;
 206   return true;
 207 }
 208
 209 // Payload is uint32 aligned.
 210
 211 Pickle::Pickle()
 212     : header_(NULL),
 213       header_size_(sizeof(Header)),
 214       capacity_after_header_(0),
 215       write_offset_(0) {
 216   static_assert((Pickle::kPayloadUnit & (Pickle::kPayloadUnit - 1)) == 0,
 217                 "Pickle::kPayloadUnit must be a power of two");
 218   Resize(kPayloadUnit);
 219   header_->payload_size = 0;
 220 }
 221
 222 Pickle::Pickle(int header_size)
 223     : header_(NULL),
 224       header_size_(bits::Align(header_size, sizeof(uint32))),
 225       capacity_after_header_(0),
 226       write_offset_(0) {
 227   DCHECK_GE(static_cast<size_t>(header_size), sizeof(Header));
 228   DCHECK_LE(header_size, kPayloadUnit);
 229   Resize(kPayloadUnit);
 230   header_->payload_size = 0;
 231 }
 232
 233 Pickle::Pickle(const char* data, int data_len)
 234     : header_(reinterpret_cast<Header*>(const_cast<char*>(data))),
 235       header_size_(0),
 236       capacity_after_header_(kCapacityReadOnly),
 237       write_offset_(0) {
 238   if (data_len >= static_cast<int>(sizeof(Header)))
 239     header_size_ = data_len - header_->payload_size;
 240
 241   if (header_size_ > static_cast<unsigned int>(data_len))
 242     header_size_ = 0;
 243
 244   if (header_size_ != bits::Align(header_size_, sizeof(uint32)))
 245     header_size_ = 0;
 246
 247   // If there is anything wrong with the data, we're not going to use it.
 248   if (!header_size_)
 249     header_ = NULL;
 250 }
 251
 252 Pickle::Pickle(const Pickle& other)
 253     : header_(NULL),
 254       header_size_(other.header_size_),
 255       capacity_after_header_(0),
 256       write_offset_(other.write_offset_) {
 257   Resize(other.header_->payload_size);
 258   memcpy(header_, other.header_, header_size_ + other.header_->payload_size);
 259 }
 260
 261 Pickle::~Pickle() {
 262   if (capacity_after_header_ != kCapacityReadOnly)
 263     free(header_);
 264 }
 265
 266 Pickle& Pickle::operator=(const Pickle& other) {
 267   if (this == &other) {
 268     NOTREACHED();
 269     return *this;
 270   }
 271   if (capacity_after_header_ == kCapacityReadOnly) {
 272     header_ = NULL;
 273     capacity_after_header_ = 0;
 274   }
 275   if (header_size_ != other.header_size_) {
 276     free(header_);
 277     header_ = NULL;
 278     header_size_ = other.header_size_;
 279   }
 280   Resize(other.header_->payload_size);
 281   memcpy(header_, other.header_,
 282          other.header_size_ + other.header_->payload_size);
 283   write_offset_ = other.write_offset_;
 284   return *this;
 285 }
 286
 287 bool Pickle::WriteString(const StringPiece& value) {
 288   if (!WriteInt(static_cast<int>(value.size())))
 289     return false;
 290
 291   return WriteBytes(value.data(), static_cast<int>(value.size()));
 292 }
 293
 294 bool Pickle::WriteString16(const StringPiece16& value) {
 295   if (!WriteInt(static_cast<int>(value.size())))
 296     return false;
 297
 298   return WriteBytes(value.data(),
 299                     static_cast<int>(value.size()) * sizeof(char16));
 300 }
 301
 302 bool Pickle::WriteData(const char* data, int length) {
 303   return length >= 0 && WriteInt(length) && WriteBytes(data, length);
 304 }
 305
 306 bool Pickle::WriteBytes(const void* data, int length) {
 307   WriteBytesCommon(data, length);
 308   return true;
 309 }
 310
 311 void Pickle::Reserve(size_t length) {
 312   size_t data_len = bits::Align(length, sizeof(uint32));
 313   DCHECK_GE(data_len, length);
 314 #ifdef ARCH_CPU_64_BITS
 315   DCHECK_LE(data_len, kuint32max);
 316 #endif
 317   DCHECK_LE(write_offset_, kuint32max - data_len);
 318   size_t new_size = write_offset_ + data_len;
 319   if (new_size > capacity_after_header_)
 320     Resize(capacity_after_header_ * 2 + new_size);
 321 }
 322
 323 void Pickle::Resize(size_t new_capacity) {
 324   CHECK_NE(capacity_after_header_, kCapacityReadOnly);
 325   capacity_after_header_ = bits::Align(new_capacity, kPayloadUnit);
 326   void* p = realloc(header_, GetTotalAllocatedSize());
 327   CHECK(p);
 328   header_ = reinterpret_cast<Header*>(p);
 329 }
 330
 331 size_t Pickle::GetTotalAllocatedSize() const {
 332   if (capacity_after_header_ == kCapacityReadOnly)
 333     return 0;
 334   return header_size_ + capacity_after_header_;
 335 }
 336
 337 // static
 338 const char* Pickle::FindNext(size_t header_size,
 339                              const char* start,
 340                              const char* end) {
 341   DCHECK_EQ(header_size, bits::Align(header_size, sizeof(uint32)));
 342   DCHECK_LE(header_size, static_cast<size_t>(kPayloadUnit));
 343
 344   size_t length = static_cast<size_t>(end - start);
 345   if (length < sizeof(Header))
 346     return NULL;
 347
 348   const Header* hdr = reinterpret_cast<const Header*>(start);
 349   if (length < header_size || length - header_size < hdr->payload_size)
 350     return NULL;
 351   return start + header_size + hdr->payload_size;
 352 }
 353
 354 template <size_t length> void Pickle::WriteBytesStatic(const void* data) {
 355   WriteBytesCommon(data, length);
 356 }
 357
 358 template void Pickle::WriteBytesStatic<2>(const void* data);
 359 template void Pickle::WriteBytesStatic<4>(const void* data);
 360 template void Pickle::WriteBytesStatic<8>(const void* data);
 361
 362 inline void Pickle::WriteBytesCommon(const void* data, size_t length) {
 363   DCHECK_NE(kCapacityReadOnly, capacity_after_header_)
 364       << "oops: pickle is readonly";
 365   MSAN_CHECK_MEM_IS_INITIALIZED(data, length);
 366   size_t data_len = bits::Align(length, sizeof(uint32));
 367   DCHECK_GE(data_len, length);
 368 #ifdef ARCH_CPU_64_BITS
 369   DCHECK_LE(data_len, kuint32max);
 370 #endif
 371   DCHECK_LE(write_offset_, kuint32max - data_len);
 372   size_t new_size = write_offset_ + data_len;
 373   if (new_size > capacity_after_header_) {
 374     size_t new_capacity = capacity_after_header_ * 2;
 375     const size_t kPickleHeapAlign = 4096;
 376     if (new_capacity > kPickleHeapAlign)
 377       new_capacity = bits::Align(new_capacity, kPickleHeapAlign) - kPayloadUnit;
 378     Resize(std::max(new_capacity, new_size));
 379   }
 380
 381   char* write = mutable_payload() + write_offset_;
 382   memcpy(write, data, length);
 383   memset(write + length, 0, data_len - length);
 384   header_->payload_size = static_cast<uint32>(new_size);
 385   write_offset_ = new_size;
 386 }
 387
 388 }  // namespace base