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