Utils.cpp 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656
  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. #include <stdio.h>
  28. #include <string.h>
  29. #include <stdlib.h>
  30. #include <stdarg.h>
  31. #include <sys/stat.h>
  32. #include "Constants.hpp"
  33. #ifdef __UNIX_LIKE__
  34. #include <unistd.h>
  35. #include <errno.h>
  36. #include <fcntl.h>
  37. #include <sys/types.h>
  38. #include <sys/uio.h>
  39. #include <dirent.h>
  40. #endif
  41. #include "Utils.hpp"
  42. #include "Mutex.hpp"
  43. #include "Salsa20.hpp"
  44. namespace ZeroTier {
  45. const char Utils::HEXCHARS[16] = { '0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f' };
  46. const uint64_t Utils::crc64Table[256] = {
  47. 0x0000000000000000ULL,0x7ad870c830358979ULL,
  48. 0xf5b0e190606b12f2ULL,0x8f689158505e9b8bULL,
  49. 0xc038e5739841b68fULL,0xbae095bba8743ff6ULL,
  50. 0x358804e3f82aa47dULL,0x4f50742bc81f2d04ULL,
  51. 0xab28ecb46814fe75ULL,0xd1f09c7c5821770cULL,
  52. 0x5e980d24087fec87ULL,0x24407dec384a65feULL,
  53. 0x6b1009c7f05548faULL,0x11c8790fc060c183ULL,
  54. 0x9ea0e857903e5a08ULL,0xe478989fa00bd371ULL,
  55. 0x7d08ff3b88be6f81ULL,0x07d08ff3b88be6f8ULL,
  56. 0x88b81eabe8d57d73ULL,0xf2606e63d8e0f40aULL,
  57. 0xbd301a4810ffd90eULL,0xc7e86a8020ca5077ULL,
  58. 0x4880fbd87094cbfcULL,0x32588b1040a14285ULL,
  59. 0xd620138fe0aa91f4ULL,0xacf86347d09f188dULL,
  60. 0x2390f21f80c18306ULL,0x594882d7b0f40a7fULL,
  61. 0x1618f6fc78eb277bULL,0x6cc0863448deae02ULL,
  62. 0xe3a8176c18803589ULL,0x997067a428b5bcf0ULL,
  63. 0xfa11fe77117cdf02ULL,0x80c98ebf2149567bULL,
  64. 0x0fa11fe77117cdf0ULL,0x75796f2f41224489ULL,
  65. 0x3a291b04893d698dULL,0x40f16bccb908e0f4ULL,
  66. 0xcf99fa94e9567b7fULL,0xb5418a5cd963f206ULL,
  67. 0x513912c379682177ULL,0x2be1620b495da80eULL,
  68. 0xa489f35319033385ULL,0xde51839b2936bafcULL,
  69. 0x9101f7b0e12997f8ULL,0xebd98778d11c1e81ULL,
  70. 0x64b116208142850aULL,0x1e6966e8b1770c73ULL,
  71. 0x8719014c99c2b083ULL,0xfdc17184a9f739faULL,
  72. 0x72a9e0dcf9a9a271ULL,0x08719014c99c2b08ULL,
  73. 0x4721e43f0183060cULL,0x3df994f731b68f75ULL,
  74. 0xb29105af61e814feULL,0xc849756751dd9d87ULL,
  75. 0x2c31edf8f1d64ef6ULL,0x56e99d30c1e3c78fULL,
  76. 0xd9810c6891bd5c04ULL,0xa3597ca0a188d57dULL,
  77. 0xec09088b6997f879ULL,0x96d1784359a27100ULL,
  78. 0x19b9e91b09fcea8bULL,0x636199d339c963f2ULL,
  79. 0xdf7adabd7a6e2d6fULL,0xa5a2aa754a5ba416ULL,
  80. 0x2aca3b2d1a053f9dULL,0x50124be52a30b6e4ULL,
  81. 0x1f423fcee22f9be0ULL,0x659a4f06d21a1299ULL,
  82. 0xeaf2de5e82448912ULL,0x902aae96b271006bULL,
  83. 0x74523609127ad31aULL,0x0e8a46c1224f5a63ULL,
  84. 0x81e2d7997211c1e8ULL,0xfb3aa75142244891ULL,
  85. 0xb46ad37a8a3b6595ULL,0xceb2a3b2ba0eececULL,
  86. 0x41da32eaea507767ULL,0x3b024222da65fe1eULL,
  87. 0xa2722586f2d042eeULL,0xd8aa554ec2e5cb97ULL,
  88. 0x57c2c41692bb501cULL,0x2d1ab4dea28ed965ULL,
  89. 0x624ac0f56a91f461ULL,0x1892b03d5aa47d18ULL,
  90. 0x97fa21650afae693ULL,0xed2251ad3acf6feaULL,
  91. 0x095ac9329ac4bc9bULL,0x7382b9faaaf135e2ULL,
  92. 0xfcea28a2faafae69ULL,0x8632586aca9a2710ULL,
  93. 0xc9622c4102850a14ULL,0xb3ba5c8932b0836dULL,
  94. 0x3cd2cdd162ee18e6ULL,0x460abd1952db919fULL,
  95. 0x256b24ca6b12f26dULL,0x5fb354025b277b14ULL,
  96. 0xd0dbc55a0b79e09fULL,0xaa03b5923b4c69e6ULL,
  97. 0xe553c1b9f35344e2ULL,0x9f8bb171c366cd9bULL,
  98. 0x10e3202993385610ULL,0x6a3b50e1a30ddf69ULL,
  99. 0x8e43c87e03060c18ULL,0xf49bb8b633338561ULL,
  100. 0x7bf329ee636d1eeaULL,0x012b592653589793ULL,
  101. 0x4e7b2d0d9b47ba97ULL,0x34a35dc5ab7233eeULL,
  102. 0xbbcbcc9dfb2ca865ULL,0xc113bc55cb19211cULL,
  103. 0x5863dbf1e3ac9decULL,0x22bbab39d3991495ULL,
  104. 0xadd33a6183c78f1eULL,0xd70b4aa9b3f20667ULL,
  105. 0x985b3e827bed2b63ULL,0xe2834e4a4bd8a21aULL,
  106. 0x6debdf121b863991ULL,0x1733afda2bb3b0e8ULL,
  107. 0xf34b37458bb86399ULL,0x8993478dbb8deae0ULL,
  108. 0x06fbd6d5ebd3716bULL,0x7c23a61ddbe6f812ULL,
  109. 0x3373d23613f9d516ULL,0x49aba2fe23cc5c6fULL,
  110. 0xc6c333a67392c7e4ULL,0xbc1b436e43a74e9dULL,
  111. 0x95ac9329ac4bc9b5ULL,0xef74e3e19c7e40ccULL,
  112. 0x601c72b9cc20db47ULL,0x1ac40271fc15523eULL,
  113. 0x5594765a340a7f3aULL,0x2f4c0692043ff643ULL,
  114. 0xa02497ca54616dc8ULL,0xdafce7026454e4b1ULL,
  115. 0x3e847f9dc45f37c0ULL,0x445c0f55f46abeb9ULL,
  116. 0xcb349e0da4342532ULL,0xb1eceec59401ac4bULL,
  117. 0xfebc9aee5c1e814fULL,0x8464ea266c2b0836ULL,
  118. 0x0b0c7b7e3c7593bdULL,0x71d40bb60c401ac4ULL,
  119. 0xe8a46c1224f5a634ULL,0x927c1cda14c02f4dULL,
  120. 0x1d148d82449eb4c6ULL,0x67ccfd4a74ab3dbfULL,
  121. 0x289c8961bcb410bbULL,0x5244f9a98c8199c2ULL,
  122. 0xdd2c68f1dcdf0249ULL,0xa7f41839ecea8b30ULL,
  123. 0x438c80a64ce15841ULL,0x3954f06e7cd4d138ULL,
  124. 0xb63c61362c8a4ab3ULL,0xcce411fe1cbfc3caULL,
  125. 0x83b465d5d4a0eeceULL,0xf96c151de49567b7ULL,
  126. 0x76048445b4cbfc3cULL,0x0cdcf48d84fe7545ULL,
  127. 0x6fbd6d5ebd3716b7ULL,0x15651d968d029fceULL,
  128. 0x9a0d8ccedd5c0445ULL,0xe0d5fc06ed698d3cULL,
  129. 0xaf85882d2576a038ULL,0xd55df8e515432941ULL,
  130. 0x5a3569bd451db2caULL,0x20ed197575283bb3ULL,
  131. 0xc49581ead523e8c2ULL,0xbe4df122e51661bbULL,
  132. 0x3125607ab548fa30ULL,0x4bfd10b2857d7349ULL,
  133. 0x04ad64994d625e4dULL,0x7e7514517d57d734ULL,
  134. 0xf11d85092d094cbfULL,0x8bc5f5c11d3cc5c6ULL,
  135. 0x12b5926535897936ULL,0x686de2ad05bcf04fULL,
  136. 0xe70573f555e26bc4ULL,0x9ddd033d65d7e2bdULL,
  137. 0xd28d7716adc8cfb9ULL,0xa85507de9dfd46c0ULL,
  138. 0x273d9686cda3dd4bULL,0x5de5e64efd965432ULL,
  139. 0xb99d7ed15d9d8743ULL,0xc3450e196da80e3aULL,
  140. 0x4c2d9f413df695b1ULL,0x36f5ef890dc31cc8ULL,
  141. 0x79a59ba2c5dc31ccULL,0x037deb6af5e9b8b5ULL,
  142. 0x8c157a32a5b7233eULL,0xf6cd0afa9582aa47ULL,
  143. 0x4ad64994d625e4daULL,0x300e395ce6106da3ULL,
  144. 0xbf66a804b64ef628ULL,0xc5bed8cc867b7f51ULL,
  145. 0x8aeeace74e645255ULL,0xf036dc2f7e51db2cULL,
  146. 0x7f5e4d772e0f40a7ULL,0x05863dbf1e3ac9deULL,
  147. 0xe1fea520be311aafULL,0x9b26d5e88e0493d6ULL,
  148. 0x144e44b0de5a085dULL,0x6e963478ee6f8124ULL,
  149. 0x21c640532670ac20ULL,0x5b1e309b16452559ULL,
  150. 0xd476a1c3461bbed2ULL,0xaeaed10b762e37abULL,
  151. 0x37deb6af5e9b8b5bULL,0x4d06c6676eae0222ULL,
  152. 0xc26e573f3ef099a9ULL,0xb8b627f70ec510d0ULL,
  153. 0xf7e653dcc6da3dd4ULL,0x8d3e2314f6efb4adULL,
  154. 0x0256b24ca6b12f26ULL,0x788ec2849684a65fULL,
  155. 0x9cf65a1b368f752eULL,0xe62e2ad306bafc57ULL,
  156. 0x6946bb8b56e467dcULL,0x139ecb4366d1eea5ULL,
  157. 0x5ccebf68aecec3a1ULL,0x2616cfa09efb4ad8ULL,
  158. 0xa97e5ef8cea5d153ULL,0xd3a62e30fe90582aULL,
  159. 0xb0c7b7e3c7593bd8ULL,0xca1fc72bf76cb2a1ULL,
  160. 0x45775673a732292aULL,0x3faf26bb9707a053ULL,
  161. 0x70ff52905f188d57ULL,0x0a2722586f2d042eULL,
  162. 0x854fb3003f739fa5ULL,0xff97c3c80f4616dcULL,
  163. 0x1bef5b57af4dc5adULL,0x61372b9f9f784cd4ULL,
  164. 0xee5fbac7cf26d75fULL,0x9487ca0fff135e26ULL,
  165. 0xdbd7be24370c7322ULL,0xa10fceec0739fa5bULL,
  166. 0x2e675fb4576761d0ULL,0x54bf2f7c6752e8a9ULL,
  167. 0xcdcf48d84fe75459ULL,0xb71738107fd2dd20ULL,
  168. 0x387fa9482f8c46abULL,0x42a7d9801fb9cfd2ULL,
  169. 0x0df7adabd7a6e2d6ULL,0x772fdd63e7936bafULL,
  170. 0xf8474c3bb7cdf024ULL,0x829f3cf387f8795dULL,
  171. 0x66e7a46c27f3aa2cULL,0x1c3fd4a417c62355ULL,
  172. 0x935745fc4798b8deULL,0xe98f353477ad31a7ULL,
  173. 0xa6df411fbfb21ca3ULL,0xdc0731d78f8795daULL,
  174. 0x536fa08fdfd90e51ULL,0x29b7d047efec8728ULL
  175. };
  176. const char Utils::base64EncMap[64] = {
  177. 0x41,0x42,0x43,0x44,0x45,0x46,0x47,0x48,
  178. 0x49,0x4A,0x4B,0x4C,0x4D,0x4E,0x4F,0x50,
  179. 0x51,0x52,0x53,0x54,0x55,0x56,0x57,0x58,
  180. 0x59,0x5A,0x61,0x62,0x63,0x64,0x65,0x66,
  181. 0x67,0x68,0x69,0x6A,0x6B,0x6C,0x6D,0x6E,
  182. 0x6F,0x70,0x71,0x72,0x73,0x74,0x75,0x76,
  183. 0x77,0x78,0x79,0x7A,0x30,0x31,0x32,0x33,
  184. 0x34,0x35,0x36,0x37,0x38,0x39,0x2B,0x2F
  185. };
  186. const char Utils::base64DecMap[128] = {
  187. 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
  188. 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
  189. 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
  190. 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
  191. 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
  192. 0x00,0x00,0x00,0x3E,0x00,0x00,0x00,0x3F,
  193. 0x34,0x35,0x36,0x37,0x38,0x39,0x3A,0x3B,
  194. 0x3C,0x3D,0x00,0x00,0x00,0x00,0x00,0x00,
  195. 0x00,0x00,0x01,0x02,0x03,0x04,0x05,0x06,
  196. 0x07,0x08,0x09,0x0A,0x0B,0x0C,0x0D,0x0E,
  197. 0x0F,0x10,0x11,0x12,0x13,0x14,0x15,0x16,
  198. 0x17,0x18,0x19,0x00,0x00,0x00,0x00,0x00,
  199. 0x00,0x1A,0x1B,0x1C,0x1D,0x1E,0x1F,0x20,
  200. 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,
  201. 0x29,0x2A,0x2B,0x2C,0x2D,0x2E,0x2F,0x30,
  202. 0x31,0x32,0x33,0x00,0x00,0x00,0x00,0x00
  203. };
  204. static const char *DAY_NAMES[7] = { "Sun","Mon","Tue","Wed","Thu","Fri","Sat" };
  205. static const char *MONTH_NAMES[12] = { "Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec" };
  206. std::map<std::string,bool> Utils::listDirectory(const char *path)
  207. {
  208. std::map<std::string,bool> r;
  209. #ifdef __WINDOWS__
  210. HANDLE hFind;
  211. WIN32_FIND_DATAA ffd;
  212. if ((hFind = FindFirstFileA((std::string(path) + "\\*").c_str(),&ffd)) != INVALID_HANDLE_VALUE) {
  213. do {
  214. r[std::string(ffd.cFileName)] = ((ffd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) != 0);
  215. } while (FindNextFileA(hFind,&ffd));
  216. FindClose(hFind);
  217. }
  218. #else
  219. struct dirent de;
  220. struct dirent *dptr;
  221. DIR *d = opendir(path);
  222. if (!d)
  223. return r;
  224. dptr = (struct dirent *)0;
  225. for(;;) {
  226. if (readdir_r(d,&de,&dptr))
  227. break;
  228. if (dptr) {
  229. if ((strcmp(dptr->d_name,"."))&&(strcmp(dptr->d_name,"..")))
  230. r[std::string(dptr->d_name)] = (dptr->d_type == DT_DIR);
  231. } else break;
  232. }
  233. #endif
  234. return r;
  235. }
  236. std::string Utils::base64Encode(const void *data,unsigned int len)
  237. {
  238. if (!len)
  239. return std::string();
  240. std::string out;
  241. unsigned int sidx = 0;
  242. if (len > 1) {
  243. while (sidx < (len - 2)) {
  244. out.push_back(base64EncMap[(((const unsigned char *)data)[sidx] >> 2) & 077]);
  245. out.push_back(base64EncMap[((((const unsigned char *)data)[sidx + 1] >> 4) & 017) | ((((const unsigned char *)data)[sidx] << 4) & 077)]);
  246. out.push_back(base64EncMap[((((const unsigned char *)data)[sidx + 2] >> 6) & 003) | ((((const unsigned char *)data)[sidx + 1] << 2) & 077)]);
  247. out.push_back(base64EncMap[((const unsigned char *)data)[sidx + 2] & 077]);
  248. sidx += 3;
  249. }
  250. }
  251. if (sidx < len) {
  252. out.push_back(base64EncMap[(((const unsigned char *)data)[sidx] >> 2) & 077]);
  253. if (sidx < len - 1) {
  254. out.push_back(base64EncMap[((((const unsigned char *)data)[sidx + 1] >> 4) & 017) | ((((const unsigned char *)data)[sidx] << 4) & 077)]);
  255. out.push_back(base64EncMap[(((const unsigned char *)data)[sidx + 1] << 2) & 077]);
  256. } else out.push_back(base64EncMap[(((const unsigned char *)data)[sidx] << 4) & 077]);
  257. }
  258. while (out.length() < (((len + 2) / 3) * 4))
  259. out.push_back('=');
  260. return out;
  261. }
  262. std::string Utils::base64Decode(const char *data,unsigned int len)
  263. {
  264. if (!len)
  265. return std::string();
  266. std::string out;
  267. while ((len)&&(((const unsigned char *)data)[len-1] == '='))
  268. --len;
  269. for (unsigned idx=0;idx<len;idx++) {
  270. unsigned char ch = ((const unsigned char *)data)[idx];
  271. if ((ch > 47 && ch < 58) || (ch > 64 && ch < 91) || (ch > 96 && ch < 123) || ch == '+' || ch == '/' || ch == '=')
  272. out.push_back(base64DecMap[ch]);
  273. else return std::string();
  274. }
  275. unsigned outLen = len - ((len + 3) / 4);
  276. if ((!outLen)||((((outLen + 2) / 3) * 4) < len))
  277. return std::string();
  278. unsigned sidx = 0;
  279. unsigned didx = 0;
  280. if (outLen > 1) {
  281. while (didx < outLen - 2) {
  282. out[didx] = (((out[sidx] << 2) & 255) | ((out[sidx + 1] >> 4) & 003));
  283. out[didx + 1] = (((out[sidx + 1] << 4) & 255) | ((out[sidx + 2] >> 2) & 017));
  284. out[didx + 2] = (((out[sidx + 2] << 6) & 255) | (out[sidx + 3] & 077));
  285. sidx += 4;
  286. didx += 3;
  287. }
  288. }
  289. if (didx < outLen)
  290. out[didx] = (((out[sidx] << 2) & 255) | ((out[sidx + 1] >> 4) & 003));
  291. if (++didx < outLen)
  292. out[didx] = (((out[sidx + 1] << 4) & 255) | ((out[sidx + 2] >> 2) & 017));
  293. return out.substr(0,outLen);
  294. }
  295. std::string Utils::hex(const void *data,unsigned int len)
  296. {
  297. std::string r;
  298. r.reserve(len * 2);
  299. for(unsigned int i=0;i<len;++i) {
  300. r.push_back(HEXCHARS[(((const unsigned char *)data)[i] & 0xf0) >> 4]);
  301. r.push_back(HEXCHARS[((const unsigned char *)data)[i] & 0x0f]);
  302. }
  303. return r;
  304. }
  305. std::string Utils::unhex(const char *hex)
  306. {
  307. int n = 1;
  308. unsigned char c,b = 0;
  309. std::string r;
  310. while ((c = (unsigned char)*(hex++))) {
  311. if ((c >= 48)&&(c <= 57)) { // 0..9
  312. if ((n ^= 1))
  313. r.push_back((char)(b | (c - 48)));
  314. else b = (c - 48) << 4;
  315. } else if ((c >= 65)&&(c <= 70)) { // A..F
  316. if ((n ^= 1))
  317. r.push_back((char)(b | (c - (65 - 10))));
  318. else b = (c - (65 - 10)) << 4;
  319. } else if ((c >= 97)&&(c <= 102)) { // a..f
  320. if ((n ^= 1))
  321. r.push_back((char)(b | (c - (97 - 10))));
  322. else b = (c - (97 - 10)) << 4;
  323. }
  324. }
  325. return r;
  326. }
  327. unsigned int Utils::unhex(const char *hex,void *buf,unsigned int len)
  328. {
  329. int n = 1;
  330. unsigned char c,b = 0;
  331. unsigned int l = 0;
  332. while ((c = (unsigned char)*(hex++))) {
  333. if ((c >= 48)&&(c <= 57)) { // 0..9
  334. if ((n ^= 1)) {
  335. if (l >= len) break;
  336. ((unsigned char *)buf)[l++] = (b | (c - 48));
  337. } else b = (c - 48) << 4;
  338. } else if ((c >= 65)&&(c <= 70)) { // A..F
  339. if ((n ^= 1)) {
  340. if (l >= len) break;
  341. ((unsigned char *)buf)[l++] = (b | (c - (65 - 10)));
  342. } else b = (c - (65 - 10)) << 4;
  343. } else if ((c >= 97)&&(c <= 102)) { // a..f
  344. if ((n ^= 1)) {
  345. if (l >= len) break;
  346. ((unsigned char *)buf)[l++] = (b | (c - (97 - 10)));
  347. } else b = (c - (97 - 10)) << 4;
  348. }
  349. }
  350. return l;
  351. }
  352. void Utils::getSecureRandom(void *buf,unsigned int bytes)
  353. {
  354. static Mutex randomLock;
  355. static char randbuf[32768];
  356. static unsigned int randptr = sizeof(randbuf);
  357. #ifdef __WINDOWS__
  358. static Salsa20 s20;
  359. volatile bool s20Initialized = false;
  360. #endif
  361. Mutex::Lock _l(randomLock);
  362. for(unsigned int i=0;i<bytes;++i) {
  363. if (randptr >= sizeof(randbuf)) {
  364. #ifdef __UNIX_LIKE__
  365. int fd = ::open("/dev/urandom",O_RDONLY);
  366. if (fd < 0) {
  367. fprintf(stderr,"FATAL ERROR: unable to open /dev/urandom: %s"ZT_EOL_S,strerror(errno));
  368. exit(-1);
  369. }
  370. if ((int)::read(fd,randbuf,sizeof(randbuf)) != (int)sizeof(randbuf)) {
  371. fprintf(stderr,"FATAL ERROR: unable to read from /dev/urandom"ZT_EOL_S);
  372. exit(-1);
  373. }
  374. ::close(fd);
  375. #else
  376. #ifdef __WINDOWS__
  377. if (!s20Initialized) {
  378. s20Initialized = true;
  379. char ktmp[32];
  380. char ivtmp[8];
  381. for(int i=0;i<32;++i) ktmp[i] = (char)rand();
  382. for(int i=0;i<8;++i) ivtmp[i] = (char)rand();
  383. double now = Utils::nowf();
  384. memcpy(ktmp,&now,sizeof(now));
  385. DWORD tmp = GetCurrentProcessId();
  386. memcpy(ktmp + sizeof(double),&tmp,sizeof(tmp));
  387. tmp = GetTickCount();
  388. memcpy(ktmp + sizeof(double) + sizeof(DWORD),&tmp,sizeof(tmp));
  389. s20.init(ktmp,256,ivtmp);
  390. for(int i=0;i<sizeof(randbuf);++i) randbuf[i] = (char)rand();
  391. }
  392. s20.encrypt(randbuf,randbuf,sizeof(randbuf));
  393. #else
  394. no getSecureRandom() implementation;
  395. #endif
  396. #endif
  397. randptr = 0;
  398. }
  399. ((char *)buf)[i] = randbuf[randptr++];
  400. }
  401. }
  402. void Utils::lockDownFile(const char *path,bool isDir)
  403. {
  404. #if defined(__APPLE__) || defined(__linux__) || defined(linux) || defined(__LINUX__) || defined(__linux)
  405. chmod(path,isDir ? 0700 : 0600);
  406. #else
  407. #ifdef _WIN32
  408. // TODO: windows ACL hell...
  409. #endif
  410. #endif
  411. }
  412. uint64_t Utils::getLastModified(const char *path)
  413. {
  414. struct stat s;
  415. if (stat(path,&s))
  416. return 0;
  417. return (((uint64_t)s.st_mtime) * 1000ULL);
  418. }
  419. std::string Utils::toRfc1123(uint64_t t64)
  420. {
  421. struct tm t;
  422. char buf[128];
  423. time_t utc = (time_t)(t64 / 1000ULL);
  424. #ifdef __WINDOWS__
  425. gmtime_s(&t,&utc);
  426. #else
  427. gmtime_r(&utc,&t);
  428. #endif
  429. sprintf(buf,"%3s, %02d %3s %4d %02d:%02d:%02d GMT",DAY_NAMES[t.tm_wday],t.tm_mday,MONTH_NAMES[t.tm_mon],t.tm_year + 1900,t.tm_hour,t.tm_min,t.tm_sec);
  430. return std::string(buf);
  431. }
  432. #ifdef __WINDOWS__
  433. static int is_leap(unsigned y) {
  434. y += 1900;
  435. return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
  436. }
  437. static time_t timegm(struct tm *tm) {
  438. static const unsigned ndays[2][12] = {
  439. {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
  440. {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}
  441. };
  442. time_t res = 0;
  443. int i;
  444. for (i = 70; i < tm->tm_year; ++i)
  445. res += is_leap(i) ? 366 : 365;
  446. for (i = 0; i < tm->tm_mon; ++i)
  447. res += ndays[is_leap(tm->tm_year)][i];
  448. res += tm->tm_mday - 1;
  449. res *= 24;
  450. res += tm->tm_hour;
  451. res *= 60;
  452. res += tm->tm_min;
  453. res *= 60;
  454. res += tm->tm_sec;
  455. return res;
  456. }
  457. #endif
  458. uint64_t Utils::fromRfc1123(const char *tstr)
  459. {
  460. struct tm t;
  461. char wdays[128],mons[128];
  462. int l = (int)strlen(tstr);
  463. if ((l < 29)||(l > 64))
  464. return 0;
  465. int assigned = sscanf(tstr,"%3s, %02d %3s %4d %02d:%02d:%02d GMT",wdays,&t.tm_mday,mons,&t.tm_year,&t.tm_hour,&t.tm_min,&t.tm_sec);
  466. if (assigned != 7)
  467. return 0;
  468. wdays[3] = '\0';
  469. for(t.tm_wday=0;t.tm_wday<7;++t.tm_wday) {
  470. #ifdef __WINDOWS__
  471. if (!_stricmp(DAY_NAMES[t.tm_wday],wdays))
  472. break;
  473. #else
  474. if (!strcasecmp(DAY_NAMES[t.tm_wday],wdays))
  475. break;
  476. #endif
  477. }
  478. if (t.tm_wday == 7)
  479. return 0;
  480. mons[3] = '\0';
  481. for(t.tm_mon=0;t.tm_mon<12;++t.tm_mon) {
  482. #ifdef __WINDOWS__
  483. if (!_stricmp(MONTH_NAMES[t.tm_mday],mons))
  484. break;
  485. #else
  486. if (!strcasecmp(MONTH_NAMES[t.tm_mday],mons))
  487. break;
  488. #endif
  489. }
  490. if (t.tm_mon == 12)
  491. return 0;
  492. t.tm_wday = 0; // ignored by timegm
  493. t.tm_yday = 0; // ignored by timegm
  494. t.tm_isdst = 0; // ignored by timegm
  495. time_t utc = timegm(&t);
  496. return ((utc > 0) ? (1000ULL * (uint64_t)utc) : 0ULL);
  497. }
  498. bool Utils::readFile(const char *path,std::string &buf)
  499. {
  500. char tmp[4096];
  501. FILE *f = fopen(path,"rb");
  502. if (f) {
  503. for(;;) {
  504. long n = (long)fread(tmp,1,sizeof(tmp),f);
  505. if (n > 0)
  506. buf.append(tmp,n);
  507. else break;
  508. }
  509. fclose(f);
  510. return true;
  511. }
  512. return false;
  513. }
  514. bool Utils::writeFile(const char *path,const void *buf,unsigned int len)
  515. {
  516. FILE *f = fopen(path,"wb");
  517. if (f) {
  518. if ((long)fwrite(buf,1,len,f) != (long)len) {
  519. fclose(f);
  520. return false;
  521. } else {
  522. fclose(f);
  523. return true;
  524. }
  525. }
  526. return false;
  527. }
  528. std::vector<std::string> Utils::split(const char *s,const char *const sep,const char *esc,const char *quot)
  529. {
  530. std::vector<std::string> fields;
  531. std::string buf;
  532. if (!esc)
  533. esc = "";
  534. if (!quot)
  535. quot = "";
  536. bool escapeState = false;
  537. char quoteState = 0;
  538. while (*s) {
  539. if (escapeState) {
  540. escapeState = false;
  541. buf.push_back(*s);
  542. } else if (quoteState) {
  543. if (*s == quoteState) {
  544. quoteState = 0;
  545. fields.push_back(buf);
  546. buf.clear();
  547. } else buf.push_back(*s);
  548. } else {
  549. const char *quotTmp;
  550. if (strchr(esc,*s))
  551. escapeState = true;
  552. else if ((buf.size() <= 0)&&((quotTmp = strchr(quot,*s))))
  553. quoteState = *quotTmp;
  554. else if (strchr(sep,*s)) {
  555. if (buf.size() > 0) {
  556. fields.push_back(buf);
  557. buf.clear();
  558. } // else skip runs of seperators
  559. } else buf.push_back(*s);
  560. }
  561. ++s;
  562. }
  563. if (buf.size())
  564. fields.push_back(buf);
  565. return fields;
  566. }
  567. std::string Utils::trim(const std::string &s)
  568. {
  569. unsigned long end = (unsigned long)s.length();
  570. while (end) {
  571. char c = s[end - 1];
  572. if ((c == ' ')||(c == '\r')||(c == '\n')||(!c)||(c == '\t'))
  573. --end;
  574. else break;
  575. }
  576. unsigned long start = 0;
  577. while (start < end) {
  578. char c = s[start];
  579. if ((c == ' ')||(c == '\r')||(c == '\n')||(!c)||(c == '\t'))
  580. ++start;
  581. else break;
  582. }
  583. return s.substr(start,end - start);
  584. }
  585. void Utils::stdsprintf(std::string &s,const char *fmt,...)
  586. throw(std::bad_alloc,std::length_error)
  587. {
  588. char buf[65536];
  589. va_list ap;
  590. va_start(ap,fmt);
  591. int n = vsnprintf(buf,sizeof(buf),fmt,ap);
  592. va_end(ap);
  593. if ((n >= (int)sizeof(buf))||(n < 0))
  594. throw std::length_error("printf result too large");
  595. s.append(buf);
  596. }
  597. } // namespace ZeroTier