private.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911
  1. /* Copyright (c) 2015-2017 the Civetweb developers
  2. *
  3. * Permission is hereby granted, free of charge, to any person obtaining a copy
  4. * of this software and associated documentation files (the "Software"), to deal
  5. * in the Software without restriction, including without limitation the rights
  6. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  7. * copies of the Software, and to permit persons to whom the Software is
  8. * furnished to do so, subject to the following conditions:
  9. *
  10. * The above copyright notice and this permission notice shall be included in
  11. * all copies or substantial portions of the Software.
  12. *
  13. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  14. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  15. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  16. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  17. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  18. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  19. * THE SOFTWARE.
  20. */
  21. /**
  22. * We include the source file so that we have access to the internal private
  23. * static functions
  24. */
  25. #ifdef _MSC_VER
  26. #ifndef _CRT_SECURE_NO_WARNINGS
  27. #define _CRT_SECURE_NO_WARNINGS
  28. #endif
  29. #define CIVETWEB_API static
  30. #endif
  31. #ifdef REPLACE_CHECK_FOR_LOCAL_DEBUGGING
  32. #undef MEMORY_DEBUGGING
  33. #endif
  34. #include "../src/civetweb.c"
  35. #include <stdlib.h>
  36. #include <time.h>
  37. #include "private.h"
  38. /* This unit test file uses the excellent Check unit testing library.
  39. * The API documentation is available here:
  40. * http://check.sourceforge.net/doc/check_html/index.html
  41. */
  42. START_TEST(test_parse_http_message)
  43. {
  44. /* Adapted from unit_test.c */
  45. /* Copyright (c) 2013-2015 the Civetweb developers */
  46. /* Copyright (c) 2004-2013 Sergey Lyubka */
  47. struct mg_request_info ri;
  48. struct mg_response_info respi;
  49. char empty[] = "";
  50. char space[] = " \x00";
  51. char req1[] = "GET / HTTP/1.1\r\n\r\n";
  52. char req2[] = "BLAH / HTTP/1.1\r\n\r\n";
  53. char req3[] = "GET / HTTP/1.1\nKey: Val\n\n";
  54. char req4[] =
  55. "GET / HTTP/1.1\r\nA: foo bar\r\nB: bar\r\nskip\r\nbaz:\r\n\r\n";
  56. char req5[] = "GET / HTTP/1.0\n\n";
  57. char req6[] = "G";
  58. char req7[] = " blah ";
  59. char req8[] = "HTTP/1.0 404 Not Found\n\n";
  60. char req9[] = "HTTP/1.1 200 OK\r\nConnection: close\r\n\r\n";
  61. char req10[] = "GET / HTTP/1.1\r\nA: foo bar\r\nB: bar\r\n\r\n";
  62. char req11[] = "GET /\r\nError: X\r\n\r\n";
  63. char req12[] =
  64. "POST /a/b/c.d?e=f&g HTTP/1.1\r\nKey1: val1\r\nKey2: val2\r\n\r\nBODY";
  65. int lenreq1 = (int)strlen(req1);
  66. int lenreq2 = (int)strlen(req2);
  67. int lenreq3 = (int)strlen(req3);
  68. int lenreq4 = (int)strlen(req4);
  69. int lenreq5 = (int)strlen(req5);
  70. int lenreq6 = (int)strlen(req6);
  71. int lenreq7 = (int)strlen(req7);
  72. int lenreq8 = (int)strlen(req8);
  73. int lenreq9 = (int)strlen(req9);
  74. int lenreq10 = (int)strlen(req10);
  75. int lenreq11 = (int)strlen(req11);
  76. int lenreq12 = (int)strlen(req12);
  77. int lenhdr12 = lenreq12 - 4; /* length without body */
  78. /* An empty string is neither a complete request nor a complete
  79. * response, so it must return 0 */
  80. ck_assert_int_eq(0, get_http_header_len(empty, 0));
  81. ck_assert_int_eq(0, parse_http_request(empty, 0, &ri));
  82. ck_assert_int_eq(0, parse_http_response(empty, 0, &respi));
  83. /* Same is true for a leading space */
  84. ck_assert_int_eq(0, get_http_header_len(space, 1));
  85. ck_assert_int_eq(0, parse_http_request(space, 1, &ri));
  86. ck_assert_int_eq(0, parse_http_response(space, 1, &respi));
  87. /* But a control character (like 0) makes it invalid */
  88. ck_assert_int_eq(-1, get_http_header_len(space, 2));
  89. ck_assert_int_eq(-1, parse_http_request(space, 2, &ri));
  90. ck_assert_int_eq(-1, parse_http_response(space, 2, &respi));
  91. /* req1 is a valid request */
  92. ck_assert_int_eq(lenreq1, get_http_header_len(req1, lenreq1));
  93. ck_assert_int_eq(lenreq1, parse_http_request(req1, lenreq1, &ri));
  94. ck_assert_str_eq("1.1", ri.http_version);
  95. ck_assert_int_eq(0, ri.num_headers);
  96. ck_assert_int_eq(-1, parse_http_response(req1, lenreq1, &respi));
  97. /* req1 minus 1 byte at the end is incomplete */
  98. ck_assert_int_eq(0, get_http_header_len(req1, lenreq1 - 1));
  99. /* req1 minus 1 byte at the start is complete but invalid */
  100. ck_assert_int_eq(lenreq1 - 1, get_http_header_len(req1 + 1, lenreq1 - 1));
  101. ck_assert_int_eq(-1, parse_http_request(req1 + 1, lenreq1 - 1, &ri));
  102. /* req2 is a complete, but invalid request */
  103. ck_assert_int_eq(lenreq2, get_http_header_len(req2, lenreq2));
  104. ck_assert_int_eq(-1, parse_http_request(req2, lenreq2, &ri));
  105. /* req3 is a complete and valid request */
  106. ck_assert_int_eq(lenreq3, get_http_header_len(req3, lenreq3));
  107. ck_assert_int_eq(lenreq3, parse_http_request(req3, lenreq3, &ri));
  108. ck_assert_int_eq(-1, parse_http_response(req3, lenreq3, &respi));
  109. /* Multiline header are obsolete, so return an error
  110. * (https://tools.ietf.org/html/rfc7230#section-3.2.4). */
  111. ck_assert_int_eq(-1, parse_http_request(req4, lenreq4, &ri));
  112. /* req5 is a complete and valid request (also somewhat malformed,
  113. * since it uses \n\n instead of \r\n\r\n) */
  114. ck_assert_int_eq(lenreq5, get_http_header_len(req5, lenreq5));
  115. ck_assert_int_eq(lenreq5, parse_http_request(req5, lenreq5, &ri));
  116. ck_assert_str_eq("GET", ri.request_method);
  117. ck_assert_str_eq("1.0", ri.http_version);
  118. ck_assert_int_eq(-1, parse_http_response(req5, lenreq5, &respi));
  119. /* req6 is incomplete */
  120. ck_assert_int_eq(0, get_http_header_len(req6, lenreq6));
  121. ck_assert_int_eq(0, parse_http_request(req6, lenreq6, &ri));
  122. /* req7 is invalid, but not yet complete */
  123. ck_assert_int_eq(0, get_http_header_len(req7, lenreq7));
  124. ck_assert_int_eq(0, parse_http_request(req7, lenreq7, &ri));
  125. /* req8 is a valid response */
  126. ck_assert_int_eq(lenreq8, get_http_header_len(req8, lenreq8));
  127. ck_assert_int_eq(-1, parse_http_request(req8, lenreq8, &ri));
  128. ck_assert_int_eq(lenreq8, parse_http_response(req8, lenreq8, &respi));
  129. /* req9 is a valid response */
  130. ck_assert_int_eq(lenreq9, get_http_header_len(req9, lenreq9));
  131. ck_assert_int_eq(-1, parse_http_request(req9, lenreq9, &ri));
  132. ck_assert_int_eq(lenreq9, parse_http_response(req9, lenreq9, &respi));
  133. ck_assert_int_eq(1, respi.num_headers);
  134. /* req10 is a valid request */
  135. ck_assert_int_eq(lenreq10, get_http_header_len(req10, lenreq10));
  136. ck_assert_int_eq(lenreq10, parse_http_request(req10, lenreq10, &ri));
  137. ck_assert_str_eq("1.1", ri.http_version);
  138. ck_assert_int_eq(2, ri.num_headers);
  139. ck_assert_str_eq("A", ri.http_headers[0].name);
  140. ck_assert_str_eq("foo bar", ri.http_headers[0].value);
  141. ck_assert_str_eq("B", ri.http_headers[1].name);
  142. ck_assert_str_eq("bar", ri.http_headers[1].value);
  143. /* req11 is a complete but valid request */
  144. ck_assert_int_eq(-1, parse_http_request(req11, lenreq11, &ri));
  145. /* req12 is a valid request with body data */
  146. ck_assert_int_gt(lenreq12, lenhdr12);
  147. ck_assert_int_eq(lenhdr12, get_http_header_len(req12, lenreq12));
  148. ck_assert_int_eq(lenhdr12, parse_http_request(req12, lenreq12, &ri));
  149. }
  150. END_TEST
  151. START_TEST(test_should_keep_alive)
  152. {
  153. /* Adapted from unit_test.c */
  154. /* Copyright (c) 2013-2015 the Civetweb developers */
  155. /* Copyright (c) 2004-2013 Sergey Lyubka */
  156. struct mg_connection conn;
  157. struct mg_context ctx;
  158. char req1[] = "GET / HTTP/1.1\r\n\r\n";
  159. char req2[] = "GET / HTTP/1.0\r\n\r\n";
  160. char req3[] = "GET / HTTP/1.1\r\nConnection: close\r\n\r\n";
  161. char req4[] = "GET / HTTP/1.1\r\nConnection: keep-alive\r\n\r\n";
  162. char yes[] = "yes";
  163. char no[] = "no";
  164. int lenreq1 = (int)strlen(req1);
  165. int lenreq2 = (int)strlen(req2);
  166. int lenreq3 = (int)strlen(req3);
  167. int lenreq4 = (int)strlen(req4);
  168. memset(&conn, 0, sizeof(conn));
  169. conn.ctx = &ctx;
  170. ck_assert_int_eq(parse_http_request(req1, lenreq1, &conn.request_info),
  171. lenreq1);
  172. ctx.config[ENABLE_KEEP_ALIVE] = no;
  173. ck_assert_int_eq(should_keep_alive(&conn), 0);
  174. ctx.config[ENABLE_KEEP_ALIVE] = yes;
  175. ck_assert_int_eq(should_keep_alive(&conn), 1);
  176. conn.must_close = 1;
  177. ck_assert_int_eq(should_keep_alive(&conn), 0);
  178. conn.must_close = 0;
  179. parse_http_request(req2, lenreq2, &conn.request_info);
  180. ck_assert_int_eq(should_keep_alive(&conn), 0);
  181. parse_http_request(req3, lenreq3, &conn.request_info);
  182. ck_assert_int_eq(should_keep_alive(&conn), 0);
  183. parse_http_request(req4, lenreq4, &conn.request_info);
  184. ck_assert_int_eq(should_keep_alive(&conn), 1);
  185. conn.status_code = 401;
  186. ck_assert_int_eq(should_keep_alive(&conn), 0);
  187. conn.status_code = 200;
  188. conn.must_close = 1;
  189. ck_assert_int_eq(should_keep_alive(&conn), 0);
  190. }
  191. END_TEST
  192. START_TEST(test_match_prefix)
  193. {
  194. /* Adapted from unit_test.c */
  195. /* Copyright (c) 2013-2015 the Civetweb developers */
  196. /* Copyright (c) 2004-2013 Sergey Lyubka */
  197. ck_assert_int_eq(4, match_prefix("/api", 4, "/api"));
  198. ck_assert_int_eq(3, match_prefix("/a/", 3, "/a/b/c"));
  199. ck_assert_int_eq(-1, match_prefix("/a/", 3, "/ab/c"));
  200. ck_assert_int_eq(4, match_prefix("/*/", 3, "/ab/c"));
  201. ck_assert_int_eq(6, match_prefix("**", 2, "/a/b/c"));
  202. ck_assert_int_eq(2, match_prefix("/*", 2, "/a/b/c"));
  203. ck_assert_int_eq(2, match_prefix("*/*", 3, "/a/b/c"));
  204. ck_assert_int_eq(5, match_prefix("**/", 3, "/a/b/c"));
  205. ck_assert_int_eq(5, match_prefix("**.foo|**.bar", 13, "a.bar"));
  206. ck_assert_int_eq(2, match_prefix("a|b|cd", 6, "cdef"));
  207. ck_assert_int_eq(2, match_prefix("a|b|c?", 6, "cdef"));
  208. ck_assert_int_eq(1, match_prefix("a|?|cd", 6, "cdef"));
  209. ck_assert_int_eq(-1, match_prefix("/a/**.cgi", 9, "/foo/bar/x.cgi"));
  210. ck_assert_int_eq(12, match_prefix("/a/**.cgi", 9, "/a/bar/x.cgi"));
  211. ck_assert_int_eq(5, match_prefix("**/", 3, "/a/b/c"));
  212. ck_assert_int_eq(-1, match_prefix("**/$", 4, "/a/b/c"));
  213. ck_assert_int_eq(5, match_prefix("**/$", 4, "/a/b/"));
  214. ck_assert_int_eq(0, match_prefix("$", 1, ""));
  215. ck_assert_int_eq(-1, match_prefix("$", 1, "x"));
  216. ck_assert_int_eq(1, match_prefix("*$", 2, "x"));
  217. ck_assert_int_eq(1, match_prefix("/$", 2, "/"));
  218. ck_assert_int_eq(-1, match_prefix("**/$", 4, "/a/b/c"));
  219. ck_assert_int_eq(5, match_prefix("**/$", 4, "/a/b/"));
  220. ck_assert_int_eq(0, match_prefix("*", 1, "/hello/"));
  221. ck_assert_int_eq(-1, match_prefix("**.a$|**.b$", 11, "/a/b.b/"));
  222. ck_assert_int_eq(6, match_prefix("**.a$|**.b$", 11, "/a/b.b"));
  223. ck_assert_int_eq(6, match_prefix("**.a$|**.b$", 11, "/a/B.A"));
  224. ck_assert_int_eq(5, match_prefix("**o$", 4, "HELLO"));
  225. }
  226. END_TEST
  227. START_TEST(test_remove_double_dots_and_double_slashes)
  228. {
  229. /* Adapted from unit_test.c */
  230. /* Copyright (c) 2013-2015 the Civetweb developers */
  231. /* Copyright (c) 2004-2013 Sergey Lyubka */
  232. struct {
  233. char before[20], after[20];
  234. } data[] = {
  235. {"////a", "/a"},
  236. {"/.....", "/."},
  237. {"/......", "/"},
  238. {"..", "."},
  239. {"...", "."},
  240. {"/...///", "/./"},
  241. {"/a...///", "/a.../"},
  242. {"/.x", "/.x"},
  243. {"/\\", "/"},
  244. {"/a\\", "/a\\"},
  245. {"/a\\\\...", "/a\\."},
  246. };
  247. size_t i;
  248. for (i = 0; i < ARRAY_SIZE(data); i++) {
  249. remove_double_dots_and_double_slashes(data[i].before);
  250. ck_assert_str_eq(data[i].before, data[i].after);
  251. }
  252. }
  253. END_TEST
  254. START_TEST(test_is_valid_uri)
  255. {
  256. /* is_valid_uri is superseeded by get_uri_type */
  257. ck_assert_int_eq(2, get_uri_type("/api"));
  258. ck_assert_int_eq(2, get_uri_type("/api/"));
  259. ck_assert_int_eq(2,
  260. get_uri_type("/some/long/path%20with%20space/file.xyz"));
  261. ck_assert_int_eq(0, get_uri_type("api"));
  262. ck_assert_int_eq(1, get_uri_type("*"));
  263. ck_assert_int_eq(0, get_uri_type("*xy"));
  264. ck_assert_int_eq(3, get_uri_type("http://somewhere/"));
  265. ck_assert_int_eq(3, get_uri_type("https://somewhere/some/file.html"));
  266. ck_assert_int_eq(4, get_uri_type("http://somewhere:8080/"));
  267. ck_assert_int_eq(4, get_uri_type("https://somewhere:8080/some/file.html"));
  268. }
  269. END_TEST
  270. START_TEST(test_next_option)
  271. {
  272. /* Adapted from unit_test.c */
  273. /* Copyright (c) 2013-2015 the Civetweb developers */
  274. /* Copyright (c) 2004-2013 Sergey Lyubka */
  275. const char *p, *list = "x/8,/y**=1;2k,z";
  276. struct vec a, b;
  277. int i;
  278. ck_assert(next_option(NULL, &a, &b) == NULL);
  279. for (i = 0, p = list; (p = next_option(p, &a, &b)) != NULL; i++) {
  280. ck_assert(i != 0 || (a.ptr == list && a.len == 3 && b.len == 0));
  281. ck_assert(i != 1
  282. || (a.ptr == list + 4 && a.len == 4 && b.ptr == list + 9
  283. && b.len == 4));
  284. ck_assert(i != 2 || (a.ptr == list + 14 && a.len == 1 && b.len == 0));
  285. }
  286. }
  287. END_TEST
  288. START_TEST(test_skip_quoted)
  289. {
  290. /* Adapted from unit_test.c */
  291. /* Copyright (c) 2013-2015 the Civetweb developers */
  292. /* Copyright (c) 2004-2013 Sergey Lyubka */
  293. char x[] = "a=1, b=2, c='hi \' there', d='here\\, there'", *s = x, *p;
  294. p = skip_quoted(&s, ", ", ", ", 0);
  295. ck_assert(p != NULL && !strcmp(p, "a=1"));
  296. p = skip_quoted(&s, ", ", ", ", 0);
  297. ck_assert(p != NULL && !strcmp(p, "b=2"));
  298. p = skip_quoted(&s, ",", " ", 0);
  299. ck_assert(p != NULL && !strcmp(p, "c='hi \' there'"));
  300. p = skip_quoted(&s, ",", " ", '\\');
  301. ck_assert(p != NULL && !strcmp(p, "d='here, there'"));
  302. ck_assert(*s == 0);
  303. }
  304. END_TEST
  305. static int
  306. alloc_printf(char **buf, size_t size, const char *fmt, ...)
  307. {
  308. /* Test helper function - adapted from unit_test.c */
  309. /* Copyright (c) 2013-2015 the Civetweb developers */
  310. /* Copyright (c) 2004-2013 Sergey Lyubka */
  311. va_list ap;
  312. int ret = 0;
  313. va_start(ap, fmt);
  314. ret = alloc_vprintf(buf, *buf, size, fmt, ap);
  315. va_end(ap);
  316. return ret;
  317. }
  318. static int
  319. alloc_printf2(char **buf, const char *fmt, ...)
  320. {
  321. /* Test alternative implementation */
  322. va_list ap;
  323. int ret = 0;
  324. va_start(ap, fmt);
  325. ret = alloc_vprintf2(buf, fmt, ap);
  326. va_end(ap);
  327. return ret;
  328. }
  329. START_TEST(test_alloc_vprintf)
  330. {
  331. /* Adapted from unit_test.c */
  332. /* Copyright (c) 2013-2015 the Civetweb developers */
  333. /* Copyright (c) 2004-2013 Sergey Lyubka */
  334. char buf[MG_BUF_LEN], *p = buf;
  335. ck_assert(alloc_printf(&p, sizeof(buf), "%s", "hi") == 2);
  336. ck_assert(p == buf);
  337. ck_assert(alloc_printf(&p, sizeof(buf), "%s", "") == 0);
  338. ck_assert(p == buf);
  339. ck_assert(alloc_printf(&p, sizeof(buf), "") == 0);
  340. ck_assert(p == buf);
  341. /* Pass small buffer, make sure alloc_printf allocates */
  342. ck_assert(alloc_printf(&p, 1, "%s", "hello") == 5);
  343. ck_assert(p != buf);
  344. mg_free(p);
  345. p = buf;
  346. /* Test alternative implementation */
  347. ck_assert(alloc_printf2(&p, "%s", "hello") == 5);
  348. ck_assert(p != buf);
  349. mg_free(p);
  350. p = buf;
  351. }
  352. END_TEST
  353. START_TEST(test_mg_vsnprintf)
  354. {
  355. char buf[16];
  356. int is_trunc;
  357. memset(buf, 0, sizeof(buf));
  358. is_trunc = 777;
  359. mg_snprintf(NULL, &is_trunc, buf, 10, "%8i", 123);
  360. ck_assert_str_eq(buf, " 123");
  361. ck_assert_int_eq(is_trunc, 0);
  362. is_trunc = 777;
  363. mg_snprintf(NULL, &is_trunc, buf, 10, "%9i", 123);
  364. ck_assert_str_eq(buf, " 123");
  365. ck_assert_int_eq(is_trunc, 0);
  366. is_trunc = 777;
  367. mg_snprintf(NULL, &is_trunc, buf, 9, "%9i", 123);
  368. ck_assert_str_eq(buf, " 12");
  369. ck_assert_int_eq(is_trunc, 1);
  370. is_trunc = 777;
  371. mg_snprintf(NULL, &is_trunc, buf, 8, "%9i", 123);
  372. ck_assert_str_eq(buf, " 1");
  373. ck_assert_int_eq(is_trunc, 1);
  374. is_trunc = 777;
  375. mg_snprintf(NULL, &is_trunc, buf, 7, "%9i", 123);
  376. ck_assert_str_eq(buf, " ");
  377. ck_assert_int_eq(is_trunc, 1);
  378. strcpy(buf, "1234567890");
  379. mg_snprintf(NULL, &is_trunc, buf, 0, "%i", 543);
  380. ck_assert_str_eq(buf, "1234567890");
  381. }
  382. END_TEST
  383. START_TEST(test_mg_strcasestr)
  384. {
  385. /* Adapted from unit_test.c */
  386. /* Copyright (c) 2013-2015 the Civetweb developers */
  387. /* Copyright (c) 2004-2013 Sergey Lyubka */
  388. static const char *big1 = "abcdef";
  389. ck_assert(mg_strcasestr("Y", "X") == NULL);
  390. ck_assert(mg_strcasestr("Y", "y") != NULL);
  391. ck_assert(mg_strcasestr(big1, "X") == NULL);
  392. ck_assert(mg_strcasestr(big1, "CD") == big1 + 2);
  393. ck_assert(mg_strcasestr("aa", "AAB") == NULL);
  394. }
  395. END_TEST
  396. START_TEST(test_parse_port_string)
  397. {
  398. /* Adapted from unit_test.c */
  399. /* Copyright (c) 2013-2015 the Civetweb developers */
  400. /* Copyright (c) 2004-2013 Sergey Lyubka */
  401. static const char *valid[] =
  402. { "0",
  403. "1",
  404. "1s",
  405. "1r",
  406. "1.2.3.4:1",
  407. "1.2.3.4:1s",
  408. "1.2.3.4:1r",
  409. #if defined(USE_IPV6)
  410. "[::1]:123",
  411. "[::]:80",
  412. "[3ffe:2a00:100:7031::1]:900",
  413. "+80",
  414. #endif
  415. NULL };
  416. static const char *invalid[] = {
  417. "99999", "1k", "1.2.3", "1.2.3.4:", "1.2.3.4:2p", NULL};
  418. struct socket so;
  419. struct vec vec;
  420. int ip_family;
  421. int i;
  422. for (i = 0; valid[i] != NULL; i++) {
  423. vec.ptr = valid[i];
  424. vec.len = strlen(vec.ptr);
  425. ip_family = 123;
  426. ck_assert_int_ne(parse_port_string(&vec, &so, &ip_family), 0);
  427. if (i < 7) {
  428. ck_assert_int_eq(ip_family, 4);
  429. } else if (i < 10) {
  430. ck_assert_int_eq(ip_family, 6);
  431. } else {
  432. ck_assert_int_eq(ip_family, 4 + 6);
  433. }
  434. }
  435. for (i = 0; invalid[i] != NULL; i++) {
  436. vec.ptr = invalid[i];
  437. vec.len = strlen(vec.ptr);
  438. ip_family = 123;
  439. ck_assert_int_eq(parse_port_string(&vec, &so, &ip_family), 0);
  440. ck_assert_int_eq(ip_family, 0);
  441. }
  442. }
  443. END_TEST
  444. START_TEST(test_encode_decode)
  445. {
  446. char buf[128];
  447. const char *alpha = "abcdefghijklmnopqrstuvwxyz";
  448. const char *nonalpha = " !\"#$%&'()*+,-./0123456789:;<=>?@";
  449. const char *nonalpha_url_enc1 =
  450. "%20%21%22%23$%25%26%27()%2a%2b,-.%2f0123456789%3a;%3c%3d%3e%3f%40";
  451. const char *nonalpha_url_enc2 =
  452. "%20!%22%23%24%25%26'()*%2B%2C-.%2F0123456789%3A%3B%3C%3D%3E%3F%40";
  453. int ret;
  454. size_t len;
  455. #if defined(USE_WEBSOCKET) || defined(USE_LUA)
  456. const char *alpha_b64_enc = "YWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXo=";
  457. const char *nonalpha_b64_enc =
  458. "ICEiIyQlJicoKSorLC0uLzAxMjM0NTY3ODk6Ozw9Pj9A";
  459. memset(buf, 77, sizeof(buf));
  460. base64_encode((unsigned char *)"a", 1, buf);
  461. ck_assert_str_eq(buf, "YQ==");
  462. memset(buf, 77, sizeof(buf));
  463. base64_encode((unsigned char *)"ab", 1, buf);
  464. ck_assert_str_eq(buf, "YQ==");
  465. memset(buf, 77, sizeof(buf));
  466. base64_encode((unsigned char *)"ab", 2, buf);
  467. ck_assert_str_eq(buf, "YWI=");
  468. memset(buf, 77, sizeof(buf));
  469. base64_encode((unsigned char *)alpha, 3, buf);
  470. ck_assert_str_eq(buf, "YWJj");
  471. memset(buf, 77, sizeof(buf));
  472. base64_encode((unsigned char *)alpha, 4, buf);
  473. ck_assert_str_eq(buf, "YWJjZA==");
  474. memset(buf, 77, sizeof(buf));
  475. base64_encode((unsigned char *)alpha, 5, buf);
  476. ck_assert_str_eq(buf, "YWJjZGU=");
  477. memset(buf, 77, sizeof(buf));
  478. base64_encode((unsigned char *)alpha, 6, buf);
  479. ck_assert_str_eq(buf, "YWJjZGVm");
  480. memset(buf, 77, sizeof(buf));
  481. base64_encode((unsigned char *)alpha, (int)strlen(alpha), buf);
  482. ck_assert_str_eq(buf, alpha_b64_enc);
  483. memset(buf, 77, sizeof(buf));
  484. base64_encode((unsigned char *)nonalpha, (int)strlen(nonalpha), buf);
  485. ck_assert_str_eq(buf, nonalpha_b64_enc);
  486. #endif
  487. #if defined(USE_LUA)
  488. memset(buf, 77, sizeof(buf));
  489. len = 9999;
  490. ret = base64_decode((unsigned char *)alpha_b64_enc,
  491. (int)strlen(alpha_b64_enc),
  492. buf,
  493. &len);
  494. ck_assert_int_eq(ret, -1);
  495. ck_assert_uint_eq((unsigned int)len, (unsigned int)strlen(alpha));
  496. ck_assert_str_eq(buf, alpha);
  497. memset(buf, 77, sizeof(buf));
  498. len = 9999;
  499. ret = base64_decode((unsigned char *)"AAA*AAA", 7, buf, &len);
  500. ck_assert_int_eq(ret, 3);
  501. #endif
  502. memset(buf, 77, sizeof(buf));
  503. ret = mg_url_encode(alpha, buf, sizeof(buf));
  504. ck_assert_int_eq(ret, (int)strlen(buf));
  505. ck_assert_int_eq(ret, (int)strlen(alpha));
  506. ck_assert_str_eq(buf, alpha);
  507. memset(buf, 77, sizeof(buf));
  508. ret = mg_url_encode(nonalpha, buf, sizeof(buf));
  509. ck_assert_int_eq(ret, (int)strlen(buf));
  510. ck_assert_int_eq(ret, (int)strlen(nonalpha_url_enc1));
  511. ck_assert_str_eq(buf, nonalpha_url_enc1);
  512. memset(buf, 77, sizeof(buf));
  513. ret = mg_url_decode(alpha, (int)strlen(alpha), buf, sizeof(buf), 0);
  514. ck_assert_int_eq(ret, (int)strlen(buf));
  515. ck_assert_int_eq(ret, (int)strlen(alpha));
  516. ck_assert_str_eq(buf, alpha);
  517. memset(buf, 77, sizeof(buf));
  518. ret = mg_url_decode(
  519. nonalpha_url_enc1, (int)strlen(nonalpha_url_enc1), buf, sizeof(buf), 0);
  520. ck_assert_int_eq(ret, (int)strlen(buf));
  521. ck_assert_int_eq(ret, (int)strlen(nonalpha));
  522. ck_assert_str_eq(buf, nonalpha);
  523. memset(buf, 77, sizeof(buf));
  524. ret = mg_url_decode(
  525. nonalpha_url_enc2, (int)strlen(nonalpha_url_enc2), buf, sizeof(buf), 0);
  526. ck_assert_int_eq(ret, (int)strlen(buf));
  527. ck_assert_int_eq(ret, (int)strlen(nonalpha));
  528. ck_assert_str_eq(buf, nonalpha);
  529. /* len could be unused, if base64_decode is not tested because USE_LUA is
  530. * not defined */
  531. (void)len;
  532. }
  533. END_TEST
  534. START_TEST(test_mask_data)
  535. {
  536. #if defined(USE_WEBSOCKET)
  537. char in[1024];
  538. char out[1024];
  539. int i;
  540. #endif
  541. uint32_t mask = 0x61626364;
  542. /* TODO: adapt test for big endian */
  543. ck_assert((*(unsigned char *)&mask) == 0x64u);
  544. #if defined(USE_WEBSOCKET)
  545. memset(in, 0, sizeof(in));
  546. memset(out, 99, sizeof(out));
  547. mask_data(in, sizeof(out), 0, out);
  548. ck_assert(!memcmp(out, in, sizeof(out)));
  549. for (i = 0; i < 1024; i++) {
  550. in[i] = (char)((unsigned char)i);
  551. }
  552. mask_data(in, 107, 0, out);
  553. ck_assert(!memcmp(out, in, 107));
  554. mask_data(in, 256, 0x01010101, out);
  555. for (i = 0; i < 256; i++) {
  556. ck_assert_int_eq((int)((unsigned char)out[i]),
  557. (int)(((unsigned char)in[i]) ^ (char)1u));
  558. }
  559. for (i = 256; i < (int)sizeof(out); i++) {
  560. ck_assert_int_eq((int)((unsigned char)out[i]), (int)0);
  561. }
  562. /* TODO: check this for big endian */
  563. mask_data(in, 5, 0x01020304, out);
  564. ck_assert_uint_eq((unsigned char)out[0], 0u ^ 4u);
  565. ck_assert_uint_eq((unsigned char)out[1], 1u ^ 3u);
  566. ck_assert_uint_eq((unsigned char)out[2], 2u ^ 2u);
  567. ck_assert_uint_eq((unsigned char)out[3], 3u ^ 1u);
  568. ck_assert_uint_eq((unsigned char)out[4], 4u ^ 4u);
  569. #endif
  570. }
  571. END_TEST
  572. START_TEST(test_parse_date_string)
  573. {
  574. #if !defined(NO_CACHING)
  575. time_t now = time(0);
  576. struct tm *tm = gmtime(&now);
  577. char date[64] = {0};
  578. unsigned long i;
  579. ck_assert_uint_eq((unsigned long)parse_date_string("1/Jan/1970 00:01:02"),
  580. 62ul);
  581. ck_assert_uint_eq((unsigned long)parse_date_string("1 Jan 1970 00:02:03"),
  582. 123ul);
  583. ck_assert_uint_eq((unsigned long)parse_date_string("1-Jan-1970 00:03:04"),
  584. 184ul);
  585. ck_assert_uint_eq((unsigned long)parse_date_string(
  586. "Xyz, 1 Jan 1970 00:04:05"),
  587. 245ul);
  588. gmt_time_string(date, sizeof(date), &now);
  589. ck_assert_uint_eq((uintmax_t)parse_date_string(date), (uintmax_t)now);
  590. sprintf(date,
  591. "%02u %s %04u %02u:%02u:%02u",
  592. tm->tm_mday,
  593. month_names[tm->tm_mon],
  594. tm->tm_year + 1900,
  595. tm->tm_hour,
  596. tm->tm_min,
  597. tm->tm_sec);
  598. ck_assert_uint_eq((uintmax_t)parse_date_string(date), (uintmax_t)now);
  599. gmt_time_string(date, 1, NULL);
  600. ck_assert_str_eq(date, "");
  601. gmt_time_string(date, 6, NULL);
  602. ck_assert_str_eq(date,
  603. "Thu, "); /* part of "Thu, 01 Jan 1970 00:00:00 GMT" */
  604. gmt_time_string(date, sizeof(date), NULL);
  605. ck_assert_str_eq(date, "Thu, 01 Jan 1970 00:00:00 GMT");
  606. for (i = 2ul; i < 0x8000000ul; i += i / 2) {
  607. now = (time_t)i;
  608. gmt_time_string(date, sizeof(date), &now);
  609. ck_assert_uint_eq((uintmax_t)parse_date_string(date), (uintmax_t)now);
  610. tm = gmtime(&now);
  611. sprintf(date,
  612. "%02u-%s-%04u %02u:%02u:%02u",
  613. tm->tm_mday,
  614. month_names[tm->tm_mon],
  615. tm->tm_year + 1900,
  616. tm->tm_hour,
  617. tm->tm_min,
  618. tm->tm_sec);
  619. ck_assert_uint_eq((uintmax_t)parse_date_string(date), (uintmax_t)now);
  620. }
  621. #endif
  622. }
  623. END_TEST
  624. START_TEST(test_sha1)
  625. {
  626. #ifdef SHA1_DIGEST_SIZE
  627. SHA_CTX sha_ctx;
  628. uint8_t digest[SHA1_DIGEST_SIZE] = {0};
  629. char str[48] = {0};
  630. int i;
  631. const char *test_str;
  632. ck_assert_uint_eq(sizeof(digest), 20);
  633. ck_assert_uint_gt(sizeof(str), sizeof(digest) * 2 + 1);
  634. /* empty string */
  635. SHA1_Init(&sha_ctx);
  636. SHA1_Final(digest, &sha_ctx);
  637. bin2str(str, digest, sizeof(digest));
  638. ck_assert_uint_eq(strlen(str), 40);
  639. ck_assert_str_eq(str, "da39a3ee5e6b4b0d3255bfef95601890afd80709");
  640. /* empty string */
  641. SHA1_Init(&sha_ctx);
  642. SHA1_Update(&sha_ctx, (uint8_t *)"abc", 0);
  643. SHA1_Final(digest, &sha_ctx);
  644. bin2str(str, digest, sizeof(digest));
  645. ck_assert_uint_eq(strlen(str), 40);
  646. ck_assert_str_eq(str, "da39a3ee5e6b4b0d3255bfef95601890afd80709");
  647. /* "abc" */
  648. SHA1_Init(&sha_ctx);
  649. SHA1_Update(&sha_ctx, (uint8_t *)"abc", 3);
  650. SHA1_Final(digest, &sha_ctx);
  651. bin2str(str, digest, sizeof(digest));
  652. ck_assert_uint_eq(strlen(str), 40);
  653. ck_assert_str_eq(str, "a9993e364706816aba3e25717850c26c9cd0d89d");
  654. /* "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" */
  655. test_str = "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
  656. SHA1_Init(&sha_ctx);
  657. SHA1_Update(&sha_ctx, (uint8_t *)test_str, (uint32_t)strlen(test_str));
  658. SHA1_Final(digest, &sha_ctx);
  659. bin2str(str, digest, sizeof(digest));
  660. ck_assert_uint_eq(strlen(str), 40);
  661. ck_assert_str_eq(str, "84983e441c3bd26ebaae4aa1f95129e5e54670f1");
  662. /* a million "a" */
  663. SHA1_Init(&sha_ctx);
  664. for (i = 0; i < 1000000; i++) {
  665. SHA1_Update(&sha_ctx, (uint8_t *)"a", 1);
  666. }
  667. SHA1_Final(digest, &sha_ctx);
  668. bin2str(str, digest, sizeof(digest));
  669. ck_assert_uint_eq(strlen(str), 40);
  670. ck_assert_str_eq(str, "34aa973cd4c4daa4f61eeb2bdbad27316534016f");
  671. /* a million "a" in blocks of 10 */
  672. SHA1_Init(&sha_ctx);
  673. for (i = 0; i < 100000; i++) {
  674. SHA1_Update(&sha_ctx, (uint8_t *)"aaaaaaaaaa", 10);
  675. }
  676. SHA1_Final(digest, &sha_ctx);
  677. bin2str(str, digest, sizeof(digest));
  678. ck_assert_uint_eq(strlen(str), 40);
  679. ck_assert_str_eq(str, "34aa973cd4c4daa4f61eeb2bdbad27316534016f");
  680. #else
  681. /* Can not test, if SHA1 is not included */
  682. ck_assert(1);
  683. #endif
  684. }
  685. END_TEST
  686. Suite *
  687. make_private_suite(void)
  688. {
  689. Suite *const suite = suite_create("Private");
  690. TCase *const tcase_http_message = tcase_create("HTTP Message");
  691. TCase *const tcase_url_parsing = tcase_create("URL Parsing");
  692. TCase *const tcase_internal_parse = tcase_create("Internal Parsing");
  693. TCase *const tcase_encode_decode = tcase_create("Encode Decode");
  694. TCase *const tcase_mask_data = tcase_create("Mask Data");
  695. TCase *const tcase_parse_date_string = tcase_create("Date Parsing");
  696. TCase *const tcase_sha1 = tcase_create("SHA1");
  697. tcase_add_test(tcase_http_message, test_parse_http_message);
  698. tcase_add_test(tcase_http_message, test_should_keep_alive);
  699. tcase_set_timeout(tcase_http_message, civetweb_min_test_timeout);
  700. suite_add_tcase(suite, tcase_http_message);
  701. tcase_add_test(tcase_url_parsing, test_match_prefix);
  702. tcase_add_test(tcase_url_parsing,
  703. test_remove_double_dots_and_double_slashes);
  704. tcase_add_test(tcase_url_parsing, test_is_valid_uri);
  705. tcase_set_timeout(tcase_url_parsing, civetweb_min_test_timeout);
  706. suite_add_tcase(suite, tcase_url_parsing);
  707. tcase_add_test(tcase_internal_parse, test_next_option);
  708. tcase_add_test(tcase_internal_parse, test_skip_quoted);
  709. tcase_add_test(tcase_internal_parse, test_mg_strcasestr);
  710. tcase_add_test(tcase_internal_parse, test_alloc_vprintf);
  711. tcase_add_test(tcase_internal_parse, test_mg_vsnprintf);
  712. tcase_add_test(tcase_internal_parse, test_parse_port_string);
  713. tcase_set_timeout(tcase_internal_parse, civetweb_min_test_timeout);
  714. suite_add_tcase(suite, tcase_internal_parse);
  715. tcase_add_test(tcase_encode_decode, test_encode_decode);
  716. tcase_set_timeout(tcase_encode_decode, civetweb_min_test_timeout);
  717. suite_add_tcase(suite, tcase_encode_decode);
  718. tcase_add_test(tcase_mask_data, test_mask_data);
  719. tcase_set_timeout(tcase_mask_data, civetweb_min_test_timeout);
  720. suite_add_tcase(suite, tcase_mask_data);
  721. tcase_add_test(tcase_parse_date_string, test_parse_date_string);
  722. tcase_set_timeout(tcase_parse_date_string, civetweb_min_test_timeout);
  723. suite_add_tcase(suite, tcase_parse_date_string);
  724. tcase_add_test(tcase_sha1, test_sha1);
  725. tcase_set_timeout(tcase_sha1, civetweb_min_test_timeout);
  726. suite_add_tcase(suite, tcase_sha1);
  727. return suite;
  728. }
  729. #ifdef REPLACE_CHECK_FOR_LOCAL_DEBUGGING
  730. /* Used to debug test cases without using the check framework */
  731. void
  732. MAIN_PRIVATE(void)
  733. {
  734. #if defined(_WIN32)
  735. /* test_parse_port_string requires WSAStartup for IPv6 */
  736. WSADATA data;
  737. WSAStartup(MAKEWORD(2, 2), &data);
  738. #endif
  739. test_alloc_vprintf(0);
  740. test_mg_vsnprintf(0);
  741. test_remove_double_dots_and_double_slashes(0);
  742. test_parse_date_string(0);
  743. test_parse_port_string(0);
  744. test_parse_http_message(0);
  745. test_sha1(0);
  746. #if defined(_WIN32)
  747. WSACleanup();
  748. #endif
  749. }
  750. #endif