parse.c 72 KB
Newer Older
1 2 3 4 5
/* parse.c

   Common parser code for dhcpd and dhclient. */

/*
Ted Lemon's avatar
Ted Lemon committed
6 7 8 9 10 11
 * Copyright (c) 1996-1999 Internet Software Consortium.
 * Use is subject to license terms which appear in the file named
 * ISC-LICENSE that should have accompanied this file when you
 * received it.   If a file named ISC-LICENSE did not accompany this
 * file, or you are not sure the one you have is correct, you may
 * obtain an applicable copy of the license at:
12
 *
Ted Lemon's avatar
Ted Lemon committed
13
 *             http://www.isc.org/isc-license-1.0.html. 
14
 *
Ted Lemon's avatar
Ted Lemon committed
15 16 17
 * This file is part of the ISC DHCP distribution.   The documentation
 * associated with this file is listed in the file DOCUMENTATION,
 * included in the top-level directory of this release.
18
 *
Ted Lemon's avatar
Ted Lemon committed
19 20
 * Support and other services are available for ISC products - see
 * http://www.isc.org for more information.
21 22 23 24
 */

#ifndef lint
static char copyright[] =
25
"$Id: parse.c,v 1.57 2000/01/05 18:03:49 mellon Exp $ Copyright (c) 1995, 1996, 1997, 1998, 1999 The Internet Software Consortium.  All rights reserved.\n";
26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44
#endif /* not lint */

#include "dhcpd.h"

/* Skip to the semicolon ending the current statement.   If we encounter
   braces, the matching closing brace terminates the statement.   If we
   encounter a right brace but haven't encountered a left brace, return
   leaving the brace in the token buffer for the caller.   If we see a
   semicolon and haven't seen a left brace, return.   This lets us skip
   over:

   	statement;
	statement foo bar { }
	statement foo bar { statement { } }
	statement}
 
	...et cetera. */

void skip_to_semi (cfile)
45
	struct parse *cfile;
46 47 48 49 50
{
	skip_to_rbrace (cfile, 0);
}

void skip_to_rbrace (cfile, brace_count)
51
	struct parse *cfile;
52
	int brace_count;
53
{
54
	enum dhcp_token token;
55
	const char *val;
56 57 58 59

	do {
		token = peek_token (&val, cfile);
		if (token == RBRACE) {
60
			token = next_token (&val, cfile);
61 62 63 64 65 66 67 68 69 70
			if (brace_count) {
				if (!--brace_count)
					return;
			} else
				return;
		} else if (token == LBRACE) {
			brace_count++;
		} else if (token == SEMI && !brace_count) {
			token = next_token (&val, cfile);
			return;
71 72 73 74 75 76
		} else if (token == EOL) {
			/* EOL only happens when parsing /etc/resolv.conf,
			   and we treat it like a semicolon because the
			   resolv.conf file is line-oriented. */
			token = next_token (&val, cfile);
			return;
77 78 79 80 81 82
		}
		token = next_token (&val, cfile);
	} while (token != EOF);
}

int parse_semi (cfile)
83
	struct parse *cfile;
84
{
85
	enum dhcp_token token;
86
	const char *val;
87 88 89

	token = next_token (&val, cfile);
	if (token != SEMI) {
90
		parse_warn (cfile, "semicolon expected.");
91 92 93 94 95 96 97 98 99
		skip_to_semi (cfile);
		return 0;
	}
	return 1;
}

/* string-parameter :== STRING SEMI */

char *parse_string (cfile)
100
	struct parse *cfile;
101
{
102
	const char *val;
103
	enum dhcp_token token;
104 105 106 107
	char *s;

	token = next_token (&val, cfile);
	if (token != STRING) {
108
		parse_warn (cfile, "filename must be a string");
109 110 111 112 113
		skip_to_semi (cfile);
		return (char *)0;
	}
	s = (char *)malloc (strlen (val) + 1);
	if (!s)
114
		log_fatal ("no memory for string %s.", val);
115 116 117 118 119 120 121
	strcpy (s, val);

	if (!parse_semi (cfile))
		return (char *)0;
	return s;
}

122 123 124 125 126
/*
 * hostname :== IDENTIFIER
 *		| IDENTIFIER DOT
 *		| hostname DOT IDENTIFIER
 */
127 128

char *parse_host_name (cfile)
129
	struct parse *cfile;
