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