2002-10-28 23:33:57 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 2002 Juli Mallett.
|
|
|
|
* Copyright (c) 1988, 1989, 1990, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* $FreeBSD$
|
|
|
|
*/
|
|
|
|
|
2005-02-01 10:50:37 +00:00
|
|
|
#ifndef var_h_9cccafce
|
|
|
|
#define var_h_9cccafce
|
|
|
|
|
|
|
|
#include <regex.h>
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
|
|
|
struct GNode;
|
2005-02-02 07:36:18 +00:00
|
|
|
struct Buffer;
|
2005-02-01 10:50:37 +00:00
|
|
|
|
2002-10-28 23:33:57 +00:00
|
|
|
typedef struct Var {
|
2005-03-22 08:00:02 +00:00
|
|
|
char *name; /* the variable's name */
|
|
|
|
struct Buffer *val; /* its value */
|
|
|
|
int flags; /* miscellaneous status flags */
|
2005-02-02 07:36:18 +00:00
|
|
|
|
|
|
|
#define VAR_IN_USE 1 /* Variable's value currently being used.
|
|
|
|
* Used to avoid recursion */
|
|
|
|
|
|
|
|
#define VAR_FROM_ENV 2 /* Variable comes from the environment */
|
|
|
|
|
|
|
|
#define VAR_JUNK 4 /* Variable is a junk variable that
|
|
|
|
* should be destroyed when done with
|
|
|
|
* it. Used by Var_Parse for undefined,
|
|
|
|
* modified variables */
|
2002-10-28 23:33:57 +00:00
|
|
|
} Var;
|
|
|
|
|
|
|
|
/* Var*Pattern flags */
|
|
|
|
#define VAR_SUB_GLOBAL 0x01 /* Apply substitution globally */
|
|
|
|
#define VAR_SUB_ONE 0x02 /* Apply substitution to one word */
|
|
|
|
#define VAR_SUB_MATCHED 0x04 /* There was a match */
|
|
|
|
#define VAR_MATCH_START 0x08 /* Match at start of word */
|
|
|
|
#define VAR_MATCH_END 0x10 /* Match at end of word */
|
|
|
|
|
|
|
|
typedef struct {
|
2005-03-22 08:00:02 +00:00
|
|
|
char *lhs; /* String to match */
|
|
|
|
size_t leftLen; /* Length of string */
|
|
|
|
char *rhs; /* Replacement string (w/ &'s removed) */
|
|
|
|
size_t rightLen; /* Length of replacement */
|
|
|
|
int flags;
|
2002-10-28 23:33:57 +00:00
|
|
|
} VarPattern;
|
|
|
|
|
2004-11-30 17:46:29 +00:00
|
|
|
typedef struct {
|
2005-03-22 08:00:02 +00:00
|
|
|
regex_t re;
|
|
|
|
int nsub;
|
|
|
|
regmatch_t *matches;
|
|
|
|
char *replace;
|
|
|
|
int flags;
|
2002-10-28 23:33:57 +00:00
|
|
|
} VarREPattern;
|
|
|
|
|
2005-02-07 16:27:19 +00:00
|
|
|
typedef Boolean VarModifyProc(const char *, Boolean, struct Buffer *, void *);
|
|
|
|
|
2002-10-28 23:33:57 +00:00
|
|
|
/*
|
|
|
|
* var.c
|
|
|
|
*/
|
|
|
|
void VarREError(int, regex_t *, const char *);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* var_modify.c
|
|
|
|
*/
|
2005-02-07 16:27:19 +00:00
|
|
|
VarModifyProc VarHead;
|
|
|
|
VarModifyProc VarTail;
|
|
|
|
VarModifyProc VarSuffix;
|
|
|
|
VarModifyProc VarRoot;
|
|
|
|
VarModifyProc VarMatch;
|
2002-10-28 23:33:57 +00:00
|
|
|
#ifdef SYSVVARSUB
|
2005-02-07 16:27:19 +00:00
|
|
|
VarModifyProc VarSYSVMatch;
|
2002-10-28 23:33:57 +00:00
|
|
|
#endif
|
2005-02-07 16:27:19 +00:00
|
|
|
VarModifyProc VarNoMatch;
|
|
|
|
VarModifyProc VarRESubstitute;
|
|
|
|
VarModifyProc VarSubstitute;
|
2005-02-01 10:50:37 +00:00
|
|
|
|
2005-02-04 12:10:20 +00:00
|
|
|
void Var_Delete(const char *, struct GNode *);
|
|
|
|
void Var_Set(const char *, const char *, struct GNode *);
|
|
|
|
void Var_Append(const char *, const char *, struct GNode *);
|
|
|
|
Boolean Var_Exists(const char *, struct GNode *);
|
|
|
|
char *Var_Value(const char *, struct GNode *, char **);
|
2005-02-01 10:50:37 +00:00
|
|
|
char *Var_Quote(const char *);
|
2005-03-08 07:43:57 +00:00
|
|
|
char *Var_Parse(const char *, struct GNode *, Boolean, size_t *, Boolean *);
|
|
|
|
struct Buffer *Var_Subst(const char *, const char *, struct GNode *, Boolean);
|
2005-02-01 10:50:37 +00:00
|
|
|
char *Var_GetTail(char *);
|
|
|
|
char *Var_GetHead(char *);
|
|
|
|
void Var_Init(void);
|
2005-03-10 15:38:01 +00:00
|
|
|
void Var_Dump(const struct GNode *);
|
2005-02-01 10:50:37 +00:00
|
|
|
|
|
|
|
#endif /* var_h_9cccafce */
|