2020-07-08 18:32:15 +00:00
|
|
|
/* $NetBSD: str.c,v 1.51 2020/07/03 07:40:13 rillig Exp $ */
|
2012-06-08 21:57:36 +00:00
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1988, 1989, 1990, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
2012-06-08 21:57:36 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*-
|
1996-10-06 15:57:15 +00:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2012-06-08 21:57:36 +00:00
|
|
|
#ifndef MAKE_NATIVE
|
2020-07-08 18:32:15 +00:00
|
|
|
static char rcsid[] = "$NetBSD: str.c,v 1.51 2020/07/03 07:40:13 rillig Exp $";
|
2012-06-08 21:57:36 +00:00
|
|
|
#else
|
|
|
|
#include <sys/cdefs.h>
|
1996-10-06 15:57:15 +00:00
|
|
|
#ifndef lint
|
2012-06-08 21:57:36 +00:00
|
|
|
#if 0
|
|
|
|
static char sccsid[] = "@(#)str.c 5.8 (Berkeley) 6/1/90";
|
|
|
|
#else
|
2020-07-08 18:32:15 +00:00
|
|
|
__RCSID("$NetBSD: str.c,v 1.51 2020/07/03 07:40:13 rillig Exp $");
|
2012-06-08 21:57:36 +00:00
|
|
|
#endif
|
|
|
|
#endif /* not lint */
|
|
|
|
#endif
|
1996-10-06 15:57:15 +00:00
|
|
|
|
|
|
|
#include "make.h"
|
|
|
|
|
|
|
|
/*-
|
|
|
|
* str_concat --
|
|
|
|
* concatenate the two strings, inserting a space or slash between them,
|
|
|
|
* freeing them if requested.
|
|
|
|
*
|
|
|
|
* returns --
|
|
|
|
* the resulting string in allocated space.
|
|
|
|
*/
|
|
|
|
char *
|
2012-06-08 21:57:36 +00:00
|
|
|
str_concat(const char *s1, const char *s2, int flags)
|
1996-10-06 15:57:15 +00:00
|
|
|
{
|
2012-06-08 21:57:36 +00:00
|
|
|
int len1, len2;
|
|
|
|
char *result;
|
1996-10-06 15:57:15 +00:00
|
|
|
|
|
|
|
/* get the length of both strings */
|
|
|
|
len1 = strlen(s1);
|
|
|
|
len2 = strlen(s2);
|
|
|
|
|
|
|
|
/* allocate length plus separator plus EOS */
|
2016-05-20 16:19:56 +00:00
|
|
|
result = bmake_malloc((unsigned int)(len1 + len2 + 2));
|
1996-10-06 15:57:15 +00:00
|
|
|
|
|
|
|
/* copy first string into place */
|
|
|
|
memcpy(result, s1, len1);
|
|
|
|
|
|
|
|
/* add separator character */
|
|
|
|
if (flags & STR_ADDSPACE) {
|
|
|
|
result[len1] = ' ';
|
|
|
|
++len1;
|
|
|
|
} else if (flags & STR_ADDSLASH) {
|
|
|
|
result[len1] = '/';
|
|
|
|
++len1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* copy second string plus EOS into place */
|
|
|
|
memcpy(result + len1, s2, len2 + 1);
|
|
|
|
|
2020-07-01 02:13:04 +00:00
|
|
|
return result;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*-
|
|
|
|
* brk_string --
|
|
|
|
* Fracture a string into an array of words (as delineated by tabs or
|
|
|
|
* spaces) taking quotation marks into account. Leading tabs/spaces
|
|
|
|
* are ignored.
|
|
|
|
*
|
2012-06-08 21:57:36 +00:00
|
|
|
* If expand is TRUE, quotes are removed and escape sequences
|
|
|
|
* such as \r, \t, etc... are expanded.
|
|
|
|
*
|
1996-10-06 15:57:15 +00:00
|
|
|
* returns --
|
2012-06-08 21:57:36 +00:00
|
|
|
* Pointer to the array of pointers to the words.
|
2020-05-20 19:34:48 +00:00
|
|
|
* Memory containing the actual words in *store_words_buf.
|
2012-06-08 21:57:36 +00:00
|
|
|
* Both of these must be free'd by the caller.
|
2020-05-20 19:34:48 +00:00
|
|
|
* Number of words in *store_words_len.
|
1996-10-06 15:57:15 +00:00
|
|
|
*/
|
|
|
|
char **
|
2020-05-20 19:34:48 +00:00
|
|
|
brk_string(const char *str, int *store_words_len, Boolean expand,
|
|
|
|
char **store_words_buf)
|
1996-10-06 15:57:15 +00:00
|
|
|
{
|
2020-05-20 19:34:48 +00:00
|
|
|
char inquote;
|
|
|
|
const char *str_p;
|
|
|
|
size_t str_len;
|
|
|
|
char **words;
|
|
|
|
int words_len;
|
|
|
|
int words_cap = 50;
|
|
|
|
char *words_buf, *word_start, *word_end;
|
1996-10-06 15:57:15 +00:00
|
|
|
|
|
|
|
/* skip leading space chars. */
|
|
|
|
for (; *str == ' ' || *str == '\t'; ++str)
|
|
|
|
continue;
|
|
|
|
|
2020-05-20 19:34:48 +00:00
|
|
|
/* words_buf holds the words, separated by '\0'. */
|
|
|
|
str_len = strlen(str);
|
|
|
|
words_buf = bmake_malloc(strlen(str) + 1);
|
1996-10-06 15:57:15 +00:00
|
|
|
|
2020-05-20 19:34:48 +00:00
|
|
|
words_cap = MAX((str_len / 5), 50);
|
|
|
|
words = bmake_malloc((words_cap + 1) * sizeof(char *));
|
2014-07-02 21:24:54 +00:00
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
/*
|
|
|
|
* copy the string; at the same time, parse backslashes,
|
2020-05-20 19:34:48 +00:00
|
|
|
* quotes and build the word list.
|
1996-10-06 15:57:15 +00:00
|
|
|
*/
|
2020-05-20 19:34:48 +00:00
|
|
|
words_len = 0;
|
1996-10-06 15:57:15 +00:00
|
|
|
inquote = '\0';
|
2020-05-20 19:34:48 +00:00
|
|
|
word_start = word_end = words_buf;
|
|
|
|
for (str_p = str;; ++str_p) {
|
|
|
|
char ch = *str_p;
|
|
|
|
switch(ch) {
|
1996-10-06 15:57:15 +00:00
|
|
|
case '"':
|
|
|
|
case '\'':
|
2012-06-08 21:57:36 +00:00
|
|
|
if (inquote) {
|
1996-10-06 15:57:15 +00:00
|
|
|
if (inquote == ch)
|
|
|
|
inquote = '\0';
|
|
|
|
else
|
|
|
|
break;
|
2012-06-08 21:57:36 +00:00
|
|
|
}
|
1996-10-06 15:57:15 +00:00
|
|
|
else {
|
|
|
|
inquote = (char) ch;
|
|
|
|
/* Don't miss "" or '' */
|
2020-05-20 19:34:48 +00:00
|
|
|
if (word_start == NULL && str_p[1] == inquote) {
|
2012-06-08 21:57:36 +00:00
|
|
|
if (!expand) {
|
2020-05-20 19:34:48 +00:00
|
|
|
word_start = word_end;
|
|
|
|
*word_end++ = ch;
|
2012-06-08 21:57:36 +00:00
|
|
|
} else
|
2020-05-20 19:34:48 +00:00
|
|
|
word_start = word_end + 1;
|
|
|
|
str_p++;
|
2012-06-08 21:57:36 +00:00
|
|
|
inquote = '\0';
|
1996-10-06 15:57:15 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!expand) {
|
2020-05-20 19:34:48 +00:00
|
|
|
if (word_start == NULL)
|
|
|
|
word_start = word_end;
|
|
|
|
*word_end++ = ch;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
continue;
|
|
|
|
case ' ':
|
|
|
|
case '\t':
|
|
|
|
case '\n':
|
|
|
|
if (inquote)
|
|
|
|
break;
|
2020-05-20 19:34:48 +00:00
|
|
|
if (word_start == NULL)
|
1996-10-06 15:57:15 +00:00
|
|
|
continue;
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
case '\0':
|
|
|
|
/*
|
2020-05-20 19:34:48 +00:00
|
|
|
* end of a token -- make sure there's enough words
|
1996-10-06 15:57:15 +00:00
|
|
|
* space and save off a pointer.
|
|
|
|
*/
|
2020-05-20 19:34:48 +00:00
|
|
|
if (word_start == NULL)
|
1996-10-06 15:57:15 +00:00
|
|
|
goto done;
|
|
|
|
|
2020-05-20 19:34:48 +00:00
|
|
|
*word_end++ = '\0';
|
|
|
|
if (words_len == words_cap) {
|
|
|
|
words_cap *= 2; /* ramp up fast */
|
|
|
|
words = (char **)bmake_realloc(words,
|
|
|
|
(words_cap + 1) * sizeof(char *));
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-05-20 19:34:48 +00:00
|
|
|
words[words_len++] = word_start;
|
|
|
|
word_start = NULL;
|
2012-06-08 21:57:36 +00:00
|
|
|
if (ch == '\n' || ch == '\0') {
|
|
|
|
if (expand && inquote) {
|
2020-05-20 19:34:48 +00:00
|
|
|
free(words);
|
|
|
|
free(words_buf);
|
|
|
|
*store_words_buf = NULL;
|
2012-06-08 21:57:36 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
1996-10-06 15:57:15 +00:00
|
|
|
goto done;
|
2012-06-08 21:57:36 +00:00
|
|
|
}
|
1996-10-06 15:57:15 +00:00
|
|
|
continue;
|
|
|
|
case '\\':
|
|
|
|
if (!expand) {
|
2020-05-20 19:34:48 +00:00
|
|
|
if (word_start == NULL)
|
|
|
|
word_start = word_end;
|
|
|
|
*word_end++ = '\\';
|
|
|
|
/* catch '\' at end of line */
|
|
|
|
if (str_p[1] == '\0')
|
2012-06-08 21:57:36 +00:00
|
|
|
continue;
|
2020-05-20 19:34:48 +00:00
|
|
|
ch = *++str_p;
|
1996-10-06 15:57:15 +00:00
|
|
|
break;
|
|
|
|
}
|
2012-06-08 21:57:36 +00:00
|
|
|
|
2020-05-20 19:34:48 +00:00
|
|
|
switch (ch = *++str_p) {
|
1996-10-06 15:57:15 +00:00
|
|
|
case '\0':
|
|
|
|
case '\n':
|
|
|
|
/* hmmm; fix it up as best we can */
|
|
|
|
ch = '\\';
|
2020-05-20 19:34:48 +00:00
|
|
|
--str_p;
|
1996-10-06 15:57:15 +00:00
|
|
|
break;
|
|
|
|
case 'b':
|
|
|
|
ch = '\b';
|
|
|
|
break;
|
|
|
|
case 'f':
|
|
|
|
ch = '\f';
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
ch = '\n';
|
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
ch = '\r';
|
|
|
|
break;
|
|
|
|
case 't':
|
|
|
|
ch = '\t';
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2020-05-20 19:34:48 +00:00
|
|
|
if (word_start == NULL)
|
|
|
|
word_start = word_end;
|
|
|
|
*word_end++ = ch;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-05-20 19:34:48 +00:00
|
|
|
done: words[words_len] = NULL;
|
|
|
|
*store_words_len = words_len;
|
|
|
|
*store_words_buf = words_buf;
|
|
|
|
return words;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Str_FindSubstring -- See if a string contains a particular substring.
|
2012-06-08 21:57:36 +00:00
|
|
|
*
|
|
|
|
* Input:
|
|
|
|
* string String to search.
|
|
|
|
* substring Substring to find in string.
|
|
|
|
*
|
1996-10-06 15:57:15 +00:00
|
|
|
* Results: If string contains substring, the return value is the location of
|
|
|
|
* the first matching instance of substring in string. If string doesn't
|
|
|
|
* contain substring, the return value is NULL. Matching is done on an exact
|
|
|
|
* character-for-character basis with no wildcards or special characters.
|
2012-06-08 21:57:36 +00:00
|
|
|
*
|
1996-10-06 15:57:15 +00:00
|
|
|
* Side effects: None.
|
|
|
|
*/
|
|
|
|
char *
|
2012-06-08 21:57:36 +00:00
|
|
|
Str_FindSubstring(const char *string, const char *substring)
|
1996-10-06 15:57:15 +00:00
|
|
|
{
|
2012-06-08 21:57:36 +00:00
|
|
|
const char *a, *b;
|
1996-10-06 15:57:15 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* First scan quickly through the two strings looking for a single-
|
|
|
|
* character match. When it's found, then compare the rest of the
|
|
|
|
* substring.
|
|
|
|
*/
|
|
|
|
|
2020-07-01 02:13:04 +00:00
|
|
|
for (b = substring; *string != 0; string++) {
|
1996-10-06 15:57:15 +00:00
|
|
|
if (*string != *b)
|
|
|
|
continue;
|
|
|
|
a = string;
|
|
|
|
for (;;) {
|
|
|
|
if (*b == 0)
|
2012-06-08 21:57:36 +00:00
|
|
|
return UNCONST(string);
|
1996-10-06 15:57:15 +00:00
|
|
|
if (*a++ != *b++)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
b = substring;
|
|
|
|
}
|
2012-06-08 21:57:36 +00:00
|
|
|
return NULL;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2020-07-08 18:32:15 +00:00
|
|
|
* Str_Match -- Test if a string matches a pattern like "*.[ch]".
|
2012-06-08 21:57:36 +00:00
|
|
|
*
|
|
|
|
* XXX this function does not detect or report malformed patterns.
|
|
|
|
*
|
2020-07-08 18:32:15 +00:00
|
|
|
* Results:
|
|
|
|
* Non-zero is returned if string matches the pattern, 0 otherwise. The
|
|
|
|
* matching operation permits the following special characters in the
|
|
|
|
* pattern: *?\[] (as in fnmatch(3)).
|
|
|
|
*
|
1996-10-06 15:57:15 +00:00
|
|
|
* Side effects: None.
|
|
|
|
*/
|
2020-07-08 18:32:15 +00:00
|
|
|
Boolean
|
|
|
|
Str_Match(const char *str, const char *pat)
|
1996-10-06 15:57:15 +00:00
|
|
|
{
|
|
|
|
for (;;) {
|
|
|
|
/*
|
|
|
|
* See if we're at the end of both the pattern and the
|
|
|
|
* string. If, we succeeded. If we're at the end of the
|
|
|
|
* pattern but not at the end of the string, we failed.
|
|
|
|
*/
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat == 0)
|
|
|
|
return *str == 0;
|
|
|
|
if (*str == 0 && *pat != '*')
|
|
|
|
return FALSE;
|
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
/*
|
2020-07-08 18:32:15 +00:00
|
|
|
* A '*' in the pattern matches any substring. We handle this
|
|
|
|
* by calling ourselves for each suffix of the string.
|
1996-10-06 15:57:15 +00:00
|
|
|
*/
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat == '*') {
|
|
|
|
pat++;
|
|
|
|
while (*pat == '*')
|
|
|
|
pat++;
|
|
|
|
if (*pat == 0)
|
|
|
|
return TRUE;
|
|
|
|
while (*str != 0) {
|
|
|
|
if (Str_Match(str, pat))
|
|
|
|
return TRUE;
|
|
|
|
str++;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
return FALSE;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
|
|
|
|
/* A '?' in the pattern matches any single character. */
|
|
|
|
if (*pat == '?')
|
1996-10-06 15:57:15 +00:00
|
|
|
goto thisCharOK;
|
2020-07-08 18:32:15 +00:00
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
/*
|
2020-07-08 18:32:15 +00:00
|
|
|
* A '[' in the pattern matches a character from a list.
|
|
|
|
* The '[' is followed by the list of acceptable characters,
|
|
|
|
* or by ranges (two characters separated by '-'). In these
|
|
|
|
* character lists, the backslash is an ordinary character.
|
1996-10-06 15:57:15 +00:00
|
|
|
*/
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat == '[') {
|
|
|
|
Boolean neg = pat[1] == '^';
|
|
|
|
pat += 1 + neg;
|
2017-04-15 00:51:18 +00:00
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
for (;;) {
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat == ']' || *pat == 0) {
|
|
|
|
if (neg)
|
2017-05-10 22:40:27 +00:00
|
|
|
break;
|
2020-07-08 18:32:15 +00:00
|
|
|
return FALSE;
|
2017-05-10 22:40:27 +00:00
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat == *str)
|
1996-10-06 15:57:15 +00:00
|
|
|
break;
|
2020-07-08 18:32:15 +00:00
|
|
|
if (pat[1] == '-') {
|
|
|
|
if (pat[2] == 0)
|
|
|
|
return neg;
|
|
|
|
if (*pat <= *str && pat[2] >= *str)
|
1996-10-06 15:57:15 +00:00
|
|
|
break;
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat >= *str && pat[2] <= *str)
|
1996-10-06 15:57:15 +00:00
|
|
|
break;
|
2020-07-08 18:32:15 +00:00
|
|
|
pat += 2;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
pat++;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
if (neg && *pat != ']' && *pat != 0)
|
|
|
|
return FALSE;
|
|
|
|
while (*pat != ']' && *pat != 0)
|
|
|
|
pat++;
|
|
|
|
if (*pat == 0)
|
|
|
|
pat--;
|
1996-10-06 15:57:15 +00:00
|
|
|
goto thisCharOK;
|
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
/*
|
2020-07-08 18:32:15 +00:00
|
|
|
* A backslash in the pattern matches the character following
|
|
|
|
* it exactly.
|
1996-10-06 15:57:15 +00:00
|
|
|
*/
|
2020-07-08 18:32:15 +00:00
|
|
|
if (*pat == '\\') {
|
|
|
|
pat++;
|
|
|
|
if (*pat == 0)
|
|
|
|
return FALSE;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
2020-07-08 18:32:15 +00:00
|
|
|
|
|
|
|
if (*pat != *str)
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
thisCharOK:
|
|
|
|
pat++;
|
|
|
|
str++;
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*-
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
* Str_SYSVMatch --
|
2012-06-08 21:57:36 +00:00
|
|
|
* Check word against pattern for a match (% is wild),
|
|
|
|
*
|
|
|
|
* Input:
|
|
|
|
* word Word to examine
|
|
|
|
* pattern Pattern to examine against
|
|
|
|
* len Number of characters to substitute
|
|
|
|
*
|
1996-10-06 15:57:15 +00:00
|
|
|
* Results:
|
|
|
|
* Returns the beginning position of a match or null. The number
|
|
|
|
* of characters matched is returned in len.
|
|
|
|
*
|
|
|
|
* Side Effects:
|
|
|
|
* None
|
|
|
|
*
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
*/
|
|
|
|
char *
|
2020-05-20 19:34:48 +00:00
|
|
|
Str_SYSVMatch(const char *word, const char *pattern, size_t *len,
|
|
|
|
Boolean *hasPercent)
|
1996-10-06 15:57:15 +00:00
|
|
|
{
|
2012-06-08 21:57:36 +00:00
|
|
|
const char *p = pattern;
|
|
|
|
const char *w = word;
|
|
|
|
const char *m;
|
1996-10-06 15:57:15 +00:00
|
|
|
|
2020-05-20 19:34:48 +00:00
|
|
|
*hasPercent = FALSE;
|
1996-10-06 15:57:15 +00:00
|
|
|
if (*p == '\0') {
|
|
|
|
/* Null pattern is the whole string */
|
|
|
|
*len = strlen(w);
|
2012-06-08 21:57:36 +00:00
|
|
|
return UNCONST(w);
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if ((m = strchr(p, '%')) != NULL) {
|
2020-05-20 19:34:48 +00:00
|
|
|
*hasPercent = TRUE;
|
|
|
|
if (*w == '\0') {
|
|
|
|
/* empty word does not match pattern */
|
|
|
|
return NULL;
|
|
|
|
}
|
1996-10-06 15:57:15 +00:00
|
|
|
/* check that the prefix matches */
|
|
|
|
for (; p != m && *w && *w == *p; w++, p++)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (p != m)
|
|
|
|
return NULL; /* No match */
|
|
|
|
|
|
|
|
if (*++p == '\0') {
|
|
|
|
/* No more pattern, return the rest of the string */
|
|
|
|
*len = strlen(w);
|
2012-06-08 21:57:36 +00:00
|
|
|
return UNCONST(w);
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
m = w;
|
|
|
|
|
|
|
|
/* Find a matching tail */
|
|
|
|
do
|
|
|
|
if (strcmp(p, w) == 0) {
|
|
|
|
*len = w - m;
|
2012-06-08 21:57:36 +00:00
|
|
|
return UNCONST(m);
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|
|
|
|
while (*w++ != '\0');
|
2012-06-08 21:57:36 +00:00
|
|
|
|
1996-10-06 15:57:15 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
* Str_SYSVSubst --
|
|
|
|
* Substitute '%' on the pattern with len characters from src.
|
|
|
|
* If the pattern does not contain a '%' prepend len characters
|
|
|
|
* from src.
|
2012-06-08 21:57:36 +00:00
|
|
|
*
|
1996-10-06 15:57:15 +00:00
|
|
|
* Results:
|
|
|
|
* None
|
|
|
|
*
|
|
|
|
* Side Effects:
|
|
|
|
* Places result on buf
|
|
|
|
*
|
|
|
|
*-----------------------------------------------------------------------
|
|
|
|
*/
|
|
|
|
void
|
2020-05-20 19:34:48 +00:00
|
|
|
Str_SYSVSubst(Buffer *buf, char *pat, char *src, size_t len,
|
|
|
|
Boolean lhsHasPercent)
|
1996-10-06 15:57:15 +00:00
|
|
|
{
|
|
|
|
char *m;
|
|
|
|
|
2020-05-20 19:34:48 +00:00
|
|
|
if ((m = strchr(pat, '%')) != NULL && lhsHasPercent) {
|
1996-10-06 15:57:15 +00:00
|
|
|
/* Copy the prefix */
|
2012-06-08 21:57:36 +00:00
|
|
|
Buf_AddBytes(buf, m - pat, pat);
|
1996-10-06 15:57:15 +00:00
|
|
|
/* skip the % */
|
|
|
|
pat = m + 1;
|
|
|
|
}
|
2020-05-20 19:34:48 +00:00
|
|
|
if (m != NULL || !lhsHasPercent) {
|
|
|
|
/* Copy the pattern */
|
|
|
|
Buf_AddBytes(buf, len, src);
|
|
|
|
}
|
1996-10-06 15:57:15 +00:00
|
|
|
|
|
|
|
/* append the rest */
|
2012-06-08 21:57:36 +00:00
|
|
|
Buf_AddBytes(buf, strlen(pat), pat);
|
1996-10-06 15:57:15 +00:00
|
|
|
}
|