parse.c revision 1.8.2.3 1 1.8.2.2 mjf /* $NetBSD: parse.c,v 1.8.2.3 2008/09/28 11:17:12 mjf Exp $ */
2 1.8.2.2 mjf
3 1.8.2.2 mjf /*-
4 1.8.2.2 mjf * Copyright (c) 2008 David Young. All rights reserved.
5 1.8.2.2 mjf *
6 1.8.2.2 mjf * Redistribution and use in source and binary forms, with or without
7 1.8.2.2 mjf * modification, are permitted provided that the following conditions
8 1.8.2.2 mjf * are met:
9 1.8.2.2 mjf * 1. Redistributions of source code must retain the above copyright
10 1.8.2.2 mjf * notice, this list of conditions and the following disclaimer.
11 1.8.2.2 mjf * 2. Redistributions in binary form must reproduce the above copyright
12 1.8.2.2 mjf * notice, this list of conditions and the following disclaimer in the
13 1.8.2.2 mjf * documentation and/or other materials provided with the distribution.
14 1.8.2.2 mjf *
15 1.8.2.2 mjf * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 1.8.2.2 mjf * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 1.8.2.2 mjf * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 1.8.2.2 mjf * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 1.8.2.2 mjf * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 1.8.2.2 mjf * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 1.8.2.2 mjf * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 1.8.2.2 mjf * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 1.8.2.2 mjf * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 1.8.2.2 mjf * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25 1.8.2.2 mjf * SUCH DAMAGE.
26 1.8.2.2 mjf */
27 1.8.2.2 mjf
28 1.8.2.3 mjf #include <sys/cdefs.h>
29 1.8.2.3 mjf #ifndef lint
30 1.8.2.3 mjf __RCSID("$NetBSD: parse.c,v 1.8.2.3 2008/09/28 11:17:12 mjf Exp $");
31 1.8.2.3 mjf #endif /* not lint */
32 1.8.2.3 mjf
33 1.8.2.2 mjf #include <err.h>
34 1.8.2.2 mjf #include <errno.h>
35 1.8.2.2 mjf #include <limits.h>
36 1.8.2.2 mjf #include <netdb.h>
37 1.8.2.2 mjf #include <stddef.h>
38 1.8.2.2 mjf #include <stdio.h>
39 1.8.2.2 mjf #include <stdlib.h>
40 1.8.2.2 mjf #include <string.h>
41 1.8.2.2 mjf
42 1.8.2.2 mjf #include <arpa/inet.h>
43 1.8.2.2 mjf #include <sys/param.h>
44 1.8.2.2 mjf #include <net/if.h>
45 1.8.2.2 mjf #include <net/if_dl.h>
46 1.8.2.2 mjf #include <netatalk/at.h>
47 1.8.2.2 mjf #include <netiso/iso.h>
48 1.8.2.2 mjf
49 1.8.2.2 mjf #include "env.h"
50 1.8.2.2 mjf #include "parse.h"
51 1.8.2.2 mjf #include "util.h"
52 1.8.2.2 mjf
53 1.8.2.2 mjf #define dbg_warnx(__fmt, ...) /* empty */
54 1.8.2.2 mjf
55 1.8.2.2 mjf static int parser_default_init(struct parser *);
56 1.8.2.2 mjf static int pbranch_init(struct parser *);
57 1.8.2.2 mjf static int pkw_init(struct parser *);
58 1.8.2.2 mjf
59 1.8.2.2 mjf static int pterm_match(const struct parser *, const struct match *,
60 1.8.2.2 mjf struct match *, int, const char *);
61 1.8.2.2 mjf
62 1.8.2.2 mjf static int paddr_match(const struct parser *, const struct match *,
63 1.8.2.2 mjf struct match *, int, const char *);
64 1.8.2.2 mjf
65 1.8.2.2 mjf static int pbranch_match(const struct parser *, const struct match *,
66 1.8.2.2 mjf struct match *, int, const char *);
67 1.8.2.2 mjf
68 1.8.2.2 mjf static int piface_match(const struct parser *, const struct match *,
69 1.8.2.2 mjf struct match *, int, const char *);
70 1.8.2.2 mjf
71 1.8.2.2 mjf static int pstr_match(const struct parser *, const struct match *,
72 1.8.2.2 mjf struct match *, int, const char *);
73 1.8.2.2 mjf
74 1.8.2.2 mjf static int pinteger_match(const struct parser *, const struct match *,
75 1.8.2.2 mjf struct match *, int, const char *);
76 1.8.2.2 mjf
77 1.8.2.2 mjf static int pkw_match(const struct parser *, const struct match *,
78 1.8.2.2 mjf struct match *, int, const char *);
79 1.8.2.2 mjf
80 1.8.2.2 mjf const struct parser_methods pterm_methods = {
81 1.8.2.2 mjf .pm_match = pterm_match
82 1.8.2.2 mjf , .pm_init = NULL
83 1.8.2.2 mjf };
84 1.8.2.2 mjf
85 1.8.2.2 mjf const struct parser_methods pstr_methods = {
86 1.8.2.2 mjf .pm_match = pstr_match
87 1.8.2.2 mjf , .pm_init = parser_default_init
88 1.8.2.2 mjf };
89 1.8.2.2 mjf
90 1.8.2.2 mjf const struct parser_methods pinteger_methods = {
91 1.8.2.2 mjf .pm_match = pinteger_match
92 1.8.2.2 mjf , .pm_init = parser_default_init
93 1.8.2.2 mjf };
94 1.8.2.2 mjf
95 1.8.2.2 mjf const struct parser_methods paddr_methods = {
96 1.8.2.2 mjf .pm_match = paddr_match
97 1.8.2.2 mjf , .pm_init = parser_default_init
98 1.8.2.2 mjf };
99 1.8.2.2 mjf
100 1.8.2.2 mjf const struct parser_methods piface_methods = {
101 1.8.2.2 mjf .pm_match = piface_match
102 1.8.2.2 mjf , .pm_init = parser_default_init
103 1.8.2.2 mjf };
104 1.8.2.2 mjf
105 1.8.2.2 mjf const struct parser_methods pbranch_methods = {
106 1.8.2.2 mjf .pm_match = pbranch_match
107 1.8.2.2 mjf , .pm_init = pbranch_init
108 1.8.2.2 mjf };
109 1.8.2.2 mjf
110 1.8.2.2 mjf const struct parser_methods pkw_methods = {
111 1.8.2.2 mjf .pm_match = pkw_match
112 1.8.2.2 mjf , .pm_init = pkw_init
113 1.8.2.2 mjf };
114 1.8.2.2 mjf
115 1.8.2.2 mjf static int
116 1.8.2.2 mjf match_setenv(const struct match *im, struct match *om, const char *key,
117 1.8.2.2 mjf prop_object_t o)
118 1.8.2.2 mjf {
119 1.8.2.2 mjf if (im == NULL)
120 1.8.2.2 mjf om->m_env = prop_dictionary_create();
121 1.8.2.2 mjf else
122 1.8.2.2 mjf om->m_env = prop_dictionary_copy(im->m_env);
123 1.8.2.2 mjf
124 1.8.2.2 mjf if (om->m_env == NULL)
125 1.8.2.2 mjf goto delobj;
126 1.8.2.2 mjf
127 1.8.2.2 mjf if (key != NULL && !prop_dictionary_set(om->m_env, key, o))
128 1.8.2.2 mjf goto deldict;
129 1.8.2.2 mjf
130 1.8.2.2 mjf if (o != NULL)
131 1.8.2.2 mjf prop_object_release((prop_object_t)o);
132 1.8.2.2 mjf
133 1.8.2.2 mjf return 0;
134 1.8.2.2 mjf deldict:
135 1.8.2.2 mjf prop_object_release((prop_object_t)om->m_env);
136 1.8.2.2 mjf om->m_env = NULL;
137 1.8.2.2 mjf delobj:
138 1.8.2.2 mjf prop_object_release((prop_object_t)o);
139 1.8.2.2 mjf errno = ENOMEM;
140 1.8.2.2 mjf return -1;
141 1.8.2.2 mjf }
142 1.8.2.2 mjf
143 1.8.2.2 mjf int
144 1.8.2.2 mjf pstr_match(const struct parser *p, const struct match *im, struct match *om,
145 1.8.2.2 mjf int argidx, const char *arg)
146 1.8.2.2 mjf {
147 1.8.2.2 mjf prop_object_t o;
148 1.8.2.2 mjf const struct pstr *ps = (const struct pstr *)p;
149 1.8.2.2 mjf uint8_t buf[128];
150 1.8.2.2 mjf int len;
151 1.8.2.2 mjf
152 1.8.2.2 mjf if (arg == NULL) {
153 1.8.2.2 mjf errno = EINVAL;
154 1.8.2.2 mjf return -1;
155 1.8.2.2 mjf }
156 1.8.2.2 mjf
157 1.8.2.2 mjf len = (int)sizeof(buf);
158 1.8.2.2 mjf if (get_string(arg, NULL, buf, &len) == NULL) {
159 1.8.2.2 mjf errno = EINVAL;
160 1.8.2.2 mjf return -1;
161 1.8.2.2 mjf }
162 1.8.2.2 mjf
163 1.8.2.2 mjf o = (prop_object_t)prop_data_create_data(buf, len);
164 1.8.2.2 mjf
165 1.8.2.2 mjf if (o == NULL) {
166 1.8.2.2 mjf errno = ENOMEM;
167 1.8.2.2 mjf return -1;
168 1.8.2.2 mjf }
169 1.8.2.2 mjf
170 1.8.2.2 mjf if (match_setenv(im, om, ps->ps_key, o) == -1)
171 1.8.2.2 mjf return -1;
172 1.8.2.2 mjf
173 1.8.2.2 mjf om->m_argidx = argidx;
174 1.8.2.2 mjf om->m_parser = p;
175 1.8.2.2 mjf om->m_nextparser = p->p_nextparser;
176 1.8.2.2 mjf
177 1.8.2.2 mjf return 0;
178 1.8.2.2 mjf }
179 1.8.2.2 mjf
180 1.8.2.2 mjf int
181 1.8.2.2 mjf pinteger_match(const struct parser *p, const struct match *im, struct match *om,
182 1.8.2.2 mjf int argidx, const char *arg)
183 1.8.2.2 mjf {
184 1.8.2.2 mjf prop_object_t o;
185 1.8.2.2 mjf const struct pinteger *pi = (const struct pinteger *)p;
186 1.8.2.2 mjf char *end;
187 1.8.2.2 mjf int64_t val;
188 1.8.2.2 mjf
189 1.8.2.2 mjf if (arg == NULL) {
190 1.8.2.2 mjf errno = EINVAL;
191 1.8.2.2 mjf return -1;
192 1.8.2.2 mjf }
193 1.8.2.2 mjf
194 1.8.2.2 mjf val = strtoimax(arg, &end, pi->pi_base);
195 1.8.2.2 mjf if ((val == INTMAX_MIN || val == INTMAX_MAX) && errno == ERANGE)
196 1.8.2.2 mjf return -1;
197 1.8.2.2 mjf
198 1.8.2.2 mjf if (*end != '\0') {
199 1.8.2.2 mjf errno = EINVAL;
200 1.8.2.2 mjf return -1;
201 1.8.2.2 mjf }
202 1.8.2.2 mjf
203 1.8.2.2 mjf if (val < pi->pi_min || val > pi->pi_max) {
204 1.8.2.2 mjf errno = ERANGE;
205 1.8.2.2 mjf return -1;
206 1.8.2.2 mjf }
207 1.8.2.2 mjf
208 1.8.2.2 mjf o = (prop_object_t)prop_number_create_integer(val);
209 1.8.2.2 mjf
210 1.8.2.2 mjf if (o == NULL) {
211 1.8.2.2 mjf errno = ENOMEM;
212 1.8.2.2 mjf return -1;
213 1.8.2.2 mjf }
214 1.8.2.2 mjf
215 1.8.2.2 mjf if (match_setenv(im, om, pi->pi_key, o) == -1)
216 1.8.2.2 mjf return -1;
217 1.8.2.2 mjf
218 1.8.2.2 mjf om->m_argidx = argidx;
219 1.8.2.2 mjf om->m_parser = p;
220 1.8.2.2 mjf om->m_nextparser = p->p_nextparser;
221 1.8.2.2 mjf
222 1.8.2.2 mjf return 0;
223 1.8.2.2 mjf }
224 1.8.2.2 mjf
225 1.8.2.2 mjf static int
226 1.8.2.2 mjf parse_linkaddr(const char *addr, struct sockaddr_storage *ss)
227 1.8.2.2 mjf {
228 1.8.2.2 mjf static const size_t maxlen =
229 1.8.2.2 mjf sizeof(*ss) - offsetof(struct sockaddr_dl, sdl_data[0]);
230 1.8.2.2 mjf enum {
231 1.8.2.2 mjf LLADDR_S_INITIAL = 0,
232 1.8.2.2 mjf LLADDR_S_ONE_OCTET = 1,
233 1.8.2.2 mjf LLADDR_S_TWO_OCTETS = 2,
234 1.8.2.2 mjf LLADDR_S_COLON = 3
235 1.8.2.2 mjf } state = LLADDR_S_INITIAL;
236 1.8.2.2 mjf uint8_t octet = 0, val;
237 1.8.2.2 mjf struct sockaddr_dl *sdl;
238 1.8.2.2 mjf const char *p;
239 1.8.2.2 mjf int i;
240 1.8.2.2 mjf
241 1.8.2.2 mjf memset(ss, 0, sizeof(*ss));
242 1.8.2.2 mjf ss->ss_family = AF_LINK;
243 1.8.2.2 mjf sdl = (struct sockaddr_dl *)ss;
244 1.8.2.2 mjf
245 1.8.2.2 mjf for (i = 0, p = addr; i < maxlen; p++) {
246 1.8.2.2 mjf dbg_warnx("%s.%d: *p == %c, state %d", __func__, __LINE__, *p,
247 1.8.2.2 mjf state);
248 1.8.2.2 mjf if (*p == '\0') {
249 1.8.2.2 mjf dbg_warnx("%s.%d", __func__, __LINE__);
250 1.8.2.2 mjf if (state != LLADDR_S_ONE_OCTET &&
251 1.8.2.2 mjf state != LLADDR_S_TWO_OCTETS)
252 1.8.2.2 mjf return -1;
253 1.8.2.2 mjf dbg_warnx("%s.%d", __func__, __LINE__);
254 1.8.2.2 mjf sdl->sdl_data[i++] = octet;
255 1.8.2.2 mjf sdl->sdl_len =
256 1.8.2.2 mjf offsetof(struct sockaddr_dl, sdl_data[i]);
257 1.8.2.2 mjf sdl->sdl_alen = i;
258 1.8.2.2 mjf return 0;
259 1.8.2.2 mjf }
260 1.8.2.2 mjf if (*p == ':') {
261 1.8.2.2 mjf dbg_warnx("%s.%d", __func__, __LINE__);
262 1.8.2.2 mjf if (state != LLADDR_S_ONE_OCTET &&
263 1.8.2.2 mjf state != LLADDR_S_TWO_OCTETS)
264 1.8.2.2 mjf return -1;
265 1.8.2.2 mjf dbg_warnx("%s.%d", __func__, __LINE__);
266 1.8.2.2 mjf sdl->sdl_data[i++] = octet;
267 1.8.2.2 mjf state = LLADDR_S_COLON;
268 1.8.2.2 mjf continue;
269 1.8.2.2 mjf }
270 1.8.2.2 mjf if ('a' <= *p && *p <= 'f')
271 1.8.2.2 mjf val = 10 + *p - 'a';
272 1.8.2.2 mjf else if ('A' <= *p && *p <= 'F')
273 1.8.2.2 mjf val = 10 + *p - 'A';
274 1.8.2.2 mjf else if ('0' <= *p && *p <= '9')
275 1.8.2.2 mjf val = *p - '0';
276 1.8.2.2 mjf else
277 1.8.2.2 mjf return -1;
278 1.8.2.2 mjf
279 1.8.2.2 mjf dbg_warnx("%s.%d", __func__, __LINE__);
280 1.8.2.2 mjf if (state == LLADDR_S_ONE_OCTET) {
281 1.8.2.2 mjf state = LLADDR_S_TWO_OCTETS;
282 1.8.2.2 mjf octet <<= 4;
283 1.8.2.2 mjf octet |= val;
284 1.8.2.2 mjf } else if (state != LLADDR_S_INITIAL && state != LLADDR_S_COLON)
285 1.8.2.2 mjf return -1;
286 1.8.2.2 mjf else {
287 1.8.2.2 mjf state = LLADDR_S_ONE_OCTET;
288 1.8.2.2 mjf octet = val;
289 1.8.2.2 mjf }
290 1.8.2.2 mjf dbg_warnx("%s.%d", __func__, __LINE__);
291 1.8.2.2 mjf }
292 1.8.2.2 mjf return -1;
293 1.8.2.2 mjf }
294 1.8.2.2 mjf
295 1.8.2.2 mjf static int
296 1.8.2.2 mjf paddr_match(const struct parser *p, const struct match *im, struct match *om,
297 1.8.2.2 mjf int argidx, const char *arg0)
298 1.8.2.2 mjf {
299 1.8.2.2 mjf unsigned int net, node;
300 1.8.2.2 mjf int nread;
301 1.8.2.2 mjf union {
302 1.8.2.2 mjf struct sockaddr sa;
303 1.8.2.2 mjf struct sockaddr_at sat;
304 1.8.2.2 mjf struct sockaddr_iso siso;
305 1.8.2.2 mjf struct sockaddr_in sin;
306 1.8.2.2 mjf struct sockaddr_storage ss;
307 1.8.2.2 mjf } u;
308 1.8.2.2 mjf const struct paddr *pa = (const struct paddr *)p;
309 1.8.2.2 mjf prop_data_t d;
310 1.8.2.2 mjf prop_object_t o;
311 1.8.2.2 mjf int64_t af0;
312 1.8.2.2 mjf int af, rc;
313 1.8.2.2 mjf struct paddr_prefix *pfx, *mask;
314 1.8.2.2 mjf const struct sockaddr *sa = NULL;
315 1.8.2.2 mjf struct addrinfo hints, *result = NULL;
316 1.8.2.2 mjf char *arg, *end, *plen = NULL, *servname0;
317 1.8.2.2 mjf const char *servname;
318 1.8.2.2 mjf long prefixlen = -1;
319 1.8.2.2 mjf size_t len;
320 1.8.2.2 mjf
321 1.8.2.2 mjf if (arg0 == NULL) {
322 1.8.2.2 mjf errno = EINVAL;
323 1.8.2.2 mjf return -1;
324 1.8.2.2 mjf }
325 1.8.2.2 mjf
326 1.8.2.2 mjf if (pa->pa_activator != NULL &&
327 1.8.2.2 mjf prop_dictionary_get(im->m_env, pa->pa_activator) == NULL)
328 1.8.2.2 mjf return -1;
329 1.8.2.2 mjf
330 1.8.2.2 mjf if (pa->pa_deactivator != NULL &&
331 1.8.2.2 mjf prop_dictionary_get(im->m_env, pa->pa_deactivator) != NULL)
332 1.8.2.2 mjf return -1;
333 1.8.2.2 mjf
334 1.8.2.2 mjf if (!prop_dictionary_get_int64(im->m_env, "af", &af0))
335 1.8.2.2 mjf af = AF_UNSPEC;
336 1.8.2.2 mjf else
337 1.8.2.2 mjf af = af0;
338 1.8.2.2 mjf
339 1.8.2.3 mjf memset(&u, 0, sizeof(u));
340 1.8.2.3 mjf
341 1.8.2.2 mjf switch (af) {
342 1.8.2.2 mjf case AF_UNSPEC:
343 1.8.2.2 mjf case AF_INET:
344 1.8.2.2 mjf case AF_INET6:
345 1.8.2.2 mjf if ((arg = strdup(arg0)) == NULL)
346 1.8.2.2 mjf return -1;
347 1.8.2.2 mjf
348 1.8.2.2 mjf servname0 = arg;
349 1.8.2.2 mjf (void)strsep(&servname0, ",");
350 1.8.2.2 mjf servname = (servname0 == NULL) ? "0" : servname0;
351 1.8.2.2 mjf
352 1.8.2.2 mjf if (pa->pa_maskkey == NULL)
353 1.8.2.2 mjf ;
354 1.8.2.2 mjf else if ((plen = strrchr(arg, '/')) != NULL)
355 1.8.2.2 mjf *plen++ = '\0';
356 1.8.2.2 mjf
357 1.8.2.2 mjf memset(&hints, 0, sizeof(hints));
358 1.8.2.2 mjf
359 1.8.2.2 mjf hints.ai_flags = AI_NUMERICHOST | AI_PASSIVE;
360 1.8.2.2 mjf hints.ai_family = af;
361 1.8.2.2 mjf hints.ai_socktype = SOCK_DGRAM;
362 1.8.2.2 mjf
363 1.8.2.2 mjf for (;;) {
364 1.8.2.2 mjf rc = getaddrinfo(arg, servname, &hints, &result);
365 1.8.2.2 mjf if (rc == 0) {
366 1.8.2.2 mjf if (result->ai_next == NULL)
367 1.8.2.2 mjf sa = result->ai_addr;
368 1.8.2.2 mjf else
369 1.8.2.2 mjf errno = EMLINK;
370 1.8.2.2 mjf break;
371 1.8.2.2 mjf } else if ((hints.ai_flags & AI_NUMERICHOST) != 0 &&
372 1.8.2.2 mjf (af == AF_INET || af == AF_UNSPEC) &&
373 1.8.2.2 mjf inet_aton(arg, &u.sin.sin_addr) == 1) {
374 1.8.2.2 mjf u.sin.sin_family = AF_INET;
375 1.8.2.2 mjf u.sin.sin_len = sizeof(u.sin);
376 1.8.2.2 mjf sa = &u.sa;
377 1.8.2.2 mjf break;
378 1.8.2.2 mjf } else if ((hints.ai_flags & AI_NUMERICHOST) == 0 ||
379 1.8.2.2 mjf rc != EAI_NONAME) {
380 1.8.2.2 mjf errno = ENOENT;
381 1.8.2.2 mjf break;
382 1.8.2.2 mjf }
383 1.8.2.2 mjf hints.ai_flags &= ~AI_NUMERICHOST;
384 1.8.2.2 mjf }
385 1.8.2.2 mjf
386 1.8.2.2 mjf
387 1.8.2.2 mjf if (plen == NULL)
388 1.8.2.2 mjf prefixlen = -1;
389 1.8.2.2 mjf else {
390 1.8.2.2 mjf prefixlen = strtol(plen, &end, 10);
391 1.8.2.2 mjf if (end != NULL && *end != '\0')
392 1.8.2.2 mjf sa = NULL;
393 1.8.2.2 mjf if (prefixlen < 0 || prefixlen >= UINT8_MAX) {
394 1.8.2.2 mjf errno = ERANGE;
395 1.8.2.2 mjf sa = NULL;
396 1.8.2.2 mjf }
397 1.8.2.2 mjf }
398 1.8.2.2 mjf
399 1.8.2.2 mjf free(arg);
400 1.8.2.2 mjf if (sa != NULL || af != AF_UNSPEC)
401 1.8.2.2 mjf break;
402 1.8.2.2 mjf /*FALLTHROUGH*/
403 1.8.2.2 mjf case AF_APPLETALK:
404 1.8.2.2 mjf if (sscanf(arg0, "%u.%u%n", &net, &node, &nread) == 2 &&
405 1.8.2.2 mjf net != 0 && net <= 0xffff && node != 0 && node <= 0xfe &&
406 1.8.2.2 mjf arg0[nread] == '\0') {
407 1.8.2.2 mjf u.sat.sat_family = AF_APPLETALK;
408 1.8.2.2 mjf u.sat.sat_len = sizeof(u.sat);
409 1.8.2.2 mjf u.sat.sat_addr.s_net = htons(net);
410 1.8.2.2 mjf u.sat.sat_addr.s_node = node;
411 1.8.2.2 mjf sa = &u.sa;
412 1.8.2.2 mjf }
413 1.8.2.2 mjf break;
414 1.8.2.2 mjf case AF_ISO:
415 1.8.2.2 mjf u.siso.siso_len = sizeof(u.siso);
416 1.8.2.2 mjf u.siso.siso_family = AF_ISO;
417 1.8.2.2 mjf /* XXX iso_addr(3) matches ANYTHING! */
418 1.8.2.2 mjf u.siso.siso_addr = *iso_addr(arg0);
419 1.8.2.2 mjf sa = &u.sa;
420 1.8.2.2 mjf break;
421 1.8.2.2 mjf case AF_LINK:
422 1.8.2.2 mjf if (parse_linkaddr(arg0, &u.ss) == -1)
423 1.8.2.2 mjf sa = NULL;
424 1.8.2.2 mjf else
425 1.8.2.2 mjf sa = &u.sa;
426 1.8.2.2 mjf break;
427 1.8.2.2 mjf }
428 1.8.2.2 mjf
429 1.8.2.2 mjf if (sa == NULL)
430 1.8.2.2 mjf return -1;
431 1.8.2.2 mjf
432 1.8.2.2 mjf len = offsetof(struct paddr_prefix, pfx_addr) + sa->sa_len;
433 1.8.2.2 mjf
434 1.8.2.2 mjf if ((pfx = malloc(len)) == NULL)
435 1.8.2.2 mjf return -1;
436 1.8.2.2 mjf
437 1.8.2.2 mjf #if 0
438 1.8.2.2 mjf {
439 1.8.2.2 mjf int i;
440 1.8.2.2 mjf
441 1.8.2.2 mjf for (i = 0; i < sa->sa_len; i++)
442 1.8.2.2 mjf printf(" %02x", ((const uint8_t *)sa)[i]);
443 1.8.2.2 mjf printf("\n");
444 1.8.2.2 mjf }
445 1.8.2.2 mjf #endif
446 1.8.2.2 mjf
447 1.8.2.2 mjf pfx->pfx_len = (int16_t)prefixlen;
448 1.8.2.2 mjf memcpy(&pfx->pfx_addr, sa, sa->sa_len);
449 1.8.2.2 mjf af = sa->sa_family;
450 1.8.2.2 mjf
451 1.8.2.2 mjf if (result != NULL)
452 1.8.2.2 mjf freeaddrinfo(result);
453 1.8.2.2 mjf
454 1.8.2.2 mjf o = (prop_object_t)prop_data_create_data(pfx, len);
455 1.8.2.2 mjf
456 1.8.2.2 mjf free(pfx);
457 1.8.2.2 mjf
458 1.8.2.2 mjf if (o == NULL)
459 1.8.2.2 mjf return -1;
460 1.8.2.2 mjf
461 1.8.2.2 mjf if (match_setenv(im, om, pa->pa_addrkey, o) == -1)
462 1.8.2.2 mjf return -1;
463 1.8.2.2 mjf
464 1.8.2.2 mjf if (pa->pa_maskkey != NULL && plen != NULL) {
465 1.8.2.2 mjf size_t masklen;
466 1.8.2.2 mjf
467 1.8.2.2 mjf if ((mask = prefixlen_to_mask(af, prefixlen)) == NULL) {
468 1.8.2.2 mjf err(EXIT_FAILURE, "%s: prefixlen_to_mask(%d, %ld)",
469 1.8.2.2 mjf __func__, af, prefixlen);
470 1.8.2.2 mjf return -1;
471 1.8.2.2 mjf }
472 1.8.2.2 mjf
473 1.8.2.3 mjf masklen = paddr_prefix_size(mask);
474 1.8.2.2 mjf
475 1.8.2.2 mjf d = prop_data_create_data(mask, masklen);
476 1.8.2.2 mjf free(mask);
477 1.8.2.2 mjf
478 1.8.2.2 mjf if (d == NULL) {
479 1.8.2.2 mjf err(EXIT_FAILURE, "%s: prop_data_create_data",
480 1.8.2.2 mjf __func__);
481 1.8.2.2 mjf return -1;
482 1.8.2.2 mjf }
483 1.8.2.2 mjf
484 1.8.2.2 mjf rc = prop_dictionary_set(om->m_env, pa->pa_maskkey,
485 1.8.2.2 mjf (prop_object_t)d) ? 0 : -1;
486 1.8.2.2 mjf
487 1.8.2.2 mjf prop_object_release((prop_object_t)d);
488 1.8.2.2 mjf
489 1.8.2.2 mjf if (rc != 0) {
490 1.8.2.2 mjf err(EXIT_FAILURE, "%s: prop_dictionary_set", __func__);
491 1.8.2.2 mjf return rc;
492 1.8.2.2 mjf }
493 1.8.2.2 mjf }
494 1.8.2.2 mjf
495 1.8.2.2 mjf om->m_argidx = argidx;
496 1.8.2.2 mjf om->m_parser = p;
497 1.8.2.2 mjf om->m_nextparser = p->p_nextparser;
498 1.8.2.2 mjf return 0;
499 1.8.2.2 mjf }
500 1.8.2.2 mjf
501 1.8.2.2 mjf static int
502 1.8.2.2 mjf pterm_match(const struct parser *p, const struct match *im,
503 1.8.2.2 mjf struct match *om, int argidx, const char *arg)
504 1.8.2.2 mjf {
505 1.8.2.2 mjf const struct pterm *pt = (const struct pterm *)p;
506 1.8.2.2 mjf prop_bool_t b;
507 1.8.2.2 mjf
508 1.8.2.2 mjf if (arg != NULL) {
509 1.8.2.2 mjf errno = EINVAL;
510 1.8.2.2 mjf return -1;
511 1.8.2.2 mjf }
512 1.8.2.2 mjf b = prop_bool_create(true);
513 1.8.2.2 mjf
514 1.8.2.2 mjf if (match_setenv(im, om, pt->pt_key, (prop_object_t)b) == -1)
515 1.8.2.2 mjf return -1;
516 1.8.2.2 mjf
517 1.8.2.2 mjf om->m_argidx = argidx;
518 1.8.2.2 mjf om->m_parser = p;
519 1.8.2.2 mjf om->m_nextparser = NULL;
520 1.8.2.2 mjf return 0;
521 1.8.2.2 mjf }
522 1.8.2.2 mjf
523 1.8.2.2 mjf static int
524 1.8.2.2 mjf piface_match(const struct parser *p, const struct match *im,
525 1.8.2.2 mjf struct match *om, int argidx, const char *arg)
526 1.8.2.2 mjf {
527 1.8.2.2 mjf const struct piface *pif = (const struct piface *)p;
528 1.8.2.2 mjf prop_object_t o;
529 1.8.2.2 mjf
530 1.8.2.2 mjf if (arg == NULL || strlen(arg) > IFNAMSIZ) {
531 1.8.2.2 mjf errno = EINVAL;
532 1.8.2.2 mjf return -1;
533 1.8.2.2 mjf }
534 1.8.2.2 mjf
535 1.8.2.2 mjf if ((o = (prop_object_t)prop_string_create_cstring(arg)) == NULL) {
536 1.8.2.2 mjf errno = ENOMEM;
537 1.8.2.2 mjf return -1;
538 1.8.2.2 mjf }
539 1.8.2.2 mjf
540 1.8.2.2 mjf if (match_setenv(im, om, pif->pif_key, o) == -1)
541 1.8.2.2 mjf return -1;
542 1.8.2.2 mjf
543 1.8.2.2 mjf om->m_argidx = argidx;
544 1.8.2.2 mjf om->m_parser = p;
545 1.8.2.2 mjf om->m_nextparser = p->p_nextparser;
546 1.8.2.2 mjf return 0;
547 1.8.2.2 mjf }
548 1.8.2.2 mjf
549 1.8.2.2 mjf static void
550 1.8.2.2 mjf match_cleanup(struct match *dst)
551 1.8.2.2 mjf {
552 1.8.2.2 mjf if (dst->m_env != NULL)
553 1.8.2.2 mjf prop_object_release((prop_object_t)dst->m_env);
554 1.8.2.2 mjf memset(dst, 0, sizeof(*dst));
555 1.8.2.2 mjf }
556 1.8.2.2 mjf
557 1.8.2.2 mjf static void
558 1.8.2.2 mjf match_copy(struct match *dst, const struct match *src)
559 1.8.2.2 mjf {
560 1.8.2.2 mjf match_cleanup(dst);
561 1.8.2.2 mjf
562 1.8.2.2 mjf prop_object_retain((prop_object_t)src->m_env);
563 1.8.2.2 mjf *dst = *src;
564 1.8.2.2 mjf }
565 1.8.2.2 mjf
566 1.8.2.2 mjf static int
567 1.8.2.2 mjf pbranch_match(const struct parser *p, const struct match *im,
568 1.8.2.2 mjf struct match *om, int argidx, const char *arg)
569 1.8.2.2 mjf {
570 1.8.2.2 mjf const struct parser *nextp;
571 1.8.2.2 mjf struct branch *b;
572 1.8.2.2 mjf const struct pbranch *pb = (const struct pbranch *)p;
573 1.8.2.2 mjf struct match tmpm;
574 1.8.2.2 mjf int nforbid = 0, nmatch = 0, rc;
575 1.8.2.2 mjf parser_match_t matchfunc;
576 1.8.2.2 mjf
577 1.8.2.2 mjf memset(&tmpm, 0, sizeof(tmpm));
578 1.8.2.2 mjf
579 1.8.2.2 mjf SIMPLEQ_FOREACH(b, &pb->pb_branches, b_next) {
580 1.8.2.2 mjf dbg_warnx("%s: b->b_nextparser %p", __func__,
581 1.8.2.2 mjf (const void *)b->b_nextparser);
582 1.8.2.2 mjf nextp = b->b_nextparser;
583 1.8.2.2 mjf if (nextp == NULL) {
584 1.8.2.2 mjf if (arg == NULL) {
585 1.8.2.2 mjf nmatch++;
586 1.8.2.2 mjf match_setenv(im, om, NULL, NULL);
587 1.8.2.2 mjf om->m_nextparser = NULL;
588 1.8.2.2 mjf om->m_parser = p;
589 1.8.2.2 mjf om->m_argidx = argidx;
590 1.8.2.2 mjf }
591 1.8.2.2 mjf continue;
592 1.8.2.2 mjf }
593 1.8.2.2 mjf matchfunc = nextp->p_methods->pm_match;
594 1.8.2.2 mjf rc = (*matchfunc)(nextp, im, &tmpm, argidx, arg);
595 1.8.2.2 mjf if (rc == 0) {
596 1.8.2.2 mjf match_copy(om, &tmpm);
597 1.8.2.2 mjf match_cleanup(&tmpm);
598 1.8.2.2 mjf nmatch++;
599 1.8.2.2 mjf dbg_warnx("%s: branch %s ok", __func__, nextp->p_name);
600 1.8.2.2 mjf if (pb->pb_match_first)
601 1.8.2.2 mjf break;
602 1.8.2.2 mjf } else if (rc == 1) {
603 1.8.2.2 mjf nforbid++;
604 1.8.2.2 mjf if (pb->pb_match_first)
605 1.8.2.2 mjf break;
606 1.8.2.2 mjf } else {
607 1.8.2.2 mjf dbg_warnx("%s: fail branch %s", __func__,
608 1.8.2.2 mjf nextp->p_name);
609 1.8.2.2 mjf }
610 1.8.2.2 mjf }
611 1.8.2.2 mjf switch (nmatch) {
612 1.8.2.2 mjf case 0:
613 1.8.2.2 mjf errno = ENOENT;
614 1.8.2.2 mjf return (nforbid == 0) ? -1 : 1;
615 1.8.2.2 mjf case 1:
616 1.8.2.2 mjf dbg_warnx("%s: branch ok", __func__);
617 1.8.2.2 mjf return 0;
618 1.8.2.2 mjf default:
619 1.8.2.2 mjf match_cleanup(om);
620 1.8.2.2 mjf errno = EMLINK;
621 1.8.2.2 mjf return -1;
622 1.8.2.2 mjf }
623 1.8.2.2 mjf }
624 1.8.2.2 mjf
625 1.8.2.2 mjf static int
626 1.8.2.2 mjf pkw_match(const struct parser *p, const struct match *im,
627 1.8.2.2 mjf struct match *om, int argidx, const char *arg)
628 1.8.2.2 mjf {
629 1.8.2.2 mjf prop_object_t o = NULL;
630 1.8.2.2 mjf struct kwinst *k;
631 1.8.2.2 mjf union kwval *u = NULL;
632 1.8.2.2 mjf const struct pkw *pk = (const struct pkw *)p;
633 1.8.2.2 mjf
634 1.8.2.2 mjf if (arg == NULL) {
635 1.8.2.2 mjf errno = EINVAL;
636 1.8.2.2 mjf return -1;
637 1.8.2.2 mjf }
638 1.8.2.2 mjf
639 1.8.2.2 mjf SIMPLEQ_FOREACH(k, &pk->pk_keywords, k_next) {
640 1.8.2.2 mjf if (k->k_act != NULL &&
641 1.8.2.2 mjf prop_dictionary_get(im->m_env, k->k_act) == NULL)
642 1.8.2.2 mjf continue;
643 1.8.2.2 mjf
644 1.8.2.2 mjf if (k->k_neg && arg[0] == '-' &&
645 1.8.2.2 mjf strcmp(k->k_word, arg + 1) == 0)
646 1.8.2.2 mjf u = &k->k_negu;
647 1.8.2.2 mjf else if (strcmp(k->k_word, arg) == 0)
648 1.8.2.2 mjf u = &k->k_u;
649 1.8.2.2 mjf else
650 1.8.2.2 mjf continue;
651 1.8.2.2 mjf
652 1.8.2.2 mjf if (k->k_altdeact != NULL &&
653 1.8.2.2 mjf prop_dictionary_get(im->m_env, k->k_altdeact) != NULL)
654 1.8.2.2 mjf return 1;
655 1.8.2.2 mjf
656 1.8.2.2 mjf if (k->k_deact != NULL &&
657 1.8.2.2 mjf prop_dictionary_get(im->m_env, k->k_deact) != NULL)
658 1.8.2.2 mjf return 1;
659 1.8.2.2 mjf break;
660 1.8.2.2 mjf }
661 1.8.2.2 mjf if (k == NULL) {
662 1.8.2.2 mjf errno = ENOENT;
663 1.8.2.2 mjf return -1;
664 1.8.2.2 mjf }
665 1.8.2.2 mjf switch (k->k_type) {
666 1.8.2.2 mjf case KW_T_NONE:
667 1.8.2.2 mjf break;
668 1.8.2.2 mjf case KW_T_BOOL:
669 1.8.2.2 mjf o = (prop_object_t)prop_bool_create(u->u_bool);
670 1.8.2.2 mjf if (o == NULL)
671 1.8.2.2 mjf goto err;
672 1.8.2.2 mjf break;
673 1.8.2.2 mjf case KW_T_INT:
674 1.8.2.2 mjf o = (prop_object_t)prop_number_create_integer(u->u_sint);
675 1.8.2.2 mjf if (o == NULL)
676 1.8.2.2 mjf goto err;
677 1.8.2.2 mjf break;
678 1.8.2.2 mjf case KW_T_UINT:
679 1.8.2.2 mjf o = (prop_object_t)prop_number_create_unsigned_integer(
680 1.8.2.2 mjf u->u_uint);
681 1.8.2.2 mjf if (o == NULL)
682 1.8.2.2 mjf goto err;
683 1.8.2.2 mjf break;
684 1.8.2.2 mjf case KW_T_OBJ:
685 1.8.2.2 mjf o = u->u_obj;
686 1.8.2.2 mjf break;
687 1.8.2.2 mjf case KW_T_STR:
688 1.8.2.2 mjf o = (prop_object_t)prop_data_create_data_nocopy(u->u_str,
689 1.8.2.2 mjf strlen(u->u_str));
690 1.8.2.2 mjf if (o == NULL)
691 1.8.2.2 mjf goto err;
692 1.8.2.2 mjf break;
693 1.8.2.2 mjf default:
694 1.8.2.2 mjf errx(EXIT_FAILURE, "unknown keyword type %d", k->k_type);
695 1.8.2.2 mjf }
696 1.8.2.2 mjf
697 1.8.2.2 mjf if (match_setenv(im, om, (o == NULL) ? NULL : k->k_key, o) == -1)
698 1.8.2.2 mjf return -1;
699 1.8.2.2 mjf
700 1.8.2.2 mjf om->m_argidx = argidx;
701 1.8.2.2 mjf om->m_parser = p;
702 1.8.2.2 mjf om->m_nextparser = k->k_nextparser;
703 1.8.2.2 mjf om->m_exec = k->k_exec;
704 1.8.2.2 mjf return 0;
705 1.8.2.2 mjf err:
706 1.8.2.2 mjf errno = ENOMEM;
707 1.8.2.2 mjf return -1;
708 1.8.2.2 mjf }
709 1.8.2.2 mjf
710 1.8.2.2 mjf struct paddr *
711 1.8.2.2 mjf paddr_create(const char *name, parser_exec_t pexec, const char *addrkey,
712 1.8.2.2 mjf const char *maskkey, struct parser *next)
713 1.8.2.2 mjf {
714 1.8.2.2 mjf struct paddr *pa;
715 1.8.2.2 mjf
716 1.8.2.2 mjf if ((pa = calloc(sizeof(*pa), 1)) == NULL)
717 1.8.2.2 mjf return NULL;
718 1.8.2.2 mjf
719 1.8.2.2 mjf pa->pa_parser.p_methods = &paddr_methods;
720 1.8.2.2 mjf pa->pa_parser.p_exec = pexec;
721 1.8.2.2 mjf pa->pa_parser.p_name = name;
722 1.8.2.2 mjf pa->pa_parser.p_nextparser = next;
723 1.8.2.2 mjf
724 1.8.2.2 mjf pa->pa_addrkey = addrkey;
725 1.8.2.2 mjf pa->pa_maskkey = maskkey;
726 1.8.2.2 mjf
727 1.8.2.2 mjf return pa;
728 1.8.2.2 mjf }
729 1.8.2.2 mjf
730 1.8.2.2 mjf struct piface *
731 1.8.2.2 mjf piface_create(const char *name, parser_exec_t pexec, const char *defkey,
732 1.8.2.2 mjf struct parser *defnext)
733 1.8.2.2 mjf {
734 1.8.2.2 mjf struct piface *pif;
735 1.8.2.2 mjf
736 1.8.2.2 mjf if ((pif = calloc(sizeof(*pif), 1)) == NULL)
737 1.8.2.2 mjf return NULL;
738 1.8.2.2 mjf
739 1.8.2.2 mjf pif->pif_parser.p_methods = &piface_methods;
740 1.8.2.2 mjf pif->pif_parser.p_exec = pexec;
741 1.8.2.2 mjf pif->pif_parser.p_name = name;
742 1.8.2.2 mjf pif->pif_parser.p_nextparser = defnext;
743 1.8.2.2 mjf
744 1.8.2.2 mjf pif->pif_key = defkey;
745 1.8.2.2 mjf
746 1.8.2.2 mjf return pif;
747 1.8.2.2 mjf }
748 1.8.2.2 mjf
749 1.8.2.2 mjf int
750 1.8.2.3 mjf pbranch_addbranch(struct pbranch *pb, struct parser *p)
751 1.8.2.3 mjf {
752 1.8.2.3 mjf struct branch *b;
753 1.8.2.3 mjf
754 1.8.2.3 mjf if ((b = malloc(sizeof(*b))) == NULL)
755 1.8.2.3 mjf return -1;
756 1.8.2.3 mjf b->b_nextparser = p;
757 1.8.2.3 mjf SIMPLEQ_INSERT_HEAD(&pb->pb_branches, b, b_next);
758 1.8.2.3 mjf pb->pb_parser.p_initialized = false;
759 1.8.2.3 mjf return parser_init(&pb->pb_parser);
760 1.8.2.3 mjf }
761 1.8.2.3 mjf
762 1.8.2.3 mjf int
763 1.8.2.2 mjf pbranch_setbranches(struct pbranch *pb, const struct branch *brs, size_t nbr)
764 1.8.2.2 mjf {
765 1.8.2.2 mjf struct branch *b;
766 1.8.2.2 mjf int i;
767 1.8.2.2 mjf
768 1.8.2.2 mjf dbg_warnx("%s: nbr %zu", __func__, nbr);
769 1.8.2.2 mjf
770 1.8.2.2 mjf while ((b = SIMPLEQ_FIRST(&pb->pb_branches)) != NULL) {
771 1.8.2.2 mjf SIMPLEQ_REMOVE_HEAD(&pb->pb_branches, b_next);
772 1.8.2.2 mjf free(b);
773 1.8.2.2 mjf }
774 1.8.2.2 mjf
775 1.8.2.2 mjf for (i = 0; i < nbr; i++) {
776 1.8.2.2 mjf if ((b = malloc(sizeof(*b))) == NULL)
777 1.8.2.2 mjf goto err;
778 1.8.2.2 mjf *b = brs[i];
779 1.8.2.2 mjf dbg_warnx("%s: b->b_nextparser %p", __func__,
780 1.8.2.2 mjf (const void *)b->b_nextparser);
781 1.8.2.2 mjf SIMPLEQ_INSERT_TAIL(&pb->pb_branches, b, b_next);
782 1.8.2.2 mjf }
783 1.8.2.2 mjf
784 1.8.2.2 mjf return 0;
785 1.8.2.2 mjf err:
786 1.8.2.2 mjf while ((b = SIMPLEQ_FIRST(&pb->pb_branches)) != NULL) {
787 1.8.2.2 mjf SIMPLEQ_REMOVE_HEAD(&pb->pb_branches, b_next);
788 1.8.2.2 mjf free(b);
789 1.8.2.2 mjf }
790 1.8.2.2 mjf return -1;
791 1.8.2.2 mjf }
792 1.8.2.2 mjf
793 1.8.2.2 mjf static int
794 1.8.2.2 mjf pbranch_init(struct parser *p)
795 1.8.2.2 mjf {
796 1.8.2.2 mjf struct branch *b;
797 1.8.2.2 mjf struct pbranch *pb = (struct pbranch *)p;
798 1.8.2.2 mjf struct parser *np;
799 1.8.2.2 mjf
800 1.8.2.3 mjf if (pb->pb_nbrinit == 0)
801 1.8.2.3 mjf ;
802 1.8.2.3 mjf else if (pbranch_setbranches(pb, pb->pb_brinit, pb->pb_nbrinit) == -1)
803 1.8.2.2 mjf return -1;
804 1.8.2.2 mjf
805 1.8.2.3 mjf pb->pb_nbrinit = 0;
806 1.8.2.3 mjf
807 1.8.2.2 mjf SIMPLEQ_FOREACH(b, &pb->pb_branches, b_next) {
808 1.8.2.2 mjf np = b->b_nextparser;
809 1.8.2.2 mjf if (np != NULL && parser_init(np) == -1)
810 1.8.2.2 mjf return -1;
811 1.8.2.2 mjf }
812 1.8.2.2 mjf return 0;
813 1.8.2.2 mjf }
814 1.8.2.2 mjf
815 1.8.2.2 mjf struct pbranch *
816 1.8.2.2 mjf pbranch_create(const char *name, const struct branch *brs, size_t nbr,
817 1.8.2.2 mjf bool match_first)
818 1.8.2.2 mjf {
819 1.8.2.2 mjf struct pbranch *pb;
820 1.8.2.2 mjf
821 1.8.2.2 mjf dbg_warnx("%s: nbr %zu", __func__, nbr);
822 1.8.2.2 mjf
823 1.8.2.2 mjf if ((pb = calloc(1, sizeof(*pb))) == NULL)
824 1.8.2.2 mjf return NULL;
825 1.8.2.2 mjf
826 1.8.2.2 mjf pb->pb_parser.p_methods = &pbranch_methods;
827 1.8.2.2 mjf pb->pb_parser.p_name = name;
828 1.8.2.2 mjf
829 1.8.2.2 mjf SIMPLEQ_INIT(&pb->pb_branches);
830 1.8.2.2 mjf
831 1.8.2.2 mjf if (pbranch_setbranches(pb, brs, nbr) == -1)
832 1.8.2.2 mjf goto post_pb_err;
833 1.8.2.2 mjf
834 1.8.2.2 mjf pb->pb_match_first = match_first;
835 1.8.2.2 mjf return pb;
836 1.8.2.2 mjf post_pb_err:
837 1.8.2.2 mjf free(pb);
838 1.8.2.2 mjf return NULL;
839 1.8.2.2 mjf }
840 1.8.2.2 mjf
841 1.8.2.2 mjf static int
842 1.8.2.2 mjf parser_default_init(struct parser *p)
843 1.8.2.2 mjf {
844 1.8.2.2 mjf struct parser *np;
845 1.8.2.2 mjf
846 1.8.2.2 mjf np = p->p_nextparser;
847 1.8.2.2 mjf if (np != NULL && parser_init(np) == -1)
848 1.8.2.2 mjf return -1;
849 1.8.2.2 mjf
850 1.8.2.2 mjf return 0;
851 1.8.2.2 mjf }
852 1.8.2.2 mjf
853 1.8.2.2 mjf static int
854 1.8.2.2 mjf pkw_setwords(struct pkw *pk, parser_exec_t defexec, const char *defkey,
855 1.8.2.2 mjf const struct kwinst *kws, size_t nkw, struct parser *defnext)
856 1.8.2.2 mjf {
857 1.8.2.2 mjf struct kwinst *k;
858 1.8.2.2 mjf int i;
859 1.8.2.2 mjf
860 1.8.2.2 mjf for (i = 0; i < nkw; i++) {
861 1.8.2.3 mjf if (kws[i].k_word == NULL)
862 1.8.2.3 mjf continue;
863 1.8.2.2 mjf if ((k = malloc(sizeof(*k))) == NULL)
864 1.8.2.2 mjf goto post_pk_err;
865 1.8.2.2 mjf *k = kws[i];
866 1.8.2.2 mjf if (k->k_nextparser == NULL)
867 1.8.2.2 mjf k->k_nextparser = defnext;
868 1.8.2.2 mjf if (k->k_key == NULL)
869 1.8.2.2 mjf k->k_key = defkey;
870 1.8.2.2 mjf if (k->k_exec == NULL)
871 1.8.2.2 mjf k->k_exec = defexec;
872 1.8.2.2 mjf SIMPLEQ_INSERT_TAIL(&pk->pk_keywords, k, k_next);
873 1.8.2.2 mjf }
874 1.8.2.2 mjf return 0;
875 1.8.2.2 mjf
876 1.8.2.2 mjf post_pk_err:
877 1.8.2.2 mjf while ((k = SIMPLEQ_FIRST(&pk->pk_keywords)) != NULL) {
878 1.8.2.2 mjf SIMPLEQ_REMOVE_HEAD(&pk->pk_keywords, k_next);
879 1.8.2.2 mjf free(k);
880 1.8.2.2 mjf }
881 1.8.2.2 mjf return -1;
882 1.8.2.2 mjf }
883 1.8.2.2 mjf
884 1.8.2.2 mjf static int
885 1.8.2.2 mjf pkw_init(struct parser *p)
886 1.8.2.2 mjf {
887 1.8.2.2 mjf struct kwinst *k;
888 1.8.2.2 mjf struct pkw *pk = (struct pkw *)p;
889 1.8.2.2 mjf struct parser *np;
890 1.8.2.2 mjf
891 1.8.2.3 mjf if (pk->pk_nkwinit == 0)
892 1.8.2.3 mjf ;
893 1.8.2.3 mjf else if (pkw_setwords(pk, pk->pk_execinit, pk->pk_keyinit,
894 1.8.2.3 mjf pk->pk_kwinit, pk->pk_nkwinit, pk->pk_nextinit) == -1)
895 1.8.2.2 mjf return -1;
896 1.8.2.3 mjf
897 1.8.2.3 mjf pk->pk_nkwinit = 0;
898 1.8.2.3 mjf
899 1.8.2.2 mjf SIMPLEQ_FOREACH(k, &pk->pk_keywords, k_next) {
900 1.8.2.2 mjf np = k->k_nextparser;
901 1.8.2.2 mjf if (np != NULL && parser_init(np) == -1)
902 1.8.2.2 mjf return -1;
903 1.8.2.2 mjf }
904 1.8.2.2 mjf return 0;
905 1.8.2.2 mjf }
906 1.8.2.2 mjf
907 1.8.2.2 mjf struct pkw *
908 1.8.2.2 mjf pkw_create(const char *name, parser_exec_t defexec, const char *defkey,
909 1.8.2.2 mjf const struct kwinst *kws, size_t nkw, struct parser *defnext)
910 1.8.2.2 mjf {
911 1.8.2.2 mjf struct pkw *pk;
912 1.8.2.2 mjf
913 1.8.2.2 mjf if ((pk = calloc(1, sizeof(*pk))) == NULL)
914 1.8.2.2 mjf return NULL;
915 1.8.2.2 mjf
916 1.8.2.2 mjf pk->pk_parser.p_methods = &pkw_methods;
917 1.8.2.2 mjf pk->pk_parser.p_exec = defexec;
918 1.8.2.2 mjf pk->pk_parser.p_name = name;
919 1.8.2.2 mjf
920 1.8.2.2 mjf SIMPLEQ_INIT(&pk->pk_keywords);
921 1.8.2.2 mjf
922 1.8.2.2 mjf if (pkw_setwords(pk, defexec, defkey, kws, nkw, defnext) == -1)
923 1.8.2.2 mjf goto err;
924 1.8.2.2 mjf
925 1.8.2.2 mjf return pk;
926 1.8.2.2 mjf err:
927 1.8.2.2 mjf free(pk);
928 1.8.2.2 mjf return NULL;
929 1.8.2.2 mjf }
930 1.8.2.2 mjf
931 1.8.2.2 mjf int
932 1.8.2.2 mjf parse(int argc, char **argv, const struct parser *p0, struct match *matches,
933 1.8.2.2 mjf size_t *nmatch, int *narg)
934 1.8.2.2 mjf {
935 1.8.2.2 mjf int i, rc = 0;
936 1.8.2.2 mjf struct match *lastm = NULL, *m = matches;
937 1.8.2.2 mjf const struct parser *p = p0;
938 1.8.2.2 mjf
939 1.8.2.2 mjf for (i = 0; i < argc && p != NULL; i++) {
940 1.8.2.2 mjf if (m - matches >= *nmatch) {
941 1.8.2.2 mjf errno = EFBIG;
942 1.8.2.2 mjf rc = -1;
943 1.8.2.2 mjf break;
944 1.8.2.2 mjf }
945 1.8.2.2 mjf rc = (*p->p_methods->pm_match)(p, lastm, m, i, argv[i]);
946 1.8.2.2 mjf if (rc != 0)
947 1.8.2.2 mjf goto out;
948 1.8.2.2 mjf p = m->m_nextparser;
949 1.8.2.2 mjf lastm = m++;
950 1.8.2.2 mjf }
951 1.8.2.2 mjf for (; m - matches < *nmatch && p != NULL; ) {
952 1.8.2.2 mjf rc = (*p->p_methods->pm_match)(p, lastm, m, i, NULL);
953 1.8.2.2 mjf if (rc != 0)
954 1.8.2.2 mjf break;
955 1.8.2.2 mjf p = m->m_nextparser;
956 1.8.2.2 mjf lastm = m++;
957 1.8.2.2 mjf }
958 1.8.2.2 mjf out:
959 1.8.2.2 mjf *nmatch = m - matches;
960 1.8.2.2 mjf *narg = i;
961 1.8.2.2 mjf return rc;
962 1.8.2.2 mjf }
963 1.8.2.2 mjf
964 1.8.2.2 mjf int
965 1.8.2.3 mjf matches_exec(const struct match *matches, prop_dictionary_t oenv, size_t nmatch)
966 1.8.2.2 mjf {
967 1.8.2.2 mjf int i, rc = 0;
968 1.8.2.2 mjf const struct match *m;
969 1.8.2.2 mjf parser_exec_t pexec;
970 1.8.2.2 mjf prop_dictionary_t d;
971 1.8.2.2 mjf
972 1.8.2.2 mjf for (i = 0; i < nmatch; i++) {
973 1.8.2.2 mjf m = &matches[i];
974 1.8.2.2 mjf dbg_warnx("%s.%d: i %d", __func__, __LINE__, i);
975 1.8.2.2 mjf pexec = (m->m_parser->p_exec != NULL)
976 1.8.2.2 mjf ? m->m_parser->p_exec : m->m_exec;
977 1.8.2.2 mjf if (pexec == NULL)
978 1.8.2.2 mjf continue;
979 1.8.2.2 mjf dbg_warnx("%s.%d: m->m_parser->p_name %s", __func__, __LINE__,
980 1.8.2.2 mjf m->m_parser->p_name);
981 1.8.2.3 mjf d = prop_dictionary_augment(m->m_env, oenv);
982 1.8.2.3 mjf rc = (*pexec)(d, oenv);
983 1.8.2.2 mjf prop_object_release((prop_object_t)d);
984 1.8.2.2 mjf if (rc == -1)
985 1.8.2.2 mjf break;
986 1.8.2.2 mjf }
987 1.8.2.2 mjf return rc;
988 1.8.2.2 mjf }
989 1.8.2.3 mjf
990 1.8.2.3 mjf int
991 1.8.2.3 mjf parser_init(struct parser *p)
992 1.8.2.3 mjf {
993 1.8.2.3 mjf if (p->p_initialized)
994 1.8.2.3 mjf return 0;
995 1.8.2.3 mjf p->p_initialized = true;
996 1.8.2.3 mjf if (p->p_methods->pm_init == NULL)
997 1.8.2.3 mjf return 0;
998 1.8.2.3 mjf return (*p->p_methods->pm_init)(p);
999 1.8.2.3 mjf }
1000