[dragonfly.git] / usr.bin / window / parser1.c

/*	@(#)parser1.c	8.1 (Berkeley) 6/6/93	*/
/*	$NetBSD: parser1.c,v 1.6 2003/08/07 11:17:28 agc Exp $	*/

/*
 * Copyright (c) 1983, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Edward Wang at The University of California, Berkeley.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include "defs.h"
#include "parser.h"

void
p_start(void)
{
	char flag = 1;

	(void) s_gettok();
	for (;;) {
		p_statementlist(flag);
		if (token == T_EOF || p_abort())
			break;
		flag = 0;
		p_synerror();
		while (token != T_EOL && token != T_EOF) {
			if (token == T_STR)
				str_free(token_str);
			(void) s_gettok();
		}
		if (token == T_EOL)
			(void) s_gettok();
		p_clearerr();
	}
}

void
p_statementlist(char flag)
{
	for (; p_statement(flag) >= 0; p_clearerr())
		;
}

int
p_statement(char flag)
{
	switch (token) {
	case T_EOL:
		(void) s_gettok();
		return 0;
	case T_IF:
		return p_if(flag);
	default:
		return p_expression(flag);
	}
}

int
p_if(char flag)
{
	struct value t;
	char true = 0;

top:
	(void) s_gettok();

	if (p_expr(&t, flag) < 0) {
		p_synerror();
		return -1;
	}
	switch (t.v_type) {
	case V_NUM:
		true = !true && t.v_num != 0;
		break;
	case V_STR:
		p_error("if: Numeric value required.");
		str_free(t.v_str);
	case V_ERR:
		flag = 0;
		break;
	}

	if (token != T_THEN) {
		p_synerror();
		return -1;
	}

	(void) s_gettok();
	p_statementlist(flag && true);
	if (p_erred())
		return -1;

	if (token == T_ELSIF)
		goto top;

	if (token == T_ELSE) {
		(void) s_gettok();
		p_statementlist(flag && !true);
		if (p_erred())
			return -1;
	}

	if (token == T_ENDIF) {
		(void) s_gettok();
		return 0;
	}

	p_synerror();
	return -1;
}

int
p_expression(char flag)
{
	struct value t;
	char *cmd;

	switch (token) {
	case T_NUM:
		t.v_type = V_NUM;
		t.v_num = token_num;
		(void) s_gettok();
		break;
	case T_STR:
		t.v_type = V_STR;
		t.v_str = token_str;
		(void) s_gettok();
		break;
	default:
		if (p_expr(&t, flag) < 0)
			return -1;
		if (token == T_EOF) {
			val_free(t);
			return 0;
		}
	}
	if (token != T_ASSIGN && p_convstr(&t) < 0)
		return -1;
	cmd = t.v_type == V_STR ? t.v_str : 0;
	if ((*(token == T_ASSIGN ? p_assign : p_function))(cmd, &t, flag) < 0) {
		if (cmd)
			str_free(cmd);
		return -1;
	}
	if (cmd)
		str_free(cmd);
	val_free(t);
	if (token == T_EOL)
		(void) s_gettok();
	else if (token != T_EOF) {
		p_synerror();
		return -1;
	}
	return 0;
}

int
p_convstr(struct value *v)
{
	if (v->v_type != V_NUM)
		return 0;
	if ((v->v_str = str_itoa(v->v_num)) == 0) {
		p_memerror();
		v->v_type = V_ERR;
		return -1;
	}
	v->v_type = V_STR;
	return 0;
}

void
p_synerror(void)
{
	if (!cx.x_synerred) {
		cx.x_synerred = cx.x_erred = 1;
		error("Syntax error.");
	}
}

void
p_error(const char *msg, ...)
{
	va_list ap;

	va_start(ap, msg);
	if (!cx.x_erred) {
		cx.x_erred = 1;
		verror(msg, ap);
	}
	va_end(ap);
}

void
p_memerror(void)
{
	cx.x_erred = cx.x_abort = 1;
	error("Out of memory.");
}
Commit	Line	Data
2c872e05	1	/* @(#)parser1.c 8.1 (Berkeley) 6/6/93 */
abecab39 SW	2	/* $NetBSD: parser1.c,v 1.6 2003/08/07 11:17:28 agc Exp $ */
abecab39 SW	3
984263bc MD	4	/*
	5	* Copyright (c) 1983, 1993
	6	* The Regents of the University of California. All rights reserved.
	7	*
	8	* This code is derived from software contributed to Berkeley by
	9	* Edward Wang at The University of California, Berkeley.
	10	*
	11	* Redistribution and use in source and binary forms, with or without
	12	* modification, are permitted provided that the following conditions
	13	* are met:
	14	* 1. Redistributions of source code must retain the above copyright
	15	* notice, this list of conditions and the following disclaimer.
	16	* 2. Redistributions in binary form must reproduce the above copyright
	17	* notice, this list of conditions and the following disclaimer in the
	18	* documentation and/or other materials provided with the distribution.
abecab39	19	* 3. Neither the name of the University nor the names of its contributors
984263bc MD	20	* may be used to endorse or promote products derived from this software
	21	* without specific prior written permission.
	22	*
	23	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	24	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	25	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	26	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	27	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	28	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	29	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	30	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	31	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	32	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	33	* SUCH DAMAGE.
	34	*/
	35