130
{
131
	const char *val;
132
	enum dhcp_token token;
133
	unsigned len = 0;
134 135 136 137 138 139 140
	char *s;
	char *t;
	pair c = (pair)0;
	
	/* Read a dotted hostname... */
	do {
		/* Read a token, which should be an identifier. */
Ted Lemon's avatar
Ted Lemon committed
141 142 143
		token = peek_token (&val, cfile);
		if (!is_identifier (token) && token != NUMBER)
			break;
144
		token = next_token (&val, cfile);
Ted Lemon's avatar
Ted Lemon committed
145

146 147
		/* Store this identifier... */
		if (!(s = (char *)malloc (strlen (val) + 1)))
148
			log_fatal ("can't allocate temp space for hostname.");
149 150 151 152 153 154 155 156 157 158 159 160
		strcpy (s, val);
		c = cons ((caddr_t)s, c);
		len += strlen (s) + 1;
		/* Look for a dot; if it's there, keep going, otherwise
		   we're done. */
		token = peek_token (&val, cfile);
		if (token == DOT)
			token = next_token (&val, cfile);
	} while (token == DOT);

	/* Assemble the hostname together into a string. */
	if (!(s = (char *)malloc (len)))
161
		log_fatal ("can't allocate space for hostname.");
162 163 164 165
	t = s + len;
	*--t = 0;
	while (c) {
		pair cdr = c -> cdr;
166
		unsigned l = strlen ((char *)(c -> car));
167 168 169 170 171 172 173 174 175 176 177 178
		t -= l;
		memcpy (t, (char *)(c -> car), l);
		/* Free up temp space. */
		free (c -> car);
		free (c);
		c = cdr;
		if (t != s)
			*--t = '.';
	}
	return s;
}

179 180 181 182 183 184 185
/* ip-addr-or-hostname :== ip-address | hostname
   ip-address :== NUMBER DOT NUMBER DOT NUMBER DOT NUMBER
   
   Parse an ip address or a hostname.   If uniform is zero, put in
   an expr_substring node to limit hostnames that evaluate to more
   than one IP address. */

186 187
int parse_ip_addr_or_hostname (expr, cfile, uniform)
	struct expression **expr;
188
	struct parse *cfile;
189 190
	int uniform;
{
191
	const char *val;
192
	enum dhcp_token token;
193
	unsigned char addr [4];
194
	unsigned len = sizeof addr;
195
	char *name;
196
	struct expression *x = (struct expression *)0;
197 198 199 200 201

	token = peek_token (&val, cfile);
	if (is_identifier (token)) {
		name = parse_host_name (cfile);
		if (!name)
202 203 204 205 206 207 208 209 210 211
			return 0;
		if (!make_host_lookup (expr, name))
			return 0;
		if (!uniform) {
			if (!make_limit (&x, *expr, 4))
				return 0;
			expression_dereference (expr,
						"parse_ip_addr_or_hostname");
			*expr = x;
		}
212 213
	} else if (token == NUMBER) {
		if (!parse_numeric_aggregate (cfile, addr, &len, DOT, 10, 8))
214 215
			return 0;
		return make_const_data (expr, addr, len, 0, 1);
216 217 218
	} else {
		if (token != RBRACE && token != LBRACE)
			token = next_token (&val, cfile);
219
		parse_warn (cfile, "%s (%d): expecting IP address or hostname",
220 221 222
			    val, token);
		if (token != SEMI)
			skip_to_semi (cfile);
223
		return 0;
224 225
	}

226
	return 1;
227 228 229 230 231 232
}	
	
/*
 * ip-address :== NUMBER DOT NUMBER DOT NUMBER DOT NUMBER
 */

233
int parse_ip_addr (cfile, addr)
234
	struct parse *cfile;
235 236
	struct iaddr *addr;
{
237
	const char *val;
238
	enum dhcp_token token;
239 240 241 242 243 244 245 246

	addr -> len = 4;
	if (parse_numeric_aggregate (cfile, addr -> iabuf,
				     &addr -> len, DOT, 10, 8))
		return 1;
	return 0;
}	

247 248 249 250
/*
 * hardware-parameter :== HARDWARE hardware-type colon-seperated-hex-list SEMI
 * hardware-type :== ETHERNET | TOKEN_RING
 */
251 252

void parse_hardware_param (cfile, hardware)
253
	struct parse *cfile;
254 255
	struct hardware *hardware;
{
256
	const char *val;
257
	enum dhcp_token token;
258
	unsigned hlen;
259 260 261 262 263
	unsigned char *t;

