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