ee914ef902
Lots more unit tests and code cleanup
Relevant changes from ChangeLog
o job.c: Print -de error information when running multiple jobs
o var.c: only report error for unmatched regex subexpression
when linting (-dL) since we cannot tell when an unmatched
subexpression is an expected result.
reduce memory allocations in the modifiers ':D' and ':U'
reduce memory allocation and strlen calls in modifier ':from=to'
in the ':Q' modifier, only allocate memory if necessary
improve performance for LazyBuf
reduce debug logging and memory allocation for ${:U...}
reduce verbosity of the -dv debug logging for standard cases
fix double varname expansion in the variable modifier '::='
o var.c: avoid evaluating many modifiers in parse only mode
in strict mode (-dL) many variable references are parsed twice,
the first time just to report parse errors early, so we want to
avoid side effects and wasted effort to the extent possible.
348 lines
11 KiB
C
348 lines
11 KiB
C
/* $NetBSD: nonints.h,v 1.213 2021/04/11 13:35:56 rillig Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1988, 1989, 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Adam de Boor.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* from: @(#)nonints.h 8.3 (Berkeley) 3/19/94
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 1989 by Berkeley Softworks
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Adam de Boor.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* from: @(#)nonints.h 8.3 (Berkeley) 3/19/94
|
|
*/
|
|
|
|
/* arch.c */
|
|
void Arch_Init(void);
|
|
void Arch_End(void);
|
|
|
|
bool Arch_ParseArchive(char **, GNodeList *, GNode *);
|
|
void Arch_Touch(GNode *);
|
|
void Arch_TouchLib(GNode *);
|
|
void Arch_UpdateMTime(GNode *gn);
|
|
void Arch_UpdateMemberMTime(GNode *gn);
|
|
void Arch_FindLib(GNode *, SearchPath *);
|
|
bool Arch_LibOODate(GNode *);
|
|
bool Arch_IsLib(GNode *);
|
|
|
|
/* compat.c */
|
|
int Compat_RunCommand(const char *, GNode *, StringListNode *);
|
|
void Compat_Run(GNodeList *);
|
|
void Compat_Make(GNode *, GNode *);
|
|
|
|
/* cond.c */
|
|
CondEvalResult Cond_EvalCondition(const char *, bool *);
|
|
CondEvalResult Cond_EvalLine(const char *);
|
|
void Cond_restore_depth(unsigned int);
|
|
unsigned int Cond_save_depth(void);
|
|
|
|
/* dir.c; see also dir.h */
|
|
|
|
MAKE_INLINE const char *
|
|
str_basename(const char *pathname)
|
|
{
|
|
const char *lastSlash = strrchr(pathname, '/');
|
|
return lastSlash != NULL ? lastSlash + 1 : pathname;
|
|
}
|
|
|
|
MAKE_INLINE SearchPath *
|
|
SearchPath_New(void)
|
|
{
|
|
SearchPath *path = bmake_malloc(sizeof *path);
|
|
Lst_Init(&path->dirs);
|
|
return path;
|
|
}
|
|
|
|
void SearchPath_Free(SearchPath *);
|
|
|
|
/* for.c */
|
|
int For_Eval(const char *);
|
|
bool For_Accum(const char *);
|
|
void For_Run(int);
|
|
|
|
/* job.c */
|
|
#ifdef WAIT_T
|
|
void JobReapChild(pid_t, WAIT_T, bool);
|
|
#endif
|
|
|
|
/* main.c */
|
|
bool GetBooleanExpr(const char *, bool);
|
|
void Main_ParseArgLine(const char *);
|
|
char *Cmd_Exec(const char *, const char **);
|
|
void Error(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
|
|
void Fatal(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
|
|
void Punt(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
|
|
void DieHorribly(void) MAKE_ATTR_DEAD;
|
|
void Finish(int) MAKE_ATTR_DEAD;
|
|
int eunlink(const char *);
|
|
void execDie(const char *, const char *);
|
|
char *getTmpdir(void);
|
|
bool ParseBoolean(const char *, bool);
|
|
char *cached_realpath(const char *, char *);
|
|
|
|
/* parse.c */
|
|
void Parse_Init(void);
|
|
void Parse_End(void);
|
|
|
|
typedef enum VarAssignOp {
|
|
VAR_NORMAL, /* = */
|
|
VAR_SUBST, /* := */
|
|
VAR_SHELL, /* != or :sh= */
|
|
VAR_APPEND, /* += */
|
|
VAR_DEFAULT /* ?= */
|
|
} VarAssignOp;
|
|
|
|
typedef struct VarAssign {
|
|
char *varname; /* unexpanded */
|
|
VarAssignOp op;
|
|
const char *value; /* unexpanded */
|
|
} VarAssign;
|
|
|
|
typedef char *(*ReadMoreProc)(void *, size_t *);
|
|
|
|
void Parse_Error(ParseErrorLevel, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
|
|
bool Parse_IsVar(const char *, VarAssign *out_var);
|
|
void Parse_Var(VarAssign *, GNode *);
|
|
void Parse_AddIncludeDir(const char *);
|
|
void Parse_File(const char *, int);
|
|
void Parse_SetInput(const char *, int, int, ReadMoreProc, void *);
|
|
void Parse_MainName(GNodeList *);
|
|
int Parse_GetFatals(void);
|
|
|
|
|
|
#ifndef HAVE_STRLCPY
|
|
/* strlcpy.c */
|
|
size_t strlcpy(char *, const char *, size_t);
|
|
#endif
|
|
|
|
/* suff.c */
|
|
void Suff_Init(void);
|
|
void Suff_End(void);
|
|
|
|
void Suff_ClearSuffixes(void);
|
|
bool Suff_IsTransform(const char *);
|
|
GNode *Suff_AddTransform(const char *);
|
|
void Suff_EndTransform(GNode *);
|
|
void Suff_AddSuffix(const char *, GNode **);
|
|
SearchPath *Suff_GetPath(const char *);
|
|
void Suff_ExtendPaths(void);
|
|
void Suff_AddInclude(const char *);
|
|
void Suff_AddLib(const char *);
|
|
void Suff_FindDeps(GNode *);
|
|
SearchPath *Suff_FindPath(GNode *);
|
|
void Suff_SetNull(const char *);
|
|
void Suff_PrintAll(void);
|
|
|
|
/* targ.c */
|
|
void Targ_Init(void);
|
|
void Targ_End(void);
|
|
|
|
void Targ_Stats(void);
|
|
GNodeList *Targ_List(void);
|
|
GNode *GNode_New(const char *);
|
|
GNode *Targ_FindNode(const char *);
|
|
GNode *Targ_GetNode(const char *);
|
|
GNode *Targ_NewInternalNode(const char *);
|
|
GNode *Targ_GetEndNode(void);
|
|
void Targ_FindList(GNodeList *, StringList *);
|
|
bool Targ_Precious(const GNode *);
|
|
void Targ_SetMain(GNode *);
|
|
void Targ_PrintCmds(GNode *);
|
|
void Targ_PrintNode(GNode *, int);
|
|
void Targ_PrintNodes(GNodeList *, int);
|
|
const char *Targ_FmtTime(time_t);
|
|
void Targ_PrintType(int);
|
|
void Targ_PrintGraph(int);
|
|
void Targ_Propagate(void);
|
|
const char *GNodeMade_Name(GNodeMade);
|
|
|
|
/* var.c */
|
|
void Var_Init(void);
|
|
void Var_End(void);
|
|
|
|
typedef enum VarEvalMode {
|
|
|
|
/*
|
|
* Only parse the expression but don't evaluate any part of it.
|
|
*
|
|
* TODO: Document what Var_Parse and Var_Subst return in this mode.
|
|
* As of 2021-03-15, they return unspecified, inconsistent results.
|
|
*/
|
|
VARE_PARSE_ONLY,
|
|
|
|
/* Parse and evaluate the expression. */
|
|
VARE_WANTRES,
|
|
|
|
/*
|
|
* Parse and evaluate the expression. It is an error if a
|
|
* subexpression evaluates to undefined.
|
|
*/
|
|
VARE_UNDEFERR,
|
|
|
|
/*
|
|
* Parse and evaluate the expression. Keep '$$' as '$$' instead of
|
|
* reducing it to a single '$'. Subexpressions that evaluate to
|
|
* undefined expand to an empty string.
|
|
*
|
|
* Used in variable assignments using the ':=' operator. It allows
|
|
* multiple such assignments to be chained without accidentally
|
|
* expanding '$$file' to '$file' in the first assignment and
|
|
* interpreting it as '${f}' followed by 'ile' in the next assignment.
|
|
*/
|
|
VARE_EVAL_KEEP_DOLLAR,
|
|
|
|
/*
|
|
* Parse and evaluate the expression. Keep undefined variables as-is
|
|
* instead of expanding them to an empty string.
|
|
*
|
|
* Example for a ':=' assignment:
|
|
* CFLAGS = $(.INCLUDES)
|
|
* CFLAGS := -I.. $(CFLAGS)
|
|
* # If .INCLUDES (an undocumented special variable, by the
|
|
* # way) is still undefined, the updated CFLAGS becomes
|
|
* # "-I.. $(.INCLUDES)".
|
|
*/
|
|
VARE_EVAL_KEEP_UNDEF,
|
|
|
|
/*
|
|
* Parse and evaluate the expression. Keep '$$' as '$$' and preserve
|
|
* undefined subexpressions.
|
|
*/
|
|
VARE_KEEP_DOLLAR_UNDEF
|
|
} VarEvalMode;
|
|
|
|
typedef enum VarSetFlags {
|
|
VAR_SET_NONE = 0,
|
|
|
|
/* do not export */
|
|
VAR_SET_NO_EXPORT = 1 << 0,
|
|
|
|
/* Make the variable read-only. No further modification is possible,
|
|
* except for another call to Var_Set with the same flag. */
|
|
VAR_SET_READONLY = 1 << 1
|
|
} VarSetFlags;
|
|
|
|
/* The state of error handling returned by Var_Parse. */
|
|
typedef enum VarParseResult {
|
|
|
|
/* Both parsing and evaluation succeeded. */
|
|
VPR_OK,
|
|
|
|
/* Parsing or evaluating failed, with an error message. */
|
|
VPR_ERR,
|
|
|
|
/*
|
|
* Parsing succeeded, undefined expressions are allowed and the
|
|
* expression was still undefined after applying all modifiers.
|
|
* No error message is printed in this case.
|
|
*
|
|
* Some callers handle this case differently, so return this
|
|
* information to them, for now.
|
|
*
|
|
* TODO: Instead of having this special return value, rather ensure
|
|
* that VARE_EVAL_KEEP_UNDEF is processed properly.
|
|
*/
|
|
VPR_UNDEF
|
|
|
|
} VarParseResult;
|
|
|
|
typedef enum VarExportMode {
|
|
/* .export-env */
|
|
VEM_ENV,
|
|
/* .export: Initial export or update an already exported variable. */
|
|
VEM_PLAIN,
|
|
/* .export-literal: Do not expand the variable value. */
|
|
VEM_LITERAL
|
|
} VarExportMode;
|
|
|
|
void Var_Delete(GNode *, const char *);
|
|
void Var_DeleteExpand(GNode *, const char *);
|
|
void Var_Undef(const char *);
|
|
void Var_Set(GNode *, const char *, const char *);
|
|
void Var_SetExpand(GNode *, const char *, const char *);
|
|
void Var_SetWithFlags(GNode *, const char *, const char *, VarSetFlags);
|
|
void Var_SetExpandWithFlags(GNode *, const char *, const char *, VarSetFlags);
|
|
void Var_Append(GNode *, const char *, const char *);
|
|
void Var_AppendExpand(GNode *, const char *, const char *);
|
|
bool Var_Exists(GNode *, const char *);
|
|
bool Var_ExistsExpand(GNode *, const char *);
|
|
FStr Var_Value(GNode *, const char *);
|
|
const char *GNode_ValueDirect(GNode *, const char *);
|
|
VarParseResult Var_Parse(const char **, GNode *, VarEvalMode, FStr *);
|
|
VarParseResult Var_Subst(const char *, GNode *, VarEvalMode, char **);
|
|
void Var_Stats(void);
|
|
void Var_Dump(GNode *);
|
|
void Var_ReexportVars(void);
|
|
void Var_Export(VarExportMode, const char *);
|
|
void Var_ExportVars(const char *);
|
|
void Var_UnExport(bool, const char *);
|
|
|
|
void Global_Set(const char *, const char *);
|
|
void Global_SetExpand(const char *, const char *);
|
|
void Global_Append(const char *, const char *);
|
|
void Global_Delete(const char *);
|
|
|
|
/* util.c */
|
|
typedef void (*SignalProc)(int);
|
|
SignalProc bmake_signal(int, SignalProc);
|