	token = next_token (&val, cfile);
	switch (token) {
	      case ETHERNET:
264
		hardware -> hbuf [0] = HTYPE_ETHER;
265 266
		break;
	      case TOKEN_RING:
267
		hardware -> hbuf [0] = HTYPE_IEEE802;
268
		break;
269
	      case FDDI:
270
		hardware -> hbuf [0] = HTYPE_FDDI;
271
		break;
272
	      default:
273
		parse_warn (cfile, "expecting a network hardware type");
274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289
		skip_to_semi (cfile);
		return;
	}

	/* Parse the hardware address information.   Technically,
	   it would make a lot of sense to restrict the length of the
	   data we'll accept here to the length of a particular hardware
	   address type.   Unfortunately, there are some broken clients
	   out there that put bogus data in the chaddr buffer, and we accept
	   that data in the lease file rather than simply failing on such
	   clients.   Yuck. */
	hlen = 0;
	t = parse_numeric_aggregate (cfile, (unsigned char *)0, &hlen,
				     COLON, 16, 8);
	if (!t)
		return;
290
	if (hlen + 1 > sizeof hardware -> hbuf) {
291
		free (t);
292
		parse_warn (cfile, "hardware address too long");
293
	} else {
294 295 296 297 298
		hardware -> hlen = hlen + 1;
		memcpy ((unsigned char *)&hardware -> hbuf [1], t, hlen);
		if (hlen + 1 < sizeof hardware -> hbuf)
			memset (&hardware -> hbuf [hlen + 1], 0,
				(sizeof hardware -> hbuf) - hlen - 1);
299 300 301 302 303
		free (t);
	}
	
	token = next_token (&val, cfile);
	if (token != SEMI) {
304
		parse_warn (cfile, "expecting semicolon.");
305 306 307 308 309 310 311
		skip_to_semi (cfile);
	}
}

/* lease-time :== NUMBER SEMI */

void parse_lease_time (cfile, timep)
312
	struct parse *cfile;
313 314
	TIME *timep;
{
315
	const char *val;
316
	enum dhcp_token token;
317 318 319

	token = next_token (&val, cfile);
	if (token != NUMBER) {
320
		parse_warn (cfile, "Expecting numeric lease time");
321 322 323
		skip_to_semi (cfile);
		return;
	}
324
	convert_num (cfile, (unsigned char *)timep, val, 10, 32);
325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
	/* Unswap the number - convert_num returns stuff in NBO. */
	*timep = ntohl (*timep); /* XXX */

	parse_semi (cfile);
}

/* No BNF for numeric aggregates - that's defined by the caller.  What
   this function does is to parse a sequence of numbers seperated by
   the token specified in seperator.  If max is zero, any number of
   numbers will be parsed; otherwise, exactly max numbers are
   expected.  Base and size tell us how to internalize the numbers
   once they've been tokenized. */

unsigned char *parse_numeric_aggregate (cfile, buf,
					max, seperator, base, size)
340
	struct parse *cfile;
341
	unsigned char *buf;
342
	unsigned *max;
343 344
	int seperator;
	int base;
345
	unsigned size;
346
{
347
	const char *val;
348
	enum dhcp_token token;
349
	unsigned char *bufp = buf, *s, *t;
350
	unsigned count = 0;
351 352 353 354 355
	pair c = (pair)0;

	if (!bufp && *max) {
		bufp = (unsigned char *)malloc (*max * size / 8);
		if (!bufp)
356 357
			log_fatal ("no space for numeric aggregate");
		s = 0;
358 359 360 361 362 363 364 365 366 367 368
	} else
		s = bufp;

	do {
		if (count) {
			token = peek_token (&val, cfile);
			if (token != seperator) {
				if (!*max)
					break;
				if (token != RBRACE && token != LBRACE)
					token = next_token (&val, cfile);
369
				parse_warn (cfile, "too few numbers.");
370 371 372 373 374 375 376 377 378
				if (token != SEMI)
					skip_to_semi (cfile);
				return (unsigned char *)0;
			}
			token = next_token (&val, cfile);
		}
		token = next_token (&val, cfile);

		if (token == EOF) {
379
			parse_warn (cfile, "unexpected end of file");
380 381 382 383 384 385
			break;
		}

		/* Allow NUMBER_OR_NAME if base is 16. */
		if (token != NUMBER &&
		    (base != 16 || token != NUMBER_OR_NAME)) {
386
			parse_warn (cfile, "expecting numeric value.");
387 388 389 390 391 392
			skip_to_semi (cfile);
			return (unsigned char *)0;
		}
		/* If we can, convert the number now; otherwise, build
		   a linked list of all the numbers. */
		if (s) {
393
			convert_num (cfile, s, val, base, size);
394 395 396 397
			s += size / 8;
		} else {
			t = (unsigned char *)malloc (strlen (val) + 1);
			if (!t)
398
				log_fatal ("no temp space for number.");
399 400
			strcpy ((char *)t, val);
			c = cons ((caddr_t)t, c);
401 402 403 404 405 406 407
		}
	} while (++count != *max);

	/* If we had to cons up a list, convert it now. */
	if (c) {
		bufp = (unsigned char *)malloc (count * size / 8);
		if (!bufp)
408
			log_fatal ("no space for numeric aggregate.");
409 410 411 412 413
		s = bufp + count - size / 8;
		*max = count;
	}
	while (c) {
		pair cdr = c -> cdr;
414
		convert_num (cfile, s, (char *)(c -> car), base, size);
415 416 417 418 419 420 421 422 423
		s -= size / 8;
		/* Free up temp space. */
		free (c -> car);
		free (c);
		c = cdr;
	}
	return bufp;
}

