1/*-
2 * Copyright (c) 1988, 1989, 1990, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Adam de Boor.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 *    notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 *    must display the following acknowledgement:
20 *	This product includes software developed by the University of
21 *	California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 *    may be used to endorse or promote products derived from this software
24 *    without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * $FreeBSD$
39 */
40
41#ifndef util_h_b7020fdb
42#define	util_h_b7020fdb
43
44#include <sys/types.h>
45#include <stdio.h>
46
47/*
48 * A boolean type is defined as an integer, not an enum. This allows a
49 * boolean argument to be an expression that isn't strictly 0 or 1 valued.
50 */
51
52typedef int Boolean;
53#ifndef TRUE
54#define	TRUE	1
55#define	FALSE	0
56#endif /* TRUE */
57
58#define	CONCAT(a,b)	a##b
59
60struct flag2str {
61	u_int		flag;
62	const char	*str;
63};
64
65/*
66 * debug control:
67 *	There is one bit per module.  It is up to the module what debug
68 *	information to print.
69 */
70#define	DEBUG_ARCH	0x0001
71#define	DEBUG_COND	0x0002
72#define	DEBUG_DIR	0x0004
73#define	DEBUG_GRAPH1	0x0008
74#define	DEBUG_GRAPH2	0x0010
75#define	DEBUG_JOB	0x0020
76#define	DEBUG_MAKE	0x0040
77#define	DEBUG_SUFF	0x0080
78#define	DEBUG_TARG	0x0100
79#define	DEBUG_VAR	0x0200
80#define	DEBUG_FOR	0x0400
81#define	DEBUG_LOUD	0x0800
82
83#define	DEBUG(module)	(debug & CONCAT(DEBUG_,module))
84#define	DEBUGF(module,args)		\
85do {						\
86	if (DEBUG(module)) {			\
87		Debug args ;			\
88	}					\
89} while (0)
90#define	DEBUGM(module, args) do {		\
91	if (DEBUG(module)) {			\
92		DebugM args;			\
93	}					\
94    } while (0)
95
96#define	ISDOT(c) ((c)[0] == '.' && (((c)[1] == '\0') || ((c)[1] == '/')))
97#define	ISDOTDOT(c) ((c)[0] == '.' && ISDOT(&((c)[1])))
98
99#ifndef MAX
100#define	MAX(a, b)  ((a) > (b) ? (a) : (b))
101#endif
102
103void Debug(const char *, ...);
104void DebugM(const char *, ...);
105void Error(const char *, ...);
106void Fatal(const char *, ...) __dead2;
107void Punt(const char *, ...) __dead2;
108void DieHorribly(void) __dead2;
109void Finish(int) __dead2;
110char *estrdup(const char *);
111void *emalloc(size_t);
112void *erealloc(void *, size_t);
113int eunlink(const char *);
114void print_flags(FILE *, const struct flag2str *, u_int, int);
115
116#endif /* util_h_b7020fdb */
117