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
|
/*
* BIRD -- Configuration Lexer
*
* (c) 1998--1999 Martin Mares <mj@ucw.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
%{
#undef REJECT /* Avoid name clashes */
#include "filter/filter.h"
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include "nest/bird.h"
#include "conf/conf.h"
#include "conf/cf-parse.tab.h"
static struct keyword {
byte *name;
int value;
struct keyword *next;
} keyword_list[] = {
#include "conf/keywords.h"
{ NULL, -1 } };
#define KW_HASH_SIZE 64
#define SYM_HASH_SIZE 128
#define SYM_MAX_LEN 32
static struct keyword *kw_hash[KW_HASH_SIZE];
static struct symbol **sym_hash;
static int allow_new_symbols;
int conf_lino;
static int cf_hash(byte *c);
static struct symbol *cf_find_sym(byte *c, unsigned int h0);
pool *cfg_pool;
linpool *cfg_mem;
int (*cf_read_hook)(byte *buf, unsigned int max);
#define YY_INPUT(buf,result,max) result = cf_read_hook(buf, max);
#define YY_NO_UNPUT
#define YY_FATAL_ERROR(msg) cf_error(msg)
%}
%option noyywrap
%x COMMENT CCOMM
ALPHA [a-zA-Z_]
DIGIT [0-9]
XIGIT [0-9a-fA-F]
ALNUM [a-zA-Z_0-9]
WHITE [ \t]
%%
{DIGIT}+\.{DIGIT}+\.{DIGIT}+\.{DIGIT}+ {
if (ip_pton(yytext, &cf_lval.a))
return IPA;
cf_error("Invalid IP address");
}
0x{DIGIT}+ {
char *e;
long int l;
errno = 0;
l = strtoul(yytext+2, &e, 16);
if (e && *e || errno == ERANGE || (long int)(int) l != l)
cf_error("Number out of range");
cf_lval.i = l;
return NUM;
}
{DIGIT}+ {
char *e;
long int l;
errno = 0;
l = strtoul(yytext, &e, 10);
if (e && *e || errno == ERANGE || (long int)(int) l != l)
cf_error("Number out of range");
cf_lval.i = l;
return NUM;
}
{ALPHA}{ALNUM}* {
unsigned int h = cf_hash(yytext);
struct keyword *k = kw_hash[h & (KW_HASH_SIZE-1)];
while (k)
{
if (!strcmp(k->name, yytext))
return k->value;
k=k->next;
}
cf_lval.s = cf_find_sym(yytext, h);
return SYM;
}
[={}:;,()+*/%-<>~\[\]] {
return yytext[0];
}
["][^"\n]*["] {
cf_lval.t = yytext+1;
yytext[yyleng-1] = 0;
return TEXT;
}
["][^"\n]*\n cf_error("Unterminated string");
<INITIAL,COMMENT><<EOF>> return END;
{WHITE}+
\n conf_lino++;
# BEGIN(COMMENT);
\/\* BEGIN(CCOMM);
. cf_error("Unknown character");
<COMMENT>\n {
conf_lino++;
BEGIN(INITIAL);
}
<COMMENT>.
<CCOMM>\*\/ BEGIN(INITIAL);
<CCOMM>\n conf_lino++;
<CCOMM>\/\* cf_error("Comment nesting not supported");
<CCOMM><<EOF>> cf_error("Unterminated comment");
<CCOMM>.
%%
static int
cf_hash(byte *c)
{
unsigned int h = 13;
while (*c)
h = (h * 37) + *c++;
return h;
}
static struct symbol *
cf_find_sym(byte *c, unsigned int h0)
{
unsigned int h = h0 & (SYM_HASH_SIZE-1);
struct symbol *s = sym_hash[h];
int l;
while (s)
{
if (!strcmp(s->name, c))
return s;
s = s->next;
}
if (!allow_new_symbols)
return NULL;
l = strlen(c);
if (l > SYM_MAX_LEN)
cf_error("Symbol too long");
s = cfg_alloc(sizeof(struct symbol) + l);
s->next = sym_hash[h];
sym_hash[h] = s;
s->class = SYM_VOID;
s->def = NULL;
s->aux = 0;
strcpy(s->name, c);
return s;
}
struct symbol *
cf_default_name(char *prefix, int *counter)
{
char buf[32];
struct symbol *s;
do
{
sprintf(buf, "%s%d", prefix, ++(*counter));
s = cf_find_sym(buf, cf_hash(buf));
if (!s) cf_error("Unable to generate default name");
}
while (s->class != SYM_VOID);
return s;
}
void
cf_lex_init(int flag)
{
if (allow_new_symbols = flag)
sym_hash = cfg_allocz(SYM_HASH_SIZE * sizeof(struct keyword *));
conf_lino = 1;
}
void
cf_lex_init_tables(void)
{
struct keyword *k;
for(k=keyword_list; k->name; k++)
{
unsigned h = cf_hash(k->name) & (KW_HASH_SIZE-1);
k->next = kw_hash[h];
kw_hash[h] = k;
}
}
|
