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