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_asprintf(const tal_t *ctx, const char *fmt, ...)
49 ret = tal_vasprintf(ctx, fmt, ap);
55 char *tal_vasprintf(const tal_t *ctx, const char *fmt, va_list ap)
61 if (!fmt && taken(fmt))
64 /* A decent guess to start. */
65 max = strlen(fmt) * 2;
66 buf = tal_arr(ctx, char, max);
71 ret = vsnprintf(buf, max, fmt, ap2);
76 if (!tal_resize(&buf, max *= 2))
84 char *tal_strcat(const tal_t *ctx, const char *s1, const char *s2)
89 if (unlikely(!s2) && taken(s2)) {
94 /* We have to let through NULL for take(). */
95 len1 = s1 ? strlen(s1) : 0;
98 /* We use tal_dup_ here to avoid attaching a length property. */
99 ret = tal_dup_(ctx, s1, 1, len1, len2 + 1, false,
100 TAL_LABEL(char, "[]"));
102 memcpy(ret + len1, s2, len2 + 1);
109 char **tal_strsplit(const tal_t *ctx,
110 const char *string, const char *delims, enum strsplit flags)
113 size_t max = 64, num = 0;
115 parts = tal_arr(ctx, char *, max + 1);
116 if (unlikely(!parts)) {
123 str = tal_strdup(parts, string);
126 if (unlikely(!delims) && is_taken(delims))
129 if (flags == STR_NO_EMPTY)
130 str += strspn(str, delims);
132 while (*str != '\0') {
133 size_t len = strcspn(str, delims), dlen;
136 dlen = strspn(str + len, delims);
137 parts[num][len] = '\0';
138 if (flags == STR_EMPTY_OK && dlen)
141 if (++num == max && !tal_resize(&parts, max*=2 + 1))
146 /* Ensure that tal_count() is correct. */
147 if (unlikely(!tal_resize(&parts, num+1)))
161 char *tal_strjoin(const tal_t *ctx,
162 char *strings[], const char *delim, enum strjoin flags)
166 size_t totlen = 0, dlen;
168 if (unlikely(!strings) && is_taken(strings))
171 if (unlikely(!delim) && is_taken(delim))
174 dlen = strlen(delim);
175 ret = tal_arr(ctx, char, dlen*2+1);
180 for (i = 0; strings[i]; i++) {
181 size_t len = strlen(strings[i]);
183 if (flags == STR_NO_TRAIL && !strings[i+1])
185 if (!tal_resize(&ret, totlen + len + dlen + 1))
187 memcpy(ret + totlen, strings[i], len);
189 memcpy(ret + totlen, delim, dlen);
204 bool tal_strreg(const tal_t *ctx, const char *string, const char *regex, ...)
206 size_t nmatch = 1 + strcount(regex, "(");
207 regmatch_t matches[nmatch];
213 if (unlikely(!regex) && is_taken(regex))
216 if (regcomp(&r, regex, REG_EXTENDED) != 0)
219 if (unlikely(!string) && is_taken(string))
222 if (regexec(&r, string, nmatch, matches, 0) != 0)
227 for (i = 1; i < nmatch; i++) {
228 char **arg = va_arg(ap, char **);
230 /* eg. ([a-z])? can give "no match". */
231 if (matches[i].rm_so == -1)
234 *arg = tal_strndup(ctx,
235 string + matches[i].rm_so,
238 /* FIXME: If we fail, we set some and leak! */