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
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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
38 * from: @(#)nonints.h 8.3 (Berkeley) 3/19/94
39 * $FreeBSD: src/usr.bin/make/nonints.h,v 1.8 1999/08/28 01:03:35 peter Exp $
43 ReturnStatus Arch_ParseArchive __P((char **, Lst, GNode *));
44 void Arch_Touch __P((GNode *));
45 void Arch_TouchLib __P((GNode *));
46 int Arch_MTime __P((GNode *));
47 int Arch_MemMTime __P((GNode *));
48 void Arch_FindLib __P((GNode *, Lst));
49 Boolean Arch_LibOODate __P((GNode *));
50 void Arch_Init __P((void));
51 void Arch_End __P((void));
54 void Compat_Run __P((Lst));
57 int Cond_Eval __P((char *));
58 void Cond_End __P((void));
61 int For_Eval __P((char *));
62 void For_Run __P((void));
65 void Main_ParseArgLine __P((char *));
66 int main __P((int, char **));
67 char *Cmd_Exec __P((char *, char **));
68 void Error __P((char *, ...));
69 void Fatal __P((char *, ...));
70 void Punt __P((char *, ...));
71 void DieHorribly __P((void));
72 int PrintAddr __P((ClientData, ClientData));
73 void Finish __P((int));
74 char *estrdup __P((const char *));
75 void *emalloc __P((size_t));
76 /* efree(x) works when x==NULL. STDC behavior, may need some different
77 * definition for cross-builds on deficient systems */
79 void *erealloc __P((void *, size_t));
80 void enomem __P((void));
81 int eunlink __P((const char *));
84 void Parse_Error __P((int, char *, ...));
85 Boolean Parse_AnyExport __P((void));
86 Boolean Parse_IsVar __P((char *));
87 void Parse_DoVar __P((char *, GNode *));
88 void Parse_AddIncludeDir __P((char *));
89 void Parse_File __P((char *, FILE *));
90 void Parse_Init __P((void));
91 void Parse_End __P((void));
92 void Parse_FromString __P((char *));
93 Lst Parse_MainName __P((void));
96 void str_init __P((void));
97 void str_end __P((void));
98 char *str_concat __P((char *, char *, int));
99 char **brk_string __P((char *, int *, Boolean));
100 char *Str_FindSubstring __P((char *, char *));
101 int Str_Match __P((char *, char *));
102 char *Str_SYSVMatch __P((char *, char *, int *len));
103 void Str_SYSVSubst __P((Buffer, char *, char *, int));
106 void Suff_ClearSuffixes __P((void));
107 Boolean Suff_IsTransform __P((char *));
108 GNode *Suff_AddTransform __P((char *));
109 int Suff_EndTransform __P((ClientData, ClientData));
110 void Suff_AddSuffix __P((char *));
111 Lst Suff_GetPath __P((char *));
112 void Suff_DoPaths __P((void));
113 void Suff_AddInclude __P((char *));
114 void Suff_AddLib __P((char *));
115 void Suff_FindDeps __P((GNode *));
116 void Suff_SetNull __P((char *));
117 void Suff_Init __P((void));
118 void Suff_End __P((void));
119 void Suff_PrintAll __P((void));
122 void Targ_Init __P((void));
123 void Targ_End __P((void));
124 GNode *Targ_NewGN __P((char *));
125 GNode *Targ_FindNode __P((char *, int));
126 Lst Targ_FindList __P((Lst, int));
127 Boolean Targ_Ignore __P((GNode *));
128 Boolean Targ_Silent __P((GNode *));
129 Boolean Targ_Precious __P((GNode *));
130 void Targ_SetMain __P((GNode *));
131 int Targ_PrintCmd __P((ClientData, ClientData));
132 char *Targ_FmtTime __P((time_t));
133 void Targ_PrintType __P((int));
134 void Targ_PrintGraph __P((int));
137 void Var_Delete __P((char *, GNode *));
138 void Var_Set __P((char *, char *, GNode *));
139 void Var_Append __P((char *, char *, GNode *));
140 Boolean Var_Exists __P((char *, GNode *));
141 char *Var_Value __P((char *, GNode *, char **));
142 char *Var_Parse __P((char *, GNode *, Boolean, int *, Boolean *));
143 char *Var_Subst __P((char *, char *, GNode *, Boolean));
144 char *Var_GetTail __P((char *));
145 char *Var_GetHead __P((char *));
146 void Var_Init __P((void));
147 void Var_End __P((void));
148 void Var_Dump __P((GNode *));