PageRenderTime 437ms CodeModel.GetById 22ms RepoModel.GetById 48ms app.codeStats 0ms

/src/markdown.c

http://github.com/benmills/robotskirt
C | 2556 lines | 2331 code | 146 blank | 79 comment | 202 complexity | 2437de5c51a6dbcde1f1b059f9d169b2 MD5 | raw file

Large files files are truncated, but you can click here to view the full file

  1. /* markdown.c - generic markdown parser */
  2. /*
  3. * Copyright (c) 2009, Natacha Porté
  4. * Copyright (c) 2011, Vicent Marti
  5. *
  6. * Permission to use, copy, modify, and distribute this software for any
  7. * purpose with or without fee is hereby granted, provided that the above
  8. * copyright notice and this permission notice appear in all copies.
  9. *
  10. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  11. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  12. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  13. * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  14. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  15. * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  16. * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  17. */
  18. #include "markdown.h"
  19. #include "stack.h"
  20. #include <assert.h>
  21. #include <string.h>
  22. #include <ctype.h>
  23. #include <stdio.h>
  24. #if defined(_WIN32)
  25. #define strncasecmp _strnicmp
  26. #endif
  27. #define REF_TABLE_SIZE 8
  28. #define BUFFER_BLOCK 0
  29. #define BUFFER_SPAN 1
  30. #define MKD_LI_END 8 /* internal list flag */
  31. #define gperf_case_strncmp(s1, s2, n) strncasecmp(s1, s2, n)
  32. #define GPERF_DOWNCASE 1
  33. #define GPERF_CASE_STRNCMP 1
  34. #include "html_blocks.h"
  35. /***************
  36. * LOCAL TYPES *
  37. ***************/
  38. /* link_ref: reference to a link */
  39. struct link_ref {
  40. unsigned int id;
  41. struct buf *link;
  42. struct buf *title;
  43. struct link_ref *next;
  44. };
  45. /* char_trigger: function pointer to render active chars */
  46. /* returns the number of chars taken care of */
  47. /* data is the pointer of the beginning of the span */
  48. /* offset is the number of valid chars before data */
  49. struct sd_markdown;
  50. typedef size_t
  51. (*char_trigger)(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  52. static size_t char_emphasis(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  53. static size_t char_linebreak(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  54. static size_t char_codespan(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  55. static size_t char_escape(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  56. static size_t char_entity(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  57. static size_t char_langle_tag(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  58. static size_t char_autolink_url(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  59. static size_t char_autolink_email(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  60. static size_t char_autolink_www(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  61. static size_t char_link(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  62. static size_t char_superscript(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
  63. enum markdown_char_t {
  64. MD_CHAR_NONE = 0,
  65. MD_CHAR_EMPHASIS,
  66. MD_CHAR_CODESPAN,
  67. MD_CHAR_LINEBREAK,
  68. MD_CHAR_LINK,
  69. MD_CHAR_LANGLE,
  70. MD_CHAR_ESCAPE,
  71. MD_CHAR_ENTITITY,
  72. MD_CHAR_AUTOLINK_URL,
  73. MD_CHAR_AUTOLINK_EMAIL,
  74. MD_CHAR_AUTOLINK_WWW,
  75. MD_CHAR_SUPERSCRIPT,
  76. };
  77. static char_trigger markdown_char_ptrs[] = {
  78. NULL,
  79. &char_emphasis,
  80. &char_codespan,
  81. &char_linebreak,
  82. &char_link,
  83. &char_langle_tag,
  84. &char_escape,
  85. &char_entity,
  86. &char_autolink_url,
  87. &char_autolink_email,
  88. &char_autolink_www,
  89. &char_superscript,
  90. };
  91. /* render • structure containing one particular render */
  92. struct sd_markdown {
  93. struct sd_callbacks cb;
  94. void *opaque;
  95. struct link_ref *refs[REF_TABLE_SIZE];
  96. uint8_t active_char[256];
  97. struct stack work_bufs[2];
  98. unsigned int ext_flags;
  99. size_t max_nesting;
  100. int in_link_body;
  101. };
  102. /***************************
  103. * HELPER FUNCTIONS *
  104. ***************************/
  105. static inline struct buf *
  106. rndr_newbuf(struct sd_markdown *rndr, int type)
  107. {
  108. static const size_t buf_size[2] = {256, 64};
  109. struct buf *work = NULL;
  110. struct stack *pool = &rndr->work_bufs[type];
  111. if (pool->size < pool->asize &&
  112. pool->item[pool->size] != NULL) {
  113. work = pool->item[pool->size++];
  114. work->size = 0;
  115. } else {
  116. work = bufnew(buf_size[type]);
  117. stack_push(pool, work);
  118. }
  119. return work;
  120. }
  121. static inline void
  122. rndr_popbuf(struct sd_markdown *rndr, int type)
  123. {
  124. rndr->work_bufs[type].size--;
  125. }
  126. static void
  127. unscape_text(struct buf *ob, struct buf *src)
  128. {
  129. size_t i = 0, org;
  130. while (i < src->size) {
  131. org = i;
  132. while (i < src->size && src->data[i] != '\\')
  133. i++;
  134. if (i > org)
  135. bufput(ob, src->data + org, i - org);
  136. if (i + 1 >= src->size)
  137. break;
  138. bufputc(ob, src->data[i + 1]);
  139. i += 2;
  140. }
  141. }
  142. static unsigned int
  143. hash_link_ref(const uint8_t *link_ref, size_t length)
  144. {
  145. size_t i;
  146. unsigned int hash = 0;
  147. for (i = 0; i < length; ++i)
  148. hash = tolower(link_ref[i]) + (hash << 6) + (hash << 16) - hash;
  149. return hash;
  150. }
  151. static struct link_ref *
  152. add_link_ref(
  153. struct link_ref **references,
  154. const uint8_t *name, size_t name_size)
  155. {
  156. struct link_ref *ref = calloc(1, sizeof(struct link_ref));
  157. if (!ref)
  158. return NULL;
  159. ref->id = hash_link_ref(name, name_size);
  160. ref->next = references[ref->id % REF_TABLE_SIZE];
  161. references[ref->id % REF_TABLE_SIZE] = ref;
  162. return ref;
  163. }
  164. static struct link_ref *
  165. find_link_ref(struct link_ref **references, uint8_t *name, size_t length)
  166. {
  167. unsigned int hash = hash_link_ref(name, length);
  168. struct link_ref *ref = NULL;
  169. ref = references[hash % REF_TABLE_SIZE];
  170. while (ref != NULL) {
  171. if (ref->id == hash)
  172. return ref;
  173. ref = ref->next;
  174. }
  175. return NULL;
  176. }
  177. static void
  178. free_link_refs(struct link_ref **references)
  179. {
  180. size_t i;
  181. for (i = 0; i < REF_TABLE_SIZE; ++i) {
  182. struct link_ref *r = references[i];
  183. struct link_ref *next;
  184. while (r) {
  185. next = r->next;
  186. bufrelease(r->link);
  187. bufrelease(r->title);
  188. free(r);
  189. r = next;
  190. }
  191. }
  192. }
  193. /*
  194. * Check whether a char is a Markdown space.
  195. * Right now we only consider spaces the actual
  196. * space and a newline: tabs and carriage returns
  197. * are filtered out during the preprocessing phase.
  198. *
  199. * If we wanted to actually be UTF-8 compliant, we
  200. * should instead extract an Unicode codepoint from
  201. * this character and check for space properties.
  202. */
  203. static inline int
  204. _isspace(int c)
  205. {
  206. return c == ' ' || c == '\n';
  207. }
  208. /****************************
  209. * INLINE PARSING FUNCTIONS *
  210. ****************************/
  211. /* is_mail_autolink • looks for the address part of a mail autolink and '>' */
  212. /* this is less strict than the original markdown e-mail address matching */
  213. static size_t
  214. is_mail_autolink(uint8_t *data, size_t size)
  215. {
  216. size_t i = 0, nb = 0;
  217. /* address is assumed to be: [-@._a-zA-Z0-9]+ with exactly one '@' */
  218. for (i = 0; i < size; ++i) {
  219. if (isalnum(data[i]))
  220. continue;
  221. switch (data[i]) {
  222. case '@':
  223. nb++;
  224. case '-':
  225. case '.':
  226. case '_':
  227. break;
  228. case '>':
  229. return (nb == 1) ? i + 1 : 0;
  230. default:
  231. return 0;
  232. }
  233. }
  234. return 0;
  235. }
  236. /* tag_length • returns the length of the given tag, or 0 is it's not valid */
  237. static size_t
  238. tag_length(uint8_t *data, size_t size, enum mkd_autolink *autolink)
  239. {
  240. size_t i, j;
  241. /* a valid tag can't be shorter than 3 chars */
  242. if (size < 3) return 0;
  243. /* begins with a '<' optionally followed by '/', followed by letter or number */
  244. if (data[0] != '<') return 0;
  245. i = (data[1] == '/') ? 2 : 1;
  246. if (!isalnum(data[i]))
  247. return 0;
  248. /* scheme test */
  249. *autolink = MKDA_NOT_AUTOLINK;
  250. /* try to find the beginning of an URI */
  251. while (i < size && (isalnum(data[i]) || data[i] == '.' || data[i] == '+' || data[i] == '-'))
  252. i++;
  253. if (i > 1 && data[i] == '@') {
  254. if ((j = is_mail_autolink(data + i, size - i)) != 0) {
  255. *autolink = MKDA_EMAIL;
  256. return i + j;
  257. }
  258. }
  259. if (i > 2 && data[i] == ':') {
  260. *autolink = MKDA_NORMAL;
  261. i++;
  262. }
  263. /* completing autolink test: no whitespace or ' or " */
  264. if (i >= size)
  265. *autolink = MKDA_NOT_AUTOLINK;
  266. else if (*autolink) {
  267. j = i;
  268. while (i < size) {
  269. if (data[i] == '\\') i += 2;
  270. else if (data[i] == '>' || data[i] == '\'' ||
  271. data[i] == '"' || data[i] == ' ' || data[i] == '\n')
  272. break;
  273. else i++;
  274. }
  275. if (i >= size) return 0;
  276. if (i > j && data[i] == '>') return i + 1;
  277. /* one of the forbidden chars has been found */
  278. *autolink = MKDA_NOT_AUTOLINK;
  279. }
  280. /* looking for sometinhg looking like a tag end */
  281. while (i < size && data[i] != '>') i++;
  282. if (i >= size) return 0;
  283. return i + 1;
  284. }
  285. /* parse_inline • parses inline markdown elements */
  286. static void
  287. parse_inline(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  288. {
  289. size_t i = 0, end = 0;
  290. uint8_t action = 0;
  291. struct buf work = { 0, 0, 0, 0 };
  292. if (rndr->work_bufs[BUFFER_SPAN].size +
  293. rndr->work_bufs[BUFFER_BLOCK].size > rndr->max_nesting)
  294. return;
  295. while (i < size) {
  296. /* copying inactive chars into the output */
  297. while (end < size && (action = rndr->active_char[data[end]]) == 0) {
  298. end++;
  299. }
  300. if (rndr->cb.normal_text) {
  301. work.data = data + i;
  302. work.size = end - i;
  303. rndr->cb.normal_text(ob, &work, rndr->opaque);
  304. }
  305. else
  306. bufput(ob, data + i, end - i);
  307. if (end >= size) break;
  308. i = end;
  309. end = markdown_char_ptrs[(int)action](ob, rndr, data + i, i, size - i);
  310. if (!end) /* no action from the callback */
  311. end = i + 1;
  312. else {
  313. i += end;
  314. end = i;
  315. }
  316. }
  317. }
  318. /* find_emph_char • looks for the next emph uint8_t, skipping other constructs */
  319. static size_t
  320. find_emph_char(uint8_t *data, size_t size, uint8_t c)
  321. {
  322. size_t i = 1;
  323. while (i < size) {
  324. while (i < size && data[i] != c && data[i] != '`' && data[i] != '[')
  325. i++;
  326. if (i == size)
  327. return 0;
  328. if (data[i] == c)
  329. return i;
  330. /* not counting escaped chars */
  331. if (i && data[i - 1] == '\\') {
  332. i++; continue;
  333. }
  334. if (data[i] == '`') {
  335. size_t span_nb = 0, bt;
  336. size_t tmp_i = 0;
  337. /* counting the number of opening backticks */
  338. while (i < size && data[i] == '`') {
  339. i++; span_nb++;
  340. }
  341. if (i >= size) return 0;
  342. /* finding the matching closing sequence */
  343. bt = 0;
  344. while (i < size && bt < span_nb) {
  345. if (!tmp_i && data[i] == c) tmp_i = i;
  346. if (data[i] == '`') bt++;
  347. else bt = 0;
  348. i++;
  349. }
  350. if (i >= size) return tmp_i;
  351. }
  352. /* skipping a link */
  353. else if (data[i] == '[') {
  354. size_t tmp_i = 0;
  355. uint8_t cc;
  356. i++;
  357. while (i < size && data[i] != ']') {
  358. if (!tmp_i && data[i] == c) tmp_i = i;
  359. i++;
  360. }
  361. i++;
  362. while (i < size && (data[i] == ' ' || data[i] == '\n'))
  363. i++;
  364. if (i >= size)
  365. return tmp_i;
  366. switch (data[i]) {
  367. case '[':
  368. cc = ']'; break;
  369. case '(':
  370. cc = ')'; break;
  371. default:
  372. if (tmp_i)
  373. return tmp_i;
  374. else
  375. continue;
  376. }
  377. i++;
  378. while (i < size && data[i] != cc) {
  379. if (!tmp_i && data[i] == c) tmp_i = i;
  380. i++;
  381. }
  382. if (i >= size)
  383. return tmp_i;
  384. i++;
  385. }
  386. }
  387. return 0;
  388. }
  389. /* parse_emph1 • parsing single emphase */
  390. /* closed by a symbol not preceded by whitespace and not followed by symbol */
  391. static size_t
  392. parse_emph1(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)
  393. {
  394. size_t i = 0, len;
  395. struct buf *work = 0;
  396. int r;
  397. if (!rndr->cb.emphasis) return 0;
  398. /* skipping one symbol if coming from emph3 */
  399. if (size > 1 && data[0] == c && data[1] == c) i = 1;
  400. while (i < size) {
  401. len = find_emph_char(data + i, size - i, c);
  402. if (!len) return 0;
  403. i += len;
  404. if (i >= size) return 0;
  405. if (data[i] == c && !_isspace(data[i - 1])) {
  406. if (rndr->ext_flags & MKDEXT_NO_INTRA_EMPHASIS) {
  407. if (i + 1 < size && isalnum(data[i + 1]))
  408. continue;
  409. }
  410. work = rndr_newbuf(rndr, BUFFER_SPAN);
  411. parse_inline(work, rndr, data, i);
  412. r = rndr->cb.emphasis(ob, work, rndr->opaque);
  413. rndr_popbuf(rndr, BUFFER_SPAN);
  414. return r ? i + 1 : 0;
  415. }
  416. }
  417. return 0;
  418. }
  419. /* parse_emph2 • parsing single emphase */
  420. static size_t
  421. parse_emph2(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)
  422. {
  423. int (*render_method)(struct buf *ob, const struct buf *text, void *opaque);
  424. size_t i = 0, len;
  425. struct buf *work = 0;
  426. int r;
  427. render_method = (c == '~') ? rndr->cb.strikethrough : rndr->cb.double_emphasis;
  428. if (!render_method)
  429. return 0;
  430. while (i < size) {
  431. len = find_emph_char(data + i, size - i, c);
  432. if (!len) return 0;
  433. i += len;
  434. if (i + 1 < size && data[i] == c && data[i + 1] == c && i && !_isspace(data[i - 1])) {
  435. work = rndr_newbuf(rndr, BUFFER_SPAN);
  436. parse_inline(work, rndr, data, i);
  437. r = render_method(ob, work, rndr->opaque);
  438. rndr_popbuf(rndr, BUFFER_SPAN);
  439. return r ? i + 2 : 0;
  440. }
  441. i++;
  442. }
  443. return 0;
  444. }
  445. /* parse_emph3 • parsing single emphase */
  446. /* finds the first closing tag, and delegates to the other emph */
  447. static size_t
  448. parse_emph3(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)
  449. {
  450. size_t i = 0, len;
  451. int r;
  452. while (i < size) {
  453. len = find_emph_char(data + i, size - i, c);
  454. if (!len) return 0;
  455. i += len;
  456. /* skip whitespace preceded symbols */
  457. if (data[i] != c || _isspace(data[i - 1]))
  458. continue;
  459. if (i + 2 < size && data[i + 1] == c && data[i + 2] == c && rndr->cb.triple_emphasis) {
  460. /* triple symbol found */
  461. struct buf *work = rndr_newbuf(rndr, BUFFER_SPAN);
  462. parse_inline(work, rndr, data, i);
  463. r = rndr->cb.triple_emphasis(ob, work, rndr->opaque);
  464. rndr_popbuf(rndr, BUFFER_SPAN);
  465. return r ? i + 3 : 0;
  466. } else if (i + 1 < size && data[i + 1] == c) {
  467. /* double symbol found, handing over to emph1 */
  468. len = parse_emph1(ob, rndr, data - 2, size + 2, c);
  469. if (!len) return 0;
  470. else return len - 2;
  471. } else {
  472. /* single symbol found, handing over to emph2 */
  473. len = parse_emph2(ob, rndr, data - 1, size + 1, c);
  474. if (!len) return 0;
  475. else return len - 1;
  476. }
  477. }
  478. return 0;
  479. }
  480. /* char_emphasis • single and double emphasis parsing */
  481. static size_t
  482. char_emphasis(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  483. {
  484. uint8_t c = data[0];
  485. size_t ret;
  486. if (rndr->ext_flags & MKDEXT_NO_INTRA_EMPHASIS) {
  487. if (offset > 0 && !_isspace(data[-1]) && data[-1] != '>')
  488. return 0;
  489. }
  490. if (size > 2 && data[1] != c) {
  491. /* whitespace cannot follow an opening emphasis;
  492. * strikethrough only takes two characters '~~' */
  493. if (c == '~' || _isspace(data[1]) || (ret = parse_emph1(ob, rndr, data + 1, size - 1, c)) == 0)
  494. return 0;
  495. return ret + 1;
  496. }
  497. if (size > 3 && data[1] == c && data[2] != c) {
  498. if (_isspace(data[2]) || (ret = parse_emph2(ob, rndr, data + 2, size - 2, c)) == 0)
  499. return 0;
  500. return ret + 2;
  501. }
  502. if (size > 4 && data[1] == c && data[2] == c && data[3] != c) {
  503. if (c == '~' || _isspace(data[3]) || (ret = parse_emph3(ob, rndr, data + 3, size - 3, c)) == 0)
  504. return 0;
  505. return ret + 3;
  506. }
  507. return 0;
  508. }
  509. /* char_linebreak • '\n' preceded by two spaces (assuming linebreak != 0) */
  510. static size_t
  511. char_linebreak(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  512. {
  513. if (offset < 2 || data[-1] != ' ' || data[-2] != ' ')
  514. return 0;
  515. /* removing the last space from ob and rendering */
  516. while (ob->size && ob->data[ob->size - 1] == ' ')
  517. ob->size--;
  518. return rndr->cb.linebreak(ob, rndr->opaque) ? 1 : 0;
  519. }
  520. /* char_codespan • '`' parsing a code span (assuming codespan != 0) */
  521. static size_t
  522. char_codespan(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  523. {
  524. size_t end, nb = 0, i, f_begin, f_end;
  525. /* counting the number of backticks in the delimiter */
  526. while (nb < size && data[nb] == '`')
  527. nb++;
  528. /* finding the next delimiter */
  529. i = 0;
  530. for (end = nb; end < size && i < nb; end++) {
  531. if (data[end] == '`') i++;
  532. else i = 0;
  533. }
  534. if (i < nb && end >= size)
  535. return 0; /* no matching delimiter */
  536. /* trimming outside whitespaces */
  537. f_begin = nb;
  538. while (f_begin < end && data[f_begin] == ' ')
  539. f_begin++;
  540. f_end = end - nb;
  541. while (f_end > nb && data[f_end-1] == ' ')
  542. f_end--;
  543. /* real code span */
  544. if (f_begin < f_end) {
  545. struct buf work = { data + f_begin, f_end - f_begin, 0, 0 };
  546. if (!rndr->cb.codespan(ob, &work, rndr->opaque))
  547. end = 0;
  548. } else {
  549. if (!rndr->cb.codespan(ob, 0, rndr->opaque))
  550. end = 0;
  551. }
  552. return end;
  553. }
  554. /* char_escape • '\\' backslash escape */
  555. static size_t
  556. char_escape(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  557. {
  558. static const char *escape_chars = "\\`*_{}[]()#+-.!:|&<>^~";
  559. struct buf work = { 0, 0, 0, 0 };
  560. if (size > 1) {
  561. if (strchr(escape_chars, data[1]) == NULL)
  562. return 0;
  563. if (rndr->cb.normal_text) {
  564. work.data = data + 1;
  565. work.size = 1;
  566. rndr->cb.normal_text(ob, &work, rndr->opaque);
  567. }
  568. else bufputc(ob, data[1]);
  569. } else if (size == 1) {
  570. bufputc(ob, data[0]);
  571. }
  572. return 2;
  573. }
  574. /* char_entity • '&' escaped when it doesn't belong to an entity */
  575. /* valid entities are assumed to be anything matching &#?[A-Za-z0-9]+; */
  576. static size_t
  577. char_entity(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  578. {
  579. size_t end = 1;
  580. struct buf work = { 0, 0, 0, 0 };
  581. if (end < size && data[end] == '#')
  582. end++;
  583. while (end < size && isalnum(data[end]))
  584. end++;
  585. if (end < size && data[end] == ';')
  586. end++; /* real entity */
  587. else
  588. return 0; /* lone '&' */
  589. if (rndr->cb.entity) {
  590. work.data = data;
  591. work.size = end;
  592. rndr->cb.entity(ob, &work, rndr->opaque);
  593. }
  594. else bufput(ob, data, end);
  595. return end;
  596. }
  597. /* char_langle_tag • '<' when tags or autolinks are allowed */
  598. static size_t
  599. char_langle_tag(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  600. {
  601. enum mkd_autolink altype = MKDA_NOT_AUTOLINK;
  602. size_t end = tag_length(data, size, &altype);
  603. struct buf work = { data, end, 0, 0 };
  604. int ret = 0;
  605. if (end > 2) {
  606. if (rndr->cb.autolink && altype != MKDA_NOT_AUTOLINK) {
  607. struct buf *u_link = rndr_newbuf(rndr, BUFFER_SPAN);
  608. work.data = data + 1;
  609. work.size = end - 2;
  610. unscape_text(u_link, &work);
  611. ret = rndr->cb.autolink(ob, u_link, altype, rndr->opaque);
  612. rndr_popbuf(rndr, BUFFER_SPAN);
  613. }
  614. else if (rndr->cb.raw_html_tag)
  615. ret = rndr->cb.raw_html_tag(ob, &work, rndr->opaque);
  616. }
  617. if (!ret) return 0;
  618. else return end;
  619. }
  620. static size_t
  621. char_autolink_www(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  622. {
  623. struct buf *link, *link_url, *link_text;
  624. size_t link_len, rewind;
  625. if (!rndr->cb.link || rndr->in_link_body)
  626. return 0;
  627. link = rndr_newbuf(rndr, BUFFER_SPAN);
  628. if ((link_len = sd_autolink__www(&rewind, link, data, offset, size, 0)) > 0) {
  629. link_url = rndr_newbuf(rndr, BUFFER_SPAN);
  630. BUFPUTSL(link_url, "http://");
  631. bufput(link_url, link->data, link->size);
  632. ob->size -= rewind;
  633. if (rndr->cb.normal_text) {
  634. link_text = rndr_newbuf(rndr, BUFFER_SPAN);
  635. rndr->cb.normal_text(link_text, link, rndr->opaque);
  636. rndr->cb.link(ob, link_url, NULL, link_text, rndr->opaque);
  637. rndr_popbuf(rndr, BUFFER_SPAN);
  638. } else {
  639. rndr->cb.link(ob, link_url, NULL, link, rndr->opaque);
  640. }
  641. rndr_popbuf(rndr, BUFFER_SPAN);
  642. }
  643. rndr_popbuf(rndr, BUFFER_SPAN);
  644. return link_len;
  645. }
  646. static size_t
  647. char_autolink_email(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  648. {
  649. struct buf *link;
  650. size_t link_len, rewind;
  651. if (!rndr->cb.autolink || rndr->in_link_body)
  652. return 0;
  653. link = rndr_newbuf(rndr, BUFFER_SPAN);
  654. if ((link_len = sd_autolink__email(&rewind, link, data, offset, size, 0)) > 0) {
  655. ob->size -= rewind;
  656. rndr->cb.autolink(ob, link, MKDA_EMAIL, rndr->opaque);
  657. }
  658. rndr_popbuf(rndr, BUFFER_SPAN);
  659. return link_len;
  660. }
  661. static size_t
  662. char_autolink_url(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  663. {
  664. struct buf *link;
  665. size_t link_len, rewind;
  666. if (!rndr->cb.autolink || rndr->in_link_body)
  667. return 0;
  668. link = rndr_newbuf(rndr, BUFFER_SPAN);
  669. if ((link_len = sd_autolink__url(&rewind, link, data, offset, size, 0)) > 0) {
  670. ob->size -= rewind;
  671. rndr->cb.autolink(ob, link, MKDA_NORMAL, rndr->opaque);
  672. }
  673. rndr_popbuf(rndr, BUFFER_SPAN);
  674. return link_len;
  675. }
  676. /* char_link • '[': parsing a link or an image */
  677. static size_t
  678. char_link(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  679. {
  680. int is_img = (offset && data[-1] == '!'), level;
  681. size_t i = 1, txt_e, link_b = 0, link_e = 0, title_b = 0, title_e = 0;
  682. struct buf *content = 0;
  683. struct buf *link = 0;
  684. struct buf *title = 0;
  685. struct buf *u_link = 0;
  686. size_t org_work_size = rndr->work_bufs[BUFFER_SPAN].size;
  687. int text_has_nl = 0, ret = 0;
  688. int in_title = 0, qtype = 0;
  689. /* checking whether the correct renderer exists */
  690. if ((is_img && !rndr->cb.image) || (!is_img && !rndr->cb.link))
  691. goto cleanup;
  692. /* looking for the matching closing bracket */
  693. for (level = 1; i < size; i++) {
  694. if (data[i] == '\n')
  695. text_has_nl = 1;
  696. else if (data[i - 1] == '\\')
  697. continue;
  698. else if (data[i] == '[')
  699. level++;
  700. else if (data[i] == ']') {
  701. level--;
  702. if (level <= 0)
  703. break;
  704. }
  705. }
  706. if (i >= size)
  707. goto cleanup;
  708. txt_e = i;
  709. i++;
  710. /* skip any amount of whitespace or newline */
  711. /* (this is much more laxist than original markdown syntax) */
  712. while (i < size && _isspace(data[i]))
  713. i++;
  714. /* inline style link */
  715. if (i < size && data[i] == '(') {
  716. /* skipping initial whitespace */
  717. i++;
  718. while (i < size && _isspace(data[i]))
  719. i++;
  720. link_b = i;
  721. /* looking for link end: ' " ) */
  722. while (i < size) {
  723. if (data[i] == '\\') i += 2;
  724. else if (data[i] == ')') break;
  725. else if (i >= 1 && _isspace(data[i-1]) && (data[i] == '\'' || data[i] == '"')) break;
  726. else i++;
  727. }
  728. if (i >= size) goto cleanup;
  729. link_e = i;
  730. /* looking for title end if present */
  731. if (data[i] == '\'' || data[i] == '"') {
  732. qtype = data[i];
  733. in_title = 1;
  734. i++;
  735. title_b = i;
  736. while (i < size) {
  737. if (data[i] == '\\') i += 2;
  738. else if (data[i] == qtype) {in_title = 0; i++;}
  739. else if ((data[i] == ')') && !in_title) break;
  740. else i++;
  741. }
  742. if (i >= size) goto cleanup;
  743. /* skipping whitespaces after title */
  744. title_e = i - 1;
  745. while (title_e > title_b && _isspace(data[title_e]))
  746. title_e--;
  747. /* checking for closing quote presence */
  748. if (data[title_e] != '\'' && data[title_e] != '"') {
  749. title_b = title_e = 0;
  750. link_e = i;
  751. }
  752. }
  753. /* remove whitespace at the end of the link */
  754. while (link_e > link_b && _isspace(data[link_e - 1]))
  755. link_e--;
  756. /* remove optional angle brackets around the link */
  757. if (data[link_b] == '<') link_b++;
  758. if (data[link_e - 1] == '>') link_e--;
  759. /* building escaped link and title */
  760. if (link_e > link_b) {
  761. link = rndr_newbuf(rndr, BUFFER_SPAN);
  762. bufput(link, data + link_b, link_e - link_b);
  763. }
  764. if (title_e > title_b) {
  765. title = rndr_newbuf(rndr, BUFFER_SPAN);
  766. bufput(title, data + title_b, title_e - title_b);
  767. }
  768. i++;
  769. }
  770. /* reference style link */
  771. else if (i < size && data[i] == '[') {
  772. struct buf id = { 0, 0, 0, 0 };
  773. struct link_ref *lr;
  774. /* looking for the id */
  775. i++;
  776. link_b = i;
  777. while (i < size && data[i] != ']') i++;
  778. if (i >= size) goto cleanup;
  779. link_e = i;
  780. /* finding the link_ref */
  781. if (link_b == link_e) {
  782. if (text_has_nl) {
  783. struct buf *b = rndr_newbuf(rndr, BUFFER_SPAN);
  784. size_t j;
  785. for (j = 1; j < txt_e; j++) {
  786. if (data[j] != '\n')
  787. bufputc(b, data[j]);
  788. else if (data[j - 1] != ' ')
  789. bufputc(b, ' ');
  790. }
  791. id.data = b->data;
  792. id.size = b->size;
  793. } else {
  794. id.data = data + 1;
  795. id.size = txt_e - 1;
  796. }
  797. } else {
  798. id.data = data + link_b;
  799. id.size = link_e - link_b;
  800. }
  801. lr = find_link_ref(rndr->refs, id.data, id.size);
  802. if (!lr)
  803. goto cleanup;
  804. /* keeping link and title from link_ref */
  805. link = lr->link;
  806. title = lr->title;
  807. i++;
  808. }
  809. /* shortcut reference style link */
  810. else {
  811. struct buf id = { 0, 0, 0, 0 };
  812. struct link_ref *lr;
  813. /* crafting the id */
  814. if (text_has_nl) {
  815. struct buf *b = rndr_newbuf(rndr, BUFFER_SPAN);
  816. size_t j;
  817. for (j = 1; j < txt_e; j++) {
  818. if (data[j] != '\n')
  819. bufputc(b, data[j]);
  820. else if (data[j - 1] != ' ')
  821. bufputc(b, ' ');
  822. }
  823. id.data = b->data;
  824. id.size = b->size;
  825. } else {
  826. id.data = data + 1;
  827. id.size = txt_e - 1;
  828. }
  829. /* finding the link_ref */
  830. lr = find_link_ref(rndr->refs, id.data, id.size);
  831. if (!lr)
  832. goto cleanup;
  833. /* keeping link and title from link_ref */
  834. link = lr->link;
  835. title = lr->title;
  836. /* rewinding the whitespace */
  837. i = txt_e + 1;
  838. }
  839. /* building content: img alt is escaped, link content is parsed */
  840. if (txt_e > 1) {
  841. content = rndr_newbuf(rndr, BUFFER_SPAN);
  842. if (is_img) {
  843. bufput(content, data + 1, txt_e - 1);
  844. } else {
  845. /* disable autolinking when parsing inline the
  846. * content of a link */
  847. rndr->in_link_body = 1;
  848. parse_inline(content, rndr, data + 1, txt_e - 1);
  849. rndr->in_link_body = 0;
  850. }
  851. }
  852. if (link) {
  853. u_link = rndr_newbuf(rndr, BUFFER_SPAN);
  854. unscape_text(u_link, link);
  855. }
  856. /* calling the relevant rendering function */
  857. if (is_img) {
  858. if (ob->size && ob->data[ob->size - 1] == '!')
  859. ob->size -= 1;
  860. ret = rndr->cb.image(ob, u_link, title, content, rndr->opaque);
  861. } else {
  862. ret = rndr->cb.link(ob, u_link, title, content, rndr->opaque);
  863. }
  864. /* cleanup */
  865. cleanup:
  866. rndr->work_bufs[BUFFER_SPAN].size = (int)org_work_size;
  867. return ret ? i : 0;
  868. }
  869. static size_t
  870. char_superscript(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
  871. {
  872. size_t sup_start, sup_len;
  873. struct buf *sup;
  874. if (!rndr->cb.superscript)
  875. return 0;
  876. if (size < 2)
  877. return 0;
  878. if (data[1] == '(') {
  879. sup_start = sup_len = 2;
  880. while (sup_len < size && data[sup_len] != ')' && data[sup_len - 1] != '\\')
  881. sup_len++;
  882. if (sup_len == size)
  883. return 0;
  884. } else {
  885. sup_start = sup_len = 1;
  886. while (sup_len < size && !_isspace(data[sup_len]))
  887. sup_len++;
  888. }
  889. if (sup_len - sup_start == 0)
  890. return (sup_start == 2) ? 3 : 0;
  891. sup = rndr_newbuf(rndr, BUFFER_SPAN);
  892. parse_inline(sup, rndr, data + sup_start, sup_len - sup_start);
  893. rndr->cb.superscript(ob, sup, rndr->opaque);
  894. rndr_popbuf(rndr, BUFFER_SPAN);
  895. return (sup_start == 2) ? sup_len + 1 : sup_len;
  896. }
  897. /*********************************
  898. * BLOCK-LEVEL PARSING FUNCTIONS *
  899. *********************************/
  900. /* is_empty • returns the line length when it is empty, 0 otherwise */
  901. static size_t
  902. is_empty(uint8_t *data, size_t size)
  903. {
  904. size_t i;
  905. for (i = 0; i < size && data[i] != '\n'; i++)
  906. if (data[i] != ' ')
  907. return 0;
  908. return i + 1;
  909. }
  910. /* is_hrule • returns whether a line is a horizontal rule */
  911. static int
  912. is_hrule(uint8_t *data, size_t size)
  913. {
  914. size_t i = 0, n = 0;
  915. uint8_t c;
  916. /* skipping initial spaces */
  917. if (size < 3) return 0;
  918. if (data[0] == ' ') { i++;
  919. if (data[1] == ' ') { i++;
  920. if (data[2] == ' ') { i++; } } }
  921. /* looking at the hrule uint8_t */
  922. if (i + 2 >= size
  923. || (data[i] != '*' && data[i] != '-' && data[i] != '_'))
  924. return 0;
  925. c = data[i];
  926. /* the whole line must be the char or whitespace */
  927. while (i < size && data[i] != '\n') {
  928. if (data[i] == c) n++;
  929. else if (data[i] != ' ')
  930. return 0;
  931. i++;
  932. }
  933. return n >= 3;
  934. }
  935. /* check if a line begins with a code fence; return the
  936. * width of the code fence */
  937. static size_t
  938. prefix_codefence(uint8_t *data, size_t size)
  939. {
  940. size_t i = 0, n = 0;
  941. uint8_t c;
  942. /* skipping initial spaces */
  943. if (size < 3) return 0;
  944. if (data[0] == ' ') { i++;
  945. if (data[1] == ' ') { i++;
  946. if (data[2] == ' ') { i++; } } }
  947. /* looking at the hrule uint8_t */
  948. if (i + 2 >= size || !(data[i] == '~' || data[i] == '`'))
  949. return 0;
  950. c = data[i];
  951. /* the whole line must be the uint8_t or whitespace */
  952. while (i < size && data[i] == c) {
  953. n++; i++;
  954. }
  955. if (n < 3)
  956. return 0;
  957. return i;
  958. }
  959. /* check if a line is a code fence; return its size if it is */
  960. static size_t
  961. is_codefence(uint8_t *data, size_t size, struct buf *syntax)
  962. {
  963. size_t i = 0, syn_len = 0;
  964. uint8_t *syn_start;
  965. i = prefix_codefence(data, size);
  966. if (i == 0)
  967. return 0;
  968. while (i < size && data[i] == ' ')
  969. i++;
  970. syn_start = data + i;
  971. if (i < size && data[i] == '{') {
  972. i++; syn_start++;
  973. while (i < size && data[i] != '}' && data[i] != '\n') {
  974. syn_len++; i++;
  975. }
  976. if (i == size || data[i] != '}')
  977. return 0;
  978. /* strip all whitespace at the beginning and the end
  979. * of the {} block */
  980. while (syn_len > 0 && _isspace(syn_start[0])) {
  981. syn_start++; syn_len--;
  982. }
  983. while (syn_len > 0 && _isspace(syn_start[syn_len - 1]))
  984. syn_len--;
  985. i++;
  986. } else {
  987. while (i < size && !_isspace(data[i])) {
  988. syn_len++; i++;
  989. }
  990. }
  991. if (syntax) {
  992. syntax->data = syn_start;
  993. syntax->size = syn_len;
  994. }
  995. while (i < size && data[i] != '\n') {
  996. if (!_isspace(data[i]))
  997. return 0;
  998. i++;
  999. }
  1000. return i + 1;
  1001. }
  1002. /* is_atxheader • returns whether the line is a hash-prefixed header */
  1003. static int
  1004. is_atxheader(struct sd_markdown *rndr, uint8_t *data, size_t size)
  1005. {
  1006. if (data[0] != '#')
  1007. return 0;
  1008. if (rndr->ext_flags & MKDEXT_SPACE_HEADERS) {
  1009. size_t level = 0;
  1010. while (level < size && level < 6 && data[level] == '#')
  1011. level++;
  1012. if (level < size && data[level] != ' ')
  1013. return 0;
  1014. }
  1015. return 1;
  1016. }
  1017. /* is_headerline • returns whether the line is a setext-style hdr underline */
  1018. static int
  1019. is_headerline(uint8_t *data, size_t size)
  1020. {
  1021. size_t i = 0;
  1022. /* test of level 1 header */
  1023. if (data[i] == '=') {
  1024. for (i = 1; i < size && data[i] == '='; i++);
  1025. while (i < size && data[i] == ' ') i++;
  1026. return (i >= size || data[i] == '\n') ? 1 : 0; }
  1027. /* test of level 2 header */
  1028. if (data[i] == '-') {
  1029. for (i = 1; i < size && data[i] == '-'; i++);
  1030. while (i < size && data[i] == ' ') i++;
  1031. return (i >= size || data[i] == '\n') ? 2 : 0; }
  1032. return 0;
  1033. }
  1034. static int
  1035. is_next_headerline(uint8_t *data, size_t size)
  1036. {
  1037. size_t i = 0;
  1038. while (i < size && data[i] != '\n')
  1039. i++;
  1040. if (++i >= size)
  1041. return 0;
  1042. return is_headerline(data + i, size - i);
  1043. }
  1044. /* prefix_quote • returns blockquote prefix length */
  1045. static size_t
  1046. prefix_quote(uint8_t *data, size_t size)
  1047. {
  1048. size_t i = 0;
  1049. if (i < size && data[i] == ' ') i++;
  1050. if (i < size && data[i] == ' ') i++;
  1051. if (i < size && data[i] == ' ') i++;
  1052. if (i < size && data[i] == '>') {
  1053. if (i + 1 < size && data[i + 1] == ' ')
  1054. return i + 2;
  1055. return i + 1;
  1056. }
  1057. return 0;
  1058. }
  1059. /* prefix_code • returns prefix length for block code*/
  1060. static size_t
  1061. prefix_code(uint8_t *data, size_t size)
  1062. {
  1063. if (size > 3 && data[0] == ' ' && data[1] == ' '
  1064. && data[2] == ' ' && data[3] == ' ') return 4;
  1065. return 0;
  1066. }
  1067. /* prefix_oli • returns ordered list item prefix */
  1068. static size_t
  1069. prefix_oli(uint8_t *data, size_t size)
  1070. {
  1071. size_t i = 0;
  1072. if (i < size && data[i] == ' ') i++;
  1073. if (i < size && data[i] == ' ') i++;
  1074. if (i < size && data[i] == ' ') i++;
  1075. if (i >= size || data[i] < '0' || data[i] > '9')
  1076. return 0;
  1077. while (i < size && data[i] >= '0' && data[i] <= '9')
  1078. i++;
  1079. if (i + 1 >= size || data[i] != '.' || data[i + 1] != ' ')
  1080. return 0;
  1081. if (is_next_headerline(data + i, size - i))
  1082. return 0;
  1083. return i + 2;
  1084. }
  1085. /* prefix_uli • returns ordered list item prefix */
  1086. static size_t
  1087. prefix_uli(uint8_t *data, size_t size)
  1088. {
  1089. size_t i = 0;
  1090. if (i < size && data[i] == ' ') i++;
  1091. if (i < size && data[i] == ' ') i++;
  1092. if (i < size && data[i] == ' ') i++;
  1093. if (i + 1 >= size ||
  1094. (data[i] != '*' && data[i] != '+' && data[i] != '-') ||
  1095. data[i + 1] != ' ')
  1096. return 0;
  1097. if (is_next_headerline(data + i, size - i))
  1098. return 0;
  1099. return i + 2;
  1100. }
  1101. /* parse_block • parsing of one block, returning next uint8_t to parse */
  1102. static void parse_block(struct buf *ob, struct sd_markdown *rndr,
  1103. uint8_t *data, size_t size);
  1104. /* parse_blockquote • handles parsing of a blockquote fragment */
  1105. static size_t
  1106. parse_blockquote(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  1107. {
  1108. size_t beg, end = 0, pre, work_size = 0;
  1109. uint8_t *work_data = 0;
  1110. struct buf *out = 0;
  1111. out = rndr_newbuf(rndr, BUFFER_BLOCK);
  1112. beg = 0;
  1113. while (beg < size) {
  1114. for (end = beg + 1; end < size && data[end - 1] != '\n'; end++);
  1115. pre = prefix_quote(data + beg, end - beg);
  1116. if (pre)
  1117. beg += pre; /* skipping prefix */
  1118. /* empty line followed by non-quote line */
  1119. else if (is_empty(data + beg, end - beg) &&
  1120. (end >= size || (prefix_quote(data + end, size - end) == 0 &&
  1121. !is_empty(data + end, size - end))))
  1122. break;
  1123. if (beg < end) { /* copy into the in-place working buffer */
  1124. /* bufput(work, data + beg, end - beg); */
  1125. if (!work_data)
  1126. work_data = data + beg;
  1127. else if (data + beg != work_data + work_size)
  1128. memmove(work_data + work_size, data + beg, end - beg);
  1129. work_size += end - beg;
  1130. }
  1131. beg = end;
  1132. }
  1133. parse_block(out, rndr, work_data, work_size);
  1134. if (rndr->cb.blockquote)
  1135. rndr->cb.blockquote(ob, out, rndr->opaque);
  1136. rndr_popbuf(rndr, BUFFER_BLOCK);
  1137. return end;
  1138. }
  1139. static size_t
  1140. parse_htmlblock(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int do_render);
  1141. /* parse_blockquote • handles parsing of a regular paragraph */
  1142. static size_t
  1143. parse_paragraph(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  1144. {
  1145. size_t i = 0, end = 0;
  1146. int level = 0;
  1147. struct buf work = { data, 0, 0, 0 };
  1148. while (i < size) {
  1149. for (end = i + 1; end < size && data[end - 1] != '\n'; end++) /* empty */;
  1150. if (is_empty(data + i, size - i))
  1151. break;
  1152. if ((level = is_headerline(data + i, size - i)) != 0)
  1153. break;
  1154. if (is_atxheader(rndr, data + i, size - i) ||
  1155. is_hrule(data + i, size - i) ||
  1156. prefix_quote(data + i, size - i)) {
  1157. end = i;
  1158. break;
  1159. }
  1160. /*
  1161. * Early termination of a paragraph with the same logic
  1162. * as Markdown 1.0.0. If this logic is applied, the
  1163. * Markdown 1.0.3 test suite won't pass cleanly
  1164. *
  1165. * :: If the first character in a new line is not a letter,
  1166. * let's check to see if there's some kind of block starting
  1167. * here
  1168. */
  1169. if ((rndr->ext_flags & MKDEXT_LAX_SPACING) && !isalnum(data[i])) {
  1170. if (prefix_oli(data + i, size - i) ||
  1171. prefix_uli(data + i, size - i)) {
  1172. end = i;
  1173. break;
  1174. }
  1175. /* see if an html block starts here */
  1176. if (data[i] == '<' && rndr->cb.blockhtml &&
  1177. parse_htmlblock(ob, rndr, data + i, size - i, 0)) {
  1178. end = i;
  1179. break;
  1180. }
  1181. /* see if a code fence starts here */
  1182. if ((rndr->ext_flags & MKDEXT_FENCED_CODE) != 0 &&
  1183. is_codefence(data + i, size - i, NULL) != 0) {
  1184. end = i;
  1185. break;
  1186. }
  1187. }
  1188. i = end;
  1189. }
  1190. work.size = i;
  1191. while (work.size && data[work.size - 1] == '\n')
  1192. work.size--;
  1193. if (!level) {
  1194. struct buf *tmp = rndr_newbuf(rndr, BUFFER_BLOCK);
  1195. parse_inline(tmp, rndr, work.data, work.size);
  1196. if (rndr->cb.paragraph)
  1197. rndr->cb.paragraph(ob, tmp, rndr->opaque);
  1198. rndr_popbuf(rndr, BUFFER_BLOCK);
  1199. } else {
  1200. struct buf *header_work;
  1201. if (work.size) {
  1202. size_t beg;
  1203. i = work.size;
  1204. work.size -= 1;
  1205. while (work.size && data[work.size] != '\n')
  1206. work.size -= 1;
  1207. beg = work.size + 1;
  1208. while (work.size && data[work.size - 1] == '\n')
  1209. work.size -= 1;
  1210. if (work.size > 0) {
  1211. struct buf *tmp = rndr_newbuf(rndr, BUFFER_BLOCK);
  1212. parse_inline(tmp, rndr, work.data, work.size);
  1213. if (rndr->cb.paragraph)
  1214. rndr->cb.paragraph(ob, tmp, rndr->opaque);
  1215. rndr_popbuf(rndr, BUFFER_BLOCK);
  1216. work.data += beg;
  1217. work.size = i - beg;
  1218. }
  1219. else work.size = i;
  1220. }
  1221. header_work = rndr_newbuf(rndr, BUFFER_SPAN);
  1222. parse_inline(header_work, rndr, work.data, work.size);
  1223. if (rndr->cb.header)
  1224. rndr->cb.header(ob, header_work, (int)level, rndr->opaque);
  1225. rndr_popbuf(rndr, BUFFER_SPAN);
  1226. }
  1227. return end;
  1228. }
  1229. /* parse_fencedcode • handles parsing of a block-level code fragment */
  1230. static size_t
  1231. parse_fencedcode(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  1232. {
  1233. size_t beg, end;
  1234. struct buf *work = 0;
  1235. struct buf lang = { 0, 0, 0, 0 };
  1236. beg = is_codefence(data, size, &lang);
  1237. if (beg == 0) return 0;
  1238. work = rndr_newbuf(rndr, BUFFER_BLOCK);
  1239. while (beg < size) {
  1240. size_t fence_end;
  1241. struct buf fence_trail = { 0, 0, 0, 0 };
  1242. fence_end = is_codefence(data + beg, size - beg, &fence_trail);
  1243. if (fence_end != 0 && fence_trail.size == 0) {
  1244. beg += fence_end;
  1245. break;
  1246. }
  1247. for (end = beg + 1; end < size && data[end - 1] != '\n'; end++);
  1248. if (beg < end) {
  1249. /* verbatim copy to the working buffer,
  1250. escaping entities */
  1251. if (is_empty(data + beg, end - beg))
  1252. bufputc(work, '\n');
  1253. else bufput(work, data + beg, end - beg);
  1254. }
  1255. beg = end;
  1256. }
  1257. if (work->size && work->data[work->size - 1] != '\n')
  1258. bufputc(work, '\n');
  1259. if (rndr->cb.blockcode)
  1260. rndr->cb.blockcode(ob, work, lang.size ? &lang : NULL, rndr->opaque);
  1261. rndr_popbuf(rndr, BUFFER_BLOCK);
  1262. return beg;
  1263. }
  1264. static size_t
  1265. parse_blockcode(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  1266. {
  1267. size_t beg, end, pre;
  1268. struct buf *work = 0;
  1269. work = rndr_newbuf(rndr, BUFFER_BLOCK);
  1270. beg = 0;
  1271. while (beg < size) {
  1272. for (end = beg + 1; end < size && data[end - 1] != '\n'; end++) {};
  1273. pre = prefix_code(data + beg, end - beg);
  1274. if (pre)
  1275. beg += pre; /* skipping prefix */
  1276. else if (!is_empty(data + beg, end - beg))
  1277. /* non-empty non-prefixed line breaks the pre */
  1278. break;
  1279. if (beg < end) {
  1280. /* verbatim copy to the working buffer,
  1281. escaping entities */
  1282. if (is_empty(data + beg, end - beg))
  1283. bufputc(work, '\n');
  1284. else bufput(work, data + beg, end - beg);
  1285. }
  1286. beg = end;
  1287. }
  1288. while (work->size && work->data[work->size - 1] == '\n')
  1289. work->size -= 1;
  1290. bufputc(work, '\n');
  1291. if (rndr->cb.blockcode)
  1292. rndr->cb.blockcode(ob, work, NULL, rndr->opaque);
  1293. rndr_popbuf(rndr, BUFFER_BLOCK);
  1294. return beg;
  1295. }
  1296. /* parse_listitem • parsing of a single list item */
  1297. /* assuming initial prefix is already removed */
  1298. static size_t
  1299. parse_listitem(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int *flags)
  1300. {
  1301. struct buf *work = 0, *inter = 0;
  1302. size_t beg = 0, end, pre, sublist = 0, orgpre = 0, i;
  1303. int in_empty = 0, has_inside_empty = 0, in_fence = 0;
  1304. /* keeping track of the first indentation prefix */
  1305. while (orgpre < 3 && orgpre < size && data[orgpre] == ' ')
  1306. orgpre++;
  1307. beg = prefix_uli(data, size);
  1308. if (!beg)
  1309. beg = prefix_oli(data, size);
  1310. if (!beg)
  1311. return 0;
  1312. /* skipping to the beginning of the following line */
  1313. end = beg;
  1314. while (end < size && data[end - 1] != '\n')
  1315. end++;
  1316. /* getting working buffers */
  1317. work = rndr_newbuf(rndr, BUFFER_SPAN);
  1318. inter = rndr_newbuf(rndr, BUFFER_SPAN);
  1319. /* putting the first line into the working buffer */
  1320. bufput(work, data + beg, end - beg);
  1321. beg = end;
  1322. /* process the following lines */
  1323. while (beg < size) {
  1324. size_t has_next_uli = 0, has_next_oli = 0;
  1325. end++;
  1326. while (end < size && data[end - 1] != '\n')
  1327. end++;
  1328. /* process an empty line */
  1329. if (is_empty(data + beg, end - beg)) {
  1330. in_empty = 1;
  1331. beg = end;
  1332. continue;
  1333. }
  1334. /* calculating the indentation */
  1335. i = 0;
  1336. while (i < 4 && beg + i < end && data[beg + i] == ' ')
  1337. i++;
  1338. pre = i;
  1339. if (rndr->ext_flags & MKDEXT_FENCED_CODE) {
  1340. if (is_codefence(data + beg + i, end - beg - i, NULL) != 0)
  1341. in_fence = !in_fence;
  1342. }
  1343. /* Only check for new list items if we are **not** inside
  1344. * a fenced code block */
  1345. if (!in_fence) {
  1346. has_next_uli = prefix_uli(data + beg + i, end - beg - i);
  1347. has_next_oli = prefix_oli(data + beg + i, end - beg - i);
  1348. }
  1349. /* checking for ul/ol switch */
  1350. if (in_empty && (
  1351. ((*flags & MKD_LIST_ORDERED) && has_next_uli) ||
  1352. (!(*flags & MKD_LIST_ORDERED) && has_next_oli))){
  1353. *flags |= MKD_LI_END;
  1354. break; /* the following item must have same list type */
  1355. }
  1356. /* checking for a new item */
  1357. if ((has_next_uli && !is_hrule(data + beg + i, end - beg - i)) || has_next_oli) {
  1358. if (in_empty)
  1359. has_inside_empty = 1;
  1360. if (pre == orgpre) /* the following item must have */
  1361. break; /* the same indentation */
  1362. if (!sublist)
  1363. sublist = work->size;
  1364. }
  1365. /* joining only indented stuff after empty lines;
  1366. * note that now we only require 1 space of indentation
  1367. * to continue a list */
  1368. else if (in_empty && pre == 0) {
  1369. *flags |= MKD_LI_END;
  1370. break;
  1371. }
  1372. else if (in_empty) {
  1373. bufputc(work, '\n');
  1374. has_inside_empty = 1;
  1375. }
  1376. in_empty = 0;
  1377. /* adding the line without prefix into the working buffer */
  1378. bufput(work, data + beg + i, end - beg - i);
  1379. beg = end;
  1380. }
  1381. /* render of li contents */
  1382. if (has_inside_empty)
  1383. *flags |= MKD_LI_BLOCK;
  1384. if (*flags & MKD_LI_BLOCK) {
  1385. /* intermediate render of block li */
  1386. if (sublist && sublist < work->size) {
  1387. parse_block(inter, rndr, work->data, sublist);
  1388. parse_block(inter, rndr, work->data + sublist, work->size - sublist);
  1389. }
  1390. else
  1391. parse_block(inter, rndr, work->data, work->size);
  1392. } else {
  1393. /* intermediate render of inline li */
  1394. if (sublist && sublist < work->size) {
  1395. parse_inline(inter, rndr, work->data, sublist);
  1396. parse_block(inter, rndr, work->data + sublist, work->size - sublist);
  1397. }
  1398. else
  1399. parse_inline(inter, rndr, work->data, work->size);
  1400. }
  1401. /* render of li itself */
  1402. if (rndr->cb.listitem)
  1403. rndr->cb.listitem(ob, inter, *flags, rndr->opaque);
  1404. rndr_popbuf(rndr, BUFFER_SPAN);
  1405. rndr_popbuf(rndr, BUFFER_SPAN);
  1406. return beg;
  1407. }
  1408. /* parse_list • parsing ordered or unordered list block */
  1409. static size_t
  1410. parse_list(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int flags)
  1411. {
  1412. struct buf *work = 0;
  1413. size_t i = 0, j;
  1414. work = rndr_newbuf(rndr, BUFFER_BLOCK);
  1415. while (i < size) {
  1416. j = parse_listitem(work, rndr, data + i, size - i, &flags);
  1417. i += j;
  1418. if (!j || (flags & MKD_LI_END))
  1419. break;
  1420. }
  1421. if (rndr->cb.list)
  1422. rndr->cb.list(ob, work, flags, rndr->opaque);
  1423. rndr_popbuf(rndr, BUFFER_BLOCK);
  1424. return i;
  1425. }
  1426. /* parse_atxheader • parsing of atx-style headers */
  1427. static size_t
  1428. parse_atxheader(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  1429. {
  1430. size_t level = 0;
  1431. size_t i, end, skip;
  1432. while (level < size && level < 6 && data[level] == '#')
  1433. level++;
  1434. for (i = level; i < size && data[i] == ' '; i++);
  1435. for (end = i; end < size && data[end] != '\n'; end++);
  1436. skip = end;
  1437. while (end && data[end - 1] == '#')
  1438. end--;
  1439. while (end && data[end - 1] == ' ')
  1440. end--;
  1441. if (end > i) {
  1442. struct buf *work = rndr_newbuf(rndr, BUFFER_SPAN);
  1443. parse_inline(work, rndr, data + i, end - i);
  1444. if (rndr->cb.header)
  1445. rndr->cb.header(ob, work, (int)level, rndr->opaque);
  1446. rndr_popbuf(rndr, BUFFER_SPAN);
  1447. }
  1448. return skip;
  1449. }
  1450. /* htmlblock_end • checking end of HTML block : </tag>[ \t]*\n[ \t*]\n */
  1451. /* returns the length on match, 0 otherwise */
  1452. static size_t
  1453. htmlblock_end_tag(
  1454. const char *tag,
  1455. size_t tag_len,
  1456. struct sd_markdown *rndr,
  1457. uint8_t *data,
  1458. size_t size)
  1459. {
  1460. size_t i, w;
  1461. /* checking if tag is a match */
  1462. if (tag_len + 3 >= size ||
  1463. strncasecmp((char *)data + 2, tag, tag_len) != 0 ||
  1464. data[tag_len + 2] != '>')
  1465. return 0;
  1466. /* checking white lines */
  1467. i = tag_len + 3;
  1468. w = 0;
  1469. if (i < size && (w = is_empty(data + i, size - i)) == 0)
  1470. return 0; /* non-blank after tag */
  1471. i += w;
  1472. w = 0;
  1473. if (i < size)
  1474. w = is_empty(data + i, size - i);
  1475. return i + w;
  1476. }
  1477. static size_t
  1478. htmlblock_end(const char *curtag,
  1479. struct sd_markdown *rndr,
  1480. uint8_t *data,
  1481. size_t size,
  1482. int start_of_line)
  1483. {
  1484. size_t tag_size = strlen(curtag);
  1485. size_t i = 1, end_tag;
  1486. int block_lines = 0;
  1487. while (i < size) {
  1488. i++;
  1489. while (i < size && !(data[i - 1] == '<' && data[i] == '/')) {
  1490. if (data[i] == '\n')
  1491. block_lines++;
  1492. i++;
  1493. }
  1494. /* If we are only looking for unindented tags, skip the tag
  1495. * if it doesn't follow a newline.
  1496. *
  1497. * The only exception to this is if the tag is still on the
  1498. * initial line; in that case it still counts as a closing
  1499. * tag
  1500. */
  1501. if (start_of_line && block_lines > 0 && data[i - 2] != '\n')
  1502. continue;
  1503. if (i + 2 + tag_size >= size)
  1504. break;
  1505. end_tag = htmlblock_end_tag(curtag, tag_size, rndr, data + i - 1, size - i + 1);
  1506. if (end_tag)
  1507. return i + end_tag - 1;
  1508. }
  1509. return 0;
  1510. }
  1511. /* parse_htmlblock • parsing of inline HTML block */
  1512. static size_t
  1513. parse_htmlblock(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int do_render)
  1514. {
  1515. size_t i, j = 0, tag_end;
  1516. const char *curtag = NULL;
  1517. struct buf work = { data, 0, 0, 0 };
  1518. /* identification of the opening tag */
  1519. if (size < 2 || data[0] != '<')
  1520. return 0;
  1521. i = 1;
  1522. while (i < size && data[i] != '>' && data[i] != ' ')
  1523. i++;
  1524. if (i < size)
  1525. curtag = find_block_tag((char *)data + 1, (int)i - 1);
  1526. /* handling of special cases */
  1527. if (!curtag) {
  1528. /* HTML comment, laxist form */
  1529. if (size > 5 && data[1] == '!' && data[2] == '-' && data[3] == '-') {
  1530. i = 5;
  1531. while (i < size && !(data[i - 2] == '-' && data[i - 1] == '-' && data[i] == '>'))
  1532. i++;
  1533. i++;
  1534. if (i < size)
  1535. j = is_empty(data + i, size - i);
  1536. if (j) {
  1537. work.size = i + j;
  1538. if (do_render && rndr->cb.blockhtml)
  1539. rndr->cb.blockhtml(ob, &work, rndr->opaque);
  1540. return work.size;
  1541. }
  1542. }
  1543. /* HR, which is the only self-closing block tag considered */
  1544. if (size > 4 && (data[1] == 'h' || data[1] == 'H') && (data[2] == 'r' || data[2] == 'R')) {
  1545. i = 3;
  1546. while (i < size && data[i] != '>')
  1547. i++;
  1548. if (i + 1 < size) {
  1549. i++;
  1550. j = is_empty(data + i, size - i);
  1551. if (j) {
  1552. work.size = i + j;
  1553. if (do_render && rndr->cb.blockhtml)
  1554. rndr->cb.blockhtml(ob, &work, rndr->opaque);
  1555. return work.size;
  1556. }
  1557. }
  1558. }
  1559. /* no special case recognised */
  1560. return 0;
  1561. }
  1562. /* looking for an unindented matching closing tag */
  1563. /* followed by a blank line */
  1564. tag_end = htmlblock_end(curtag, rndr, data, size, 1);
  1565. /* if not found, trying a second pass looking for indented match */
  1566. /* but not if tag is "ins" or "del" (following original Markdown.pl) */
  1567. if (!tag_end && strcmp(curtag, "ins") != 0 && strcmp(curtag, "del") != 0) {
  1568. tag_end = htmlblock_end(curtag, rndr, data, size, 0);
  1569. }
  1570. if (!tag_end)
  1571. return 0;
  1572. /* the end of the block has been found */
  1573. work.size = tag_end;
  1574. if (do_render && rndr->cb.blockhtml)
  1575. rndr->cb.blockhtml(ob, &work, rndr->opaque);
  1576. return tag_end;
  1577. }
  1578. static void
  1579. parse_table_row(
  1580. struct buf *ob,
  1581. struct sd_markdown *rndr,
  1582. uint8_t *data,
  1583. size_t size,
  1584. size_t columns,
  1585. int *col_data,
  1586. int header_flag)
  1587. {
  1588. size_t i = 0, col;
  1589. struct buf *row_work = 0;
  1590. if (!rndr->cb.table_cell || !rndr->cb.table_row)
  1591. return;
  1592. row_work = rndr_newbuf(rndr, BUFFER_SPAN);
  1593. if (i < size && data[i] == '|')
  1594. i++;
  1595. for (col = 0; col < columns && i < size; ++col) {
  1596. size_t cell_start, cell_end;
  1597. struct buf *cell_work;
  1598. cell_work = rndr_newbuf(rndr, BUFFER_SPAN);
  1599. while (i < size && _isspace(data[i]))
  1600. i++;
  1601. cell_start = i;
  1602. while (i < size && data[i] != '|')
  1603. i++;
  1604. cell_end = i - 1;
  1605. while (cell_end > cell_start && _isspace(data[cell_end]))
  1606. cell_end--;
  1607. parse_inline(cell_work, rndr, data + cell_start, 1 + cell_end - cell_start);
  1608. rndr->cb.table_cell(row_work, cell_work, col_data[col] | header_flag, rndr->opaque);
  1609. rndr_popbuf(rndr, BUFFER_SPAN);
  1610. i++;
  1611. }
  1612. for (; col < columns; ++col) {
  1613. struct buf empty_cell = { 0, 0, 0, 0 };
  1614. rndr->cb.table_cell(row_work, &empty_cell, col_data[col] | header_flag, rndr->opaque);
  1615. }
  1616. rndr->cb.table_row(ob, row_work, rndr->opaque);
  1617. rndr_popbuf(rndr, BUFFER_SPAN);
  1618. }
  1619. static size_t
  1620. parse_table_header(
  1621. struct buf *ob,
  1622. struct sd_markdown *rndr,
  1623. uint8_t *data,
  1624. size_t size,
  1625. size_t *columns,
  1626. int **column_data)
  1627. {
  1628. int pipes;
  1629. size_t i = 0, col, header_end, under_end;
  1630. pipes = 0;
  1631. while (i < size && data[i] != '\n')
  1632. if (data[i++] == '|')
  1633. pipes++;
  1634. if (i == size || pipes == 0)
  1635. return 0;
  1636. header_end = i;
  1637. while (header_end > 0 && _isspace(data[header_end - 1]))
  1638. header_end--;
  1639. if (data[0] == '|')
  1640. pipes--;
  1641. if (header_end && data[header_end - 1] == '|')
  1642. pipes--;
  1643. *columns = pipes + 1;
  1644. *column_data = calloc(*columns, sizeof(int));
  1645. /* Parse the header underline */
  1646. i++;
  1647. if (i < size && data[i] == '|')
  1648. i++;
  1649. under_end = i;
  1650. while (under_end < size && data[under_end] != '\n')
  1651. under_end++;
  1652. for (col = 0; col < *columns && i < under_end; ++col) {
  1653. size_t dashes = 0;
  1654. while (i < under_end && data[i] == ' ')
  1655. i++;
  1656. if (data[i] == ':') {
  1657. i++; (*column_data)[col] |= MKD_TABLE_ALIGN_L;
  1658. dashes++;
  1659. }
  1660. while (i < under_end && data[i] == '-') {
  1661. i++; dashes++;
  1662. }
  1663. if (i < under_end && data[i] == ':') {
  1664. i++; (*column_data)[col] |= MKD_TABLE_ALIGN_R;
  1665. dashes++;
  1666. }
  1667. while (i < under_end && data[i] == ' ')
  1668. i++;
  1669. if (i < under_end && data[i] != '|')
  1670. break;
  1671. if (dashes < 3)
  1672. break;
  1673. i++;
  1674. }
  1675. if (col < *columns)
  1676. return 0;
  1677. parse_table_row(
  1678. ob, rndr, data,
  1679. header_end,
  1680. *columns,
  1681. *column_data,
  1682. MKD_TABLE_HEADER
  1683. );
  1684. return under_end + 1;
  1685. }
  1686. static size_t
  1687. parse_table(
  1688. struct buf *ob,
  1689. struct sd_markdown *rndr,
  1690. uint8_t *data,
  1691. size_t size)
  1692. {
  1693. size_t i;
  1694. struct buf *header_work = 0;
  1695. struct buf *body_work = 0;
  1696. size_t columns;
  1697. int *col_data = NULL;
  1698. header_work = rndr_newbuf(rndr, BUFFER_SPAN);
  1699. body_work = rndr_newbuf(rndr, BUFFER_BLOCK);
  1700. i = parse_table_header(header_work, rndr, data, size, &columns, &col_data);
  1701. if (i > 0) {
  1702. while (i < size) {
  1703. size_t row_start;
  1704. int pipes = 0;
  1705. row_start = i;
  1706. while (i < size && data[i] != '\n')
  1707. if (data[i++] == '|')
  1708. pipes++;
  1709. if (pipes == 0 || i == size) {
  1710. i = row_start;
  1711. break;
  1712. }
  1713. parse_table_row(
  1714. body_work,
  1715. rndr,
  1716. data + row_start,
  1717. i - row_start,
  1718. columns,
  1719. col_data, 0
  1720. );
  1721. i++;
  1722. }
  1723. if (rndr->cb.table)
  1724. rndr->cb.table(ob, header_work, body_work, rndr->opaque);
  1725. }
  1726. free(col_data);
  1727. rndr_popbuf(rndr, BUFFER_SPAN);
  1728. rndr_popbuf(rndr, BUFFER_BLOCK);
  1729. return i;
  1730. }
  1731. /* parse_block • parsing of one block, returning next uint8_t to parse */
  1732. static void
  1733. parse_block(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
  1734. {
  1735. size_t beg, end, i;
  1736. uint8_t *txt

Large files files are truncated, but you can click here to view the full file