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