aboutsummaryrefslogtreecommitdiff
path: root/api_test/main.c
blob: b3b5b5ad5c7d9bae81d67e4791968a54094d9f7a (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. static const cmark_node_type node_types[] = {
  9. CMARK_NODE_DOCUMENT,
  10. CMARK_NODE_BQUOTE,
  11. CMARK_NODE_LIST,
  12. CMARK_NODE_LIST_ITEM,
  13. CMARK_NODE_FENCED_CODE,
  14. CMARK_NODE_INDENTED_CODE,
  15. CMARK_NODE_HTML,
  16. CMARK_NODE_PARAGRAPH,
  17. CMARK_NODE_ATX_HEADER,
  18. CMARK_NODE_SETEXT_HEADER,
  19. CMARK_NODE_HRULE,
  20. CMARK_NODE_REFERENCE_DEF,
  21. CMARK_NODE_STRING,
  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_content(test_batch_runner *runner, cmark_node_type type,
  34. int allowed_content);
  35. static void
  36. constructor(test_batch_runner *runner)
  37. {
  38. for (int i = 0; i < num_node_types; ++i) {
  39. cmark_node_type type = node_types[i];
  40. cmark_node *node = cmark_node_new(type);
  41. OK(runner, node != NULL, "new type %d", type);
  42. INT_EQ(runner, cmark_node_get_type(node), type,
  43. "get_type %d", type);
  44. switch (node->type) {
  45. case CMARK_NODE_ATX_HEADER:
  46. case CMARK_NODE_SETEXT_HEADER:
  47. INT_EQ(runner, cmark_node_get_header_level(node), 1,
  48. "default header level is 1");
  49. node->as.header.level = 1;
  50. break;
  51. case CMARK_NODE_LIST:
  52. INT_EQ(runner, cmark_node_get_list_type(node),
  53. CMARK_BULLET_LIST,
  54. "default is list type is bullet");
  55. INT_EQ(runner, cmark_node_get_list_start(node), 1,
  56. "default is list start is 1");
  57. INT_EQ(runner, cmark_node_get_list_tight(node), 0,
  58. "default is list is loose");
  59. break;
  60. default:
  61. break;
  62. }
  63. cmark_node_destroy(node);
  64. }
  65. }
  66. static void
  67. accessors(test_batch_runner *runner)
  68. {
  69. static const char markdown[] =
  70. "## Header\n"
  71. "\n"
  72. "* Item 1\n"
  73. "* Item 2\n"
  74. "\n"
  75. "2. Item 1\n"
  76. "\n"
  77. "3. Item 2\n"
  78. "\n"
  79. "\n"
  80. " code\n"
  81. "\n"
  82. "``` lang\n"
  83. "fenced\n"
  84. "```\n"
  85. "\n"
  86. "<div>html</div>\n"
  87. "\n"
  88. "[link](url 'title')\n";
  89. cmark_node *doc = cmark_parse_document(markdown, sizeof(markdown) - 1);
  90. // Getters
  91. cmark_node *header = cmark_node_first_child(doc);
  92. INT_EQ(runner, cmark_node_get_header_level(header), 2,
  93. "get_header_level");
  94. cmark_node *bullet_list = cmark_node_next(header);
  95. INT_EQ(runner, cmark_node_get_list_type(bullet_list),
  96. CMARK_BULLET_LIST, "get_list_type bullet");
  97. INT_EQ(runner, cmark_node_get_list_tight(bullet_list), 1,
  98. "get_list_tight tight");
  99. cmark_node *ordered_list = cmark_node_next(bullet_list);
  100. INT_EQ(runner, cmark_node_get_list_type(ordered_list),
  101. CMARK_ORDERED_LIST, "get_list_type ordered");
  102. INT_EQ(runner, cmark_node_get_list_start(ordered_list), 2,
  103. "get_list_start");
  104. INT_EQ(runner, cmark_node_get_list_tight(ordered_list), 0,
  105. "get_list_tight loose");
  106. cmark_node *code = cmark_node_next(ordered_list);
  107. STR_EQ(runner, cmark_node_get_string_content(code), "code\n",
  108. "get_string_content indented code");
  109. cmark_node *fenced = cmark_node_next(code);
  110. STR_EQ(runner, cmark_node_get_string_content(fenced), "fenced\n",
  111. "get_string_content fenced code");
  112. STR_EQ(runner, cmark_node_get_fence_info(fenced), "lang",
  113. "get_fence_info");
  114. cmark_node *html = cmark_node_next(fenced);
  115. STR_EQ(runner, cmark_node_get_string_content(html),
  116. "<div>html</div>\n", "get_string_content html");
  117. cmark_node *paragraph = cmark_node_next(html);
  118. INT_EQ(runner, cmark_node_get_start_line(paragraph), 19,
  119. "get_start_line");
  120. INT_EQ(runner, cmark_node_get_start_column(paragraph), 1,
  121. "get_start_column");
  122. INT_EQ(runner, cmark_node_get_end_line(paragraph), 19,
  123. "get_end_line");
  124. cmark_node *link = cmark_node_first_child(paragraph);
  125. STR_EQ(runner, cmark_node_get_url(link), "url",
  126. "get_url");
  127. STR_EQ(runner, cmark_node_get_title(link), "title",
  128. "get_title");
  129. cmark_node *string = cmark_node_first_child(link);
  130. STR_EQ(runner, cmark_node_get_string_content(string), "link",
  131. "get_string_content string");
  132. // Setters
  133. OK(runner, cmark_node_set_header_level(header, 3),
  134. "set_header_level");
  135. OK(runner, cmark_node_set_list_type(bullet_list, CMARK_ORDERED_LIST),
  136. "set_list_type ordered");
  137. OK(runner, cmark_node_set_list_start(bullet_list, 3),
  138. "set_list_start");
  139. OK(runner, cmark_node_set_list_tight(bullet_list, 0),
  140. "set_list_tight loose");
  141. OK(runner, cmark_node_set_list_type(ordered_list, CMARK_BULLET_LIST),
  142. "set_list_type bullet");
  143. OK(runner, cmark_node_set_list_tight(ordered_list, 1),
  144. "set_list_tight tight");
  145. OK(runner, cmark_node_set_string_content(code, "CODE\n"),
  146. "set_string_content indented code");
  147. OK(runner, cmark_node_set_string_content(fenced, "FENCED\n"),
  148. "set_string_content fenced code");
  149. OK(runner, cmark_node_set_fence_info(fenced, "LANG"),
  150. "set_fence_info");
  151. OK(runner, cmark_node_set_string_content(html, "<div>HTML</div>\n"),
  152. "set_string_content html");
  153. OK(runner, cmark_node_set_url(link, "URL"),
  154. "set_url");
  155. OK(runner, cmark_node_set_title(link, "TITLE"),
  156. "set_title");
  157. OK(runner, cmark_node_set_string_content(string, "LINK"),
  158. "set_string_content string");
  159. char *rendered_html = cmark_render_html(doc);
  160. static const char expected_html[] =
  161. "<h3>Header</h3>\n"
  162. "<ol start=\"3\">\n"
  163. "<li>\n"
  164. "<p>Item 1</p>\n"
  165. "</li>\n"
  166. "<li>\n"
  167. "<p>Item 2</p>\n"
  168. "</li>\n"
  169. "</ol>\n"
  170. "<ul>\n"
  171. "<li>Item 1</li>\n"
  172. "<li>Item 2</li>\n"
  173. "</ul>\n"
  174. "<pre><code>CODE\n"
  175. "</code></pre>\n"
  176. "<pre><code class=\"language-LANG\">FENCED\n"
  177. "</code></pre>\n"
  178. "<div>HTML</div>\n"
  179. "<p><a href=\"URL\" title=\"TITLE\">LINK</a></p>\n";
  180. STR_EQ(runner, rendered_html, expected_html, "setters work");
  181. free(rendered_html);
  182. // Getter errors
  183. INT_EQ(runner, cmark_node_get_header_level(bullet_list), 0,
  184. "get_header_level error");
  185. INT_EQ(runner, cmark_node_get_list_type(header), CMARK_NO_LIST,
  186. "get_list_type error");
  187. INT_EQ(runner, cmark_node_get_list_start(code), 0,
  188. "get_list_start error");
  189. INT_EQ(runner, cmark_node_get_list_tight(fenced), 0,
  190. "get_list_tight error");
  191. OK(runner, cmark_node_get_string_content(ordered_list) == NULL,
  192. "get_string_content error");
  193. OK(runner, cmark_node_get_fence_info(paragraph) == NULL,
  194. "get_fence_info error");
  195. OK(runner, cmark_node_get_url(html) == NULL,
  196. "get_url error");
  197. OK(runner, cmark_node_get_title(header) == NULL,
  198. "get_title error");
  199. // Setter errors
  200. OK(runner, !cmark_node_set_header_level(bullet_list, 3),
  201. "set_header_level error");
  202. OK(runner, !cmark_node_set_list_type(header, CMARK_ORDERED_LIST),
  203. "set_list_type error");
  204. OK(runner, !cmark_node_set_list_start(code, 3),
  205. "set_list_start error");
  206. OK(runner, !cmark_node_set_list_tight(fenced, 0),
  207. "set_list_tight error");
  208. OK(runner, !cmark_node_set_string_content(ordered_list, "content\n"),
  209. "set_string_content error");
  210. OK(runner, !cmark_node_set_fence_info(paragraph, "lang"),
  211. "set_fence_info error");
  212. OK(runner, !cmark_node_set_url(html, "url"),
  213. "set_url error");
  214. OK(runner, !cmark_node_set_title(header, "title"),
  215. "set_title error");
  216. OK(runner, !cmark_node_set_header_level(header, 0),
  217. "set_header_level too small");
  218. OK(runner, !cmark_node_set_header_level(header, 7),
  219. "set_header_level too large");
  220. OK(runner, !cmark_node_set_list_type(bullet_list, CMARK_NO_LIST),
  221. "set_list_type invalid");
  222. OK(runner, !cmark_node_set_list_start(bullet_list, -1),
  223. "set_list_start negative");
  224. cmark_node_destroy(doc);
  225. }
  226. static void
  227. node_check(test_batch_runner *runner) {
  228. // Construct an incomplete tree.
  229. cmark_node *doc = cmark_node_new(CMARK_NODE_DOCUMENT);
  230. cmark_node *p1 = cmark_node_new(CMARK_NODE_PARAGRAPH);
  231. cmark_node *p2 = cmark_node_new(CMARK_NODE_PARAGRAPH);
  232. doc->first_child = p1;
  233. p1->next = p2;
  234. INT_EQ(runner, cmark_node_check(doc, NULL), 4, "node_check works");
  235. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  236. "node_check fixes tree");
  237. cmark_node_destroy(doc);
  238. }
  239. static void
  240. create_tree(test_batch_runner *runner)
  241. {
  242. char *html;
  243. cmark_node *doc = cmark_node_new(CMARK_NODE_DOCUMENT);
  244. cmark_node *p = cmark_node_new(CMARK_NODE_PARAGRAPH);
  245. OK(runner, cmark_node_append_child(doc, p), "append1");
  246. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "append1 consistent");
  247. OK(runner, cmark_node_parent(p) == doc, "node_parent");
  248. cmark_node *emph = cmark_node_new(CMARK_NODE_EMPH);
  249. OK(runner, cmark_node_prepend_child(p, emph), "prepend1");
  250. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "prepend1 consistent");
  251. cmark_node *str1 = cmark_node_new(CMARK_NODE_STRING);
  252. cmark_node_set_string_content(str1, "Hello, ");
  253. OK(runner, cmark_node_prepend_child(p, str1), "prepend2");
  254. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "prepend2 consistent");
  255. cmark_node *str3 = cmark_node_new(CMARK_NODE_STRING);
  256. cmark_node_set_string_content(str3, "!");
  257. OK(runner, cmark_node_append_child(p, str3), "append2");
  258. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "append2 consistent");
  259. cmark_node *str2 = cmark_node_new(CMARK_NODE_STRING);
  260. cmark_node_set_string_content(str2, "world");
  261. OK(runner, cmark_node_append_child(emph, str2), "append3");
  262. INT_EQ(runner, cmark_node_check(doc, NULL), 0, "append3 consistent");
  263. html = cmark_render_html(doc);
  264. STR_EQ(runner, html, "<p>Hello, <em>world</em>!</p>\n",
  265. "render_html");
  266. free(html);
  267. OK(runner, cmark_node_insert_before(str1, str3), "ins before1");
  268. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  269. "ins before1 consistent");
  270. // 31e
  271. OK(runner, cmark_node_first_child(p) == str3, "ins before1 works");
  272. OK(runner, cmark_node_insert_before(str1, emph), "ins before2");
  273. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  274. "ins before2 consistent");
  275. // 3e1
  276. OK(runner, cmark_node_last_child(p) == str1, "ins before2 works");
  277. OK(runner, cmark_node_insert_after(str1, str3), "ins after1");
  278. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  279. "ins after1 consistent");
  280. // e13
  281. OK(runner, cmark_node_next(str1) == str3, "ins after1 works");
  282. OK(runner, cmark_node_insert_after(str1, emph), "ins after2");
  283. INT_EQ(runner, cmark_node_check(doc, NULL), 0,
  284. "ins after2 consistent");
  285. // 1e3
  286. OK(runner, cmark_node_previous(emph) == str1, "ins after2 works");
  287. cmark_node_unlink(emph);
  288. html = cmark_render_html(doc);
  289. STR_EQ(runner, html, "<p>Hello, !</p>\n",
  290. "render_html after shuffling");
  291. free(html);
  292. cmark_node_destroy(doc);
  293. // TODO: Test that the contents of an unlinked inline are valid
  294. // after the parent block was destroyed. This doesn't work so far.
  295. cmark_node_destroy(emph);
  296. }
  297. void
  298. hierarchy(test_batch_runner *runner)
  299. {
  300. cmark_node *bquote1 = cmark_node_new(CMARK_NODE_BQUOTE);
  301. cmark_node *bquote2 = cmark_node_new(CMARK_NODE_BQUOTE);
  302. cmark_node *bquote3 = cmark_node_new(CMARK_NODE_BQUOTE);
  303. OK(runner, cmark_node_append_child(bquote1, bquote2),
  304. "append bquote2");
  305. OK(runner, cmark_node_append_child(bquote2, bquote3),
  306. "append bquote3");
  307. OK(runner, !cmark_node_append_child(bquote3, bquote3),
  308. "adding a node as child of itself fails");
  309. OK(runner, !cmark_node_append_child(bquote3, bquote1),
  310. "adding a parent as child fails");
  311. cmark_node_destroy(bquote1);
  312. int max_node_type = CMARK_NODE_LAST_BLOCK > CMARK_NODE_LAST_INLINE
  313. ? CMARK_NODE_LAST_BLOCK : CMARK_NODE_LAST_INLINE;
  314. OK(runner, max_node_type < 32, "all node types < 32");
  315. int list_item_flag = 1 << CMARK_NODE_LIST_ITEM;
  316. int top_level_blocks =
  317. (1 << CMARK_NODE_BQUOTE) |
  318. (1 << CMARK_NODE_LIST) |
  319. (1 << CMARK_NODE_FENCED_CODE) |
  320. (1 << CMARK_NODE_INDENTED_CODE) |
  321. (1 << CMARK_NODE_HTML) |
  322. (1 << CMARK_NODE_PARAGRAPH) |
  323. (1 << CMARK_NODE_ATX_HEADER) |
  324. (1 << CMARK_NODE_SETEXT_HEADER) |
  325. (1 << CMARK_NODE_HRULE) |
  326. (1 << CMARK_NODE_REFERENCE_DEF);
  327. int all_inlines =
  328. (1 << CMARK_NODE_STRING) |
  329. (1 << CMARK_NODE_SOFTBREAK) |
  330. (1 << CMARK_NODE_LINEBREAK) |
  331. (1 << CMARK_NODE_INLINE_CODE) |
  332. (1 << CMARK_NODE_INLINE_HTML) |
  333. (1 << CMARK_NODE_EMPH) |
  334. (1 << CMARK_NODE_STRONG) |
  335. (1 << CMARK_NODE_LINK) |
  336. (1 << CMARK_NODE_IMAGE);
  337. test_content(runner, CMARK_NODE_DOCUMENT, top_level_blocks);
  338. test_content(runner, CMARK_NODE_BQUOTE, top_level_blocks);
  339. test_content(runner, CMARK_NODE_LIST, list_item_flag);
  340. test_content(runner, CMARK_NODE_LIST_ITEM, top_level_blocks);
  341. test_content(runner, CMARK_NODE_FENCED_CODE, 0);
  342. test_content(runner, CMARK_NODE_INDENTED_CODE, 0);
  343. test_content(runner, CMARK_NODE_HTML, 0);
  344. test_content(runner, CMARK_NODE_PARAGRAPH, all_inlines);
  345. test_content(runner, CMARK_NODE_ATX_HEADER, all_inlines);
  346. test_content(runner, CMARK_NODE_SETEXT_HEADER, all_inlines);
  347. test_content(runner, CMARK_NODE_HRULE, 0);
  348. test_content(runner, CMARK_NODE_REFERENCE_DEF, 0);
  349. test_content(runner, CMARK_NODE_STRING, 0);
  350. test_content(runner, CMARK_NODE_SOFTBREAK, 0);
  351. test_content(runner, CMARK_NODE_LINEBREAK, 0);
  352. test_content(runner, CMARK_NODE_INLINE_CODE, 0);
  353. test_content(runner, CMARK_NODE_INLINE_HTML, 0);
  354. test_content(runner, CMARK_NODE_EMPH, all_inlines);
  355. test_content(runner, CMARK_NODE_STRONG, all_inlines);
  356. test_content(runner, CMARK_NODE_LINK, all_inlines);
  357. test_content(runner, CMARK_NODE_IMAGE, all_inlines);
  358. }
  359. static void
  360. test_content(test_batch_runner *runner, cmark_node_type type,
  361. int allowed_content)
  362. {
  363. cmark_node *node = cmark_node_new(type);
  364. for (int i = 0; i < num_node_types; ++i) {
  365. cmark_node_type child_type = node_types[i];
  366. cmark_node *child = cmark_node_new(child_type);
  367. int got = cmark_node_append_child(node, child);
  368. int expected = (allowed_content >> child_type) & 1;
  369. INT_EQ(runner, got, expected,
  370. "add %d as child of %d", child_type, type);
  371. cmark_node_destroy(child);
  372. }
  373. cmark_node_destroy(node);
  374. }
  375. static void
  376. render_html(test_batch_runner *runner)
  377. {
  378. char *html;
  379. static const char markdown[] =
  380. "foo *bar*\n"
  381. "\n"
  382. "paragraph 2\n";
  383. cmark_node *doc = cmark_parse_document(markdown, sizeof(markdown) - 1);
  384. cmark_node *paragraph = cmark_node_first_child(doc);
  385. html = cmark_render_html(paragraph);
  386. STR_EQ(runner, html, "<p>foo <em>bar</em></p>\n",
  387. "render single paragraph");
  388. free(html);
  389. cmark_node *string = cmark_node_first_child(paragraph);
  390. html = cmark_render_html(string);
  391. STR_EQ(runner, html, "foo ", "render single inline");
  392. free(html);
  393. cmark_node *emph = cmark_node_next(string);
  394. html = cmark_render_html(emph);
  395. STR_EQ(runner, html, "<em>bar</em>", "render inline with children");
  396. free(html);
  397. cmark_node_destroy(doc);
  398. }
  399. int main() {
  400. int retval;
  401. test_batch_runner *runner = test_batch_runner_new();
  402. constructor(runner);
  403. accessors(runner);
  404. node_check(runner);
  405. create_tree(runner);
  406. hierarchy(runner);
  407. render_html(runner);
  408. test_print_summary(runner);
  409. retval = test_ok(runner) ? 0 : 1;
  410. free(runner);
  411. return retval;
  412. }