1 /* $NetBSD: str.c,v 1.70 2020/10/24 20:51:49 rillig Exp $ */
4 * Copyright (c) 1988, 1989, 1990, 1993
5 * The Regents of the University of California. All rights reserved.
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. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * Copyright (c) 1989 by Berkeley Softworks
37 * All rights reserved.
39 * This code is derived from software contributed to Berkeley by
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by the University of
53 * California, Berkeley and its contributors.
54 * 4. Neither the name of the University nor the names of its contributors
55 * may be used to endorse or promote products derived from this software
56 * without specific prior written permission.
58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
73 /* "@(#)str.c 5.8 (Berkeley) 6/1/90" */
74 MAKE_RCSID("$NetBSD: str.c,v 1.70 2020/10/24 20:51:49 rillig Exp $");
76 /* Return the concatenation of s1 and s2, freshly allocated. */
78 str_concat2(const char *s1, const char *s2)
80 size_t len1 = strlen(s1);
81 size_t len2 = strlen(s2);
82 char *result = bmake_malloc(len1 + len2 + 1);
83 memcpy(result, s1, len1);
84 memcpy(result + len1, s2, len2 + 1);
88 /* Return the concatenation of s1, s2 and s3, freshly allocated. */
90 str_concat3(const char *s1, const char *s2, const char *s3)
92 size_t len1 = strlen(s1);
93 size_t len2 = strlen(s2);
94 size_t len3 = strlen(s3);
95 char *result = bmake_malloc(len1 + len2 + len3 + 1);
96 memcpy(result, s1, len1);
97 memcpy(result + len1, s2, len2);
98 memcpy(result + len1 + len2, s3, len3 + 1);
102 /* Return the concatenation of s1, s2, s3 and s4, freshly allocated. */
104 str_concat4(const char *s1, const char *s2, const char *s3, const char *s4)
106 size_t len1 = strlen(s1);
107 size_t len2 = strlen(s2);
108 size_t len3 = strlen(s3);
109 size_t len4 = strlen(s4);
110 char *result = bmake_malloc(len1 + len2 + len3 + len4 + 1);
111 memcpy(result, s1, len1);
112 memcpy(result + len1, s2, len2);
113 memcpy(result + len1 + len2, s3, len3);
114 memcpy(result + len1 + len2 + len3, s4, len4 + 1);
118 /* Fracture a string into an array of words (as delineated by tabs or spaces)
119 * taking quotation marks into account. Leading tabs/spaces are ignored.
121 * If expand is TRUE, quotes are removed and escape sequences such as \r, \t,
122 * etc... are expanded. In this case, the return value is NULL on parse
125 * Returns the fractured words, which must be freed later using Words_Free.
126 * If expand was TRUE and there was a parse error, words is NULL, and in that
127 * case, nothing needs to be freed.
130 Str_Words(const char *str, Boolean expand)
142 /* skip leading space chars. */
143 for (; *str == ' ' || *str == '\t'; ++str)
146 /* words_buf holds the words, separated by '\0'. */
147 str_len = strlen(str);
148 words_buf = bmake_malloc(strlen(str) + 1);
150 words_cap = str_len / 5 > 50 ? str_len / 5 : 50;
151 words = bmake_malloc((words_cap + 1) * sizeof(char *));
154 * copy the string; at the same time, parse backslashes,
155 * quotes and build the word list.
159 word_start = words_buf;
160 word_end = words_buf;
161 for (str_p = str;; ++str_p) {
173 /* Don't miss "" or '' */
174 if (word_start == NULL && str_p[1] == inquote) {
176 word_start = word_end;
179 word_start = word_end + 1;
186 if (word_start == NULL)
187 word_start = word_end;
196 if (word_start == NULL)
201 * end of a token -- make sure there's enough words
202 * space and save off a pointer.
204 if (word_start == NULL)
208 if (words_len == words_cap) {
210 words_cap *= 2; /* ramp up fast */
211 new_size = (words_cap + 1) * sizeof(char *);
212 words = bmake_realloc(words, new_size);
214 words[words_len++] = word_start;
216 if (ch == '\n' || ch == '\0') {
217 if (expand && inquote) {
220 return (Words){ NULL, 0, NULL };
227 if (word_start == NULL)
228 word_start = word_end;
230 /* catch '\' at end of line */
231 if (str_p[1] == '\0')
237 switch (ch = *++str_p) {
240 /* hmmm; fix it up as best we can */
262 if (word_start == NULL)
263 word_start = word_end;
267 words[words_len] = NULL;
268 return (Words){ words, words_len, words_buf };
272 * Str_Match -- Test if a string matches a pattern like "*.[ch]".
274 * XXX this function does not detect or report malformed patterns.
277 * Non-zero is returned if string matches the pattern, 0 otherwise. The
278 * matching operation permits the following special characters in the
279 * pattern: *?\[] (as in fnmatch(3)).
281 * Side effects: None.
284 Str_Match(const char *str, const char *pat)
288 * See if we're at the end of both the pattern and the
289 * string. If, we succeeded. If we're at the end of the
290 * pattern but not at the end of the string, we failed.
294 if (*str == 0 && *pat != '*')
298 * A '*' in the pattern matches any substring. We handle this
299 * by calling ourselves for each suffix of the string.
308 if (Str_Match(str, pat))
315 /* A '?' in the pattern matches any single character. */
320 * A '[' in the pattern matches a character from a list.
321 * The '[' is followed by the list of acceptable characters,
322 * or by ranges (two characters separated by '-'). In these
323 * character lists, the backslash is an ordinary character.
326 Boolean neg = pat[1] == '^';
330 if (*pat == ']' || *pat == 0) {
340 if (*pat <= *str && pat[2] >= *str)
342 if (*pat >= *str && pat[2] <= *str)
348 if (neg && *pat != ']' && *pat != 0)
350 while (*pat != ']' && *pat != 0)
358 * A backslash in the pattern matches the character following