1 /* Licensed under BSD-MIT - see LICENSE file for details */
13 #include <ccan/str/str.h>
15 char *tal_strdup_(const tal_t *ctx, const char *p, const char *label)
17 /* We have to let through NULL for take(). */
18 return tal_dup_arr_label(ctx, char, p, p ? strlen(p) + 1: 1, 0, label);
21 char *tal_strndup_(const tal_t *ctx, const char *p, size_t n, const char *label)
26 /* We have to let through NULL for take(). */
32 ret = tal_dup_arr_label(ctx, char, p, len, 1, label);
38 char *tal_fmt_(const tal_t *ctx, const char *label, const char *fmt, ...)
44 ret = tal_vfmt_(ctx, fmt, ap, label);
50 static bool do_vfmt(char **buf, size_t off, const char *fmt, va_list ap)
52 /* A decent guess to start. */
53 size_t max = strlen(fmt) * 2 + 1;
60 if (!tal_resize(buf, off + max)) {
66 ret = vsnprintf(*buf + off, max, fmt, ap2);
81 char *tal_vfmt_(const tal_t *ctx, const char *fmt, va_list ap, const char *label)
85 if (!fmt && taken(fmt))
88 /* A decent guess to start. */
89 buf = tal_arr_label(ctx, char, strlen(fmt) * 2, label);
90 if (!do_vfmt(&buf, 0, fmt, ap))
95 bool tal_append_vfmt(char **baseptr, const char *fmt, va_list ap)
97 if (!fmt && taken(fmt))
100 return do_vfmt(baseptr, strlen(*baseptr), fmt, ap);
103 bool tal_append_fmt(char **baseptr, const char *fmt, ...)
109 ret = tal_append_vfmt(baseptr, fmt, ap);
115 char *tal_strcat_(const tal_t *ctx, const char *s1, const char *s2,
121 if (unlikely(!s2) && taken(s2)) {
126 /* We have to let through NULL for take(). */
127 len1 = s1 ? strlen(s1) : 0;
130 ret = tal_dup_arr_label(ctx, char, s1, len1, len2 + 1, label);
132 memcpy(ret + len1, s2, len2 + 1);
139 char **tal_strsplit_(const tal_t *ctx,
140 const char *string, const char *delims, enum strsplit flags,
144 size_t max = 64, num = 0;
146 parts = tal_arr(ctx, char *, max + 1);
147 if (unlikely(!parts)) {
154 str = tal_strdup(parts, string);
157 if (unlikely(!delims) && is_taken(delims))
160 if (flags == STR_NO_EMPTY)
161 str += strspn(str, delims);
163 while (*str != '\0') {
164 size_t len = strcspn(str, delims), dlen;
167 dlen = strspn(str + len, delims);
168 parts[num][len] = '\0';
169 if (flags == STR_EMPTY_OK && dlen)
172 if (++num == max && !tal_resize(&parts, max*=2 + 1))
177 /* Ensure that tal_count() is correct. */
178 if (unlikely(!tal_resize(&parts, num+1)))
192 char *tal_strjoin_(const tal_t *ctx,
193 char *strings[], const char *delim, enum strjoin flags,
198 size_t totlen = 0, dlen;
200 if (unlikely(!strings) && is_taken(strings))
203 if (unlikely(!delim) && is_taken(delim))
206 dlen = strlen(delim);
207 ret = tal_arr_label(ctx, char, dlen*2+1, label);
212 for (i = 0; strings[i]; i++) {
213 size_t len = strlen(strings[i]);
215 if (flags == STR_NO_TRAIL && !strings[i+1])
217 if (!tal_resize(&ret, totlen + len + dlen + 1))
219 memcpy(ret + totlen, strings[i], len);
221 memcpy(ret + totlen, delim, dlen);
236 static size_t count_open_braces(const char *string)
239 size_t num = 0, esc = 0;
245 /* An odd number of \ means it's escaped. */
246 if (*string == '(' && (esc & 1) == 0)
254 return strcount(string, "(");
258 bool tal_strreg_(const tal_t *ctx, const char *string, const char *label,
259 const char *regex, ...)
261 size_t nmatch = 1 + count_open_braces(regex);
262 regmatch_t matches[nmatch];
268 if (unlikely(!regex) && is_taken(regex))
271 if (regcomp(&r, regex, REG_EXTENDED) != 0)
274 if (unlikely(!string) && is_taken(string))
277 if (regexec(&r, string, nmatch, matches, 0) != 0)
282 for (i = 1; i < nmatch; i++) {
283 char **arg = va_arg(ap, char **);
285 /* eg. ([a-z])? can give "no match". */
286 if (matches[i].rm_so == -1)
289 *arg = tal_strndup_(ctx,
290 string + matches[i].rm_so,
294 /* FIXME: If we fail, we set some and leak! */