redcarpet 1.5.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.
data/ext/markdown.c DELETED
@@ -1,2076 +0,0 @@
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
-
22
- #include "array.h"
23
-
24
- #include <assert.h>
25
- #include <string.h>
26
- #include <strings.h> /* for strncasecmp */
27
-
28
- #define TEXT_UNIT 64 /* unit for the copy of the input buffer */
29
- #define WORK_UNIT 64 /* block-level working buffer */
30
-
31
- #define MKD_LI_END 8 /* internal list flag */
32
-
33
- /***************
34
- * LOCAL TYPES *
35
- ***************/
36
-
37
- /* link_ref • reference to a link */
38
- struct link_ref {
39
- struct buf *id;
40
- struct buf *link;
41
- struct buf *title;
42
- };
43
-
44
- /* char_trigger • function pointer to render active chars */
45
- /* returns the number of chars taken care of */
46
- /* data is the pointer of the beginning of the span */
47
- /* offset is the number of valid chars before data */
48
- struct render;
49
- typedef size_t
50
- (*char_trigger)(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size);
51
-
52
-
53
- /* render • structure containing one particular render */
54
- struct render {
55
- struct mkd_renderer make;
56
- struct array refs;
57
- char_trigger active_char[256];
58
- struct parray work;
59
- unsigned int ext_flags;
60
- size_t max_nesting;
61
- };
62
-
63
- /* html_tag • structure for quick HTML tag search (inspired from discount) */
64
- struct html_tag {
65
- const char *text;
66
- size_t size;
67
- };
68
-
69
- /********************
70
- * GLOBAL VARIABLES *
71
- ********************/
72
-
73
- /* block_tags • recognised block tags, sorted by cmp_html_tag */
74
- static struct html_tag block_tags[] = {
75
- /*0*/ { "p", 1 },
76
- { "dl", 2 },
77
- { "h1", 2 },
78
- { "h2", 2 },
79
- { "h3", 2 },
80
- { "h4", 2 },
81
- { "h5", 2 },
82
- { "h6", 2 },
83
- { "ol", 2 },
84
- { "ul", 2 },
85
- /*10*/ { "del", 3 },
86
- { "div", 3 },
87
- /*12*/ { "ins", 3 },
88
- { "pre", 3 },
89
- { "form", 4 },
90
- { "math", 4 },
91
- { "table", 5 },
92
- { "iframe", 6 },
93
- { "script", 6 },
94
- { "fieldset", 8 },
95
- { "noscript", 8 },
96
- { "blockquote", 10 }
97
- };
98
-
99
- #define INS_TAG (block_tags + 12)
100
- #define DEL_TAG (block_tags + 10)
101
-
102
- /***************************
103
- * STATIC HELPER FUNCTIONS *
104
- ***************************/
105
-
106
- /* cmp_link_ref • comparison function for link_ref sorted arrays */
107
- static int
108
- cmp_link_ref(void *key, void *array_entry)
109
- {
110
- struct link_ref *lr = array_entry;
111
- return bufcasecmp(key, lr->id);
112
- }
113
-
114
- /* cmp_link_ref_sort • comparison function for link_ref qsort */
115
- static int
116
- cmp_link_ref_sort(const void *a, const void *b)
117
- {
118
- const struct link_ref *lra = a;
119
- const struct link_ref *lrb = b;
120
- return bufcasecmp(lra->id, lrb->id);
121
- }
122
-
123
- /* cmp_html_tag • comparison function for bsearch() (stolen from discount) */
124
- static int
125
- cmp_html_tag(const void *a, const void *b)
126
- {
127
- const struct html_tag *hta = a;
128
- const struct html_tag *htb = b;
129
- if (hta->size != htb->size) return (int)((ssize_t)hta->size - (ssize_t)htb->size);
130
- return strncasecmp(hta->text, htb->text, hta->size);
131
- }
132
-
133
-
134
- /* find_block_tag • returns the current block tag */
135
- static struct html_tag *
136
- find_block_tag(char *data, size_t size)
137
- {
138
- size_t i = 0;
139
- struct html_tag key;
140
-
141
- /* looking for the word end */
142
- while (i < size && ((data[i] >= '0' && data[i] <= '9')
143
- || (data[i] >= 'A' && data[i] <= 'Z')
144
- || (data[i] >= 'a' && data[i] <= 'z')))
145
- i += 1;
146
- if (i >= size) return 0;
147
-
148
- /* binary search of the tag */
149
- key.text = data;
150
- key.size = i;
151
- return bsearch(&key, block_tags,
152
- sizeof block_tags / sizeof block_tags[0],
153
- sizeof block_tags[0], cmp_html_tag);
154
- }
155
-
156
- /****************************
157
- * INLINE PARSING FUNCTIONS *
158
- ****************************/
159
-
160
- /* is_mail_autolink • looks for the address part of a mail autolink and '>' */
161
- /* this is less strict than the original markdown e-mail address matching */
162
- static size_t
163
- is_mail_autolink(char *data, size_t size)
164
- {
165
- size_t i = 0, nb = 0;
166
- /* address is assumed to be: [-@._a-zA-Z0-9]+ with exactly one '@' */
167
- while (i < size && (data[i] == '-' || data[i] == '.'
168
- || data[i] == '_' || data[i] == '@'
169
- || (data[i] >= 'a' && data[i] <= 'z')
170
- || (data[i] >= 'A' && data[i] <= 'Z')
171
- || (data[i] >= '0' && data[i] <= '9'))) {
172
- if (data[i] == '@') nb += 1;
173
- i += 1; }
174
- if (i >= size || data[i] != '>' || nb != 1) return 0;
175
- return i + 1;
176
- }
177
-
178
- /* tag_length • returns the length of the given tag, or 0 is it's not valid */
179
- static size_t
180
- tag_length(char *data, size_t size, enum mkd_autolink *autolink)
181
- {
182
- size_t i, j;
183
-
184
- /* a valid tag can't be shorter than 3 chars */
185
- if (size < 3) return 0;
186
-
187
- /* begins with a '<' optionally followed by '/', followed by letter */
188
- if (data[0] != '<') return 0;
189
- i = (data[1] == '/') ? 2 : 1;
190
- if ((data[i] < 'a' || data[i] > 'z')
191
- && (data[i] < 'A' || data[i] > 'Z')) return 0;
192
-
193
- /* scheme test */
194
- *autolink = MKDA_NOT_AUTOLINK;
195
-
196
- /* try to find the beggining of an URI */
197
- while (i < size && (isalpha(data[i]) || data[i] == '.' || data[i] == '+' || data[i] == '-'))
198
- i++;
199
-
200
- if (i > 2 && data[i] == ':') {
201
- *autolink = MKDA_NORMAL;
202
- i++;
203
- }
204
-
205
- /*
206
- * FIXME: check for double slashes after the URI id?
207
- * There are some protocols that don't have them, e.g.
208
- * news:resource
209
- */
210
-
211
- /* completing autolink test: no whitespace or ' or " */
212
- if (i >= size || i == '>')
213
- *autolink = MKDA_NOT_AUTOLINK;
214
- else if (*autolink) {
215
- j = i;
216
- while (i < size && data[i] != '>' && data[i] != '\''
217
- && data[i] != '"' && data[i] != ' ' && data[i] != '\t'
218
- && data[i] != '\t')
219
- i += 1;
220
- if (i >= size) return 0;
221
- if (i > j && data[i] == '>') return i + 1;
222
- /* one of the forbidden chars has been found */
223
- *autolink = MKDA_NOT_AUTOLINK; }
224
- else if ((j = is_mail_autolink(data + i, size - i)) != 0) {
225
- *autolink = (i == 8)
226
- ? MKDA_EXPLICIT_EMAIL : MKDA_IMPLICIT_EMAIL;
227
- return i + j; }
228
-
229
- /* looking for sometinhg looking like a tag end */
230
- while (i < size && data[i] != '>') i += 1;
231
- if (i >= size) return 0;
232
- return i + 1;
233
- }
234
-
235
- /* parse_inline • parses inline markdown elements */
236
- static void
237
- parse_inline(struct buf *ob, struct render *rndr, char *data, size_t size)
238
- {
239
- size_t i = 0, end = 0;
240
- char_trigger action = 0;
241
- struct buf work = { 0, 0, 0, 0, 0 };
242
-
243
- if (rndr->work.size > rndr->max_nesting)
244
- return;
245
-
246
- while (i < size) {
247
- /* copying inactive chars into the output */
248
- while (end < size && (action = rndr->active_char[(unsigned char)data[end]]) == 0)
249
- end++;
250
-
251
- if (rndr->make.normal_text) {
252
- work.data = data + i;
253
- work.size = end - i;
254
- rndr->make.normal_text(ob, &work, rndr->make.opaque);
255
- }
256
- else
257
- bufput(ob, data + i, end - i);
258
-
259
- if (end >= size) break;
260
- i = end;
261
-
262
- /* calling the trigger */
263
- end = action(ob, rndr, data + i, i, size - i);
264
- if (!end) /* no action from the callback */
265
- end = i + 1;
266
- else {
267
- i += end;
268
- end = i;
269
- }
270
- }
271
- }
272
-
273
- /* find_emph_char • looks for the next emph char, skipping other constructs */
274
- static size_t
275
- find_emph_char(char *data, size_t size, char c)
276
- {
277
- size_t i = 1;
278
-
279
- while (i < size) {
280
- while (i < size && data[i] != c
281
- && data[i] != '`' && data[i] != '[')
282
- i += 1;
283
- if (data[i] == c) return i;
284
-
285
- /* not counting escaped chars */
286
- if (i && data[i - 1] == '\\') { i += 1; continue; }
287
-
288
- /* skipping a code span */
289
- if (data[i] == '`') {
290
- size_t tmp_i = 0;
291
- i += 1;
292
- while (i < size && data[i] != '`') {
293
- if (!tmp_i && data[i] == c) tmp_i = i;
294
- i += 1; }
295
- if (i >= size) return tmp_i;
296
- i += 1; }
297
-
298
- /* skipping a link */
299
- else if (data[i] == '[') {
300
- size_t tmp_i = 0;
301
- char cc;
302
- i += 1;
303
- while (i < size && data[i] != ']') {
304
- if (!tmp_i && data[i] == c) tmp_i = i;
305
- i += 1; }
306
- i += 1;
307
- while (i < size && (data[i] == ' '
308
- || data[i] == '\t' || data[i] == '\n'))
309
- i += 1;
310
- if (i >= size) return tmp_i;
311
- if (data[i] != '[' && data[i] != '(') { /* not a link*/
312
- if (tmp_i) return tmp_i;
313
- else continue; }
314
- cc = data[i];
315
- i += 1;
316
- while (i < size && data[i] != cc) {
317
- if (!tmp_i && data[i] == c) tmp_i = i;
318
- i += 1; }
319
- if (i >= size) return tmp_i;
320
- i += 1; } }
321
- return 0;
322
- }
323
-
324
- /* parse_emph1 • parsing single emphase */
325
- /* closed by a symbol not preceded by whitespace and not followed by symbol */
326
- static size_t
327
- parse_emph1(struct buf *ob, struct render *rndr, char *data, size_t size, char c)
328
- {
329
- size_t i = 0, len;
330
- struct buf *work = 0;
331
- int r;
332
-
333
- if (!rndr->make.emphasis) return 0;
334
-
335
- /* skipping one symbol if coming from emph3 */
336
- if (size > 1 && data[0] == c && data[1] == c) i = 1;
337
-
338
- while (i < size) {
339
- len = find_emph_char(data + i, size - i, c);
340
- if (!len) return 0;
341
- i += len;
342
- if (i >= size) return 0;
343
-
344
- if (i + 1 < size && data[i + 1] == c) {
345
- i += 1;
346
- continue;
347
- }
348
-
349
- if (data[i] == c && !isspace(data[i - 1])) {
350
-
351
- if ((rndr->ext_flags & MKDEXT_LAX_EMPHASIS) == 0) {
352
- if (!(i + 1 == size || isspace(data[i + 1]) || ispunct(data[i + 1])))
353
- continue;
354
- }
355
-
356
- if (rndr->work.size < rndr->work.asize) {
357
- work = rndr->work.item[rndr->work.size ++];
358
- work->size = 0;
359
- } else {
360
- work = bufnew(WORK_UNIT);
361
- parr_push(&rndr->work, work);
362
- }
363
-
364
- parse_inline(work, rndr, data, i);
365
- r = rndr->make.emphasis(ob, work, c, rndr->make.opaque);
366
- rndr->work.size -= 1;
367
- return r ? i + 1 : 0;
368
- }
369
- }
370
-
371
- return 0;
372
- }
373
-
374
- /* parse_emph2 • parsing single emphase */
375
- static size_t
376
- parse_emph2(struct buf *ob, struct render *rndr, char *data, size_t size, char c)
377
- {
378
- size_t i = 0, len;
379
- struct buf *work = 0;
380
- int r;
381
-
382
- if (!rndr->make.double_emphasis)
383
- return 0;
384
-
385
- while (i < size) {
386
- len = find_emph_char(data + i, size - i, c);
387
- if (!len) return 0;
388
- i += len;
389
-
390
- if (i + 1 < size && data[i] == c && data[i + 1] == c && i && !isspace(data[i - 1])) {
391
- if (rndr->work.size < rndr->work.asize) {
392
- work = rndr->work.item[rndr->work.size ++];
393
- work->size = 0;
394
- } else {
395
- work = bufnew(WORK_UNIT);
396
- parr_push(&rndr->work, work);
397
- }
398
-
399
- parse_inline(work, rndr, data, i);
400
- r = rndr->make.double_emphasis(ob, work, c, rndr->make.opaque);
401
- rndr->work.size -= 1;
402
- return r ? i + 2 : 0;
403
- }
404
- i++;
405
- }
406
- return 0;
407
- }
408
-
409
- /* parse_emph3 • parsing single emphase */
410
- /* finds the first closing tag, and delegates to the other emph */
411
- static size_t
412
- parse_emph3(struct buf *ob, struct render *rndr, char *data, size_t size, char c)
413
- {
414
- size_t i = 0, len;
415
- int r;
416
-
417
- while (i < size) {
418
- len = find_emph_char(data + i, size - i, c);
419
- if (!len) return 0;
420
- i += len;
421
-
422
- /* skip whitespace preceded symbols */
423
- if (data[i] != c || isspace(data[i - 1]))
424
- continue;
425
-
426
- if (i + 2 < size && data[i + 1] == c && data[i + 2] == c && rndr->make.triple_emphasis) {
427
- /* triple symbol found */
428
- struct buf *work = 0;
429
- if (rndr->work.size < rndr->work.asize) {
430
- work = rndr->work.item[rndr->work.size ++];
431
- work->size = 0;
432
- } else {
433
- work = bufnew(WORK_UNIT);
434
- parr_push(&rndr->work, work);
435
- }
436
-
437
- parse_inline(work, rndr, data, i);
438
- r = rndr->make.triple_emphasis(ob, work, c, rndr->make.opaque);
439
- rndr->work.size -= 1;
440
- return r ? i + 3 : 0;
441
-
442
- } else if (i + 1 < size && data[i + 1] == c) {
443
- /* double symbol found, handing over to emph1 */
444
- len = parse_emph1(ob, rndr, data - 2, size + 2, c);
445
- if (!len) return 0;
446
- else return len - 2;
447
-
448
- } else {
449
- /* single symbol found, handing over to emph2 */
450
- len = parse_emph2(ob, rndr, data - 1, size + 1, c);
451
- if (!len) return 0;
452
- else return len - 1;
453
- }
454
- }
455
- return 0;
456
- }
457
-
458
- /* char_emphasis • single and double emphasis parsing */
459
- static size_t
460
- char_emphasis(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
461
- {
462
- char c = data[0];
463
- size_t ret;
464
-
465
- if (size > 2 && data[1] != c) {
466
- /* whitespace cannot follow an opening emphasis */
467
- if (isspace(data[1]) || (ret = parse_emph1(ob, rndr, data + 1, size - 1, c)) == 0)
468
- return 0;
469
-
470
- return ret + 1;
471
- }
472
-
473
- if (size > 3 && data[1] == c && data[2] != c) {
474
- if (isspace(data[2]) || (ret = parse_emph2(ob, rndr, data + 2, size - 2, c)) == 0)
475
- return 0;
476
-
477
- return ret + 2;
478
- }
479
-
480
- if (size > 4 && data[1] == c && data[2] == c && data[3] != c) {
481
- if (isspace(data[3]) || (ret = parse_emph3(ob, rndr, data + 3, size - 3, c)) == 0)
482
- return 0;
483
-
484
- return ret + 3;
485
- }
486
-
487
- return 0;
488
- }
489
-
490
-
491
- /* char_linebreak • '\n' preceded by two spaces (assuming linebreak != 0) */
492
- static size_t
493
- char_linebreak(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
494
- {
495
- if (offset < 2 || data[-1] != ' ' || data[-2] != ' ')
496
- return 0;
497
-
498
- /* removing the last space from ob and rendering */
499
- while (ob->size && ob->data[ob->size - 1] == ' ')
500
- ob->size--;
501
-
502
- return rndr->make.linebreak(ob, rndr->make.opaque) ? 1 : 0;
503
- }
504
-
505
-
506
- /* char_codespan • '`' parsing a code span (assuming codespan != 0) */
507
- static size_t
508
- char_codespan(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
509
- {
510
- size_t end, nb = 0, i, f_begin, f_end;
511
-
512
- /* counting the number of backticks in the delimiter */
513
- while (nb < size && data[nb] == '`')
514
- nb++;
515
-
516
- /* finding the next delimiter */
517
- i = 0;
518
- for (end = nb; end < size && i < nb; end++) {
519
- if (data[end] == '`') i++;
520
- else i = 0;
521
- }
522
-
523
- if (i < nb && end >= size)
524
- return 0; /* no matching delimiter */
525
-
526
- /* trimming outside whitespaces */
527
- f_begin = nb;
528
- while (f_begin < end && (data[f_begin] == ' ' || data[f_begin] == '\t'))
529
- f_begin++;
530
-
531
- f_end = end - nb;
532
- while (f_end > nb && (data[f_end-1] == ' ' || data[f_end-1] == '\t'))
533
- f_end--;
534
-
535
- /* real code span */
536
- if (f_begin < f_end) {
537
- struct buf work = { data + f_begin, f_end - f_begin, 0, 0, 0 };
538
- if (!rndr->make.codespan(ob, &work, rndr->make.opaque))
539
- end = 0;
540
- } else {
541
- if (!rndr->make.codespan(ob, 0, rndr->make.opaque))
542
- end = 0;
543
- }
544
-
545
- return end;
546
- }
547
-
548
-
549
- /* char_escape • '\\' backslash escape */
550
- static size_t
551
- char_escape(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
552
- {
553
- struct buf work = { 0, 0, 0, 0, 0 };
554
-
555
- if (size > 1) {
556
- if (rndr->make.normal_text) {
557
- work.data = data + 1;
558
- work.size = 1;
559
- rndr->make.normal_text(ob, &work, rndr->make.opaque);
560
- }
561
- else bufputc(ob, data[1]);
562
- }
563
-
564
- return 2;
565
- }
566
-
567
- /* char_entity • '&' escaped when it doesn't belong to an entity */
568
- /* valid entities are assumed to be anything mathing &#?[A-Za-z0-9]+; */
569
- static size_t
570
- char_entity(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
571
- {
572
- size_t end = 1;
573
- struct buf work;
574
-
575
- if (end < size && data[end] == '#')
576
- end++;
577
-
578
- while (end < size && isalnum(data[end]))
579
- end++;
580
-
581
- if (end < size && data[end] == ';')
582
- end += 1; /* real entity */
583
- else
584
- return 0; /* lone '&' */
585
-
586
- if (rndr->make.entity) {
587
- work.data = data;
588
- work.size = end;
589
- rndr->make.entity(ob, &work, rndr->make.opaque);
590
- }
591
- else bufput(ob, data, end);
592
-
593
- return end;
594
- }
595
-
596
- /* char_langle_tag • '<' when tags or autolinks are allowed */
597
- static size_t
598
- char_langle_tag(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
599
- {
600
- enum mkd_autolink altype = MKDA_NOT_AUTOLINK;
601
- size_t end = tag_length(data, size, &altype);
602
- struct buf work = { data, end, 0, 0, 0 };
603
- int ret = 0;
604
-
605
- if (end > 2) {
606
- if (rndr->make.autolink && altype != MKDA_NOT_AUTOLINK) {
607
- work.data = data + 1;
608
- work.size = end - 2;
609
- ret = rndr->make.autolink(ob, &work, altype, rndr->make.opaque);
610
- }
611
- else if (rndr->make.raw_html_tag)
612
- ret = rndr->make.raw_html_tag(ob, &work, rndr->make.opaque);
613
- }
614
-
615
- if (!ret) return 0;
616
- else return end;
617
- }
618
-
619
-
620
- /* char_link • '[': parsing a link or an image */
621
- static size_t
622
- char_link(struct buf *ob, struct render *rndr, char *data, size_t offset, size_t size)
623
- {
624
- int is_img = (offset && data[-1] == '!'), level;
625
- size_t i = 1, txt_e, link_b = 0, link_e = 0, title_b = 0, title_e = 0;
626
- struct buf *content = 0;
627
- struct buf *link = 0;
628
- struct buf *title = 0;
629
- size_t org_work_size = rndr->work.size;
630
- int text_has_nl = 0, ret = 0;
631
-
632
- /* checking whether the correct renderer exists */
633
- if ((is_img && !rndr->make.image) || (!is_img && !rndr->make.link))
634
- goto cleanup;
635
-
636
- /* looking for the matching closing bracket */
637
- for (level = 1; i < size; i += 1) {
638
- if (data[i] == '\n')
639
- text_has_nl = 1;
640
-
641
- else if (data[i - 1] == '\\')
642
- continue;
643
-
644
- else if (data[i] == '[')
645
- level++;
646
-
647
- else if (data[i] == ']') {
648
- level--;
649
- if (level <= 0)
650
- break;
651
- }
652
- }
653
-
654
- if (i >= size)
655
- goto cleanup;
656
-
657
- txt_e = i;
658
- i += 1;
659
-
660
- /* skip any amount of whitespace or newline */
661
- /* (this is much more laxist than original markdown syntax) */
662
- while (i < size && isspace(data[i]))
663
- i++;
664
-
665
- /* inline style link */
666
- if (i < size && data[i] == '(') {
667
- /* skipping initial whitespace */
668
- i += 1;
669
-
670
- while (i < size && (data[i] == ' ' || data[i] == '\t'))
671
- i++;
672
-
673
- link_b = i;
674
-
675
- /* looking for link end: ' " ) */
676
- while (i < size && data[i] != '\'' && data[i] != '"' && data[i] != ')')
677
- i++;
678
-
679
- if (i >= size) goto cleanup;
680
- link_e = i;
681
-
682
- /* looking for title end if present */
683
- if (data[i] == '\'' || data[i] == '"') {
684
- i++;
685
- title_b = i;
686
-
687
- while (i < size && data[i] != ')') i++;
688
- if (i >= size) goto cleanup;
689
-
690
- /* skipping whitespaces after title */
691
- title_e = i - 1;
692
- while (title_e > title_b && isspace(data[title_e]))
693
- title_e--;
694
-
695
- /* checking for closing quote presence */
696
- if (data[title_e] != '\'' && data[title_e] != '"') {
697
- title_b = title_e = 0;
698
- link_e = i;
699
- }
700
- }
701
-
702
- /* remove whitespace at the end of the link */
703
- while (link_e > link_b && (data[link_e - 1] == ' ' || data[link_e - 1] == '\t'))
704
- link_e--;
705
-
706
- /* remove optional angle brackets around the link */
707
- if (data[link_b] == '<') link_b++;
708
- if (data[link_e - 1] == '>') link_e--;
709
-
710
- /* building escaped link and title */
711
- if (link_e > link_b) {
712
- if (rndr->work.size < rndr->work.asize) {
713
- link = rndr->work.item[rndr->work.size ++];
714
- link->size = 0;
715
- } else {
716
- link = bufnew(WORK_UNIT);
717
- parr_push(&rndr->work, link);
718
- }
719
- bufput(link, data + link_b, link_e - link_b);
720
- }
721
-
722
- if (title_e > title_b) {
723
- if (rndr->work.size < rndr->work.asize) {
724
- title = rndr->work.item[rndr->work.size ++];
725
- title->size = 0;
726
- } else {
727
- title = bufnew(WORK_UNIT);
728
- parr_push(&rndr->work, title);
729
- }
730
- bufput(title, data + title_b, title_e - title_b);
731
- }
732
-
733
- i++;
734
- }
735
-
736
- /* reference style link */
737
- else if (i < size && data[i] == '[') {
738
- struct buf id = { 0, 0, 0, 0, 0 };
739
- struct link_ref *lr;
740
-
741
- /* looking for the id */
742
- i += 1;
743
- link_b = i;
744
- while (i < size && data[i] != ']') i++;
745
- if (i >= size) goto cleanup;
746
- link_e = i;
747
-
748
- /* finding the link_ref */
749
- if (link_b == link_e) {
750
- if (text_has_nl) {
751
- struct buf *b = 0;
752
- size_t j;
753
-
754
- if (rndr->work.size < rndr->work.asize) {
755
- b = rndr->work.item[rndr->work.size ++];
756
- b->size = 0;
757
- } else {
758
- b = bufnew(WORK_UNIT);
759
- parr_push(&rndr->work, b);
760
- }
761
-
762
- for (j = 1; j < txt_e; j++) {
763
- if (data[j] != '\n')
764
- bufputc(b, data[j]);
765
- else if (data[j - 1] != ' ')
766
- bufputc(b, ' ');
767
- }
768
-
769
- id.data = b->data;
770
- id.size = b->size;
771
- } else {
772
- id.data = data + 1;
773
- id.size = txt_e - 1;
774
- }
775
- } else {
776
- id.data = data + link_b;
777
- id.size = link_e - link_b;
778
- }
779
-
780
- lr = arr_sorted_find(&rndr->refs, &id, cmp_link_ref);
781
- if (!lr) goto cleanup;
782
-
783
- /* keeping link and title from link_ref */
784
- link = lr->link;
785
- title = lr->title;
786
- i += 1;
787
- }
788
-
789
- /* shortcut reference style link */
790
- else {
791
- struct buf id = { 0, 0, 0, 0, 0 };
792
- struct link_ref *lr;
793
-
794
- /* crafting the id */
795
- if (text_has_nl) {
796
- struct buf *b = 0;
797
- size_t j;
798
-
799
- if (rndr->work.size < rndr->work.asize) {
800
- b = rndr->work.item[rndr->work.size ++];
801
- b->size = 0;
802
- } else {
803
- b = bufnew(WORK_UNIT);
804
- parr_push(&rndr->work, b);
805
- }
806
-
807
- for (j = 1; j < txt_e; j++) {
808
- if (data[j] != '\n')
809
- bufputc(b, data[j]);
810
- else if (data[j - 1] != ' ')
811
- bufputc(b, ' ');
812
- }
813
-
814
- id.data = b->data;
815
- id.size = b->size;
816
- } else {
817
- id.data = data + 1;
818
- id.size = txt_e - 1;
819
- }
820
-
821
- /* finding the link_ref */
822
- lr = arr_sorted_find(&rndr->refs, &id, cmp_link_ref);
823
- if (!lr) goto cleanup;
824
-
825
- /* keeping link and title from link_ref */
826
- link = lr->link;
827
- title = lr->title;
828
-
829
- /* rewinding the whitespace */
830
- i = txt_e + 1;
831
- }
832
-
833
- /* building content: img alt is escaped, link content is parsed */
834
- if (txt_e > 1) {
835
- if (rndr->work.size < rndr->work.asize) {
836
- content = rndr->work.item[rndr->work.size ++];
837
- content->size = 0;
838
- } else {
839
- content = bufnew(WORK_UNIT);
840
- parr_push(&rndr->work, content);
841
- }
842
-
843
- if (is_img) bufput(content, data + 1, txt_e - 1);
844
- else parse_inline(content, rndr, data + 1, txt_e - 1);
845
- }
846
-
847
- /* calling the relevant rendering function */
848
- if (is_img) {
849
- if (ob->size && ob->data[ob->size - 1] == '!')
850
- ob->size -= 1;
851
-
852
- ret = rndr->make.image(ob, link, title, content, rndr->make.opaque);
853
- } else
854
- ret = rndr->make.link(ob, link, title, content, rndr->make.opaque);
855
-
856
- /* cleanup */
857
- cleanup:
858
- rndr->work.size = (int)org_work_size;
859
- return ret ? i : 0;
860
- }
861
-
862
-
863
-
864
- /*********************************
865
- * BLOCK-LEVEL PARSING FUNCTIONS *
866
- *********************************/
867
-
868
- /* is_empty • returns the line length when it is empty, 0 otherwise */
869
- static size_t
870
- is_empty(char *data, size_t size)
871
- {
872
- size_t i;
873
- for (i = 0; i < size && data[i] != '\n'; i += 1)
874
- if (data[i] != ' ' && data[i] != '\t') return 0;
875
- return i + 1;
876
- }
877
-
878
- /* is_hrule • returns whether a line is a horizontal rule */
879
- static int
880
- is_hrule(char *data, size_t size)
881
- {
882
- size_t i = 0, n = 0;
883
- char c;
884
-
885
- /* skipping initial spaces */
886
- if (size < 3) return 0;
887
- if (data[0] == ' ') { i += 1;
888
- if (data[1] == ' ') { i += 1;
889
- if (data[2] == ' ') { i += 1; } } }
890
-
891
- /* looking at the hrule char */
892
- if (i + 2 >= size
893
- || (data[i] != '*' && data[i] != '-' && data[i] != '_'))
894
- return 0;
895
- c = data[i];
896
-
897
- /* the whole line must be the char or whitespace */
898
- while (i < size && data[i] != '\n') {
899
- if (data[i] == c) n += 1;
900
- else if (data[i] != ' ' && data[i] != '\t')
901
- return 0;
902
- i += 1; }
903
-
904
- return n >= 3;
905
- }
906
-
907
- /* check if a line is a code fence; return its size if it is */
908
- static size_t
909
- is_codefence(char *data, size_t size)
910
- {
911
- size_t i = 0, n = 0;
912
- char c;
913
-
914
- /* skipping initial spaces */
915
- if (size < 3) return 0;
916
- if (data[0] == ' ') { i += 1;
917
- if (data[1] == ' ') { i += 1;
918
- if (data[2] == ' ') { i += 1; } } }
919
-
920
- /* looking at the hrule char */
921
- if (i + 2 >= size || data[i] != '~')
922
- return 0;
923
-
924
- /* the whole line must be the char or whitespace */
925
- while (i < size && data[i] != '\n') {
926
- if (data[i] == '~') n++;
927
- else if (data[i] != ' ' && data[i] != '\t')
928
- return 0;
929
- i++;
930
- }
931
-
932
- return n >= 3 ? i + 1 : 0;
933
- }
934
-
935
- /* is_headerline • returns whether the line is a setext-style hdr underline */
936
- static int
937
- is_headerline(char *data, size_t size)
938
- {
939
- size_t i = 0;
940
-
941
- /* test of level 1 header */
942
- if (data[i] == '=') {
943
- for (i = 1; i < size && data[i] == '='; i += 1);
944
- while (i < size && (data[i] == ' ' || data[i] == '\t')) i += 1;
945
- return (i >= size || data[i] == '\n') ? 1 : 0; }
946
-
947
- /* test of level 2 header */
948
- if (data[i] == '-') {
949
- for (i = 1; i < size && data[i] == '-'; i += 1);
950
- while (i < size && (data[i] == ' ' || data[i] == '\t')) i += 1;
951
- return (i >= size || data[i] == '\n') ? 2 : 0; }
952
-
953
- return 0;
954
- }
955
-
956
- /* prefix_quote • returns blockquote prefix length */
957
- static size_t
958
- prefix_quote(char *data, size_t size)
959
- {
960
- size_t i = 0;
961
- if (i < size && data[i] == ' ') i += 1;
962
- if (i < size && data[i] == ' ') i += 1;
963
- if (i < size && data[i] == ' ') i += 1;
964
- if (i < size && data[i] == '>') {
965
- if (i + 1 < size && (data[i + 1] == ' ' || data[i+1] == '\t'))
966
- return i + 2;
967
- else return i + 1; }
968
- else return 0;
969
- }
970
-
971
- /* prefix_code • returns prefix length for block code*/
972
- static size_t
973
- prefix_code(char *data, size_t size)
974
- {
975
- if (size > 0 && data[0] == '\t') return 1;
976
- if (size > 3 && data[0] == ' ' && data[1] == ' '
977
- && data[2] == ' ' && data[3] == ' ') return 4;
978
- return 0;
979
- }
980
-
981
- /* prefix_oli • returns ordered list item prefix */
982
- static size_t
983
- prefix_oli(char *data, size_t size)
984
- {
985
- size_t i = 0;
986
- if (i < size && data[i] == ' ') i += 1;
987
- if (i < size && data[i] == ' ') i += 1;
988
- if (i < size && data[i] == ' ') i += 1;
989
- if (i >= size || data[i] < '0' || data[i] > '9') return 0;
990
- while (i < size && data[i] >= '0' && data[i] <= '9') i += 1;
991
- if (i + 1 >= size || data[i] != '.'
992
- || (data[i + 1] != ' ' && data[i + 1] != '\t')) return 0;
993
- return i + 2;
994
- }
995
-
996
- /* prefix_uli • returns ordered list item prefix */
997
- static size_t
998
- prefix_uli(char *data, size_t size)
999
- {
1000
- size_t i = 0;
1001
- if (i < size && data[i] == ' ') i += 1;
1002
- if (i < size && data[i] == ' ') i += 1;
1003
- if (i < size && data[i] == ' ') i += 1;
1004
- if (i + 1 >= size
1005
- || (data[i] != '*' && data[i] != '+' && data[i] != '-')
1006
- || (data[i + 1] != ' ' && data[i + 1] != '\t'))
1007
- return 0;
1008
- return i + 2;
1009
- }
1010
-
1011
-
1012
- /* parse_block • parsing of one block, returning next char to parse */
1013
- static void parse_block(struct buf *ob, struct render *rndr,
1014
- char *data, size_t size);
1015
-
1016
-
1017
- /* parse_blockquote • hanldes parsing of a blockquote fragment */
1018
- static size_t
1019
- parse_blockquote(struct buf *ob, struct render *rndr, char *data, size_t size)
1020
- {
1021
- size_t beg, end = 0, pre, work_size = 0;
1022
- char *work_data = 0;
1023
- struct buf *out = 0;
1024
-
1025
- if (rndr->work.size < rndr->work.asize) {
1026
- out = rndr->work.item[rndr->work.size ++];
1027
- out->size = 0; }
1028
- else {
1029
- out = bufnew(WORK_UNIT);
1030
- parr_push(&rndr->work, out); }
1031
-
1032
- beg = 0;
1033
- while (beg < size) {
1034
- for (end = beg + 1; end < size && data[end - 1] != '\n'; end++);
1035
-
1036
- pre = prefix_quote(data + beg, end - beg);
1037
-
1038
- if (pre)
1039
- beg += pre; /* skipping prefix */
1040
-
1041
- /* empty line followed by non-quote line */
1042
- else if (is_empty(data + beg, end - beg) &&
1043
- (end >= size || (prefix_quote(data + end, size - end) == 0 &&
1044
- !is_empty(data + end, size - end))))
1045
- break;
1046
-
1047
- if (beg < end) { /* copy into the in-place working buffer */
1048
- /* bufput(work, data + beg, end - beg); */
1049
- if (!work_data)
1050
- work_data = data + beg;
1051
- else if (data + beg != work_data + work_size)
1052
- memmove(work_data + work_size, data + beg, end - beg);
1053
- work_size += end - beg;
1054
- }
1055
- beg = end;
1056
- }
1057
-
1058
- parse_block(out, rndr, work_data, work_size);
1059
- if (rndr->make.blockquote)
1060
- rndr->make.blockquote(ob, out, rndr->make.opaque);
1061
- rndr->work.size -= 1;
1062
- return end;
1063
- }
1064
-
1065
- static size_t
1066
- parse_htmlblock(struct buf *ob, struct render *rndr, char *data, size_t size, int do_render);
1067
-
1068
- /* parse_blockquote • hanldes parsing of a regular paragraph */
1069
- static size_t
1070
- parse_paragraph(struct buf *ob, struct render *rndr, char *data, size_t size)
1071
- {
1072
- size_t i = 0, end = 0;
1073
- int level = 0;
1074
- struct buf work = { data, 0, 0, 0, 0 }; /* volatile working buffer */
1075
-
1076
- while (i < size) {
1077
- size_t html_size;
1078
-
1079
- for (end = i + 1; end < size && data[end - 1] != '\n'; end++) /* empty */;
1080
-
1081
- if (is_empty(data + i, size - i) || (level = is_headerline(data + i, size - i)) != 0)
1082
- break;
1083
-
1084
- /* HTML blocks should not nest inside the paragraph, even if they
1085
- * are not separated by a blank line; we run `parse_htmlblock` without
1086
- * actually generating any output, to make sure that this is indeed
1087
- * a HTML block */
1088
- if (data[i] == '<' && rndr->make.blockhtml && parse_htmlblock(ob, rndr, data + i, size - i, 0)) {
1089
- end = i;
1090
- break;
1091
- }
1092
-
1093
- if (data[i] == '#' || is_hrule(data + i, size - i)) {
1094
- end = i;
1095
- break;
1096
- }
1097
-
1098
- i = end;
1099
- }
1100
-
1101
- work.size = i;
1102
- while (work.size && data[work.size - 1] == '\n')
1103
- work.size--;
1104
-
1105
- if (!level) {
1106
- struct buf *tmp = 0;
1107
- if (rndr->work.size < rndr->work.asize) {
1108
- tmp = rndr->work.item[rndr->work.size ++];
1109
- tmp->size = 0;
1110
- } else {
1111
- tmp = bufnew(WORK_UNIT);
1112
- parr_push(&rndr->work, tmp);
1113
- }
1114
-
1115
- parse_inline(tmp, rndr, work.data, work.size);
1116
- if (rndr->make.paragraph)
1117
- rndr->make.paragraph(ob, tmp, rndr->make.opaque);
1118
- rndr->work.size--;
1119
-
1120
- } else {
1121
- if (work.size) {
1122
- size_t beg;
1123
- i = work.size;
1124
- work.size -= 1;
1125
-
1126
- while (work.size && data[work.size] != '\n')
1127
- work.size -= 1;
1128
-
1129
- beg = work.size + 1;
1130
- while (work.size && data[work.size - 1] == '\n')
1131
- work.size -= 1;
1132
-
1133
- if (work.size > 0) {
1134
- struct buf *tmp = 0;
1135
-
1136
- if (rndr->work.size < rndr->work.asize) {
1137
- tmp=rndr->work.item[rndr->work.size++];
1138
- tmp->size = 0;
1139
- } else {
1140
- tmp = bufnew(WORK_UNIT);
1141
- parr_push(&rndr->work, tmp);
1142
- }
1143
-
1144
- parse_inline(tmp, rndr, work.data, work.size);
1145
-
1146
- if (rndr->make.paragraph)
1147
- rndr->make.paragraph(ob, tmp, rndr->make.opaque);
1148
-
1149
- rndr->work.size -= 1;
1150
- work.data += beg;
1151
- work.size = i - beg;
1152
- }
1153
- else work.size = i;
1154
- }
1155
-
1156
- if (rndr->make.header)
1157
- rndr->make.header(ob, &work, level, rndr->make.opaque);
1158
- }
1159
-
1160
- return end;
1161
- }
1162
-
1163
- /* parse_blockquote • hanldes parsing of a block-level code fragment */
1164
- static size_t
1165
- parse_fencedcode(struct buf *ob, struct render *rndr, char *data, size_t size)
1166
- {
1167
- size_t beg, end;
1168
- struct buf *work = 0;
1169
-
1170
- beg = is_codefence(data, size);
1171
- if (beg == 0) return 0;
1172
-
1173
- if (rndr->work.size < rndr->work.asize) {
1174
- work = rndr->work.item[rndr->work.size ++];
1175
- work->size = 0;
1176
- } else {
1177
- work = bufnew(WORK_UNIT);
1178
- parr_push(&rndr->work, work);
1179
- }
1180
-
1181
- while (beg < size) {
1182
- size_t fence_end;
1183
-
1184
- fence_end = is_codefence(data + beg, size - beg);
1185
- if (fence_end != 0) {
1186
- beg += fence_end;
1187
- break;
1188
- }
1189
-
1190
- for (end = beg + 1; end < size && data[end - 1] != '\n'; end += 1);
1191
-
1192
- if (beg < end) {
1193
- /* verbatim copy to the working buffer,
1194
- escaping entities */
1195
- if (is_empty(data + beg, end - beg))
1196
- bufputc(work, '\n');
1197
- else bufput(work, data + beg, end - beg);
1198
- }
1199
- beg = end;
1200
- }
1201
-
1202
- if (work->size && work->data[work->size - 1] != '\n')
1203
- bufputc(work, '\n');
1204
-
1205
- if (rndr->make.blockcode)
1206
- rndr->make.blockcode(ob, work, rndr->make.opaque);
1207
-
1208
- rndr->work.size -= 1;
1209
- return beg;
1210
- }
1211
-
1212
- static size_t
1213
- parse_blockcode(struct buf *ob, struct render *rndr, char *data, size_t size)
1214
- {
1215
- size_t beg, end, pre;
1216
- struct buf *work = 0;
1217
-
1218
- if (rndr->work.size < rndr->work.asize) {
1219
- work = rndr->work.item[rndr->work.size ++];
1220
- work->size = 0; }
1221
- else {
1222
- work = bufnew(WORK_UNIT);
1223
- parr_push(&rndr->work, work); }
1224
-
1225
- beg = 0;
1226
- while (beg < size) {
1227
- for (end = beg + 1; end < size && data[end - 1] != '\n';
1228
- end += 1);
1229
- pre = prefix_code(data + beg, end - beg);
1230
- if (pre) beg += pre; /* skipping prefix */
1231
- else if (!is_empty(data + beg, end - beg))
1232
- /* non-empty non-prefixed line breaks the pre */
1233
- break;
1234
- if (beg < end) {
1235
- /* verbatim copy to the working buffer,
1236
- escaping entities */
1237
- if (is_empty(data + beg, end - beg))
1238
- bufputc(work, '\n');
1239
- else bufput(work, data + beg, end - beg); }
1240
- beg = end; }
1241
-
1242
- while (work->size && work->data[work->size - 1] == '\n')
1243
- work->size -= 1;
1244
- bufputc(work, '\n');
1245
- if (rndr->make.blockcode)
1246
- rndr->make.blockcode(ob, work, rndr->make.opaque);
1247
- rndr->work.size -= 1;
1248
- return beg;
1249
- }
1250
-
1251
- /* parse_listitem • parsing of a single list item */
1252
- /* assuming initial prefix is already removed */
1253
- static size_t
1254
- parse_listitem(struct buf *ob, struct render *rndr, char *data, size_t size, int *flags)
1255
- {
1256
- struct buf *work = 0, *inter = 0;
1257
- size_t beg = 0, end, pre, sublist = 0, orgpre = 0, i;
1258
- int in_empty = 0, has_inside_empty = 0;
1259
-
1260
- /* keeping book of the first indentation prefix */
1261
- while (orgpre < 3 && orgpre < size && data[orgpre] == ' ')
1262
- orgpre++;
1263
-
1264
- beg = prefix_uli(data, size);
1265
- if (!beg)
1266
- beg = prefix_oli(data, size);
1267
-
1268
- if (!beg)
1269
- return 0;
1270
-
1271
- /* skipping to the beginning of the following line */
1272
- end = beg;
1273
- while (end < size && data[end - 1] != '\n')
1274
- end++;
1275
-
1276
- /* getting working buffers */
1277
- if (rndr->work.size < rndr->work.asize) {
1278
- work = rndr->work.item[rndr->work.size ++];
1279
- work->size = 0;
1280
- } else {
1281
- work = bufnew(WORK_UNIT);
1282
- parr_push(&rndr->work, work);
1283
- }
1284
-
1285
- if (rndr->work.size < rndr->work.asize) {
1286
- inter = rndr->work.item[rndr->work.size ++];
1287
- inter->size = 0;
1288
- } else {
1289
- inter = bufnew(WORK_UNIT);
1290
- parr_push(&rndr->work, inter);
1291
- }
1292
-
1293
- /* putting the first line into the working buffer */
1294
- bufput(work, data + beg, end - beg);
1295
- beg = end;
1296
-
1297
- /* process the following lines */
1298
- while (beg < size) {
1299
- end++;
1300
-
1301
- while (end < size && data[end - 1] != '\n')
1302
- end++;
1303
-
1304
- /* process an empty line */
1305
- if (is_empty(data + beg, end - beg)) {
1306
- in_empty = 1;
1307
- beg = end;
1308
- continue;
1309
- }
1310
-
1311
- /* calculating the indentation */
1312
- i = 0;
1313
- while (i < 4 && beg + i < end && data[beg + i] == ' ')
1314
- i++;
1315
-
1316
- pre = i;
1317
- if (data[beg] == '\t') { i = 1; pre = 8; }
1318
-
1319
- /* checking for a new item */
1320
- if ((prefix_uli(data + beg + i, end - beg - i) &&
1321
- !is_hrule(data + beg + i, end - beg - i)) ||
1322
- prefix_oli(data + beg + i, end - beg - i)) {
1323
- if (in_empty)
1324
- has_inside_empty = 1;
1325
-
1326
- if (pre == orgpre) /* the following item must have */
1327
- break; /* the same indentation */
1328
-
1329
- if (!sublist)
1330
- sublist = work->size;
1331
- }
1332
- /* joining only indented stuff after empty lines */
1333
- else if (in_empty && i < 4 && data[beg] != '\t') {
1334
- *flags |= MKD_LI_END;
1335
- break;
1336
- }
1337
- else if (in_empty) {
1338
- bufputc(work, '\n');
1339
- has_inside_empty = 1;
1340
- }
1341
-
1342
- in_empty = 0;
1343
-
1344
- /* adding the line without prefix into the working buffer */
1345
- bufput(work, data + beg + i, end - beg - i);
1346
- beg = end;
1347
- }
1348
-
1349
- /* render of li contents */
1350
- if (has_inside_empty)
1351
- *flags |= MKD_LI_BLOCK;
1352
-
1353
- if (*flags & MKD_LI_BLOCK) {
1354
- /* intermediate render of block li */
1355
- if (sublist && sublist < work->size) {
1356
- parse_block(inter, rndr, work->data, sublist);
1357
- parse_block(inter, rndr, work->data + sublist, work->size - sublist);
1358
- }
1359
- else
1360
- parse_block(inter, rndr, work->data, work->size);
1361
- } else {
1362
- /* intermediate render of inline li */
1363
- if (sublist && sublist < work->size) {
1364
- parse_inline(inter, rndr, work->data, sublist);
1365
- parse_block(inter, rndr, work->data + sublist, work->size - sublist);
1366
- }
1367
- else
1368
- parse_inline(inter, rndr, work->data, work->size);
1369
- }
1370
-
1371
- /* render of li itself */
1372
- if (rndr->make.listitem)
1373
- rndr->make.listitem(ob, inter, *flags, rndr->make.opaque);
1374
-
1375
- rndr->work.size -= 2;
1376
- return beg;
1377
- }
1378
-
1379
-
1380
- /* parse_list • parsing ordered or unordered list block */
1381
- static size_t
1382
- parse_list(struct buf *ob, struct render *rndr, char *data, size_t size, int flags)
1383
- {
1384
- struct buf *work = 0;
1385
- size_t i = 0, j;
1386
-
1387
- if (rndr->work.size < rndr->work.asize) {
1388
- work = rndr->work.item[rndr->work.size ++];
1389
- work->size = 0; }
1390
- else {
1391
- work = bufnew(WORK_UNIT);
1392
- parr_push(&rndr->work, work); }
1393
-
1394
- while (i < size) {
1395
- j = parse_listitem(work, rndr, data + i, size - i, &flags);
1396
- i += j;
1397
-
1398
- if (!j || (flags & MKD_LI_END))
1399
- break;
1400
- }
1401
-
1402
- if (rndr->make.list)
1403
- rndr->make.list(ob, work, flags, rndr->make.opaque);
1404
- rndr->work.size -= 1;
1405
- return i;
1406
- }
1407
-
1408
-
1409
- /* parse_atxheader • parsing of atx-style headers */
1410
- static size_t
1411
- parse_atxheader(struct buf *ob, struct render *rndr, char *data, size_t size)
1412
- {
1413
- size_t level = 0;
1414
- size_t i, end, skip;
1415
- struct buf work = { data, 0, 0, 0, 0 };
1416
-
1417
- if (!size || data[0] != '#')
1418
- return 0;
1419
-
1420
- while (level < size && level < 6 && data[level] == '#')
1421
- level++;
1422
-
1423
- for (i = level; i < size && (data[i] == ' ' || data[i] == '\t'); i++);
1424
-
1425
- work.data = data + i;
1426
- for (end = i; end < size && data[end] != '\n'; end++);
1427
- skip = end;
1428
-
1429
- while (end && data[end - 1] == '#')
1430
- end--;
1431
-
1432
- while (end && (data[end - 1] == ' ' || data[end - 1] == '\t'))
1433
- end--;
1434
-
1435
- if (end > i) {
1436
- work.size = end - i;
1437
-
1438
- if (rndr->make.header)
1439
- rndr->make.header(ob, &work, (int)level, rndr->make.opaque);
1440
-
1441
- }
1442
-
1443
- return skip;
1444
- }
1445
-
1446
-
1447
- /* htmlblock_end • checking end of HTML block : </tag>[ \t]*\n[ \t*]\n */
1448
- /* returns the length on match, 0 otherwise */
1449
- static size_t
1450
- htmlblock_end(struct html_tag *tag, char *data, size_t size)
1451
- {
1452
- size_t i, w;
1453
-
1454
- /* assuming data[0] == '<' && data[1] == '/' already tested */
1455
-
1456
- /* checking tag is a match */
1457
- if (tag->size + 3 >= size
1458
- || strncasecmp(data + 2, tag->text, tag->size)
1459
- || data[tag->size + 2] != '>')
1460
- return 0;
1461
-
1462
- /* checking white lines */
1463
- i = tag->size + 3;
1464
- w = 0;
1465
- if (i < size && (w = is_empty(data + i, size - i)) == 0)
1466
- return 0; /* non-blank after tag */
1467
- i += w;
1468
- w = 0;
1469
-
1470
-
1471
- #ifdef UPSKIRT_NEWLINE_AFTER_TAGS
1472
- if (i < size && (w = is_empty(data + i, size - i)) == 0)
1473
- return 0; /* non-blank line after tag line */
1474
- #else
1475
- if (i < size)
1476
- w = is_empty(data + i, size - i);
1477
- #endif
1478
-
1479
- return i + w;
1480
- }
1481
-
1482
-
1483
- /* parse_htmlblock • parsing of inline HTML block */
1484
- static size_t
1485
- parse_htmlblock(struct buf *ob, struct render *rndr, char *data, size_t size, int do_render)
1486
- {
1487
- size_t i, j = 0;
1488
- struct html_tag *curtag;
1489
- int found;
1490
- struct buf work = { data, 0, 0, 0, 0 };
1491
-
1492
- /* identification of the opening tag */
1493
- if (size < 2 || data[0] != '<') return 0;
1494
- curtag = find_block_tag(data + 1, size - 1);
1495
-
1496
- /* handling of special cases */
1497
- if (!curtag) {
1498
-
1499
- /* HTML comment, laxist form */
1500
- if (size > 5 && data[1] == '!' && data[2] == '-' && data[3] == '-') {
1501
- i = 5;
1502
-
1503
- while (i < size && !(data[i - 2] == '-' && data[i - 1] == '-' && data[i] == '>'))
1504
- i++;
1505
-
1506
- i++;
1507
-
1508
- if (i < size)
1509
- j = is_empty(data + i, size - i);
1510
-
1511
- if (j) {
1512
- work.size = i + j;
1513
- if (do_render && rndr->make.blockhtml)
1514
- rndr->make.blockhtml(ob, &work, rndr->make.opaque);
1515
- return work.size;
1516
- }
1517
- }
1518
-
1519
- /* HR, which is the only self-closing block tag considered */
1520
- if (size > 4 && (data[1] == 'h' || data[1] == 'H') && (data[2] == 'r' || data[2] == 'R')) {
1521
- i = 3;
1522
- while (i < size && data[i] != '>')
1523
- i += 1;
1524
-
1525
- if (i + 1 < size) {
1526
- i += 1;
1527
- j = is_empty(data + i, size - i);
1528
- if (j) {
1529
- work.size = i + j;
1530
- if (do_render && rndr->make.blockhtml)
1531
- rndr->make.blockhtml(ob, &work, rndr->make.opaque);
1532
- return work.size;
1533
- }
1534
- }
1535
- }
1536
-
1537
- /* no special case recognised */
1538
- return 0;
1539
- }
1540
-
1541
- /* looking for an unindented matching closing tag */
1542
- /* followed by a blank line */
1543
- i = 1;
1544
- found = 0;
1545
- #if 0
1546
- while (i < size) {
1547
- i += 1;
1548
- while (i < size && !(data[i - 2] == '\n'
1549
- && data[i - 1] == '<' && data[i] == '/'))
1550
- i += 1;
1551
- if (i + 2 + curtag->size >= size) break;
1552
- j = htmlblock_end(curtag, data + i - 1, size - i + 1);
1553
- if (j) {
1554
- i += j - 1;
1555
- found = 1;
1556
- break; } }
1557
- #endif
1558
-
1559
- /* if not found, trying a second pass looking for indented match */
1560
- /* but not if tag is "ins" or "del" (following original Markdown.pl) */
1561
- if (!found && curtag != INS_TAG && curtag != DEL_TAG) {
1562
- i = 1;
1563
- while (i < size) {
1564
- i++;
1565
- while (i < size && !(data[i - 1] == '<' && data[i] == '/'))
1566
- i++;
1567
-
1568
- if (i + 2 + curtag->size >= size)
1569
- break;
1570
-
1571
- j = htmlblock_end(curtag, data + i - 1, size - i + 1);
1572
-
1573
- if (j) {
1574
- i += j - 1;
1575
- found = 1;
1576
- break;
1577
- }
1578
- }
1579
- }
1580
-
1581
- if (!found) return 0;
1582
-
1583
- /* the end of the block has been found */
1584
- work.size = i;
1585
- if (do_render && rndr->make.blockhtml)
1586
- rndr->make.blockhtml(ob, &work, rndr->make.opaque);
1587
-
1588
- return i;
1589
- }
1590
-
1591
- static void
1592
- parse_table_row(struct buf *ob, struct render *rndr, char *data, size_t size, size_t columns, int *col_data)
1593
- {
1594
- size_t i = 0, col;
1595
- struct buf *row_work = 0;
1596
-
1597
- if (rndr->work.size < rndr->work.asize) {
1598
- row_work = rndr->work.item[rndr->work.size ++];
1599
- row_work->size = 0;
1600
- } else {
1601
- row_work = bufnew(WORK_UNIT);
1602
- parr_push(&rndr->work, row_work);
1603
- }
1604
-
1605
- if (i < size && data[i] == '|')
1606
- i++;
1607
-
1608
- for (col = 0; col < columns && i < size; ++col) {
1609
- size_t cell_start, cell_end;
1610
- struct buf *cell_work;
1611
-
1612
- if (rndr->work.size < rndr->work.asize) {
1613
- cell_work = rndr->work.item[rndr->work.size ++];
1614
- cell_work->size = 0;
1615
- } else {
1616
- cell_work = bufnew(WORK_UNIT);
1617
- parr_push(&rndr->work, cell_work);
1618
- }
1619
-
1620
- while (i < size && isspace(data[i]))
1621
- i++;
1622
-
1623
- cell_start = i;
1624
-
1625
- while (i < size && data[i] != '|')
1626
- i++;
1627
-
1628
- cell_end = i - 1;
1629
-
1630
- while (cell_end > cell_start && isspace(data[cell_end]))
1631
- cell_end--;
1632
-
1633
- parse_inline(cell_work, rndr, data + cell_start, 1 + cell_end - cell_start);
1634
- if (rndr->make.table_cell)
1635
- rndr->make.table_cell(row_work, cell_work, col_data ? col_data[col] : 0, rndr->make.opaque);
1636
-
1637
- rndr->work.size -= 1;
1638
- i++;
1639
- }
1640
-
1641
- for (; col < columns; ++col) {
1642
- struct buf empty_cell = {0, 0, 0, 0, 0};
1643
- if (rndr->make.table_cell)
1644
- rndr->make.table_cell(row_work, &empty_cell, col_data ? col_data[col] : 0, rndr->make.opaque);
1645
- }
1646
-
1647
- if (rndr->make.table_row)
1648
- rndr->make.table_row(ob, row_work, rndr->make.opaque);
1649
-
1650
- rndr->work.size -= 1;
1651
- }
1652
-
1653
- static size_t
1654
- parse_table_header(struct buf *ob, struct render *rndr, char *data, size_t size, size_t *columns, int **column_data)
1655
- {
1656
- int pipes;
1657
- size_t i = 0, col, header_end, under_end;
1658
-
1659
- pipes = 0;
1660
- while (i < size && data[i] != '\n')
1661
- if (data[i++] == '|')
1662
- pipes++;
1663
-
1664
- if (i == size || pipes == 0)
1665
- return 0;
1666
-
1667
- header_end = i;
1668
-
1669
- if (data[0] == '|')
1670
- pipes--;
1671
-
1672
- if (i > 2 && data[i - 1] == '|')
1673
- pipes--;
1674
-
1675
- *columns = pipes + 1;
1676
- *column_data = calloc(*columns, sizeof(int));
1677
-
1678
- /* Parse the header underline */
1679
- i++;
1680
- if (i < size && data[i] == '|')
1681
- i++;
1682
-
1683
- under_end = i;
1684
- while (under_end < size && data[under_end] != '\n')
1685
- under_end++;
1686
-
1687
- for (col = 0; col < *columns && i < under_end; ++col) {
1688
- size_t cell_start, cell_end;
1689
-
1690
- if (data[i] == ':') {
1691
- i++; (*column_data)[col] |= MKD_TABLE_ALIGN_L;
1692
- }
1693
-
1694
- while (i < under_end && data[i] == '-')
1695
- i++;
1696
-
1697
- if (i < under_end && data[i] == ':') {
1698
- i++; (*column_data)[col] |= MKD_TABLE_ALIGN_R;
1699
- }
1700
-
1701
- if (i < under_end && data[i] != '|')
1702
- break;
1703
-
1704
- i++;
1705
- }
1706
-
1707
- if (col < *columns)
1708
- return 0;
1709
-
1710
- parse_table_row(ob, rndr, data, header_end, *columns, *column_data);
1711
- return under_end + 1;
1712
- }
1713
-
1714
- static size_t
1715
- parse_table(struct buf *ob, struct render *rndr, char *data, size_t size)
1716
- {
1717
- size_t i;
1718
-
1719
- struct buf *header_work = 0;
1720
- struct buf *body_work = 0;
1721
-
1722
- size_t columns;
1723
- int *col_data = NULL;
1724
-
1725
- if (rndr->work.size < rndr->work.asize) {
1726
- header_work = rndr->work.item[rndr->work.size ++];
1727
- header_work->size = 0;
1728
- } else {
1729
- header_work = bufnew(WORK_UNIT);
1730
- parr_push(&rndr->work, header_work);
1731
- }
1732
-
1733
- if (rndr->work.size < rndr->work.asize) {
1734
- body_work = rndr->work.item[rndr->work.size ++];
1735
- body_work->size = 0;
1736
- } else {
1737
- body_work = bufnew(WORK_UNIT);
1738
- parr_push(&rndr->work, body_work);
1739
- }
1740
-
1741
- i = parse_table_header(header_work, rndr, data, size, &columns, &col_data);
1742
- if (i > 0) {
1743
-
1744
- while (i < size) {
1745
- size_t row_len;
1746
- size_t row_start;
1747
- int pipes = 0;
1748
-
1749
- row_start = i;
1750
-
1751
- while (i < size && data[i] != '\n')
1752
- if (data[i++] == '|')
1753
- pipes++;
1754
-
1755
- if (pipes == 0 || i == size) {
1756
- i = row_start;
1757
- break;
1758
- }
1759
-
1760
- parse_table_row(body_work, rndr, data + row_start, i - row_start, columns, col_data);
1761
- i++;
1762
- }
1763
-
1764
- if (rndr->make.table)
1765
- rndr->make.table(ob, header_work, body_work, rndr->make.opaque);
1766
- }
1767
-
1768
- free(col_data);
1769
- rndr->work.size -= 2;
1770
- return i;
1771
- }
1772
-
1773
- /* parse_block • parsing of one block, returning next char to parse */
1774
- static void
1775
- parse_block(struct buf *ob, struct render *rndr, char *data, size_t size)
1776
- {
1777
- size_t beg, end, i;
1778
- char *txt_data;
1779
- beg = 0;
1780
-
1781
- if (rndr->work.size > rndr->max_nesting)
1782
- return;
1783
-
1784
- while (beg < size) {
1785
- txt_data = data + beg;
1786
- end = size - beg;
1787
-
1788
- if (data[beg] == '#')
1789
- beg += parse_atxheader(ob, rndr, txt_data, end);
1790
-
1791
- else if (data[beg] == '<' && rndr->make.blockhtml &&
1792
- (i = parse_htmlblock(ob, rndr, txt_data, end, 1)) != 0)
1793
- beg += i;
1794
-
1795
- else if ((i = is_empty(txt_data, end)) != 0)
1796
- beg += i;
1797
-
1798
- else if (is_hrule(txt_data, end)) {
1799
- if (rndr->make.hrule)
1800
- rndr->make.hrule(ob, rndr->make.opaque);
1801
-
1802
- while (beg < size && data[beg] != '\n')
1803
- beg++;
1804
-
1805
- beg++;
1806
- }
1807
-
1808
- else if ((rndr->ext_flags & MKDEXT_FENCED_CODE) != 0 &&
1809
- (i = parse_fencedcode(ob, rndr, txt_data, end)) != 0)
1810
- beg += i;
1811
-
1812
- else if ((rndr->ext_flags & MKDEXT_TABLES) != 0 &&
1813
- (i = parse_table(ob, rndr, txt_data, end)) != 0)
1814
- beg += i;
1815
-
1816
- else if (prefix_quote(txt_data, end))
1817
- beg += parse_blockquote(ob, rndr, txt_data, end);
1818
-
1819
- else if (prefix_code(txt_data, end))
1820
- beg += parse_blockcode(ob, rndr, txt_data, end);
1821
-
1822
- else if (prefix_uli(txt_data, end))
1823
- beg += parse_list(ob, rndr, txt_data, end, 0);
1824
-
1825
- else if (prefix_oli(txt_data, end))
1826
- beg += parse_list(ob, rndr, txt_data, end, MKD_LIST_ORDERED);
1827
-
1828
- else
1829
- beg += parse_paragraph(ob, rndr, txt_data, end);
1830
- }
1831
- }
1832
-
1833
-
1834
-
1835
- /*********************
1836
- * REFERENCE PARSING *
1837
- *********************/
1838
-
1839
- /* is_ref • returns whether a line is a reference or not */
1840
- static int
1841
- is_ref(char *data, size_t beg, size_t end, size_t *last, struct array *refs)
1842
- {
1843
- /* int n; */
1844
- size_t i = 0;
1845
- size_t id_offset, id_end;
1846
- size_t link_offset, link_end;
1847
- size_t title_offset, title_end;
1848
- size_t line_end;
1849
- struct link_ref *lr;
1850
- /* struct buf id = { 0, 0, 0, 0, 0 }; / * volatile buf for id search */
1851
-
1852
- /* up to 3 optional leading spaces */
1853
- if (beg + 3 >= end) return 0;
1854
- if (data[beg] == ' ') { i = 1;
1855
- if (data[beg + 1] == ' ') { i = 2;
1856
- if (data[beg + 2] == ' ') { i = 3;
1857
- if (data[beg + 3] == ' ') return 0; } } }
1858
- i += beg;
1859
-
1860
- /* id part: anything but a newline between brackets */
1861
- if (data[i] != '[') return 0;
1862
- i += 1;
1863
- id_offset = i;
1864
- while (i < end && data[i] != '\n' && data[i] != '\r' && data[i] != ']')
1865
- i += 1;
1866
- if (i >= end || data[i] != ']') return 0;
1867
- id_end = i;
1868
-
1869
- /* spacer: colon (space | tab)* newline? (space | tab)* */
1870
- i += 1;
1871
- if (i >= end || data[i] != ':') return 0;
1872
- i += 1;
1873
- while (i < end && (data[i] == ' ' || data[i] == '\t')) i += 1;
1874
- if (i < end && (data[i] == '\n' || data[i] == '\r')) {
1875
- i += 1;
1876
- if (i < end && data[i] == '\r' && data[i - 1] == '\n') i += 1; }
1877
- while (i < end && (data[i] == ' ' || data[i] == '\t')) i += 1;
1878
- if (i >= end) return 0;
1879
-
1880
- /* link: whitespace-free sequence, optionally between angle brackets */
1881
- if (data[i] == '<') i += 1;
1882
- link_offset = i;
1883
- while (i < end && data[i] != ' ' && data[i] != '\t'
1884
- && data[i] != '\n' && data[i] != '\r') i += 1;
1885
- if (data[i - 1] == '>') link_end = i - 1;
1886
- else link_end = i;
1887
-
1888
- /* optional spacer: (space | tab)* (newline | '\'' | '"' | '(' ) */
1889
- while (i < end && (data[i] == ' ' || data[i] == '\t')) i += 1;
1890
- if (i < end && data[i] != '\n' && data[i] != '\r'
1891
- && data[i] != '\'' && data[i] != '"' && data[i] != '(')
1892
- return 0;
1893
- line_end = 0;
1894
- /* computing end-of-line */
1895
- if (i >= end || data[i] == '\r' || data[i] == '\n') line_end = i;
1896
- if (i + 1 < end && data[i] == '\n' && data[i + 1] == '\r')
1897
- line_end = i + 1;
1898
-
1899
- /* optional (space|tab)* spacer after a newline */
1900
- if (line_end) {
1901
- i = line_end + 1;
1902
- while (i < end && (data[i] == ' ' || data[i] == '\t')) i += 1; }
1903
-
1904
- /* optional title: any non-newline sequence enclosed in '"()
1905
- alone on its line */
1906
- title_offset = title_end = 0;
1907
- if (i + 1 < end
1908
- && (data[i] == '\'' || data[i] == '"' || data[i] == '(')) {
1909
- i += 1;
1910
- title_offset = i;
1911
- /* looking for EOL */
1912
- while (i < end && data[i] != '\n' && data[i] != '\r') i += 1;
1913
- if (i + 1 < end && data[i] == '\n' && data[i + 1] == '\r')
1914
- title_end = i + 1;
1915
- else title_end = i;
1916
- /* stepping back */
1917
- i -= 1;
1918
- while (i > title_offset && (data[i] == ' ' || data[i] == '\t'))
1919
- i -= 1;
1920
- if (i > title_offset
1921
- && (data[i] == '\'' || data[i] == '"' || data[i] == ')')) {
1922
- line_end = title_end;
1923
- title_end = i; } }
1924
- if (!line_end) return 0; /* garbage after the link */
1925
-
1926
- /* a valid ref has been found, filling-in return structures */
1927
- if (last) *last = line_end;
1928
- if (!refs) return 1;
1929
- lr = arr_item(refs, arr_newitem(refs));
1930
- lr->id = bufnew(id_end - id_offset);
1931
- bufput(lr->id, data + id_offset, id_end - id_offset);
1932
- lr->link = bufnew(link_end - link_offset);
1933
- bufput(lr->link, data + link_offset, link_end - link_offset);
1934
- if (title_end > title_offset) {
1935
- lr->title = bufnew(title_end - title_offset);
1936
- bufput(lr->title, data + title_offset,
1937
- title_end - title_offset); }
1938
- else lr->title = 0;
1939
- return 1;
1940
- }
1941
-
1942
- static void expand_tabs(struct buf *ob, const char *line, size_t size)
1943
- {
1944
- size_t i = 0, tab = 0;
1945
-
1946
- while (i < size) {
1947
- size_t org = i;
1948
-
1949
- while (i < size && line[i] != '\t') {
1950
- i++; tab++;
1951
- }
1952
-
1953
- if (i > org)
1954
- bufput(ob, line + org, i - org);
1955
-
1956
- if (i >= size)
1957
- break;
1958
-
1959
- do {
1960
- bufputc(ob, ' '); tab++;
1961
- } while (tab % 4);
1962
-
1963
- i++;
1964
- }
1965
- }
1966
-
1967
- /**********************
1968
- * EXPORTED FUNCTIONS *
1969
- **********************/
1970
-
1971
- /* markdown • parses the input buffer and renders it into the output buffer */
1972
- void
1973
- markdown(struct buf *ob, struct buf *ib, const struct mkd_renderer *rndrer, unsigned int extensions) {
1974
- struct link_ref *lr;
1975
- struct buf *text = bufnew(TEXT_UNIT);
1976
- size_t i, beg, end;
1977
- struct render rndr;
1978
-
1979
- /* filling the render structure */
1980
- if (!rndrer)
1981
- return;
1982
-
1983
- rndr.make = *rndrer;
1984
- arr_init(&rndr.refs, sizeof (struct link_ref));
1985
- parr_init(&rndr.work);
1986
-
1987
- for (i = 0; i < 256; i += 1)
1988
- rndr.active_char[i] = 0;
1989
-
1990
- if ((rndr.make.emphasis || rndr.make.double_emphasis || rndr.make.triple_emphasis) &&
1991
- rndr.make.emph_chars) {
1992
- for (i = 0; rndr.make.emph_chars[i]; i += 1)
1993
- rndr.active_char[(unsigned char)rndr.make.emph_chars[i]] = char_emphasis;
1994
- }
1995
-
1996
- if (rndr.make.codespan)
1997
- rndr.active_char['`'] = char_codespan;
1998
-
1999
- if (rndr.make.linebreak)
2000
- rndr.active_char['\n'] = char_linebreak;
2001
-
2002
- if (rndr.make.image || rndr.make.link)
2003
- rndr.active_char['['] = char_link;
2004
-
2005
- rndr.active_char['<'] = char_langle_tag;
2006
- rndr.active_char['\\'] = char_escape;
2007
- rndr.active_char['&'] = char_entity;
2008
-
2009
- /* Extension data */
2010
- rndr.ext_flags = extensions;
2011
- rndr.max_nesting = 16;
2012
-
2013
- /* first pass: looking for references, copying everything else */
2014
- beg = 0;
2015
- while (beg < ib->size) /* iterating over lines */
2016
- if (is_ref(ib->data, beg, ib->size, &end, &rndr.refs))
2017
- beg = end;
2018
- else { /* skipping to the next line */
2019
- end = beg;
2020
- while (end < ib->size && ib->data[end] != '\n' && ib->data[end] != '\r')
2021
- end += 1;
2022
-
2023
- /* adding the line body if present */
2024
- if (end > beg)
2025
- expand_tabs(text, ib->data + beg, end - beg);
2026
-
2027
- while (end < ib->size && (ib->data[end] == '\n' || ib->data[end] == '\r')) {
2028
- /* add one \n per newline */
2029
- if (ib->data[end] == '\n' || (end + 1 < ib->size && ib->data[end + 1] != '\n'))
2030
- bufputc(text, '\n');
2031
- end += 1;
2032
- }
2033
-
2034
- beg = end;
2035
- }
2036
-
2037
- /* sorting the reference array */
2038
- if (rndr.refs.size)
2039
- qsort(rndr.refs.base, rndr.refs.size, rndr.refs.unit, cmp_link_ref_sort);
2040
-
2041
- /* adding a final newline if not already present */
2042
- if (!text->size)
2043
- return;
2044
-
2045
- if (text->data[text->size - 1] != '\n' && text->data[text->size - 1] != '\r')
2046
- bufputc(text, '\n');
2047
-
2048
- /* second pass: actual rendering */
2049
- if (rndr.make.doc_header)
2050
- rndr.make.doc_header(ob, rndr.make.opaque);
2051
-
2052
- parse_block(ob, &rndr, text->data, text->size);
2053
-
2054
- if (rndr.make.doc_footer)
2055
- rndr.make.doc_footer(ob, rndr.make.opaque);
2056
-
2057
- /* clean-up */
2058
- bufrelease(text);
2059
- lr = rndr.refs.base;
2060
- for (i = 0; i < (size_t)rndr.refs.size; i += 1) {
2061
- bufrelease(lr[i].id);
2062
- bufrelease(lr[i].link);
2063
- bufrelease(lr[i].title);
2064
- }
2065
-
2066
- arr_free(&rndr.refs);
2067
-
2068
- assert(rndr.work.size == 0);
2069
-
2070
- for (i = 0; i < (size_t)rndr.work.asize; i += 1)
2071
- bufrelease(rndr.work.item[i]);
2072
-
2073
- parr_free(&rndr.work);
2074
- }
2075
-
2076
- /* vim: set filetype=c: */