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.1 2002/06/17 04:30:48 jmallett Exp $
40 * $DragonFly: src/usr.bin/make/str.c,v 1.2 2003/06/17 04:29:29 dillon Exp $
45 static char **argv, *buffer;
46 static int argmax, curlen;
50 * Initialize the strings package
57 argv = (char **)emalloc(((argmax = 50) + 1) * sizeof(char *));
58 argv[0] = Var_Value(".MAKE", VAR_GLOBAL, &p1);
64 * Cleanup the strings package
81 * concatenate the two strings, inserting a space or slash between them,
82 * freeing them if requested.
85 * the resulting string in allocated space.
88 str_concat(s1, s2, flags)
92 register int len1, len2;
93 register char *result;
95 /* get the length of both strings */
99 /* allocate length plus separator plus EOS */
100 result = emalloc((u_int)(len1 + len2 + 2));
102 /* copy first string into place */
103 memcpy(result, s1, len1);
105 /* add separator character */
106 if (flags & STR_ADDSPACE) {
109 } else if (flags & STR_ADDSLASH) {
114 /* copy second string plus EOS into place */
115 memcpy(result + len1, s2, len2 + 1);
117 /* free original strings */
118 if (flags & STR_DOFREE) {
127 * Fracture a string into an array of words (as delineated by tabs or
128 * spaces) taking quotation marks into account. Leading tabs/spaces
132 * Pointer to the array of pointers to the words. To make life easier,
133 * the first word is always the value of the .MAKE variable.
136 brk_string(str, store_argc, expand)
141 register int argc, ch;
142 register char inquote, *p, *start, *t;
145 /* skip leading space chars. */
146 for (; *str == ' ' || *str == '\t'; ++str)
149 /* allocate room for a copy of the string */
150 if ((len = strlen(str) + 1) > curlen) {
153 buffer = emalloc(curlen = len);
157 * copy the string; at the same time, parse backslashes,
158 * quotes and build the argument list.
162 for (p = str, start = t = buffer;; ++p) {
173 /* Don't miss "" or '' */
174 if (start == NULL && p[1] == inquote) {
195 * end of a token -- make sure there's enough argv
196 * space and save off a pointer.
202 if (argc == argmax) {
203 argmax *= 2; /* ramp up fast */
204 argv = (char **)erealloc(argv,
205 (argmax + 1) * sizeof(char *));
207 argv[argc++] = start;
208 start = (char *)NULL;
209 if (ch == '\n' || ch == '\0')
224 /* hmmm; fix it up as best we can */
250 done: argv[argc] = (char *)NULL;
256 * Str_FindSubstring -- See if a string contains a particular substring.
258 * Results: If string contains substring, the return value is the location of
259 * the first matching instance of substring in string. If string doesn't
260 * contain substring, the return value is NULL. Matching is done on an exact
261 * character-for-character basis with no wildcards or special characters.
263 * Side effects: None.
266 Str_FindSubstring(string, substring)
267 register char *string; /* String to search. */
268 char *substring; /* Substring to find in string */
270 register char *a, *b;
273 * First scan quickly through the two strings looking for a single-
274 * character match. When it's found, then compare the rest of the
278 for (b = substring; *string != 0; string += 1) {
290 return((char *) NULL);
296 * See if a particular string matches a particular pattern.
298 * Results: Non-zero is returned if string matches pattern, 0 otherwise. The
299 * matching operation permits the following special characters in the
300 * pattern: *?\[] (see the man page for details on what these mean).
302 * Side effects: None.
305 Str_Match(string, pattern)
306 register char *string; /* String */
307 register char *pattern; /* Pattern */
313 * See if we're at the end of both the pattern and the
314 * string. If, we succeeded. If we're at the end of the
315 * pattern but not at the end of the string, we failed.
319 if (*string == 0 && *pattern != '*')
322 * Check for a "*" as the next pattern character. It matches
323 * any substring. We handle this by calling ourselves
324 * recursively for each postfix of string, until either we
325 * match or we reach the end of the string.
327 if (*pattern == '*') {
331 while (*string != 0) {
332 if (Str_Match(string, pattern))
339 * Check for a "?" as the next pattern character. It matches
340 * any single character.
345 * Check for a "[" as the next pattern character. It is
346 * followed by a list of characters that are acceptable, or
347 * by a range (two characters separated by "-").
349 if (*pattern == '[') {
352 if ((*pattern == ']') || (*pattern == 0))
354 if (*pattern == *string)
356 if (pattern[1] == '-') {
360 if ((*pattern <= *string) &&
363 if ((*pattern >= *string) &&
370 while ((*pattern != ']') && (*pattern != 0))
375 * If the next pattern character is '/', just strip off the
376 * '/' so we do exact matching on the character that follows.
378 if (*pattern == '\\') {
384 * There's no special character. Just make sure that the
385 * next characters of each string match.
387 if (*pattern != *string)
389 thisCharOK: ++pattern;
396 *-----------------------------------------------------------------------
398 * Check word against pattern for a match (% is wild),
401 * Returns the beginning position of a match or null. The number
402 * of characters matched is returned in len.
407 *-----------------------------------------------------------------------
410 Str_SYSVMatch(word, pattern, len)
411 char *word; /* Word to examine */
412 char *pattern; /* Pattern to examine against */
413 int *len; /* Number of characters to substitute */
420 /* Zero-length word cannot be matched against */
426 /* Null pattern is the whole string */
431 if ((m = strchr(p, '%')) != NULL) {
432 /* check that the prefix matches */
433 for (; p != m && *w && *w == *p; w++, p++)
437 return NULL; /* No match */
440 /* No more pattern, return the rest of the string */
448 /* Find a matching tail */
450 if (strcmp(p, w) == 0) {
454 while (*w++ != '\0');
461 *-----------------------------------------------------------------------
463 * Substitute '%' on the pattern with len characters from src.
464 * If the pattern does not contain a '%' prepend len characters
471 * Places result on buf
473 *-----------------------------------------------------------------------
476 Str_SYSVSubst(buf, pat, src, len)
484 if ((m = strchr(pat, '%')) != NULL) {
485 /* Copy the prefix */
486 Buf_AddBytes(buf, m - pat, (Byte *) pat);
491 /* Copy the pattern */
492 Buf_AddBytes(buf, len, (Byte *) src);
494 /* append the rest */
495 Buf_AddBytes(buf, strlen(pat), (Byte *) pat);