libwebsockets.c 25 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361
  1. /*
  2. * libwebsockets - small server side websockets and web server implementation
  3. *
  4. * Copyright (C) 2010 - 2020 Andy Green <[email protected]>
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining a copy
  7. * of this software and associated documentation files (the "Software"), to
  8. * deal in the Software without restriction, including without limitation the
  9. * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
  10. * sell copies of the Software, and to permit persons to whom the Software is
  11. * furnished to do so, subject to the following conditions:
  12. *
  13. * The above copyright notice and this permission notice shall be included in
  14. * all copies or substantial portions of the Software.
  15. *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  19. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  20. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  21. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  22. * IN THE SOFTWARE.
  23. */
  24. #include "private-lib-core.h"
  25. #ifdef LWS_HAVE_SYS_TYPES_H
  26. #include <sys/types.h>
  27. #endif
  28. #include <signal.h>
  29. void
  30. lws_ser_wu16be(uint8_t *b, uint16_t u)
  31. {
  32. *b++ = (uint8_t)(u >> 8);
  33. *b = (uint8_t)u;
  34. }
  35. void
  36. lws_ser_wu32be(uint8_t *b, uint32_t u32)
  37. {
  38. *b++ = (uint8_t)(u32 >> 24);
  39. *b++ = (uint8_t)(u32 >> 16);
  40. *b++ = (uint8_t)(u32 >> 8);
  41. *b = (uint8_t)u32;
  42. }
  43. void
  44. lws_ser_wu64be(uint8_t *b, uint64_t u64)
  45. {
  46. lws_ser_wu32be(b, (uint32_t)(u64 >> 32));
  47. lws_ser_wu32be(b + 4, (uint32_t)u64);
  48. }
  49. uint16_t
  50. lws_ser_ru16be(const uint8_t *b)
  51. {
  52. return (b[0] << 8) | b[1];
  53. }
  54. uint32_t
  55. lws_ser_ru32be(const uint8_t *b)
  56. {
  57. return (b[0] << 24) | (b[1] << 16) | (b[2] << 8) | b[3];
  58. }
  59. uint64_t
  60. lws_ser_ru64be(const uint8_t *b)
  61. {
  62. return (((uint64_t)lws_ser_ru32be(b)) << 32) | lws_ser_ru32be(b + 4);
  63. }
  64. int
  65. lws_vbi_encode(uint64_t value, void *buf)
  66. {
  67. uint8_t *p = (uint8_t *)buf, b;
  68. if (value > 0xfffffff) {
  69. assert(0);
  70. return -1;
  71. }
  72. do {
  73. b = value & 0x7f;
  74. value >>= 7;
  75. if (value)
  76. *p++ = (0x80 | b);
  77. else
  78. *p++ = b;
  79. } while (value);
  80. return lws_ptr_diff(p, buf);
  81. }
  82. int
  83. lws_vbi_decode(const void *buf, uint64_t *value, size_t len)
  84. {
  85. const uint8_t *p = (const uint8_t *)buf, *end = p + len;
  86. uint64_t v = 0;
  87. int s = 0;
  88. while (p < end) {
  89. v |= (((uint64_t)(*p)) & 0x7f) << s;
  90. if (*p & 0x80) {
  91. *value = v;
  92. return lws_ptr_diff(p, buf);
  93. }
  94. s += 7;
  95. if (s >= 64)
  96. return 0;
  97. p++;
  98. }
  99. return 0;
  100. }
  101. signed char char_to_hex(const char c)
  102. {
  103. if (c >= '0' && c <= '9')
  104. return c - '0';
  105. if (c >= 'a' && c <= 'f')
  106. return c - 'a' + 10;
  107. if (c >= 'A' && c <= 'F')
  108. return c - 'A' + 10;
  109. return -1;
  110. }
  111. int
  112. lws_hex_to_byte_array(const char *h, uint8_t *dest, int max)
  113. {
  114. uint8_t *odest = dest;
  115. while (max-- && *h) {
  116. int t = char_to_hex(*h++), t1;
  117. if (!*h || t < 0)
  118. return -1;
  119. t1 = char_to_hex(*h++);
  120. if (t1 < 0)
  121. return -1;
  122. *dest++ = (t << 4) | t1;
  123. }
  124. if (max < 0)
  125. return -1;
  126. return lws_ptr_diff(dest, odest);
  127. }
  128. static char *hexch = "0123456789abcdef";
  129. int
  130. lws_hex_random(struct lws_context *context, char *dest, size_t len)
  131. {
  132. size_t n = (len - 1) / 2;
  133. uint8_t b, *r = (uint8_t *)dest + len - n;
  134. if (lws_get_random(context, r, n) != n)
  135. return 1;
  136. while (n--) {
  137. b = *r++;
  138. *dest++ = hexch[b >> 4];
  139. *dest++ = hexch[b & 0xf];
  140. }
  141. *dest = '\0';
  142. return 0;
  143. }
  144. #if !defined(LWS_PLAT_OPTEE)
  145. #if defined(LWS_WITH_FILE_OPS)
  146. int lws_open(const char *__file, int __oflag, ...)
  147. {
  148. va_list ap;
  149. int n;
  150. va_start(ap, __oflag);
  151. if (((__oflag & O_CREAT) == O_CREAT)
  152. #if defined(O_TMPFILE)
  153. || ((__oflag & O_TMPFILE) == O_TMPFILE)
  154. #endif
  155. )
  156. /* last arg is really a mode_t. But windows... */
  157. n = open(__file, __oflag, va_arg(ap, uint32_t));
  158. else
  159. n = open(__file, __oflag);
  160. va_end(ap);
  161. if (n != -1 && lws_plat_apply_FD_CLOEXEC(n)) {
  162. close(n);
  163. return -1;
  164. }
  165. return n;
  166. }
  167. #endif
  168. #endif
  169. int
  170. lws_pthread_self_to_tsi(struct lws_context *context)
  171. {
  172. #if LWS_MAX_SMP > 1
  173. pthread_t ps = pthread_self();
  174. struct lws_context_per_thread *pt = &context->pt[0];
  175. int n;
  176. for (n = 0; n < context->count_threads; n++) {
  177. if (pthread_equal(ps, pt->self))
  178. return n;
  179. pt++;
  180. }
  181. return -1;
  182. #else
  183. return 0;
  184. #endif
  185. }
  186. void *
  187. lws_context_user(struct lws_context *context)
  188. {
  189. return context->user_space;
  190. }
  191. void
  192. lws_explicit_bzero(void *p, size_t len)
  193. {
  194. volatile uint8_t *vp = p;
  195. while (len--)
  196. *vp++ = 0;
  197. }
  198. #if !(defined(LWS_PLAT_OPTEE) && !defined(LWS_WITH_NETWORK))
  199. /**
  200. * lws_now_secs() - seconds since 1970-1-1
  201. *
  202. */
  203. unsigned long
  204. lws_now_secs(void)
  205. {
  206. struct timeval tv;
  207. gettimeofday(&tv, NULL);
  208. return tv.tv_sec;
  209. }
  210. #endif
  211. #if defined(LWS_WITH_SERVER)
  212. const char *
  213. lws_canonical_hostname(struct lws_context *context)
  214. {
  215. return (const char *)context->canonical_hostname;
  216. }
  217. #endif
  218. int
  219. lws_get_count_threads(struct lws_context *context)
  220. {
  221. return context->count_threads;
  222. }
  223. static const unsigned char e0f4[] = {
  224. 0xa0 | ((2 - 1) << 2) | 1, /* e0 */
  225. 0x80 | ((4 - 1) << 2) | 1, /* e1 */
  226. 0x80 | ((4 - 1) << 2) | 1, /* e2 */
  227. 0x80 | ((4 - 1) << 2) | 1, /* e3 */
  228. 0x80 | ((4 - 1) << 2) | 1, /* e4 */
  229. 0x80 | ((4 - 1) << 2) | 1, /* e5 */
  230. 0x80 | ((4 - 1) << 2) | 1, /* e6 */
  231. 0x80 | ((4 - 1) << 2) | 1, /* e7 */
  232. 0x80 | ((4 - 1) << 2) | 1, /* e8 */
  233. 0x80 | ((4 - 1) << 2) | 1, /* e9 */
  234. 0x80 | ((4 - 1) << 2) | 1, /* ea */
  235. 0x80 | ((4 - 1) << 2) | 1, /* eb */
  236. 0x80 | ((4 - 1) << 2) | 1, /* ec */
  237. 0x80 | ((2 - 1) << 2) | 1, /* ed */
  238. 0x80 | ((4 - 1) << 2) | 1, /* ee */
  239. 0x80 | ((4 - 1) << 2) | 1, /* ef */
  240. 0x90 | ((3 - 1) << 2) | 2, /* f0 */
  241. 0x80 | ((4 - 1) << 2) | 2, /* f1 */
  242. 0x80 | ((4 - 1) << 2) | 2, /* f2 */
  243. 0x80 | ((4 - 1) << 2) | 2, /* f3 */
  244. 0x80 | ((1 - 1) << 2) | 2, /* f4 */
  245. 0, /* s0 */
  246. 0x80 | ((4 - 1) << 2) | 0, /* s2 */
  247. 0x80 | ((4 - 1) << 2) | 1, /* s3 */
  248. };
  249. int
  250. lws_check_byte_utf8(unsigned char state, unsigned char c)
  251. {
  252. unsigned char s = state;
  253. if (!s) {
  254. if (c >= 0x80) {
  255. if (c < 0xc2 || c > 0xf4)
  256. return -1;
  257. if (c < 0xe0)
  258. return 0x80 | ((4 - 1) << 2);
  259. else
  260. return e0f4[c - 0xe0];
  261. }
  262. return s;
  263. }
  264. if (c < (s & 0xf0) || c >= (s & 0xf0) + 0x10 + ((s << 2) & 0x30))
  265. return -1;
  266. return e0f4[21 + (s & 3)];
  267. }
  268. int
  269. lws_check_utf8(unsigned char *state, unsigned char *buf, size_t len)
  270. {
  271. unsigned char s = *state;
  272. while (len--) {
  273. unsigned char c = *buf++;
  274. if (!s) {
  275. if (c >= 0x80) {
  276. if (c < 0xc2 || c > 0xf4)
  277. return 1;
  278. if (c < 0xe0)
  279. s = 0x80 | ((4 - 1) << 2);
  280. else
  281. s = e0f4[c - 0xe0];
  282. }
  283. } else {
  284. if (c < (s & 0xf0) ||
  285. c >= (s & 0xf0) + 0x10 + ((s << 2) & 0x30))
  286. return 1;
  287. s = e0f4[21 + (s & 3)];
  288. }
  289. }
  290. *state = s;
  291. return 0;
  292. }
  293. char *
  294. lws_strdup(const char *s)
  295. {
  296. char *d = lws_malloc(strlen(s) + 1, "strdup");
  297. if (d)
  298. strcpy(d, s);
  299. return d;
  300. }
  301. const char *
  302. lws_nstrstr(const char *buf, size_t len, const char *name, size_t nl)
  303. {
  304. const char *end = buf + len - nl + 1;
  305. size_t n;
  306. if (nl > len)
  307. /* it cannot be found if the needle is longer than the haystack */
  308. return NULL;
  309. while (buf < end) {
  310. if (*buf != name[0]) {
  311. buf++;
  312. continue;
  313. }
  314. if (nl == 1)
  315. /* single char match, we are done */
  316. return buf;
  317. if (buf[nl - 1] == name[nl - 1]) {
  318. /*
  319. * This is looking interesting then... the first
  320. * and last chars match, let's check the insides
  321. */
  322. n = 1;
  323. while (n < nl && buf[n] == name[n])
  324. n++;
  325. if (n == nl)
  326. /* it's a hit */
  327. return buf;
  328. }
  329. buf++;
  330. }
  331. return NULL;
  332. }
  333. /*
  334. * name wants to be something like "\"myname\":"
  335. */
  336. const char *
  337. lws_json_simple_find(const char *buf, size_t len, const char *name, size_t *alen)
  338. {
  339. size_t nl = strlen(name);
  340. const char *np = lws_nstrstr(buf, len, name, nl),
  341. *end = buf + len, *as;
  342. int qu = 0;
  343. if (!np)
  344. return NULL;
  345. np += nl;
  346. while (np < end && (*np == ' ' || *np == '\t'))
  347. np++;
  348. if (np >= end)
  349. return NULL;
  350. /*
  351. * The arg could be lots of things after "name": with JSON, commonly a
  352. * string like "mystring", true, false, null, [...] or {...} ... we want
  353. * to handle common, simple cases cheaply with this; the user can choose
  354. * a full JSON parser like lejp if it's complicated. So if no opening
  355. * quote, return until a terminator like , ] }. If there's an opening
  356. * quote, return until closing quote, handling escaped quotes.
  357. */
  358. if (*np == '\"') {
  359. qu = 1;
  360. np++;
  361. }
  362. as = np;
  363. while (np < end &&
  364. (!qu || *np != '\"') && /* end quote is EOT if quoted */
  365. (qu || (*np != '}' && *np != ']' && *np != ',')) /* delimiters */
  366. ) {
  367. if (qu && *np == '\\') /* skip next char if quoted escape */
  368. np++;
  369. np++;
  370. }
  371. *alen = lws_ptr_diff(np, as);
  372. return as;
  373. }
  374. int
  375. lws_json_simple_strcmp(const char *buf, size_t len, const char *name,
  376. const char *comp)
  377. {
  378. size_t al;
  379. const char *hit = lws_json_simple_find(buf, len, name, &al);
  380. if (!hit)
  381. return -1;
  382. if (al != strlen(comp))
  383. return -1;
  384. return strncmp(hit, comp, al);
  385. }
  386. static const char *hex = "0123456789ABCDEF";
  387. const char *
  388. lws_sql_purify(char *escaped, const char *string, int len)
  389. {
  390. const char *p = string;
  391. char *q = escaped;
  392. while (*p && len-- > 2) {
  393. if (*p == '\'') {
  394. *q++ = '\'';
  395. *q++ = '\'';
  396. len --;
  397. p++;
  398. } else
  399. *q++ = *p++;
  400. }
  401. *q = '\0';
  402. return escaped;
  403. }
  404. int
  405. lws_sql_purify_len(const char *p)
  406. {
  407. int olen = 0;
  408. while (*p) {
  409. if (*p++ == '\'')
  410. olen++;
  411. olen++;
  412. }
  413. return olen;
  414. }
  415. const char *
  416. lws_json_purify(char *escaped, const char *string, int len, int *in_used)
  417. {
  418. const char *p = string;
  419. char *q = escaped;
  420. if (!p) {
  421. escaped[0] = '\0';
  422. return escaped;
  423. }
  424. while (*p && len-- > 6) {
  425. if (*p == '\t') {
  426. p++;
  427. *q++ = '\\';
  428. *q++ = 't';
  429. continue;
  430. }
  431. if (*p == '\n') {
  432. p++;
  433. *q++ = '\\';
  434. *q++ = 'n';
  435. continue;
  436. }
  437. if (*p == '\r') {
  438. p++;
  439. *q++ = '\\';
  440. *q++ = 'r';
  441. continue;
  442. }
  443. if (*p == '\\') {
  444. p++;
  445. *q++ = '\\';
  446. *q++ = '\\';
  447. continue;
  448. }
  449. if (*p == '\"' || *p < 0x20) {
  450. *q++ = '\\';
  451. *q++ = 'u';
  452. *q++ = '0';
  453. *q++ = '0';
  454. *q++ = hex[((*p) >> 4) & 15];
  455. *q++ = hex[(*p) & 15];
  456. len -= 5;
  457. p++;
  458. } else
  459. *q++ = *p++;
  460. }
  461. *q = '\0';
  462. if (in_used)
  463. *in_used = lws_ptr_diff(p, string);
  464. return escaped;
  465. }
  466. int
  467. lws_json_purify_len(const char *string)
  468. {
  469. int len = 0;
  470. const char *p = string;
  471. while (*p) {
  472. if (*p == '\t' || *p == '\n' || *p == '\r') {
  473. p++;
  474. len += 2;
  475. continue;
  476. }
  477. if (*p == '\"' || *p == '\\' || *p < 0x20) {
  478. len += 6;
  479. p++;
  480. continue;
  481. }
  482. p++;
  483. len++;
  484. }
  485. return len;
  486. }
  487. void
  488. lws_filename_purify_inplace(char *filename)
  489. {
  490. while (*filename) {
  491. if (*filename == '.' && filename[1] == '.') {
  492. *filename = '_';
  493. filename[1] = '_';
  494. }
  495. if (*filename == ':' ||
  496. #if !defined(WIN32)
  497. *filename == '\\' ||
  498. #endif
  499. *filename == '$' ||
  500. *filename == '%')
  501. *filename = '_';
  502. filename++;
  503. }
  504. }
  505. const char *
  506. lws_urlencode(char *escaped, const char *string, int len)
  507. {
  508. const char *p = string;
  509. char *q = escaped;
  510. while (*p && len-- > 3) {
  511. if (*p == ' ') {
  512. *q++ = '+';
  513. p++;
  514. continue;
  515. }
  516. if ((*p >= '0' && *p <= '9') ||
  517. (*p >= 'A' && *p <= 'Z') ||
  518. (*p >= 'a' && *p <= 'z')) {
  519. *q++ = *p++;
  520. continue;
  521. }
  522. *q++ = '%';
  523. *q++ = hex[(*p >> 4) & 0xf];
  524. *q++ = hex[*p & 0xf];
  525. len -= 2;
  526. p++;
  527. }
  528. *q = '\0';
  529. return escaped;
  530. }
  531. int
  532. lws_urldecode(char *string, const char *escaped, int len)
  533. {
  534. int state = 0, n;
  535. char sum = 0;
  536. while (*escaped && len) {
  537. switch (state) {
  538. case 0:
  539. if (*escaped == '%') {
  540. state++;
  541. escaped++;
  542. continue;
  543. }
  544. if (*escaped == '+') {
  545. escaped++;
  546. *string++ = ' ';
  547. len--;
  548. continue;
  549. }
  550. *string++ = *escaped++;
  551. len--;
  552. break;
  553. case 1:
  554. n = char_to_hex(*escaped);
  555. if (n < 0)
  556. return -1;
  557. escaped++;
  558. sum = n << 4;
  559. state++;
  560. break;
  561. case 2:
  562. n = char_to_hex(*escaped);
  563. if (n < 0)
  564. return -1;
  565. escaped++;
  566. *string++ = sum | n;
  567. len--;
  568. state = 0;
  569. break;
  570. }
  571. }
  572. *string = '\0';
  573. return 0;
  574. }
  575. int
  576. lws_finalize_startup(struct lws_context *context)
  577. {
  578. if (lws_check_opt(context->options, LWS_SERVER_OPTION_EXPLICIT_VHOSTS))
  579. if (lws_plat_drop_app_privileges(context, 1))
  580. return 1;
  581. return 0;
  582. }
  583. #if !defined(LWS_PLAT_FREERTOS)
  584. void
  585. lws_get_effective_uid_gid(struct lws_context *context, int *uid, int *gid)
  586. {
  587. *uid = context->uid;
  588. *gid = context->gid;
  589. }
  590. #endif
  591. int
  592. lws_snprintf(char *str, size_t size, const char *format, ...)
  593. {
  594. va_list ap;
  595. int n;
  596. if (!size)
  597. return 0;
  598. va_start(ap, format);
  599. n = vsnprintf(str, size, format, ap);
  600. va_end(ap);
  601. if (n >= (int)size)
  602. return (int)size;
  603. return n;
  604. }
  605. char *
  606. lws_strncpy(char *dest, const char *src, size_t size)
  607. {
  608. strncpy(dest, src, size - 1);
  609. dest[size - 1] = '\0';
  610. return dest;
  611. }
  612. int
  613. lws_timingsafe_bcmp(const void *a, const void *b, uint32_t len)
  614. {
  615. const uint8_t *pa = a, *pb = b;
  616. uint8_t sum = 0;
  617. while (len--)
  618. sum |= (*pa++ ^ *pb++);
  619. return sum;
  620. }
  621. typedef enum {
  622. LWS_TOKZS_LEADING_WHITESPACE,
  623. LWS_TOKZS_QUOTED_STRING,
  624. LWS_TOKZS_TOKEN,
  625. LWS_TOKZS_TOKEN_POST_TERMINAL
  626. } lws_tokenize_state;
  627. lws_tokenize_elem
  628. lws_tokenize(struct lws_tokenize *ts)
  629. {
  630. const char *rfc7230_delims = "(),/:;<=>?@[\\]{}";
  631. lws_tokenize_state state = LWS_TOKZS_LEADING_WHITESPACE;
  632. char c, flo = 0, d_minus = '-', d_dot = '.', s_minus = '\0',
  633. s_dot = '\0', skipping = 0;
  634. signed char num = (ts->flags & LWS_TOKENIZE_F_NO_INTEGERS) ? 0 : -1;
  635. int utf8 = 0;
  636. /* for speed, compute the effect of the flags outside the loop */
  637. if (ts->flags & LWS_TOKENIZE_F_MINUS_NONTERM) {
  638. d_minus = '\0';
  639. s_minus = '-';
  640. }
  641. if (ts->flags & LWS_TOKENIZE_F_DOT_NONTERM) {
  642. d_dot = '\0';
  643. s_dot = '.';
  644. }
  645. ts->token = NULL;
  646. ts->token_len = 0;
  647. while (ts->len) {
  648. c = *ts->start++;
  649. ts->len--;
  650. utf8 = lws_check_byte_utf8((unsigned char)utf8, c);
  651. if (utf8 < 0)
  652. return LWS_TOKZE_ERR_BROKEN_UTF8;
  653. if (!c)
  654. break;
  655. if (skipping) {
  656. if (c != '\r' && c != '\n')
  657. continue;
  658. else
  659. skipping = 0;
  660. }
  661. /* comment */
  662. if (ts->flags & LWS_TOKENIZE_F_HASH_COMMENT &&
  663. state != LWS_TOKZS_QUOTED_STRING &&
  664. c == '#') {
  665. skipping = 1;
  666. continue;
  667. }
  668. /* whitespace */
  669. if (c == ' ' || c == '\t' || c == '\n' || c == '\r' ||
  670. c == '\f') {
  671. switch (state) {
  672. case LWS_TOKZS_LEADING_WHITESPACE:
  673. case LWS_TOKZS_TOKEN_POST_TERMINAL:
  674. continue;
  675. case LWS_TOKZS_QUOTED_STRING:
  676. ts->token_len++;
  677. continue;
  678. case LWS_TOKZS_TOKEN:
  679. /* we want to scan forward to look for = */
  680. state = LWS_TOKZS_TOKEN_POST_TERMINAL;
  681. continue;
  682. }
  683. }
  684. /* quoted string */
  685. if (c == '\"') {
  686. if (state == LWS_TOKZS_QUOTED_STRING)
  687. return LWS_TOKZE_QUOTED_STRING;
  688. /* starting a quoted string */
  689. if (ts->flags & LWS_TOKENIZE_F_COMMA_SEP_LIST) {
  690. if (ts->delim == LWSTZ_DT_NEED_DELIM)
  691. return LWS_TOKZE_ERR_COMMA_LIST;
  692. ts->delim = LWSTZ_DT_NEED_DELIM;
  693. }
  694. state = LWS_TOKZS_QUOTED_STRING;
  695. ts->token = ts->start;
  696. ts->token_len = 0;
  697. continue;
  698. }
  699. /* token= aggregation */
  700. if (c == '=' && (state == LWS_TOKZS_TOKEN_POST_TERMINAL ||
  701. state == LWS_TOKZS_TOKEN)) {
  702. if (num == 1)
  703. return LWS_TOKZE_ERR_NUM_ON_LHS;
  704. /* swallow the = */
  705. return LWS_TOKZE_TOKEN_NAME_EQUALS;
  706. }
  707. /* optional token: aggregation */
  708. if ((ts->flags & LWS_TOKENIZE_F_AGG_COLON) && c == ':' &&
  709. (state == LWS_TOKZS_TOKEN_POST_TERMINAL ||
  710. state == LWS_TOKZS_TOKEN))
  711. /* swallow the : */
  712. return LWS_TOKZE_TOKEN_NAME_COLON;
  713. /* aggregate . in a number as a float */
  714. if (c == '.' && !(ts->flags & LWS_TOKENIZE_F_NO_FLOATS) &&
  715. state == LWS_TOKZS_TOKEN && num == 1) {
  716. if (flo)
  717. return LWS_TOKZE_ERR_MALFORMED_FLOAT;
  718. flo = 1;
  719. ts->token_len++;
  720. continue;
  721. }
  722. /*
  723. * Delimiter... by default anything that:
  724. *
  725. * - isn't matched earlier, or
  726. * - is [A-Z, a-z, 0-9, _], and
  727. * - is not a partial utf8 char
  728. *
  729. * is a "delimiter", it marks the end of a token and is itself
  730. * reported as a single LWS_TOKZE_DELIMITER each time.
  731. *
  732. * However with LWS_TOKENIZE_F_RFC7230_DELIMS flag, tokens may
  733. * contain any noncontrol character that isn't defined in
  734. * rfc7230_delims, and only characters listed there are treated
  735. * as delimiters.
  736. */
  737. if (!utf8 &&
  738. ((ts->flags & LWS_TOKENIZE_F_RFC7230_DELIMS &&
  739. strchr(rfc7230_delims, c) && c > 32) ||
  740. ((!(ts->flags & LWS_TOKENIZE_F_RFC7230_DELIMS) &&
  741. (c < '0' || c > '9') && (c < 'A' || c > 'Z') &&
  742. (c < 'a' || c > 'z') && c != '_') &&
  743. c != s_minus && c != s_dot) ||
  744. c == d_minus || c == d_dot
  745. ) &&
  746. !((ts->flags & LWS_TOKENIZE_F_SLASH_NONTERM) && c == '/')) {
  747. switch (state) {
  748. case LWS_TOKZS_LEADING_WHITESPACE:
  749. if (ts->flags & LWS_TOKENIZE_F_COMMA_SEP_LIST) {
  750. if (c != ',' ||
  751. ts->delim != LWSTZ_DT_NEED_DELIM)
  752. return LWS_TOKZE_ERR_COMMA_LIST;
  753. ts->delim = LWSTZ_DT_NEED_NEXT_CONTENT;
  754. }
  755. ts->token = ts->start - 1;
  756. ts->token_len = 1;
  757. return LWS_TOKZE_DELIMITER;
  758. case LWS_TOKZS_QUOTED_STRING:
  759. ts->token_len++;
  760. continue;
  761. case LWS_TOKZS_TOKEN_POST_TERMINAL:
  762. case LWS_TOKZS_TOKEN:
  763. /* report the delimiter next time */
  764. ts->start--;
  765. ts->len++;
  766. goto token_or_numeric;
  767. }
  768. }
  769. /* anything that's not whitespace or delimiter is payload */
  770. switch (state) {
  771. case LWS_TOKZS_LEADING_WHITESPACE:
  772. if (ts->flags & LWS_TOKENIZE_F_COMMA_SEP_LIST) {
  773. if (ts->delim == LWSTZ_DT_NEED_DELIM)
  774. return LWS_TOKZE_ERR_COMMA_LIST;
  775. ts->delim = LWSTZ_DT_NEED_DELIM;
  776. }
  777. state = LWS_TOKZS_TOKEN;
  778. ts->token = ts->start - 1;
  779. ts->token_len = 1;
  780. goto checknum;
  781. case LWS_TOKZS_QUOTED_STRING:
  782. case LWS_TOKZS_TOKEN:
  783. ts->token_len++;
  784. checknum:
  785. if (!(ts->flags & LWS_TOKENIZE_F_NO_INTEGERS)) {
  786. if (c < '0' || c > '9')
  787. num = 0;
  788. else
  789. if (num < 0)
  790. num = 1;
  791. }
  792. continue;
  793. case LWS_TOKZS_TOKEN_POST_TERMINAL:
  794. /* report the new token next time */
  795. ts->start--;
  796. ts->len++;
  797. goto token_or_numeric;
  798. }
  799. }
  800. /* we ran out of content */
  801. if (utf8) /* ended partway through a multibyte char */
  802. return LWS_TOKZE_ERR_BROKEN_UTF8;
  803. if (state == LWS_TOKZS_QUOTED_STRING)
  804. return LWS_TOKZE_ERR_UNTERM_STRING;
  805. if (state != LWS_TOKZS_TOKEN_POST_TERMINAL &&
  806. state != LWS_TOKZS_TOKEN) {
  807. if ((ts->flags & LWS_TOKENIZE_F_COMMA_SEP_LIST) &&
  808. ts->delim == LWSTZ_DT_NEED_NEXT_CONTENT)
  809. return LWS_TOKZE_ERR_COMMA_LIST;
  810. return LWS_TOKZE_ENDED;
  811. }
  812. /* report the pending token */
  813. token_or_numeric:
  814. if (num != 1)
  815. return LWS_TOKZE_TOKEN;
  816. if (flo)
  817. return LWS_TOKZE_FLOAT;
  818. return LWS_TOKZE_INTEGER;
  819. }
  820. int
  821. lws_tokenize_cstr(struct lws_tokenize *ts, char *str, size_t max)
  822. {
  823. if (ts->token_len + 1 >= max)
  824. return 1;
  825. memcpy(str, ts->token, ts->token_len);
  826. str[ts->token_len] = '\0';
  827. return 0;
  828. }
  829. void
  830. lws_tokenize_init(struct lws_tokenize *ts, const char *start, int flags)
  831. {
  832. ts->start = start;
  833. ts->len = 0x7fffffff;
  834. ts->flags = flags;
  835. ts->delim = LWSTZ_DT_NEED_FIRST_CONTENT;
  836. }
  837. typedef enum {
  838. LWS_EXPS_LITERAL,
  839. LWS_EXPS_OPEN_OR_LIT,
  840. LWS_EXPS_NAME_OR_CLOSE,
  841. LWS_EXPS_DRAIN,
  842. } lws_strexp_state;
  843. void
  844. lws_strexp_init(lws_strexp_t *exp, void *priv, lws_strexp_expand_cb cb,
  845. char *out, size_t olen)
  846. {
  847. memset(exp, 0, sizeof(*exp));
  848. exp->cb = cb;
  849. exp->out = out;
  850. exp->olen = olen;
  851. exp->state = LWS_EXPS_LITERAL;
  852. exp->priv = priv;
  853. }
  854. void
  855. lws_strexp_reset_out(lws_strexp_t *exp, char *out, size_t olen)
  856. {
  857. exp->out = out;
  858. exp->olen = olen;
  859. exp->pos = 0;
  860. }
  861. int
  862. lws_strexp_expand(lws_strexp_t *exp, const char *in, size_t len,
  863. size_t *pused_in, size_t *pused_out)
  864. {
  865. size_t used = 0;
  866. int n;
  867. while (used < len) {
  868. switch (exp->state) {
  869. case LWS_EXPS_LITERAL:
  870. if (*in == '$') {
  871. exp->state = LWS_EXPS_OPEN_OR_LIT;
  872. break;
  873. }
  874. if (exp->out)
  875. exp->out[exp->pos] = *in;
  876. exp->pos++;
  877. if (exp->olen - exp->pos < 1) {
  878. *pused_in = used + 1;
  879. *pused_out = exp->pos;
  880. return LSTRX_FILLED_OUT;
  881. }
  882. break;
  883. case LWS_EXPS_OPEN_OR_LIT:
  884. if (*in == '{') {
  885. exp->state = LWS_EXPS_NAME_OR_CLOSE;
  886. exp->name_pos = 0;
  887. exp->exp_ofs = 0;
  888. break;
  889. }
  890. /* treat as a literal */
  891. if (exp->olen - exp->pos < 3)
  892. return -1;
  893. if (exp->out) {
  894. exp->out[exp->pos++] = '$';
  895. exp->out[exp->pos++] = *in;
  896. } else
  897. exp->pos += 2;
  898. if (*in != '$')
  899. exp->state = LWS_EXPS_LITERAL;
  900. break;
  901. case LWS_EXPS_NAME_OR_CLOSE:
  902. if (*in == '}') {
  903. exp->name[exp->name_pos] = '\0';
  904. exp->state = LWS_EXPS_DRAIN;
  905. goto drain;
  906. }
  907. if (exp->name_pos >= sizeof(exp->name) - 1)
  908. return LSTRX_FATAL_NAME_TOO_LONG;
  909. exp->name[exp->name_pos++] = *in;
  910. break;
  911. case LWS_EXPS_DRAIN:
  912. drain:
  913. *pused_in = used;
  914. n = exp->cb(exp->priv, exp->name, exp->out, &exp->pos,
  915. exp->olen, &exp->exp_ofs);
  916. *pused_out = exp->pos;
  917. if (n == LSTRX_FILLED_OUT ||
  918. n == LSTRX_FATAL_NAME_UNKNOWN)
  919. return n;
  920. exp->state = LWS_EXPS_LITERAL;
  921. break;
  922. }
  923. used++;
  924. in++;
  925. }
  926. if (exp->out)
  927. exp->out[exp->pos] = '\0';
  928. *pused_in = used;
  929. *pused_out = exp->pos;
  930. return LSTRX_DONE;
  931. }
  932. #if LWS_MAX_SMP > 1
  933. void
  934. lws_mutex_refcount_init(struct lws_mutex_refcount *mr)
  935. {
  936. pthread_mutex_init(&mr->lock, NULL);
  937. mr->last_lock_reason = NULL;
  938. mr->lock_depth = 0;
  939. mr->metadata = 0;
  940. mr->lock_owner = 0;
  941. }
  942. void
  943. lws_mutex_refcount_destroy(struct lws_mutex_refcount *mr)
  944. {
  945. pthread_mutex_destroy(&mr->lock);
  946. }
  947. void
  948. lws_mutex_refcount_lock(struct lws_mutex_refcount *mr, const char *reason)
  949. {
  950. /* if true, this sequence is atomic because our thread has the lock
  951. *
  952. * - if true, only guy who can race to make it untrue is our thread,
  953. * and we are here.
  954. *
  955. * - if false, only guy who could race to make it true is our thread,
  956. * and we are here
  957. *
  958. * - it can be false and change to a different tid that is also false
  959. */
  960. if (mr->lock_owner == pthread_self()) {
  961. /* atomic because we only change it if we own the lock */
  962. mr->lock_depth++;
  963. return;
  964. }
  965. pthread_mutex_lock(&mr->lock);
  966. /* atomic because only we can have the lock */
  967. mr->last_lock_reason = reason;
  968. mr->lock_owner = pthread_self();
  969. mr->lock_depth = 1;
  970. //lwsl_notice("tid %d: lock %s\n", mr->tid, reason);
  971. }
  972. void
  973. lws_mutex_refcount_unlock(struct lws_mutex_refcount *mr)
  974. {
  975. if (--mr->lock_depth)
  976. /* atomic because only thread that has the lock can unlock */
  977. return;
  978. mr->last_lock_reason = "free";
  979. mr->lock_owner = 0;
  980. //lwsl_notice("tid %d: unlock %s\n", mr->tid, mr->last_lock_reason);
  981. pthread_mutex_unlock(&mr->lock);
  982. }
  983. void
  984. lws_mutex_refcount_assert_held(struct lws_mutex_refcount *mr)
  985. {
  986. assert(mr->lock_owner == pthread_self() && mr->lock_depth);
  987. }
  988. #endif /* SMP */
  989. const char *
  990. lws_cmdline_option(int argc, const char **argv, const char *val)
  991. {
  992. int n = (int)strlen(val), c = argc;
  993. while (--c > 0) {
  994. if (!strncmp(argv[c], val, n)) {
  995. if (!*(argv[c] + n) && c < argc - 1) {
  996. /* coverity treats unchecked argv as "tainted" */
  997. if (!argv[c + 1] || strlen(argv[c + 1]) > 1024)
  998. return NULL;
  999. return argv[c + 1];
  1000. }
  1001. if (argv[c][n] == '=')
  1002. return &argv[c][n + 1];
  1003. return argv[c] + n;
  1004. }
  1005. }
  1006. return NULL;
  1007. }
  1008. static const char * const builtins[] = {
  1009. "-d",
  1010. #if defined(LWS_WITH_UDP)
  1011. "--udp-tx-loss",
  1012. "--udp-rx-loss",
  1013. #endif
  1014. "--ignore-sigterm"
  1015. };
  1016. #if !defined(LWS_PLAT_FREERTOS)
  1017. static void
  1018. lws_sigterm_catch(int sig)
  1019. {
  1020. }
  1021. #endif
  1022. void
  1023. lws_cmdline_option_handle_builtin(int argc, const char **argv,
  1024. struct lws_context_creation_info *info)
  1025. {
  1026. const char *p;
  1027. int n, m, logs = LLL_USER | LLL_ERR | LLL_WARN | LLL_NOTICE;
  1028. for (n = 0; n < (int)LWS_ARRAY_SIZE(builtins); n++) {
  1029. p = lws_cmdline_option(argc, argv, builtins[n]);
  1030. if (!p)
  1031. continue;
  1032. m = atoi(p);
  1033. switch (n) {
  1034. case 0:
  1035. logs = m;
  1036. break;
  1037. #if defined(LWS_WITH_UDP)
  1038. case 1:
  1039. info->udp_loss_sim_tx_pc = m;
  1040. break;
  1041. case 2:
  1042. info->udp_loss_sim_rx_pc = m;
  1043. break;
  1044. case 3:
  1045. #else
  1046. case 1:
  1047. #endif
  1048. #if !defined(LWS_PLAT_FREERTOS)
  1049. signal(SIGTERM, lws_sigterm_catch);
  1050. #endif
  1051. break;
  1052. }
  1053. }
  1054. lws_set_log_level(logs, NULL);
  1055. }
  1056. const lws_humanize_unit_t humanize_schema_si[] = {
  1057. { "Pi ", LWS_PI }, { "Ti ", LWS_TI }, { "Gi ", LWS_GI },
  1058. { "Mi ", LWS_MI }, { "Ki ", LWS_KI }, { " ", 1 },
  1059. { NULL, 0 }
  1060. };
  1061. const lws_humanize_unit_t humanize_schema_si_bytes[] = {
  1062. { "PiB", LWS_PI }, { "TiB", LWS_TI }, { "GiB", LWS_GI },
  1063. { "MiB", LWS_MI }, { "KiB", LWS_KI }, { "B ", 1 },
  1064. { NULL, 0 }
  1065. };
  1066. const lws_humanize_unit_t humanize_schema_us[] = {
  1067. { "y ", (uint64_t)365 * 24 * 3600 * LWS_US_PER_SEC },
  1068. { "d ", (uint64_t)24 * 3600 * LWS_US_PER_SEC },
  1069. { "hr ", (uint64_t)3600 * LWS_US_PER_SEC },
  1070. { "min", 60 * LWS_US_PER_SEC },
  1071. { "s ", LWS_US_PER_SEC },
  1072. { "ms ", LWS_US_PER_MS },
  1073. { "us ", 1 },
  1074. { NULL, 0 }
  1075. };
  1076. static int
  1077. decim(char *r, uint64_t v, char chars, char leading)
  1078. {
  1079. int n = chars - 1;
  1080. uint64_t q = 1;
  1081. r += n;
  1082. while (n >= 0) {
  1083. if (v / q)
  1084. *r-- = '0' + ((v / q) % 10);
  1085. else
  1086. *r-- = leading ? '0' : ' ';
  1087. q = q * 10;
  1088. n--;
  1089. }
  1090. if (v / q)
  1091. /* the number is bigger than the allowed chars! */
  1092. r[1] = '!';
  1093. return chars;
  1094. }
  1095. int
  1096. lws_humanize(char *p, int len, uint64_t v, const lws_humanize_unit_t *schema)
  1097. {
  1098. char *end = p + len;
  1099. do {
  1100. if (v >= schema->factor || schema->factor == 1) {
  1101. if (schema->factor == 1) {
  1102. *p++ = ' ';
  1103. p += decim(p, v, 4, 0);
  1104. return lws_snprintf(p, lws_ptr_diff(end, p),
  1105. "%s ", schema->name);
  1106. }
  1107. *p++ = ' ';
  1108. p += decim(p, v / schema->factor, 4, 0);
  1109. *p++ = '.';
  1110. p += decim(p, (v % schema->factor) /
  1111. (schema->factor / 1000), 3, 1);
  1112. return lws_snprintf(p, lws_ptr_diff(end, p),
  1113. "%s", schema->name);
  1114. }
  1115. schema++;
  1116. } while (schema->name);
  1117. assert(0);
  1118. strncpy(p, "unknown value", len);
  1119. return 0;
  1120. }