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
|
//
// definitions.c - Code for defining named pattern rules
//
#include <err.h>
#include <stdlib.h>
#include <string.h>
#include "definitions.h"
#include "files.h"
#include "pattern.h"
#include "utils.h"
static size_t next_id = 0;
//
// Return a new list of definitions with one added to the front
//
def_t *with_def(def_t *defs, size_t namelen, const char *name, pat_t *pat)
{
def_t *def = new(def_t);
def->id = next_id++;
def->next = defs;
def->namelen = namelen;
def->name = name;
def->pat = pat;
return def;
}
//
// Load the given grammar (semicolon-separated definitions)
// and return the first rule defined.
//
def_t *load_grammar(def_t *defs, file_t *f)
{
const char *str = after_spaces(f->start, true);
maybe_pat_t maybe_pat = bp_pattern(f, str);
if (!maybe_pat.success)
file_err(f, maybe_pat.value.error.start, maybe_pat.value.error.end, maybe_pat.value.error.msg);
for (pat_t *p = maybe_pat.value.pat; p && p->type == BP_DEFINITION; p = p->args.def.pat)
defs = with_def(defs, p->args.def.namelen, p->args.def.name, p->args.def.def);
return defs;
}
//
// Look up a backreference or grammar definition by name
//
def_t *lookup(def_t *defs, size_t namelen, const char *name)
{
for ( ; defs; defs = defs->next) {
if (namelen == defs->namelen && strncmp(defs->name, name, namelen) == 0)
return defs;
}
return NULL;
}
//
// Free all the given definitions up till (but not including) `stop`
//
def_t *free_defs(def_t *defs, def_t *stop)
{
while (defs != stop && defs != NULL) {
def_t *next = defs->next;
defs->next = NULL;
free(defs);
defs = next;
}
return defs;
}
// vim: ts=4 sw=0 et cino=L2,l1,(0,W4,m1,\:0
|
