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 * @(#)nonints.h 8.4 (Berkeley) 4/28/95
43 ReturnStatus Arch_ParseArchive(char **, Lst, GNode *);
44 void Arch_Touch(GNode *);
45 void Arch_TouchLib(GNode *);
46 int Arch_MTime(GNode *);
47 int Arch_MemMTime(GNode *);
48 void Arch_FindLib(GNode *, Lst);
49 Boolean Arch_LibOODate(GNode *);
57 int Cond_Eval(char *);
65 void Main_ParseArgLine(char *);
66 char *Cmd_Exec(char *, char **);
67 void Debug(const char *, ...);
68 void Error(const char *, ...);
69 void Fatal(const char *, ...);
70 void Punt(const char *, ...);
71 void DieHorribly(void);
72 int PrintAddr(void *, void *);
74 char *estrdup(const char *);
75 void *emalloc(size_t);
76 void *erealloc(void *, size_t);
78 int eunlink(const char *);
81 void Parse_Error(int, const char *, ...);
82 Boolean Parse_AnyExport(void);
83 Boolean Parse_IsVar(char *);
84 void Parse_DoVar(char *, GNode *);
85 void Parse_AddIncludeDir(char *);
86 void Parse_File(char *, FILE *);
87 void Parse_Init(void);
89 void Parse_FromString(char *);
90 Lst Parse_MainName(void);
95 char *str_concat(char *, char *, int);
96 char **brk_string(char *, int *, Boolean);
97 char *Str_FindSubstring(char *, char *);
98 int Str_Match(char *, char *);
99 char *Str_SYSVMatch(char *, char *, int *len);
100 void Str_SYSVSubst(Buffer, char *, char *, int);
103 void Suff_ClearSuffixes(void);
104 Boolean Suff_IsTransform(char *);
105 GNode *Suff_AddTransform(char *);
106 int Suff_EndTransform(void *, void *);
107 void Suff_AddSuffix(char *);
108 Lst Suff_GetPath(char *);
109 void Suff_DoPaths(void);
110 void Suff_AddInclude(char *);
111 void Suff_AddLib(char *);
112 void Suff_FindDeps(GNode *);
113 void Suff_SetNull(char *);
114 void Suff_Init(void);
116 void Suff_PrintAll(void);
119 void Targ_Init(void);
121 GNode *Targ_NewGN(char *);
122 GNode *Targ_FindNode(char *, int);
123 Lst Targ_FindList(Lst, int);
124 Boolean Targ_Ignore(GNode *);
125 Boolean Targ_Silent(GNode *);
126 Boolean Targ_Precious(GNode *);
127 void Targ_SetMain(GNode *);
128 int Targ_PrintCmd(void *, void *);
129 char *Targ_FmtTime(time_t);
130 void Targ_PrintType(int);
131 void Targ_PrintGraph(int);
134 void Var_Delete(char *, GNode *);
135 void Var_Set(char *, char *, GNode *);
136 void Var_Append(char *, char *, GNode *);
137 Boolean Var_Exists(char *, GNode *);
138 char *Var_Value(char *, GNode *, char **);
139 char *Var_Parse(char *, GNode *, Boolean, int *, Boolean *);
140 char *Var_Subst(char *, char *, GNode *, Boolean);
141 char *Var_GetTail(char *);
142 char *Var_GetHead(char *);
145 void Var_Dump(GNode *);