| OLD | NEW |
| (Empty) |
| 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 #ifndef BASE_PICKLE_H_ | |
| 6 #define BASE_PICKLE_H_ | |
| 7 | |
| 8 #include <string> | |
| 9 | |
| 10 #include "base/base_export.h" | |
| 11 #include "base/basictypes.h" | |
| 12 #include "base/compiler_specific.h" | |
| 13 #include "base/gtest_prod_util.h" | |
| 14 #include "base/logging.h" | |
| 15 #include "base/strings/string16.h" | |
| 16 #include "base/strings/string_piece.h" | |
| 17 | |
| 18 namespace base { | |
| 19 | |
| 20 class Pickle; | |
| 21 | |
| 22 // PickleIterator reads data from a Pickle. The Pickle object must remain valid | |
| 23 // while the PickleIterator object is in use. | |
| 24 class BASE_EXPORT PickleIterator { | |
| 25 public: | |
| 26 PickleIterator() : payload_(NULL), read_index_(0), end_index_(0) {} | |
| 27 explicit PickleIterator(const Pickle& pickle); | |
| 28 | |
| 29 // Methods for reading the payload of the Pickle. To read from the start of | |
| 30 // the Pickle, create a PickleIterator from a Pickle. If successful, these | |
| 31 // methods return true. Otherwise, false is returned to indicate that the | |
| 32 // result could not be extracted. It is not possible to read from the iterator | |
| 33 // after that. | |
| 34 bool ReadBool(bool* result) WARN_UNUSED_RESULT; | |
| 35 bool ReadInt(int* result) WARN_UNUSED_RESULT; | |
| 36 bool ReadLong(long* result) WARN_UNUSED_RESULT; | |
| 37 bool ReadUInt16(uint16* result) WARN_UNUSED_RESULT; | |
| 38 bool ReadUInt32(uint32* result) WARN_UNUSED_RESULT; | |
| 39 bool ReadInt64(int64* result) WARN_UNUSED_RESULT; | |
| 40 bool ReadUInt64(uint64* result) WARN_UNUSED_RESULT; | |
| 41 bool ReadSizeT(size_t* result) WARN_UNUSED_RESULT; | |
| 42 bool ReadFloat(float* result) WARN_UNUSED_RESULT; | |
| 43 bool ReadDouble(double* result) WARN_UNUSED_RESULT; | |
| 44 bool ReadString(std::string* result) WARN_UNUSED_RESULT; | |
| 45 // The StringPiece data will only be valid for the lifetime of the message. | |
| 46 bool ReadStringPiece(StringPiece* result) WARN_UNUSED_RESULT; | |
| 47 bool ReadString16(string16* result) WARN_UNUSED_RESULT; | |
| 48 // The StringPiece16 data will only be valid for the lifetime of the message. | |
| 49 bool ReadStringPiece16(StringPiece16* result) WARN_UNUSED_RESULT; | |
| 50 | |
| 51 // A pointer to the data will be placed in |*data|, and the length will be | |
| 52 // placed in |*length|. The pointer placed into |*data| points into the | |
| 53 // message's buffer so it will be scoped to the lifetime of the message (or | |
| 54 // until the message data is mutated). Do not keep the pointer around! | |
| 55 bool ReadData(const char** data, int* length) WARN_UNUSED_RESULT; | |
| 56 | |
| 57 // A pointer to the data will be placed in |*data|. The caller specifies the | |
| 58 // number of bytes to read, and ReadBytes will validate this length. The | |
| 59 // pointer placed into |*data| points into the message's buffer so it will be | |
| 60 // scoped to the lifetime of the message (or until the message data is | |
| 61 // mutated). Do not keep the pointer around! | |
| 62 bool ReadBytes(const char** data, int length) WARN_UNUSED_RESULT; | |
| 63 | |
| 64 // A safer version of ReadInt() that checks for the result not being negative. | |
| 65 // Use it for reading the object sizes. | |
| 66 bool ReadLength(int* result) WARN_UNUSED_RESULT { | |
| 67 return ReadInt(result) && *result >= 0; | |
| 68 } | |
| 69 | |
| 70 // Skips bytes in the read buffer and returns true if there are at least | |
| 71 // num_bytes available. Otherwise, does nothing and returns false. | |
| 72 bool SkipBytes(int num_bytes) WARN_UNUSED_RESULT { | |
| 73 return !!GetReadPointerAndAdvance(num_bytes); | |
| 74 } | |
| 75 | |
| 76 private: | |
| 77 // Aligns 'i' by rounding it up to the next multiple of 'alignment'. | |
| 78 static size_t AlignInt(size_t i, int alignment) { | |
| 79 return i + (alignment - (i % alignment)) % alignment; | |
| 80 } | |
| 81 | |
| 82 // Read Type from Pickle. | |
| 83 template <typename Type> | |
| 84 bool ReadBuiltinType(Type* result); | |
| 85 | |
| 86 // Advance read_index_ but do not allow it to exceed end_index_. | |
| 87 // Keeps read_index_ aligned. | |
| 88 void Advance(size_t size); | |
| 89 | |
| 90 // Get read pointer for Type and advance read pointer. | |
| 91 template<typename Type> | |
| 92 const char* GetReadPointerAndAdvance(); | |
| 93 | |
| 94 // Get read pointer for |num_bytes| and advance read pointer. This method | |
| 95 // checks num_bytes for negativity and wrapping. | |
| 96 const char* GetReadPointerAndAdvance(int num_bytes); | |
| 97 | |
| 98 // Get read pointer for (num_elements * size_element) bytes and advance read | |
| 99 // pointer. This method checks for int overflow, negativity and wrapping. | |
| 100 const char* GetReadPointerAndAdvance(int num_elements, | |
| 101 size_t size_element); | |
| 102 | |
| 103 const char* payload_; // Start of our pickle's payload. | |
| 104 size_t read_index_; // Offset of the next readable byte in payload. | |
| 105 size_t end_index_; // Payload size. | |
| 106 | |
| 107 FRIEND_TEST_ALL_PREFIXES(PickleTest, GetReadPointerAndAdvance); | |
| 108 }; | |
| 109 | |
| 110 // This class provides facilities for basic binary value packing and unpacking. | |
| 111 // | |
| 112 // The Pickle class supports appending primitive values (ints, strings, etc.) | |
| 113 // to a pickle instance. The Pickle instance grows its internal memory buffer | |
| 114 // dynamically to hold the sequence of primitive values. The internal memory | |
| 115 // buffer is exposed as the "data" of the Pickle. This "data" can be passed | |
| 116 // to a Pickle object to initialize it for reading. | |
| 117 // | |
| 118 // When reading from a Pickle object, it is important for the consumer to know | |
| 119 // what value types to read and in what order to read them as the Pickle does | |
| 120 // not keep track of the type of data written to it. | |
| 121 // | |
| 122 // The Pickle's data has a header which contains the size of the Pickle's | |
| 123 // payload. It can optionally support additional space in the header. That | |
| 124 // space is controlled by the header_size parameter passed to the Pickle | |
| 125 // constructor. | |
| 126 // | |
| 127 class BASE_EXPORT Pickle { | |
| 128 public: | |
| 129 // Initialize a Pickle object using the default header size. | |
| 130 Pickle(); | |
| 131 | |
| 132 // Initialize a Pickle object with the specified header size in bytes, which | |
| 133 // must be greater-than-or-equal-to sizeof(Pickle::Header). The header size | |
| 134 // will be rounded up to ensure that the header size is 32bit-aligned. | |
| 135 explicit Pickle(int header_size); | |
| 136 | |
| 137 // Initializes a Pickle from a const block of data. The data is not copied; | |
| 138 // instead the data is merely referenced by this Pickle. Only const methods | |
| 139 // should be used on the Pickle when initialized this way. The header | |
| 140 // padding size is deduced from the data length. | |
| 141 Pickle(const char* data, int data_len); | |
| 142 | |
| 143 // Initializes a Pickle as a deep copy of another Pickle. | |
| 144 Pickle(const Pickle& other); | |
| 145 | |
| 146 // Note: There are no virtual methods in this class. This destructor is | |
| 147 // virtual as an element of defensive coding. Other classes have derived from | |
| 148 // this class, and there is a *chance* that they will cast into this base | |
| 149 // class before destruction. At least one such class does have a virtual | |
| 150 // destructor, suggesting at least some need to call more derived destructors. | |
| 151 virtual ~Pickle(); | |
| 152 | |
| 153 // Performs a deep copy. | |
| 154 Pickle& operator=(const Pickle& other); | |
| 155 | |
| 156 // Returns the number of bytes written in the Pickle, including the header. | |
| 157 size_t size() const { return header_size_ + header_->payload_size; } | |
| 158 | |
| 159 // Returns the data for this Pickle. | |
| 160 const void* data() const { return header_; } | |
| 161 | |
| 162 // Returns the effective memory capacity of this Pickle, that is, the total | |
| 163 // number of bytes currently dynamically allocated or 0 in the case of a | |
| 164 // read-only Pickle. This should be used only for diagnostic / profiling | |
| 165 // purposes. | |
| 166 size_t GetTotalAllocatedSize() const; | |
| 167 | |
| 168 // Methods for adding to the payload of the Pickle. These values are | |
| 169 // appended to the end of the Pickle's payload. When reading values from a | |
| 170 // Pickle, it is important to read them in the order in which they were added | |
| 171 // to the Pickle. | |
| 172 | |
| 173 bool WriteBool(bool value) { | |
| 174 return WriteInt(value ? 1 : 0); | |
| 175 } | |
| 176 bool WriteInt(int value) { | |
| 177 return WritePOD(value); | |
| 178 } | |
| 179 // WARNING: DO NOT USE THIS METHOD IF PICKLES ARE PERSISTED IN ANY WAY. | |
| 180 // It will write whatever a "long" is on this architecture. On 32-bit | |
| 181 // platforms, it is 32 bits. On 64-bit platforms, it is 64 bits. If persisted | |
| 182 // pickles are still around after upgrading to 64-bit, or if they are copied | |
| 183 // between dissimilar systems, YOUR PICKLES WILL HAVE GONE BAD. | |
| 184 bool WriteLongUsingDangerousNonPortableLessPersistableForm(long value) { | |
| 185 return WritePOD(value); | |
| 186 } | |
| 187 bool WriteUInt16(uint16 value) { | |
| 188 return WritePOD(value); | |
| 189 } | |
| 190 bool WriteUInt32(uint32 value) { | |
| 191 return WritePOD(value); | |
| 192 } | |
| 193 bool WriteInt64(int64 value) { | |
| 194 return WritePOD(value); | |
| 195 } | |
| 196 bool WriteUInt64(uint64 value) { | |
| 197 return WritePOD(value); | |
| 198 } | |
| 199 bool WriteSizeT(size_t value) { | |
| 200 // Always write size_t as a 64-bit value to ensure compatibility between | |
| 201 // 32-bit and 64-bit processes. | |
| 202 return WritePOD(static_cast<uint64>(value)); | |
| 203 } | |
| 204 bool WriteFloat(float value) { | |
| 205 return WritePOD(value); | |
| 206 } | |
| 207 bool WriteDouble(double value) { | |
| 208 return WritePOD(value); | |
| 209 } | |
| 210 bool WriteString(const StringPiece& value); | |
| 211 bool WriteString16(const StringPiece16& value); | |
| 212 // "Data" is a blob with a length. When you read it out you will be given the | |
| 213 // length. See also WriteBytes. | |
| 214 bool WriteData(const char* data, int length); | |
| 215 // "Bytes" is a blob with no length. The caller must specify the length both | |
| 216 // when reading and writing. It is normally used to serialize PoD types of a | |
| 217 // known size. See also WriteData. | |
| 218 bool WriteBytes(const void* data, int length); | |
| 219 | |
| 220 // Reserves space for upcoming writes when multiple writes will be made and | |
| 221 // their sizes are computed in advance. It can be significantly faster to call | |
| 222 // Reserve() before calling WriteFoo() multiple times. | |
| 223 void Reserve(size_t additional_capacity); | |
| 224 | |
| 225 // Payload follows after allocation of Header (header size is customizable). | |
| 226 struct Header { | |
| 227 uint32 payload_size; // Specifies the size of the payload. | |
| 228 }; | |
| 229 | |
| 230 // Returns the header, cast to a user-specified type T. The type T must be a | |
| 231 // subclass of Header and its size must correspond to the header_size passed | |
| 232 // to the Pickle constructor. | |
| 233 template <class T> | |
| 234 T* headerT() { | |
| 235 DCHECK_EQ(header_size_, sizeof(T)); | |
| 236 return static_cast<T*>(header_); | |
| 237 } | |
| 238 template <class T> | |
| 239 const T* headerT() const { | |
| 240 DCHECK_EQ(header_size_, sizeof(T)); | |
| 241 return static_cast<const T*>(header_); | |
| 242 } | |
| 243 | |
| 244 // The payload is the pickle data immediately following the header. | |
| 245 size_t payload_size() const { | |
| 246 return header_ ? header_->payload_size : 0; | |
| 247 } | |
| 248 | |
| 249 const char* payload() const { | |
| 250 return reinterpret_cast<const char*>(header_) + header_size_; | |
| 251 } | |
| 252 | |
| 253 // Returns the address of the byte immediately following the currently valid | |
| 254 // header + payload. | |
| 255 const char* end_of_payload() const { | |
| 256 // This object may be invalid. | |
| 257 return header_ ? payload() + payload_size() : NULL; | |
| 258 } | |
| 259 | |
| 260 protected: | |
| 261 char* mutable_payload() { | |
| 262 return reinterpret_cast<char*>(header_) + header_size_; | |
| 263 } | |
| 264 | |
| 265 size_t capacity_after_header() const { | |
| 266 return capacity_after_header_; | |
| 267 } | |
| 268 | |
| 269 // Resize the capacity, note that the input value should not include the size | |
| 270 // of the header. | |
| 271 void Resize(size_t new_capacity); | |
| 272 | |
| 273 // Aligns 'i' by rounding it up to the next multiple of 'alignment' | |
| 274 static size_t AlignInt(size_t i, int alignment) { | |
| 275 return i + (alignment - (i % alignment)) % alignment; | |
| 276 } | |
| 277 | |
| 278 // Find the end of the pickled data that starts at range_start. Returns NULL | |
| 279 // if the entire Pickle is not found in the given data range. | |
| 280 static const char* FindNext(size_t header_size, | |
| 281 const char* range_start, | |
| 282 const char* range_end); | |
| 283 | |
| 284 // The allocation granularity of the payload. | |
| 285 static const int kPayloadUnit; | |
| 286 | |
| 287 private: | |
| 288 friend class PickleIterator; | |
| 289 | |
| 290 Header* header_; | |
| 291 size_t header_size_; // Supports extra data between header and payload. | |
| 292 // Allocation size of payload (or -1 if allocation is const). Note: this | |
| 293 // doesn't count the header. | |
| 294 size_t capacity_after_header_; | |
| 295 // The offset at which we will write the next field. Note: this doesn't count | |
| 296 // the header. | |
| 297 size_t write_offset_; | |
| 298 | |
| 299 // Just like WriteBytes, but with a compile-time size, for performance. | |
| 300 template<size_t length> void BASE_EXPORT WriteBytesStatic(const void* data); | |
| 301 | |
| 302 // Writes a POD by copying its bytes. | |
| 303 template <typename T> bool WritePOD(const T& data) { | |
| 304 WriteBytesStatic<sizeof(data)>(&data); | |
| 305 return true; | |
| 306 } | |
| 307 inline void WriteBytesCommon(const void* data, size_t length); | |
| 308 | |
| 309 FRIEND_TEST_ALL_PREFIXES(PickleTest, Resize); | |
| 310 FRIEND_TEST_ALL_PREFIXES(PickleTest, FindNext); | |
| 311 FRIEND_TEST_ALL_PREFIXES(PickleTest, FindNextWithIncompleteHeader); | |
| 312 FRIEND_TEST_ALL_PREFIXES(PickleTest, FindNextOverflow); | |
| 313 }; | |
| 314 | |
| 315 } // namespace base | |
| 316 | |
| 317 #endif // BASE_PICKLE_H_ | |
| OLD | NEW |