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