str.h revision 1.3 1 1.3 rillig /* $NetBSD: str.h,v 1.3 2021/04/11 19:05:06 rillig Exp $ */
2 1.1 rillig
3 1.1 rillig /*
4 1.1 rillig Copyright (c) 2021 Roland Illig <rillig (at) NetBSD.org>
5 1.1 rillig All rights reserved.
6 1.1 rillig
7 1.1 rillig Redistribution and use in source and binary forms, with or without
8 1.1 rillig modification, are permitted provided that the following conditions
9 1.1 rillig are met:
10 1.1 rillig
11 1.1 rillig 1. Redistributions of source code must retain the above copyright
12 1.1 rillig notice, this list of conditions and the following disclaimer.
13 1.1 rillig 2. Redistributions in binary form must reproduce the above copyright
14 1.1 rillig notice, this list of conditions and the following disclaimer in the
15 1.1 rillig documentation and/or other materials provided with the distribution.
16 1.1 rillig
17 1.1 rillig THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 1.1 rillig "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
19 1.1 rillig TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 1.1 rillig PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
21 1.1 rillig BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 1.1 rillig CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 1.1 rillig SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 1.1 rillig INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 1.1 rillig CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 1.1 rillig ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27 1.1 rillig POSSIBILITY OF SUCH DAMAGE.
28 1.1 rillig */
29 1.1 rillig
30 1.1 rillig
31 1.1 rillig /*
32 1.1 rillig * Memory-efficient string handling.
33 1.1 rillig */
34 1.1 rillig
35 1.1 rillig
36 1.1 rillig /* A read-only string that may need to be freed after use. */
37 1.1 rillig typedef struct FStr {
38 1.1 rillig const char *str;
39 1.1 rillig void *freeIt;
40 1.1 rillig } FStr;
41 1.1 rillig
42 1.1 rillig /* A modifiable string that may need to be freed after use. */
43 1.1 rillig typedef struct MFStr {
44 1.1 rillig char *str;
45 1.1 rillig void *freeIt;
46 1.1 rillig } MFStr;
47 1.1 rillig
48 1.1 rillig /* A read-only range of a character array, NOT null-terminated. */
49 1.1 rillig typedef struct {
50 1.1 rillig const char *start;
51 1.1 rillig const char *end;
52 1.1 rillig } Substring;
53 1.1 rillig
54 1.1 rillig /*
55 1.1 rillig * Builds a string, only allocating memory if the string is different from the
56 1.1 rillig * expected string.
57 1.1 rillig */
58 1.1 rillig typedef struct LazyBuf {
59 1.1 rillig char *data;
60 1.1 rillig size_t len;
61 1.1 rillig size_t cap;
62 1.1 rillig Substring expected;
63 1.1 rillig void *freeIt;
64 1.1 rillig } LazyBuf;
65 1.1 rillig
66 1.1 rillig /* The result of splitting a string into words. */
67 1.1 rillig typedef struct Words {
68 1.1 rillig char **words;
69 1.1 rillig size_t len;
70 1.1 rillig void *freeIt;
71 1.1 rillig } Words;
72 1.1 rillig
73 1.3 rillig /* The result of splitting a string into words. */
74 1.3 rillig typedef struct SubstringWords {
75 1.3 rillig Substring *words;
76 1.3 rillig size_t len;
77 1.3 rillig void *freeIt;
78 1.3 rillig } SubstringWords;
79 1.3 rillig
80 1.1 rillig
81 1.1 rillig MAKE_INLINE FStr
82 1.1 rillig FStr_Init(const char *str, void *freeIt)
83 1.1 rillig {
84 1.1 rillig FStr fstr;
85 1.1 rillig fstr.str = str;
86 1.1 rillig fstr.freeIt = freeIt;
87 1.1 rillig return fstr;
88 1.1 rillig }
89 1.1 rillig
90 1.1 rillig /* Return a string that is the sole owner of str. */
91 1.1 rillig MAKE_INLINE FStr
92 1.1 rillig FStr_InitOwn(char *str)
93 1.1 rillig {
94 1.1 rillig return FStr_Init(str, str);
95 1.1 rillig }
96 1.1 rillig
97 1.1 rillig /* Return a string that refers to the shared str. */
98 1.1 rillig MAKE_INLINE FStr
99 1.1 rillig FStr_InitRefer(const char *str)
100 1.1 rillig {
101 1.1 rillig return FStr_Init(str, NULL);
102 1.1 rillig }
103 1.1 rillig
104 1.1 rillig MAKE_INLINE void
105 1.1 rillig FStr_Done(FStr *fstr)
106 1.1 rillig {
107 1.1 rillig free(fstr->freeIt);
108 1.1 rillig #ifdef CLEANUP
109 1.1 rillig fstr->str = NULL;
110 1.1 rillig fstr->freeIt = NULL;
111 1.1 rillig #endif
112 1.1 rillig }
113 1.1 rillig
114 1.1 rillig
115 1.1 rillig MAKE_INLINE MFStr
116 1.1 rillig MFStr_Init(char *str, void *freeIt)
117 1.1 rillig {
118 1.1 rillig MFStr mfstr;
119 1.1 rillig mfstr.str = str;
120 1.1 rillig mfstr.freeIt = freeIt;
121 1.1 rillig return mfstr;
122 1.1 rillig }
123 1.1 rillig
124 1.1 rillig /* Return a string that is the sole owner of str. */
125 1.1 rillig MAKE_INLINE MFStr
126 1.1 rillig MFStr_InitOwn(char *str)
127 1.1 rillig {
128 1.1 rillig return MFStr_Init(str, str);
129 1.1 rillig }
130 1.1 rillig
131 1.1 rillig /* Return a string that refers to the shared str. */
132 1.1 rillig MAKE_INLINE MFStr
133 1.1 rillig MFStr_InitRefer(char *str)
134 1.1 rillig {
135 1.1 rillig return MFStr_Init(str, NULL);
136 1.1 rillig }
137 1.1 rillig
138 1.1 rillig MAKE_INLINE void
139 1.1 rillig MFStr_Done(MFStr *mfstr)
140 1.1 rillig {
141 1.1 rillig free(mfstr->freeIt);
142 1.1 rillig #ifdef CLEANUP
143 1.1 rillig mfstr->str = NULL;
144 1.1 rillig mfstr->freeIt = NULL;
145 1.1 rillig #endif
146 1.1 rillig }
147 1.1 rillig
148 1.1 rillig
149 1.1 rillig MAKE_INLINE Substring
150 1.1 rillig Substring_Init(const char *start, const char *end)
151 1.1 rillig {
152 1.1 rillig Substring sub;
153 1.1 rillig
154 1.1 rillig sub.start = start;
155 1.1 rillig sub.end = end;
156 1.1 rillig return sub;
157 1.1 rillig }
158 1.1 rillig
159 1.1 rillig MAKE_INLINE Substring
160 1.1 rillig Substring_InitStr(const char *str)
161 1.1 rillig {
162 1.1 rillig return Substring_Init(str, str + strlen(str));
163 1.1 rillig }
164 1.1 rillig
165 1.1 rillig MAKE_INLINE size_t
166 1.1 rillig Substring_Length(Substring sub)
167 1.1 rillig {
168 1.1 rillig return (size_t)(sub.end - sub.start);
169 1.1 rillig }
170 1.1 rillig
171 1.1 rillig MAKE_INLINE bool
172 1.2 rillig Substring_IsEmpty(Substring sub)
173 1.2 rillig {
174 1.2 rillig return sub.start == sub.end;
175 1.2 rillig }
176 1.2 rillig
177 1.2 rillig MAKE_INLINE bool
178 1.1 rillig Substring_Equals(Substring sub, const char *str)
179 1.1 rillig {
180 1.1 rillig size_t len = strlen(str);
181 1.1 rillig return Substring_Length(sub) == len &&
182 1.1 rillig memcmp(sub.start, str, len) == 0;
183 1.1 rillig }
184 1.1 rillig
185 1.1 rillig MAKE_INLINE Substring
186 1.1 rillig Substring_Sub(Substring sub, size_t start, size_t end)
187 1.1 rillig {
188 1.1 rillig assert(start <= Substring_Length(sub));
189 1.1 rillig assert(end <= Substring_Length(sub));
190 1.1 rillig return Substring_Init(sub.start + start, sub.start + end);
191 1.1 rillig }
192 1.1 rillig
193 1.1 rillig MAKE_INLINE FStr
194 1.1 rillig Substring_Str(Substring sub)
195 1.1 rillig {
196 1.1 rillig return FStr_InitOwn(bmake_strsedup(sub.start, sub.end));
197 1.1 rillig }
198 1.1 rillig
199 1.2 rillig MAKE_INLINE const char *
200 1.2 rillig Substring_LastIndex(Substring sub, char ch)
201 1.2 rillig {
202 1.2 rillig const char *p;
203 1.2 rillig
204 1.2 rillig for (p = sub.end; p != sub.start; p--)
205 1.2 rillig if (p[-1] == ch)
206 1.2 rillig return p - 1;
207 1.2 rillig return NULL;
208 1.2 rillig }
209 1.2 rillig
210 1.2 rillig MAKE_INLINE Substring
211 1.2 rillig Substring_Dirname(Substring pathname)
212 1.2 rillig {
213 1.2 rillig const char *p;
214 1.2 rillig
215 1.2 rillig for (p = pathname.end; p != pathname.start; p--)
216 1.2 rillig if (p[-1] == '/')
217 1.2 rillig return Substring_Init(pathname.start, p - 1);
218 1.2 rillig return Substring_InitStr(".");
219 1.2 rillig }
220 1.2 rillig
221 1.2 rillig MAKE_INLINE Substring
222 1.2 rillig Substring_Basename(Substring pathname)
223 1.2 rillig {
224 1.2 rillig const char *p;
225 1.2 rillig
226 1.2 rillig for (p = pathname.end; p != pathname.start; p--)
227 1.2 rillig if (p[-1] == '/')
228 1.2 rillig return Substring_Init(p, pathname.end);
229 1.2 rillig return pathname;
230 1.2 rillig }
231 1.2 rillig
232 1.1 rillig
233 1.1 rillig MAKE_INLINE void
234 1.1 rillig LazyBuf_Init(LazyBuf *buf, Substring expected)
235 1.1 rillig {
236 1.1 rillig buf->data = NULL;
237 1.1 rillig buf->len = 0;
238 1.1 rillig buf->cap = 0;
239 1.1 rillig buf->expected = expected;
240 1.1 rillig buf->freeIt = NULL;
241 1.1 rillig }
242 1.1 rillig
243 1.1 rillig MAKE_INLINE void
244 1.1 rillig LazyBuf_Done(LazyBuf *buf)
245 1.1 rillig {
246 1.1 rillig free(buf->freeIt);
247 1.1 rillig }
248 1.1 rillig
249 1.1 rillig MAKE_INLINE void
250 1.1 rillig LazyBuf_Add(LazyBuf *buf, char ch)
251 1.1 rillig {
252 1.1 rillig
253 1.1 rillig if (buf->data != NULL) {
254 1.1 rillig if (buf->len == buf->cap) {
255 1.1 rillig buf->cap *= 2;
256 1.1 rillig buf->data = bmake_realloc(buf->data, buf->cap);
257 1.1 rillig }
258 1.1 rillig buf->data[buf->len++] = ch;
259 1.1 rillig
260 1.1 rillig } else if (buf->len < Substring_Length(buf->expected) &&
261 1.1 rillig ch == buf->expected.start[buf->len]) {
262 1.1 rillig buf->len++;
263 1.1 rillig return;
264 1.1 rillig
265 1.1 rillig } else {
266 1.1 rillig buf->cap = buf->len + 16;
267 1.1 rillig buf->data = bmake_malloc(buf->cap);
268 1.1 rillig memcpy(buf->data, buf->expected.start, buf->len);
269 1.1 rillig buf->data[buf->len++] = ch;
270 1.1 rillig }
271 1.1 rillig }
272 1.1 rillig
273 1.1 rillig MAKE_INLINE void
274 1.1 rillig LazyBuf_AddStr(LazyBuf *buf, const char *str)
275 1.1 rillig {
276 1.1 rillig const char *p;
277 1.1 rillig
278 1.1 rillig for (p = str; *p != '\0'; p++)
279 1.1 rillig LazyBuf_Add(buf, *p);
280 1.1 rillig }
281 1.1 rillig
282 1.1 rillig MAKE_INLINE Substring
283 1.1 rillig LazyBuf_Get(const LazyBuf *buf)
284 1.1 rillig {
285 1.1 rillig const char *start = buf->data != NULL
286 1.1 rillig ? buf->data : buf->expected.start;
287 1.1 rillig return Substring_Init(start, start + buf->len);
288 1.1 rillig }
289 1.1 rillig
290 1.1 rillig MAKE_INLINE FStr
291 1.1 rillig LazyBuf_DoneGet(LazyBuf *buf)
292 1.1 rillig {
293 1.1 rillig if (buf->data != NULL) {
294 1.1 rillig LazyBuf_Add(buf, '\0');
295 1.1 rillig return FStr_InitOwn(buf->data);
296 1.1 rillig }
297 1.1 rillig return Substring_Str(LazyBuf_Get(buf));
298 1.1 rillig }
299 1.1 rillig
300 1.1 rillig
301 1.1 rillig Words Str_Words(const char *, bool);
302 1.1 rillig
303 1.1 rillig MAKE_INLINE void
304 1.1 rillig Words_Free(Words w)
305 1.1 rillig {
306 1.1 rillig free(w.words);
307 1.1 rillig free(w.freeIt);
308 1.1 rillig }
309 1.1 rillig
310 1.1 rillig
311 1.3 rillig SubstringWords Substring_Words(const char *, bool);
312 1.3 rillig
313 1.3 rillig MAKE_INLINE void
314 1.3 rillig SubstringWords_Free(SubstringWords w)
315 1.3 rillig {
316 1.3 rillig free(w.words);
317 1.3 rillig free(w.freeIt);
318 1.3 rillig }
319 1.3 rillig
320 1.3 rillig
321 1.1 rillig char *str_concat2(const char *, const char *);
322 1.1 rillig char *str_concat3(const char *, const char *, const char *);
323 1.1 rillig char *str_concat4(const char *, const char *, const char *, const char *);
324 1.1 rillig
325 1.1 rillig bool Str_Match(const char *, const char *);
326