1 /* $OpenBSD: mdef.h,v 1.21 2001/09/27 11:40:33 espie Exp $ */
2 /* $NetBSD: mdef.h,v 1.7 1996/01/13 23:25:27 pk Exp $ */
5 * Copyright (c) 1989, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * Ozan Yigit at York University.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
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.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#)mdef.h 8.1 (Berkeley) 6/6/93
40 * $FreeBSD: src/usr.bin/m4/mdef.h,v 1.10 2002/07/15 02:15:12 jmallett Exp $
41 * $DragonFly: src/usr.bin/m4/mdef.h,v 1.3 2006/12/27 21:29:02 pavalos Exp $
79 #define BUILTINTYPE 36
81 #define FILENAMETYPE 38
84 #define ESYSCMDTYPE 41
85 #define TRACEONTYPE 42
86 #define TRACEOFFTYPE 43
89 #define TYPEMASK 63 /* Keep bits really corresponding to a type. */
90 #define RECDEF 256 /* Pure recursive def, don't expand it */
91 #define NOARGS 512 /* builtin needs no args */
92 #define NEEDARGS 1024 /* mark builtin that need args with this */
95 * m4 special characters
108 #define system(str) (-1)
112 * other important constants
116 #define MAXINP 10 /* maximum include files */
117 #define MAXOUT 10 /* maximum # of diversions */
118 #define BUFSIZE 4096 /* starting size of pushback buffer */
119 #define INITSTACKMAX 4096 /* starting size of call stack */
120 #define STRSPMAX 4096 /* starting size of string space */
121 #define MAXTOK 512 /* maximum chars in a tokn */
122 #define HASHSIZE 199 /* maximum size of hashtab */
123 #define MAXCCHARS 5 /* max size of comment/quote delim */
130 #define cycle for(;;)
136 typedef struct ndblock
*ndptr
;
138 struct ndblock
{ /* hastable structure */
139 char *name
; /* entry name.. */
140 char *defn
; /* definition.. */
141 unsigned int type
; /* type of the entry.. */
142 unsigned int hv
; /* hash function value.. */
143 ndptr nxtptr
; /* link to next entry.. */
146 #define nil ((ndptr) 0)
149 const char *knam
; /* keyword name */
150 int ktyp
; /* keyword type */
153 typedef union { /* stack structure */
154 int sfra
; /* frame entry */
155 char *sstr
; /* string entry */
161 unsigned long lineno
;
165 #define CURRENT_NAME (infile[ilevel].name)
166 #define CURRENT_LINE (infile[ilevel].lineno)
168 * macros for readibility and/or speed
170 * pushf() - push a call frame entry onto stack
171 * pushs() - push a string pointer onto stack
175 if ((uintptr_t)++sp == STACKMAX) \
177 mstack[sp].sfra = (x); \
183 if ((uintptr_t)++sp == STACKMAX) \
185 mstack[sp].sstr = (x); \
191 if ((uintptr_t)++sp == STACKMAX) \
193 mstack[sp].sstr = (x); \
201 * | arg 3 ----------------------->| str |
203 * | arg 2 ---PREVEP-----+ .
206 * +-------+ | +-----+
207 * | plev | PARLEV +-------->| str |
211 * | prcf ---PREVFP--+
220 #define PARLEV (mstack[fp].sfra)
221 #define CALTYP (mstack[fp-1].sfra)
222 #define PREVEP (mstack[fp+3].sstr)
223 #define PREVSP (fp-3)
224 #define PREVFP (mstack[fp-2].sfra)