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

J
Junio C Hamano 已提交
4 5 6 7 8 9 10 11 12
int prefixcmp(const char *str, const char *prefix)
{
	for (; ; str++, prefix++)
		if (!*prefix)
			return 0;
		else if (*str != *prefix)
			return (unsigned char)*prefix - (unsigned char)*str;
}

A
Avery Pennarun 已提交
13 14 15 16 17 18 19 20 21
int suffixcmp(const char *str, const char *suffix)
{
	int len = strlen(str), suflen = strlen(suffix);
	if (len < suflen)
		return -1;
	else
		return strcmp(str + len - suflen, suffix);
}

22 23 24 25 26 27 28
/*
 * Used as the default ->buf value, so that people can always assume
 * buf is non NULL and ->buf is NUL terminated even for a freshly
 * initialized strbuf.
 */
char strbuf_slopbuf[1];

29 30
void strbuf_init(struct strbuf *sb, size_t hint)
{
31 32
	sb->alloc = sb->len = 0;
	sb->buf = strbuf_slopbuf;
33
	if (hint) {
34
		strbuf_grow(sb, hint);
35 36
		sb->buf[0] = '\0';
	}
37 38
}

39 40
void strbuf_release(struct strbuf *sb)
{
41 42 43 44
	if (sb->alloc) {
		free(sb->buf);
		strbuf_init(sb, 0);
	}
45 46
}

47
char *strbuf_detach(struct strbuf *sb, size_t *sz)
48
{
49 50 51
	char *res = sb->alloc ? sb->buf : NULL;
	if (sz)
		*sz = sb->len;
52
	strbuf_init(sb, 0);
53 54 55
	return res;
}

56 57 58 59 60 61 62 63 64 65 66 67
void strbuf_attach(struct strbuf *sb, void *buf, size_t len, size_t alloc)
{
	strbuf_release(sb);
	sb->buf   = buf;
	sb->len   = len;
	sb->alloc = alloc;
	strbuf_grow(sb, 0);
	sb->buf[sb->len] = '\0';
}

void strbuf_grow(struct strbuf *sb, size_t extra)
{
68 69
	if (sb->len + extra + 1 <= sb->len)
		die("you want to use way too much memory");
70 71
	if (!sb->alloc)
		sb->buf = NULL;
72 73 74
	ALLOC_GROW(sb->buf, sb->len + extra + 1, sb->alloc);
}

75 76 77 78 79 80 81 82 83 84 85 86
void strbuf_trim(struct strbuf *sb)
{
	char *b = sb->buf;
	while (sb->len > 0 && isspace((unsigned char)sb->buf[sb->len - 1]))
		sb->len--;
	while (sb->len > 0 && isspace(*b)) {
		b++;
		sb->len--;
	}
	memmove(sb->buf, b, sb->len);
	sb->buf[sb->len] = '\0';
}
87 88 89 90 91 92 93
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';
}

94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
void strbuf_ltrim(struct strbuf *sb)
{
	char *b = sb->buf;
	while (sb->len > 0 && isspace(*b)) {
		b++;
		sb->len--;
	}
	memmove(sb->buf, b, sb->len);
	sb->buf[sb->len] = '\0';
}

struct strbuf **strbuf_split(const struct strbuf *sb, int delim)
{
	int alloc = 2, pos = 0;
	char *n, *p;
	struct strbuf **ret;
	struct strbuf *t;

	ret = xcalloc(alloc, sizeof(struct strbuf *));
	p = n = sb->buf;
	while (n < sb->buf + sb->len) {
		int len;
		n = memchr(n, delim, sb->len - (n - sb->buf));
		if (pos + 1 >= alloc) {
			alloc = alloc * 2;
			ret = xrealloc(ret, sizeof(struct strbuf *) * alloc);
		}
		if (!n)
			n = sb->buf + sb->len - 1;
		len = n - p + 1;
		t = xmalloc(sizeof(struct strbuf));
		strbuf_init(t, len);
		strbuf_add(t, p, len);
		ret[pos] = t;
		ret[++pos] = NULL;
		p = ++n;
	}
	return ret;
}

void strbuf_list_free(struct strbuf **sbs)
{
	struct strbuf **s = sbs;

	while (*s) {
		strbuf_release(*s);
		free(*s++);
	}
	free(sbs);
}

