redcarpet 1.0.0 → 2.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,2454 @@
1
+ /* markdown.c - generic markdown parser */
2
+
3
+ /*
4
+ * Copyright (c) 2009, Natacha Porté
5
+ * Copyright (c) 2011, Vicent Marti
6
+ *
7
+ * Permission to use, copy, modify, and distribute this software for any
8
+ * purpose with or without fee is hereby granted, provided that the above
9
+ * copyright notice and this permission notice appear in all copies.
10
+ *
11
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
12
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
13
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
14
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
15
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
16
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
17
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18
+ */
19
+
20
+ #include "markdown.h"
21
+ #include "stack.h"
22
+
23
+ #include <assert.h>
24
+ #include <string.h>
25
+ #include <ctype.h>
26
+ #include <stdio.h>
27
+
28
+ #define REF_TABLE_SIZE 8
29
+
30
+ #define BUFFER_BLOCK 0
31
+ #define BUFFER_SPAN 1
32
+
33
+ #define MKD_LI_END 8 /* internal list flag */
34
+
35
+ #define gperf_case_strncmp(s1, s2, n) strncasecmp(s1, s2, n)
36
+ #define GPERF_DOWNCASE 1
37
+ #define GPERF_CASE_STRNCMP 1
38
+ #include "html_blocks.h"
39
+
40
+ /***************
41
+ * LOCAL TYPES *
42
+ ***************/
43
+
44
+ /* link_ref: reference to a link */
45
+ struct link_ref {
46
+ unsigned int id;
47
+
48
+ struct buf *link;
49
+ struct buf *title;
50
+
51
+ struct link_ref *next;
52
+ };
53
+
54
+ /* char_trigger: function pointer to render active chars */
55
+ /* returns the number of chars taken care of */
56
+ /* data is the pointer of the beginning of the span */
57
+ /* offset is the number of valid chars before data */
58
+ struct sd_markdown;
59
+ typedef size_t
60
+ (*char_trigger)(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
61
+
62
+ static size_t char_emphasis(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
63
+ static size_t char_linebreak(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
64
+ static size_t char_codespan(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
65
+ static size_t char_escape(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
66
+ static size_t char_entity(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
67
+ static size_t char_langle_tag(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
68
+ static size_t char_autolink_url(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
69
+ static size_t char_autolink_email(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
70
+ static size_t char_autolink_www(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
71
+ static size_t char_link(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
72
+ static size_t char_superscript(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);
73
+
74
+ enum markdown_char_t {
75
+ MD_CHAR_NONE = 0,
76
+ MD_CHAR_EMPHASIS,
77
+ MD_CHAR_CODESPAN,
78
+ MD_CHAR_LINEBREAK,
79
+ MD_CHAR_LINK,
80
+ MD_CHAR_LANGLE,
81
+ MD_CHAR_ESCAPE,
82
+ MD_CHAR_ENTITITY,
83
+ MD_CHAR_AUTOLINK_URL,
84
+ MD_CHAR_AUTOLINK_EMAIL,
85
+ MD_CHAR_AUTOLINK_WWW,
86
+ MD_CHAR_SUPERSCRIPT,
87
+ };
88
+
89
+ static char_trigger markdown_char_ptrs[] = {
90
+ NULL,
91
+ &char_emphasis,
92
+ &char_codespan,
93
+ &char_linebreak,
94
+ &char_link,
95
+ &char_langle_tag,
96
+ &char_escape,
97
+ &char_entity,
98
+ &char_autolink_url,
99
+ &char_autolink_email,
100
+ &char_autolink_www,
101
+ &char_superscript,
102
+ };
103
+
104
+ /* render • structure containing one particular render */
105
+ struct sd_markdown {
106
+ struct sd_callbacks cb;
107
+ void *opaque;
108
+
109
+ struct link_ref *refs[REF_TABLE_SIZE];
110
+ uint8_t active_char[256];
111
+ struct stack work_bufs[2];
112
+ unsigned int ext_flags;
113
+ size_t max_nesting;
114
+ int in_link_body;
115
+ };
116
+
117
+ /***************************
118
+ * HELPER FUNCTIONS *
119
+ ***************************/
120
+
121
+ static inline struct buf *
122
+ rndr_newbuf(struct sd_markdown *rndr, int type)
123
+ {
124
+ static const size_t buf_size[2] = {256, 64};
125
+ struct buf *work = NULL;
126
+ struct stack *pool = &rndr->work_bufs[type];
127
+
128
+ if (pool->size < pool->asize &&
129
+ pool->item[pool->size] != NULL) {
130
+ work = pool->item[pool->size++];
131
+ work->size = 0;
132
+ } else {
133
+ work = bufnew(buf_size[type]);
134
+ stack_push(pool, work);
135
+ }
136
+
137
+ return work;
138
+ }
139
+
140
+ static inline void
141
+ rndr_popbuf(struct sd_markdown *rndr, int type)
142
+ {
143
+ rndr->work_bufs[type].size--;
144
+ }
145
+
146
+ static void
147
+ unscape_text(struct buf *ob, struct buf *src)
148
+ {
149
+ size_t i = 0, org;
150
+ while (i < src->size) {
151
+ org = i;
152
+ while (i < src->size && src->data[i] != '\\')
153
+ i++;
154
+
155
+ if (i > org)
156
+ bufput(ob, src->data + org, i - org);
157
+
158
+ if (i + 1 >= src->size)
159
+ break;
160
+
161
+ bufputc(ob, src->data[i + 1]);
162
+ i += 2;
163
+ }
164
+ }
165
+
166
+ static unsigned int
167
+ hash_link_ref(const uint8_t *link_ref, size_t length)
168
+ {
169
+ size_t i;
170
+ unsigned int hash = 0;
171
+
172
+ for (i = 0; i < length; ++i)
173
+ hash = tolower(link_ref[i]) + (hash << 6) + (hash << 16) - hash;
174
+
175
+ return hash;
176
+ }
177
+
178
+ static struct link_ref *
179
+ add_link_ref(
180
+ struct link_ref **references,
181
+ const uint8_t *name, size_t name_size)
182
+ {
183
+ struct link_ref *ref = calloc(1, sizeof(struct link_ref));
184
+
185
+ if (!ref)
186
+ return NULL;
187
+
188
+ ref->id = hash_link_ref(name, name_size);
189
+ ref->next = references[ref->id % REF_TABLE_SIZE];
190
+
191
+ references[ref->id % REF_TABLE_SIZE] = ref;
192
+ return ref;
193
+ }
194
+
195
+ static struct link_ref *
196
+ find_link_ref(struct link_ref **references, uint8_t *name, size_t length)
197
+ {
198
+ unsigned int hash = hash_link_ref(name, length);
199
+ struct link_ref *ref = NULL;
200
+
201
+ ref = references[hash % REF_TABLE_SIZE];
202
+
203
+ while (ref != NULL) {
204
+ if (ref->id == hash)
205
+ return ref;
206
+
207
+ ref = ref->next;
208
+ }
209
+
210
+ return NULL;
211
+ }
212
+
213
+ static void
214
+ free_link_refs(struct link_ref **references)
215
+ {
216
+ size_t i;
217
+
218
+ for (i = 0; i < REF_TABLE_SIZE; ++i) {
219
+ struct link_ref *r = references[i];
220
+ struct link_ref *next;
221
+
222
+ while (r) {
223
+ next = r->next;
224
+ bufrelease(r->link);
225
+ bufrelease(r->title);
226
+ free(r);
227
+ r = next;
228
+ }
229
+ }
230
+ }
231
+
232
+ /*
233
+ * Check whether a char is a Markdown space.
234
+
235
+ * Right now we only consider spaces the actual
236
+ * space and a newline: tabs and carriage returns
237
+ * are filtered out during the preprocessing phase.
238
+ *
239
+ * If we wanted to actually be UTF-8 compliant, we
240
+ * should instead extract an Unicode codepoint from
241
+ * this character and check for space properties.
242
+ */
243
+ static inline int
244
+ _isspace(int c)
245
+ {
246
+ return c == ' ' || c == '\n';
247
+ }
248
+
249
+ /****************************
250
+ * INLINE PARSING FUNCTIONS *
251
+ ****************************/
252
+
253
+ /* is_mail_autolink • looks for the address part of a mail autolink and '>' */
254
+ /* this is less strict than the original markdown e-mail address matching */
255
+ static size_t
256
+ is_mail_autolink(uint8_t *data, size_t size)
257
+ {
258
+ size_t i = 0, nb = 0;
259
+
260
+ /* address is assumed to be: [-@._a-zA-Z0-9]+ with exactly one '@' */
261
+ for (i = 0; i < size; ++i) {
262
+ if (isalnum(data[i]))
263
+ continue;
264
+
265
+ switch (data[i]) {
266
+ case '@':
267
+ nb++;
268
+
269
+ case '-':
270
+ case '.':
271
+ case '_':
272
+ break;
273
+
274
+ case '>':
275
+ return (nb == 1) ? i + 1 : 0;
276
+
277
+ default:
278
+ return 0;
279
+ }
280
+ }
281
+
282
+ return 0;
283
+ }
284
+
285
+ /* tag_length • returns the length of the given tag, or 0 is it's not valid */
286
+ static size_t
287
+ tag_length(uint8_t *data, size_t size, enum mkd_autolink *autolink)
288
+ {
289
+ size_t i, j;
290
+
291
+ /* a valid tag can't be shorter than 3 chars */
292
+ if (size < 3) return 0;
293
+
294
+ /* begins with a '<' optionally followed by '/', followed by letter or number */
295
+ if (data[0] != '<') return 0;
296
+ i = (data[1] == '/') ? 2 : 1;
297
+
298
+ if (!isalnum(data[i]))
299
+ return 0;
300
+
301
+ /* scheme test */
302
+ *autolink = MKDA_NOT_AUTOLINK;
303
+
304
+ /* try to find the beginning of an URI */
305
+ while (i < size && (isalnum(data[i]) || data[i] == '.' || data[i] == '+' || data[i] == '-'))
306
+ i++;
307
+
308
+ if (i > 1 && data[i] == '@') {
309
+ if ((j = is_mail_autolink(data + i, size - i)) != 0) {
310
+ *autolink = MKDA_EMAIL;
311
+ return i + j;
312
+ }
313
+ }
314
+
315
+ if (i > 2 && data[i] == ':') {
316
+ *autolink = MKDA_NORMAL;
317
+ i++;
318
+ }
319
+
320
+ /* completing autolink test: no whitespace or ' or " */
321
+ if (i >= size)
322
+ *autolink = MKDA_NOT_AUTOLINK;
323
+
324
+ else if (*autolink) {
325
+ j = i;
326
+
327
+ while (i < size) {
328
+ if (data[i] == '\\') i += 2;
329
+ else if (data[i] == '>' || data[i] == '\'' ||
330
+ data[i] == '"' || data[i] == ' ' || data[i] == '\n')
331
+ break;
332
+ else i++;
333
+ }
334
+
335
+ if (i >= size) return 0;
336
+ if (i > j && data[i] == '>') return i + 1;
337
+ /* one of the forbidden chars has been found */
338
+ *autolink = MKDA_NOT_AUTOLINK;
339
+ }
340
+
341
+ /* looking for sometinhg looking like a tag end */
342
+ while (i < size && data[i] != '>') i++;
343
+ if (i >= size) return 0;
344
+ return i + 1;
345
+ }
346
+
347
+ /* parse_inline • parses inline markdown elements */
348
+ static void
349
+ parse_inline(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
350
+ {
351
+ size_t i = 0, end = 0;
352
+ uint8_t action = 0;
353
+ struct buf work = { 0, 0, 0, 0 };
354
+
355
+ if (rndr->work_bufs[BUFFER_SPAN].size +
356
+ rndr->work_bufs[BUFFER_BLOCK].size > rndr->max_nesting)
357
+ return;
358
+
359
+ while (i < size) {
360
+ /* copying inactive chars into the output */
361
+ while (end < size && (action = rndr->active_char[data[end]]) == 0) {
362
+ end++;
363
+ }
364
+
365
+ if (rndr->cb.normal_text) {
366
+ work.data = data + i;
367
+ work.size = end - i;
368
+ rndr->cb.normal_text(ob, &work, rndr->opaque);
369
+ }
370
+ else
371
+ bufput(ob, data + i, end - i);
372
+
373
+ if (end >= size) break;
374
+ i = end;
375
+
376
+ end = markdown_char_ptrs[(int)action](ob, rndr, data + i, i, size - i);
377
+ if (!end) /* no action from the callback */
378
+ end = i + 1;
379
+ else {
380
+ i += end;
381
+ end = i;
382
+ }
383
+ }
384
+ }
385
+
386
+ /* find_emph_char • looks for the next emph uint8_t, skipping other constructs */
387
+ static size_t
388
+ find_emph_char(uint8_t *data, size_t size, uint8_t c)
389
+ {
390
+ size_t i = 1;
391
+
392
+ while (i < size) {
393
+ while (i < size && data[i] != c && data[i] != '`' && data[i] != '[')
394
+ i++;
395
+
396
+ if (i == size)
397
+ return 0;
398
+
399
+ if (data[i] == c)
400
+ return i;
401
+
402
+ /* not counting escaped chars */
403
+ if (i && data[i - 1] == '\\') {
404
+ i++; continue;
405
+ }
406
+
407
+ if (data[i] == '`') {
408
+ size_t span_nb = 0, bt;
409
+ size_t tmp_i = 0;
410
+
411
+ /* counting the number of opening backticks */
412
+ while (i < size && data[i] == '`') {
413
+ i++; span_nb++;
414
+ }
415
+
416
+ if (i >= size) return 0;
417
+
418
+ /* finding the matching closing sequence */
419
+ bt = 0;
420
+ while (i < size && bt < span_nb) {
421
+ if (!tmp_i && data[i] == c) tmp_i = i;
422
+ if (data[i] == '`') bt++;
423
+ else bt = 0;
424
+ i++;
425
+ }
426
+
427
+ if (i >= size) return tmp_i;
428
+ }
429
+ /* skipping a link */
430
+ else if (data[i] == '[') {
431
+ size_t tmp_i = 0;
432
+ uint8_t cc;
433
+
434
+ i++;
435
+ while (i < size && data[i] != ']') {
436
+ if (!tmp_i && data[i] == c) tmp_i = i;
437
+ i++;
438
+ }
439
+
440
+ i++;
441
+ while (i < size && (data[i] == ' ' || data[i] == '\n'))
442
+ i++;
443
+
444
+ if (i >= size)
445
+ return tmp_i;
446
+
447
+ switch (data[i]) {
448
+ case '[':
449
+ cc = ']'; break;
450
+
451
+ case '(':
452
+ cc = ')'; break;
453
+
454
+ default:
455
+ if (tmp_i)
456
+ return tmp_i;
457
+ else
458
+ continue;
459
+ }
460
+
461
+ i++;
462
+ while (i < size && data[i] != cc) {
463
+ if (!tmp_i && data[i] == c) tmp_i = i;
464
+ i++;
465
+ }
466
+
467
+ if (i >= size)
468
+ return tmp_i;
469
+
470
+ i++;
471
+ }
472
+ }
473
+
474
+ return 0;
475
+ }
476
+
477
+ /* parse_emph1 • parsing single emphase */
478
+ /* closed by a symbol not preceded by whitespace and not followed by symbol */
479
+ static size_t
480
+ parse_emph1(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)
481
+ {
482
+ size_t i = 0, len;
483
+ struct buf *work = 0;
484
+ int r;
485
+
486
+ if (!rndr->cb.emphasis) return 0;
487
+
488
+ /* skipping one symbol if coming from emph3 */
489
+ if (size > 1 && data[0] == c && data[1] == c) i = 1;
490
+
491
+ while (i < size) {
492
+ len = find_emph_char(data + i, size - i, c);
493
+ if (!len) return 0;
494
+ i += len;
495
+ if (i >= size) return 0;
496
+
497
+ if (data[i] == c && !_isspace(data[i - 1])) {
498
+
499
+ if (rndr->ext_flags & MKDEXT_NO_INTRA_EMPHASIS) {
500
+ if (!(i + 1 == size || _isspace(data[i + 1]) || ispunct(data[i + 1])))
501
+ continue;
502
+ }
503
+
504
+ work = rndr_newbuf(rndr, BUFFER_SPAN);
505
+ parse_inline(work, rndr, data, i);
506
+ r = rndr->cb.emphasis(ob, work, rndr->opaque);
507
+ rndr_popbuf(rndr, BUFFER_SPAN);
508
+ return r ? i + 1 : 0;
509
+ }
510
+ }
511
+
512
+ return 0;
513
+ }
514
+
515
+ /* parse_emph2 • parsing single emphase */
516
+ static size_t
517
+ parse_emph2(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)
518
+ {
519
+ int (*render_method)(struct buf *ob, const struct buf *text, void *opaque);
520
+ size_t i = 0, len;
521
+ struct buf *work = 0;
522
+ int r;
523
+
524
+ render_method = (c == '~') ? rndr->cb.strikethrough : rndr->cb.double_emphasis;
525
+
526
+ if (!render_method)
527
+ return 0;
528
+
529
+ while (i < size) {
530
+ len = find_emph_char(data + i, size - i, c);
531
+ if (!len) return 0;
532
+ i += len;
533
+
534
+ if (i + 1 < size && data[i] == c && data[i + 1] == c && i && !_isspace(data[i - 1])) {
535
+ work = rndr_newbuf(rndr, BUFFER_SPAN);
536
+ parse_inline(work, rndr, data, i);
537
+ r = render_method(ob, work, rndr->opaque);
538
+ rndr_popbuf(rndr, BUFFER_SPAN);
539
+ return r ? i + 2 : 0;
540
+ }
541
+ i++;
542
+ }
543
+ return 0;
544
+ }
545
+
546
+ /* parse_emph3 • parsing single emphase */
547
+ /* finds the first closing tag, and delegates to the other emph */
548
+ static size_t
549
+ parse_emph3(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)
550
+ {
551
+ size_t i = 0, len;
552
+ int r;
553
+
554
+ while (i < size) {
555
+ len = find_emph_char(data + i, size - i, c);
556
+ if (!len) return 0;
557
+ i += len;
558
+
559
+ /* skip whitespace preceded symbols */
560
+ if (data[i] != c || _isspace(data[i - 1]))
561
+ continue;
562
+
563
+ if (i + 2 < size && data[i + 1] == c && data[i + 2] == c && rndr->cb.triple_emphasis) {
564
+ /* triple symbol found */
565
+ struct buf *work = rndr_newbuf(rndr, BUFFER_SPAN);
566
+
567
+ parse_inline(work, rndr, data, i);
568
+ r = rndr->cb.triple_emphasis(ob, work, rndr->opaque);
569
+ rndr_popbuf(rndr, BUFFER_SPAN);
570
+ return r ? i + 3 : 0;
571
+
572
+ } else if (i + 1 < size && data[i + 1] == c) {
573
+ /* double symbol found, handing over to emph1 */
574
+ len = parse_emph1(ob, rndr, data - 2, size + 2, c);
575
+ if (!len) return 0;
576
+ else return len - 2;
577
+
578
+ } else {
579
+ /* single symbol found, handing over to emph2 */
580
+ len = parse_emph2(ob, rndr, data - 1, size + 1, c);
581
+ if (!len) return 0;
582
+ else return len - 1;
583
+ }
584
+ }
585
+ return 0;
586
+ }
587
+
588
+ /* char_emphasis • single and double emphasis parsing */
589
+ static size_t
590
+ char_emphasis(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
591
+ {
592
+ uint8_t c = data[0];
593
+ size_t ret;
594
+
595
+ if (size > 2 && data[1] != c) {
596
+ /* whitespace cannot follow an opening emphasis;
597
+ * strikethrough only takes two characters '~~' */
598
+ if (c == '~' || _isspace(data[1]) || (ret = parse_emph1(ob, rndr, data + 1, size - 1, c)) == 0)
599
+ return 0;
600
+
601
+ return ret + 1;
602
+ }
603
+
604
+ if (size > 3 && data[1] == c && data[2] != c) {
605
+ if (_isspace(data[2]) || (ret = parse_emph2(ob, rndr, data + 2, size - 2, c)) == 0)
606
+ return 0;
607
+
608
+ return ret + 2;
609
+ }
610
+
611
+ if (size > 4 && data[1] == c && data[2] == c && data[3] != c) {
612
+ if (c == '~' || _isspace(data[3]) || (ret = parse_emph3(ob, rndr, data + 3, size - 3, c)) == 0)
613
+ return 0;
614
+
615
+ return ret + 3;
616
+ }
617
+
618
+ return 0;
619
+ }
620
+
621
+
622
+ /* char_linebreak • '\n' preceded by two spaces (assuming linebreak != 0) */
623
+ static size_t
624
+ char_linebreak(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
625
+ {
626
+ if (offset < 2 || data[-1] != ' ' || data[-2] != ' ')
627
+ return 0;
628
+
629
+ /* removing the last space from ob and rendering */
630
+ while (ob->size && ob->data[ob->size - 1] == ' ')
631
+ ob->size--;
632
+
633
+ return rndr->cb.linebreak(ob, rndr->opaque) ? 1 : 0;
634
+ }
635
+
636
+
637
+ /* char_codespan • '`' parsing a code span (assuming codespan != 0) */
638
+ static size_t
639
+ char_codespan(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
640
+ {
641
+ size_t end, nb = 0, i, f_begin, f_end;
642
+
643
+ /* counting the number of backticks in the delimiter */
644
+ while (nb < size && data[nb] == '`')
645
+ nb++;
646
+
647
+ /* finding the next delimiter */
648
+ i = 0;
649
+ for (end = nb; end < size && i < nb; end++) {
650
+ if (data[end] == '`') i++;
651
+ else i = 0;
652
+ }
653
+
654
+ if (i < nb && end >= size)
655
+ return 0; /* no matching delimiter */
656
+
657
+ /* trimming outside whitespaces */
658
+ f_begin = nb;
659
+ while (f_begin < end && data[f_begin] == ' ')
660
+ f_begin++;
661
+
662
+ f_end = end - nb;
663
+ while (f_end > nb && data[f_end-1] == ' ')
664
+ f_end--;
665
+
666
+ /* real code span */
667
+ if (f_begin < f_end) {
668
+ struct buf work = { data + f_begin, f_end - f_begin, 0, 0 };
669
+ if (!rndr->cb.codespan(ob, &work, rndr->opaque))
670
+ end = 0;
671
+ } else {
672
+ if (!rndr->cb.codespan(ob, 0, rndr->opaque))
673
+ end = 0;
674
+ }
675
+
676
+ return end;
677
+ }
678
+
679
+
680
+ /* char_escape • '\\' backslash escape */
681
+ static size_t
682
+ char_escape(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
683
+ {
684
+ static const char *escape_chars = "\\`*_{}[]()#+-.!:|&<>^~";
685
+ struct buf work = { 0, 0, 0, 0 };
686
+
687
+ if (size > 1) {
688
+ if (strchr(escape_chars, data[1]) == NULL)
689
+ return 0;
690
+
691
+ if (rndr->cb.normal_text) {
692
+ work.data = data + 1;
693
+ work.size = 1;
694
+ rndr->cb.normal_text(ob, &work, rndr->opaque);
695
+ }
696
+ else bufputc(ob, data[1]);
697
+ }
698
+
699
+ return 2;
700
+ }
701
+
702
+ /* char_entity • '&' escaped when it doesn't belong to an entity */
703
+ /* valid entities are assumed to be anything matching &#?[A-Za-z0-9]+; */
704
+ static size_t
705
+ char_entity(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
706
+ {
707
+ size_t end = 1;
708
+ struct buf work = { 0, 0, 0, 0 };
709
+
710
+ if (end < size && data[end] == '#')
711
+ end++;
712
+
713
+ while (end < size && isalnum(data[end]))
714
+ end++;
715
+
716
+ if (end < size && data[end] == ';')
717
+ end++; /* real entity */
718
+ else
719
+ return 0; /* lone '&' */
720
+
721
+ if (rndr->cb.entity) {
722
+ work.data = data;
723
+ work.size = end;
724
+ rndr->cb.entity(ob, &work, rndr->opaque);
725
+ }
726
+ else bufput(ob, data, end);
727
+
728
+ return end;
729
+ }
730
+
731
+ /* char_langle_tag • '<' when tags or autolinks are allowed */
732
+ static size_t
733
+ char_langle_tag(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
734
+ {
735
+ enum mkd_autolink altype = MKDA_NOT_AUTOLINK;
736
+ size_t end = tag_length(data, size, &altype);
737
+ struct buf work = { data, end, 0, 0 };
738
+ int ret = 0;
739
+
740
+ if (end > 2) {
741
+ if (rndr->cb.autolink && altype != MKDA_NOT_AUTOLINK) {
742
+ struct buf *u_link = rndr_newbuf(rndr, BUFFER_SPAN);
743
+ work.data = data + 1;
744
+ work.size = end - 2;
745
+ unscape_text(u_link, &work);
746
+ ret = rndr->cb.autolink(ob, u_link, altype, rndr->opaque);
747
+ rndr_popbuf(rndr, BUFFER_SPAN);
748
+ }
749
+ else if (rndr->cb.raw_html_tag)
750
+ ret = rndr->cb.raw_html_tag(ob, &work, rndr->opaque);
751
+ }
752
+
753
+ if (!ret) return 0;
754
+ else return end;
755
+ }
756
+
757
+ static size_t
758
+ char_autolink_www(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
759
+ {
760
+ struct buf *link, *link_url, *link_text;
761
+ size_t link_len, rewind;
762
+
763
+ if (!rndr->cb.link || rndr->in_link_body)
764
+ return 0;
765
+
766
+ link = rndr_newbuf(rndr, BUFFER_SPAN);
767
+
768
+ if ((link_len = sd_autolink__www(&rewind, link, data, offset, size)) > 0) {
769
+ link_url = rndr_newbuf(rndr, BUFFER_SPAN);
770
+ BUFPUTSL(link_url, "http://");
771
+ bufput(link_url, link->data, link->size);
772
+
773
+ ob->size -= rewind;
774
+ if (rndr->cb.normal_text) {
775
+ link_text = rndr_newbuf(rndr, BUFFER_SPAN);
776
+ rndr->cb.normal_text(link_text, link, rndr->opaque);
777
+ rndr->cb.link(ob, link_url, NULL, link_text, rndr->opaque);
778
+ rndr_popbuf(rndr, BUFFER_SPAN);
779
+ } else {
780
+ rndr->cb.link(ob, link_url, NULL, link, rndr->opaque);
781
+ }
782
+ rndr_popbuf(rndr, BUFFER_SPAN);
783
+ }
784
+
785
+ rndr_popbuf(rndr, BUFFER_SPAN);
786
+ return link_len;
787
+ }
788
+
789
+ static size_t
790
+ char_autolink_email(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
791
+ {
792
+ struct buf *link;
793
+ size_t link_len, rewind;
794
+
795
+ if (!rndr->cb.autolink || rndr->in_link_body)
796
+ return 0;
797
+
798
+ link = rndr_newbuf(rndr, BUFFER_SPAN);
799
+
800
+ if ((link_len = sd_autolink__email(&rewind, link, data, offset, size)) > 0) {
801
+ ob->size -= rewind;
802
+ rndr->cb.autolink(ob, link, MKDA_EMAIL, rndr->opaque);
803
+ }
804
+
805
+ rndr_popbuf(rndr, BUFFER_SPAN);
806
+ return link_len;
807
+ }
808
+
809
+ static size_t
810
+ char_autolink_url(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
811
+ {
812
+ struct buf *link;
813
+ size_t link_len, rewind;
814
+
815
+ if (!rndr->cb.autolink || rndr->in_link_body)
816
+ return 0;
817
+
818
+ link = rndr_newbuf(rndr, BUFFER_SPAN);
819
+
820
+ if ((link_len = sd_autolink__url(&rewind, link, data, offset, size)) > 0) {
821
+ ob->size -= rewind;
822
+ rndr->cb.autolink(ob, link, MKDA_NORMAL, rndr->opaque);
823
+ }
824
+
825
+ rndr_popbuf(rndr, BUFFER_SPAN);
826
+ return link_len;
827
+ }
828
+
829
+ /* char_link • '[': parsing a link or an image */
830
+ static size_t
831
+ char_link(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
832
+ {
833
+ int is_img = (offset && data[-1] == '!'), level;
834
+ size_t i = 1, txt_e, link_b = 0, link_e = 0, title_b = 0, title_e = 0;
835
+ struct buf *content = 0;
836
+ struct buf *link = 0;
837
+ struct buf *title = 0;
838
+ struct buf *u_link = 0;
839
+ size_t org_work_size = rndr->work_bufs[BUFFER_SPAN].size;
840
+ int text_has_nl = 0, ret = 0;
841
+ int in_title = 0, qtype = 0;
842
+
843
+ /* checking whether the correct renderer exists */
844
+ if ((is_img && !rndr->cb.image) || (!is_img && !rndr->cb.link))
845
+ goto cleanup;
846
+
847
+ /* looking for the matching closing bracket */
848
+ for (level = 1; i < size; i++) {
849
+ if (data[i] == '\n')
850
+ text_has_nl = 1;
851
+
852
+ else if (data[i - 1] == '\\')
853
+ continue;
854
+
855
+ else if (data[i] == '[')
856
+ level++;
857
+
858
+ else if (data[i] == ']') {
859
+ level--;
860
+ if (level <= 0)
861
+ break;
862
+ }
863
+ }
864
+
865
+ if (i >= size)
866
+ goto cleanup;
867
+
868
+ txt_e = i;
869
+ i++;
870
+
871
+ /* skip any amount of whitespace or newline */
872
+ /* (this is much more laxist than original markdown syntax) */
873
+ while (i < size && _isspace(data[i]))
874
+ i++;
875
+
876
+ /* inline style link */
877
+ if (i < size && data[i] == '(') {
878
+ /* skipping initial whitespace */
879
+ i++;
880
+
881
+ while (i < size && _isspace(data[i]))
882
+ i++;
883
+
884
+ link_b = i;
885
+
886
+ /* looking for link end: ' " ) */
887
+ while (i < size) {
888
+ if (data[i] == '\\') i += 2;
889
+ else if (data[i] == ')' || data[i] == '\'' || data[i] == '"') break;
890
+ else i++;
891
+ }
892
+
893
+ if (i >= size) goto cleanup;
894
+ link_e = i;
895
+
896
+ /* looking for title end if present */
897
+ if (data[i] == '\'' || data[i] == '"') {
898
+ qtype = data[i];
899
+ in_title = 1;
900
+ i++;
901
+ title_b = i;
902
+
903
+ while (i < size) {
904
+ if (data[i] == '\\') i += 2;
905
+ else if (data[i] == qtype) {in_title = 0; i++;}
906
+ else if ((data[i] == ')') && !in_title) break;
907
+ else i++;
908
+ }
909
+
910
+ if (i >= size) goto cleanup;
911
+
912
+ /* skipping whitespaces after title */
913
+ title_e = i - 1;
914
+ while (title_e > title_b && _isspace(data[title_e]))
915
+ title_e--;
916
+
917
+ /* checking for closing quote presence */
918
+ if (data[title_e] != '\'' && data[title_e] != '"') {
919
+ title_b = title_e = 0;
920
+ link_e = i;
921
+ }
922
+ }
923
+
924
+ /* remove whitespace at the end of the link */
925
+ while (link_e > link_b && _isspace(data[link_e - 1]))
926
+ link_e--;
927
+
928
+ /* remove optional angle brackets around the link */
929
+ if (data[link_b] == '<') link_b++;
930
+ if (data[link_e - 1] == '>') link_e--;
931
+
932
+ /* building escaped link and title */
933
+ if (link_e > link_b) {
934
+ link = rndr_newbuf(rndr, BUFFER_SPAN);
935
+ bufput(link, data + link_b, link_e - link_b);
936
+ }
937
+
938
+ if (title_e > title_b) {
939
+ title = rndr_newbuf(rndr, BUFFER_SPAN);
940
+ bufput(title, data + title_b, title_e - title_b);
941
+ }
942
+
943
+ i++;
944
+ }
945
+
946
+ /* reference style link */
947
+ else if (i < size && data[i] == '[') {
948
+ struct buf id = { 0, 0, 0, 0 };
949
+ struct link_ref *lr;
950
+
951
+ /* looking for the id */
952
+ i++;
953
+ link_b = i;
954
+ while (i < size && data[i] != ']') i++;
955
+ if (i >= size) goto cleanup;
956
+ link_e = i;
957
+
958
+ /* finding the link_ref */
959
+ if (link_b == link_e) {
960
+ if (text_has_nl) {
961
+ struct buf *b = rndr_newbuf(rndr, BUFFER_SPAN);
962
+ size_t j;
963
+
964
+ for (j = 1; j < txt_e; j++) {
965
+ if (data[j] != '\n')
966
+ bufputc(b, data[j]);
967
+ else if (data[j - 1] != ' ')
968
+ bufputc(b, ' ');
969
+ }
970
+
971
+ id.data = b->data;
972
+ id.size = b->size;
973
+ } else {
974
+ id.data = data + 1;
975
+ id.size = txt_e - 1;
976
+ }
977
+ } else {
978
+ id.data = data + link_b;
979
+ id.size = link_e - link_b;
980
+ }
981
+
982
+ lr = find_link_ref(rndr->refs, id.data, id.size);
983
+ if (!lr)
984
+ goto cleanup;
985
+
986
+ /* keeping link and title from link_ref */
987
+ link = lr->link;
988
+ title = lr->title;
989
+ i++;
990
+ }
991
+
992
+ /* shortcut reference style link */
993
+ else {
994
+ struct buf id = { 0, 0, 0, 0 };
995
+ struct link_ref *lr;
996
+
997
+ /* crafting the id */
998
+ if (text_has_nl) {
999
+ struct buf *b = rndr_newbuf(rndr, BUFFER_SPAN);
1000
+ size_t j;
1001
+
1002
+ for (j = 1; j < txt_e; j++) {
1003
+ if (data[j] != '\n')
1004
+ bufputc(b, data[j]);
1005
+ else if (data[j - 1] != ' ')
1006
+ bufputc(b, ' ');
1007
+ }
1008
+
1009
+ id.data = b->data;
1010
+ id.size = b->size;
1011
+ } else {
1012
+ id.data = data + 1;
1013
+ id.size = txt_e - 1;
1014
+ }
1015
+
1016
+ /* finding the link_ref */
1017
+ lr = find_link_ref(rndr->refs, id.data, id.size);
1018
+ if (!lr)
1019
+ goto cleanup;
1020
+
1021
+ /* keeping link and title from link_ref */
1022
+ link = lr->link;
1023
+ title = lr->title;
1024
+
1025
+ /* rewinding the whitespace */
1026
+ i = txt_e + 1;
1027
+ }
1028
+
1029
+ /* building content: img alt is escaped, link content is parsed */
1030
+ if (txt_e > 1) {
1031
+ content = rndr_newbuf(rndr, BUFFER_SPAN);
1032
+ if (is_img) {
1033
+ bufput(content, data + 1, txt_e - 1);
1034
+ } else {
1035
+ /* disable autolinking when parsing inline the
1036
+ * content of a link */
1037
+ rndr->in_link_body = 1;
1038
+ parse_inline(content, rndr, data + 1, txt_e - 1);
1039
+ rndr->in_link_body = 0;
1040
+ }
1041
+ }
1042
+
1043
+ if (link) {
1044
+ u_link = rndr_newbuf(rndr, BUFFER_SPAN);
1045
+ unscape_text(u_link, link);
1046
+ }
1047
+
1048
+ /* calling the relevant rendering function */
1049
+ if (is_img) {
1050
+ if (ob->size && ob->data[ob->size - 1] == '!')
1051
+ ob->size -= 1;
1052
+
1053
+ ret = rndr->cb.image(ob, u_link, title, content, rndr->opaque);
1054
+ } else {
1055
+ ret = rndr->cb.link(ob, u_link, title, content, rndr->opaque);
1056
+ }
1057
+
1058
+ /* cleanup */
1059
+ cleanup:
1060
+ rndr->work_bufs[BUFFER_SPAN].size = (int)org_work_size;
1061
+ return ret ? i : 0;
1062
+ }
1063
+
1064
+ static size_t
1065
+ char_superscript(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)
1066
+ {
1067
+ size_t sup_start, sup_len;
1068
+ struct buf *sup;
1069
+
1070
+ if (!rndr->cb.superscript)
1071
+ return 0;
1072
+
1073
+ if (size < 2)
1074
+ return 0;
1075
+
1076
+ if (data[1] == '(') {
1077
+ sup_start = sup_len = 2;
1078
+
1079
+ while (sup_len < size && data[sup_len] != ')' && data[sup_len - 1] != '\\')
1080
+ sup_len++;
1081
+
1082
+ if (sup_len == size)
1083
+ return 0;
1084
+ } else {
1085
+ sup_start = sup_len = 1;
1086
+
1087
+ while (sup_len < size && !_isspace(data[sup_len]))
1088
+ sup_len++;
1089
+ }
1090
+
1091
+ if (sup_len - sup_start == 0)
1092
+ return (sup_start == 2) ? 3 : 0;
1093
+
1094
+ sup = rndr_newbuf(rndr, BUFFER_SPAN);
1095
+ parse_inline(sup, rndr, data + sup_start, sup_len - sup_start);
1096
+ rndr->cb.superscript(ob, sup, rndr->opaque);
1097
+ rndr_popbuf(rndr, BUFFER_SPAN);
1098
+
1099
+ return (sup_start == 2) ? sup_len + 1 : sup_len;
1100
+ }
1101
+
1102
+ /*********************************
1103
+ * BLOCK-LEVEL PARSING FUNCTIONS *
1104
+ *********************************/
1105
+
1106
+ /* is_empty • returns the line length when it is empty, 0 otherwise */
1107
+ static size_t
1108
+ is_empty(uint8_t *data, size_t size)
1109
+ {
1110
+ size_t i;
1111
+
1112
+ for (i = 0; i < size && data[i] != '\n'; i++)
1113
+ if (data[i] != ' ')
1114
+ return 0;
1115
+
1116
+ return i + 1;
1117
+ }
1118
+
1119
+ /* is_hrule • returns whether a line is a horizontal rule */
1120
+ static int
1121
+ is_hrule(uint8_t *data, size_t size)
1122
+ {
1123
+ size_t i = 0, n = 0;
1124
+ uint8_t c;
1125
+
1126
+ /* skipping initial spaces */
1127
+ if (size < 3) return 0;
1128
+ if (data[0] == ' ') { i++;
1129
+ if (data[1] == ' ') { i++;
1130
+ if (data[2] == ' ') { i++; } } }
1131
+
1132
+ /* looking at the hrule uint8_t */
1133
+ if (i + 2 >= size
1134
+ || (data[i] != '*' && data[i] != '-' && data[i] != '_'))
1135
+ return 0;
1136
+ c = data[i];
1137
+
1138
+ /* the whole line must be the char or whitespace */
1139
+ while (i < size && data[i] != '\n') {
1140
+ if (data[i] == c) n++;
1141
+ else if (data[i] != ' ')
1142
+ return 0;
1143
+
1144
+ i++;
1145
+ }
1146
+
1147
+ return n >= 3;
1148
+ }
1149
+
1150
+ /* check if a line is a code fence; return its size if it is */
1151
+ static size_t
1152
+ is_codefence(uint8_t *data, size_t size, struct buf *syntax)
1153
+ {
1154
+ size_t i = 0, n = 0;
1155
+ uint8_t c;
1156
+
1157
+ /* skipping initial spaces */
1158
+ if (size < 3) return 0;
1159
+ if (data[0] == ' ') { i++;
1160
+ if (data[1] == ' ') { i++;
1161
+ if (data[2] == ' ') { i++; } } }
1162
+
1163
+ /* looking at the hrule uint8_t */
1164
+ if (i + 2 >= size || !(data[i] == '~' || data[i] == '`'))
1165
+ return 0;
1166
+
1167
+ c = data[i];
1168
+
1169
+ /* the whole line must be the uint8_t or whitespace */
1170
+ while (i < size && data[i] == c) {
1171
+ n++; i++;
1172
+ }
1173
+
1174
+ if (n < 3)
1175
+ return 0;
1176
+
1177
+ if (syntax != NULL) {
1178
+ size_t syn = 0;
1179
+
1180
+ while (i < size && data[i] == ' ')
1181
+ i++;
1182
+
1183
+ syntax->data = data + i;
1184
+
1185
+ if (i < size && data[i] == '{') {
1186
+ i++; syntax->data++;
1187
+
1188
+ while (i < size && data[i] != '}' && data[i] != '\n') {
1189
+ syn++; i++;
1190
+ }
1191
+
1192
+ if (i == size || data[i] != '}')
1193
+ return 0;
1194
+
1195
+ /* strip all whitespace at the beginning and the end
1196
+ * of the {} block */
1197
+ while (syn > 0 && _isspace(syntax->data[0])) {
1198
+ syntax->data++; syn--;
1199
+ }
1200
+
1201
+ while (syn > 0 && _isspace(syntax->data[syn - 1]))
1202
+ syn--;
1203
+
1204
+ i++;
1205
+ } else {
1206
+ while (i < size && !_isspace(data[i])) {
1207
+ syn++; i++;
1208
+ }
1209
+ }
1210
+
1211
+ syntax->size = syn;
1212
+ }
1213
+
1214
+ while (i < size && data[i] != '\n') {
1215
+ if (!_isspace(data[i]))
1216
+ return 0;
1217
+
1218
+ i++;
1219
+ }
1220
+
1221
+ return i + 1;
1222
+ }
1223
+
1224
+ /* is_atxheader • returns whether the line is a hash-prefixed header */
1225
+ static int
1226
+ is_atxheader(struct sd_markdown *rndr, uint8_t *data, size_t size)
1227
+ {
1228
+ if (data[0] != '#')
1229
+ return 0;
1230
+
1231
+ if (rndr->ext_flags & MKDEXT_SPACE_HEADERS) {
1232
+ size_t level = 0;
1233
+
1234
+ while (level < size && level < 6 && data[level] == '#')
1235
+ level++;
1236
+
1237
+ if (level < size && data[level] != ' ')
1238
+ return 0;
1239
+ }
1240
+
1241
+ return 1;
1242
+ }
1243
+
1244
+ /* is_headerline • returns whether the line is a setext-style hdr underline */
1245
+ static int
1246
+ is_headerline(uint8_t *data, size_t size)
1247
+ {
1248
+ size_t i = 0;
1249
+
1250
+ /* test of level 1 header */
1251
+ if (data[i] == '=') {
1252
+ for (i = 1; i < size && data[i] == '='; i++);
1253
+ while (i < size && data[i] == ' ') i++;
1254
+ return (i >= size || data[i] == '\n') ? 1 : 0; }
1255
+
1256
+ /* test of level 2 header */
1257
+ if (data[i] == '-') {
1258
+ for (i = 1; i < size && data[i] == '-'; i++);
1259
+ while (i < size && data[i] == ' ') i++;
1260
+ return (i >= size || data[i] == '\n') ? 2 : 0; }
1261
+
1262
+ return 0;
1263
+ }
1264
+
1265
+ static int
1266
+ is_next_headerline(uint8_t *data, size_t size)
1267
+ {
1268
+ size_t i = 0;
1269
+
1270
+ while (i < size && data[i] != '\n')
1271
+ i++;
1272
+
1273
+ if (++i >= size)
1274
+ return 0;
1275
+
1276
+ return is_headerline(data + i, size - i);
1277
+ }
1278
+
1279
+ /* prefix_quote • returns blockquote prefix length */
1280
+ static size_t
1281
+ prefix_quote(uint8_t *data, size_t size)
1282
+ {
1283
+ size_t i = 0;
1284
+ if (i < size && data[i] == ' ') i++;
1285
+ if (i < size && data[i] == ' ') i++;
1286
+ if (i < size && data[i] == ' ') i++;
1287
+
1288
+ if (i < size && data[i] == '>') {
1289
+ if (i + 1 < size && data[i + 1] == ' ')
1290
+ return i + 2;
1291
+
1292
+ return i + 1;
1293
+ }
1294
+
1295
+ return 0;
1296
+ }
1297
+
1298
+ /* prefix_code • returns prefix length for block code*/
1299
+ static size_t
1300
+ prefix_code(uint8_t *data, size_t size)
1301
+ {
1302
+ if (size > 3 && data[0] == ' ' && data[1] == ' '
1303
+ && data[2] == ' ' && data[3] == ' ') return 4;
1304
+
1305
+ return 0;
1306
+ }
1307
+
1308
+ /* prefix_oli • returns ordered list item prefix */
1309
+ static size_t
1310
+ prefix_oli(uint8_t *data, size_t size)
1311
+ {
1312
+ size_t i = 0;
1313
+
1314
+ if (i < size && data[i] == ' ') i++;
1315
+ if (i < size && data[i] == ' ') i++;
1316
+ if (i < size && data[i] == ' ') i++;
1317
+
1318
+ if (i >= size || data[i] < '0' || data[i] > '9')
1319
+ return 0;
1320
+
1321
+ while (i < size && data[i] >= '0' && data[i] <= '9')
1322
+ i++;
1323
+
1324
+ if (i + 1 >= size || data[i] != '.' || data[i + 1] != ' ')
1325
+ return 0;
1326
+
1327
+ if (is_next_headerline(data + i, size - i))
1328
+ return 0;
1329
+
1330
+ return i + 2;
1331
+ }
1332
+
1333
+ /* prefix_uli • returns ordered list item prefix */
1334
+ static size_t
1335
+ prefix_uli(uint8_t *data, size_t size)
1336
+ {
1337
+ size_t i = 0;
1338
+
1339
+ if (i < size && data[i] == ' ') i++;
1340
+ if (i < size && data[i] == ' ') i++;
1341
+ if (i < size && data[i] == ' ') i++;
1342
+
1343
+ if (i + 1 >= size ||
1344
+ (data[i] != '*' && data[i] != '+' && data[i] != '-') ||
1345
+ data[i + 1] != ' ')
1346
+ return 0;
1347
+
1348
+ if (is_next_headerline(data + i, size - i))
1349
+ return 0;
1350
+
1351
+ return i + 2;
1352
+ }
1353
+
1354
+
1355
+ /* parse_block • parsing of one block, returning next uint8_t to parse */
1356
+ static void parse_block(struct buf *ob, struct sd_markdown *rndr,
1357
+ uint8_t *data, size_t size);
1358
+
1359
+
1360
+ /* parse_blockquote • handles parsing of a blockquote fragment */
1361
+ static size_t
1362
+ parse_blockquote(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
1363
+ {
1364
+ size_t beg, end = 0, pre, work_size = 0;
1365
+ uint8_t *work_data = 0;
1366
+ struct buf *out = 0;
1367
+
1368
+ out = rndr_newbuf(rndr, BUFFER_BLOCK);
1369
+ beg = 0;
1370
+ while (beg < size) {
1371
+ for (end = beg + 1; end < size && data[end - 1] != '\n'; end++);
1372
+
1373
+ pre = prefix_quote(data + beg, end - beg);
1374
+
1375
+ if (pre)
1376
+ beg += pre; /* skipping prefix */
1377
+
1378
+ /* empty line followed by non-quote line */
1379
+ else if (is_empty(data + beg, end - beg) &&
1380
+ (end >= size || (prefix_quote(data + end, size - end) == 0 &&
1381
+ !is_empty(data + end, size - end))))
1382
+ break;
1383
+
1384
+ if (beg < end) { /* copy into the in-place working buffer */
1385
+ /* bufput(work, data + beg, end - beg); */
1386
+ if (!work_data)
1387
+ work_data = data + beg;
1388
+ else if (data + beg != work_data + work_size)
1389
+ memmove(work_data + work_size, data + beg, end - beg);
1390
+ work_size += end - beg;
1391
+ }
1392
+ beg = end;
1393
+ }
1394
+
1395
+ parse_block(out, rndr, work_data, work_size);
1396
+ if (rndr->cb.blockquote)
1397
+ rndr->cb.blockquote(ob, out, rndr->opaque);
1398
+ rndr_popbuf(rndr, BUFFER_BLOCK);
1399
+ return end;
1400
+ }
1401
+
1402
+ static size_t
1403
+ parse_htmlblock(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int do_render);
1404
+
1405
+ /* parse_blockquote • handles parsing of a regular paragraph */
1406
+ static size_t
1407
+ parse_paragraph(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
1408
+ {
1409
+ size_t i = 0, end = 0;
1410
+ int level = 0;
1411
+ struct buf work = { data, 0, 0, 0 };
1412
+
1413
+ while (i < size) {
1414
+ for (end = i + 1; end < size && data[end - 1] != '\n'; end++) /* empty */;
1415
+
1416
+ if (is_empty(data + i, size - i) || (level = is_headerline(data + i, size - i)) != 0)
1417
+ break;
1418
+
1419
+ if (rndr->ext_flags & MKDEXT_LAX_HTML_BLOCKS) {
1420
+ if (data[i] == '<' && rndr->cb.blockhtml && parse_htmlblock(ob, rndr, data + i, size - i, 0)) {
1421
+ end = i;
1422
+ break;
1423
+ }
1424
+ }
1425
+
1426
+ if (is_atxheader(rndr, data + i, size - i) || is_hrule(data + i, size - i)) {
1427
+ end = i;
1428
+ break;
1429
+ }
1430
+
1431
+ i = end;
1432
+ }
1433
+
1434
+ work.size = i;
1435
+ while (work.size && data[work.size - 1] == '\n')
1436
+ work.size--;
1437
+
1438
+ if (!level) {
1439
+ struct buf *tmp = rndr_newbuf(rndr, BUFFER_BLOCK);
1440
+ parse_inline(tmp, rndr, work.data, work.size);
1441
+ if (rndr->cb.paragraph)
1442
+ rndr->cb.paragraph(ob, tmp, rndr->opaque);
1443
+ rndr_popbuf(rndr, BUFFER_BLOCK);
1444
+ } else {
1445
+ struct buf *header_work;
1446
+
1447
+ if (work.size) {
1448
+ size_t beg;
1449
+ i = work.size;
1450
+ work.size -= 1;
1451
+
1452
+ while (work.size && data[work.size] != '\n')
1453
+ work.size -= 1;
1454
+
1455
+ beg = work.size + 1;
1456
+ while (work.size && data[work.size - 1] == '\n')
1457
+ work.size -= 1;
1458
+
1459
+ if (work.size > 0) {
1460
+ struct buf *tmp = rndr_newbuf(rndr, BUFFER_BLOCK);
1461
+ parse_inline(tmp, rndr, work.data, work.size);
1462
+
1463
+ if (rndr->cb.paragraph)
1464
+ rndr->cb.paragraph(ob, tmp, rndr->opaque);
1465
+
1466
+ rndr_popbuf(rndr, BUFFER_BLOCK);
1467
+ work.data += beg;
1468
+ work.size = i - beg;
1469
+ }
1470
+ else work.size = i;
1471
+ }
1472
+
1473
+ header_work = rndr_newbuf(rndr, BUFFER_SPAN);
1474
+ parse_inline(header_work, rndr, work.data, work.size);
1475
+
1476
+ if (rndr->cb.header)
1477
+ rndr->cb.header(ob, header_work, (int)level, rndr->opaque);
1478
+
1479
+ rndr_popbuf(rndr, BUFFER_SPAN);
1480
+ }
1481
+
1482
+ return end;
1483
+ }
1484
+
1485
+ /* parse_fencedcode • handles parsing of a block-level code fragment */
1486
+ static size_t
1487
+ parse_fencedcode(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
1488
+ {
1489
+ size_t beg, end;
1490
+ struct buf *work = 0;
1491
+ struct buf lang = { 0, 0, 0, 0 };
1492
+
1493
+ beg = is_codefence(data, size, &lang);
1494
+ if (beg == 0) return 0;
1495
+
1496
+ work = rndr_newbuf(rndr, BUFFER_BLOCK);
1497
+
1498
+ while (beg < size) {
1499
+ size_t fence_end;
1500
+
1501
+ fence_end = is_codefence(data + beg, size - beg, NULL);
1502
+ if (fence_end != 0) {
1503
+ beg += fence_end;
1504
+ break;
1505
+ }
1506
+
1507
+ for (end = beg + 1; end < size && data[end - 1] != '\n'; end++);
1508
+
1509
+ if (beg < end) {
1510
+ /* verbatim copy to the working buffer,
1511
+ escaping entities */
1512
+ if (is_empty(data + beg, end - beg))
1513
+ bufputc(work, '\n');
1514
+ else bufput(work, data + beg, end - beg);
1515
+ }
1516
+ beg = end;
1517
+ }
1518
+
1519
+ if (work->size && work->data[work->size - 1] != '\n')
1520
+ bufputc(work, '\n');
1521
+
1522
+ if (rndr->cb.blockcode)
1523
+ rndr->cb.blockcode(ob, work, lang.size ? &lang : NULL, rndr->opaque);
1524
+
1525
+ rndr_popbuf(rndr, BUFFER_BLOCK);
1526
+ return beg;
1527
+ }
1528
+
1529
+ static size_t
1530
+ parse_blockcode(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
1531
+ {
1532
+ size_t beg, end, pre;
1533
+ struct buf *work = 0;
1534
+
1535
+ work = rndr_newbuf(rndr, BUFFER_BLOCK);
1536
+
1537
+ beg = 0;
1538
+ while (beg < size) {
1539
+ for (end = beg + 1; end < size && data[end - 1] != '\n'; end++) {};
1540
+ pre = prefix_code(data + beg, end - beg);
1541
+
1542
+ if (pre)
1543
+ beg += pre; /* skipping prefix */
1544
+ else if (!is_empty(data + beg, end - beg))
1545
+ /* non-empty non-prefixed line breaks the pre */
1546
+ break;
1547
+
1548
+ if (beg < end) {
1549
+ /* verbatim copy to the working buffer,
1550
+ escaping entities */
1551
+ if (is_empty(data + beg, end - beg))
1552
+ bufputc(work, '\n');
1553
+ else bufput(work, data + beg, end - beg);
1554
+ }
1555
+ beg = end;
1556
+ }
1557
+
1558
+ while (work->size && work->data[work->size - 1] == '\n')
1559
+ work->size -= 1;
1560
+
1561
+ bufputc(work, '\n');
1562
+
1563
+ if (rndr->cb.blockcode)
1564
+ rndr->cb.blockcode(ob, work, NULL, rndr->opaque);
1565
+
1566
+ rndr_popbuf(rndr, BUFFER_BLOCK);
1567
+ return beg;
1568
+ }
1569
+
1570
+ /* parse_listitem • parsing of a single list item */
1571
+ /* assuming initial prefix is already removed */
1572
+ static size_t
1573
+ parse_listitem(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int *flags)
1574
+ {
1575
+ struct buf *work = 0, *inter = 0;
1576
+ size_t beg = 0, end, pre, sublist = 0, orgpre = 0, i;
1577
+ int in_empty = 0, has_inside_empty = 0;
1578
+ int has_next_uli, has_next_oli;
1579
+
1580
+ /* keeping track of the first indentation prefix */
1581
+ while (orgpre < 3 && orgpre < size && data[orgpre] == ' ')
1582
+ orgpre++;
1583
+
1584
+ beg = prefix_uli(data, size);
1585
+ if (!beg)
1586
+ beg = prefix_oli(data, size);
1587
+
1588
+ if (!beg)
1589
+ return 0;
1590
+
1591
+ /* skipping to the beginning of the following line */
1592
+ end = beg;
1593
+ while (end < size && data[end - 1] != '\n')
1594
+ end++;
1595
+
1596
+ /* getting working buffers */
1597
+ work = rndr_newbuf(rndr, BUFFER_SPAN);
1598
+ inter = rndr_newbuf(rndr, BUFFER_SPAN);
1599
+
1600
+ /* putting the first line into the working buffer */
1601
+ bufput(work, data + beg, end - beg);
1602
+ beg = end;
1603
+
1604
+ /* process the following lines */
1605
+ while (beg < size) {
1606
+ end++;
1607
+
1608
+ while (end < size && data[end - 1] != '\n')
1609
+ end++;
1610
+
1611
+ /* process an empty line */
1612
+ if (is_empty(data + beg, end - beg)) {
1613
+ in_empty = 1;
1614
+ beg = end;
1615
+ continue;
1616
+ }
1617
+
1618
+ /* calculating the indentation */
1619
+ i = 0;
1620
+ while (i < 4 && beg + i < end && data[beg + i] == ' ')
1621
+ i++;
1622
+
1623
+ pre = i;
1624
+
1625
+ has_next_uli = prefix_uli(data + beg + i, end - beg - i);
1626
+ has_next_oli = prefix_oli(data + beg + i, end - beg - i);
1627
+
1628
+ /* checking for ul/ol switch */
1629
+ if (in_empty && (
1630
+ ((*flags & MKD_LIST_ORDERED) && has_next_uli) ||
1631
+ (!(*flags & MKD_LIST_ORDERED) && has_next_oli)
1632
+ )){
1633
+ *flags |= MKD_LI_END;
1634
+ break; /* the following item must have same list type */
1635
+ }
1636
+
1637
+ /* checking for a new item */
1638
+ if ((has_next_uli && !is_hrule(data + beg + i, end - beg - i)) || has_next_oli) {
1639
+ if (in_empty)
1640
+ has_inside_empty = 1;
1641
+
1642
+ if (pre == orgpre) /* the following item must have */
1643
+ break; /* the same indentation */
1644
+
1645
+ if (!sublist)
1646
+ sublist = work->size;
1647
+ }
1648
+ /* joining only indented stuff after empty lines */
1649
+ else if (in_empty && i < 4) {
1650
+ *flags |= MKD_LI_END;
1651
+ break;
1652
+ }
1653
+ else if (in_empty) {
1654
+ bufputc(work, '\n');
1655
+ has_inside_empty = 1;
1656
+ }
1657
+
1658
+ in_empty = 0;
1659
+
1660
+ /* adding the line without prefix into the working buffer */
1661
+ bufput(work, data + beg + i, end - beg - i);
1662
+ beg = end;
1663
+ }
1664
+
1665
+ /* render of li contents */
1666
+ if (has_inside_empty)
1667
+ *flags |= MKD_LI_BLOCK;
1668
+
1669
+ if (*flags & MKD_LI_BLOCK) {
1670
+ /* intermediate render of block li */
1671
+ if (sublist && sublist < work->size) {
1672
+ parse_block(inter, rndr, work->data, sublist);
1673
+ parse_block(inter, rndr, work->data + sublist, work->size - sublist);
1674
+ }
1675
+ else
1676
+ parse_block(inter, rndr, work->data, work->size);
1677
+ } else {
1678
+ /* intermediate render of inline li */
1679
+ if (sublist && sublist < work->size) {
1680
+ parse_inline(inter, rndr, work->data, sublist);
1681
+ parse_block(inter, rndr, work->data + sublist, work->size - sublist);
1682
+ }
1683
+ else
1684
+ parse_inline(inter, rndr, work->data, work->size);
1685
+ }
1686
+
1687
+ /* render of li itself */
1688
+ if (rndr->cb.listitem)
1689
+ rndr->cb.listitem(ob, inter, *flags, rndr->opaque);
1690
+
1691
+ rndr_popbuf(rndr, BUFFER_SPAN);
1692
+ rndr_popbuf(rndr, BUFFER_SPAN);
1693
+ return beg;
1694
+ }
1695
+
1696
+
1697
+ /* parse_list • parsing ordered or unordered list block */
1698
+ static size_t
1699
+ parse_list(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int flags)
1700
+ {
1701
+ struct buf *work = 0;
1702
+ size_t i = 0, j;
1703
+
1704
+ work = rndr_newbuf(rndr, BUFFER_BLOCK);
1705
+
1706
+ while (i < size) {
1707
+ j = parse_listitem(work, rndr, data + i, size - i, &flags);
1708
+ i += j;
1709
+
1710
+ if (!j || (flags & MKD_LI_END))
1711
+ break;
1712
+ }
1713
+
1714
+ if (rndr->cb.list)
1715
+ rndr->cb.list(ob, work, flags, rndr->opaque);
1716
+ rndr_popbuf(rndr, BUFFER_BLOCK);
1717
+ return i;
1718
+ }
1719
+
1720
+ /* parse_atxheader • parsing of atx-style headers */
1721
+ static size_t
1722
+ parse_atxheader(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
1723
+ {
1724
+ size_t level = 0;
1725
+ size_t i, end, skip;
1726
+
1727
+ while (level < size && level < 6 && data[level] == '#')
1728
+ level++;
1729
+
1730
+ for (i = level; i < size && data[i] == ' '; i++);
1731
+
1732
+ for (end = i; end < size && data[end] != '\n'; end++);
1733
+ skip = end;
1734
+
1735
+ while (end && data[end - 1] == '#')
1736
+ end--;
1737
+
1738
+ while (end && data[end - 1] == ' ')
1739
+ end--;
1740
+
1741
+ if (end > i) {
1742
+ struct buf *work = rndr_newbuf(rndr, BUFFER_SPAN);
1743
+
1744
+ parse_inline(work, rndr, data + i, end - i);
1745
+
1746
+ if (rndr->cb.header)
1747
+ rndr->cb.header(ob, work, (int)level, rndr->opaque);
1748
+
1749
+ rndr_popbuf(rndr, BUFFER_SPAN);
1750
+ }
1751
+
1752
+ return skip;
1753
+ }
1754
+
1755
+
1756
+ /* htmlblock_end • checking end of HTML block : </tag>[ \t]*\n[ \t*]\n */
1757
+ /* returns the length on match, 0 otherwise */
1758
+ static size_t
1759
+ htmlblock_end(const char *tag, size_t tag_len, struct sd_markdown *rndr, uint8_t *data, size_t size)
1760
+ {
1761
+ size_t i, w;
1762
+
1763
+ /* checking if tag is a match */
1764
+ if (tag_len + 3 >= size ||
1765
+ strncasecmp((char *)data + 2, tag, tag_len) != 0 ||
1766
+ data[tag_len + 2] != '>')
1767
+ return 0;
1768
+
1769
+ /* checking white lines */
1770
+ i = tag_len + 3;
1771
+ w = 0;
1772
+ if (i < size && (w = is_empty(data + i, size - i)) == 0)
1773
+ return 0; /* non-blank after tag */
1774
+ i += w;
1775
+ w = 0;
1776
+
1777
+ if (rndr->ext_flags & MKDEXT_LAX_HTML_BLOCKS) {
1778
+ if (i < size)
1779
+ w = is_empty(data + i, size - i);
1780
+ } else {
1781
+ if (i < size && (w = is_empty(data + i, size - i)) == 0)
1782
+ return 0; /* non-blank line after tag line */
1783
+ }
1784
+
1785
+ return i + w;
1786
+ }
1787
+
1788
+
1789
+ /* parse_htmlblock • parsing of inline HTML block */
1790
+ static size_t
1791
+ parse_htmlblock(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int do_render)
1792
+ {
1793
+ size_t i, j = 0;
1794
+ const char *curtag = NULL;
1795
+ int found;
1796
+ struct buf work = { data, 0, 0, 0 };
1797
+
1798
+ /* identification of the opening tag */
1799
+ if (size < 2 || data[0] != '<')
1800
+ return 0;
1801
+
1802
+ i = 1;
1803
+ while (i < size && data[i] != '>' && data[i] != ' ')
1804
+ i++;
1805
+
1806
+ if (i < size)
1807
+ curtag = find_block_tag((char *)data + 1, i - 1);
1808
+
1809
+ /* handling of special cases */
1810
+ if (!curtag) {
1811
+
1812
+ /* HTML comment, laxist form */
1813
+ if (size > 5 && data[1] == '!' && data[2] == '-' && data[3] == '-') {
1814
+ i = 5;
1815
+
1816
+ while (i < size && !(data[i - 2] == '-' && data[i - 1] == '-' && data[i] == '>'))
1817
+ i++;
1818
+
1819
+ i++;
1820
+
1821
+ if (i < size)
1822
+ j = is_empty(data + i, size - i);
1823
+
1824
+ if (j) {
1825
+ work.size = i + j;
1826
+ if (do_render && rndr->cb.blockhtml)
1827
+ rndr->cb.blockhtml(ob, &work, rndr->opaque);
1828
+ return work.size;
1829
+ }
1830
+ }
1831
+
1832
+ /* HR, which is the only self-closing block tag considered */
1833
+ if (size > 4 && (data[1] == 'h' || data[1] == 'H') && (data[2] == 'r' || data[2] == 'R')) {
1834
+ i = 3;
1835
+ while (i < size && data[i] != '>')
1836
+ i++;
1837
+
1838
+ if (i + 1 < size) {
1839
+ i++;
1840
+ j = is_empty(data + i, size - i);
1841
+ if (j) {
1842
+ work.size = i + j;
1843
+ if (do_render && rndr->cb.blockhtml)
1844
+ rndr->cb.blockhtml(ob, &work, rndr->opaque);
1845
+ return work.size;
1846
+ }
1847
+ }
1848
+ }
1849
+
1850
+ /* no special case recognised */
1851
+ return 0;
1852
+ }
1853
+
1854
+ /* looking for an unindented matching closing tag */
1855
+ /* followed by a blank line */
1856
+ i = 1;
1857
+ found = 0;
1858
+
1859
+ /* if not found, trying a second pass looking for indented match */
1860
+ /* but not if tag is "ins" or "del" (following original Markdown.pl) */
1861
+ if (strcmp(curtag, "ins") != 0 && strcmp(curtag, "del") != 0) {
1862
+ size_t tag_size = strlen(curtag);
1863
+ i = 1;
1864
+ while (i < size) {
1865
+ i++;
1866
+ while (i < size && !(data[i - 1] == '<' && data[i] == '/'))
1867
+ i++;
1868
+
1869
+ if (i + 2 + tag_size >= size)
1870
+ break;
1871
+
1872
+ j = htmlblock_end(curtag, tag_size, rndr, data + i - 1, size - i + 1);
1873
+
1874
+ if (j) {
1875
+ i += j - 1;
1876
+ found = 1;
1877
+ break;
1878
+ }
1879
+ }
1880
+ }
1881
+
1882
+ if (!found) return 0;
1883
+
1884
+ /* the end of the block has been found */
1885
+ work.size = i;
1886
+ if (do_render && rndr->cb.blockhtml)
1887
+ rndr->cb.blockhtml(ob, &work, rndr->opaque);
1888
+
1889
+ return i;
1890
+ }
1891
+
1892
+ static void
1893
+ parse_table_row(
1894
+ struct buf *ob,
1895
+ struct sd_markdown *rndr,
1896
+ uint8_t *data,
1897
+ size_t size,
1898
+ size_t columns,
1899
+ int *col_data,
1900
+ int header_flag)
1901
+ {
1902
+ size_t i = 0, col;
1903
+ struct buf *row_work = 0;
1904
+
1905
+ if (!rndr->cb.table_cell || !rndr->cb.table_row)
1906
+ return;
1907
+
1908
+ row_work = rndr_newbuf(rndr, BUFFER_SPAN);
1909
+
1910
+ if (i < size && data[i] == '|')
1911
+ i++;
1912
+
1913
+ for (col = 0; col < columns && i < size; ++col) {
1914
+ size_t cell_start, cell_end;
1915
+ struct buf *cell_work;
1916
+
1917
+ cell_work = rndr_newbuf(rndr, BUFFER_SPAN);
1918
+
1919
+ while (i < size && _isspace(data[i]))
1920
+ i++;
1921
+
1922
+ cell_start = i;
1923
+
1924
+ while (i < size && data[i] != '|')
1925
+ i++;
1926
+
1927
+ cell_end = i - 1;
1928
+
1929
+ while (cell_end > cell_start && _isspace(data[cell_end]))
1930
+ cell_end--;
1931
+
1932
+ parse_inline(cell_work, rndr, data + cell_start, 1 + cell_end - cell_start);
1933
+ rndr->cb.table_cell(row_work, cell_work, col_data[col] | header_flag, rndr->opaque);
1934
+
1935
+ rndr_popbuf(rndr, BUFFER_SPAN);
1936
+ i++;
1937
+ }
1938
+
1939
+ for (; col < columns; ++col) {
1940
+ struct buf empty_cell = { 0, 0, 0, 0 };
1941
+ rndr->cb.table_cell(row_work, &empty_cell, col_data[col] | header_flag, rndr->opaque);
1942
+ }
1943
+
1944
+ rndr->cb.table_row(ob, row_work, rndr->opaque);
1945
+
1946
+ rndr_popbuf(rndr, BUFFER_SPAN);
1947
+ }
1948
+
1949
+ static size_t
1950
+ parse_table_header(
1951
+ struct buf *ob,
1952
+ struct sd_markdown *rndr,
1953
+ uint8_t *data,
1954
+ size_t size,
1955
+ size_t *columns,
1956
+ int **column_data)
1957
+ {
1958
+ int pipes;
1959
+ size_t i = 0, col, header_end, under_end;
1960
+
1961
+ pipes = 0;
1962
+ while (i < size && data[i] != '\n')
1963
+ if (data[i++] == '|')
1964
+ pipes++;
1965
+
1966
+ if (i == size || pipes == 0)
1967
+ return 0;
1968
+
1969
+ header_end = i;
1970
+
1971
+ if (data[0] == '|')
1972
+ pipes--;
1973
+
1974
+ if (i > 2 && data[i - 1] == '|')
1975
+ pipes--;
1976
+
1977
+ *columns = pipes + 1;
1978
+ *column_data = calloc(*columns, sizeof(int));
1979
+
1980
+ /* Parse the header underline */
1981
+ i++;
1982
+ if (i < size && data[i] == '|')
1983
+ i++;
1984
+
1985
+ under_end = i;
1986
+ while (under_end < size && data[under_end] != '\n')
1987
+ under_end++;
1988
+
1989
+ for (col = 0; col < *columns && i < under_end; ++col) {
1990
+ size_t dashes = 0;
1991
+
1992
+ while (i < under_end && data[i] == ' ')
1993
+ i++;
1994
+
1995
+ if (data[i] == ':') {
1996
+ i++; (*column_data)[col] |= MKD_TABLE_ALIGN_L;
1997
+ dashes++;
1998
+ }
1999
+
2000
+ while (i < under_end && data[i] == '-') {
2001
+ i++; dashes++;
2002
+ }
2003
+
2004
+ if (i < under_end && data[i] == ':') {
2005
+ i++; (*column_data)[col] |= MKD_TABLE_ALIGN_R;
2006
+ dashes++;
2007
+ }
2008
+
2009
+ while (i < under_end && data[i] == ' ')
2010
+ i++;
2011
+
2012
+ if (i < under_end && data[i] != '|')
2013
+ break;
2014
+
2015
+ if (dashes < 3)
2016
+ break;
2017
+
2018
+ i++;
2019
+ }
2020
+
2021
+ if (col < *columns)
2022
+ return 0;
2023
+
2024
+ parse_table_row(
2025
+ ob, rndr, data,
2026
+ header_end,
2027
+ *columns,
2028
+ *column_data,
2029
+ MKD_TABLE_HEADER
2030
+ );
2031
+
2032
+ return under_end + 1;
2033
+ }
2034
+
2035
+ static size_t
2036
+ parse_table(
2037
+ struct buf *ob,
2038
+ struct sd_markdown *rndr,
2039
+ uint8_t *data,
2040
+ size_t size)
2041
+ {
2042
+ size_t i;
2043
+
2044
+ struct buf *header_work = 0;
2045
+ struct buf *body_work = 0;
2046
+
2047
+ size_t columns;
2048
+ int *col_data = NULL;
2049
+
2050
+ header_work = rndr_newbuf(rndr, BUFFER_SPAN);
2051
+ body_work = rndr_newbuf(rndr, BUFFER_BLOCK);
2052
+
2053
+ i = parse_table_header(header_work, rndr, data, size, &columns, &col_data);
2054
+ if (i > 0) {
2055
+
2056
+ while (i < size) {
2057
+ size_t row_start;
2058
+ int pipes = 0;
2059
+
2060
+ row_start = i;
2061
+
2062
+ while (i < size && data[i] != '\n')
2063
+ if (data[i++] == '|')
2064
+ pipes++;
2065
+
2066
+ if (pipes == 0 || i == size) {
2067
+ i = row_start;
2068
+ break;
2069
+ }
2070
+
2071
+ parse_table_row(
2072
+ body_work,
2073
+ rndr,
2074
+ data + row_start,
2075
+ i - row_start,
2076
+ columns,
2077
+ col_data, 0
2078
+ );
2079
+
2080
+ i++;
2081
+ }
2082
+
2083
+ if (rndr->cb.table)
2084
+ rndr->cb.table(ob, header_work, body_work, rndr->opaque);
2085
+ }
2086
+
2087
+ free(col_data);
2088
+ rndr_popbuf(rndr, BUFFER_SPAN);
2089
+ rndr_popbuf(rndr, BUFFER_BLOCK);
2090
+ return i;
2091
+ }
2092
+
2093
+ /* parse_block • parsing of one block, returning next uint8_t to parse */
2094
+ static void
2095
+ parse_block(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)
2096
+ {
2097
+ size_t beg, end, i;
2098
+ uint8_t *txt_data;
2099
+ beg = 0;
2100
+
2101
+ if (rndr->work_bufs[BUFFER_SPAN].size +
2102
+ rndr->work_bufs[BUFFER_BLOCK].size > rndr->max_nesting)
2103
+ return;
2104
+
2105
+ while (beg < size) {
2106
+ txt_data = data + beg;
2107
+ end = size - beg;
2108
+
2109
+ if (is_atxheader(rndr, txt_data, end))
2110
+ beg += parse_atxheader(ob, rndr, txt_data, end);
2111
+
2112
+ else if (data[beg] == '<' && rndr->cb.blockhtml &&
2113
+ (i = parse_htmlblock(ob, rndr, txt_data, end, 1)) != 0)
2114
+ beg += i;
2115
+
2116
+ else if ((i = is_empty(txt_data, end)) != 0)
2117
+ beg += i;
2118
+
2119
+ else if (is_hrule(txt_data, end)) {
2120
+ if (rndr->cb.hrule)
2121
+ rndr->cb.hrule(ob, rndr->opaque);
2122
+
2123
+ while (beg < size && data[beg] != '\n')
2124
+ beg++;
2125
+
2126
+ beg++;
2127
+ }
2128
+
2129
+ else if ((rndr->ext_flags & MKDEXT_FENCED_CODE) != 0 &&
2130
+ (i = parse_fencedcode(ob, rndr, txt_data, end)) != 0)
2131
+ beg += i;
2132
+
2133
+ else if ((rndr->ext_flags & MKDEXT_TABLES) != 0 &&
2134
+ (i = parse_table(ob, rndr, txt_data, end)) != 0)
2135
+ beg += i;
2136
+
2137
+ else if (prefix_quote(txt_data, end))
2138
+ beg += parse_blockquote(ob, rndr, txt_data, end);
2139
+
2140
+ else if (prefix_code(txt_data, end))
2141
+ beg += parse_blockcode(ob, rndr, txt_data, end);
2142
+
2143
+ else if (prefix_uli(txt_data, end))
2144
+ beg += parse_list(ob, rndr, txt_data, end, 0);
2145
+
2146
+ else if (prefix_oli(txt_data, end))
2147
+ beg += parse_list(ob, rndr, txt_data, end, MKD_LIST_ORDERED);
2148
+
2149
+ else
2150
+ beg += parse_paragraph(ob, rndr, txt_data, end);
2151
+ }
2152
+ }
2153
+
2154
+
2155
+
2156
+ /*********************
2157
+ * REFERENCE PARSING *
2158
+ *********************/
2159
+
2160
+ /* is_ref • returns whether a line is a reference or not */
2161
+ static int
2162
+ is_ref(const uint8_t *data, size_t beg, size_t end, size_t *last, struct link_ref **refs)
2163
+ {
2164
+ /* int n; */
2165
+ size_t i = 0;
2166
+ size_t id_offset, id_end;
2167
+ size_t link_offset, link_end;
2168
+ size_t title_offset, title_end;
2169
+ size_t line_end;
2170
+
2171
+ /* up to 3 optional leading spaces */
2172
+ if (beg + 3 >= end) return 0;
2173
+ if (data[beg] == ' ') { i = 1;
2174
+ if (data[beg + 1] == ' ') { i = 2;
2175
+ if (data[beg + 2] == ' ') { i = 3;
2176
+ if (data[beg + 3] == ' ') return 0; } } }
2177
+ i += beg;
2178
+
2179
+ /* id part: anything but a newline between brackets */
2180
+ if (data[i] != '[') return 0;
2181
+ i++;
2182
+ id_offset = i;
2183
+ while (i < end && data[i] != '\n' && data[i] != '\r' && data[i] != ']')
2184
+ i++;
2185
+ if (i >= end || data[i] != ']') return 0;
2186
+ id_end = i;
2187
+
2188
+ /* spacer: colon (space | tab)* newline? (space | tab)* */
2189
+ i++;
2190
+ if (i >= end || data[i] != ':') return 0;
2191
+ i++;
2192
+ while (i < end && data[i] == ' ') i++;
2193
+ if (i < end && (data[i] == '\n' || data[i] == '\r')) {
2194
+ i++;
2195
+ if (i < end && data[i] == '\r' && data[i - 1] == '\n') i++; }
2196
+ while (i < end && data[i] == ' ') i++;
2197
+ if (i >= end) return 0;
2198
+
2199
+ /* link: whitespace-free sequence, optionally between angle brackets */
2200
+ if (data[i] == '<')
2201
+ i++;
2202
+
2203
+ link_offset = i;
2204
+
2205
+ while (i < end && data[i] != ' ' && data[i] != '\n' && data[i] != '\r')
2206
+ i++;
2207
+
2208
+ if (data[i - 1] == '>') link_end = i - 1;
2209
+ else link_end = i;
2210
+
2211
+ /* optional spacer: (space | tab)* (newline | '\'' | '"' | '(' ) */
2212
+ while (i < end && data[i] == ' ') i++;
2213
+ if (i < end && data[i] != '\n' && data[i] != '\r'
2214
+ && data[i] != '\'' && data[i] != '"' && data[i] != '(')
2215
+ return 0;
2216
+ line_end = 0;
2217
+ /* computing end-of-line */
2218
+ if (i >= end || data[i] == '\r' || data[i] == '\n') line_end = i;
2219
+ if (i + 1 < end && data[i] == '\n' && data[i + 1] == '\r')
2220
+ line_end = i + 1;
2221
+
2222
+ /* optional (space|tab)* spacer after a newline */
2223
+ if (line_end) {
2224
+ i = line_end + 1;
2225
+ while (i < end && data[i] == ' ') i++; }
2226
+
2227
+ /* optional title: any non-newline sequence enclosed in '"()
2228
+ alone on its line */
2229
+ title_offset = title_end = 0;
2230
+ if (i + 1 < end
2231
+ && (data[i] == '\'' || data[i] == '"' || data[i] == '(')) {
2232
+ i++;
2233
+ title_offset = i;
2234
+ /* looking for EOL */
2235
+ while (i < end && data[i] != '\n' && data[i] != '\r') i++;
2236
+ if (i + 1 < end && data[i] == '\n' && data[i + 1] == '\r')
2237
+ title_end = i + 1;
2238
+ else title_end = i;
2239
+ /* stepping back */
2240
+ i -= 1;
2241
+ while (i > title_offset && data[i] == ' ')
2242
+ i -= 1;
2243
+ if (i > title_offset
2244
+ && (data[i] == '\'' || data[i] == '"' || data[i] == ')')) {
2245
+ line_end = title_end;
2246
+ title_end = i; } }
2247
+
2248
+ if (!line_end)
2249
+ return 0; /* garbage after the link */
2250
+
2251
+ /* a valid ref has been found, filling-in return structures */
2252
+ if (last)
2253
+ *last = line_end;
2254
+
2255
+ if (refs) {
2256
+ struct link_ref *ref;
2257
+
2258
+ ref = add_link_ref(refs, data + id_offset, id_end - id_offset);
2259
+
2260
+ ref->link = bufnew(link_end - link_offset);
2261
+ bufput(ref->link, data + link_offset, link_end - link_offset);
2262
+
2263
+ if (title_end > title_offset) {
2264
+ ref->title = bufnew(title_end - title_offset);
2265
+ bufput(ref->title, data + title_offset, title_end - title_offset);
2266
+ }
2267
+ }
2268
+
2269
+ return 1;
2270
+ }
2271
+
2272
+ static void expand_tabs(struct buf *ob, const uint8_t *line, size_t size)
2273
+ {
2274
+ size_t i = 0, tab = 0;
2275
+
2276
+ while (i < size) {
2277
+ size_t org = i;
2278
+
2279
+ while (i < size && line[i] != '\t') {
2280
+ i++; tab++;
2281
+ }
2282
+
2283
+ if (i > org)
2284
+ bufput(ob, line + org, i - org);
2285
+
2286
+ if (i >= size)
2287
+ break;
2288
+
2289
+ do {
2290
+ bufputc(ob, ' '); tab++;
2291
+ } while (tab % 4);
2292
+
2293
+ i++;
2294
+ }
2295
+ }
2296
+
2297
+ /**********************
2298
+ * EXPORTED FUNCTIONS *
2299
+ **********************/
2300
+
2301
+ struct sd_markdown *
2302
+ sd_markdown_new(
2303
+ unsigned int extensions,
2304
+ size_t max_nesting,
2305
+ const struct sd_callbacks *callbacks,
2306
+ void *opaque)
2307
+ {
2308
+ struct sd_markdown *md = NULL;
2309
+
2310
+ assert(max_nesting > 0 && callbacks);
2311
+
2312
+ md = malloc(sizeof(struct sd_markdown));
2313
+ if (!md)
2314
+ return NULL;
2315
+
2316
+ memcpy(&md->cb, callbacks, sizeof(struct sd_callbacks));
2317
+
2318
+ stack_init(&md->work_bufs[BUFFER_BLOCK], 4);
2319
+ stack_init(&md->work_bufs[BUFFER_SPAN], 8);
2320
+
2321
+ memset(md->active_char, 0x0, 256);
2322
+
2323
+ if (md->cb.emphasis || md->cb.double_emphasis || md->cb.triple_emphasis) {
2324
+ md->active_char['*'] = MD_CHAR_EMPHASIS;
2325
+ md->active_char['_'] = MD_CHAR_EMPHASIS;
2326
+ if (extensions & MKDEXT_STRIKETHROUGH)
2327
+ md->active_char['~'] = MD_CHAR_EMPHASIS;
2328
+ }
2329
+
2330
+ if (md->cb.codespan)
2331
+ md->active_char['`'] = MD_CHAR_CODESPAN;
2332
+
2333
+ if (md->cb.linebreak)
2334
+ md->active_char['\n'] = MD_CHAR_LINEBREAK;
2335
+
2336
+ if (md->cb.image || md->cb.link)
2337
+ md->active_char['['] = MD_CHAR_LINK;
2338
+
2339
+ md->active_char['<'] = MD_CHAR_LANGLE;
2340
+ md->active_char['\\'] = MD_CHAR_ESCAPE;
2341
+ md->active_char['&'] = MD_CHAR_ENTITITY;
2342
+
2343
+ if (extensions & MKDEXT_AUTOLINK) {
2344
+ md->active_char[':'] = MD_CHAR_AUTOLINK_URL;
2345
+ md->active_char['@'] = MD_CHAR_AUTOLINK_EMAIL;
2346
+ md->active_char['w'] = MD_CHAR_AUTOLINK_WWW;
2347
+ }
2348
+
2349
+ if (extensions & MKDEXT_SUPERSCRIPT)
2350
+ md->active_char['^'] = MD_CHAR_SUPERSCRIPT;
2351
+
2352
+ /* Extension data */
2353
+ md->ext_flags = extensions;
2354
+ md->opaque = opaque;
2355
+ md->max_nesting = max_nesting;
2356
+ md->in_link_body = 0;
2357
+
2358
+ return md;
2359
+ }
2360
+
2361
+ void
2362
+ sd_markdown_render(struct buf *ob, const uint8_t *document, size_t doc_size, struct sd_markdown *md)
2363
+ {
2364
+ static const float MARKDOWN_GROW_FACTOR = 1.4f;
2365
+
2366
+ struct buf *text;
2367
+ size_t beg, end;
2368
+
2369
+ text = bufnew(64);
2370
+ if (!text)
2371
+ return;
2372
+
2373
+ /* Preallocate enough space for our buffer to avoid expanding while copying */
2374
+ bufgrow(text, doc_size);
2375
+
2376
+ /* reset the references table */
2377
+ memset(&md->refs, 0x0, REF_TABLE_SIZE * sizeof(void *));
2378
+
2379
+ /* first pass: looking for references, copying everything else */
2380
+ beg = 0;
2381
+ while (beg < doc_size) /* iterating over lines */
2382
+ if (is_ref(document, beg, doc_size, &end, md->refs))
2383
+ beg = end;
2384
+ else { /* skipping to the next line */
2385
+ end = beg;
2386
+ while (end < doc_size && document[end] != '\n' && document[end] != '\r')
2387
+ end++;
2388
+
2389
+ /* adding the line body if present */
2390
+ if (end > beg)
2391
+ expand_tabs(text, document + beg, end - beg);
2392
+
2393
+ while (end < doc_size && (document[end] == '\n' || document[end] == '\r')) {
2394
+ /* add one \n per newline */
2395
+ if (document[end] == '\n' || (end + 1 < doc_size && document[end + 1] != '\n'))
2396
+ bufputc(text, '\n');
2397
+ end++;
2398
+ }
2399
+
2400
+ beg = end;
2401
+ }
2402
+
2403
+ /* pre-grow the output buffer to minimize allocations */
2404
+ bufgrow(ob, text->size * MARKDOWN_GROW_FACTOR);
2405
+
2406
+ /* second pass: actual rendering */
2407
+ if (md->cb.doc_header)
2408
+ md->cb.doc_header(ob, md->opaque);
2409
+
2410
+ if (text->size) {
2411
+ /* adding a final newline if not already present */
2412
+ if (text->data[text->size - 1] != '\n' && text->data[text->size - 1] != '\r')
2413
+ bufputc(text, '\n');
2414
+
2415
+ parse_block(ob, md, text->data, text->size);
2416
+ }
2417
+
2418
+ if (md->cb.doc_footer)
2419
+ md->cb.doc_footer(ob, md->opaque);
2420
+
2421
+ /* clean-up */
2422
+ bufrelease(text);
2423
+ free_link_refs(md->refs);
2424
+
2425
+ assert(md->work_bufs[BUFFER_SPAN].size == 0);
2426
+ assert(md->work_bufs[BUFFER_BLOCK].size == 0);
2427
+ }
2428
+
2429
+ void
2430
+ sd_markdown_free(struct sd_markdown *md)
2431
+ {
2432
+ size_t i;
2433
+
2434
+ for (i = 0; i < (size_t)md->work_bufs[BUFFER_SPAN].asize; ++i)
2435
+ bufrelease(md->work_bufs[BUFFER_SPAN].item[i]);
2436
+
2437
+ for (i = 0; i < (size_t)md->work_bufs[BUFFER_BLOCK].asize; ++i)
2438
+ bufrelease(md->work_bufs[BUFFER_BLOCK].item[i]);
2439
+
2440
+ stack_free(&md->work_bufs[BUFFER_SPAN]);
2441
+ stack_free(&md->work_bufs[BUFFER_BLOCK]);
2442
+
2443
+ free(md);
2444
+ }
2445
+
2446
+ void
2447
+ sd_version(int *ver_major, int *ver_minor, int *ver_revision)
2448
+ {
2449
+ *ver_major = UPSKIRT_VER_MAJOR;
2450
+ *ver_minor = UPSKIRT_VER_MINOR;
2451
+ *ver_revision = UPSKIRT_VER_REVISION;
2452
+ }
2453
+
2454
+ /* vim: set filetype=c: */