public_func.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426
  1. /* Copyright (c) 2015 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. #ifdef _MSC_VER
  22. #define _CRT_SECURE_NO_WARNINGS
  23. #endif
  24. #include <stdlib.h>
  25. #include <stdio.h>
  26. #include "public_func.h"
  27. #include <civetweb.h>
  28. /* This unit test file uses the excellent Check unit testing library.
  29. * The API documentation is available here:
  30. * http://check.sourceforge.net/doc/check_html/index.html
  31. */
  32. START_TEST(test_mg_version)
  33. {
  34. const char *ver = mg_version();
  35. unsigned major = 0, minor = 0;
  36. int ret;
  37. ck_assert(ver != NULL);
  38. ck_assert_str_eq(ver, CIVETWEB_VERSION);
  39. /* check structure of version string */
  40. ret = sscanf(ver, "%u.%u", &major, &minor);
  41. ck_assert_int_eq(ret, 2);
  42. ck_assert_uint_ge(major, 1);
  43. }
  44. END_TEST
  45. START_TEST(test_mg_get_valid_options)
  46. {
  47. int i;
  48. const struct mg_option *default_options = mg_get_valid_options();
  49. ck_assert(default_options != NULL);
  50. for (i = 0; default_options[i].name != NULL; i++) {
  51. ck_assert(default_options[i].name != NULL);
  52. ck_assert(strlen(default_options[i].name) > 0);
  53. ck_assert(((int)default_options[i].type) > 0);
  54. }
  55. ck_assert(i > 0);
  56. }
  57. END_TEST
  58. START_TEST(test_mg_get_builtin_mime_type)
  59. {
  60. ck_assert_str_eq(mg_get_builtin_mime_type("x.txt"), "text/plain");
  61. ck_assert_str_eq(mg_get_builtin_mime_type("x.html"), "text/html");
  62. ck_assert_str_eq(mg_get_builtin_mime_type("x.HTML"), "text/html");
  63. ck_assert_str_eq(mg_get_builtin_mime_type("x.hTmL"), "text/html");
  64. ck_assert_str_eq(mg_get_builtin_mime_type("/abc/def/ghi.htm"), "text/html");
  65. ck_assert_str_eq(mg_get_builtin_mime_type("x.unknown_extention_xyz"),
  66. "text/plain");
  67. }
  68. END_TEST
  69. START_TEST(test_mg_strncasecmp)
  70. {
  71. ck_assert(mg_strncasecmp("abc", "abc", 3) == 0);
  72. ck_assert(mg_strncasecmp("abc", "abcd", 3) == 0);
  73. ck_assert(mg_strncasecmp("abc", "abcd", 4) != 0);
  74. ck_assert(mg_strncasecmp("a", "A", 1) == 0);
  75. ck_assert(mg_strncasecmp("A", "B", 1) < 0);
  76. ck_assert(mg_strncasecmp("A", "b", 1) < 0);
  77. ck_assert(mg_strncasecmp("a", "B", 1) < 0);
  78. ck_assert(mg_strncasecmp("a", "b", 1) < 0);
  79. ck_assert(mg_strncasecmp("b", "A", 1) > 0);
  80. ck_assert(mg_strncasecmp("B", "A", 1) > 0);
  81. ck_assert(mg_strncasecmp("b", "a", 1) > 0);
  82. ck_assert(mg_strncasecmp("B", "a", 1) > 0);
  83. ck_assert(mg_strncasecmp("xAx", "xBx", 3) < 0);
  84. ck_assert(mg_strncasecmp("xAx", "xbx", 3) < 0);
  85. ck_assert(mg_strncasecmp("xax", "xBx", 3) < 0);
  86. ck_assert(mg_strncasecmp("xax", "xbx", 3) < 0);
  87. ck_assert(mg_strncasecmp("xbx", "xAx", 3) > 0);
  88. ck_assert(mg_strncasecmp("xBx", "xAx", 3) > 0);
  89. ck_assert(mg_strncasecmp("xbx", "xax", 3) > 0);
  90. ck_assert(mg_strncasecmp("xBx", "xax", 3) > 0);
  91. }
  92. END_TEST
  93. START_TEST(test_mg_get_cookie)
  94. {
  95. char buf[32];
  96. int ret;
  97. const char *longcookie = "key1=1; key2=2; key3; key4=4; key5=; key6; "
  98. "key7=this+is+it; key8=8; key9";
  99. /* invalid result buffer */
  100. ret = mg_get_cookie("", "notfound", NULL, 999);
  101. ck_assert_int_eq(ret, -2);
  102. /* zero size result buffer */
  103. ret = mg_get_cookie("", "notfound", buf, 0);
  104. ck_assert_int_eq(ret, -2);
  105. /* too small result buffer */
  106. ret = mg_get_cookie("key=toooooooooolong", "key", buf, 4);
  107. ck_assert_int_eq(ret, -3);
  108. /* key not found in string */
  109. ret = mg_get_cookie("", "notfound", buf, sizeof(buf));
  110. ck_assert_int_eq(ret, -1);
  111. ret = mg_get_cookie(longcookie, "notfound", buf, sizeof(buf));
  112. ck_assert_int_eq(ret, -1);
  113. /* key not found in string */
  114. ret = mg_get_cookie("key1=1; key2=2; key3=3", "notfound", buf, sizeof(buf));
  115. ck_assert_int_eq(ret, -1);
  116. /* keys are found as first, middle and last key */
  117. memset(buf, 77, sizeof(buf));
  118. ret = mg_get_cookie("key1=1; key2=2; key3=3", "key1", buf, sizeof(buf));
  119. ck_assert_int_eq(ret, 1);
  120. ck_assert_str_eq("1", buf);
  121. memset(buf, 77, sizeof(buf));
  122. ret = mg_get_cookie("key1=1; key2=2; key3=3", "key2", buf, sizeof(buf));
  123. ck_assert_int_eq(ret, 1);
  124. ck_assert_str_eq("2", buf);
  125. memset(buf, 77, sizeof(buf));
  126. ret = mg_get_cookie("key1=1; key2=2; key3=3", "key3", buf, sizeof(buf));
  127. ck_assert_int_eq(ret, 1);
  128. ck_assert_str_eq("3", buf);
  129. /* longer value in the middle of a longer string */
  130. memset(buf, 77, sizeof(buf));
  131. ret = mg_get_cookie(longcookie, "key7", buf, sizeof(buf));
  132. ck_assert_int_eq(ret, 10);
  133. ck_assert_str_eq("this+is+it", buf);
  134. /* key with = but without value in the middle of a longer string */
  135. memset(buf, 77, sizeof(buf));
  136. ret = mg_get_cookie(longcookie, "key5", buf, sizeof(buf));
  137. ck_assert_int_eq(ret, 0);
  138. ck_assert_str_eq("", buf);
  139. /* key without = and without value in the middle of a longer string */
  140. memset(buf, 77, sizeof(buf));
  141. ret = mg_get_cookie(longcookie, "key6", buf, sizeof(buf));
  142. ck_assert_int_eq(ret, -1);
  143. /* TODO: mg_get_cookie and mg_get_var(2) should have the same behavior */
  144. }
  145. END_TEST
  146. START_TEST(test_mg_get_var)
  147. {
  148. char buf[32];
  149. int ret;
  150. const char *shortquery = "key1=1&key2=2&key3=3";
  151. const char *longquery = "key1=1&key2=2&key3&key4=4&key5=&key6&"
  152. "key7=this+is+it&key8=8&key9&&key10=&&"
  153. "key7=that+is+it&key12=12";
  154. /* invalid result buffer */
  155. ret = mg_get_var2("", 0, "notfound", NULL, 999, 0);
  156. ck_assert_int_eq(ret, -2);
  157. /* zero size result buffer */
  158. ret = mg_get_var2("", 0, "notfound", buf, 0, 0);
  159. ck_assert_int_eq(ret, -2);
  160. /* too small result buffer */
  161. ret = mg_get_var2("key=toooooooooolong", 19, "key", buf, 4, 0);
  162. /* ck_assert_int_eq(ret, -3);
  163. --> TODO: mg_get_cookie returns -3, mg_get_var -2. This should be
  164. unified. */
  165. ck_assert(ret < 0);
  166. /* key not found in string */
  167. ret = mg_get_var2("", 0, "notfound", buf, sizeof(buf), 0);
  168. ck_assert_int_eq(ret, -1);
  169. ret = mg_get_var2(
  170. longquery, strlen(longquery), "notfound", buf, sizeof(buf), 0);
  171. ck_assert_int_eq(ret, -1);
  172. /* key not found in string */
  173. ret = mg_get_var2(
  174. shortquery, strlen(shortquery), "notfound", buf, sizeof(buf), 0);
  175. ck_assert_int_eq(ret, -1);
  176. /* key not found in string */
  177. ret = mg_get_var2("key1=1&key2=2&key3=3&notfound=here",
  178. strlen(shortquery),
  179. "notfound",
  180. buf,
  181. sizeof(buf),
  182. 0);
  183. ck_assert_int_eq(ret, -1);
  184. /* key not found in string */
  185. ret = mg_get_var2(
  186. shortquery, strlen(shortquery), "key1", buf, sizeof(buf), 1);
  187. ck_assert_int_eq(ret, -1);
  188. /* keys are found as first, middle and last key */
  189. memset(buf, 77, sizeof(buf));
  190. ret = mg_get_var2(
  191. shortquery, strlen(shortquery), "key1", buf, sizeof(buf), 0);
  192. ck_assert_int_eq(ret, 1);
  193. ck_assert_str_eq("1", buf);
  194. memset(buf, 77, sizeof(buf));
  195. ret = mg_get_var2(
  196. shortquery, strlen(shortquery), "key2", buf, sizeof(buf), 0);
  197. ck_assert_int_eq(ret, 1);
  198. ck_assert_str_eq("2", buf);
  199. memset(buf, 77, sizeof(buf));
  200. ret = mg_get_var2(
  201. shortquery, strlen(shortquery), "key3", buf, sizeof(buf), 0);
  202. ck_assert_int_eq(ret, 1);
  203. ck_assert_str_eq("3", buf);
  204. /* longer value in the middle of a longer string */
  205. memset(buf, 77, sizeof(buf));
  206. ret =
  207. mg_get_var2(longquery, strlen(longquery), "key7", buf, sizeof(buf), 0);
  208. ck_assert_int_eq(ret, 10);
  209. ck_assert_str_eq("this is it", buf);
  210. /* longer value in the middle of a longer string - seccond occurance of key
  211. */
  212. memset(buf, 77, sizeof(buf));
  213. ret =
  214. mg_get_var2(longquery, strlen(longquery), "key7", buf, sizeof(buf), 1);
  215. ck_assert_int_eq(ret, 10);
  216. ck_assert_str_eq("that is it", buf);
  217. /* key with = but without value in the middle of a longer string */
  218. memset(buf, 77, sizeof(buf));
  219. ret =
  220. mg_get_var2(longquery, strlen(longquery), "key5", buf, sizeof(buf), 0);
  221. ck_assert_int_eq(ret, 0);
  222. ck_assert_str_eq(buf, "");
  223. /* key without = and without value in the middle of a longer string */
  224. memset(buf, 77, sizeof(buf));
  225. ret =
  226. mg_get_var2(longquery, strlen(longquery), "key6", buf, sizeof(buf), 0);
  227. ck_assert_int_eq(ret, -1);
  228. ck_assert_str_eq(buf, "");
  229. /* TODO: this is the same situation as with mg_get_value */
  230. }
  231. END_TEST
  232. START_TEST(test_mg_md5)
  233. {
  234. char buf[33];
  235. char *ret;
  236. const char *long_str =
  237. "_123456789A123456789B123456789C123456789D123456789E123456789F123456789"
  238. "G123456789H123456789I123456789J123456789K123456789L123456789M123456789"
  239. "N123456789O123456789P123456789Q123456789R123456789S123456789T123456789"
  240. "U123456789V123456789W123456789X123456789Y123456789Z";
  241. memset(buf, 77, sizeof(buf));
  242. ret = mg_md5(buf, NULL);
  243. ck_assert_str_eq(buf, "d41d8cd98f00b204e9800998ecf8427e");
  244. ck_assert_str_eq(ret, "d41d8cd98f00b204e9800998ecf8427e");
  245. ck_assert_ptr_eq(ret, buf);
  246. memset(buf, 77, sizeof(buf));
  247. ret = mg_md5(buf, "The quick brown fox jumps over the lazy dog.", NULL);
  248. ck_assert_str_eq(buf, "e4d909c290d0fb1ca068ffaddf22cbd0");
  249. ck_assert_str_eq(ret, "e4d909c290d0fb1ca068ffaddf22cbd0");
  250. ck_assert_ptr_eq(ret, buf);
  251. memset(buf, 77, sizeof(buf));
  252. ret = mg_md5(buf,
  253. "",
  254. "The qu",
  255. "ick bro",
  256. "",
  257. "wn fox ju",
  258. "m",
  259. "ps over the la",
  260. "",
  261. "",
  262. "zy dog.",
  263. "",
  264. NULL);
  265. ck_assert_str_eq(buf, "e4d909c290d0fb1ca068ffaddf22cbd0");
  266. ck_assert_str_eq(ret, "e4d909c290d0fb1ca068ffaddf22cbd0");
  267. ck_assert_ptr_eq(ret, buf);
  268. memset(buf, 77, sizeof(buf));
  269. ret = mg_md5(buf, long_str, NULL);
  270. ck_assert_str_eq(buf, "1cb13cf9f16427807f081b2138241f08");
  271. ck_assert_str_eq(ret, "1cb13cf9f16427807f081b2138241f08");
  272. ck_assert_ptr_eq(ret, buf);
  273. memset(buf, 77, sizeof(buf));
  274. ret = mg_md5(buf, long_str + 1, NULL);
  275. ck_assert_str_eq(buf, "cf62d3264334154f5779d3694cc5093f");
  276. ck_assert_str_eq(ret, "cf62d3264334154f5779d3694cc5093f");
  277. ck_assert_ptr_eq(ret, buf);
  278. }
  279. END_TEST
  280. START_TEST(test_mg_url_encode)
  281. {
  282. char buf[20];
  283. int ret;
  284. memset(buf, 77, sizeof(buf));
  285. ret = mg_url_encode("abc", buf, sizeof(buf));
  286. ck_assert_int_eq(3, ret);
  287. ck_assert_str_eq("abc", buf);
  288. memset(buf, 77, sizeof(buf));
  289. ret = mg_url_encode("a%b/c&d.e", buf, sizeof(buf));
  290. ck_assert_int_eq(15, ret);
  291. ck_assert_str_eq("a%25b%2fc%26d.e", buf);
  292. memset(buf, 77, sizeof(buf));
  293. ret = mg_url_encode("%%%", buf, 4);
  294. ck_assert_int_eq(-1, ret);
  295. ck_assert_str_eq("%25", buf);
  296. }
  297. END_TEST
  298. START_TEST(test_mg_url_decode)
  299. {
  300. char buf[20];
  301. int ret;
  302. ret = mg_url_decode("abc", 3, buf, sizeof(buf), 0);
  303. ck_assert_int_eq(ret, 3);
  304. ck_assert_str_eq(buf, "abc");
  305. ret = mg_url_decode("abcdef", 3, buf, sizeof(buf), 0);
  306. ck_assert_int_eq(ret, 3);
  307. ck_assert_str_eq(buf, "abc");
  308. ret = mg_url_decode("x+y", 3, buf, sizeof(buf), 0);
  309. ck_assert_int_eq(ret, 3);
  310. ck_assert_str_eq(buf, "x+y");
  311. ret = mg_url_decode("x+y", 3, buf, sizeof(buf), 1);
  312. ck_assert_int_eq(ret, 3);
  313. ck_assert_str_eq(buf, "x y");
  314. ret = mg_url_decode("%25", 3, buf, sizeof(buf), 1);
  315. ck_assert_int_eq(ret, 1);
  316. ck_assert_str_eq(buf, "%");
  317. }
  318. END_TEST
  319. Suite *make_public_func_suite(void)
  320. {
  321. Suite *const suite = suite_create("PublicFunc");
  322. TCase *const version = tcase_create("Version");
  323. TCase *const get_valid_options = tcase_create("Options");
  324. TCase *const get_builtin_mime_type = tcase_create("MIME types");
  325. TCase *const tstrncasecmp = tcase_create("strcasecmp");
  326. TCase *const urlencodingdecoding = tcase_create("URL encoding decoding");
  327. TCase *const cookies = tcase_create("Cookies and variables");
  328. TCase *const md5 = tcase_create("MD5");
  329. tcase_add_test(version, test_mg_version);
  330. suite_add_tcase(suite, version);
  331. tcase_add_test(get_valid_options, test_mg_get_valid_options);
  332. suite_add_tcase(suite, get_valid_options);
  333. tcase_add_test(get_builtin_mime_type, test_mg_get_builtin_mime_type);
  334. suite_add_tcase(suite, get_builtin_mime_type);
  335. tcase_add_test(tstrncasecmp, test_mg_strncasecmp);
  336. suite_add_tcase(suite, tstrncasecmp);
  337. tcase_add_test(urlencodingdecoding, test_mg_url_encode);
  338. tcase_add_test(urlencodingdecoding, test_mg_url_decode);
  339. suite_add_tcase(suite, urlencodingdecoding);
  340. tcase_add_test(cookies, test_mg_get_cookie);
  341. tcase_add_test(cookies, test_mg_get_var);
  342. suite_add_tcase(suite, cookies);
  343. tcase_add_test(md5, test_mg_md5);
  344. suite_add_tcase(suite, md5);
  345. return suite;
  346. }