[unix-history] / usr / src / pgrm / pascal / pdx / tree.h

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.  The Berkeley software License Agreement
 * specifies the terms and conditions for redistribution.
 *
 *	@(#)tree.h	5.3 (Berkeley) 1/3/88
 */

/*
 * This file contains the declarations of the variables and routines
 * within the "tree" subdirectory that are accessible from outside.
 */

#include "tree/opinfo.h"

/*
 * Evaluation stack manipulation macros.  These are publically
 * available because "eval" leaves it's result on the stack.
 *
 * These macros allow one to operate on stacks of arbitrary types
 * (including a stack of different typed objects).
 *
 * Sadly, underflow and overflow are not checked for.
 */

typedef char STACK;

#define WMASK			(sizeof(int) - 1)

#ifdef tahoe
#define push(type, value)	((*(type *)sp) = value, sp += (sizeof(type) + WMASK) & ~WMASK, value)
#define	pop(type)		(sp -= (sizeof(type) + WMASK) & ~WMASK, (*((type *) sp)))
#else
#define push(type, value)	((type *) (sp += sizeof(type)))[-1] = (value)
#define pop(type)		(*((type *) (sp -= sizeof(type))))
#endif
#define alignstack()		sp = (char *) (( ((int) sp) + WMASK)&~WMASK)
#define downalignstack()	sp = (char *) (( ((int) sp))&~WMASK)

STACK stack[];
STACK *sp;

NODE *build();		/* create a node in the parse tree */
int prtree();		/* print a tree in source form */
int eval();		/* evaluate a tree, leaving value on stack */
long popsmall();	/* pop a small item from the stack given its type */
int tfree();		/* release storage for a tree */
BOOLEAN tr_equal();	/* test if two trees are structurally equivalent */
BOOLEAN cond();		/* evaluate a node for a conditional */
ADDRESS lval();		/* return the object address of a node */
BOOLEAN isredirected();	/* TRUE if output is being redirected */
Commit	Line	Data
f9e58c14 DF	1	/*
	2	* Copyright (c) 1980 Regents of the University of California.
	3	* All rights reserved. The Berkeley software License Agreement
	4	* specifies the terms and conditions for redistribution.
	5	*
ca67e7b4	6	* @(#)tree.h 5.3 (Berkeley) 1/3/88
f9e58c14	7	*/
ccc7210e ML	8
	9	/*
	10	* This file contains the declarations of the variables and routines
	11	* within the "tree" subdirectory that are accessible from outside.
	12	*/
	13
	14	#include "tree/opinfo.h"
	15
	16	/*
	17	* Evaluation stack manipulation macros. These are publically
	18	* available because "eval" leaves it's result on the stack.
	19	*
	20	* These macros allow one to operate on stacks of arbitrary types
	21	* (including a stack of different typed objects).
	22	*
	23	* Sadly, underflow and overflow are not checked for.
	24	*/
	25
	26	typedef char STACK;
	27
ccc7210e ML	28	#define WMASK (sizeof(int) - 1)
ccc7210e ML	29
35bf0218 KM	30	#ifdef tahoe
	31	#define push(type, value) (((type )sp) = value, sp += (sizeof(type) + WMASK) & ~WMASK, value)
	32	#define pop(type) (sp -= (sizeof(type) + WMASK) & ~WMASK, (((type ) sp)))
	33	#else
ccc7210e ML	34	#define push(type, value) ((type *) (sp += sizeof(type)))[-1] = (value)
ccc7210e ML	35	#define pop(type) (((type ) (sp -= sizeof(type))))
35bf0218	36	#endif
ccc7210e	37	#define alignstack() sp = (char *) (( ((int) sp) + WMASK)&~WMASK)
35bf0218	38	#define downalignstack() sp = (char *) (( ((int) sp))&~WMASK)
ccc7210e	39
df3ebce4	40	STACK stack[];
ccc7210e ML	41	STACK *sp;
	42
	43	NODE build(); / create a node in the parse tree */
7d4de299 KB	44	int prtree(); /* print a tree in source form */
7d4de299 KB	45	int eval(); /* evaluate a tree, leaving value on stack */
321d5d38	46	long popsmall(); /* pop a small item from the stack given its type */
7d4de299	47	int tfree(); /* release storage for a tree */
ccc7210e ML	48	BOOLEAN tr_equal(); /* test if two trees are structurally equivalent */
	49	BOOLEAN cond(); /* evaluate a node for a conditional */
	50	ADDRESS lval(); /* return the object address of a node */
	51	BOOLEAN isredirected(); /* TRUE if output is being redirected */