424 425
void convert_num (cfile, buf, str, base, size)
	struct parse *cfile;
426
	unsigned char *buf;
427
	const char *str;
428
	int base;
429
	unsigned size;
430
{
431
	const char *ptr = str;
432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468
	int negative = 0;
	u_int32_t val = 0;
	int tval;
	int max;

	if (*ptr == '-') {
		negative = 1;
		++ptr;
	}

	/* If base wasn't specified, figure it out from the data. */
	if (!base) {
		if (ptr [0] == '0') {
			if (ptr [1] == 'x') {
				base = 16;
				ptr += 2;
			} else if (isascii (ptr [1]) && isdigit (ptr [1])) {
				base = 8;
				ptr += 1;
			} else {
				base = 10;
			}
		} else {
			base = 10;
		}
	}

	do {
		tval = *ptr++;
		/* XXX assumes ASCII... */
		if (tval >= 'a')
			tval = tval - 'a' + 10;
		else if (tval >= 'A')
			tval = tval - 'A' + 10;
		else if (tval >= '0')
			tval -= '0';
		else {
469
			parse_warn (cfile, "Bogus number: %s.", str);
470 471 472
			break;
		}
		if (tval >= base) {
473 474
			parse_warn (cfile,
				    "Bogus number %s: digit %d not in base %d",
475
				    str, tval, base);
476 477 478 479 480 481 482 483 484 485 486 487
			break;
		}
		val = val * base + tval;
	} while (*ptr);

	if (negative)
		max = (1 << (size - 1));
	else
		max = (1 << (size - 1)) + ((1 << (size - 1)) - 1);
	if (val > max) {
		switch (base) {
		      case 8:
488
			parse_warn (cfile,
489
				    "%s%lo exceeds max (%d) for precision.",
Ted Lemon's avatar
Ted Lemon committed
490 491
				    negative ? "-" : "",
				    (unsigned long)val, max);
492 493
			break;
		      case 16:
494
			parse_warn (cfile,
495
				    "%s%lx exceeds max (%d) for precision.",
Ted Lemon's avatar
Ted Lemon committed
496 497
				    negative ? "-" : "",
				    (unsigned long)val, max);
498 499
			break;
		      default:
500
			parse_warn (cfile,
501
				    "%s%lu exceeds max (%d) for precision.",
Ted Lemon's avatar
Ted Lemon committed
502 503
				    negative ? "-" : "",
				    (unsigned long)val, max);
504 505 506 507 508 509 510 511 512 513
			break;
		}
	}

	if (negative) {
		switch (size) {
		      case 8:
			*buf = -(unsigned long)val;
			break;
		      case 16:
514
			putShort (buf, -(long)val);
515 516
			break;
		      case 32:
517
			putLong (buf, -(long)val);
518 519
			break;
		      default:
520 521
			parse_warn (cfile,
				    "Unexpected integer size: %d\n", size);
522 523 524 525 526 527 528 529 530 531 532 533 534 535
			break;
		}
	} else {
		switch (size) {
		      case 8:
			*buf = (u_int8_t)val;
			break;
		      case 16:
			putUShort (buf, (u_int16_t)val);
			break;
		      case 32:
			putULong (buf, val);
			break;
		      default:
536 537
			parse_warn (cfile,
				    "Unexpected integer size: %d\n", size);
538 539 540 541 542
			break;
		}
	}
}

