1#include "cache.h"
2#include "refs.h"
3#include "utf8.h"
4
5int starts_with(const char *str, const char *prefix)
6{
7 for (; ; str++, prefix++)
8 if (!*prefix)
9 return 1;
10 else if (*str != *prefix)
11 return 0;
12}
13
14/*
15 * Used as the default ->buf value, so that people can always assume
16 * buf is non NULL and ->buf is NUL terminated even for a freshly
17 * initialized strbuf.
18 */
19char strbuf_slopbuf[1];
20
21void strbuf_init(struct strbuf *sb, size_t hint)
22{
23 sb->alloc = sb->len = 0;
24 sb->buf = strbuf_slopbuf;
25 if (hint)
26 strbuf_grow(sb, hint);
27}
28
29void strbuf_release(struct strbuf *sb)
30{
31 if (sb->alloc) {
32 free(sb->buf);
33 strbuf_init(sb, 0);
34 }
35}
36
37char *strbuf_detach(struct strbuf *sb, size_t *sz)
38{
39 char *res;
40 strbuf_grow(sb, 0);
41 res = sb->buf;
42 if (sz)
43 *sz = sb->len;
44 strbuf_init(sb, 0);
45 return res;
46}
47
48void strbuf_attach(struct strbuf *sb, void *buf, size_t len, size_t alloc)
49{
50 strbuf_release(sb);
51 sb->buf = buf;
52 sb->len = len;
53 sb->alloc = alloc;
54 strbuf_grow(sb, 0);
55 sb->buf[sb->len] = '\0';
56}
57
58void strbuf_grow(struct strbuf *sb, size_t extra)
59{
60 int new_buf = !sb->alloc;
61 if (unsigned_add_overflows(extra, 1) ||
62 unsigned_add_overflows(sb->len, extra + 1))
63 die("you want to use way too much memory");
64 if (new_buf)
65 sb->buf = NULL;
66 ALLOC_GROW(sb->buf, sb->len + extra + 1, sb->alloc);
67 if (new_buf)
68 sb->buf[0] = '\0';
69}
70
71void strbuf_trim(struct strbuf *sb)
72{
73 strbuf_rtrim(sb);
74 strbuf_ltrim(sb);
75}
76void strbuf_rtrim(struct strbuf *sb)
77{
78 while (sb->len > 0 && isspace((unsigned char)sb->buf[sb->len - 1]))
79 sb->len--;
80 sb->buf[sb->len] = '\0';
81}
82
83void strbuf_ltrim(struct strbuf *sb)
84{
85 char *b = sb->buf;
86 while (sb->len > 0 && isspace(*b)) {
87 b++;
88 sb->len--;
89 }
90 memmove(sb->buf, b, sb->len);
91 sb->buf[sb->len] = '\0';
92}
93
94int strbuf_reencode(struct strbuf *sb, const char *from, const char *to)
95{
96 char *out;
97 int len;
98
99 if (same_encoding(from, to))
100 return 0;
101
102 out = reencode_string_len(sb->buf, sb->len, to, from, &len);
103 if (!out)
104 return -1;
105
106 strbuf_attach(sb, out, len, len);
107 return 0;
108}
109
110void strbuf_tolower(struct strbuf *sb)
111{
112 char *p = sb->buf, *end = sb->buf + sb->len;
113 for (; p < end; p++)
114 *p = tolower(*p);
115}
116
117struct strbuf **strbuf_split_buf(const char *str, size_t slen,
118 int terminator, int max)
119{
120 struct strbuf **ret = NULL;
121 size_t nr = 0, alloc = 0;
122 struct strbuf *t;
123
124 while (slen) {
125 int len = slen;
126 if (max <= 0 || nr + 1 < max) {
127 const char *end = memchr(str, terminator, slen);
128 if (end)
129 len = end - str + 1;
130 }
131 t = xmalloc(sizeof(struct strbuf));
132 strbuf_init(t, len);
133 strbuf_add(t, str, len);
134 ALLOC_GROW(ret, nr + 2, alloc);
135 ret[nr++] = t;
136 str += len;
137 slen -= len;
138 }
139 ALLOC_GROW(ret, nr + 1, alloc); /* In case string was empty */
140 ret[nr] = NULL;
141 return ret;
142}
143
144void strbuf_list_free(struct strbuf **sbs)
145{
146 struct strbuf **s = sbs;
147
148 while (*s) {
149 strbuf_release(*s);
150 free(*s++);
151 }
152 free(sbs);
153}
154
155int strbuf_cmp(const struct strbuf *a, const struct strbuf *b)
156{
157 int len = a->len < b->len ? a->len: b->len;
158 int cmp = memcmp(a->buf, b->buf, len);
159 if (cmp)
160 return cmp;
161 return a->len < b->len ? -1: a->len != b->len;
162}
163
164void strbuf_splice(struct strbuf *sb, size_t pos, size_t len,
165 const void *data, size_t dlen)
166{
167 if (unsigned_add_overflows(pos, len))
168 die("you want to use way too much memory");
169 if (pos > sb->len)
170 die("`pos' is too far after the end of the buffer");
171 if (pos + len > sb->len)
172 die("`pos + len' is too far after the end of the buffer");
173
174 if (dlen >= len)
175 strbuf_grow(sb, dlen - len);
176 memmove(sb->buf + pos + dlen,
177 sb->buf + pos + len,
178 sb->len - pos - len);
179 memcpy(sb->buf + pos, data, dlen);
180 strbuf_setlen(sb, sb->len + dlen - len);
181}
182
183void strbuf_insert(struct strbuf *sb, size_t pos, const void *data, size_t len)
184{
185 strbuf_splice(sb, pos, 0, data, len);
186}
187
188void strbuf_remove(struct strbuf *sb, size_t pos, size_t len)
189{
190 strbuf_splice(sb, pos, len, NULL, 0);
191}
192
193void strbuf_add(struct strbuf *sb, const void *data, size_t len)
194{
195 strbuf_grow(sb, len);
196 memcpy(sb->buf + sb->len, data, len);
197 strbuf_setlen(sb, sb->len + len);
198}
199
200void strbuf_adddup(struct strbuf *sb, size_t pos, size_t len)
201{
202 strbuf_grow(sb, len);
203 memcpy(sb->buf + sb->len, sb->buf + pos, len);
204 strbuf_setlen(sb, sb->len + len);
205}
206
207void strbuf_addchars(struct strbuf *sb, int c, size_t n)
208{
209 strbuf_grow(sb, n);
210 memset(sb->buf + sb->len, c, n);
211 strbuf_setlen(sb, sb->len + n);
212}
213
214void strbuf_addf(struct strbuf *sb, const char *fmt, ...)
215{
216 va_list ap;
217 va_start(ap, fmt);
218 strbuf_vaddf(sb, fmt, ap);
219 va_end(ap);
220}
221
222static void add_lines(struct strbuf *out,
223 const char *prefix1,
224 const char *prefix2,
225 const char *buf, size_t size)
226{
227 while (size) {
228 const char *prefix;
229 const char *next = memchr(buf, '\n', size);
230 next = next ? (next + 1) : (buf + size);
231
232 prefix = ((prefix2 && (buf[0] == '\n' || buf[0] == '\t'))
233 ? prefix2 : prefix1);
234 strbuf_addstr(out, prefix);
235 strbuf_add(out, buf, next - buf);
236 size -= next - buf;
237 buf = next;
238 }
239 strbuf_complete_line(out);
240}
241
242void strbuf_add_commented_lines(struct strbuf *out, const char *buf, size_t size)
243{
244 static char prefix1[3];
245 static char prefix2[2];
246
247 if (prefix1[0] != comment_line_char) {
248 xsnprintf(prefix1, sizeof(prefix1), "%c ", comment_line_char);
249 xsnprintf(prefix2, sizeof(prefix2), "%c", comment_line_char);
250 }
251 add_lines(out, prefix1, prefix2, buf, size);
252}
253
254void strbuf_commented_addf(struct strbuf *sb, const char *fmt, ...)
255{
256 va_list params;
257 struct strbuf buf = STRBUF_INIT;
258 int incomplete_line = sb->len && sb->buf[sb->len - 1] != '\n';
259
260 va_start(params, fmt);
261 strbuf_vaddf(&buf, fmt, params);
262 va_end(params);
263
264 strbuf_add_commented_lines(sb, buf.buf, buf.len);
265 if (incomplete_line)
266 sb->buf[--sb->len] = '\0';
267
268 strbuf_release(&buf);
269}
270
271void strbuf_vaddf(struct strbuf *sb, const char *fmt, va_list ap)
272{
273 int len;
274 va_list cp;
275
276 if (!strbuf_avail(sb))
277 strbuf_grow(sb, 64);
278 va_copy(cp, ap);
279 len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, cp);
280 va_end(cp);
281 if (len < 0)
282 die("BUG: your vsnprintf is broken (returned %d)", len);
283 if (len > strbuf_avail(sb)) {
284 strbuf_grow(sb, len);
285 len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, ap);
286 if (len > strbuf_avail(sb))
287 die("BUG: your vsnprintf is broken (insatiable)");
288 }
289 strbuf_setlen(sb, sb->len + len);
290}
291
292void strbuf_expand(struct strbuf *sb, const char *format, expand_fn_t fn,
293 void *context)
294{
295 for (;;) {
296 const char *percent;
297 size_t consumed;
298
299 percent = strchrnul(format, '%');
300 strbuf_add(sb, format, percent - format);
301 if (!*percent)
302 break;
303 format = percent + 1;
304
305 if (*format == '%') {
306 strbuf_addch(sb, '%');
307 format++;
308 continue;
309 }
310
311 consumed = fn(sb, format, context);
312 if (consumed)
313 format += consumed;
314 else
315 strbuf_addch(sb, '%');
316 }
317}
318
319size_t strbuf_expand_dict_cb(struct strbuf *sb, const char *placeholder,
320 void *context)
321{
322 struct strbuf_expand_dict_entry *e = context;
323 size_t len;
324
325 for (; e->placeholder && (len = strlen(e->placeholder)); e++) {
326 if (!strncmp(placeholder, e->placeholder, len)) {
327 if (e->value)
328 strbuf_addstr(sb, e->value);
329 return len;
330 }
331 }
332 return 0;
333}
334
335void strbuf_addbuf_percentquote(struct strbuf *dst, const struct strbuf *src)
336{
337 int i, len = src->len;
338
339 for (i = 0; i < len; i++) {
340 if (src->buf[i] == '%')
341 strbuf_addch(dst, '%');
342 strbuf_addch(dst, src->buf[i]);
343 }
344}
345
346size_t strbuf_fread(struct strbuf *sb, size_t size, FILE *f)
347{
348 size_t res;
349 size_t oldalloc = sb->alloc;
350
351 strbuf_grow(sb, size);
352 res = fread(sb->buf + sb->len, 1, size, f);
353 if (res > 0)
354 strbuf_setlen(sb, sb->len + res);
355 else if (oldalloc == 0)
356 strbuf_release(sb);
357 return res;
358}
359
360ssize_t strbuf_read(struct strbuf *sb, int fd, size_t hint)
361{
362 size_t oldlen = sb->len;
363 size_t oldalloc = sb->alloc;
364
365 strbuf_grow(sb, hint ? hint : 8192);
366 for (;;) {
367 ssize_t want = sb->alloc - sb->len - 1;
368 ssize_t got = read_in_full(fd, sb->buf + sb->len, want);
369
370 if (got < 0) {
371 if (oldalloc == 0)
372 strbuf_release(sb);
373 else
374 strbuf_setlen(sb, oldlen);
375 return -1;
376 }
377 sb->len += got;
378 if (got < want)
379 break;
380 strbuf_grow(sb, 8192);
381 }
382
383 sb->buf[sb->len] = '\0';
384 return sb->len - oldlen;
385}
386
387ssize_t strbuf_read_once(struct strbuf *sb, int fd, size_t hint)
388{
389 ssize_t cnt;
390
391 strbuf_grow(sb, hint ? hint : 8192);
392 cnt = xread(fd, sb->buf + sb->len, sb->alloc - sb->len - 1);
393 if (cnt > 0)
394 strbuf_setlen(sb, sb->len + cnt);
395 return cnt;
396}
397
398ssize_t strbuf_write(struct strbuf *sb, FILE *f)
399{
400 return sb->len ? fwrite(sb->buf, 1, sb->len, f) : 0;
401}
402
403
404#define STRBUF_MAXLINK (2*PATH_MAX)
405
406int strbuf_readlink(struct strbuf *sb, const char *path, size_t hint)
407{
408 size_t oldalloc = sb->alloc;
409
410 if (hint < 32)
411 hint = 32;
412
413 while (hint < STRBUF_MAXLINK) {
414 int len;
415
416 strbuf_grow(sb, hint);
417 len = readlink(path, sb->buf, hint);
418 if (len < 0) {
419 if (errno != ERANGE)
420 break;
421 } else if (len < hint) {
422 strbuf_setlen(sb, len);
423 return 0;
424 }
425
426 /* .. the buffer was too small - try again */
427 hint *= 2;
428 }
429 if (oldalloc == 0)
430 strbuf_release(sb);
431 return -1;
432}
433
434int strbuf_getcwd(struct strbuf *sb)
435{
436 size_t oldalloc = sb->alloc;
437 size_t guessed_len = 128;
438
439 for (;; guessed_len *= 2) {
440 strbuf_grow(sb, guessed_len);
441 if (getcwd(sb->buf, sb->alloc)) {
442 strbuf_setlen(sb, strlen(sb->buf));
443 return 0;
444 }
445 if (errno != ERANGE)
446 break;
447 }
448 if (oldalloc == 0)
449 strbuf_release(sb);
450 else
451 strbuf_reset(sb);
452 return -1;
453}
454
455#ifdef HAVE_GETDELIM
456int strbuf_getwholeline(struct strbuf *sb, FILE *fp, int term)
457{
458 ssize_t r;
459
460 if (feof(fp))
461 return EOF;
462
463 strbuf_reset(sb);
464
465 /* Translate slopbuf to NULL, as we cannot call realloc on it */
466 if (!sb->alloc)
467 sb->buf = NULL;
468 r = getdelim(&sb->buf, &sb->alloc, term, fp);
469
470 if (r > 0) {
471 sb->len = r;
472 return 0;
473 }
474 assert(r == -1);
475
476 /*
477 * Normally we would have called xrealloc, which will try to free
478 * memory and recover. But we have no way to tell getdelim() to do so.
479 * Worse, we cannot try to recover ENOMEM ourselves, because we have
480 * no idea how many bytes were read by getdelim.
481 *
482 * Dying here is reasonable. It mirrors what xrealloc would do on
483 * catastrophic memory failure. We skip the opportunity to free pack
484 * memory and retry, but that's unlikely to help for a malloc small
485 * enough to hold a single line of input, anyway.
486 */
487 if (errno == ENOMEM)
488 die("Out of memory, getdelim failed");
489
490 /*
491 * Restore strbuf invariants; if getdelim left us with a NULL pointer,
492 * we can just re-init, but otherwise we should make sure that our
493 * length is empty, and that the result is NUL-terminated.
494 */
495 if (!sb->buf)
496 strbuf_init(sb, 0);
497 else
498 strbuf_reset(sb);
499 return EOF;
500}
501#else
502int strbuf_getwholeline(struct strbuf *sb, FILE *fp, int term)
503{
504 int ch;
505
506 if (feof(fp))
507 return EOF;
508
509 strbuf_reset(sb);
510 flockfile(fp);
511 while ((ch = getc_unlocked(fp)) != EOF) {
512 if (!strbuf_avail(sb))
513 strbuf_grow(sb, 1);
514 sb->buf[sb->len++] = ch;
515 if (ch == term)
516 break;
517 }
518 funlockfile(fp);
519 if (ch == EOF && sb->len == 0)
520 return EOF;
521
522 sb->buf[sb->len] = '\0';
523 return 0;
524}
525#endif
526
527static int strbuf_getdelim(struct strbuf *sb, FILE *fp, int term)
528{
529 if (strbuf_getwholeline(sb, fp, term))
530 return EOF;
531 if (sb->buf[sb->len - 1] == term)
532 strbuf_setlen(sb, sb->len - 1);
533 return 0;
534}
535
536int strbuf_getline(struct strbuf *sb, FILE *fp)
537{
538 if (strbuf_getwholeline(sb, fp, '\n'))
539 return EOF;
540 if (sb->buf[sb->len - 1] == '\n') {
541 strbuf_setlen(sb, sb->len - 1);
542 if (sb->len && sb->buf[sb->len - 1] == '\r')
543 strbuf_setlen(sb, sb->len - 1);
544 }
545 return 0;
546}
547
548int strbuf_getline_lf(struct strbuf *sb, FILE *fp)
549{
550 return strbuf_getdelim(sb, fp, '\n');
551}
552
553int strbuf_getline_nul(struct strbuf *sb, FILE *fp)
554{
555 return strbuf_getdelim(sb, fp, '\0');
556}
557
558int strbuf_getwholeline_fd(struct strbuf *sb, int fd, int term)
559{
560 strbuf_reset(sb);
561
562 while (1) {
563 char ch;
564 ssize_t len = xread(fd, &ch, 1);
565 if (len <= 0)
566 return EOF;
567 strbuf_addch(sb, ch);
568 if (ch == term)
569 break;
570 }
571 return 0;
572}
573
574ssize_t strbuf_read_file(struct strbuf *sb, const char *path, size_t hint)
575{
576 int fd;
577 ssize_t len;
578
579 fd = open(path, O_RDONLY);
580 if (fd < 0)
581 return -1;
582 len = strbuf_read(sb, fd, hint);
583 close(fd);
584 if (len < 0)
585 return -1;
586
587 return len;
588}
589
590void strbuf_add_lines(struct strbuf *out, const char *prefix,
591 const char *buf, size_t size)
592{
593 add_lines(out, prefix, NULL, buf, size);
594}
595
596void strbuf_addstr_xml_quoted(struct strbuf *buf, const char *s)
597{
598 while (*s) {
599 size_t len = strcspn(s, "\"<>&");
600 strbuf_add(buf, s, len);
601 s += len;
602 switch (*s) {
603 case '"':
604 strbuf_addstr(buf, """);
605 break;
606 case '<':
607 strbuf_addstr(buf, "<");
608 break;
609 case '>':
610 strbuf_addstr(buf, ">");
611 break;
612 case '&':
613 strbuf_addstr(buf, "&");
614 break;
615 case 0:
616 return;
617 }
618 s++;
619 }
620}
621
622static int is_rfc3986_reserved(char ch)
623{
624 switch (ch) {
625 case '!': case '*': case '\'': case '(': case ')': case ';':
626 case ':': case '@': case '&': case '=': case '+': case '$':
627 case ',': case '/': case '?': case '#': case '[': case ']':
628 return 1;
629 }
630 return 0;
631}
632
633static int is_rfc3986_unreserved(char ch)
634{
635 return isalnum(ch) ||
636 ch == '-' || ch == '_' || ch == '.' || ch == '~';
637}
638
639static void strbuf_add_urlencode(struct strbuf *sb, const char *s, size_t len,
640 int reserved)
641{
642 strbuf_grow(sb, len);
643 while (len--) {
644 char ch = *s++;
645 if (is_rfc3986_unreserved(ch) ||
646 (!reserved && is_rfc3986_reserved(ch)))
647 strbuf_addch(sb, ch);
648 else
649 strbuf_addf(sb, "%%%02x", ch);
650 }
651}
652
653void strbuf_addstr_urlencode(struct strbuf *sb, const char *s,
654 int reserved)
655{
656 strbuf_add_urlencode(sb, s, strlen(s), reserved);
657}
658
659void strbuf_humanise_bytes(struct strbuf *buf, off_t bytes)
660{
661 if (bytes > 1 << 30) {
662 strbuf_addf(buf, "%u.%2.2u GiB",
663 (int)(bytes >> 30),
664 (int)(bytes & ((1 << 30) - 1)) / 10737419);
665 } else if (bytes > 1 << 20) {
666 int x = bytes + 5243; /* for rounding */
667 strbuf_addf(buf, "%u.%2.2u MiB",
668 x >> 20, ((x & ((1 << 20) - 1)) * 100) >> 20);
669 } else if (bytes > 1 << 10) {
670 int x = bytes + 5; /* for rounding */
671 strbuf_addf(buf, "%u.%2.2u KiB",
672 x >> 10, ((x & ((1 << 10) - 1)) * 100) >> 10);
673 } else {
674 strbuf_addf(buf, "%u bytes", (int)bytes);
675 }
676}
677
678void strbuf_add_absolute_path(struct strbuf *sb, const char *path)
679{
680 if (!*path)
681 die("The empty string is not a valid path");
682 if (!is_absolute_path(path)) {
683 struct stat cwd_stat, pwd_stat;
684 size_t orig_len = sb->len;
685 char *cwd = xgetcwd();
686 char *pwd = getenv("PWD");
687 if (pwd && strcmp(pwd, cwd) &&
688 !stat(cwd, &cwd_stat) &&
689 (cwd_stat.st_dev || cwd_stat.st_ino) &&
690 !stat(pwd, &pwd_stat) &&
691 pwd_stat.st_dev == cwd_stat.st_dev &&
692 pwd_stat.st_ino == cwd_stat.st_ino)
693 strbuf_addstr(sb, pwd);
694 else
695 strbuf_addstr(sb, cwd);
696 if (sb->len > orig_len && !is_dir_sep(sb->buf[sb->len - 1]))
697 strbuf_addch(sb, '/');
698 free(cwd);
699 }
700 strbuf_addstr(sb, path);
701}
702
703int printf_ln(const char *fmt, ...)
704{
705 int ret;
706 va_list ap;
707 va_start(ap, fmt);
708 ret = vprintf(fmt, ap);
709 va_end(ap);
710 if (ret < 0 || putchar('\n') == EOF)
711 return -1;
712 return ret + 1;
713}
714
715int fprintf_ln(FILE *fp, const char *fmt, ...)
716{
717 int ret;
718 va_list ap;
719 va_start(ap, fmt);
720 ret = vfprintf(fp, fmt, ap);
721 va_end(ap);
722 if (ret < 0 || putc('\n', fp) == EOF)
723 return -1;
724 return ret + 1;
725}
726
727char *xstrdup_tolower(const char *string)
728{
729 char *result;
730 size_t len, i;
731
732 len = strlen(string);
733 result = xmallocz(len);
734 for (i = 0; i < len; i++)
735 result[i] = tolower(string[i]);
736 result[i] = '\0';
737 return result;
738}
739
740char *xstrvfmt(const char *fmt, va_list ap)
741{
742 struct strbuf buf = STRBUF_INIT;
743 strbuf_vaddf(&buf, fmt, ap);
744 return strbuf_detach(&buf, NULL);
745}
746
747char *xstrfmt(const char *fmt, ...)
748{
749 va_list ap;
750 char *ret;
751
752 va_start(ap, fmt);
753 ret = xstrvfmt(fmt, ap);
754 va_end(ap);
755
756 return ret;
757}
758
759void strbuf_addftime(struct strbuf *sb, const char *fmt, const struct tm *tm)
760{
761 size_t hint = 128;
762 size_t len;
763
764 if (!*fmt)
765 return;
766
767 strbuf_grow(sb, hint);
768 len = strftime(sb->buf + sb->len, sb->alloc - sb->len, fmt, tm);
769
770 if (!len) {
771 /*
772 * strftime reports "0" if it could not fit the result in the buffer.
773 * Unfortunately, it also reports "0" if the requested time string
774 * takes 0 bytes. So our strategy is to munge the format so that the
775 * output contains at least one character, and then drop the extra
776 * character before returning.
777 */
778 struct strbuf munged_fmt = STRBUF_INIT;
779 strbuf_addf(&munged_fmt, "%s ", fmt);
780 while (!len) {
781 hint *= 2;
782 strbuf_grow(sb, hint);
783 len = strftime(sb->buf + sb->len, sb->alloc - sb->len,
784 munged_fmt.buf, tm);
785 }
786 strbuf_release(&munged_fmt);
787 len--; /* drop munged space */
788 }
789 strbuf_setlen(sb, sb->len + len);
790}
791
792void strbuf_add_unique_abbrev(struct strbuf *sb, const unsigned char *sha1,
793 int abbrev_len)
794{
795 int r;
796 strbuf_grow(sb, GIT_SHA1_HEXSZ + 1);
797 r = find_unique_abbrev_r(sb->buf + sb->len, sha1, abbrev_len);
798 strbuf_setlen(sb, sb->len + r);
799}
800
801/*
802 * Returns the length of a line, without trailing spaces.
803 *
804 * If the line ends with newline, it will be removed too.
805 */
806static size_t cleanup(char *line, size_t len)
807{
808 while (len) {
809 unsigned char c = line[len - 1];
810 if (!isspace(c))
811 break;
812 len--;
813 }
814
815 return len;
816}
817
818/*
819 * Remove empty lines from the beginning and end
820 * and also trailing spaces from every line.
821 *
822 * Turn multiple consecutive empty lines between paragraphs
823 * into just one empty line.
824 *
825 * If the input has only empty lines and spaces,
826 * no output will be produced.
827 *
828 * If last line does not have a newline at the end, one is added.
829 *
830 * Enable skip_comments to skip every line starting with comment
831 * character.
832 */
833void strbuf_stripspace(struct strbuf *sb, int skip_comments)
834{
835 int empties = 0;
836 size_t i, j, len, newlen;
837 char *eol;
838
839 /* We may have to add a newline. */
840 strbuf_grow(sb, 1);
841
842 for (i = j = 0; i < sb->len; i += len, j += newlen) {
843 eol = memchr(sb->buf + i, '\n', sb->len - i);
844 len = eol ? eol - (sb->buf + i) + 1 : sb->len - i;
845
846 if (skip_comments && len && sb->buf[i] == comment_line_char) {
847 newlen = 0;
848 continue;
849 }
850 newlen = cleanup(sb->buf + i, len);
851
852 /* Not just an empty line? */
853 if (newlen) {
854 if (empties > 0 && j > 0)
855 sb->buf[j++] = '\n';
856 empties = 0;
857 memmove(sb->buf + j, sb->buf + i, newlen);
858 sb->buf[newlen + j++] = '\n';
859 } else {
860 empties++;
861 }
862 }
863
864 strbuf_setlen(sb, j);
865}