strbuf.c 2.7 KB
Newer Older
1
#include "cache.h"
2
#include "strbuf.h"
3

4
void strbuf_init(struct strbuf *sb, size_t hint) {
5
	memset(sb, 0, sizeof(*sb));
6 7
	if (hint)
		strbuf_grow(sb, hint);
8 9
}

10
void strbuf_release(struct strbuf *sb) {
11
	free(sb->buf);
12 13 14 15 16 17 18 19 20 21 22
	memset(sb, 0, sizeof(*sb));
}

void strbuf_reset(struct strbuf *sb) {
	if (sb->len)
		strbuf_setlen(sb, 0);
	sb->eof = 0;
}

char *strbuf_detach(struct strbuf *sb) {
	char *res = sb->buf;
23
	strbuf_init(sb, 0);
24 25 26 27 28 29 30 31 32
	return res;
}

void strbuf_grow(struct strbuf *sb, size_t extra) {
	if (sb->len + extra + 1 <= sb->len)
		die("you want to use way too much memory");
	ALLOC_GROW(sb->buf, sb->len + extra + 1, sb->alloc);
}

33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
void strbuf_rtrim(struct strbuf *sb)
{
	while (sb->len > 0 && isspace((unsigned char)sb->buf[sb->len - 1]))
		sb->len--;
	sb->buf[sb->len] = '\0';
}

void strbuf_insert(struct strbuf *sb, size_t pos, const void *data, size_t len) {
	strbuf_grow(sb, len);
	if (pos >= sb->len) {
		pos = sb->len;
	} else {
		memmove(sb->buf + pos + len, sb->buf + pos, sb->len - pos);
	}
	memcpy(sb->buf + pos, data, len);
	strbuf_setlen(sb, sb->len + len);
}

51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
void strbuf_add(struct strbuf *sb, const void *data, size_t len) {
	strbuf_grow(sb, len);
	memcpy(sb->buf + sb->len, data, len);
	strbuf_setlen(sb, sb->len + len);
}

void strbuf_addf(struct strbuf *sb, const char *fmt, ...) {
	int len;
	va_list ap;

	va_start(ap, fmt);
	len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, ap);
	va_end(ap);
	if (len < 0) {
		len = 0;
	}
67
	if (len > strbuf_avail(sb)) {
68 69 70 71
		strbuf_grow(sb, len);
		va_start(ap, fmt);
		len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, ap);
		va_end(ap);
72
		if (len > strbuf_avail(sb)) {
73 74 75 76
			die("this should not happen, your snprintf is broken");
		}
	}
	strbuf_setlen(sb, sb->len + len);
77 78
}

79 80 81 82 83 84 85
size_t strbuf_fread(struct strbuf *sb, size_t size, FILE *f) {
	size_t res;

	strbuf_grow(sb, size);
	res = fread(sb->buf + sb->len, 1, size, f);
	if (res > 0) {
		strbuf_setlen(sb, sb->len + res);
86
	}
87
	return res;
88 89
}

90
ssize_t strbuf_read(struct strbuf *sb, int fd, size_t hint)
91 92 93
{
	size_t oldlen = sb->len;

94
	strbuf_grow(sb, hint ? hint : 8192);
95 96 97 98 99 100 101 102 103 104 105
	for (;;) {
		ssize_t cnt;

		cnt = xread(fd, sb->buf + sb->len, sb->alloc - sb->len - 1);
		if (cnt < 0) {
			strbuf_setlen(sb, oldlen);
			return -1;
		}
		if (!cnt)
			break;
		sb->len += cnt;
106
		strbuf_grow(sb, 8192);
107 108 109 110
	}

	sb->buf[sb->len] = '\0';
	return sb->len - oldlen;
111 112 113 114 115
}

void read_line(struct strbuf *sb, FILE *fp, int term) {
	int ch;
	if (feof(fp)) {
116
		strbuf_release(sb);
117 118 119
		sb->eof = 1;
		return;
	}
120 121

	strbuf_reset(sb);
122 123 124
	while ((ch = fgetc(fp)) != EOF) {
		if (ch == term)
			break;
125 126
		strbuf_grow(sb, 1);
		sb->buf[sb->len++] = ch;
127
	}
128 129
	if (ch == EOF && sb->len == 0) {
		strbuf_release(sb);
J
Junio C Hamano 已提交
130
		sb->eof = 1;
131 132 133 134
	}

	strbuf_grow(sb, 1);
	sb->buf[sb->len] = '\0';
135
}