You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

util.cxx 14KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682
  1. /* Copyright (C) 2002-2005 RealVNC Ltd. All Rights Reserved.
  2. * Copyright 2011-2023 Pierre Ossman for Cendio AB
  3. *
  4. * This is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  8. *
  9. * This software is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this software; if not, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  17. * USA.
  18. */
  19. #ifdef HAVE_CONFIG_H
  20. #include <config.h>
  21. #endif
  22. #include <assert.h>
  23. #include <ctype.h>
  24. #include <stdarg.h>
  25. #include <stdio.h>
  26. #include <string.h>
  27. #include <sys/time.h>
  28. #include <rfb/util.h>
  29. namespace rfb {
  30. std::string format(const char *fmt, ...)
  31. {
  32. va_list ap;
  33. int len;
  34. char *buf;
  35. std::string out;
  36. va_start(ap, fmt);
  37. len = vsnprintf(NULL, 0, fmt, ap);
  38. va_end(ap);
  39. if (len < 0)
  40. return "";
  41. buf = new char[len+1];
  42. va_start(ap, fmt);
  43. vsnprintf(buf, len+1, fmt, ap);
  44. va_end(ap);
  45. out = buf;
  46. delete [] buf;
  47. return out;
  48. }
  49. std::vector<std::string> split(const char* src,
  50. const char delimiter)
  51. {
  52. std::vector<std::string> out;
  53. const char *start, *stop;
  54. start = src;
  55. do {
  56. stop = strchr(start, delimiter);
  57. if (stop == NULL) {
  58. out.push_back(start);
  59. } else {
  60. out.push_back(std::string(start, stop-start));
  61. start = stop + 1;
  62. }
  63. } while (stop != NULL);
  64. return out;
  65. }
  66. static char intToHex(uint8_t i) {
  67. if (i<=9)
  68. return '0'+i;
  69. else if ((i>=10) && (i<=15))
  70. return 'a'+(i-10);
  71. assert(false);
  72. return '\0';
  73. }
  74. void binToHex(const uint8_t* in, size_t inlen,
  75. char* out, size_t outlen) {
  76. if (inlen > outlen/2)
  77. inlen = outlen/2;
  78. if (inlen > 0) {
  79. assert(in);
  80. assert(out);
  81. }
  82. for (size_t i=0; i<inlen; i++) {
  83. out[i*2] = intToHex((in[i] >> 4) & 15);
  84. out[i*2+1] = intToHex((in[i] & 15));
  85. }
  86. }
  87. std::string binToHex(const uint8_t* in, size_t inlen) {
  88. char* buffer = new char[inlen*2+1]();
  89. std::string out;
  90. binToHex(in, inlen, buffer, inlen*2);
  91. out = buffer;
  92. delete [] buffer;
  93. return out;
  94. }
  95. static bool readHexAndShift(char c, uint8_t* v) {
  96. c=tolower(c);
  97. if ((c >= '0') && (c <= '9'))
  98. *v = (*v << 4) + (c - '0');
  99. else if ((c >= 'a') && (c <= 'f'))
  100. *v = (*v << 4) + (c - 'a' + 10);
  101. else
  102. return false;
  103. return true;
  104. }
  105. bool hexToBin(const char* in, size_t inlen,
  106. uint8_t* out, size_t outlen) {
  107. assert(in);
  108. assert(out);
  109. if (inlen & 1)
  110. return false;
  111. if (inlen > outlen*2)
  112. inlen = outlen*2;
  113. for(size_t i=0; i<inlen; i+=2) {
  114. uint8_t byte = 0;
  115. if (!readHexAndShift(in[i], &byte) ||
  116. !readHexAndShift(in[i+1], &byte))
  117. return false;
  118. out[i/2] = byte;
  119. }
  120. return true;
  121. }
  122. std::vector<uint8_t> hexToBin(const char* in, size_t inlen) {
  123. std::vector<uint8_t> out(inlen/2);
  124. if (!hexToBin(in, inlen, out.data(), inlen/2))
  125. return std::vector<uint8_t>();
  126. return out;
  127. }
  128. std::string convertLF(const char* src, size_t bytes)
  129. {
  130. size_t sz;
  131. std::string out;
  132. const char* in;
  133. size_t in_len;
  134. // Compute output size
  135. sz = 0;
  136. in = src;
  137. in_len = bytes;
  138. while ((in_len > 0) && (*in != '\0')) {
  139. if (*in != '\r') {
  140. sz++;
  141. in++;
  142. in_len--;
  143. continue;
  144. }
  145. if ((in_len < 2) || (*(in+1) != '\n'))
  146. sz++;
  147. in++;
  148. in_len--;
  149. }
  150. // Reserve space
  151. out.reserve(sz);
  152. // And convert
  153. in = src;
  154. in_len = bytes;
  155. while ((in_len > 0) && (*in != '\0')) {
  156. if (*in != '\r') {
  157. out += *in++;
  158. in_len--;
  159. continue;
  160. }
  161. if ((in_len < 2) || (*(in+1) != '\n'))
  162. out += '\n';
  163. in++;
  164. in_len--;
  165. }
  166. return out;
  167. }
  168. std::string convertCRLF(const char* src, size_t bytes)
  169. {
  170. std::string out;
  171. size_t sz;
  172. const char* in;
  173. size_t in_len;
  174. // Compute output size
  175. sz = 0;
  176. in = src;
  177. in_len = bytes;
  178. while ((in_len > 0) && (*in != '\0')) {
  179. sz++;
  180. if (*in == '\r') {
  181. if ((in_len < 2) || (*(in+1) != '\n'))
  182. sz++;
  183. } else if (*in == '\n') {
  184. if ((in == src) || (*(in-1) != '\r'))
  185. sz++;
  186. }
  187. in++;
  188. in_len--;
  189. }
  190. // Reserve space
  191. out.reserve(sz);
  192. // And convert
  193. in = src;
  194. in_len = bytes;
  195. while ((in_len > 0) && (*in != '\0')) {
  196. if (*in == '\n') {
  197. if ((in == src) || (*(in-1) != '\r'))
  198. out += '\r';
  199. }
  200. out += *in;
  201. if (*in == '\r') {
  202. if ((in_len < 2) || (*(in+1) != '\n'))
  203. out += '\n';
  204. }
  205. in++;
  206. in_len--;
  207. }
  208. return out;
  209. }
  210. size_t ucs4ToUTF8(unsigned src, char dst[5]) {
  211. if (src < 0x80) {
  212. *dst++ = src;
  213. *dst++ = '\0';
  214. return 1;
  215. } else if (src < 0x800) {
  216. *dst++ = 0xc0 | (src >> 6);
  217. *dst++ = 0x80 | (src & 0x3f);
  218. *dst++ = '\0';
  219. return 2;
  220. } else if ((src >= 0xd800) && (src < 0xe000)) {
  221. return ucs4ToUTF8(0xfffd, dst);
  222. } else if (src < 0x10000) {
  223. *dst++ = 0xe0 | (src >> 12);
  224. *dst++ = 0x80 | ((src >> 6) & 0x3f);
  225. *dst++ = 0x80 | (src & 0x3f);
  226. *dst++ = '\0';
  227. return 3;
  228. } else if (src < 0x110000) {
  229. *dst++ = 0xf0 | (src >> 18);
  230. *dst++ = 0x80 | ((src >> 12) & 0x3f);
  231. *dst++ = 0x80 | ((src >> 6) & 0x3f);
  232. *dst++ = 0x80 | (src & 0x3f);
  233. *dst++ = '\0';
  234. return 4;
  235. } else {
  236. return ucs4ToUTF8(0xfffd, dst);
  237. }
  238. }
  239. size_t utf8ToUCS4(const char* src, size_t max, unsigned* dst) {
  240. size_t count, consumed;
  241. *dst = 0xfffd;
  242. if (max == 0)
  243. return 0;
  244. consumed = 1;
  245. if ((*src & 0x80) == 0) {
  246. *dst = *src;
  247. count = 0;
  248. } else if ((*src & 0xe0) == 0xc0) {
  249. *dst = *src & 0x1f;
  250. count = 1;
  251. } else if ((*src & 0xf0) == 0xe0) {
  252. *dst = *src & 0x0f;
  253. count = 2;
  254. } else if ((*src & 0xf8) == 0xf0) {
  255. *dst = *src & 0x07;
  256. count = 3;
  257. } else {
  258. // Invalid sequence, consume all continuation characters
  259. src++;
  260. max--;
  261. while ((max-- > 0) && ((*src++ & 0xc0) == 0x80))
  262. consumed++;
  263. return consumed;
  264. }
  265. src++;
  266. max--;
  267. while (count--) {
  268. consumed++;
  269. // Invalid or truncated sequence?
  270. if ((max == 0) || ((*src & 0xc0) != 0x80)) {
  271. *dst = 0xfffd;
  272. return consumed;
  273. }
  274. *dst <<= 6;
  275. *dst |= *src & 0x3f;
  276. src++;
  277. max--;
  278. }
  279. // UTF-16 surrogate code point?
  280. if ((*dst >= 0xd800) && (*dst < 0xe000))
  281. *dst = 0xfffd;
  282. return consumed;
  283. }
  284. size_t ucs4ToUTF16(unsigned src, wchar_t dst[3]) {
  285. if ((src < 0xd800) || ((src >= 0xe000) && (src < 0x10000))) {
  286. *dst++ = src;
  287. *dst++ = L'\0';
  288. return 1;
  289. } else if ((src >= 0x10000) && (src < 0x110000)) {
  290. src -= 0x10000;
  291. *dst++ = 0xd800 | ((src >> 10) & 0x03ff);
  292. *dst++ = 0xdc00 | (src & 0x03ff);
  293. *dst++ = L'\0';
  294. return 2;
  295. } else {
  296. return ucs4ToUTF16(0xfffd, dst);
  297. }
  298. }
  299. size_t utf16ToUCS4(const wchar_t* src, size_t max, unsigned* dst) {
  300. *dst = 0xfffd;
  301. if (max == 0)
  302. return 0;
  303. if ((*src < 0xd800) || (*src >= 0xe000)) {
  304. *dst = *src;
  305. return 1;
  306. }
  307. if (*src & 0x0400) {
  308. size_t consumed;
  309. // Invalid sequence, consume all continuation characters
  310. consumed = 0;
  311. while ((max > 0) && (*src & 0x0400)) {
  312. src++;
  313. max--;
  314. consumed++;
  315. }
  316. return consumed;
  317. }
  318. *dst = *src++;
  319. max--;
  320. // Invalid or truncated sequence?
  321. if ((max == 0) || ((*src & 0xfc00) != 0xdc00)) {
  322. *dst = 0xfffd;
  323. return 1;
  324. }
  325. *dst = 0x10000 + ((*dst & 0x03ff) << 10);
  326. *dst |= *src & 0x3ff;
  327. return 2;
  328. }
  329. std::string latin1ToUTF8(const char* src, size_t bytes) {
  330. std::string out;
  331. size_t sz;
  332. const char* in;
  333. size_t in_len;
  334. // Compute output size
  335. sz = 0;
  336. in = src;
  337. in_len = bytes;
  338. while ((in_len > 0) && (*in != '\0')) {
  339. char buf[5];
  340. sz += ucs4ToUTF8(*(const unsigned char*)in, buf);
  341. in++;
  342. in_len--;
  343. }
  344. // Reserve space
  345. out.reserve(sz);
  346. // And convert
  347. in = src;
  348. in_len = bytes;
  349. while ((in_len > 0) && (*in != '\0')) {
  350. char buf[5];
  351. ucs4ToUTF8(*(const unsigned char*)in, buf);
  352. out += buf;
  353. in++;
  354. in_len--;
  355. }
  356. return out;
  357. }
  358. std::string utf8ToLatin1(const char* src, size_t bytes) {
  359. std::string out;
  360. size_t sz;
  361. const char* in;
  362. size_t in_len;
  363. // Compute output size
  364. sz = 0;
  365. in = src;
  366. in_len = bytes;
  367. while ((in_len > 0) && (*in != '\0')) {
  368. size_t len;
  369. unsigned ucs;
  370. len = utf8ToUCS4(in, in_len, &ucs);
  371. in += len;
  372. in_len -= len;
  373. sz++;
  374. }
  375. // Reserve space
  376. out.reserve(sz);
  377. // And convert
  378. in = src;
  379. in_len = bytes;
  380. while ((in_len > 0) && (*in != '\0')) {
  381. size_t len;
  382. unsigned ucs;
  383. len = utf8ToUCS4(in, in_len, &ucs);
  384. in += len;
  385. in_len -= len;
  386. if (ucs > 0xff)
  387. out += '?';
  388. else
  389. out += (unsigned char)ucs;
  390. }
  391. return out;
  392. }
  393. std::string utf16ToUTF8(const wchar_t* src, size_t units)
  394. {
  395. std::string out;
  396. size_t sz;
  397. const wchar_t* in;
  398. size_t in_len;
  399. // Compute output size
  400. sz = 0;
  401. in = src;
  402. in_len = units;
  403. while ((in_len > 0) && (*in != '\0')) {
  404. size_t len;
  405. unsigned ucs;
  406. char buf[5];
  407. len = utf16ToUCS4(in, in_len, &ucs);
  408. in += len;
  409. in_len -= len;
  410. sz += ucs4ToUTF8(ucs, buf);
  411. }
  412. // Reserve space
  413. out.reserve(sz);
  414. // And convert
  415. in = src;
  416. in_len = units;
  417. while ((in_len > 0) && (*in != '\0')) {
  418. size_t len;
  419. unsigned ucs;
  420. char buf[5];
  421. len = utf16ToUCS4(in, in_len, &ucs);
  422. in += len;
  423. in_len -= len;
  424. ucs4ToUTF8(ucs, buf);
  425. out += buf;
  426. }
  427. return out;
  428. }
  429. std::wstring utf8ToUTF16(const char* src, size_t bytes)
  430. {
  431. std::wstring out;
  432. size_t sz;
  433. const char* in;
  434. size_t in_len;
  435. // Compute output size
  436. sz = 0;
  437. in = src;
  438. in_len = bytes;
  439. while ((in_len > 0) && (*in != '\0')) {
  440. size_t len;
  441. unsigned ucs;
  442. wchar_t buf[3];
  443. len = utf8ToUCS4(in, in_len, &ucs);
  444. in += len;
  445. in_len -= len;
  446. sz += ucs4ToUTF16(ucs, buf);
  447. }
  448. // Reserve space
  449. out.reserve(sz);
  450. // And convert
  451. in = src;
  452. in_len = bytes;
  453. while ((in_len > 0) && (*in != '\0')) {
  454. size_t len;
  455. unsigned ucs;
  456. wchar_t buf[3];
  457. len = utf8ToUCS4(in, in_len, &ucs);
  458. in += len;
  459. in_len -= len;
  460. ucs4ToUTF16(ucs, buf);
  461. out += buf;
  462. }
  463. return out;
  464. }
  465. bool isValidUTF8(const char* str, size_t bytes)
  466. {
  467. while ((bytes > 0) && (*str != '\0')) {
  468. size_t len;
  469. unsigned ucs;
  470. len = utf8ToUCS4(str, bytes, &ucs);
  471. str += len;
  472. bytes -= len;
  473. if (ucs == 0xfffd)
  474. return false;
  475. }
  476. return true;
  477. }
  478. bool isValidUTF16(const wchar_t* wstr, size_t units)
  479. {
  480. while ((units > 0) && (*wstr != '\0')) {
  481. size_t len;
  482. unsigned ucs;
  483. len = utf16ToUCS4(wstr, units, &ucs);
  484. wstr += len;
  485. units -= len;
  486. if (ucs == 0xfffd)
  487. return false;
  488. }
  489. return true;
  490. }
  491. unsigned msBetween(const struct timeval *first,
  492. const struct timeval *second)
  493. {
  494. unsigned diff;
  495. diff = (second->tv_sec - first->tv_sec) * 1000;
  496. diff += second->tv_usec / 1000;
  497. diff -= first->tv_usec / 1000;
  498. return diff;
  499. }
  500. unsigned msSince(const struct timeval *then)
  501. {
  502. struct timeval now;
  503. gettimeofday(&now, NULL);
  504. return msBetween(then, &now);
  505. }
  506. bool isBefore(const struct timeval *first,
  507. const struct timeval *second)
  508. {
  509. if (first->tv_sec < second->tv_sec)
  510. return true;
  511. if (first->tv_sec > second->tv_sec)
  512. return false;
  513. if (first->tv_usec < second->tv_usec)
  514. return true;
  515. return false;
  516. }
  517. static std::string doPrefix(long long value, const char *unit,
  518. unsigned divisor, const char **prefixes,
  519. size_t prefixCount, int precision) {
  520. char buffer[256];
  521. double newValue;
  522. size_t prefix;
  523. newValue = value;
  524. prefix = 0;
  525. while (newValue >= divisor) {
  526. if (prefix >= prefixCount)
  527. break;
  528. newValue /= divisor;
  529. prefix++;
  530. }
  531. snprintf(buffer, sizeof(buffer), "%.*g %s%s", precision, newValue,
  532. (prefix == 0) ? "" : prefixes[prefix-1], unit);
  533. buffer[sizeof(buffer)-1] = '\0';
  534. return buffer;
  535. }
  536. static const char *siPrefixes[] =
  537. { "k", "M", "G", "T", "P", "E", "Z", "Y" };
  538. static const char *iecPrefixes[] =
  539. { "Ki", "Mi", "Gi", "Ti", "Pi", "Ei", "Zi", "Yi" };
  540. std::string siPrefix(long long value, const char *unit,
  541. int precision) {
  542. return doPrefix(value, unit, 1000, siPrefixes,
  543. sizeof(siPrefixes)/sizeof(*siPrefixes),
  544. precision);
  545. }
  546. std::string iecPrefix(long long value, const char *unit,
  547. int precision) {
  548. return doPrefix(value, unit, 1024, iecPrefixes,
  549. sizeof(iecPrefixes)/sizeof(*iecPrefixes),
  550. precision);
  551. }
  552. };