543 544
/*
 * date :== NUMBER NUMBER SLASH NUMBER SLASH NUMBER 
545 546 547
 *		NUMBER COLON NUMBER COLON NUMBER SEMI |
 *          NUMBER NUMBER SLASH NUMBER SLASH NUMBER 
 *		NUMBER COLON NUMBER COLON NUMBER NUMBER SEMI |
548
 *	    NEVER
549
 *
550 551 552 553
 * Dates are stored in GMT or with a timezone offset; first number is day
 * of week; next is year/month/day; next is hours:minutes:seconds on a
 * 24-hour clock, followed by the timezone offset in seconds, which is
 * optional.
554
 */
555 556

TIME parse_date (cfile)
557
	struct parse *cfile;
558 559 560
{
	struct tm tm;
	int guess;
561
	int tzoff, wday, year, mon, mday, hour, min, sec;
562
	const char *val;
563
	enum dhcp_token token;
564 565 566
	static int months [11] = { 31, 59, 90, 120, 151, 181,
					  212, 243, 273, 304, 334 };

567
	/* Day of week, or "never"... */
568
	token = next_token (&val, cfile);
569 570 571 572 573 574
	if (token == NEVER) {
		if (!parse_semi (cfile))
			return 0;
		return MAX_TIME;
	}

575
	if (token != NUMBER) {
576
		parse_warn (cfile, "numeric day of week expected.");
577 578 579 580
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
581
	wday = atoi (val);
582 583 584 585

	/* Year... */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
586
		parse_warn (cfile, "numeric year expected.");
587 588 589 590
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
591 592 593 594 595

	/* Note: the following is not a Y2K bug - it's a Y1.9K bug.   Until
	   somebody invents a time machine, I think we can safely disregard
	   it.   This actually works around a stupid Y2K bug that was present
	   in a very early beta release of dhcpd. */
596 597 598
	year = atoi (val);
	if (year > 1900)
		year -= 1900;
599 600 601 602

	/* Slash seperating year from month... */
	token = next_token (&val, cfile);
	if (token != SLASH) {
603 604
		parse_warn (cfile,
			    "expected slash seperating year from month.");
605 606 607 608 609 610 611 612
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}

	/* Month... */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
613
		parse_warn (cfile, "numeric month expected.");
614 615 616 617
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
618
	mon = atoi (val) - 1;
619 620 621 622

	/* Slash seperating month from day... */
	token = next_token (&val, cfile);
	if (token != SLASH) {
623 624
		parse_warn (cfile,
			    "expected slash seperating month from day.");
625 626 627 628 629 630 631 632
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}

	/* Month... */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
633
		parse_warn (cfile, "numeric day of month expected.");
634 635 636 637
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
638
	mday = atoi (val);
639 640 641 642

	/* Hour... */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
643
		parse_warn (cfile, "numeric hour expected.");
644 645 646 647
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
648
	hour = atoi (val);
649 650 651 652

	/* Colon seperating hour from minute... */
	token = next_token (&val, cfile);
	if (token != COLON) {
653 654
		parse_warn (cfile,
			    "expected colon seperating hour from minute.");
655 656 657 658 659 660 661 662
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}

	/* Minute... */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
663
		parse_warn (cfile, "numeric minute expected.");
664 665 666 667
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
668
	min = atoi (val);
669 670 671 672

	/* Colon seperating minute from second... */
	token = next_token (&val, cfile);
	if (token != COLON) {
673 674
		parse_warn (cfile,
			    "expected colon seperating hour from minute.");
675 676 677 678 679 680 681 682
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}

	/* Minute... */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
683
		parse_warn (cfile, "numeric minute expected.");
684 685 686 687
		if (token != SEMI)
			skip_to_semi (cfile);
		return (TIME)0;
	}
688
	sec = atoi (val);
689

690 691 692 693 694 695
	token = peek_token (&val, cfile);
	if (token == NUMBER) {
		token = next_token (&val, cfile);
		tzoff = atoi (val);
	} else
		tzoff = 0;
696 697

	/* Make sure the date ends in a semicolon... */
Ted Lemon's avatar
Ted Lemon committed
698
	if (!parse_semi (cfile))
699 700 701
		return 0;

	/* Guess the time value... */
702 703 704 705
	guess = ((((((365 * (year - 70) +	/* Days in years since '70 */
		      (year - 69) / 4 +		/* Leap days since '70 */
		      (mon			/* Days in months this year */
		       ? months [mon - 1]
706
		       : 0) +
707 708 709 710 711
		      (mon > 1 &&		/* Leap day this year */
		       !((year - 72) & 3)) +
		      mday - 1) * 24) +		/* Day of month */
		    hour) * 60) +
		  min) * 60) + sec + tzoff;
712 713 714 715 716 717 718 719 720 721 722 723

	/* This guess could be wrong because of leap seconds or other
	   weirdness we don't know about that the system does.   For
	   now, we're just going to accept the guess, but at some point
	   it might be nice to do a successive approximation here to
	   get an exact value.   Even if the error is small, if the
	   server is restarted frequently (and thus the lease database
	   is reread), the error could accumulate into something
	   significant. */

	return guess;
}
724

