pickle.h 14 KB

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