]> git.ipfire.org Git - thirdparty/git.git/blob - strbuf.c
c3d1cee616e6a7dc708a70d8bc7b65d01c112823
[thirdparty/git.git] / strbuf.c
1 #include "git-compat-util.h"
2 #include "abspath.h"
3 #include "alloc.h"
4 #include "environment.h"
5 #include "gettext.h"
6 #include "hex.h"
7 #include "object-name.h"
8 #include "refs.h"
9 #include "repository.h"
10 #include "string-list.h"
11 #include "utf8.h"
12 #include "date.h"
13 #include "wrapper.h"
14
15 int starts_with(const char *str, const char *prefix)
16 {
17 for (; ; str++, prefix++)
18 if (!*prefix)
19 return 1;
20 else if (*str != *prefix)
21 return 0;
22 }
23
24 int istarts_with(const char *str, const char *prefix)
25 {
26 for (; ; str++, prefix++)
27 if (!*prefix)
28 return 1;
29 else if (tolower(*str) != tolower(*prefix))
30 return 0;
31 }
32
33 int skip_to_optional_arg_default(const char *str, const char *prefix,
34 const char **arg, const char *def)
35 {
36 const char *p;
37
38 if (!skip_prefix(str, prefix, &p))
39 return 0;
40
41 if (!*p) {
42 if (arg)
43 *arg = def;
44 return 1;
45 }
46
47 if (*p != '=')
48 return 0;
49
50 if (arg)
51 *arg = p + 1;
52 return 1;
53 }
54
55 /*
56 * Used as the default ->buf value, so that people can always assume
57 * buf is non NULL and ->buf is NUL terminated even for a freshly
58 * initialized strbuf.
59 */
60 char strbuf_slopbuf[1];
61
62 void strbuf_init(struct strbuf *sb, size_t hint)
63 {
64 struct strbuf blank = STRBUF_INIT;
65 memcpy(sb, &blank, sizeof(*sb));
66 if (hint)
67 strbuf_grow(sb, hint);
68 }
69
70 void strbuf_release(struct strbuf *sb)
71 {
72 if (sb->alloc) {
73 free(sb->buf);
74 strbuf_init(sb, 0);
75 }
76 }
77
78 char *strbuf_detach(struct strbuf *sb, size_t *sz)
79 {
80 char *res;
81 strbuf_grow(sb, 0);
82 res = sb->buf;
83 if (sz)
84 *sz = sb->len;
85 strbuf_init(sb, 0);
86 return res;
87 }
88
89 void strbuf_attach(struct strbuf *sb, void *buf, size_t len, size_t alloc)
90 {
91 strbuf_release(sb);
92 sb->buf = buf;
93 sb->len = len;
94 sb->alloc = alloc;
95 strbuf_grow(sb, 0);
96 sb->buf[sb->len] = '\0';
97 }
98
99 void strbuf_grow(struct strbuf *sb, size_t extra)
100 {
101 int new_buf = !sb->alloc;
102 if (unsigned_add_overflows(extra, 1) ||
103 unsigned_add_overflows(sb->len, extra + 1))
104 die("you want to use way too much memory");
105 if (new_buf)
106 sb->buf = NULL;
107 ALLOC_GROW(sb->buf, sb->len + extra + 1, sb->alloc);
108 if (new_buf)
109 sb->buf[0] = '\0';
110 }
111
112 void strbuf_trim(struct strbuf *sb)
113 {
114 strbuf_rtrim(sb);
115 strbuf_ltrim(sb);
116 }
117
118 void strbuf_rtrim(struct strbuf *sb)
119 {
120 while (sb->len > 0 && isspace((unsigned char)sb->buf[sb->len - 1]))
121 sb->len--;
122 sb->buf[sb->len] = '\0';
123 }
124
125 void strbuf_trim_trailing_dir_sep(struct strbuf *sb)
126 {
127 while (sb->len > 0 && is_dir_sep((unsigned char)sb->buf[sb->len - 1]))
128 sb->len--;
129 sb->buf[sb->len] = '\0';
130 }
131
132 void strbuf_trim_trailing_newline(struct strbuf *sb)
133 {
134 if (sb->len > 0 && sb->buf[sb->len - 1] == '\n') {
135 if (--sb->len > 0 && sb->buf[sb->len - 1] == '\r')
136 --sb->len;
137 sb->buf[sb->len] = '\0';
138 }
139 }
140
141 void strbuf_ltrim(struct strbuf *sb)
142 {
143 char *b = sb->buf;
144 while (sb->len > 0 && isspace(*b)) {
145 b++;
146 sb->len--;
147 }
148 memmove(sb->buf, b, sb->len);
149 sb->buf[sb->len] = '\0';
150 }
151
152 int strbuf_reencode(struct strbuf *sb, const char *from, const char *to)
153 {
154 char *out;
155 size_t len;
156
157 if (same_encoding(from, to))
158 return 0;
159
160 out = reencode_string_len(sb->buf, sb->len, to, from, &len);
161 if (!out)
162 return -1;
163
164 strbuf_attach(sb, out, len, len);
165 return 0;
166 }
167
168 void strbuf_tolower(struct strbuf *sb)
169 {
170 char *p = sb->buf, *end = sb->buf + sb->len;
171 for (; p < end; p++)
172 *p = tolower(*p);
173 }
174
175 struct strbuf **strbuf_split_buf(const char *str, size_t slen,
176 int terminator, int max)
177 {
178 struct strbuf **ret = NULL;
179 size_t nr = 0, alloc = 0;
180 struct strbuf *t;
181
182 while (slen) {
183 int len = slen;
184 if (max <= 0 || nr + 1 < max) {
185 const char *end = memchr(str, terminator, slen);
186 if (end)
187 len = end - str + 1;
188 }
189 t = xmalloc(sizeof(struct strbuf));
190 strbuf_init(t, len);
191 strbuf_add(t, str, len);
192 ALLOC_GROW(ret, nr + 2, alloc);
193 ret[nr++] = t;
194 str += len;
195 slen -= len;
196 }
197 ALLOC_GROW(ret, nr + 1, alloc); /* In case string was empty */
198 ret[nr] = NULL;
199 return ret;
200 }
201
202 void strbuf_add_separated_string_list(struct strbuf *str,
203 const char *sep,
204 struct string_list *slist)
205 {
206 struct string_list_item *item;
207 int sep_needed = 0;
208
209 for_each_string_list_item(item, slist) {
210 if (sep_needed)
211 strbuf_addstr(str, sep);
212 strbuf_addstr(str, item->string);
213 sep_needed = 1;
214 }
215 }
216
217 void strbuf_list_free(struct strbuf **sbs)
218 {
219 struct strbuf **s = sbs;
220
221 if (!s)
222 return;
223 while (*s) {
224 strbuf_release(*s);
225 free(*s++);
226 }
227 free(sbs);
228 }
229
230 int strbuf_cmp(const struct strbuf *a, const struct strbuf *b)
231 {
232 size_t len = a->len < b->len ? a->len: b->len;
233 int cmp = memcmp(a->buf, b->buf, len);
234 if (cmp)
235 return cmp;
236 return a->len < b->len ? -1: a->len != b->len;
237 }
238
239 void strbuf_splice(struct strbuf *sb, size_t pos, size_t len,
240 const void *data, size_t dlen)
241 {
242 if (unsigned_add_overflows(pos, len))
243 die("you want to use way too much memory");
244 if (pos > sb->len)
245 die("`pos' is too far after the end of the buffer");
246 if (pos + len > sb->len)
247 die("`pos + len' is too far after the end of the buffer");
248
249 if (dlen >= len)
250 strbuf_grow(sb, dlen - len);
251 memmove(sb->buf + pos + dlen,
252 sb->buf + pos + len,
253 sb->len - pos - len);
254 memcpy(sb->buf + pos, data, dlen);
255 strbuf_setlen(sb, sb->len + dlen - len);
256 }
257
258 void strbuf_insert(struct strbuf *sb, size_t pos, const void *data, size_t len)
259 {
260 strbuf_splice(sb, pos, 0, data, len);
261 }
262
263 void strbuf_vinsertf(struct strbuf *sb, size_t pos, const char *fmt, va_list ap)
264 {
265 int len, len2;
266 char save;
267 va_list cp;
268
269 if (pos > sb->len)
270 die("`pos' is too far after the end of the buffer");
271 va_copy(cp, ap);
272 len = vsnprintf(sb->buf + sb->len, 0, fmt, cp);
273 va_end(cp);
274 if (len < 0)
275 BUG("your vsnprintf is broken (returned %d)", len);
276 if (!len)
277 return; /* nothing to do */
278 if (unsigned_add_overflows(sb->len, len))
279 die("you want to use way too much memory");
280 strbuf_grow(sb, len);
281 memmove(sb->buf + pos + len, sb->buf + pos, sb->len - pos);
282 /* vsnprintf() will append a NUL, overwriting one of our characters */
283 save = sb->buf[pos + len];
284 len2 = vsnprintf(sb->buf + pos, len + 1, fmt, ap);
285 sb->buf[pos + len] = save;
286 if (len2 != len)
287 BUG("your vsnprintf is broken (returns inconsistent lengths)");
288 strbuf_setlen(sb, sb->len + len);
289 }
290
291 void strbuf_insertf(struct strbuf *sb, size_t pos, const char *fmt, ...)
292 {
293 va_list ap;
294 va_start(ap, fmt);
295 strbuf_vinsertf(sb, pos, fmt, ap);
296 va_end(ap);
297 }
298
299 void strbuf_remove(struct strbuf *sb, size_t pos, size_t len)
300 {
301 strbuf_splice(sb, pos, len, "", 0);
302 }
303
304 void strbuf_add(struct strbuf *sb, const void *data, size_t len)
305 {
306 strbuf_grow(sb, len);
307 memcpy(sb->buf + sb->len, data, len);
308 strbuf_setlen(sb, sb->len + len);
309 }
310
311 void strbuf_addbuf(struct strbuf *sb, const struct strbuf *sb2)
312 {
313 strbuf_grow(sb, sb2->len);
314 memcpy(sb->buf + sb->len, sb2->buf, sb2->len);
315 strbuf_setlen(sb, sb->len + sb2->len);
316 }
317
318 const char *strbuf_join_argv(struct strbuf *buf,
319 int argc, const char **argv, char delim)
320 {
321 if (!argc)
322 return buf->buf;
323
324 strbuf_addstr(buf, *argv);
325 while (--argc) {
326 strbuf_addch(buf, delim);
327 strbuf_addstr(buf, *(++argv));
328 }
329
330 return buf->buf;
331 }
332
333 void strbuf_addchars(struct strbuf *sb, int c, size_t n)
334 {
335 strbuf_grow(sb, n);
336 memset(sb->buf + sb->len, c, n);
337 strbuf_setlen(sb, sb->len + n);
338 }
339
340 void strbuf_addf(struct strbuf *sb, const char *fmt, ...)
341 {
342 va_list ap;
343 va_start(ap, fmt);
344 strbuf_vaddf(sb, fmt, ap);
345 va_end(ap);
346 }
347
348 static void add_lines(struct strbuf *out,
349 const char *prefix1,
350 const char *prefix2,
351 const char *buf, size_t size)
352 {
353 while (size) {
354 const char *prefix;
355 const char *next = memchr(buf, '\n', size);
356 next = next ? (next + 1) : (buf + size);
357
358 prefix = ((prefix2 && (buf[0] == '\n' || buf[0] == '\t'))
359 ? prefix2 : prefix1);
360 strbuf_addstr(out, prefix);
361 strbuf_add(out, buf, next - buf);
362 size -= next - buf;
363 buf = next;
364 }
365 strbuf_complete_line(out);
366 }
367
368 void strbuf_add_commented_lines(struct strbuf *out, const char *buf, size_t size)
369 {
370 static char prefix1[3];
371 static char prefix2[2];
372
373 if (prefix1[0] != comment_line_char) {
374 xsnprintf(prefix1, sizeof(prefix1), "%c ", comment_line_char);
375 xsnprintf(prefix2, sizeof(prefix2), "%c", comment_line_char);
376 }
377 add_lines(out, prefix1, prefix2, buf, size);
378 }
379
380 void strbuf_commented_addf(struct strbuf *sb, const char *fmt, ...)
381 {
382 va_list params;
383 struct strbuf buf = STRBUF_INIT;
384 int incomplete_line = sb->len && sb->buf[sb->len - 1] != '\n';
385
386 va_start(params, fmt);
387 strbuf_vaddf(&buf, fmt, params);
388 va_end(params);
389
390 strbuf_add_commented_lines(sb, buf.buf, buf.len);
391 if (incomplete_line)
392 sb->buf[--sb->len] = '\0';
393
394 strbuf_release(&buf);
395 }
396
397 void strbuf_vaddf(struct strbuf *sb, const char *fmt, va_list ap)
398 {
399 int len;
400 va_list cp;
401
402 if (!strbuf_avail(sb))
403 strbuf_grow(sb, 64);
404 va_copy(cp, ap);
405 len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, cp);
406 va_end(cp);
407 if (len < 0)
408 BUG("your vsnprintf is broken (returned %d)", len);
409 if (len > strbuf_avail(sb)) {
410 strbuf_grow(sb, len);
411 len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, ap);
412 if (len > strbuf_avail(sb))
413 BUG("your vsnprintf is broken (insatiable)");
414 }
415 strbuf_setlen(sb, sb->len + len);
416 }
417
418 int strbuf_expand_step(struct strbuf *sb, const char **formatp)
419 {
420 const char *format = *formatp;
421 const char *percent = strchrnul(format, '%');
422
423 strbuf_add(sb, format, percent - format);
424 if (!*percent)
425 return 0;
426 *formatp = percent + 1;
427 return 1;
428 }
429
430 size_t strbuf_expand_literal_cb(struct strbuf *sb,
431 const char *placeholder,
432 void *context UNUSED)
433 {
434 int ch;
435
436 switch (placeholder[0]) {
437 case 'n': /* newline */
438 strbuf_addch(sb, '\n');
439 return 1;
440 case 'x':
441 /* %x00 == NUL, %x0a == LF, etc. */
442 ch = hex2chr(placeholder + 1);
443 if (ch < 0)
444 return 0;
445 strbuf_addch(sb, ch);
446 return 3;
447 }
448 return 0;
449 }
450
451 void strbuf_addbuf_percentquote(struct strbuf *dst, const struct strbuf *src)
452 {
453 size_t i, len = src->len;
454
455 for (i = 0; i < len; i++) {
456 if (src->buf[i] == '%')
457 strbuf_addch(dst, '%');
458 strbuf_addch(dst, src->buf[i]);
459 }
460 }
461
462 #define URL_UNSAFE_CHARS " <>\"%{}|\\^`:?#[]@!$&'()*+,;="
463
464 void strbuf_add_percentencode(struct strbuf *dst, const char *src, int flags)
465 {
466 size_t i, len = strlen(src);
467
468 for (i = 0; i < len; i++) {
469 unsigned char ch = src[i];
470 if (ch <= 0x1F || ch >= 0x7F ||
471 (ch == '/' && (flags & STRBUF_ENCODE_SLASH)) ||
472 strchr(URL_UNSAFE_CHARS, ch))
473 strbuf_addf(dst, "%%%02X", (unsigned char)ch);
474 else
475 strbuf_addch(dst, ch);
476 }
477 }
478
479 size_t strbuf_fread(struct strbuf *sb, size_t size, FILE *f)
480 {
481 size_t res;
482 size_t oldalloc = sb->alloc;
483
484 strbuf_grow(sb, size);
485 res = fread(sb->buf + sb->len, 1, size, f);
486 if (res > 0)
487 strbuf_setlen(sb, sb->len + res);
488 else if (oldalloc == 0)
489 strbuf_release(sb);
490 return res;
491 }
492
493 ssize_t strbuf_read(struct strbuf *sb, int fd, size_t hint)
494 {
495 size_t oldlen = sb->len;
496 size_t oldalloc = sb->alloc;
497
498 strbuf_grow(sb, hint ? hint : 8192);
499 for (;;) {
500 ssize_t want = sb->alloc - sb->len - 1;
501 ssize_t got = read_in_full(fd, sb->buf + sb->len, want);
502
503 if (got < 0) {
504 if (oldalloc == 0)
505 strbuf_release(sb);
506 else
507 strbuf_setlen(sb, oldlen);
508 return -1;
509 }
510 sb->len += got;
511 if (got < want)
512 break;
513 strbuf_grow(sb, 8192);
514 }
515
516 sb->buf[sb->len] = '\0';
517 return sb->len - oldlen;
518 }
519
520 ssize_t strbuf_read_once(struct strbuf *sb, int fd, size_t hint)
521 {
522 size_t oldalloc = sb->alloc;
523 ssize_t cnt;
524
525 strbuf_grow(sb, hint ? hint : 8192);
526 cnt = xread(fd, sb->buf + sb->len, sb->alloc - sb->len - 1);
527 if (cnt > 0)
528 strbuf_setlen(sb, sb->len + cnt);
529 else if (oldalloc == 0)
530 strbuf_release(sb);
531 return cnt;
532 }
533
534 ssize_t strbuf_write(struct strbuf *sb, FILE *f)
535 {
536 return sb->len ? fwrite(sb->buf, 1, sb->len, f) : 0;
537 }
538
539 #define STRBUF_MAXLINK (2*PATH_MAX)
540
541 int strbuf_readlink(struct strbuf *sb, const char *path, size_t hint)
542 {
543 size_t oldalloc = sb->alloc;
544
545 if (hint < 32)
546 hint = 32;
547
548 while (hint < STRBUF_MAXLINK) {
549 ssize_t len;
550
551 strbuf_grow(sb, hint);
552 len = readlink(path, sb->buf, hint);
553 if (len < 0) {
554 if (errno != ERANGE)
555 break;
556 } else if (len < hint) {
557 strbuf_setlen(sb, len);
558 return 0;
559 }
560
561 /* .. the buffer was too small - try again */
562 hint *= 2;
563 }
564 if (oldalloc == 0)
565 strbuf_release(sb);
566 return -1;
567 }
568
569 int strbuf_getcwd(struct strbuf *sb)
570 {
571 size_t oldalloc = sb->alloc;
572 size_t guessed_len = 128;
573
574 for (;; guessed_len *= 2) {
575 strbuf_grow(sb, guessed_len);
576 if (getcwd(sb->buf, sb->alloc)) {
577 strbuf_setlen(sb, strlen(sb->buf));
578 return 0;
579 }
580
581 /*
582 * If getcwd(3) is implemented as a syscall that falls
583 * back to a regular lookup using readdir(3) etc. then
584 * we may be able to avoid EACCES by providing enough
585 * space to the syscall as it's not necessarily bound
586 * to the same restrictions as the fallback.
587 */
588 if (errno == EACCES && guessed_len < PATH_MAX)
589 continue;
590
591 if (errno != ERANGE)
592 break;
593 }
594 if (oldalloc == 0)
595 strbuf_release(sb);
596 else
597 strbuf_reset(sb);
598 return -1;
599 }
600
601 #ifdef HAVE_GETDELIM
602 int strbuf_getwholeline(struct strbuf *sb, FILE *fp, int term)
603 {
604 ssize_t r;
605
606 if (feof(fp))
607 return EOF;
608
609 strbuf_reset(sb);
610
611 /* Translate slopbuf to NULL, as we cannot call realloc on it */
612 if (!sb->alloc)
613 sb->buf = NULL;
614 errno = 0;
615 r = getdelim(&sb->buf, &sb->alloc, term, fp);
616
617 if (r > 0) {
618 sb->len = r;
619 return 0;
620 }
621 assert(r == -1);
622
623 /*
624 * Normally we would have called xrealloc, which will try to free
625 * memory and recover. But we have no way to tell getdelim() to do so.
626 * Worse, we cannot try to recover ENOMEM ourselves, because we have
627 * no idea how many bytes were read by getdelim.
628 *
629 * Dying here is reasonable. It mirrors what xrealloc would do on
630 * catastrophic memory failure. We skip the opportunity to free pack
631 * memory and retry, but that's unlikely to help for a malloc small
632 * enough to hold a single line of input, anyway.
633 */
634 if (errno == ENOMEM)
635 die("Out of memory, getdelim failed");
636
637 /*
638 * Restore strbuf invariants; if getdelim left us with a NULL pointer,
639 * we can just re-init, but otherwise we should make sure that our
640 * length is empty, and that the result is NUL-terminated.
641 */
642 if (!sb->buf)
643 strbuf_init(sb, 0);
644 else
645 strbuf_reset(sb);
646 return EOF;
647 }
648 #else
649 int strbuf_getwholeline(struct strbuf *sb, FILE *fp, int term)
650 {
651 int ch;
652
653 if (feof(fp))
654 return EOF;
655
656 strbuf_reset(sb);
657 flockfile(fp);
658 while ((ch = getc_unlocked(fp)) != EOF) {
659 if (!strbuf_avail(sb))
660 strbuf_grow(sb, 1);
661 sb->buf[sb->len++] = ch;
662 if (ch == term)
663 break;
664 }
665 funlockfile(fp);
666 if (ch == EOF && sb->len == 0)
667 return EOF;
668
669 sb->buf[sb->len] = '\0';
670 return 0;
671 }
672 #endif
673
674 int strbuf_appendwholeline(struct strbuf *sb, FILE *fp, int term)
675 {
676 struct strbuf line = STRBUF_INIT;
677 if (strbuf_getwholeline(&line, fp, term))
678 return EOF;
679 strbuf_addbuf(sb, &line);
680 strbuf_release(&line);
681 return 0;
682 }
683
684 static int strbuf_getdelim(struct strbuf *sb, FILE *fp, int term)
685 {
686 if (strbuf_getwholeline(sb, fp, term))
687 return EOF;
688 if (sb->buf[sb->len - 1] == term)
689 strbuf_setlen(sb, sb->len - 1);
690 return 0;
691 }
692
693 int strbuf_getline(struct strbuf *sb, FILE *fp)
694 {
695 if (strbuf_getwholeline(sb, fp, '\n'))
696 return EOF;
697 if (sb->buf[sb->len - 1] == '\n') {
698 strbuf_setlen(sb, sb->len - 1);
699 if (sb->len && sb->buf[sb->len - 1] == '\r')
700 strbuf_setlen(sb, sb->len - 1);
701 }
702 return 0;
703 }
704
705 int strbuf_getline_lf(struct strbuf *sb, FILE *fp)
706 {
707 return strbuf_getdelim(sb, fp, '\n');
708 }
709
710 int strbuf_getline_nul(struct strbuf *sb, FILE *fp)
711 {
712 return strbuf_getdelim(sb, fp, '\0');
713 }
714
715 int strbuf_getwholeline_fd(struct strbuf *sb, int fd, int term)
716 {
717 strbuf_reset(sb);
718
719 while (1) {
720 char ch;
721 ssize_t len = xread(fd, &ch, 1);
722 if (len <= 0)
723 return EOF;
724 strbuf_addch(sb, ch);
725 if (ch == term)
726 break;
727 }
728 return 0;
729 }
730
731 ssize_t strbuf_read_file(struct strbuf *sb, const char *path, size_t hint)
732 {
733 int fd;
734 ssize_t len;
735 int saved_errno;
736
737 fd = open(path, O_RDONLY);
738 if (fd < 0)
739 return -1;
740 len = strbuf_read(sb, fd, hint);
741 saved_errno = errno;
742 close(fd);
743 if (len < 0) {
744 errno = saved_errno;
745 return -1;
746 }
747
748 return len;
749 }
750
751 void strbuf_add_lines(struct strbuf *out, const char *prefix,
752 const char *buf, size_t size)
753 {
754 add_lines(out, prefix, NULL, buf, size);
755 }
756
757 void strbuf_addstr_xml_quoted(struct strbuf *buf, const char *s)
758 {
759 while (*s) {
760 size_t len = strcspn(s, "\"<>&");
761 strbuf_add(buf, s, len);
762 s += len;
763 switch (*s) {
764 case '"':
765 strbuf_addstr(buf, "&quot;");
766 break;
767 case '<':
768 strbuf_addstr(buf, "&lt;");
769 break;
770 case '>':
771 strbuf_addstr(buf, "&gt;");
772 break;
773 case '&':
774 strbuf_addstr(buf, "&amp;");
775 break;
776 case 0:
777 return;
778 }
779 s++;
780 }
781 }
782
783 int is_rfc3986_reserved_or_unreserved(char ch)
784 {
785 if (is_rfc3986_unreserved(ch))
786 return 1;
787 switch (ch) {
788 case '!': case '*': case '\'': case '(': case ')': case ';':
789 case ':': case '@': case '&': case '=': case '+': case '$':
790 case ',': case '/': case '?': case '#': case '[': case ']':
791 return 1;
792 }
793 return 0;
794 }
795
796 int is_rfc3986_unreserved(char ch)
797 {
798 return isalnum(ch) ||
799 ch == '-' || ch == '_' || ch == '.' || ch == '~';
800 }
801
802 static void strbuf_add_urlencode(struct strbuf *sb, const char *s, size_t len,
803 char_predicate allow_unencoded_fn)
804 {
805 strbuf_grow(sb, len);
806 while (len--) {
807 char ch = *s++;
808 if (allow_unencoded_fn(ch))
809 strbuf_addch(sb, ch);
810 else
811 strbuf_addf(sb, "%%%02x", (unsigned char)ch);
812 }
813 }
814
815 void strbuf_addstr_urlencode(struct strbuf *sb, const char *s,
816 char_predicate allow_unencoded_fn)
817 {
818 strbuf_add_urlencode(sb, s, strlen(s), allow_unencoded_fn);
819 }
820
821 static void strbuf_humanise(struct strbuf *buf, off_t bytes,
822 int humanise_rate)
823 {
824 if (bytes > 1 << 30) {
825 strbuf_addf(buf,
826 humanise_rate == 0 ?
827 /* TRANSLATORS: IEC 80000-13:2008 gibibyte */
828 _("%u.%2.2u GiB") :
829 /* TRANSLATORS: IEC 80000-13:2008 gibibyte/second */
830 _("%u.%2.2u GiB/s"),
831 (unsigned)(bytes >> 30),
832 (unsigned)(bytes & ((1 << 30) - 1)) / 10737419);
833 } else if (bytes > 1 << 20) {
834 unsigned x = bytes + 5243; /* for rounding */
835 strbuf_addf(buf,
836 humanise_rate == 0 ?
837 /* TRANSLATORS: IEC 80000-13:2008 mebibyte */
838 _("%u.%2.2u MiB") :
839 /* TRANSLATORS: IEC 80000-13:2008 mebibyte/second */
840 _("%u.%2.2u MiB/s"),
841 x >> 20, ((x & ((1 << 20) - 1)) * 100) >> 20);
842 } else if (bytes > 1 << 10) {
843 unsigned x = bytes + 5; /* for rounding */
844 strbuf_addf(buf,
845 humanise_rate == 0 ?
846 /* TRANSLATORS: IEC 80000-13:2008 kibibyte */
847 _("%u.%2.2u KiB") :
848 /* TRANSLATORS: IEC 80000-13:2008 kibibyte/second */
849 _("%u.%2.2u KiB/s"),
850 x >> 10, ((x & ((1 << 10) - 1)) * 100) >> 10);
851 } else {
852 strbuf_addf(buf,
853 humanise_rate == 0 ?
854 /* TRANSLATORS: IEC 80000-13:2008 byte */
855 Q_("%u byte", "%u bytes", bytes) :
856 /* TRANSLATORS: IEC 80000-13:2008 byte/second */
857 Q_("%u byte/s", "%u bytes/s", bytes),
858 (unsigned)bytes);
859 }
860 }
861
862 void strbuf_humanise_bytes(struct strbuf *buf, off_t bytes)
863 {
864 strbuf_humanise(buf, bytes, 0);
865 }
866
867 void strbuf_humanise_rate(struct strbuf *buf, off_t bytes)
868 {
869 strbuf_humanise(buf, bytes, 1);
870 }
871
872 void strbuf_add_absolute_path(struct strbuf *sb, const char *path)
873 {
874 if (!*path)
875 die("The empty string is not a valid path");
876 if (!is_absolute_path(path)) {
877 struct stat cwd_stat, pwd_stat;
878 size_t orig_len = sb->len;
879 char *cwd = xgetcwd();
880 char *pwd = getenv("PWD");
881 if (pwd && strcmp(pwd, cwd) &&
882 !stat(cwd, &cwd_stat) &&
883 (cwd_stat.st_dev || cwd_stat.st_ino) &&
884 !stat(pwd, &pwd_stat) &&
885 pwd_stat.st_dev == cwd_stat.st_dev &&
886 pwd_stat.st_ino == cwd_stat.st_ino)
887 strbuf_addstr(sb, pwd);
888 else
889 strbuf_addstr(sb, cwd);
890 if (sb->len > orig_len && !is_dir_sep(sb->buf[sb->len - 1]))
891 strbuf_addch(sb, '/');
892 free(cwd);
893 }
894 strbuf_addstr(sb, path);
895 }
896
897 void strbuf_add_real_path(struct strbuf *sb, const char *path)
898 {
899 if (sb->len) {
900 struct strbuf resolved = STRBUF_INIT;
901 strbuf_realpath(&resolved, path, 1);
902 strbuf_addbuf(sb, &resolved);
903 strbuf_release(&resolved);
904 } else
905 strbuf_realpath(sb, path, 1);
906 }
907
908 int printf_ln(const char *fmt, ...)
909 {
910 int ret;
911 va_list ap;
912 va_start(ap, fmt);
913 ret = vprintf(fmt, ap);
914 va_end(ap);
915 if (ret < 0 || putchar('\n') == EOF)
916 return -1;
917 return ret + 1;
918 }
919
920 int fprintf_ln(FILE *fp, const char *fmt, ...)
921 {
922 int ret;
923 va_list ap;
924 va_start(ap, fmt);
925 ret = vfprintf(fp, fmt, ap);
926 va_end(ap);
927 if (ret < 0 || putc('\n', fp) == EOF)
928 return -1;
929 return ret + 1;
930 }
931
932 char *xstrdup_tolower(const char *string)
933 {
934 char *result;
935 size_t len, i;
936
937 len = strlen(string);
938 result = xmallocz(len);
939 for (i = 0; i < len; i++)
940 result[i] = tolower(string[i]);
941 return result;
942 }
943
944 char *xstrdup_toupper(const char *string)
945 {
946 char *result;
947 size_t len, i;
948
949 len = strlen(string);
950 result = xmallocz(len);
951 for (i = 0; i < len; i++)
952 result[i] = toupper(string[i]);
953 return result;
954 }
955
956 char *xstrvfmt(const char *fmt, va_list ap)
957 {
958 struct strbuf buf = STRBUF_INIT;
959 strbuf_vaddf(&buf, fmt, ap);
960 return strbuf_detach(&buf, NULL);
961 }
962
963 char *xstrfmt(const char *fmt, ...)
964 {
965 va_list ap;
966 char *ret;
967
968 va_start(ap, fmt);
969 ret = xstrvfmt(fmt, ap);
970 va_end(ap);
971
972 return ret;
973 }
974
975 void strbuf_addftime(struct strbuf *sb, const char *fmt, const struct tm *tm,
976 int tz_offset, int suppress_tz_name)
977 {
978 struct strbuf munged_fmt = STRBUF_INIT;
979 size_t hint = 128;
980 size_t len;
981
982 if (!*fmt)
983 return;
984
985 /*
986 * There is no portable way to pass timezone information to
987 * strftime, so we handle %z and %Z here. Likewise '%s', because
988 * going back to an epoch time requires knowing the zone.
989 *
990 * Note that tz_offset is in the "[-+]HHMM" decimal form; this is what
991 * we want for %z, but the computation for %s has to convert to number
992 * of seconds.
993 */
994 while (strbuf_expand_step(&munged_fmt, &fmt)) {
995 switch (*fmt) {
996 case '%':
997 strbuf_addstr(&munged_fmt, "%%");
998 fmt++;
999 break;
1000 case 's':
1001 strbuf_addf(&munged_fmt, "%"PRItime,
1002 (timestamp_t)tm_to_time_t(tm) -
1003 3600 * (tz_offset / 100) -
1004 60 * (tz_offset % 100));
1005 fmt++;
1006 break;
1007 case 'z':
1008 strbuf_addf(&munged_fmt, "%+05d", tz_offset);
1009 fmt++;
1010 break;
1011 case 'Z':
1012 if (suppress_tz_name) {
1013 fmt++;
1014 break;
1015 }
1016 /* FALLTHROUGH */
1017 default:
1018 strbuf_addch(&munged_fmt, '%');
1019 }
1020 }
1021 fmt = munged_fmt.buf;
1022
1023 strbuf_grow(sb, hint);
1024 len = strftime(sb->buf + sb->len, sb->alloc - sb->len, fmt, tm);
1025
1026 if (!len) {
1027 /*
1028 * strftime reports "0" if it could not fit the result in the buffer.
1029 * Unfortunately, it also reports "0" if the requested time string
1030 * takes 0 bytes. So our strategy is to munge the format so that the
1031 * output contains at least one character, and then drop the extra
1032 * character before returning.
1033 */
1034 strbuf_addch(&munged_fmt, ' ');
1035 while (!len) {
1036 hint *= 2;
1037 strbuf_grow(sb, hint);
1038 len = strftime(sb->buf + sb->len, sb->alloc - sb->len,
1039 munged_fmt.buf, tm);
1040 }
1041 len--; /* drop munged space */
1042 }
1043 strbuf_release(&munged_fmt);
1044 strbuf_setlen(sb, sb->len + len);
1045 }
1046
1047 void strbuf_repo_add_unique_abbrev(struct strbuf *sb, struct repository *repo,
1048 const struct object_id *oid, int abbrev_len)
1049 {
1050 int r;
1051 strbuf_grow(sb, GIT_MAX_HEXSZ + 1);
1052 r = repo_find_unique_abbrev_r(repo, sb->buf + sb->len, oid, abbrev_len);
1053 strbuf_setlen(sb, sb->len + r);
1054 }
1055
1056 void strbuf_add_unique_abbrev(struct strbuf *sb, const struct object_id *oid,
1057 int abbrev_len)
1058 {
1059 strbuf_repo_add_unique_abbrev(sb, the_repository, oid, abbrev_len);
1060 }
1061
1062 /*
1063 * Returns the length of a line, without trailing spaces.
1064 *
1065 * If the line ends with newline, it will be removed too.
1066 */
1067 static size_t cleanup(char *line, size_t len)
1068 {
1069 while (len) {
1070 unsigned char c = line[len - 1];
1071 if (!isspace(c))
1072 break;
1073 len--;
1074 }
1075
1076 return len;
1077 }
1078
1079 /*
1080 * Remove empty lines from the beginning and end
1081 * and also trailing spaces from every line.
1082 *
1083 * Turn multiple consecutive empty lines between paragraphs
1084 * into just one empty line.
1085 *
1086 * If the input has only empty lines and spaces,
1087 * no output will be produced.
1088 *
1089 * If last line does not have a newline at the end, one is added.
1090 *
1091 * Enable skip_comments to skip every line starting with comment
1092 * character.
1093 */
1094 void strbuf_stripspace(struct strbuf *sb, int skip_comments)
1095 {
1096 size_t empties = 0;
1097 size_t i, j, len, newlen;
1098 char *eol;
1099
1100 /* We may have to add a newline. */
1101 strbuf_grow(sb, 1);
1102
1103 for (i = j = 0; i < sb->len; i += len, j += newlen) {
1104 eol = memchr(sb->buf + i, '\n', sb->len - i);
1105 len = eol ? eol - (sb->buf + i) + 1 : sb->len - i;
1106
1107 if (skip_comments && len && sb->buf[i] == comment_line_char) {
1108 newlen = 0;
1109 continue;
1110 }
1111 newlen = cleanup(sb->buf + i, len);
1112
1113 /* Not just an empty line? */
1114 if (newlen) {
1115 if (empties > 0 && j > 0)
1116 sb->buf[j++] = '\n';
1117 empties = 0;
1118 memmove(sb->buf + j, sb->buf + i, newlen);
1119 sb->buf[newlen + j++] = '\n';
1120 } else {
1121 empties++;
1122 }
1123 }
1124
1125 strbuf_setlen(sb, j);
1126 }
1127
1128 int strbuf_normalize_path(struct strbuf *src)
1129 {
1130 struct strbuf dst = STRBUF_INIT;
1131
1132 strbuf_grow(&dst, src->len);
1133 if (normalize_path_copy(dst.buf, src->buf) < 0) {
1134 strbuf_release(&dst);
1135 return -1;
1136 }
1137
1138 /*
1139 * normalize_path does not tell us the new length, so we have to
1140 * compute it by looking for the new NUL it placed
1141 */
1142 strbuf_setlen(&dst, strlen(dst.buf));
1143 strbuf_swap(src, &dst);
1144 strbuf_release(&dst);
1145 return 0;
1146 }
1147
1148 void strbuf_strip_file_from_path(struct strbuf *sb)
1149 {
1150 char *path_sep = find_last_dir_sep(sb->buf);
1151 strbuf_setlen(sb, path_sep ? path_sep - sb->buf + 1 : 0);
1152 }