abecab39	36	#include "defs.h"
984263bc MD	37	#include "parser.h"
984263bc MD	38
abecab39 SW	39	void
abecab39 SW	40	p_start(void)
984263bc MD	41	{
	42	char flag = 1;
	43
	44	(void) s_gettok();
	45	for (;;) {
	46	p_statementlist(flag);
	47	if (token == T_EOF \|\| p_abort())
	48	break;
	49	flag = 0;
	50	p_synerror();
	51	while (token != T_EOL && token != T_EOF) {
	52	if (token == T_STR)
	53	str_free(token_str);
	54	(void) s_gettok();
	55	}
	56	if (token == T_EOL)
	57	(void) s_gettok();
	58	p_clearerr();
	59	}
	60	}
	61
abecab39 SW	62	void
abecab39 SW	63	p_statementlist(char flag)
984263bc MD	64	{
	65	for (; p_statement(flag) >= 0; p_clearerr())
	66	;
	67	}
	68
abecab39 SW	69	int
abecab39 SW	70	p_statement(char flag)
984263bc MD	71	{
	72	switch (token) {
	73	case T_EOL:
	74	(void) s_gettok();
	75	return 0;
	76	case T_IF:
	77	return p_if(flag);
	78	default:
	79	return p_expression(flag);
	80	}
	81	}
	82
abecab39 SW	83	int
abecab39 SW	84	p_if(char flag)
984263bc MD	85	{
	86	struct value t;
	87	char true = 0;
	88
	89	top:
	90	(void) s_gettok();
	91
	92	if (p_expr(&t, flag) < 0) {
	93	p_synerror();
	94	return -1;
	95	}
	96	switch (t.v_type) {
	97	case V_NUM:
	98	true = !true && t.v_num != 0;
	99	break;
	100	case V_STR:
	101	p_error("if: Numeric value required.");
	102	str_free(t.v_str);
	103	case V_ERR:
	104	flag = 0;
	105	break;
	106	}
	107
	108	if (token != T_THEN) {
	109	p_synerror();
	110	return -1;
	111	}
	112
	113	(void) s_gettok();
	114	p_statementlist(flag && true);
	115	if (p_erred())
	116	return -1;
	117
	118	if (token == T_ELSIF)
	119	goto top;
	120
	121	if (token == T_ELSE) {
	122	(void) s_gettok();
	123	p_statementlist(flag && !true);
	124	if (p_erred())
	125	return -1;
	126	}
	127
	128	if (token == T_ENDIF) {
	129	(void) s_gettok();
	130	return 0;
	131	}
	132
	133	p_synerror();
	134	return -1;
	135	}
	136
abecab39 SW	137	int
abecab39 SW	138	p_expression(char flag)
984263bc MD	139	{
	140	struct value t;
	141	char *cmd;
984263bc MD	142
	143	switch (token) {
	144	case T_NUM:
	145	t.v_type = V_NUM;
	146	t.v_num = token_num;
	147	(void) s_gettok();
	148	break;
	149	case T_STR:
	150	t.v_type = V_STR;
	151	t.v_str = token_str;
	152	(void) s_gettok();
	153	break;
	154	default:
	155	if (p_expr(&t, flag) < 0)
	156	return -1;
	157	if (token == T_EOF) {
	158	val_free(t);
	159	return 0;
	160	}
	161	}
	162	if (token != T_ASSIGN && p_convstr(&t) < 0)
	163	return -1;
	164	cmd = t.v_type == V_STR ? t.v_str : 0;
	165	if ((*(token == T_ASSIGN ? p_assign : p_function))(cmd, &t, flag) < 0) {
	166	if (cmd)
	167	str_free(cmd);
	168	return -1;
	169	}
	170	if (cmd)
	171	str_free(cmd);
	172	val_free(t);
	173	if (token == T_EOL)
	174	(void) s_gettok();
	175	else if (token != T_EOF) {
	176	p_synerror();
	177	return -1;
	178	}
	179	return 0;
	180	}
	181
abecab39 SW	182	int
abecab39 SW	183	p_convstr(struct value *v)
984263bc MD	184	{
	185	if (v->v_type != V_NUM)
	186	return 0;
	187	if ((v->v_str = str_itoa(v->v_num)) == 0) {
	188	p_memerror();
	189	v->v_type = V_ERR;
	190	return -1;
	191	}
	192	v->v_type = V_STR;
	193	return 0;
	194	}
	195
abecab39 SW	196	void
abecab39 SW	197	p_synerror(void)
984263bc MD	198	{
	199	if (!cx.x_synerred) {
	200	cx.x_synerred = cx.x_erred = 1;
	201	error("Syntax error.");
	202	}
	203	}
	204
abecab39 SW	205	void
abecab39 SW	206	p_error(const char *msg, ...)
984263bc	207	{
abecab39 SW	208	va_list ap;
	209
	210	va_start(ap, msg);
984263bc MD	211	if (!cx.x_erred) {
984263bc MD	212	cx.x_erred = 1;
abecab39	213	verror(msg, ap);
984263bc	214	}
abecab39	215	va_end(ap);
984263bc MD	216	}
984263bc MD	217
abecab39 SW	218	void
abecab39 SW	219	p_memerror(void)
984263bc MD	220	{
	221	cx.x_erred = cx.x_abort = 1;
	222	error("Out of memory.");
	223	}