aboutsummaryrefslogtreecommitdiff
path: root/api_test/main.c
blob: 933a4bdf7238fb1959e07ddf9f61531289bd79bf (plain)
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #include "cmark.h"
  5. #include "node.h"
  6. #include "harness.h"
  7. static const cmark_node_type node_types[] = {
  8. CMARK_NODE_DOCUMENT,
  9. CMARK_NODE_BQUOTE,
  10. CMARK_NODE_LIST,
  11. CMARK_NODE_LIST_ITEM,
  12. CMARK_NODE_FENCED_CODE,
  13. CMARK_NODE_INDENTED_CODE,
  14. CMARK_NODE_HTML,
  15. CMARK_NODE_PARAGRAPH,
  16. CMARK_NODE_ATX_HEADER,
  17. CMARK_NODE_SETEXT_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. switch (node->type) {
  42. case CMARK_NODE_ATX_HEADER:
  43. case CMARK_NODE_SETEXT_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 unsigned 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_type(header), CMARK_NODE_ATX_HEADER,
  90. "get_type header");
  91. INT_EQ(runner, cmark_node_get_header_level(header), 2,
  92. "get_header_level");
  93. cmark_node *bullet_list = cmark_node_next(header);
  94. INT_EQ(runner, cmark_node_get_type(bullet_list), CMARK_NODE_LIST,
  95. "get_type bullet list");
  96. INT_EQ(runner, cmark_node_get_list_type(bullet_list),
  97. CMARK_BULLET_LIST, "get_list_type bullet");
  98. INT_EQ(runner, cmark_node_get_list_tight(bullet_list), 1,
  99. "get_list_tight tight");
  100. cmark_node *ordered_list = cmark_node_next(bullet_list);
  101. INT_EQ(runner, cmark_node_get_type(ordered_list), CMARK_NODE_LIST,
  102. "get_type ordered list");
  103. INT_EQ(runner, cmark_node_get_list_type(ordered_list),
  104. CMARK_ORDERED_LIST, "get_list_type ordered");
  105. INT_EQ(runner, cmark_node_get_list_start(ordered_list), 2,
  106. "get_list_start");
  107. INT_EQ(runner, cmark_node_get_list_tight(ordered_list), 0,
  108. "get_list_tight loose");
  109. cmark_node *code = cmark_node_next(ordered_list);
  110. INT_EQ(runner, cmark_node_get_type(code), CMARK_NODE_INDENTED_CODE,
  111. "get_type indented code");
  112. STR_EQ(runner, cmark_node_get_string_content(code), "code\n",
  113. "get_string_content indented code");
  114. cmark_node *fenced = cmark_node_next(code);
  115. INT_EQ(runner, cmark_node_get_type(fenced), CMARK_NODE_FENCED_CODE,
  116. "get_type fenced code");
  117. STR_EQ(runner, cmark_node_get_string_content(fenced), "fenced\n",
  118. "get_string_content fenced code");
  119. STR_EQ(runner, cmark_node_get_fence_info(fenced), "lang",
  120. "get_fence_info");
  121. cmark_node *html = cmark_node_next(fenced);
  122. INT_EQ(runner, cmark_node_get_type(html), CMARK_NODE_HTML,
  123. "get_type html");
  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_type(paragraph), CMARK_NODE_PARAGRAPH,
  128. "get_type paragraph");
  129. INT_EQ(runner, cmark_node_get_start_line(paragraph), 19,
  130. "get_start_line");
  131. INT_EQ(runner, cmark_node_get_start_column(paragraph), 1,
  132. "get_start_column");
  133. INT_EQ(runner, cmark_node_get_end_line(paragraph), 19,
  134. "get_end_line");
  135. cmark_node *link = cmark_node_first_child(paragraph);
  136. INT_EQ(runner, cmark_node_get_type(link), CMARK_NODE_LINK,
  137. "get_type link");
  138. STR_EQ(runner, cmark_node_get_url(link), "url",
  139. "get_url");
  140. STR_EQ(runner, cmark_node_get_title(link), "title",
  141. "get_title");
  142. cmark_node *string = cmark_node_first_child(link);
  143. INT_EQ(runner, cmark_node_get_type(string), CMARK_NODE_STRING,
  144. "get_type string");
  145. STR_EQ(runner, cmark_node_get_string_content(string), "link",
  146. "get_string_content string");
  147. // Setters
  148. OK(runner, cmark_node_set_header_level(header, 3),
  149. "set_header_level");
  150. OK(runner, cmark_node_set_list_type(bullet_list, CMARK_ORDERED_LIST),
  151. "set_list_type ordered");
  152. OK(runner, cmark_node_set_list_start(bullet_list, 3),
  153. "set_list_start");
  154. OK(runner, cmark_node_set_list_tight(bullet_list, 0),
  155. "set_list_tight loose");
  156. OK(runner, cmark_node_set_list_type(ordered_list, CMARK_BULLET_LIST),
  157. "set_list_type bullet");
  158. OK(runner, cmark_node_set_list_tight(ordered_list, 1),
  159. "set_list_tight tight");
  160. OK(runner, cmark_node_set_string_content(code, "CODE\n"),
  161. "set_string_content indented code");
  162. OK(runner, cmark_node_set_string_content(fenced, "FENCED\n"),
  163. "set_string_content fenced code");
  164. OK(runner, cmark_node_set_fence_info(fenced, "LANG"),
  165. "set_fence_info");
  166. OK(runner, cmark_node_set_string_content(html, "<div>HTML</div>\n"),
  167. "set_string_content html");
  168. OK(runner, cmark_node_set_url(link, "URL"),
  169. "set_url");
  170. OK(runner, cmark_node_set_title(link, "TITLE"),
  171. "set_title");
  172. OK(runner, cmark_node_set_string_content(string, "LINK"),
  173. "set_string_content string");
  174. char *rendered_html = (char *)cmark_render_html(doc);
  175. static const char expected_html[] =
  176. "<h3>Header</h3>\n"
  177. "<ol start=\"3\">\n"
  178. "<li>\n"
  179. "<p>Item 1</p>\n"
  180. "</li>\n"
  181. "<li>\n"
  182. "<p>Item 2</p>\n"
  183. "</li>\n"
  184. "</ol>\n"
  185. "<ul start=\"2\">\n"
  186. "<li>Item 1</li>\n"
  187. "<li>Item 2</li>\n"
  188. "</ul>\n"
  189. "<pre><code>CODE\n"
  190. "</code></pre>\n"
  191. "<pre><code class=\"language-LANG\">FENCED\n"
  192. "</code></pre>\n"
  193. "<div>HTML</div>\n"
  194. "<p><a href=\"URL\" title=\"TITLE\">LINK</a></p>\n";
  195. STR_EQ(runner, rendered_html, expected_html, "setters work");
  196. free(rendered_html);
  197. // Getter errors
  198. INT_EQ(runner, cmark_node_get_header_level(bullet_list), 0,
  199. "get_header_level error");
  200. INT_EQ(runner, cmark_node_get_list_type(header), CMARK_NO_LIST,
  201. "get_list_type error");
  202. INT_EQ(runner, cmark_node_get_list_start(code), 0,
  203. "get_list_start error");
  204. INT_EQ(runner, cmark_node_get_list_tight(fenced), 0,
  205. "get_list_tight error");
  206. OK(runner, cmark_node_get_string_content(ordered_list) == NULL,
  207. "get_string_content error");
  208. OK(runner, cmark_node_get_fence_info(paragraph) == NULL,
  209. "get_fence_info error");
  210. OK(runner, cmark_node_get_url(html) == NULL,
  211. "get_url error");
  212. OK(runner, cmark_node_get_title(header) == NULL,
  213. "get_title error");
  214. // Setter errors
  215. OK(runner, !cmark_node_set_header_level(bullet_list, 3),
  216. "set_header_level error");
  217. OK(runner, !cmark_node_set_list_type(header, CMARK_ORDERED_LIST),
  218. "set_list_type error");
  219. OK(runner, !cmark_node_set_list_start(code, 3),
  220. "set_list_start error");
  221. OK(runner, !cmark_node_set_list_tight(fenced, 0),
  222. "set_list_tight error");
  223. OK(runner, !cmark_node_set_string_content(ordered_list, "content\n"),
  224. "set_string_content error");
  225. OK(runner, !cmark_node_set_fence_info(paragraph, "lang"),
  226. "set_fence_info error");
  227. OK(runner, !cmark_node_set_url(html, "url"),
  228. "set_url error");
  229. OK(runner, !cmark_node_set_title(header, "title"),
  230. "set_title error");
  231. OK(runner, !cmark_node_set_header_level(header, 0),
  232. "set_header_level too small");
  233. OK(runner, !cmark_node_set_header_level(header, 7),
  234. "set_header_level too large");
  235. OK(runner, !cmark_node_set_list_type(bullet_list, CMARK_NO_LIST),
  236. "set_list_type invalid");
  237. OK(runner, !cmark_node_set_list_start(bullet_list, -1),
  238. "set_list_start negative");
  239. cmark_node_destroy(doc);
  240. }
  241. static void
  242. create_tree(test_batch_runner *runner)
  243. {
  244. char *html;
  245. cmark_node *doc = cmark_node_new(CMARK_NODE_DOCUMENT);
  246. cmark_node *p = cmark_node_new(CMARK_NODE_PARAGRAPH);
  247. OK(runner, cmark_node_append_child(doc, p), "append1");
  248. INT_EQ(runner, cmark_node_check(doc), 0, "append1 consistent");
  249. cmark_node *emph = cmark_node_new(CMARK_NODE_EMPH);
  250. OK(runner, cmark_node_prepend_child(p, emph), "prepend1");
  251. INT_EQ(runner, cmark_node_check(doc), 0, "prepend1 consistent");
  252. cmark_node *str1 = cmark_node_new(CMARK_NODE_STRING);
  253. cmark_node_set_string_content(str1, "Hello, ");
  254. OK(runner, cmark_node_prepend_child(p, str1), "prepend2");
  255. INT_EQ(runner, cmark_node_check(doc), 0, "prepend2 consistent");
  256. cmark_node *str3 = cmark_node_new(CMARK_NODE_STRING);
  257. cmark_node_set_string_content(str3, "!");
  258. OK(runner, cmark_node_append_child(p, str3), "append2");
  259. INT_EQ(runner, cmark_node_check(doc), 0, "append2 consistent");
  260. cmark_node *str2 = cmark_node_new(CMARK_NODE_STRING);
  261. cmark_node_set_string_content(str2, "world");
  262. OK(runner, cmark_node_append_child(emph, str2), "append3");
  263. INT_EQ(runner, cmark_node_check(doc), 0, "append3 consistent");
  264. html = (char *)cmark_render_html(doc);
  265. STR_EQ(runner, html, "<p>Hello, <em>world</em>!</p>\n",
  266. "render_html");
  267. free(html);
  268. OK(runner, cmark_node_insert_before(str1, str3), "ins before1");
  269. INT_EQ(runner, cmark_node_check(doc), 0, "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), 0, "ins before2 consistent");
  274. // 3e1
  275. OK(runner, cmark_node_last_child(p) == str1, "ins before2 works");
  276. OK(runner, cmark_node_insert_after(str1, str3), "ins after1");
  277. INT_EQ(runner, cmark_node_check(doc), 0, "ins after1 consistent");
  278. // e13
  279. OK(runner, cmark_node_last_child(p) == str3, "ins after1 works");
  280. OK(runner, cmark_node_insert_after(str1, emph), "ins after2");
  281. INT_EQ(runner, cmark_node_check(doc), 0, "ins after2 consistent");
  282. // 1e3
  283. OK(runner, cmark_node_first_child(p) == str1, "ins after2 works");
  284. html = (char *)cmark_render_html(doc);
  285. STR_EQ(runner, html, "<p>Hello, <em>world</em>!</p>\n",
  286. "render_html after shuffling");
  287. free(html);
  288. cmark_node_destroy(doc);
  289. }
  290. void
  291. hierarchy(test_batch_runner *runner)
  292. {
  293. cmark_node *bquote1 = cmark_node_new(CMARK_NODE_BQUOTE);
  294. cmark_node *bquote2 = cmark_node_new(CMARK_NODE_BQUOTE);
  295. cmark_node *bquote3 = cmark_node_new(CMARK_NODE_BQUOTE);
  296. OK(runner, cmark_node_append_child(bquote1, bquote2),
  297. "append bquote2");
  298. OK(runner, cmark_node_append_child(bquote2, bquote3),
  299. "append bquote3");
  300. OK(runner, !cmark_node_append_child(bquote3, bquote3),
  301. "adding a node as child of itself fails");
  302. OK(runner, !cmark_node_append_child(bquote3, bquote1),
  303. "adding a parent as child fails");
  304. cmark_node_destroy(bquote1);
  305. int max_node_type = CMARK_NODE_LAST_BLOCK > CMARK_NODE_LAST_INLINE
  306. ? CMARK_NODE_LAST_BLOCK : CMARK_NODE_LAST_INLINE;
  307. OK(runner, max_node_type < 32, "all node types < 32");
  308. int list_item_flag = 1 << CMARK_NODE_LIST_ITEM;
  309. int top_level_blocks =
  310. (1 << CMARK_NODE_BQUOTE) |
  311. (1 << CMARK_NODE_LIST) |
  312. (1 << CMARK_NODE_FENCED_CODE) |
  313. (1 << CMARK_NODE_INDENTED_CODE) |
  314. (1 << CMARK_NODE_HTML) |
  315. (1 << CMARK_NODE_PARAGRAPH) |
  316. (1 << CMARK_NODE_ATX_HEADER) |
  317. (1 << CMARK_NODE_SETEXT_HEADER) |
  318. (1 << CMARK_NODE_HRULE) |
  319. (1 << CMARK_NODE_REFERENCE_DEF);
  320. int all_inlines =
  321. (1 << CMARK_NODE_STRING) |
  322. (1 << CMARK_NODE_SOFTBREAK) |
  323. (1 << CMARK_NODE_LINEBREAK) |
  324. (1 << CMARK_NODE_INLINE_CODE) |
  325. (1 << CMARK_NODE_INLINE_HTML) |
  326. (1 << CMARK_NODE_EMPH) |
  327. (1 << CMARK_NODE_STRONG) |
  328. (1 << CMARK_NODE_LINK) |
  329. (1 << CMARK_NODE_IMAGE);
  330. test_content(runner, CMARK_NODE_DOCUMENT, top_level_blocks);
  331. test_content(runner, CMARK_NODE_BQUOTE, top_level_blocks);
  332. test_content(runner, CMARK_NODE_LIST, list_item_flag);
  333. test_content(runner, CMARK_NODE_LIST_ITEM, top_level_blocks);
  334. test_content(runner, CMARK_NODE_FENCED_CODE, 0);
  335. test_content(runner, CMARK_NODE_INDENTED_CODE, 0);
  336. test_content(runner, CMARK_NODE_HTML, 0);
  337. test_content(runner, CMARK_NODE_PARAGRAPH, all_inlines);
  338. test_content(runner, CMARK_NODE_ATX_HEADER, all_inlines);
  339. test_content(runner, CMARK_NODE_SETEXT_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 >> i) & 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. int main() {
  369. int retval;
  370. test_batch_runner *runner = test_batch_runner_new();
  371. constructor(runner);
  372. accessors(runner);
  373. create_tree(runner);
  374. hierarchy(runner);
  375. test_print_summary(runner);
  376. retval = test_ok(runner) ? 0 : 1;
  377. free(runner);
  378. return retval;
  379. }