bin/make/nonints.h

   1 /*      $NetBSD: nonints.h,v 1.74 2016/09/05 00:40:29 sevan 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 /* arch.c */
  76 ReturnStatus Arch_ParseArchive(char **, Lst, GNode *);
  77 void Arch_Touch(GNode *);
  78 void Arch_TouchLib(GNode *);
  79 time_t Arch_MTime(GNode *);
  80 time_t Arch_MemMTime(GNode *);
  81 void Arch_FindLib(GNode *, Lst);
  82 Boolean Arch_LibOODate(GNode *);
  83 void Arch_Init(void);
  84 void Arch_End(void);
  85 int Arch_IsLib(GNode *);
  86
  87 /* compat.c */
  88 int CompatRunCommand(void *, void *);
  89 void Compat_Run(Lst);
  90 int Compat_Make(void *, void *);
  91
  92 /* cond.c */
  93 struct If;
  94 int Cond_EvalExpression(const struct If *, char *, Boolean *, int, Boolean);
  95 int Cond_Eval(char *);
  96 void Cond_restore_depth(unsigned int);
  97 unsigned int Cond_save_depth(void);
  98
  99 /* for.c */
 100 int For_Eval(char *);
 101 int For_Accum(char *);
 102 void For_Run(int);
 103
 104 /* job.c */
 105 #ifdef WAIT_T
 106 void JobReapChild(pid_t, WAIT_T, Boolean);
 107 #endif
 108
 109 /* main.c */
 110 void Main_ParseArgLine(const char *);
 111 void MakeMode(const char *);
 112 char *Cmd_Exec(const char *, const char **);
 113 void Error(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
 114 void Fatal(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
 115 void Punt(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
 116 void DieHorribly(void) MAKE_ATTR_DEAD;
 117 int PrintAddr(void *, void *);
 118 void Finish(int) MAKE_ATTR_DEAD;
 119 int eunlink(const char *);
 120 void execError(const char *, const char *);
 121 char *getTmpdir(void);
 122 Boolean s2Boolean(const char *, Boolean);
 123 Boolean getBoolean(const char *, Boolean);
 124 char *cached_realpath(const char *, char *);
 125
 126 /* parse.c */
 127 void Parse_Error(int, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
 128 Boolean Parse_AnyExport(void);
 129 Boolean Parse_IsVar(char *);
 130 void Parse_DoVar(char *, GNode *);
 131 void Parse_AddIncludeDir(char *);
 132 void Parse_File(const char *, int);
 133 void Parse_Init(void);
 134 void Parse_End(void);
 135 void Parse_SetInput(const char *, int, int, char *(*)(void *, size_t *), void *);
 136 Lst Parse_MainName(void);
 137
 138 /* str.c */
 139 char *str_concat(const char *, const char *, int);
 140 char **brk_string(const char *, int *, Boolean, char **);
 141 char *Str_FindSubstring(const char *, const char *);
 142 int Str_Match(const char *, const char *);
 143 char *Str_SYSVMatch(const char *, const char *, int *len);
 144 void Str_SYSVSubst(Buffer *, char *, char *, int);
 145
 146 /* suff.c */
 147 void Suff_ClearSuffixes(void);
 148 Boolean Suff_IsTransform(char *);
 149 GNode *Suff_AddTransform(char *);
 150 int Suff_EndTransform(void *, void *);
 151 void Suff_AddSuffix(char *, GNode **);
 152 Lst Suff_GetPath(char *);
 153 void Suff_DoPaths(void);
 154 void Suff_AddInclude(char *);
 155 void Suff_AddLib(char *);
 156 void Suff_FindDeps(GNode *);
 157 Lst Suff_FindPath(GNode *);
 158 void Suff_SetNull(char *);
 159 void Suff_Init(void);
 160 void Suff_End(void);
 161 void Suff_PrintAll(void);
 162
 163 /* targ.c */
 164 void Targ_Init(void);
 165 void Targ_End(void);
 166 Lst Targ_List(void);
 167 GNode *Targ_NewGN(const char *);
 168 GNode *Targ_FindNode(const char *, int);
 169 Lst Targ_FindList(Lst, int);
 170 Boolean Targ_Ignore(GNode *);
 171 Boolean Targ_Silent(GNode *);
 172 Boolean Targ_Precious(GNode *);
 173 void Targ_SetMain(GNode *);
 174 int Targ_PrintCmd(void *, void *);
 175 int Targ_PrintNode(void *, void *);
 176 char *Targ_FmtTime(time_t);
 177 void Targ_PrintType(int);
 178 void Targ_PrintGraph(int);
 179 void Targ_Propagate(void);
 180 void Targ_Propagate_Wait(void);
 181
 182 /* var.c */
 183 void Var_Delete(const char *, GNode *);
 184 void Var_Set(const char *, const char *, GNode *, int);
 185 void Var_Append(const char *, const char *, GNode *);
 186 Boolean Var_Exists(const char *, GNode *);
 187 char *Var_Value(const char *, GNode *, char **);
 188 char *Var_Parse(const char *, GNode *, int, int *, void **);
 189 char *Var_Subst(const char *, const char *, GNode *, int);
 190 char *Var_GetTail(const char *);
 191 char *Var_GetHead(const char *);
 192 void Var_Init(void);
 193 void Var_End(void);
 194 void Var_Dump(GNode *);
 195 void Var_ExportVars(void);
 196 void Var_Export(char *, int);
 197 void Var_UnExport(char *);
 198
 199 /* util.c */
 200 void (*bmake_signal(int, void (*)(int)))(int);