1 /* Licensed under BSD-MIT - see LICENSE file for details */
13 #include <ccan/str/str.h>
14 #include <ccan/tal/tal.h>
15 #include <ccan/take/take.h>
17 char *tal_strdup(const tal_t *ctx, const char *p)
19 /* We have to let through NULL for take(). */
20 return tal_dup_(ctx, p, 1, p ? strlen(p) + 1: 1, 0, false,
21 TAL_LABEL(char, "[]"));
24 char *tal_strndup(const tal_t *ctx, const char *p, size_t n)
29 /* We have to let through NULL for take(). */
37 ret = tal_dup_(ctx, p, 1, len, 1, false, TAL_LABEL(char, "[]"));
43 char *tal_fmt(const tal_t *ctx, const char *fmt, ...)
49 ret = tal_vfmt(ctx, fmt, ap);
55 static bool do_vfmt(char **buf, size_t off, const char *fmt, va_list ap)
57 /* A decent guess to start. */
58 size_t max = strlen(fmt) * 2;
65 if (!tal_resize(buf, off + max)) {
71 ret = vsnprintf(*buf + off, max, fmt, ap2);
86 char *tal_vfmt(const tal_t *ctx, const char *fmt, va_list ap)
90 if (!fmt && taken(fmt))
93 /* A decent guess to start. */
94 buf = tal_arr(ctx, char, strlen(fmt) * 2);
95 if (!do_vfmt(&buf, 0, fmt, ap))
100 bool tal_append_vfmt(char **baseptr, const char *fmt, va_list ap)
102 if (!fmt && taken(fmt))
105 return do_vfmt(baseptr, strlen(*baseptr), fmt, ap);
108 bool tal_append_fmt(char **baseptr, const char *fmt, ...)
114 ret = tal_append_vfmt(baseptr, fmt, ap);
120 char *tal_strcat(const tal_t *ctx, const char *s1, const char *s2)
125 if (unlikely(!s2) && taken(s2)) {
130 /* We have to let through NULL for take(). */
131 len1 = s1 ? strlen(s1) : 0;
134 /* We use tal_dup_ here to avoid attaching a length property. */
135 ret = tal_dup_(ctx, s1, 1, len1, len2 + 1, false,
136 TAL_LABEL(char, "[]"));
138 memcpy(ret + len1, s2, len2 + 1);
145 char **tal_strsplit(const tal_t *ctx,
146 const char *string, const char *delims, enum strsplit flags)
149 size_t max = 64, num = 0;
151 parts = tal_arr(ctx, char *, max + 1);
152 if (unlikely(!parts)) {
159 str = tal_strdup(parts, string);
162 if (unlikely(!delims) && is_taken(delims))
165 if (flags == STR_NO_EMPTY)
166 str += strspn(str, delims);
168 while (*str != '\0') {
169 size_t len = strcspn(str, delims), dlen;
172 dlen = strspn(str + len, delims);
173 parts[num][len] = '\0';
174 if (flags == STR_EMPTY_OK && dlen)
177 if (++num == max && !tal_resize(&parts, max*=2 + 1))
182 /* Ensure that tal_count() is correct. */
183 if (unlikely(!tal_resize(&parts, num+1)))
197 char *tal_strjoin(const tal_t *ctx,
198 char *strings[], const char *delim, enum strjoin flags)
202 size_t totlen = 0, dlen;
204 if (unlikely(!strings) && is_taken(strings))
207 if (unlikely(!delim) && is_taken(delim))
210 dlen = strlen(delim);
211 ret = tal_arr(ctx, char, dlen*2+1);
216 for (i = 0; strings[i]; i++) {
217 size_t len = strlen(strings[i]);
219 if (flags == STR_NO_TRAIL && !strings[i+1])
221 if (!tal_resize(&ret, totlen + len + dlen + 1))
223 memcpy(ret + totlen, strings[i], len);
225 memcpy(ret + totlen, delim, dlen);
240 bool tal_strreg(const tal_t *ctx, const char *string, const char *regex, ...)
242 size_t nmatch = 1 + strcount(regex, "(");
243 regmatch_t matches[nmatch];
249 if (unlikely(!regex) && is_taken(regex))
252 if (regcomp(&r, regex, REG_EXTENDED) != 0)
255 if (unlikely(!string) && is_taken(string))
258 if (regexec(&r, string, nmatch, matches, 0) != 0)
263 for (i = 1; i < nmatch; i++) {
264 char **arg = va_arg(ap, char **);
266 /* eg. ([a-z])? can give "no match". */
267 if (matches[i].rm_so == -1)
270 *arg = tal_strndup(ctx,
271 string + matches[i].rm_so,
274 /* FIXME: If we fail, we set some and leak! */