725 726 727 728 729
/*
 * option-name :== IDENTIFIER |
 		   IDENTIFIER . IDENTIFIER
 */

730
struct option *parse_option_name (cfile, allocate, known)
731
	struct parse *cfile;
732
	int allocate;
733
	int *known;
734
{
735
	const char *val;
736
	enum dhcp_token token;
737
	char *uname;
738 739 740 741 742
	struct universe *universe;
	struct option *option;

	token = next_token (&val, cfile);
	if (!is_identifier (token)) {
743 744
		parse_warn (cfile,
			    "expecting identifier after option keyword.");
745 746 747 748
		if (token != SEMI)
			skip_to_semi (cfile);
		return (struct option *)0;
	}
749 750 751 752
	uname = malloc (strlen (val) + 1);
	if (!uname)
		log_fatal ("no memory for uname information.");
	strcpy (uname, val);
753 754 755 756 757 758 759 760
	token = peek_token (&val, cfile);
	if (token == DOT) {
		/* Go ahead and take the DOT token... */
		token = next_token (&val, cfile);

		/* The next token should be an identifier... */
		token = next_token (&val, cfile);
		if (!is_identifier (token)) {
761
			parse_warn (cfile, "expecting identifier after '.'");
762 763 764 765 766 767
			if (token != SEMI)
				skip_to_semi (cfile);
			return (struct option *)0;
		}

		/* Look up the option name hash table for the specified
768
		   uname. */
769 770
		universe = ((struct universe *)
			    hash_lookup (&universe_hash,
771
					 (unsigned char *)uname, 0));
772 773 774
		/* If it's not there, we can't parse the rest of the
		   declaration. */
		if (!universe) {
775
			parse_warn (cfile, "no option space named %s.", uname);
776 777 778 779 780 781
			skip_to_semi (cfile);
			return (struct option *)0;
		}
	} else {
		/* Use the default hash table, which contains all the
		   standard dhcp option names. */
782
		val = uname;
783 784 785 786 787
		universe = &dhcp_universe;
	}

	/* Look up the actual option info... */
	option = (struct option *)hash_lookup (universe -> hash,
788
					       (const unsigned char *)val, 0);
789 790

	/* If we didn't get an option structure, it's an undefined option. */
791 792 793
	if (option) {
		*known = 1;
	} else {
794 795 796 797 798 799 800 801
		/* If we've been told to allocate, that means that this
		   (might) be an option code definition, so we'll create
		   an option structure just in case. */
		if (allocate) {
			option = new_option ("parse_option_name");
			if (val == uname)
				option -> name = val;
			else {
802
				char *s;
803
				free (uname);
804 805 806
				s = dmalloc (strlen (val) + 1,
					     "parse_option_name");
				if (!s)
807 808
				    log_fatal ("no memory for option %s.%s",
					       universe -> name, val);
809 810
				strcpy (s, val);
				option -> name = s;
811 812
			}
			option -> universe = universe;
813
			option -> code = 0;
814 815 816
			return option;
		}
		if (val == uname)
817
			parse_warn (cfile, "no option named %s", val);
818
		else
819
			parse_warn (cfile, "no option named %s in space %s",
820
				    val, uname);
821 822 823 824 825
		skip_to_semi (cfile);
		return (struct option *)0;
	}

	/* Free the initial identifier token. */
826
	free (uname);
827 828 829
	return option;
}

830 831 832
/* IDENTIFIER SEMI */

void parse_option_space_decl (cfile)
833
	struct parse *cfile;