145
int strbuf_cmp(const struct strbuf *a, const struct strbuf *b)
P
Pierre Habouzit 已提交
146
{
A
Alex Riesen 已提交
147 148 149 150 151
	int len = a->len < b->len ? a->len: b->len;
	int cmp = memcmp(a->buf, b->buf, len);
	if (cmp)
		return cmp;
	return a->len < b->len ? -1: a->len != b->len;
P
Pierre Habouzit 已提交
152 153
}

154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172
void strbuf_splice(struct strbuf *sb, size_t pos, size_t len,
				   const void *data, size_t dlen)
{
	if (pos + len < pos)
		die("you want to use way too much memory");
	if (pos > sb->len)
		die("`pos' is too far after the end of the buffer");
	if (pos + len > sb->len)
		die("`pos + len' is too far after the end of the buffer");

	if (dlen >= len)
		strbuf_grow(sb, dlen - len);
	memmove(sb->buf + pos + dlen,
			sb->buf + pos + len,
			sb->len - pos - len);
	memcpy(sb->buf + pos, data, dlen);
	strbuf_setlen(sb, sb->len + dlen - len);
}

173 174 175 176 177 178 179 180 181 182
void strbuf_insert(struct strbuf *sb, size_t pos, const void *data, size_t len)
{
	strbuf_splice(sb, pos, 0, data, len);
}

void strbuf_remove(struct strbuf *sb, size_t pos, size_t len)
{
	strbuf_splice(sb, pos, len, NULL, 0);
}

183 184
void strbuf_add(struct strbuf *sb, const void *data, size_t len)
{
185 186 187 188 189
	strbuf_grow(sb, len);
	memcpy(sb->buf + sb->len, data, len);
	strbuf_setlen(sb, sb->len + len);
}

R
René Scharfe 已提交
190 191 192 193 194 195 196
void strbuf_adddup(struct strbuf *sb, size_t pos, size_t len)
{
	strbuf_grow(sb, len);
	memcpy(sb->buf + sb->len, sb->buf + pos, len);
	strbuf_setlen(sb, sb->len + len);
}

197 198
void strbuf_addf(struct strbuf *sb, const char *fmt, ...)
{
199 200 201
	int len;
	va_list ap;

202 203
	if (!strbuf_avail(sb))
		strbuf_grow(sb, 64);
204 205 206
	va_start(ap, fmt);
	len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, ap);
	va_end(ap);
207 208
	if (len < 0)
		die("your vsnprintf is broken");
209
	if (len > strbuf_avail(sb)) {
210 211 212 213
		strbuf_grow(sb, len);
		va_start(ap, fmt);
		len = vsnprintf(sb->buf + sb->len, sb->alloc - sb->len, fmt, ap);
		va_end(ap);
214
		if (len > strbuf_avail(sb)) {
215 216 217 218
			die("this should not happen, your snprintf is broken");
		}
	}
	strbuf_setlen(sb, sb->len + len);
219 220
}

221 222
void strbuf_expand(struct strbuf *sb, const char *format, expand_fn_t fn,
		   void *context)
223 224
{
	for (;;) {
225 226
		const char *percent;
		size_t consumed;
227 228 229 230 231 232 233

		percent = strchrnul(format, '%');
		strbuf_add(sb, format, percent - format);
		if (!*percent)
			break;
		format = percent + 1;

J
Jeff King 已提交
234 235 236 237 238 239
		if (*format == '%') {
			strbuf_addch(sb, '%');
			format++;
			continue;
		}

240 241 242 243
		consumed = fn(sb, format, context);
		if (consumed)
			format += consumed;
		else
244 245 246 247
			strbuf_addch(sb, '%');
	}
}

248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
size_t strbuf_expand_dict_cb(struct strbuf *sb, const char *placeholder,
		void *context)
{
	struct strbuf_expand_dict_entry *e = context;
	size_t len;

	for (; e->placeholder && (len = strlen(e->placeholder)); e++) {
		if (!strncmp(placeholder, e->placeholder, len)) {
			if (e->value)
				strbuf_addstr(sb, e->value);
			return len;
		}
	}
	return 0;
}

264 265 266 267 268 269 270 271 272 273 274
void strbuf_addbuf_percentquote(struct strbuf *dst, const struct strbuf *src)
{
	int i, len = src->len;

	for (i = 0; i < len; i++) {
		if (src->buf[i] == '%')
			strbuf_addch(dst, '%');
		strbuf_addch(dst, src->buf[i]);
	}
}

