Buffer.hpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2017 ZeroTier, Inc. https://www.zerotier.com/
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. *
  18. * --
  19. *
  20. * You can be released from the requirements of the license by purchasing
  21. * a commercial license. Buying such a license is mandatory as soon as you
  22. * develop commercial closed-source software that incorporates or links
  23. * directly against ZeroTier software without disclosing the source code
  24. * of your own application.
  25. */
  26. #ifndef ZT_BUFFER_HPP
  27. #define ZT_BUFFER_HPP
  28. #include <string.h>
  29. #include <stdint.h>
  30. #include <stdexcept>
  31. #include <string>
  32. #include <algorithm>
  33. #include <utility>
  34. #include "Constants.hpp"
  35. #include "Utils.hpp"
  36. #if defined(__GNUC__) && (!defined(ZT_NO_TYPE_PUNNING))
  37. #define ZT_VAR_MAY_ALIAS __attribute__((__may_alias__))
  38. #else
  39. #define ZT_VAR_MAY_ALIAS
  40. #endif
  41. namespace ZeroTier {
  42. /**
  43. * A variable length but statically allocated buffer
  44. *
  45. * Bounds-checking is done everywhere, since this is used in security
  46. * critical code. This supports construction and assignment from buffers
  47. * of differing capacities, provided the data actually in them fits.
  48. * It throws std::out_of_range on any boundary violation.
  49. *
  50. * The at(), append(), etc. methods encode integers larger than 8-bit in
  51. * big-endian (network) byte order.
  52. *
  53. * @tparam C Total capacity
  54. */
  55. template<unsigned int C>
  56. class Buffer
  57. {
  58. // I love me!
  59. template <unsigned int C2> friend class Buffer;
  60. public:
  61. // STL container idioms
  62. typedef unsigned char value_type;
  63. typedef unsigned char * pointer;
  64. typedef const char * const_pointer;
  65. typedef char & reference;
  66. typedef const char & const_reference;
  67. typedef char * iterator;
  68. typedef const char * const_iterator;
  69. typedef unsigned int size_type;
  70. typedef int difference_type;
  71. typedef std::reverse_iterator<iterator> reverse_iterator;
  72. typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
  73. inline iterator begin() { return _b; }
  74. inline iterator end() { return (_b + _l); }
  75. inline const_iterator begin() const { return _b; }
  76. inline const_iterator end() const { return (_b + _l); }
  77. inline reverse_iterator rbegin() { return reverse_iterator(begin()); }
  78. inline reverse_iterator rend() { return reverse_iterator(end()); }
  79. inline const_reverse_iterator rbegin() const { return const_reverse_iterator(begin()); }
  80. inline const_reverse_iterator rend() const { return const_reverse_iterator(end()); }
  81. Buffer() :
  82. _l(0)
  83. {
  84. }
  85. Buffer(unsigned int l)
  86. {
  87. if (l > C)
  88. throw std::out_of_range("Buffer: construct with size larger than capacity");
  89. _l = l;
  90. }
  91. template<unsigned int C2>
  92. Buffer(const Buffer<C2> &b)
  93. {
  94. *this = b;
  95. }
  96. Buffer(const void *b,unsigned int l)
  97. {
  98. copyFrom(b,l);
  99. }
  100. Buffer(const std::string &s)
  101. {
  102. copyFrom(s.data(),s.length());
  103. }
  104. template<unsigned int C2>
  105. inline Buffer &operator=(const Buffer<C2> &b)
  106. {
  107. if (unlikely(b._l > C))
  108. throw std::out_of_range("Buffer: assignment from buffer larger than capacity");
  109. if (C2 == C) {
  110. memcpy(this,&b,sizeof(Buffer<C>));
  111. } else {
  112. memcpy(_b,b._b,_l = b._l);
  113. }
  114. return *this;
  115. }
  116. inline void copyFrom(const void *b,unsigned int l)
  117. {
  118. if (unlikely(l > C))
  119. throw std::out_of_range("Buffer: set from C array larger than capacity");
  120. memcpy(_b,b,l);
  121. _l = l;
  122. }
  123. unsigned char operator[](const unsigned int i) const
  124. {
  125. if (unlikely(i >= _l))
  126. throw std::out_of_range("Buffer: [] beyond end of data");
  127. return (unsigned char)_b[i];
  128. }
  129. unsigned char &operator[](const unsigned int i)
  130. {
  131. if (unlikely(i >= _l))
  132. throw std::out_of_range("Buffer: [] beyond end of data");
  133. return ((unsigned char *)_b)[i];
  134. }
  135. /**
  136. * Get a raw pointer to a field with bounds checking
  137. *
  138. * This isn't perfectly safe in that the caller could still overflow
  139. * the pointer, but its use provides both a sanity check and
  140. * documentation / reminder to the calling code to treat the returned
  141. * pointer as being of size [l].
  142. *
  143. * @param i Index of field in buffer
  144. * @param l Length of field in bytes
  145. * @return Pointer to field data
  146. * @throws std::out_of_range Field extends beyond data size
  147. */
  148. unsigned char *field(unsigned int i,unsigned int l)
  149. {
  150. if (unlikely((i + l) > _l))
  151. throw std::out_of_range("Buffer: field() beyond end of data");
  152. return (unsigned char *)(_b + i);
  153. }
  154. const unsigned char *field(unsigned int i,unsigned int l) const
  155. {
  156. if (unlikely((i + l) > _l))
  157. throw std::out_of_range("Buffer: field() beyond end of data");
  158. return (const unsigned char *)(_b + i);
  159. }
  160. /**
  161. * Place a primitive integer value at a given position
  162. *
  163. * @param i Index to place value
  164. * @param v Value
  165. * @tparam T Integer type (e.g. uint16_t, int64_t)
  166. */
  167. template<typename T>
  168. inline void setAt(unsigned int i,const T v)
  169. {
  170. if (unlikely((i + sizeof(T)) > _l))
  171. throw std::out_of_range("Buffer: setAt() beyond end of data");
  172. #ifdef ZT_NO_TYPE_PUNNING
  173. uint8_t *p = reinterpret_cast<uint8_t *>(_b + i);
  174. for(unsigned int x=1;x<=sizeof(T);++x)
  175. *(p++) = (uint8_t)(v >> (8 * (sizeof(T) - x)));
  176. #else
  177. T *const ZT_VAR_MAY_ALIAS p = reinterpret_cast<T *>(_b + i);
  178. *p = Utils::hton(v);
  179. #endif
  180. }
  181. /**
  182. * Get a primitive integer value at a given position
  183. *
  184. * @param i Index to get integer
  185. * @tparam T Integer type (e.g. uint16_t, int64_t)
  186. * @return Integer value
  187. */
  188. template<typename T>
  189. inline T at(unsigned int i) const
  190. {
  191. if (unlikely((i + sizeof(T)) > _l))
  192. throw std::out_of_range("Buffer: at() beyond end of data");
  193. #ifdef ZT_NO_TYPE_PUNNING
  194. T v = 0;
  195. const uint8_t *p = reinterpret_cast<const uint8_t *>(_b + i);
  196. for(unsigned int x=0;x<sizeof(T);++x) {
  197. v <<= 8;
  198. v |= (T)*(p++);
  199. }
  200. return v;
  201. #else
  202. const T *const ZT_VAR_MAY_ALIAS p = reinterpret_cast<const T *>(_b + i);
  203. return Utils::ntoh(*p);
  204. #endif
  205. }
  206. /**
  207. * Append an integer type to this buffer
  208. *
  209. * @param v Value to append
  210. * @tparam T Integer type (e.g. uint16_t, int64_t)
  211. * @throws std::out_of_range Attempt to append beyond capacity
  212. */
  213. template<typename T>
  214. inline void append(const T v)
  215. {
  216. if (unlikely((_l + sizeof(T)) > C))
  217. throw std::out_of_range("Buffer: append beyond capacity");
  218. #ifdef ZT_NO_TYPE_PUNNING
  219. uint8_t *p = reinterpret_cast<uint8_t *>(_b + _l);
  220. for(unsigned int x=1;x<=sizeof(T);++x)
  221. *(p++) = (uint8_t)(v >> (8 * (sizeof(T) - x)));
  222. #else
  223. T *const ZT_VAR_MAY_ALIAS p = reinterpret_cast<T *>(_b + _l);
  224. *p = Utils::hton(v);
  225. #endif
  226. _l += sizeof(T);
  227. }
  228. /**
  229. * Append a run of bytes
  230. *
  231. * @param c Character value to append
  232. * @param n Number of times to append
  233. * @throws std::out_of_range Attempt to append beyond capacity
  234. */
  235. inline void append(unsigned char c,unsigned int n)
  236. {
  237. if (unlikely((_l + n) > C))
  238. throw std::out_of_range("Buffer: append beyond capacity");
  239. for(unsigned int i=0;i<n;++i)
  240. _b[_l++] = (char)c;
  241. }
  242. /**
  243. * Append secure random bytes
  244. *
  245. * @param n Number of random bytes to append
  246. */
  247. inline void appendRandom(unsigned int n)
  248. {
  249. if (unlikely((_l + n) > C))
  250. throw std::out_of_range("Buffer: append beyond capacity");
  251. Utils::getSecureRandom(_b + _l,n);
  252. _l += n;
  253. }
  254. /**
  255. * Append a C-array of bytes
  256. *
  257. * @param b Data
  258. * @param l Length
  259. * @throws std::out_of_range Attempt to append beyond capacity
  260. */
  261. inline void append(const void *b,unsigned int l)
  262. {
  263. if (unlikely((_l + l) > C))
  264. throw std::out_of_range("Buffer: append beyond capacity");
  265. memcpy(_b + _l,b,l);
  266. _l += l;
  267. }
  268. /**
  269. * Append a string
  270. *
  271. * @param s String to append
  272. * @throws std::out_of_range Attempt to append beyond capacity
  273. */
  274. inline void append(const std::string &s)
  275. {
  276. append(s.data(),(unsigned int)s.length());
  277. }
  278. /**
  279. * Append a C string including null termination byte
  280. *
  281. * @param s C string
  282. * @throws std::out_of_range Attempt to append beyond capacity
  283. */
  284. inline void appendCString(const char *s)
  285. {
  286. for(;;) {
  287. if (unlikely(_l >= C))
  288. throw std::out_of_range("Buffer: append beyond capacity");
  289. if (!(_b[_l++] = *(s++)))
  290. break;
  291. }
  292. }
  293. /**
  294. * Append a buffer
  295. *
  296. * @param b Buffer to append
  297. * @tparam C2 Capacity of second buffer (typically inferred)
  298. * @throws std::out_of_range Attempt to append beyond capacity
  299. */
  300. template<unsigned int C2>
  301. inline void append(const Buffer<C2> &b)
  302. {
  303. append(b._b,b._l);
  304. }
  305. /**
  306. * Increment size and return pointer to field of specified size
  307. *
  308. * Nothing is actually written to the memory. This is a shortcut
  309. * for addSize() followed by field() to reference the previous
  310. * position and the new size.
  311. *
  312. * @param l Length of field to append
  313. * @return Pointer to beginning of appended field of length 'l'
  314. */
  315. inline char *appendField(unsigned int l)
  316. {
  317. if (unlikely((_l + l) > C))
  318. throw std::out_of_range("Buffer: append beyond capacity");
  319. char *r = _b + _l;
  320. _l += l;
  321. return r;
  322. }
  323. /**
  324. * Increment size by a given number of bytes
  325. *
  326. * The contents of new space are undefined.
  327. *
  328. * @param i Bytes to increment
  329. * @throws std::out_of_range Capacity exceeded
  330. */
  331. inline void addSize(unsigned int i)
  332. {
  333. if (unlikely((i + _l) > C))
  334. throw std::out_of_range("Buffer: setSize to larger than capacity");
  335. _l += i;
  336. }
  337. /**
  338. * Set size of data in buffer
  339. *
  340. * The contents of new space are undefined.
  341. *
  342. * @param i New size
  343. * @throws std::out_of_range Size larger than capacity
  344. */
  345. inline void setSize(const unsigned int i)
  346. {
  347. if (unlikely(i > C))
  348. throw std::out_of_range("Buffer: setSize to larger than capacity");
  349. _l = i;
  350. }
  351. /**
  352. * Move everything after 'at' to the buffer's front and truncate
  353. *
  354. * @param at Truncate before this position
  355. * @throw std::out_of_range Position is beyond size of buffer
  356. */
  357. inline void behead(const unsigned int at)
  358. {
  359. if (!at)
  360. return;
  361. if (unlikely(at > _l))
  362. throw std::out_of_range("Buffer: behead() beyond capacity");
  363. ::memmove(_b,_b + at,_l -= at);
  364. }
  365. /**
  366. * Erase something from the middle of the buffer
  367. *
  368. * @param start Starting position
  369. * @param length Length of block to erase
  370. * @throw std::out_of_range Position plus length is beyond size of buffer
  371. */
  372. inline void erase(const unsigned int at,const unsigned int length)
  373. {
  374. const unsigned int endr = at + length;
  375. if (unlikely(endr > _l))
  376. throw std::out_of_range("Buffer: erase() range beyond end of buffer");
  377. ::memmove(_b + at,_b + endr,_l - endr);
  378. _l -= length;
  379. }
  380. /**
  381. * Set buffer data length to zero
  382. */
  383. inline void clear() { _l = 0; }
  384. /**
  385. * Zero buffer up to size()
  386. */
  387. inline void zero() { memset(_b,0,_l); }
  388. /**
  389. * Zero unused capacity area
  390. */
  391. inline void zeroUnused() { memset(_b + _l,0,C - _l); }
  392. /**
  393. * Unconditionally and securely zero buffer's underlying memory
  394. */
  395. inline void burn() { Utils::burn(_b,sizeof(_b)); }
  396. /**
  397. * @return Constant pointer to data in buffer
  398. */
  399. inline const void *data() const { return _b; }
  400. /**
  401. * @return Non-constant pointer to data in buffer
  402. */
  403. inline void *unsafeData() { return _b; }
  404. /**
  405. * @return Size of data in buffer
  406. */
  407. inline unsigned int size() const { return _l; }
  408. /**
  409. * @return Capacity of buffer
  410. */
  411. inline unsigned int capacity() const { return C; }
  412. template<unsigned int C2>
  413. inline bool operator==(const Buffer<C2> &b) const
  414. {
  415. return ((_l == b._l)&&(!memcmp(_b,b._b,_l)));
  416. }
  417. template<unsigned int C2>
  418. inline bool operator!=(const Buffer<C2> &b) const
  419. {
  420. return ((_l != b._l)||(memcmp(_b,b._b,_l)));
  421. }
  422. template<unsigned int C2>
  423. inline bool operator<(const Buffer<C2> &b) const
  424. {
  425. return (memcmp(_b,b._b,std::min(_l,b._l)) < 0);
  426. }
  427. template<unsigned int C2>
  428. inline bool operator>(const Buffer<C2> &b) const
  429. {
  430. return (b < *this);
  431. }
  432. template<unsigned int C2>
  433. inline bool operator<=(const Buffer<C2> &b) const
  434. {
  435. return !(b < *this);
  436. }
  437. template<unsigned int C2>
  438. inline bool operator>=(const Buffer<C2> &b) const
  439. {
  440. return !(*this < b);
  441. }
  442. private:
  443. char ZT_VAR_MAY_ALIAS _b[C];
  444. unsigned int _l;
  445. };
  446. } // namespace ZeroTier
  447. #endif