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 /* Restore slopbuf that we moved out of the way before */
491 if (!sb->buf)
492 strbuf_init(sb, 0);
493 return EOF;
494}
495#else
496int strbuf_getwholeline(struct strbuf *sb, FILE *fp, int term)
497{
498 int ch;
499
500 if (feof(fp))
501 return EOF;
502
503 strbuf_reset(sb);
504 flockfile(fp);
505 while ((ch = getc_unlocked(fp)) != EOF) {
506 if (!strbuf_avail(sb))
507 strbuf_grow(sb, 1);
508 sb->buf[sb->len++] = ch;
509 if (ch == term)
510 break;
511 }
512 funlockfile(fp);
513 if (ch == EOF && sb->len == 0)
514 return EOF;
515
516 sb->buf[sb->len] = '\0';
517 return 0;
518}
519#endif
520
521int strbuf_getline(struct strbuf *sb, FILE *fp, int term)
522{
523 if (strbuf_getwholeline(sb, fp, term))
524 return EOF;
525 if (sb->buf[sb->len-1] == term)
526 strbuf_setlen(sb, sb->len-1);
527 return 0;
528}
529
530int strbuf_getwholeline_fd(struct strbuf *sb, int fd, int term)
531{
532 strbuf_reset(sb);
533
534 while (1) {
535 char ch;
536 ssize_t len = xread(fd, &ch, 1);
537 if (len <= 0)
538 return EOF;
539 strbuf_addch(sb, ch);
540 if (ch == term)
541 break;
542 }
543 return 0;
544}
545
546ssize_t strbuf_read_file(struct strbuf *sb, const char *path, size_t hint)
547{
548 int fd;
549 ssize_t len;
550
551 fd = open(path, O_RDONLY);
552 if (fd < 0)
553 return -1;
554 len = strbuf_read(sb, fd, hint);
555 close(fd);
556 if (len < 0)
557 return -1;
558
559 return len;
560}
561
562void strbuf_add_lines(struct strbuf *out, const char *prefix,
563 const char *buf, size_t size)
564{
565 add_lines(out, prefix, NULL, buf, size);
566}
567
568void strbuf_addstr_xml_quoted(struct strbuf *buf, const char *s)
569{
570 while (*s) {
571 size_t len = strcspn(s, "\"<>&");
572 strbuf_add(buf, s, len);
573 s += len;
574 switch (*s) {
575 case '"':
576 strbuf_addstr(buf, """);
577 break;
578 case '<':
579 strbuf_addstr(buf, "<");
580 break;
581 case '>':
582 strbuf_addstr(buf, ">");
583 break;
584 case '&':
585 strbuf_addstr(buf, "&");
586 break;
587 case 0:
588 return;
589 }
590 s++;
591 }
592}
593
594static int is_rfc3986_reserved(char ch)
595{
596 switch (ch) {
597 case '!': case '*': case '\'': case '(': case ')': case ';':
598 case ':': case '@': case '&': case '=': case '+': case '$':
599 case ',': case '/': case '?': case '#': case '[': case ']':
600 return 1;
601 }
602 return 0;
603}
604
605static int is_rfc3986_unreserved(char ch)
606{
607 return isalnum(ch) ||
608 ch == '-' || ch == '_' || ch == '.' || ch == '~';
609}
610
611static void strbuf_add_urlencode(struct strbuf *sb, const char *s, size_t len,
612 int reserved)
613{
614 strbuf_grow(sb, len);
615 while (len--) {
616 char ch = *s++;
617 if (is_rfc3986_unreserved(ch) ||
618 (!reserved && is_rfc3986_reserved(ch)))
619 strbuf_addch(sb, ch);
620 else
621 strbuf_addf(sb, "%%%02x", ch);
622 }
623}
624
625void strbuf_addstr_urlencode(struct strbuf *sb, const char *s,
626 int reserved)
627{
628 strbuf_add_urlencode(sb, s, strlen(s), reserved);
629}
630
631void strbuf_humanise_bytes(struct strbuf *buf, off_t bytes)
632{
633 if (bytes > 1 << 30) {
634 strbuf_addf(buf, "%u.%2.2u GiB",
635 (int)(bytes >> 30),
636 (int)(bytes & ((1 << 30) - 1)) / 10737419);
637 } else if (bytes > 1 << 20) {
638 int x = bytes + 5243; /* for rounding */
639 strbuf_addf(buf, "%u.%2.2u MiB",
640 x >> 20, ((x & ((1 << 20) - 1)) * 100) >> 20);
641 } else if (bytes > 1 << 10) {
642 int x = bytes + 5; /* for rounding */
643 strbuf_addf(buf, "%u.%2.2u KiB",
644 x >> 10, ((x & ((1 << 10) - 1)) * 100) >> 10);
645 } else {
646 strbuf_addf(buf, "%u bytes", (int)bytes);
647 }
648}
649
650void strbuf_add_absolute_path(struct strbuf *sb, const char *path)
651{
652 if (!*path)
653 die("The empty string is not a valid path");
654 if (!is_absolute_path(path)) {
655 struct stat cwd_stat, pwd_stat;
656 size_t orig_len = sb->len;
657 char *cwd = xgetcwd();
658 char *pwd = getenv("PWD");
659 if (pwd && strcmp(pwd, cwd) &&
660 !stat(cwd, &cwd_stat) &&
661 (cwd_stat.st_dev || cwd_stat.st_ino) &&
662 !stat(pwd, &pwd_stat) &&
663 pwd_stat.st_dev == cwd_stat.st_dev &&
664 pwd_stat.st_ino == cwd_stat.st_ino)
665 strbuf_addstr(sb, pwd);
666 else
667 strbuf_addstr(sb, cwd);
668 if (sb->len > orig_len && !is_dir_sep(sb->buf[sb->len - 1]))
669 strbuf_addch(sb, '/');
670 free(cwd);
671 }
672 strbuf_addstr(sb, path);
673}
674
675int printf_ln(const char *fmt, ...)
676{
677 int ret;
678 va_list ap;
679 va_start(ap, fmt);
680 ret = vprintf(fmt, ap);
681 va_end(ap);
682 if (ret < 0 || putchar('\n') == EOF)
683 return -1;
684 return ret + 1;
685}
686
687int fprintf_ln(FILE *fp, const char *fmt, ...)
688{
689 int ret;
690 va_list ap;
691 va_start(ap, fmt);
692 ret = vfprintf(fp, fmt, ap);
693 va_end(ap);
694 if (ret < 0 || putc('\n', fp) == EOF)
695 return -1;
696 return ret + 1;
697}
698
699char *xstrdup_tolower(const char *string)
700{
701 char *result;
702 size_t len, i;
703
704 len = strlen(string);
705 result = xmalloc(len + 1);
706 for (i = 0; i < len; i++)
707 result[i] = tolower(string[i]);
708 result[i] = '\0';
709 return result;
710}
711
712char *xstrvfmt(const char *fmt, va_list ap)
713{
714 struct strbuf buf = STRBUF_INIT;
715 strbuf_vaddf(&buf, fmt, ap);
716 return strbuf_detach(&buf, NULL);
717}
718
719char *xstrfmt(const char *fmt, ...)
720{
721 va_list ap;
722 char *ret;
723
724 va_start(ap, fmt);
725 ret = xstrvfmt(fmt, ap);
726 va_end(ap);
727
728 return ret;
729}
730
731void strbuf_addftime(struct strbuf *sb, const char *fmt, const struct tm *tm)
732{
733 size_t hint = 128;
734 size_t len;
735
736 if (!*fmt)
737 return;
738
739 strbuf_grow(sb, hint);
740 len = strftime(sb->buf + sb->len, sb->alloc - sb->len, fmt, tm);
741
742 if (!len) {
743 /*
744 * strftime reports "0" if it could not fit the result in the buffer.
745 * Unfortunately, it also reports "0" if the requested time string
746 * takes 0 bytes. So our strategy is to munge the format so that the
747 * output contains at least one character, and then drop the extra
748 * character before returning.
749 */
750 struct strbuf munged_fmt = STRBUF_INIT;
751 strbuf_addf(&munged_fmt, "%s ", fmt);
752 while (!len) {
753 hint *= 2;
754 strbuf_grow(sb, hint);
755 len = strftime(sb->buf + sb->len, sb->alloc - sb->len,
756 munged_fmt.buf, tm);
757 }
758 strbuf_release(&munged_fmt);
759 len--; /* drop munged space */
760 }
761 strbuf_setlen(sb, sb->len + len);
762}
763
764void strbuf_add_unique_abbrev(struct strbuf *sb, const unsigned char *sha1,
765 int abbrev_len)
766{
767 int r;
768 strbuf_grow(sb, GIT_SHA1_HEXSZ + 1);
769 r = find_unique_abbrev_r(sb->buf + sb->len, sha1, abbrev_len);
770 strbuf_setlen(sb, sb->len + r);
771}
772
773/*
774 * Returns the length of a line, without trailing spaces.
775 *
776 * If the line ends with newline, it will be removed too.
777 */
778static size_t cleanup(char *line, size_t len)
779{
780 while (len) {
781 unsigned char c = line[len - 1];
782 if (!isspace(c))
783 break;
784 len--;
785 }
786
787 return len;
788}
789
790/*
791 * Remove empty lines from the beginning and end
792 * and also trailing spaces from every line.
793 *
794 * Turn multiple consecutive empty lines between paragraphs
795 * into just one empty line.
796 *
797 * If the input has only empty lines and spaces,
798 * no output will be produced.
799 *
800 * If last line does not have a newline at the end, one is added.
801 *
802 * Enable skip_comments to skip every line starting with comment
803 * character.
804 */
805void strbuf_stripspace(struct strbuf *sb, int skip_comments)
806{
807 int empties = 0;
808 size_t i, j, len, newlen;
809 char *eol;
810
811 /* We may have to add a newline. */
812 strbuf_grow(sb, 1);
813
814 for (i = j = 0; i < sb->len; i += len, j += newlen) {
815 eol = memchr(sb->buf + i, '\n', sb->len - i);
816 len = eol ? eol - (sb->buf + i) + 1 : sb->len - i;
817
818 if (skip_comments && len && sb->buf[i] == comment_line_char) {
819 newlen = 0;
820 continue;
821 }
822 newlen = cleanup(sb->buf + i, len);
823
824 /* Not just an empty line? */
825 if (newlen) {
826 if (empties > 0 && j > 0)
827 sb->buf[j++] = '\n';
828 empties = 0;
829 memmove(sb->buf + j, sb->buf + i, newlen);
830 sb->buf[newlen + j++] = '\n';
831 } else {
832 empties++;
833 }
834 }
835
836 strbuf_setlen(sb, j);
837}