275 276
size_t strbuf_fread(struct strbuf *sb, size_t size, FILE *f)
{
277
	size_t res;
278
	size_t oldalloc = sb->alloc;
279 280 281

	strbuf_grow(sb, size);
	res = fread(sb->buf + sb->len, 1, size, f);
282
	if (res > 0)
283
		strbuf_setlen(sb, sb->len + res);
284
	else if (oldalloc == 0)
285
		strbuf_release(sb);
286
	return res;
287 288
}

289
ssize_t strbuf_read(struct strbuf *sb, int fd, size_t hint)
290 291
{
	size_t oldlen = sb->len;
292
	size_t oldalloc = sb->alloc;
293

294
	strbuf_grow(sb, hint ? hint : 8192);
295 296 297 298 299
	for (;;) {
		ssize_t cnt;

		cnt = xread(fd, sb->buf + sb->len, sb->alloc - sb->len - 1);
		if (cnt < 0) {
300 301 302 303
			if (oldalloc == 0)
				strbuf_release(sb);
			else
				strbuf_setlen(sb, oldlen);
304 305 306 307 308
			return -1;
		}
		if (!cnt)
			break;
		sb->len += cnt;
309
		strbuf_grow(sb, 8192);
310 311 312 313
	}

	sb->buf[sb->len] = '\0';
	return sb->len - oldlen;
314 315
}

316 317 318 319
#define STRBUF_MAXLINK (2*PATH_MAX)

int strbuf_readlink(struct strbuf *sb, const char *path, size_t hint)
{
320 321
	size_t oldalloc = sb->alloc;

322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
	if (hint < 32)
		hint = 32;

	while (hint < STRBUF_MAXLINK) {
		int len;

		strbuf_grow(sb, hint);
		len = readlink(path, sb->buf, hint);
		if (len < 0) {
			if (errno != ERANGE)
				break;
		} else if (len < hint) {
			strbuf_setlen(sb, len);
			return 0;
		}

		/* .. the buffer was too small - try again */
		hint *= 2;
	}
341 342
	if (oldalloc == 0)
		strbuf_release(sb);
343 344 345
	return -1;
}

346
int strbuf_getwholeline(struct strbuf *sb, FILE *fp, int term)
347
{
348
	int ch;
349 350 351 352

	strbuf_grow(sb, 0);
	if (feof(fp))
		return EOF;
353 354

	strbuf_reset(sb);
355
	while ((ch = fgetc(fp)) != EOF) {
356 357
		strbuf_grow(sb, 1);
		sb->buf[sb->len++] = ch;
358 359
		if (ch == term)
			break;
360
	}
361 362
	if (ch == EOF && sb->len == 0)
		return EOF;
363 364

	sb->buf[sb->len] = '\0';
365
	return 0;
366
}
K
Kristian Høgsberg 已提交
367

368 369 370 371 372 373 374 375 376
int strbuf_getline(struct strbuf *sb, FILE *fp, int term)
{
	if (strbuf_getwholeline(sb, fp, term))
		return EOF;
	if (sb->buf[sb->len-1] == term)
		strbuf_setlen(sb, sb->len-1);
	return 0;
}

377
int strbuf_read_file(struct strbuf *sb, const char *path, size_t hint)
K
Kristian Høgsberg 已提交
378 379 380 381 382 383
{
	int fd, len;

	fd = open(path, O_RDONLY);
	if (fd < 0)
		return -1;
384
	len = strbuf_read(sb, fd, hint);
K
Kristian Høgsberg 已提交
385 386 387 388 389 390
	close(fd);
	if (len < 0)
		return -1;

	return len;
}
391 392 393 394 395 396 397 398 399

int strbuf_branchname(struct strbuf *sb, const char *name)
{
	int len = strlen(name);
	if (interpret_branch_name(name, sb) == len)
		return 0;
	strbuf_add(sb, name, len);
	return len;
}
400 401 402 403 404 405 406

int strbuf_check_branch_ref(struct strbuf *sb, const char *name)
{
	strbuf_branchname(sb, name);
	strbuf_splice(sb, 0, 0, "refs/heads/", 11);
	return check_ref_format(sb->buf);
}