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.40 2005/02/07 07:54:23 harti Exp $
40 * $DragonFly: src/usr.bin/make/str.c,v 1.29 2005/05/05 09:07:51 okumoto Exp $
59 * Initialize the strings package
67 argv = emalloc((argmax + 1) * sizeof(char *));
73 * concatenate the two strings, inserting a space or slash between them.
76 * the resulting string in allocated space.
79 str_concat(const char *s1, const char *s2, int flags)
84 /* get the length of both strings */
88 /* allocate length plus separator plus EOS */
89 result = emalloc(len1 + len2 + 2);
91 /* copy first string into place */
92 memcpy(result, s1, len1);
94 /* add separator character */
95 if (flags & STR_ADDSPACE) {
98 } else if (flags & STR_ADDSLASH) {
103 /* copy second string plus EOS into place */
104 memcpy(result + len1, s2, len2 + 1);
111 * Fracture a string into an array of words (as delineated by tabs or
112 * spaces) taking quotation marks into account. Leading tabs/spaces
116 * Pointer to the array of pointers to the words.
119 brk_string(const char *str, int *store_argc, Boolean expand)
127 /* skip leading space chars. */
128 for (; *str == ' ' || *str == '\t'; ++str)
131 /* allocate room for a copy of the string */
132 if ((len = strlen(str) + 1) > curlen) {
135 buffer = emalloc(curlen = len);
144 * copy the string; at the same time, parse backslashes,
145 * quotes and build the argument list.
151 if (inquote == '\0') {
157 } else if (inquote == str[0]) {
159 /* Don't miss "" or '' */
165 /* other type of quote found */
185 * end of a token -- make sure there's enough argv
186 * space and save off a pointer.
188 if (argc == argmax) {
189 argmax *= 2; /* ramp up fast */
190 argv = erealloc(argv,
191 (argmax + 1) * sizeof(char *));
197 if (store_argc != NULL)
201 if (str[0] == '\n' || str[0] == '\0') {
202 argv[argc++] = start;
204 if (store_argc != NULL)
208 argv[argc++] = start;
219 /* hmmm; fix it up as best we can */
264 * Quote a string for appending it to MAKEFLAGS. According to Posix the
265 * kind of quoting here is implementation-defined. This quoting must ensure
266 * that the parsing of MAKEFLAGS's contents in a sub-shell yields the same
267 * options, option arguments and macro definitions as in the calling make.
268 * We simply quote all blanks, which according to Posix are space and tab
269 * in the POSIX locale. Don't use isblank because in that case makes with
270 * different locale settings could not communicate. We must also quote
271 * backslashes obviously.
274 MAKEFLAGS_quote(const char *str)
279 /* assume worst case - everything has to be quoted */
280 ret = emalloc(strlen(str) * 2 + 1);
302 MAKEFLAGS_break(const char *str, int *pargc)
307 /* allocate room for a copy of the string */
308 if ((len = strlen(str) + 1) > curlen)
309 buffer = erealloc(buffer, curlen = len);
331 if (argmax == *pargc) {
333 argv = erealloc(argv,
334 sizeof(*argv) * (argmax + 1));
336 argv[(*pargc)++] = start;
344 if (str[1] == ' ' || str[1] == '\t')
353 /* start of new word */
358 argv[(*pargc)] = NULL;
365 * See if a particular string matches a particular pattern.
367 * Results: Non-zero is returned if string matches pattern, 0 otherwise. The
368 * matching operation permits the following special characters in the
369 * pattern: *?\[] (see the man page for details on what these mean).
371 * Side effects: None.
374 Str_Match(const char *string, const char *pattern)
380 * See if we're at the end of both the pattern and the
381 * string. If, we succeeded. If we're at the end of the
382 * pattern but not at the end of the string, we failed.
386 if (*string == 0 && *pattern != '*')
389 * Check for a "*" as the next pattern character. It matches
390 * any substring. We handle this by calling ourselves
391 * recursively for each postfix of string, until either we
392 * match or we reach the end of the string.
394 if (*pattern == '*') {
398 while (*string != 0) {
399 if (Str_Match(string, pattern))
406 * Check for a "?" as the next pattern character. It matches
407 * any single character.
412 * Check for a "[" as the next pattern character. It is
413 * followed by a list of characters that are acceptable, or
414 * by a range (two characters separated by "-").
416 if (*pattern == '[') {
419 if ((*pattern == ']') || (*pattern == 0))
421 if (*pattern == *string)
423 if (pattern[1] == '-') {
427 if ((*pattern <= *string) &&
430 if ((*pattern >= *string) &&
437 while ((*pattern != ']') && (*pattern != 0))
442 * If the next pattern character is '/', just strip off the
443 * '/' so we do exact matching on the character that follows.
445 if (*pattern == '\\') {
451 * There's no special character. Just make sure that the
452 * next characters of each string match.
454 if (*pattern != *string)
456 thisCharOK: ++pattern;
464 * Check word against pattern for a match (% is wild),
467 * Returns the beginning position of a match or null. The number
468 * of characters matched is returned in len.
471 Str_SYSVMatch(const char *word, const char *pattern, int *len)
473 const char *m, *p, *w;
479 /* Zero-length word cannot be matched against */
485 /* Null pattern is the whole string */
490 if ((m = strchr(p, '%')) != NULL) {
491 /* check that the prefix matches */
492 for (; p != m && *w && *w == *p; w++, p++)
496 return (NULL); /* No match */
499 /* No more pattern, return the rest of the string */
507 /* Find a matching tail */
509 if (strcmp(p, w) == 0) {
513 while (*w++ != '\0');
521 * Substitute '%' on the pattern with len characters from src.
522 * If the pattern does not contain a '%' prepend len characters
526 * Places result on buf
529 Str_SYSVSubst(Buffer *buf, const char *pat, const char *src, int len)
533 if ((m = strchr(pat, '%')) != NULL) {
534 /* Copy the prefix */
535 Buf_AppendRange(buf, pat, m);
540 /* Copy the pattern */
541 Buf_AddBytes(buf, len, (const Byte *)src);
543 /* append the rest */
544 Buf_Append(buf, pat);