Utils.hpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541
  1. /*
  2. * ZeroTier One - Global Peer to Peer Ethernet
  3. * Copyright (C) 2012-2013 ZeroTier Networks LLC
  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. * ZeroTier may be used and distributed under the terms of the GPLv3, which
  21. * are available at: http://www.gnu.org/licenses/gpl-3.0.html
  22. *
  23. * If you would like to embed ZeroTier into a commercial application or
  24. * redistribute it in a modified binary form, please contact ZeroTier Networks
  25. * LLC. Start here: http://www.zerotier.com/
  26. */
  27. #ifndef _ZT_UTILS_HPP
  28. #define _ZT_UTILS_HPP
  29. #include <stdio.h>
  30. #include <stdlib.h>
  31. #include <stdint.h>
  32. #include <time.h>
  33. #include <sys/time.h>
  34. #include <arpa/inet.h>
  35. #include <string>
  36. #include <stdexcept>
  37. #include <vector>
  38. #include "../ext/lz4/lz4.h"
  39. #include "../ext/lz4/lz4hc.h"
  40. #include "../ext/huffandpuff/huffman.h"
  41. #include "Constants.hpp"
  42. /**
  43. * Maximum compression/decompression block size (do not change)
  44. */
  45. #define ZT_COMPRESSION_BLOCK_SIZE 16777216
  46. namespace ZeroTier {
  47. /**
  48. * Miscellaneous utility functions and global constants
  49. */
  50. class Utils
  51. {
  52. public:
  53. /**
  54. * @param data Data to convert to hex
  55. * @param len Length of data
  56. * @return Hexadecimal string
  57. */
  58. static std::string hex(const void *data,unsigned int len);
  59. static inline std::string hex(const std::string &data) { return hex(data.data(),data.length()); }
  60. /**
  61. * @param hex Hexadecimal ASCII code (non-hex chars are ignored)
  62. * @return Binary data
  63. */
  64. static std::string unhex(const char *hex);
  65. static inline std::string unhex(const std::string &hex) { return unhex(hex.c_str()); }
  66. /**
  67. * @param hex Hexadecimal ASCII
  68. * @param buf Buffer to fill
  69. * @param len Length of buffer
  70. * @return Number of characters actually written
  71. */
  72. static unsigned int unhex(const char *hex,void *buf,unsigned int len);
  73. /**
  74. * @param buf Buffer to fill
  75. * @param bytes Number of random bytes to generate
  76. */
  77. static void getSecureRandom(void *buf,unsigned int bytes);
  78. /**
  79. * Set modes on a file to something secure
  80. *
  81. * This locks a file so that only the owner can access it. What it actually
  82. * does varies by platform.
  83. *
  84. * @param path Path to lock
  85. * @param isDir True if this is a directory
  86. */
  87. static void lockDownFile(const char *path,bool isDir);
  88. /**
  89. * Get file last modification time
  90. *
  91. * Resolution is often only second, not millisecond, but the return is
  92. * always in ms for comparison against now().
  93. *
  94. * @param path Path to file to get time
  95. * @return Last modification time in ms since epoch or 0 if not found
  96. */
  97. static uint64_t getLastModified(const char *path);
  98. /**
  99. * @param t64 Time in ms since epoch
  100. * @return RFC1123 date string
  101. */
  102. static std::string toRfc1123(uint64_t t64);
  103. /**
  104. * @param tstr Time in RFC1123 string format
  105. * @return Time in ms since epoch
  106. */
  107. static uint64_t fromRfc1123(const char *tstr);
  108. static inline uint64_t fromRfc1123(const std::string &tstr) { return fromRfc1123(tstr.c_str()); }
  109. /**
  110. * String append output function object for use with compress/decompress
  111. */
  112. class StringAppendOutput
  113. {
  114. public:
  115. StringAppendOutput(std::string &s) : _s(s) {}
  116. inline void operator()(const void *data,unsigned int len) { _s.append((const char *)data,len); }
  117. private:
  118. std::string &_s;
  119. };
  120. /**
  121. * STDIO FILE append output function object for compress/decompress
  122. *
  123. * Throws std::runtime_error on write error.
  124. */
  125. class FILEAppendOutput
  126. {
  127. public:
  128. FILEAppendOutput(FILE *f) : _f(f) {}
  129. inline void operator()(const void *data,unsigned int len)
  130. throw(std::runtime_error)
  131. {
  132. if ((int)fwrite(data,1,len,_f) != (int)len)
  133. throw std::runtime_error("write failed");
  134. }
  135. private:
  136. FILE *_f;
  137. };
  138. /**
  139. * Compress data
  140. *
  141. * O must be a function or function object that takes the following
  142. * arguments: (const void *data,unsigned int len)
  143. *
  144. * @param in Input iterator that reads bytes (char, uint8_t, etc.)
  145. * @param out Output iterator that writes bytes
  146. */
  147. template<typename I,typename O>
  148. static inline void compress(I begin,I end,O out)
  149. {
  150. char huffheap[HUFFHEAP_SIZE];
  151. unsigned int bufLen = LZ4_compressBound(ZT_COMPRESSION_BLOCK_SIZE);
  152. char *buf = new char[bufLen * 2];
  153. char *buf2 = buf + bufLen;
  154. try {
  155. I inp(begin);
  156. for(;;) {
  157. unsigned int readLen = 0;
  158. while ((readLen < ZT_COMPRESSION_BLOCK_SIZE)&&(inp != end)) {
  159. buf[readLen++] = (char)*inp;
  160. ++inp;
  161. }
  162. if (!readLen)
  163. break;
  164. uint32_t l = hton((uint32_t)readLen);
  165. out((const void *)&l,4); // original size
  166. if (readLen < 32) { // don't bother compressing itty bitty blocks
  167. l = 0; // stored
  168. out((const void *)&l,4);
  169. out((const void *)buf,readLen);
  170. continue;
  171. }
  172. int lz4CompressedLen = LZ4_compressHC(buf,buf2,(int)readLen);
  173. if ((lz4CompressedLen <= 0)||(lz4CompressedLen >= (int)readLen)) {
  174. l = 0; // stored
  175. out((const void *)&l,4);
  176. out((const void *)buf,readLen);
  177. continue;
  178. }
  179. unsigned long huffCompressedLen = huffman_compress((const unsigned char *)buf2,lz4CompressedLen,(unsigned char *)buf,bufLen,huffheap);
  180. if ((!huffCompressedLen)||((int)huffCompressedLen >= lz4CompressedLen)) {
  181. l = hton((uint32_t)lz4CompressedLen); // lz4 only
  182. out((const void *)&l,4);
  183. out((const void *)buf2,(unsigned int)lz4CompressedLen);
  184. } else {
  185. l = hton((uint32_t)0x80000000 | (uint32_t)huffCompressedLen); // lz4 with huffman
  186. out((const void *)&l,4);
  187. out((const void *)buf,(unsigned int)huffCompressedLen);
  188. }
  189. }
  190. delete [] buf;
  191. } catch ( ... ) {
  192. delete [] buf;
  193. throw;
  194. }
  195. }
  196. /**
  197. * Decompress data
  198. *
  199. * O must be a function or function object that takes the following
  200. * arguments: (const void *data,unsigned int len)
  201. *
  202. * @param in Input iterator that reads bytes (char, uint8_t, etc.)
  203. * @param out Output iterator that writes bytes
  204. * @return False on decompression error
  205. */
  206. template<typename I,typename O>
  207. static inline bool decompress(I begin,I end,O out)
  208. {
  209. char huffheap[HUFFHEAP_SIZE];
  210. volatile char i32c[4];
  211. void *const i32cp = (void *)i32c;
  212. unsigned int bufLen = LZ4_compressBound(ZT_COMPRESSION_BLOCK_SIZE);
  213. char *buf = new char[bufLen * 2];
  214. char *buf2 = buf + bufLen;
  215. try {
  216. I inp(begin);
  217. while (inp != end) {
  218. i32c[0] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  219. i32c[1] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  220. i32c[2] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  221. i32c[3] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  222. unsigned int originalSize = ntoh(*((const uint32_t *)i32cp));
  223. i32c[0] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  224. i32c[1] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  225. i32c[2] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  226. i32c[3] = (char)*inp; if (++inp == end) { delete [] buf; return false; }
  227. uint32_t _compressedSize = ntoh(*((const uint32_t *)i32cp));
  228. unsigned int compressedSize = _compressedSize & 0x7fffffff;
  229. if (compressedSize) {
  230. if (compressedSize > bufLen) {
  231. delete [] buf;
  232. return false;
  233. }
  234. unsigned int readLen = 0;
  235. while ((readLen < compressedSize)&&(inp != end)) {
  236. buf[readLen++] = (char)*inp;
  237. ++inp;
  238. }
  239. if (readLen != compressedSize) {
  240. delete [] buf;
  241. return false;
  242. }
  243. if ((_compressedSize & 0x80000000)) { // lz4 and huffman
  244. unsigned long lz4CompressedSize = huffman_decompress((const unsigned char *)buf,compressedSize,(unsigned char *)buf2,bufLen,huffheap);
  245. if (lz4CompressedSize) {
  246. if (LZ4_uncompress_unknownOutputSize(buf2,buf,lz4CompressedSize,bufLen) != (int)originalSize) {
  247. delete [] buf;
  248. return false;
  249. } else out((const void *)buf,(unsigned int)originalSize);
  250. } else {
  251. delete [] buf;
  252. return false;
  253. }
  254. } else { // lz4 only
  255. if (LZ4_uncompress_unknownOutputSize(buf,buf2,compressedSize,bufLen) != (int)originalSize) {
  256. delete [] buf;
  257. return false;
  258. } else out((const void *)buf2,(unsigned int)originalSize);
  259. }
  260. } else { // stored
  261. if (originalSize > bufLen) {
  262. delete [] buf;
  263. return false;
  264. }
  265. unsigned int readLen = 0;
  266. while ((readLen < originalSize)&&(inp != end)) {
  267. buf[readLen++] = (char)*inp;
  268. ++inp;
  269. }
  270. if (readLen != originalSize) {
  271. delete [] buf;
  272. return false;
  273. }
  274. out((const void *)buf,(unsigned int)originalSize);
  275. }
  276. }
  277. delete [] buf;
  278. return true;
  279. } catch ( ... ) {
  280. delete [] buf;
  281. throw;
  282. }
  283. }
  284. /**
  285. * @return Current time in milliseconds since epoch
  286. */
  287. static inline uint64_t now()
  288. throw()
  289. {
  290. struct timeval tv;
  291. gettimeofday(&tv,(struct timezone *)0);
  292. return ( (1000ULL * (uint64_t)tv.tv_sec) + (uint64_t)(tv.tv_usec / 1000) );
  293. };
  294. /**
  295. * Read the full contents of a file into a string buffer
  296. *
  297. * The buffer isn't cleared, so if it already contains data the file's data will
  298. * be appended.
  299. *
  300. * @param path Path of file to read
  301. * @param buf Buffer to fill
  302. * @return True if open and read successful
  303. */
  304. static bool readFile(const char *path,std::string &buf);
  305. /**
  306. * Write a block of data to disk, replacing any current file contents
  307. *
  308. * @param path Path to write
  309. * @param buf Buffer containing data
  310. * @param len Length of buffer
  311. * @return True if entire file was successfully written
  312. */
  313. static bool writeFile(const char *path,const void *buf,unsigned int len);
  314. /**
  315. * Write a block of data to disk, replacing any current file contents
  316. *
  317. * @param path Path to write
  318. * @param s Data to write
  319. * @return True if entire file was successfully written
  320. */
  321. static inline bool writeFile(const char *path,const std::string &s)
  322. {
  323. return writeFile(path,s.data(),s.length());
  324. }
  325. /**
  326. * @param data Binary data to encode
  327. * @param len Length of data
  328. * @return Base64-encoded string
  329. */
  330. static std::string base64Encode(const void *data,unsigned int len);
  331. inline static std::string base64Encode(const std::string &data) { return base64Encode(data.data(),data.length()); }
  332. /**
  333. * @param data Base64-encoded string
  334. * @param len Length of encoded string
  335. * @return Decoded binary date
  336. */
  337. static std::string base64Decode(const char *data,unsigned int len);
  338. inline static std::string base64Decode(const std::string &data) { return base64Decode(data.data(),data.length()); }
  339. /**
  340. * Split a string by delimiter, with optional escape and quote characters
  341. *
  342. * @param s String to split
  343. * @param sep One or more separators
  344. * @param esc Zero or more escape characters
  345. * @param quot Zero or more quote characters
  346. * @return Vector of tokens
  347. */
  348. static std::vector<std::string> split(const char *s,const char *const sep,const char *esc,const char *quot);
  349. /**
  350. * Trim whitespace from the start and end of a string
  351. *
  352. * @param s String to trim
  353. * @return Trimmed string
  354. */
  355. static std::string trim(const std::string &s);
  356. /**
  357. * Count the number of bits set in an integer
  358. *
  359. * @param v 32-bit integer
  360. * @return Number of bits set in this integer (0-32)
  361. */
  362. static inline uint32_t countBits(uint32_t v)
  363. throw()
  364. {
  365. v = v - ((v >> 1) & (uint32_t)0x55555555);
  366. v = (v & (uint32_t)0x33333333) + ((v >> 2) & (uint32_t)0x33333333);
  367. return ((((v + (v >> 4)) & (uint32_t)0xF0F0F0F) * (uint32_t)0x1010101) >> 24);
  368. }
  369. /**
  370. * Check if a memory buffer is all-zero
  371. *
  372. * @param p Memory to scan
  373. * @param len Length of memory
  374. * @return True if memory is all zero
  375. */
  376. static inline bool isZero(const void *p,unsigned int len)
  377. throw()
  378. {
  379. for(unsigned int i=0;i<len;++i) {
  380. if (((const unsigned char *)p)[i])
  381. return false;
  382. }
  383. return true;
  384. }
  385. /**
  386. * Match two strings with bits masked netmask-style
  387. *
  388. * @param a First string
  389. * @param abits Number of bits in first string
  390. * @param b Second string
  391. * @param bbits Number of bits in second string
  392. * @return True if min(abits,bbits) match between a and b
  393. */
  394. static inline bool matchNetmask(const void *a,unsigned int abits,const void *b,unsigned int bbits)
  395. throw()
  396. {
  397. const unsigned char *aptr = (const unsigned char *)a;
  398. const unsigned char *bptr = (const unsigned char *)b;
  399. while ((abits >= 8)&&(bbits >= 8)) {
  400. if (*aptr++ != *bptr++)
  401. return false;
  402. abits -= 8;
  403. bbits -= 8;
  404. }
  405. unsigned char mask = 0xff << (8 - ((abits > bbits) ? bbits : abits));
  406. return ((*aptr & mask) == (*aptr & mask));
  407. }
  408. /**
  409. * Compute CRC64
  410. *
  411. * @param crc Previous CRC (0 to start)
  412. * @param s String to add to crc
  413. * @param l Length of string in bytes
  414. * @return New CRC
  415. */
  416. static inline uint64_t crc64(uint64_t crc,const void *s,unsigned int l)
  417. throw()
  418. {
  419. for(unsigned int i=0;i<l;++i)
  420. crc = crc64Table[(uint8_t)crc ^ ((const uint8_t *)s)[i]] ^ (crc >> 8);
  421. return crc;
  422. }
  423. static inline uint8_t hton(uint8_t n) throw() { return n; }
  424. static inline int8_t hton(int8_t n) throw() { return n; }
  425. static inline uint16_t hton(uint16_t n) throw() { return htons(n); }
  426. static inline int16_t hton(int16_t n) throw() { return (int16_t)htons((uint16_t)n); }
  427. static inline uint32_t hton(uint32_t n) throw() { return htonl(n); }
  428. static inline int32_t hton(int32_t n) throw() { return (int32_t)htonl((uint32_t)n); }
  429. static inline uint64_t hton(uint64_t n)
  430. throw()
  431. {
  432. #if __BYTE_ORDER == __LITTLE_ENDIAN
  433. #ifdef __GNUC__
  434. return __builtin_bswap64(n);
  435. #else
  436. return (
  437. ((n & 0x00000000000000FFULL) << 56) |
  438. ((n & 0x000000000000FF00ULL) << 40) |
  439. ((n & 0x0000000000FF0000ULL) << 24) |
  440. ((n & 0x00000000FF000000ULL) << 8) |
  441. ((n & 0x000000FF00000000ULL) >> 8) |
  442. ((n & 0x0000FF0000000000ULL) >> 24) |
  443. ((n & 0x00FF000000000000ULL) >> 40) |
  444. ((n & 0xFF00000000000000ULL) >> 56)
  445. );
  446. #endif
  447. #else
  448. return n;
  449. #endif
  450. }
  451. static inline int64_t hton(int64_t n) throw() { return (int64_t)hton((uint64_t)n); }
  452. static inline uint8_t ntoh(uint8_t n) throw() { return n; }
  453. static inline int8_t ntoh(int8_t n) throw() { return n; }
  454. static inline uint16_t ntoh(uint16_t n) throw() { return ntohs(n); }
  455. static inline int16_t ntoh(int16_t n) throw() { return (int16_t)ntohs((uint16_t)n); }
  456. static inline uint32_t ntoh(uint32_t n) throw() { return ntohl(n); }
  457. static inline int32_t ntoh(int32_t n) throw() { return (int32_t)ntohl((uint32_t)n); }
  458. static inline uint64_t ntoh(uint64_t n)
  459. throw()
  460. {
  461. #if __BYTE_ORDER == __LITTLE_ENDIAN
  462. #ifdef __GNUC__
  463. return __builtin_bswap64(n);
  464. #else
  465. return (
  466. ((n & 0x00000000000000FFULL) << 56) |
  467. ((n & 0x000000000000FF00ULL) << 40) |
  468. ((n & 0x0000000000FF0000ULL) << 24) |
  469. ((n & 0x00000000FF000000ULL) << 8) |
  470. ((n & 0x000000FF00000000ULL) >> 8) |
  471. ((n & 0x0000FF0000000000ULL) >> 24) |
  472. ((n & 0x00FF000000000000ULL) >> 40) |
  473. ((n & 0xFF00000000000000ULL) >> 56)
  474. );
  475. #endif
  476. #else
  477. return n;
  478. #endif
  479. }
  480. static inline int64_t ntoh(int64_t n) throw() { return (int64_t)ntoh((uint64_t)n); }
  481. /**
  482. * Hexadecimal characters 0-f
  483. */
  484. static const char HEXCHARS[16];
  485. private:
  486. static const uint64_t crc64Table[256];
  487. static const char base64EncMap[64];
  488. static const char base64DecMap[128];
  489. };
  490. } // namespace ZeroTier
  491. #endif