public
Description: An implementation of markdown in C, using a PEG grammar
Homepage:
Clone URL: git://github.com/jgm/peg-markdown.git
peg-markdown / utility_functions.c
100644 227 lines (195 sloc) 7.117 kb
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
/* utility_functions.c - List manipulation functions, element
* constructors, and macro definitions for leg markdown parser. */
 
extern int strcasecmp(const char *string1, const char *string2);
 
/**********************************************************************
 
List manipulation functions
 
***********************************************************************/
 
/* cons - cons an element onto a list, returning pointer to new head */
static element * cons(element *new, element *list) {
    assert(new != NULL);
    new->next = list;
    return new;
}
 
/* reverse - reverse a list, returning pointer to new list */
static element *reverse(element *list) {
    element *new = NULL;
    element *next = NULL;
    while (list != NULL) {
        next = list->next;
        new = cons(list, new);
        list = next;
    }
    return new;
}
 
/* concat_string_list - concatenates string contents of list of STR elements.
* Frees STR elements as they are added to the concatenation. */
static GString *concat_string_list(element *list) {
    GString *result;
    element *next;
    result = g_string_new("");
    while (list != NULL) {
        assert(list->key == STR);
        assert(list->contents.str != NULL);
        g_string_append(result, list->contents.str);
        next = list->next;
        free_element(list);
        list = next;
    }
    return result;
}
 
/**********************************************************************
 
Global variables used in parsing
 
***********************************************************************/
 
static char *charbuf = ""; /* Buffer of characters to be parsed. */
static element *references = NULL; /* List of link references found. */
static element *notes = NULL; /* List of footnotes found. */
static element *parse_result; /* Results of parse. */
static int syntax_extensions; /* Syntax extensions selected. */
 
/**********************************************************************
 
Auxiliary functions for parsing actions.
These make it easier to build up data structures (including lists)
in the parsing actions.
 
***********************************************************************/
 
/* mk_element - generic constructor for element */
static element * mk_element(int key) {
    element *result = malloc(sizeof(element));
    result->key = key;
    result->children = NULL;
    result->next = NULL;
    result->contents.str = NULL;
    return result;
}
 
/* mk_str - constructor for STR element */
static element * mk_str(char *string) {
    element *result;
    assert(string != NULL);
    result = mk_element(STR);
    result->contents.str = strdup(string);
    return result;
}
 
/* mk_str_from_list - makes STR element by concatenating a
* reversed list of strings, adding optional extra newline */
static element * mk_str_from_list(element *list, bool extra_newline) {
    element *result;
    GString *c = concat_string_list(reverse(list));
    if (extra_newline)
        g_string_append(c, "\n");
    result = mk_element(STR);
    result->contents.str = c->str;
    g_string_free(c, false);
    return result;
}
 
/* mk_list - makes new list with key 'key' and children the reverse of 'lst'.
* This is designed to be used with cons to build lists in a parser action.
* The reversing is necessary because cons adds to the head of a list. */
static element * mk_list(int key, element *lst) {
    element *result;
    result = mk_element(key);
    result->children = reverse(lst);
    return result;
}
 
/* mk_link - constructor for LINK element */
static element * mk_link(element *label, char *url, char *title) {
    element *result;
    result = mk_element(LINK);
    result->contents.link = malloc(sizeof(link));
    result->contents.link->label = label;
    result->contents.link->url = strdup(url);
    result->contents.link->title = strdup(title);
    return result;
}
 
/* extension = returns true if extension is selected */
static bool extension(int ext) {
    return (syntax_extensions & ext);
}
 
/* match_inlines - returns true if inline lists match (case-insensitive...) */
static bool match_inlines(element *l1, element *l2) {
    while (l1 != NULL && l2 != NULL) {
        if (l1->key != l2->key)
            return false;
        switch (l1->key) {
        case SPACE:
        case LINEBREAK:
        case ELLIPSIS:
        case EMDASH:
        case ENDASH:
        case APOSTROPHE:
            break;
        case CODE:
        case STR:
        case HTML:
            if (strcasecmp(l1->contents.str, l2->contents.str) == 0)
                break;
            else
                return false;
        case EMPH:
        case STRONG:
        case LIST:
        case SINGLEQUOTED:
        case DOUBLEQUOTED:
            if (match_inlines(l1->children, l2->children))
                break;
            else
                return false;
        case LINK:
        case IMAGE:
            return false; /* No links or images within links */
        default:
            fprintf(stderr, "match_inlines encountered unknown key = %d\n", l1->key);
            exit(EXIT_FAILURE);
            break;
        }
        l1 = l1->next;
        l2 = l2->next;
    }
    return (l1 == NULL && l2 == NULL); /* return true if both lists exhausted */
}
 
/* find_reference - return true if link found in references matching label.
* 'link' is modified with the matching url and title. */
static bool find_reference(link *result, element *label) {
    element *cur = references; /* pointer to walk up list of references */
    link *curitem;
    while (cur != NULL) {
        curitem = cur->contents.link;
        if (match_inlines(label, curitem->label)) {
            *result = *curitem;
            return true;
        }
        else
            cur = cur->next;
    }
    return false;
}
 
/* find_note - return true if note found in notes matching label.
if found, 'result' is set to point to matched note. */
 
static bool find_note(element **result, char *label) {
   element *cur = notes; /* pointer to walk up list of notes */
   while (cur != NULL) {
       if (strcmp(label, cur->contents.str) == 0) {
           *result = cur;
           return true;
       }
       else
           cur = cur->next;
   }
   return false;
}
 
/**********************************************************************
 
Definitions for leg parser generator.
YY_INPUT is the function the parser calls to get new input.
We take all new input from (static) charbuf.
 
***********************************************************************/
 
# define YYSTYPE element *
#ifdef __DEBUG__
# define YY_DEBUG 1
#endif
 
#define YY_INPUT(buf, result, max_size) \
{ \
int yyc; \
if (charbuf && *charbuf != '\0') { \
yyc= *charbuf++; \
} else { \
yyc= EOF; \
} \
result= (EOF == yyc) ? 0 : (*(buf)= yyc, 1); \
}