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
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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
38 * @(#)str.c 5.8 (Berkeley) 6/1/90
39 * $FreeBSD: src/usr.bin/make/str.c,v 1.12.2.2 2004/02/23 12:10:57 ru Exp $
40 * $DragonFly: src/usr.bin/make/str.c,v 1.14 2005/01/05 23:28:20 okumoto Exp $
45 static char **argv, *buffer;
46 static int argmax, curlen;
50 * Initialize the strings package
58 argv = emalloc(((argmax = 50) + 1) * sizeof(char *));
59 argv[0] = Var_Value(".MAKE", VAR_GLOBAL, &p1);
64 * concatenate the two strings, inserting a space or slash between them.
67 * the resulting string in allocated space.
70 str_concat(const char *s1, const char *s2, int flags)
75 /* get the length of both strings */
79 /* allocate length plus separator plus EOS */
80 result = emalloc(len1 + len2 + 2);
82 /* copy first string into place */
83 memcpy(result, s1, len1);
85 /* add separator character */
86 if (flags & STR_ADDSPACE) {
89 } else if (flags & STR_ADDSLASH) {
94 /* copy second string plus EOS into place */
95 memcpy(result + len1, s2, len2 + 1);
102 * Fracture a string into an array of words (as delineated by tabs or
103 * spaces) taking quotation marks into account. Leading tabs/spaces
107 * Pointer to the array of pointers to the words. To make life easier,
108 * the first word is always the value of the .MAKE variable.
111 brk_string(char *str, int *store_argc, Boolean expand)
114 char inquote, *p, *start, *t;
117 /* skip leading space chars. */
118 for (; *str == ' ' || *str == '\t'; ++str)
121 /* allocate room for a copy of the string */
122 if ((len = strlen(str) + 1) > curlen) {
125 buffer = emalloc(curlen = len);
129 * copy the string; at the same time, parse backslashes,
130 * quotes and build the argument list.
134 for (p = str, start = t = buffer;; ++p) {
142 /* Don't miss "" or '' */
160 * end of a token -- make sure there's enough argv
161 * space and save off a pointer.
167 if (argc == argmax) {
168 argmax *= 2; /* ramp up fast */
169 argv = erealloc(argv,
170 (argmax + 1) * sizeof(char *));
172 argv[argc++] = start;
174 if (ch == '\n' || ch == '\0')
189 /* hmmm; fix it up as best we can */
219 done: argv[argc] = NULL;
227 * See if a particular string matches a particular pattern.
229 * Results: Non-zero is returned if string matches pattern, 0 otherwise. The
230 * matching operation permits the following special characters in the
231 * pattern: *?\[] (see the man page for details on what these mean).
233 * Side effects: None.
236 Str_Match(const char *string, const char *pattern)
242 * See if we're at the end of both the pattern and the
243 * string. If, we succeeded. If we're at the end of the
244 * pattern but not at the end of the string, we failed.
248 if (*string == 0 && *pattern != '*')
251 * Check for a "*" as the next pattern character. It matches
252 * any substring. We handle this by calling ourselves
253 * recursively for each postfix of string, until either we
254 * match or we reach the end of the string.
256 if (*pattern == '*') {
260 while (*string != 0) {
261 if (Str_Match(string, pattern))
268 * Check for a "?" as the next pattern character. It matches
269 * any single character.
274 * Check for a "[" as the next pattern character. It is
275 * followed by a list of characters that are acceptable, or
276 * by a range (two characters separated by "-").
278 if (*pattern == '[') {
281 if ((*pattern == ']') || (*pattern == 0))
283 if (*pattern == *string)
285 if (pattern[1] == '-') {
289 if ((*pattern <= *string) &&
292 if ((*pattern >= *string) &&
299 while ((*pattern != ']') && (*pattern != 0))
304 * If the next pattern character is '/', just strip off the
305 * '/' so we do exact matching on the character that follows.
307 if (*pattern == '\\') {
313 * There's no special character. Just make sure that the
314 * next characters of each string match.
316 if (*pattern != *string)
318 thisCharOK: ++pattern;
325 *-----------------------------------------------------------------------
327 * Check word against pattern for a match (% is wild),
330 * Returns the beginning position of a match or null. The number
331 * of characters matched is returned in len.
336 *-----------------------------------------------------------------------
339 Str_SYSVMatch(const char *word, const char *pattern, int *len)
341 const char *p = pattern;
342 const char *w = word;
346 /* Zero-length word cannot be matched against */
352 /* Null pattern is the whole string */
357 if ((m = strchr(p, '%')) != NULL) {
358 /* check that the prefix matches */
359 for (; p != m && *w && *w == *p; w++, p++)
363 return (NULL); /* No match */
366 /* No more pattern, return the rest of the string */
374 /* Find a matching tail */
376 if (strcmp(p, w) == 0) {
380 while (*w++ != '\0');
387 *-----------------------------------------------------------------------
389 * Substitute '%' on the pattern with len characters from src.
390 * If the pattern does not contain a '%' prepend len characters
397 * Places result on buf
399 *-----------------------------------------------------------------------
402 Str_SYSVSubst(Buffer buf, const char *pat, const char *src, int len)
406 if ((m = strchr(pat, '%')) != NULL) {
407 /* Copy the prefix */
408 Buf_AddBytes(buf, m - pat, (const Byte *)pat);
413 /* Copy the pattern */
414 Buf_AddBytes(buf, len, (const Byte *)src);
416 /* append the rest */
417 Buf_AddBytes(buf, strlen(pat), (const Byte *)pat);