aboutsummaryrefslogtreecommitdiff
path: root/api_test/main.c
blob: fae1d055dbc0cdd914ce4504ebea7f628a018c7e (plain)
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #define CMARK_NO_SHORT_NAMES
  5. #include "cmark.h"
  6. #include "node.h"
  7. #include "harness.h"
  8. #define UTF8_REPL "\xEF\xBF\xBD"
  9. void
  10. test_cplusplus(test_batch_runner *runner);
  11. static const cmark_node_type node_types[] = {
  12. CMARK_NODE_DOCUMENT,
  13. CMARK_NODE_BLOCK_QUOTE,
  14. CMARK_NODE_LIST,
  15. CMARK_NODE_ITEM,
  16. CMARK_NODE_CODE_BLOCK,
  17. CMARK_NODE_HTML,
  18. CMARK_NODE_PARAGRAPH,
  19. CMARK_NODE_HEADER,
  20. CMARK_NODE_HRULE,
  21. CMARK_NODE_TEXT,
  22. CMARK_NODE_SOFTBREAK,
  23. CMARK_NODE_LINEBREAK,
  24. CMARK_NODE_CODE,
  25. CMARK_NODE_INLINE_HTML,
  26. CMARK_NODE_EMPH,
  27. CMARK_NODE_STRONG,
  28. CMARK_NODE_LINK,
  29. CMARK_NODE_IMAGE
  30. };
  31. static const int num_node_types = sizeof(node_types) / sizeof(*node_types);
  32. static void
  33. test_md_to_html(test_batch_runner *runner, const char *markdown,
  34. const char *expected_html, const char *msg);
  35. static void
  36. test_content(test_batch_runner *runner, cmark_node_type type,
  37. int allowed_content);
  38. static void
  39. test_char(test_batch_runner *runner, int valid, const char *utf8,
  40. const char *msg);
  41. static void
  42. test_incomplete_char(test_batch_runner *runner, const char *utf8,
  43. const char *msg);
  44. static void
  45. test_continuation_byte(test_batch_runner *runner, const char *utf8);
  46. static void
  47. constructor(test_batch_runner *runner)
  48. {
  49. for (int i = 0; i < num_node_types; ++i) {
  50. cmark_node_type type = node_types[i];
  51. cmark_node *node = cmark_node_new(type);
  52. OK(runner, node != NULL, "new type %d", type);
  53. INT_EQ(runner, cmark_node_get_type(node), type,
  54. "get_type %d", type);
  55. switch (node->type) {
  56. case CMARK_NODE_HEADER:
  57. INT_EQ(runner, cmark_node_get_header_level(node), 1,
  58. "default header level is 1");
  59. node->as.header.level = 1;
  60. break;
  61. case CMARK_NODE_LIST:
  62. INT_EQ(runner, cmark_node_get_list_type(node),
  63. CMARK_BULLET_LIST,
  64. "default is list type is bullet");
  65. INT_EQ(runner, cmark_node_get_list_delim(node),
  66. CMARK_NO_DELIM,
  67. "default is list delim is NO_DELIM");
  68. INT_EQ(runner, cmark_node_get_list_start(node), 1,
  69. "default is list start is 1");
  70. INT_EQ(runner, cmark_node_get_list_tight(node), 0,
  71. "default is list is loose");
  72. break;
  73. default:
  74. break;
  75. }
  76. cmark_node_free(node);
  77. }
  78. }
  79. static void
  80. accessors(test_batch_runner *runner)
  81. {
  82. static const char markdown[] =
  83. "## Header\n"
  84. "\n"
  85. "* Item 1\n"
  86. "* Item 2\n"
  87. "\n"
  88. "2. Item 1\n"
  89. "\n"
  90. "3. Item 2\n"
  91. "\n"
  92. "\n"
  93. " code\n"
  94. "\n"
  95. "``` lang\n"
  96. "fenced\n"
  97. "```\n"
  98. "\n"
  99. "<div>html</div>\n"
  100. "\n"
  101. "[link](url 'title')\n";
  102. cmark_node *doc = cmark_parse_document(markdown, sizeof(markdown) - 1);
  103. // Getters
  104. cmark_node *header = cmark_node_first_child(doc);
  105. INT_EQ(runner, cmark_node_get_header_level(header), 2,
  106. "get_header_level");
  107. cmark_node *bullet_list = cmark_node_next(header);
  108. INT_EQ(runner, cmark_node_get_list_type(bullet_list),
  109. CMARK_BULLET_LIST, "get_list_type bullet");
  110. INT_EQ(runner, cmark_node_get_list_tight(bullet_list), 1,
  111. "get_list_tight tight");
  112. cmark_node *ordered_list = cmark_node_next(bullet_list);
  113. INT_EQ(runner, cmark_node_get_list_type(ordered_list),
  114. CMARK_ORDERED_LIST, "get_list_type ordered");
  115. INT_EQ(runner, cmark_node_get_list_delim(ordered_list),
  116. CMARK_PERIOD_DELIM, "get_list_delim ordered");
  117. INT_EQ(runner, cmark_node_get_list_start(ordered_list), 2,
  118. "get_list_start");
  119. INT_EQ(runner, cmark_node_get_list_tight(ordered_list), 0,
  120. "get_list_tight loose");
  121. cmark_node *code = cmark_node_next(ordered_list);
  122. STR_EQ(runner, cmark_node_get_literal(code), "code\n",
  123. "get_literal indented code");
  124. cmark_node *fenced = cmark_node_next(code);
  125. STR_EQ(runner, cmark_node_get_literal(fenced), "fenced\n",
  126. "get_literal fenced code");
  127. STR_EQ(runner, cmark_node_get_fence_info(fenced), "lang",
  128. "get_fence_info");
  129. cmark_node *html = cmark_node_next(fenced);
  130. STR_EQ(runner, cmark_node_get_literal(html),
  131. "<div>html</div>\n", "get_literal html");
  132. cmark_node *paragraph = cmark_node_next(html);
  133. INT_EQ(runner, cmark_node_get_start_line(paragraph), 19,
  134. "get_start_line");
  135. INT_EQ(runner, cmark_node_get_start_column(paragraph), 1,
  136. "get_start_column");
  137. INT_EQ(runner, cmark_node_get_end_line(paragraph), 19,
  138. "get_end_line");
  139. cmark_node *link = cmark_node_first_child(paragraph);
  140. STR_EQ(runner, cmark_node_get_url(link), "url",
  141. "get_url");
  142. STR_EQ(runner, cmark_node_get_title(link), "title",
  143. "get_title");
  144. cmark_node *string = cmark_node_first_child(link);
  145. STR_EQ(runner, cmark_node_get_literal(string), "link",
  146. "get_literal string");
  147. // Setters
  148. OK(runner, cmark_node_set_header_level(header, 3),
  149. "set_header_level");
  150. OK(runner, cmark_node_set_list_type(bullet_list, CMARK_ORDERED_LIST),
  151. "set_list_type ordered");
  152. OK(runner, cmark_node_set_list_delim(bullet_list, CMARK_PAREN_DELIM),
  153. "set_list_delim paren");
  154. OK(runner, cmark_node_set_list_start(bullet_list, 3),
  155. "set_list_start");
  156. OK(runner, cmark_node_set_list_tight(bullet_list, 0),
  157. "set_list_tight loose");
  158. OK(runner, cmark_node_set_list_type(ordered_list, CMARK_BULLET_LIST),
  159. "set_list_type bullet");
  160. OK(runner, cmark_node_set_list_tight(ordered_list, 1),
  161. "set_list_tight tight");
  162. OK(runner, cmark_node_set_literal(code, "CODE\n"),
  163. "set_literal indented code");
  164. OK(runner, cmark_node_set_literal(fenced, "FENCED\n"),
  165. "set_literal fenced code");
  166. OK(runner, cmark_node_set_fence_info(fenced, "LANG"),
  167. "set_fence_info");
  168. OK(runner, cmark_node_set_literal(html, "<div>HTML</div>\n"),
  169. "set_literal html");
  170. OK(runner, cmark_node_set_url(link, "URL"),
  171. "set_url");
  172. OK(runner, cmark_node_set_title(link, "TITLE"),
  173. "set_title");
  174. OK(runner, cmark_node_set_literal(string, "LINK"),
  175. "set_literal string");
  176. char *rendered_html = cmark_render_html(doc, CMARK_OPT_DEFAULT);
  177. static const char expected_html[] =
  178. "<h3>Header</h3>\n"
  179. "<ol start=\"3\">\n"
  180. "<li>\n"
  181. "<p>Item 1</p>\n"
  182. "</li>\n"
  183. "<li>\n"
  184. "<p>Item 2</p>\n"
  185. "</li>\n"
  186. "</ol>\n"
  187. "<ul>\n"
  188. "<li>Item 1</li>\n"
  189. "<li>Item 2</li>\n"
  190. "</ul>\n"
  191. "<pre><code>CODE\n"
  192. "</code></pre>\n"
  193. "<pre><code class=\"language-LANG\">FENCED\n"
  194. "</code></pre>\n"
  195. "<div>HTML</div>\n"
  196. "<p><a href=\"URL\" title=\"TITLE\">LINK</a></p>\n";
  197. STR_EQ(runner, rendered_html, expected_html, "setters work");
  198. free(rendered_html);
  199. // Getter errors
  200. INT_EQ(runner, cmark_node_get_header_level(bullet_list), 0,
  201. "get_header_level error");
  202. INT_EQ(runner, cmark_node_get_list_type(header), CMARK_NO_LIST,
  203. "get_list_type error");
  204. INT_EQ(runner, cmark_node_get_list_start(code), 0,
  205. "get_list_start error");
  206. INT_EQ(runner, cmark_node_get_list_tight(fenced), 0,
  207. "get_list_tight error");
  208. OK(runner, cmark_node_get_literal(ordered_list) == NULL,
  209. "get_literal error");
  210. OK(runner, cmark_node_get_fence_info(paragraph) == NULL,
  211. "get_fence_info error");
  212. OK(runner, cmark_node_get_url(html) == NULL,
  213. "get_url error");
  214. OK(runner, cmark_node_get_title(header) == NULL,
  215. "get_title error");
  216. // Setter errors
  217. OK(runner, !cmark_node_set_header_level(bullet_list, 3),
  218. "set_header_level error");
  219. OK(runner, !cmark_node_set_list_type(header, CMARK_ORDERED_LIST),
  220. "set_list_type error");
  221. OK(runner, !cmark_node_set_list_start(code, 3),
  222. "set_list_start error");
  223. OK(runner, !cmark_node_set_list_tight(fenced, 0),
  224. "set_list_tight error");
  225. OK(runner, !cmark_node_set_literal(ordered_list, "content\n"),
  226. "set_literal error");
  227. OK(runner, !cmark_node_set_fence_info(paragraph, "lang"),
  228. "set_fence_info error");
  229. OK(runner, !cmark_node_set_url(html, "url"),
  230. "set_url error");
  231. OK(runner, !cmark_node_set_title(header, "title"),
  232. "set_title error");
  233. OK(runner, !cmark_node_set_header_level(header, 0),
  234. "set_header_level too small");
  235. OK(runner, !cmark_node_set_header_level(header, 7),
  236. "set_header_level too large");
  237. OK(runner, !cmark_node_set_list_type(bullet_list, CMARK_NO_LIST),
  238. "set_list_type invalid");
  239. OK(runner, !cmark_node_set_list_start(bullet_list, -1),
  240. "set_list_start negative");
  241. cmark_node_free(doc);
  242. }
  243. static void
  244. node_check(test_batch_runner *runner) {
  245. // Construct an incomplete tree.
  246. cmark_node *doc = cmark_node_new(CMARK_NODE_DOCUMENT);
  247. cmark_node *p1 = cmark_node_new(CMARK_NODE_PARAGRAPH);
  248. cmark_node *p2 = cmark_node_new(CMARK_NODE_PARAGRAPH);
  249. doc->first_child = p1;
  250. p1->next = p2;
  251. INT_EQ(runner, cmark_node_check(doc, NULL), 4, "node_check works");
  252. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  253. "node_check fixes tree");
  254. cmark_node_free(doc);
  255. }
  256. static void
  257. iterator(test_batch_runner *runner) {
  258. cmark_node *doc = cmark_parse_document("> a *b*\n\nc", 10);
  259. int parnodes = 0;
  260. cmark_event_type ev_type;
  261. cmark_iter *iter = cmark_iter_new(doc);
  262. cmark_node *cur;
  263. while ((ev_type = cmark_iter_next(iter)) != CMARK_EVENT_DONE) {
  264. cur = cmark_iter_get_node(iter);
  265. if (cur->type == CMARK_NODE_PARAGRAPH &&
  266. ev_type == CMARK_EVENT_ENTER) {
  267. parnodes += 1;
  268. }
  269. }
  270. INT_EQ(runner, parnodes, 2, "iterate correctly counts paragraphs");
  271. cmark_iter_free(iter);
  272. cmark_node_free(doc);
  273. }
  274. static void
  275. create_tree(test_batch_runner *runner)
  276. {
  277. char *html;
  278. cmark_node *doc = cmark_node_new(CMARK_NODE_DOCUMENT);
  279. cmark_node *p = cmark_node_new(CMARK_NODE_PARAGRAPH);
  280. OK(runner, !cmark_node_insert_before(doc, p),
  281. "insert before root fails");
  282. OK(runner, !cmark_node_insert_after(doc, p),
  283. "insert after root fails");
  284. OK(runner, cmark_node_append_child(doc, p), "append1");
  285. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "append1 consistent");
  286. OK(runner, cmark_node_parent(p) == doc, "node_parent");
  287. cmark_node *emph = cmark_node_new(CMARK_NODE_EMPH);
  288. OK(runner, cmark_node_prepend_child(p, emph), "prepend1");
  289. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "prepend1 consistent");
  290. cmark_node *str1 = cmark_node_new(CMARK_NODE_TEXT);
  291. cmark_node_set_literal(str1, "Hello, ");
  292. OK(runner, cmark_node_prepend_child(p, str1), "prepend2");
  293. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "prepend2 consistent");
  294. cmark_node *str3 = cmark_node_new(CMARK_NODE_TEXT);
  295. cmark_node_set_literal(str3, "!");
  296. OK(runner, cmark_node_append_child(p, str3), "append2");
  297. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "append2 consistent");
  298. cmark_node *str2 = cmark_node_new(CMARK_NODE_TEXT);
  299. cmark_node_set_literal(str2, "world");
  300. OK(runner, cmark_node_append_child(emph, str2), "append3");
  301. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "append3 consistent");
  302. html = cmark_render_html(doc, CMARK_OPT_DEFAULT);
  303. STR_EQ(runner, html, "<p>Hello, <em>world</em>!</p>\n",
  304. "render_html");
  305. free(html);
  306. OK(runner, cmark_node_insert_before(str1, str3), "ins before1");
  307. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  308. "ins before1 consistent");
  309. // 31e
  310. OK(runner, cmark_node_first_child(p) == str3, "ins before1 works");
  311. OK(runner, cmark_node_insert_before(str1, emph), "ins before2");
  312. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  313. "ins before2 consistent");
  314. // 3e1
  315. OK(runner, cmark_node_last_child(p) == str1, "ins before2 works");
  316. OK(runner, cmark_node_insert_after(str1, str3), "ins after1");
  317. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  318. "ins after1 consistent");
  319. // e13
  320. OK(runner, cmark_node_next(str1) == str3, "ins after1 works");
  321. OK(runner, cmark_node_insert_after(str1, emph), "ins after2");
  322. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  323. "ins after2 consistent");
  324. // 1e3
  325. OK(runner, cmark_node_previous(emph) == str1, "ins after2 works");
  326. cmark_node_unlink(emph);
  327. html = cmark_render_html(doc, CMARK_OPT_DEFAULT);
  328. STR_EQ(runner, html, "<p>Hello, !</p>\n",
  329. "render_html after shuffling");
  330. free(html);
  331. cmark_node_free(doc);
  332. // TODO: Test that the contents of an unlinked inline are valid
  333. // after the parent block was destroyed. This doesn't work so far.
  334. cmark_node_free(emph);
  335. }
  336. void
  337. hierarchy(test_batch_runner *runner)
  338. {
  339. cmark_node *bquote1 = cmark_node_new(CMARK_NODE_BLOCK_QUOTE);
  340. cmark_node *bquote2 = cmark_node_new(CMARK_NODE_BLOCK_QUOTE);
  341. cmark_node *bquote3 = cmark_node_new(CMARK_NODE_BLOCK_QUOTE);
  342. OK(runner, cmark_node_append_child(bquote1, bquote2),
  343. "append bquote2");
  344. OK(runner, cmark_node_append_child(bquote2, bquote3),
  345. "append bquote3");
  346. OK(runner, !cmark_node_append_child(bquote3, bquote3),
  347. "adding a node as child of itself fails");
  348. OK(runner, !cmark_node_append_child(bquote3, bquote1),
  349. "adding a parent as child fails");
  350. cmark_node_free(bquote1);
  351. int max_node_type = CMARK_NODE_LAST_BLOCK > CMARK_NODE_LAST_INLINE
  352. ? CMARK_NODE_LAST_BLOCK : CMARK_NODE_LAST_INLINE;
  353. OK(runner, max_node_type < 32, "all node types < 32");
  354. int list_item_flag = 1 << CMARK_NODE_ITEM;
  355. int top_level_blocks =
  356. (1 << CMARK_NODE_BLOCK_QUOTE) |
  357. (1 << CMARK_NODE_LIST) |
  358. (1 << CMARK_NODE_CODE_BLOCK) |
  359. (1 << CMARK_NODE_HTML) |
  360. (1 << CMARK_NODE_PARAGRAPH) |
  361. (1 << CMARK_NODE_HEADER) |
  362. (1 << CMARK_NODE_HRULE);
  363. int all_inlines =
  364. (1 << CMARK_NODE_TEXT) |
  365. (1 << CMARK_NODE_SOFTBREAK) |
  366. (1 << CMARK_NODE_LINEBREAK) |
  367. (1 << CMARK_NODE_CODE) |
  368. (1 << CMARK_NODE_INLINE_HTML) |
  369. (1 << CMARK_NODE_EMPH) |
  370. (1 << CMARK_NODE_STRONG) |
  371. (1 << CMARK_NODE_LINK) |
  372. (1 << CMARK_NODE_IMAGE);
  373. test_content(runner, CMARK_NODE_DOCUMENT, top_level_blocks);
  374. test_content(runner, CMARK_NODE_BLOCK_QUOTE, top_level_blocks);
  375. test_content(runner, CMARK_NODE_LIST, list_item_flag);
  376. test_content(runner, CMARK_NODE_ITEM, top_level_blocks);
  377. test_content(runner, CMARK_NODE_CODE_BLOCK , 0);
  378. test_content(runner, CMARK_NODE_HTML, 0);
  379. test_content(runner, CMARK_NODE_PARAGRAPH, all_inlines);
  380. test_content(runner, CMARK_NODE_HEADER, all_inlines);
  381. test_content(runner, CMARK_NODE_HRULE, 0);
  382. test_content(runner, CMARK_NODE_TEXT, 0);
  383. test_content(runner, CMARK_NODE_SOFTBREAK, 0);
  384. test_content(runner, CMARK_NODE_LINEBREAK, 0);
  385. test_content(runner, CMARK_NODE_CODE, 0);
  386. test_content(runner, CMARK_NODE_INLINE_HTML, 0);
  387. test_content(runner, CMARK_NODE_EMPH, all_inlines);
  388. test_content(runner, CMARK_NODE_STRONG, all_inlines);
  389. test_content(runner, CMARK_NODE_LINK, all_inlines);
  390. test_content(runner, CMARK_NODE_IMAGE, all_inlines);
  391. }
  392. static void
  393. test_content(test_batch_runner *runner, cmark_node_type type,
  394. int allowed_content)
  395. {
  396. cmark_node *node = cmark_node_new(type);
  397. for (int i = 0; i < num_node_types; ++i) {
  398. cmark_node_type child_type = node_types[i];
  399. cmark_node *child = cmark_node_new(child_type);
  400. int got = cmark_node_append_child(node, child);
  401. int expected = (allowed_content >> child_type) & 1;
  402. INT_EQ(runner, got, expected,
  403. "add %d as child of %d", child_type, type);
  404. cmark_node_free(child);
  405. }
  406. cmark_node_free(node);
  407. }
  408. static void
  409. parser(test_batch_runner *runner)
  410. {
  411. test_md_to_html(runner, "No newline", "<p>No newline</p>\n",
  412. "document without trailing newline");
  413. }
  414. static void
  415. render_html(test_batch_runner *runner)
  416. {
  417. char *html;
  418. static const char markdown[] =
  419. "foo *bar*\n"
  420. "\n"
  421. "paragraph 2\n";
  422. cmark_node *doc = cmark_parse_document(markdown, sizeof(markdown) - 1);
  423. cmark_node *paragraph = cmark_node_first_child(doc);
  424. html = cmark_render_html(paragraph, CMARK_OPT_DEFAULT);
  425. STR_EQ(runner, html, "<p>foo <em>bar</em></p>\n",
  426. "render single paragraph");
  427. free(html);
  428. cmark_node *string = cmark_node_first_child(paragraph);
  429. html = cmark_render_html(string, CMARK_OPT_DEFAULT);
  430. STR_EQ(runner, html, "foo ", "render single inline");
  431. free(html);
  432. cmark_node *emph = cmark_node_next(string);
  433. html = cmark_render_html(emph, CMARK_OPT_DEFAULT);
  434. STR_EQ(runner, html, "<em>bar</em>", "render inline with children");
  435. free(html);
  436. cmark_node_free(doc);
  437. }
  438. static void
  439. utf8(test_batch_runner *runner)
  440. {
  441. // Ranges
  442. test_char(runner, 1, "\x01", "valid utf8 01");
  443. test_char(runner, 1, "\x7F", "valid utf8 7F");
  444. test_char(runner, 0, "\x80", "invalid utf8 80");
  445. test_char(runner, 0, "\xBF", "invalid utf8 BF");
  446. test_char(runner, 0, "\xC0\x80", "invalid utf8 C080");
  447. test_char(runner, 0, "\xC1\xBF", "invalid utf8 C1BF");
  448. test_char(runner, 1, "\xC2\x80", "valid utf8 C280");
  449. test_char(runner, 1, "\xDF\xBF", "valid utf8 DFBF");
  450. test_char(runner, 0, "\xE0\x80\x80", "invalid utf8 E08080");
  451. test_char(runner, 0, "\xE0\x9F\xBF", "invalid utf8 E09FBF");
  452. test_char(runner, 1, "\xE0\xA0\x80", "valid utf8 E0A080");
  453. test_char(runner, 1, "\xED\x9F\xBF", "valid utf8 ED9FBF");
  454. test_char(runner, 0, "\xED\xA0\x80", "invalid utf8 EDA080");
  455. test_char(runner, 0, "\xED\xBF\xBF", "invalid utf8 EDBFBF");
  456. test_char(runner, 0, "\xF0\x80\x80\x80", "invalid utf8 F0808080");
  457. test_char(runner, 0, "\xF0\x8F\xBF\xBF", "invalid utf8 F08FBFBF");
  458. test_char(runner, 1, "\xF0\x90\x80\x80", "valid utf8 F0908080");
  459. test_char(runner, 1, "\xF4\x8F\xBF\xBF", "valid utf8 F48FBFBF");
  460. test_char(runner, 0, "\xF4\x90\x80\x80", "invalid utf8 F4908080");
  461. test_char(runner, 0, "\xF7\xBF\xBF\xBF", "invalid utf8 F7BFBFBF");
  462. test_char(runner, 0, "\xF8", "invalid utf8 F8");
  463. test_char(runner, 0, "\xFF", "invalid utf8 FF");
  464. // Incomplete byte sequences at end of input
  465. test_incomplete_char(runner, "\xE0\xA0", "invalid utf8 E0A0");
  466. test_incomplete_char(runner, "\xF0\x90\x80", "invalid utf8 F09080");
  467. // Invalid continuation bytes
  468. test_continuation_byte(runner, "\xC2\x80");
  469. test_continuation_byte(runner, "\xE0\xA0\x80");
  470. test_continuation_byte(runner, "\xF0\x90\x80\x80");
  471. // Test string containing null character
  472. static const char string_with_null[] = "((((\0))))";
  473. char *html = cmark_markdown_to_html(string_with_null,
  474. sizeof(string_with_null) - 1);
  475. STR_EQ(runner, html, "<p>((((" UTF8_REPL "))))</p>\n",
  476. "utf8 with U+0000");
  477. free(html);
  478. }
  479. static void
  480. test_char(test_batch_runner *runner, int valid, const char *utf8,
  481. const char *msg)
  482. {
  483. char buf[20];
  484. sprintf(buf, "((((%s))))", utf8);
  485. if (valid) {
  486. char expected[30];
  487. sprintf(expected, "<p>((((%s))))</p>\n", utf8);
  488. test_md_to_html(runner, buf, expected, msg);
  489. }
  490. else {
  491. test_md_to_html(runner, buf, "<p>((((" UTF8_REPL "))))</p>\n",
  492. msg);
  493. }
  494. }
  495. static void
  496. test_incomplete_char(test_batch_runner *runner, const char *utf8,
  497. const char *msg)
  498. {
  499. char buf[20];
  500. sprintf(buf, "----%s", utf8);
  501. test_md_to_html(runner, buf, "<p>----" UTF8_REPL "</p>\n", msg);
  502. }
  503. static void
  504. test_continuation_byte(test_batch_runner *runner, const char *utf8)
  505. {
  506. int len = strlen(utf8);
  507. for (int pos = 1; pos < len; ++pos) {
  508. char buf[20];
  509. sprintf(buf, "((((%s))))", utf8);
  510. buf[4+pos] = '\x20';
  511. char expected[50];
  512. strcpy(expected, "<p>((((" UTF8_REPL "\x20");
  513. for (int i = pos + 1; i < len; ++i) {
  514. strcat(expected, UTF8_REPL);
  515. }
  516. strcat(expected, "))))</p>\n");
  517. char *html = cmark_markdown_to_html(buf, strlen(buf));
  518. STR_EQ(runner, html, expected,
  519. "invalid utf8 continuation byte %d/%d", pos, len);
  520. free(html);
  521. }
  522. }
  523. static void
  524. test_md_to_html(test_batch_runner *runner, const char *markdown,
  525. const char *expected_html, const char *msg)
  526. {
  527. char *html = cmark_markdown_to_html(markdown, strlen(markdown));
  528. STR_EQ(runner, html, expected_html, msg);
  529. free(html);
  530. }
  531. int main() {
  532. int retval;
  533. test_batch_runner *runner = test_batch_runner_new();
  534. constructor(runner);
  535. accessors(runner);
  536. node_check(runner);
  537. iterator(runner);
  538. create_tree(runner);
  539. hierarchy(runner);
  540. parser(runner);
  541. render_html(runner);
  542. utf8(runner);
  543. test_cplusplus(runner);
  544. test_print_summary(runner);
  545. retval = test_ok(runner) ? 0 : 1;
  546. free(runner);
  547. return retval;
  548. }