blob: d114d1e5eee3ee4c8e76edb4aba8ae7c00c607bb (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
#include <stdlib.h>
#include <assert.h>
#include <stdio.h>
#include "node.h"
#include "references.h"
#include "html/houdini.h"
#include "cmark.h"
#include "buffer.h"
unsigned char *cmark_markdown_to_html(unsigned char *text, int len)
{
cmark_node *blocks;
unsigned char *result;
blocks = cmark_parse_document(text, len);
result = cmark_render_html(blocks);
cmark_free_nodes(blocks);
return result;
}
// Utility function used by cmark_free_nodes
static void splice_into_list(cmark_node* e, cmark_node* children) {
cmark_node * tmp;
if (children) {
tmp = children;
// Find last child
while (tmp->next) {
tmp = tmp->next;
}
// Splice children into list
tmp->next = e->next;
e->next = children;
}
return ;
}
// Free a cmark_node list and any children.
void cmark_free_nodes(cmark_node *e)
{
cmark_node *next;
while (e != NULL) {
strbuf_free(&e->string_content);
switch (e->type){
case NODE_FENCED_CODE:
strbuf_free(&e->as.code.info);
break;
case NODE_STRING:
case NODE_INLINE_HTML:
case NODE_INLINE_CODE:
cmark_chunk_free(&e->as.literal);
break;
case NODE_LINK:
case NODE_IMAGE:
free(e->as.link.url);
free(e->as.link.title);
splice_into_list(e, e->as.link.label);
break;
default:
break;
}
if (e->last_child) {
// Splice children into list
e->last_child->next = e->next;
e->next = e->first_child;
}
next = e->next;
free(e);
e = next;
}
}
|
