| 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 | * 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 $
|
|---|
| 40 | */
|
|---|
| 41 |
|
|---|
| 42 | #ifndef __nonints_h__
|
|---|
| 43 | #define __nonints_h__
|
|---|
| 44 |
|
|---|
| 45 | /* arch.c */
|
|---|
| 46 | #ifdef USE_ARCHIVES
|
|---|
| 47 | ReturnStatus Arch_ParseArchive __P((char **, Lst, GNode *));
|
|---|
| 48 | void Arch_Touch __P((GNode *));
|
|---|
| 49 | void Arch_TouchLib __P((GNode *));
|
|---|
| 50 | int Arch_MTime __P((GNode *));
|
|---|
| 51 | int Arch_MemMTime __P((GNode *));
|
|---|
| 52 | void Arch_FindLib __P((GNode *, Lst));
|
|---|
| 53 | Boolean Arch_LibOODate __P((GNode *));
|
|---|
| 54 | void Arch_Init __P((void));
|
|---|
| 55 | void Arch_End __P((void));
|
|---|
| 56 | #endif
|
|---|
| 57 |
|
|---|
| 58 | /* compat.c */
|
|---|
| 59 | void Compat_Run __P((Lst));
|
|---|
| 60 |
|
|---|
| 61 | /* cond.c */
|
|---|
| 62 | int Cond_Eval __P((char *));
|
|---|
| 63 | void Cond_End __P((void));
|
|---|
| 64 |
|
|---|
| 65 | /* for.c */
|
|---|
| 66 | int For_Eval __P((char *));
|
|---|
| 67 | void For_Run __P((void));
|
|---|
| 68 |
|
|---|
| 69 | /* main.c */
|
|---|
| 70 | void Main_ParseArgLine __P((char *));
|
|---|
| 71 | int main __P((int, char **));
|
|---|
| 72 | char *Cmd_Exec __P((char *, char **));
|
|---|
| 73 | void Error __P((char *, ...));
|
|---|
| 74 | void Fatal __P((char *, ...));
|
|---|
| 75 | void Punt __P((char *, ...));
|
|---|
| 76 | void DieHorribly __P((void));
|
|---|
| 77 | int PrintAddr __P((ClientData, ClientData));
|
|---|
| 78 | void Finish __P((int));
|
|---|
| 79 | char *estrdup __P((const char *));
|
|---|
| 80 | void *emalloc __P((size_t));
|
|---|
| 81 | void efree __P((void *));
|
|---|
| 82 | void *erealloc __P((void *, size_t));
|
|---|
| 83 | void enomem __P((void));
|
|---|
| 84 | int eunlink __P((const char *));
|
|---|
| 85 |
|
|---|
| 86 | /* parse.c */
|
|---|
| 87 | void Parse_Error __P((int, char *, ...));
|
|---|
| 88 | Boolean Parse_AnyExport __P((void));
|
|---|
| 89 | Boolean Parse_IsVar __P((char *));
|
|---|
| 90 | void Parse_DoVar __P((char *, GNode *));
|
|---|
| 91 | void Parse_AddIncludeDir __P((char *));
|
|---|
| 92 | void Parse_File __P((char *, FILE *));
|
|---|
| 93 | void Parse_Init __P((void));
|
|---|
| 94 | void Parse_End __P((void));
|
|---|
| 95 | void Parse_FromString __P((char *));
|
|---|
| 96 | Lst Parse_MainName __P((void));
|
|---|
| 97 |
|
|---|
| 98 | /* str.c */
|
|---|
| 99 | void str_init __P((void));
|
|---|
| 100 | void str_end __P((void));
|
|---|
| 101 | char *str_concat __P((char *, char *, int));
|
|---|
| 102 | char **brk_string __P((char *, int *, Boolean));
|
|---|
| 103 | char *Str_FindSubstring __P((char *, char *));
|
|---|
| 104 | int Str_Match __P((char *, char *));
|
|---|
| 105 | char *Str_SYSVMatch __P((char *, char *, int *len));
|
|---|
| 106 | void Str_SYSVSubst __P((Buffer, char *, char *, int));
|
|---|
| 107 |
|
|---|
| 108 | /* suff.c */
|
|---|
| 109 | void Suff_ClearSuffixes __P((void));
|
|---|
| 110 | Boolean Suff_IsTransform __P((char *));
|
|---|
| 111 | GNode *Suff_AddTransform __P((char *));
|
|---|
| 112 | int Suff_EndTransform __P((ClientData, ClientData));
|
|---|
| 113 | void Suff_AddSuffix __P((char *));
|
|---|
| 114 | Lst Suff_GetPath __P((char *));
|
|---|
| 115 | void Suff_DoPaths __P((void));
|
|---|
| 116 | void Suff_AddInclude __P((char *));
|
|---|
| 117 | #ifdef USE_ARCHIVES
|
|---|
| 118 | void Suff_AddLib __P((char *));
|
|---|
| 119 | #endif
|
|---|
| 120 | void Suff_FindDeps __P((GNode *));
|
|---|
| 121 | void Suff_SetNull __P((char *));
|
|---|
| 122 | void Suff_Init __P((void));
|
|---|
| 123 | void Suff_End __P((void));
|
|---|
| 124 | void Suff_PrintAll __P((void));
|
|---|
| 125 |
|
|---|
| 126 | /* targ.c */
|
|---|
| 127 | void Targ_Init __P((void));
|
|---|
| 128 | void Targ_End __P((void));
|
|---|
| 129 | GNode *Targ_NewGN __P((char *));
|
|---|
| 130 | GNode *Targ_FindNode __P((char *, int));
|
|---|
| 131 | Lst Targ_FindList __P((Lst, int));
|
|---|
| 132 | Boolean Targ_Ignore __P((GNode *));
|
|---|
| 133 | Boolean Targ_Silent __P((GNode *));
|
|---|
| 134 | Boolean Targ_Precious __P((GNode *));
|
|---|
| 135 | void Targ_SetMain __P((GNode *));
|
|---|
| 136 | int Targ_PrintCmd __P((ClientData, ClientData));
|
|---|
| 137 | char *Targ_FmtTime __P((time_t));
|
|---|
| 138 | void Targ_PrintType __P((int));
|
|---|
| 139 | void Targ_PrintGraph __P((int));
|
|---|
| 140 |
|
|---|
| 141 | /* var.c */
|
|---|
| 142 | void Var_Delete __P((char *, GNode *));
|
|---|
| 143 | void Var_Set __P((char *, char *, GNode *));
|
|---|
| 144 | void Var_Append __P((char *, char *, GNode *));
|
|---|
| 145 | Boolean Var_Exists __P((char *, GNode *));
|
|---|
| 146 | char *Var_Value __P((char *, GNode *, char **));
|
|---|
| 147 | char *Var_Parse __P((char *, GNode *, Boolean, int *, Boolean *));
|
|---|
| 148 | char *Var_Subst __P((char *, char *, GNode *, Boolean));
|
|---|
| 149 | char *Var_GetTail __P((char *));
|
|---|
| 150 | char *Var_GetHead __P((char *));
|
|---|
| 151 | void Var_Init __P((void));
|
|---|
| 152 | void Var_End __P((void));
|
|---|
| 153 | void Var_Dump __P((GNode *));
|
|---|
| 154 |
|
|---|
| 155 | #endif
|
|---|