834 835
{
	int token;
836
	const char *val;
837
	struct universe **ua, *nu;
838
	char *s;
839 840 841 842 843

	next_token (&val, cfile);	/* Discard the SPACE token, which was
					   checked by the caller. */
	token = next_token (&val, cfile);
	if (!is_identifier (token)) {
844
		parse_warn (cfile, "expecting identifier.");
845 846 847 848 849 850 851 852
		skip_to_semi (cfile);
		return;
	}
	nu = new_universe ("parse_option_space_decl");
	if (!nu)
		log_fatal ("No memory for new option space.");

	/* Set up the server option universe... */
853 854
	s = dmalloc (strlen (val) + 1, "parse_option_space_decl");
	if (!s)
855
		log_fatal ("No memory for new option space name.");
856 857
	strcpy (s, val);
	nu -> name = s;
858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885
	nu -> lookup_func = lookup_hashed_option;
	nu -> option_state_dereference =
		hashed_option_state_dereference;
	nu -> get_func = hashed_option_get;
	nu -> set_func = hashed_option_set;
	nu -> save_func = save_hashed_option;
	nu -> delete_func = delete_hashed_option;
	nu -> encapsulate = hashed_option_space_encapsulate;
	nu -> length_size = 1;
	nu -> tag_size = 1;
	nu -> store_tag = putUChar;
	nu -> store_length = putUChar;
	nu -> index = universe_count++;
	if (nu -> index >= universe_max) {
		ua = dmalloc (universe_max * 2 * sizeof *ua,
			      "parse_option_space_decl");
		if (!ua)
			log_fatal ("No memory to expand option space array.");
		memcpy (ua, universes, universe_max * sizeof *ua);
		universe_max *= 2;
		dfree (universes, "parse_option_space_decl");
		universes = ua;
	}
	universes [nu -> index] = nu;
	nu -> hash = new_hash ();
	if (!nu -> hash)
		log_fatal ("Can't allocate %s option hash table.", nu -> name);
	add_hash (&universe_hash,
886
		  (const unsigned char *)nu -> name, 0, (unsigned char *)nu);
887 888 889
	parse_semi (cfile);
}

890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915
/* This is faked up to look good right now.   Ideally, this should do a
   recursive parse and allow arbitrary data structure definitions, but for
   now it just allows you to specify a single type, an array of single types,
   a sequence of types, or an array of sequences of types.

   ocd :== NUMBER EQUALS ocsd SEMI

   ocsd :== ocsd_type |
	    ocsd_type_sequence |
	    ARRAY OF ocsd_type |
	    ARRAY OF ocsd_type_sequence

   ocsd_type :== BOOLEAN |
		 INTEGER NUMBER |
		 SIGNED INTEGER NUMBER |
		 UNSIGNED INTEGER NUMBER |
		 IP-ADDRESS |
		 TEXT |
		 STRING

   ocsd_type_sequence :== LBRACE ocsd_types RBRACE

   ocsd_type :== ocsd_type |
		 ocsd_types ocsd_type */

int parse_option_code_definition (cfile, option)
916
	struct parse *cfile;
917 918
	struct option *option;
{
919
	const char *val;
920
	enum dhcp_token token;
921
	unsigned arrayp = 0;
922 923 924
	int recordp = 0;
	int no_more_in_record = 0;
	char tokbuf [128];
925
	unsigned tokix = 0;
926 927 928
	char type;
	int code;
	int is_signed;
929
	char *s;
930 931 932 933
	
	/* Parse the option code. */
	token = next_token (&val, cfile);
	if (token != NUMBER) {
934
		parse_warn (cfile, "expecting option code number.");
935 936 937 938 939 940 941
		skip_to_semi (cfile);
		return 0;
	}
	option -> code = atoi (val);

	token = next_token (&val, cfile);
	if (token != EQUAL) {
942
		parse_warn (cfile, "expecting \"=\"");
943 944 945 946 947 948 949 950 951
		skip_to_semi (cfile);
		return 0;
	}

	/* See if this is an array. */
	token = next_token (&val, cfile);
	if (token == ARRAY) {
		token = next_token (&val, cfile);
		if (token != OF) {
952
			parse_warn (cfile, "expecting \"of\".");
953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975
			skip_to_semi (cfile);
			return 0;
		}
		arrayp = 1;
		token = next_token (&val, cfile);
	}

	if (token == LBRACE) {
		recordp = 1;
		token = next_token (&val, cfile);
	}

