1/*	$NetBSD: nonints.h,v 1.62 2010/12/25 04:57:07 dholland Exp $	*/
2
3/*-
4 * Copyright (c) 1988, 1989, 1990, 1993
5 *	The Regents of the University of California.  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. Neither the name of the University nor the names of its contributors
19 *    may be used to endorse or promote products derived from this software
20 *    without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 *	from: @(#)nonints.h	8.3 (Berkeley) 3/19/94
35 */
36
37/*-
38 * Copyright (c) 1989 by Berkeley Softworks
39 * All rights reserved.
40 *
41 * This code is derived from software contributed to Berkeley by
42 * Adam de Boor.
43 *
44 * Redistribution and use in source and binary forms, with or without
45 * modification, are permitted provided that the following conditions
46 * are met:
47 * 1. Redistributions of source code must retain the above copyright
48 *    notice, this list of conditions and the following disclaimer.
49 * 2. Redistributions in binary form must reproduce the above copyright
50 *    notice, this list of conditions and the following disclaimer in the
51 *    documentation and/or other materials provided with the distribution.
52 * 3. All advertising materials mentioning features or use of this software
53 *    must display the following acknowledgement:
54 *	This product includes software developed by the University of
55 *	California, Berkeley and its contributors.
56 * 4. Neither the name of the University nor the names of its contributors
57 *    may be used to endorse or promote products derived from this software
58 *    without specific prior written permission.
59 *
60 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 * SUCH DAMAGE.
71 *
72 *	from: @(#)nonints.h	8.3 (Berkeley) 3/19/94
73 */
74
75#ifndef MAKE_NATIVE
76#undef __attribute__
77#define __attribute__(x)
78#endif
79
80/* arch.c */
81ReturnStatus Arch_ParseArchive(char **, Lst, GNode *);
82void Arch_Touch(GNode *);
83void Arch_TouchLib(GNode *);
84time_t Arch_MTime(GNode *);
85time_t Arch_MemMTime(GNode *);
86void Arch_FindLib(GNode *, Lst);
87Boolean Arch_LibOODate(GNode *);
88void Arch_Init(void);
89void Arch_End(void);
90int Arch_IsLib(GNode *);
91
92/* compat.c */
93int CompatRunCommand(void *, void *);
94void Compat_Run(Lst);
95int Compat_Make(void *, void *);
96
97/* cond.c */
98struct If;
99int Cond_EvalExpression(const struct If *, char *, Boolean *, int);
100int Cond_Eval(char *);
101void Cond_restore_depth(unsigned int);
102unsigned int Cond_save_depth(void);
103
104/* for.c */
105int For_Eval(char *);
106int For_Accum(char *);
107void For_Run(int);
108
109/* job.c */
110void JobReapChild(pid_t, int, Boolean);
111
112/* main.c */
113void Main_ParseArgLine(const char *);
114void MakeMode(const char *);
115int main(int, char **);
116char *Cmd_Exec(const char *, const char **);
117void Error(const char *, ...) __attribute__((__format__(__printf__, 1, 2)));
118void Fatal(const char *, ...)
119    __attribute__((__format__(__printf__, 1, 2),__noreturn__));
120void Punt(const char *, ...)
121    __attribute__((__format__(__printf__, 1, 2),__noreturn__));
122void DieHorribly(void) __attribute__((__noreturn__));
123int PrintAddr(void *, void *);
124void Finish(int) __dead;
125int eunlink(const char *);
126void execError(const char *, const char *);
127char *getTmpdir(void);
128
129/* parse.c */
130void Parse_Error(int, const char *, ...)
131     __attribute__((__format__(__printf__, 2, 3)));
132Boolean Parse_AnyExport(void);
133Boolean Parse_IsVar(char *);
134void Parse_DoVar(char *, GNode *);
135void Parse_AddIncludeDir(char *);
136void Parse_File(const char *, int);
137void Parse_Init(void);
138void Parse_End(void);
139void Parse_SetInput(const char *, int, int, char *(*)(void *, size_t *), void *);
140Lst Parse_MainName(void);
141
142/* str.c */
143char *str_concat(const char *, const char *, int);
144char **brk_string(const char *, int *, Boolean, char **);
145char *Str_FindSubstring(const char *, const char *);
146int Str_Match(const char *, const char *);
147char *Str_SYSVMatch(const char *, const char *, int *len);
148void Str_SYSVSubst(Buffer *, char *, char *, int);
149
150/* suff.c */
151void Suff_ClearSuffixes(void);
152Boolean Suff_IsTransform(char *);
153GNode *Suff_AddTransform(char *);
154int Suff_EndTransform(void *, void *);
155void Suff_AddSuffix(char *, GNode **);
156Lst Suff_GetPath(char *);
157void Suff_DoPaths(void);
158void Suff_AddInclude(char *);
159void Suff_AddLib(char *);
160void Suff_FindDeps(GNode *);
161Lst Suff_FindPath(GNode *);
162void Suff_SetNull(char *);
163void Suff_Init(void);
164void Suff_End(void);
165void Suff_PrintAll(void);
166
167/* targ.c */
168void Targ_Init(void);
169void Targ_End(void);
170Lst Targ_List(void);
171GNode *Targ_NewGN(const char *);
172GNode *Targ_FindNode(const char *, int);
173Lst Targ_FindList(Lst, int);
174Boolean Targ_Ignore(GNode *);
175Boolean Targ_Silent(GNode *);
176Boolean Targ_Precious(GNode *);
177void Targ_SetMain(GNode *);
178int Targ_PrintCmd(void *, void *);
179int Targ_PrintNode(void *, void *);
180char *Targ_FmtTime(time_t);
181void Targ_PrintType(int);
182void Targ_PrintGraph(int);
183void Targ_Propagate(void);
184void Targ_Propagate_Wait(void);
185
186/* var.c */
187void Var_Delete(const char *, GNode *);
188void Var_Set(const char *, const char *, GNode *, int);
189void Var_Append(const char *, const char *, GNode *);
190Boolean Var_Exists(const char *, GNode *);
191char *Var_Value(const char *, GNode *, char **);
192char *Var_Parse(const char *, GNode *, Boolean, int *, void **);
193char *Var_Subst(const char *, const char *, GNode *, Boolean);
194char *Var_GetTail(const char *);
195char *Var_GetHead(const char *);
196void Var_Init(void);
197void Var_End(void);
198void Var_Dump(GNode *);
199void Var_ExportVars(void);
200void Var_Export(char *, int);
201void Var_UnExport(char *);
202
203/* util.c */
204void (*bmake_signal(int, void (*)(int)))(int);
205