1 /* Licensed under BSD-MIT - see LICENSE file for details */
13 #include <ccan/str/str.h>
14 #include <ccan/take/take.h>
16 char *tal_strdup(const tal_t *ctx, const char *p)
18 /* We have to let through NULL for take(). */
19 return tal_dup_(ctx, p, 1, p ? strlen(p) + 1: 1, 0, false,
20 TAL_LABEL(char, "[]"));
23 char *tal_strndup(const tal_t *ctx, const char *p, size_t n)
28 /* We have to let through NULL for take(). */
36 ret = tal_dup_(ctx, p, 1, len, 1, false, TAL_LABEL(char, "[]"));
42 char *tal_fmt(const tal_t *ctx, const char *fmt, ...)
48 ret = tal_vfmt(ctx, fmt, ap);
54 static bool do_vfmt(char **buf, size_t off, const char *fmt, va_list ap)
56 /* A decent guess to start. */
57 size_t max = strlen(fmt) * 2;
64 if (!tal_resize(buf, off + max)) {
70 ret = vsnprintf(*buf + off, max, fmt, ap2);
85 char *tal_vfmt(const tal_t *ctx, const char *fmt, va_list ap)
89 if (!fmt && taken(fmt))
92 /* A decent guess to start. */
93 buf = tal_arr(ctx, char, strlen(fmt) * 2);
94 if (!do_vfmt(&buf, 0, fmt, ap))
99 bool tal_append_vfmt(char **baseptr, const char *fmt, va_list ap)
101 if (!fmt && taken(fmt))
104 return do_vfmt(baseptr, strlen(*baseptr), fmt, ap);
107 bool tal_append_fmt(char **baseptr, const char *fmt, ...)
113 ret = tal_append_vfmt(baseptr, fmt, ap);
119 char *tal_strcat(const tal_t *ctx, const char *s1, const char *s2)
124 if (unlikely(!s2) && taken(s2)) {
129 /* We have to let through NULL for take(). */
130 len1 = s1 ? strlen(s1) : 0;
133 /* We use tal_dup_ here to avoid attaching a length property. */
134 ret = tal_dup_(ctx, s1, 1, len1, len2 + 1, false,
135 TAL_LABEL(char, "[]"));
137 memcpy(ret + len1, s2, len2 + 1);
144 char **tal_strsplit(const tal_t *ctx,
145 const char *string, const char *delims, enum strsplit flags)
148 size_t max = 64, num = 0;
150 parts = tal_arr(ctx, char *, max + 1);
151 if (unlikely(!parts)) {
158 str = tal_strdup(parts, string);
161 if (unlikely(!delims) && is_taken(delims))
164 if (flags == STR_NO_EMPTY)
165 str += strspn(str, delims);
167 while (*str != '\0') {
168 size_t len = strcspn(str, delims), dlen;
171 dlen = strspn(str + len, delims);
172 parts[num][len] = '\0';
173 if (flags == STR_EMPTY_OK && dlen)
176 if (++num == max && !tal_resize(&parts, max*=2 + 1))
181 /* Ensure that tal_count() is correct. */
182 if (unlikely(!tal_resize(&parts, num+1)))
196 char *tal_strjoin(const tal_t *ctx,
197 char *strings[], const char *delim, enum strjoin flags)
201 size_t totlen = 0, dlen;
203 if (unlikely(!strings) && is_taken(strings))
206 if (unlikely(!delim) && is_taken(delim))
209 dlen = strlen(delim);
210 ret = tal_arr(ctx, char, dlen*2+1);
215 for (i = 0; strings[i]; i++) {
216 size_t len = strlen(strings[i]);
218 if (flags == STR_NO_TRAIL && !strings[i+1])
220 if (!tal_resize(&ret, totlen + len + dlen + 1))
222 memcpy(ret + totlen, strings[i], len);
224 memcpy(ret + totlen, delim, dlen);
239 bool tal_strreg(const tal_t *ctx, const char *string, const char *regex, ...)
241 size_t nmatch = 1 + strcount(regex, "(");
242 regmatch_t matches[nmatch];
248 if (unlikely(!regex) && is_taken(regex))
251 if (regcomp(&r, regex, REG_EXTENDED) != 0)
254 if (unlikely(!string) && is_taken(string))
257 if (regexec(&r, string, nmatch, matches, 0) != 0)
262 for (i = 1; i < nmatch; i++) {
263 char **arg = va_arg(ap, char **);
265 /* eg. ([a-z])? can give "no match". */
266 if (matches[i].rm_so == -1)
269 *arg = tal_strndup(ctx,
270 string + matches[i].rm_so,
273 /* FIXME: If we fail, we set some and leak! */