	/* At this point we're expecting a data type. */
      next_type:
	switch (token) {
	      case BOOLEAN:
		type = 'f';
		break;
	      case INTEGER:
		is_signed = 1;
	      parse_integer:
		token = next_token (&val, cfile);
		if (token != NUMBER) {
976
			parse_warn (cfile, "expecting number.");
977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992
			skip_to_rbrace (cfile, recordp);
			if (recordp)
				skip_to_semi (cfile);
			return 0;
		}
		switch (atoi (val)) {
		      case 8:
			type = is_signed ? 'b' : 'B';
			break;
		      case 16:
			type = is_signed ? 's' : 'S';
			break;
		      case 32:
			type = is_signed ? 'l' : 'L';
			break;
		      default:
993 994
			parse_warn (cfile,
				    "%s bit precision is not supported.", val);
995 996 997 998 999 1000 1001 1002 1003 1004 1005
			skip_to_rbrace (cfile, recordp);
			if (recordp)
				skip_to_semi (cfile);
			return 0;
		}
		break;
	      case SIGNED:
		is_signed = 1;
	      parse_signed:
		token = next_token (&val, cfile);
		if (token != INTEGER) {
1006
			parse_warn (cfile, "expecting \"integer\" keyword.");
1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023
			skip_to_rbrace (cfile, recordp);
			if (recordp)
				skip_to_semi (cfile);
			return 0;
		}
		goto parse_integer;
	      case UNSIGNED:
		is_signed = 0;
		goto parse_signed;

	      case IP_ADDRESS:
		type = 'I';
		break;
	      case TEXT:
		type = 't';
	      no_arrays:
		if (arrayp) {
1024
			parse_warn (cfile, "arrays of text strings not %s",
1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037
				    "yet supported.");
			skip_to_rbrace (cfile, recordp);
			if (recordp)
				skip_to_semi (cfile);
			return 0;
		}
		no_more_in_record = 1;
		break;
	      case STRING:
		type = 'X';
		goto no_arrays;

	      default:
1038
		parse_warn (cfile, "unknown data type %s", val);
1039 1040 1041 1042 1043 1044 1045
		skip_to_rbrace (cfile, recordp);
		if (recordp)
			skip_to_semi (cfile);
		return 0;
	}

	if (tokix == sizeof tokbuf) {
1046
		parse_warn (cfile, "too many types in record.");
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057
		skip_to_rbrace (cfile, recordp);
		if (recordp)
			skip_to_semi (cfile);
		return 0;
	}
	tokbuf [tokix++] = type;

	if (recordp) {
		token = next_token (&val, cfile);
		if (token == COMMA) {
			if (no_more_in_record) {
1058 1059
				parse_warn (cfile,
					    "%s must be at end of record.",
1060 1061 1062 1063 1064 1065 1066 1067 1068 1069
					    type == 't' ? "text" : "string");
				skip_to_rbrace (cfile, 1);
				if (recordp)
					skip_to_semi (cfile);
				return 0;
			}
			token = next_token (&val, cfile);
			goto next_type;
		}
		if (token != RBRACE) {
1070
			parse_warn (cfile, "expecting right brace.");
1071 1072 1073 1074 1075 1076 1077
			skip_to_rbrace (cfile, 1);
			if (recordp)
				skip_to_semi (cfile);
			return 0;
		}
	}
	if (!parse_semi (cfile)) {
1078
		parse_warn (cfile, "semicolon expected.");
1079 1080 1081 1082 1083
		skip_to_semi (cfile);
		if (recordp)
			skip_to_semi (cfile);
		return 0;
	}
1084 1085
	s = dmalloc (tokix + arrayp + 1, "parse_option_code_definition");
	if (!s)
1086
		log_fatal ("no memory for option format.");
1087
	memcpy (s, tokbuf, tokix);
1088
	if (arrayp)
1089 1090 1091
		s [tokix++] = 'A';
	s [tokix] = 0;
	option -> format = s;
1092 1093 1094 1095 1096 1097
	if (option -> universe -> options [option -> code]) {
		/* XXX Free the option, but we can't do that now because they
		   XXX may start out static. */
	}
	option -> universe -> options [option -> code] = option;
	add_hash (option -> universe -> hash,
1098 1099
		  (const unsigned char *)option -> name,
		  0, (unsigned char *)option);
1100 1101 1102
	return 1;
}

1103 1104 1105 1106 1107
/*
 * colon-seperated-hex-list :== NUMBER |
 *				NUMBER COLON colon-seperated-hex-list
 */

1108 1109
int parse_cshl (data, cfile)
	struct data_string *data;
1110
	struct parse *cfile;
1111
{
Ted Lemon's avatar
Ted Lemon committed
1112
	u_int8_t ibuf [128];