sha1_file.c 57.1 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*
 * GIT - The information manager from hell
 *
 * Copyright (C) Linus Torvalds, 2005
 *
 * This handles basic git sha1 object files - packing, unpacking,
 * creation etc.
 */
#include "cache.h"
10
#include "delta.h"
11
#include "pack.h"
12 13 14 15
#include "blob.h"
#include "commit.h"
#include "tag.h"
#include "tree.h"
16

17 18 19 20 21 22 23 24
#ifndef O_NOATIME
#if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
#define O_NOATIME 01000000
#else
#define O_NOATIME 0
#endif
#endif

25 26 27 28 29 30
#ifdef NO_C99_FORMAT
#define SZ_FMT "lu"
#else
#define SZ_FMT "zu"
#endif

31
const unsigned char null_sha1[20];
J
Junio C Hamano 已提交
32

33 34
static unsigned int sha1_file_open_flag = O_NOATIME;

35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
signed char hexval_table[256] = {
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 00-07 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 08-0f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 10-17 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 18-1f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 20-27 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 28-2f */
	  0,  1,  2,  3,  4,  5,  6,  7,		/* 30-37 */
	  8,  9, -1, -1, -1, -1, -1, -1,		/* 38-3f */
	 -1, 10, 11, 12, 13, 14, 15, -1,		/* 40-47 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 48-4f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 50-57 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 58-5f */
	 -1, 10, 11, 12, 13, 14, 15, -1,		/* 60-67 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 68-67 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 70-77 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 78-7f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 80-87 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 88-8f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 90-97 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 98-9f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* a0-a7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* a8-af */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* b0-b7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* b8-bf */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* c0-c7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* c8-cf */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* d0-d7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* d8-df */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* e0-e7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* e8-ef */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* f0-f7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* f8-ff */
};
69 70 71 72 73 74 75 76 77 78 79 80 81 82

int get_sha1_hex(const char *hex, unsigned char *sha1)
{
	int i;
	for (i = 0; i < 20; i++) {
		unsigned int val = (hexval(hex[0]) << 4) | hexval(hex[1]);
		if (val & ~0xff)
			return -1;
		*sha1++ = val;
		hex += 2;
	}
	return 0;
}

83 84 85
int safe_create_leading_directories(char *path)
{
	char *pos = path;
86 87
	struct stat st;

88 89
	if (*pos == '/')
		pos++;
90 91 92 93 94 95

	while (pos) {
		pos = strchr(pos, '/');
		if (!pos)
			break;
		*pos = 0;
96 97 98
		if (!stat(path, &st)) {
			/* path exists */
			if (!S_ISDIR(st.st_mode)) {
99
				*pos = '/';
100
				return -3;
101
			}
102
		}
103 104 105 106
		else if (mkdir(path, 0777)) {
			*pos = '/';
			return -1;
		}
107 108 109 110
		else if (adjust_shared_perm(path)) {
			*pos = '/';
			return -2;
		}
111 112 113 114
		*pos++ = '/';
	}
	return 0;
}
115

116 117
char * sha1_to_hex(const unsigned char *sha1)
{
L
Linus Torvalds 已提交
118 119
	static int bufno;
	static char hexbuffer[4][50];
120
	static const char hex[] = "0123456789abcdef";
L
Linus Torvalds 已提交
121
	char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
122 123 124 125 126 127 128
	int i;

	for (i = 0; i < 20; i++) {
		unsigned int val = *sha1++;
		*buf++ = hex[val >> 4];
		*buf++ = hex[val & 0xf];
	}
129 130
	*buf = '\0';

131 132 133
	return buffer;
}

134 135 136 137 138 139 140 141 142 143 144 145
static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
{
	int i;
	for (i = 0; i < 20; i++) {
		static char hex[] = "0123456789abcdef";
		unsigned int val = sha1[i];
		char *pos = pathbuf + i*2 + (i > 0);
		*pos++ = hex[val >> 4];
		*pos = hex[val & 0xf];
	}
}

146 147
/*
 * NOTE! This returns a statically allocated buffer, so you have to be
148
 * careful about using it. Do a "xstrdup()" if you need to save the
149
 * filename.
150 151 152
 *
 * Also note that this returns the location for creating.  Reading
 * SHA1 file can happen from any alternate directory listed in the
J
Junio C Hamano 已提交
153
 * DB_ENVIRONMENT environment variable if it is not found in
154
 * the primary object database.
155 156 157 158 159 160
 */
char *sha1_file_name(const unsigned char *sha1)
{
	static char *name, *base;

	if (!base) {
J
Junio C Hamano 已提交
161
		const char *sha1_file_directory = get_object_directory();
162
		int len = strlen(sha1_file_directory);
163
		base = xmalloc(len + 60);
164 165 166 167 168 169
		memcpy(base, sha1_file_directory, len);
		memset(base+len, 0, 60);
		base[len] = '/';
		base[len+3] = '/';
		name = base + len + 1;
	}
170
	fill_sha1_path(name, sha1);
171 172 173
	return base;
}

174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223
char *sha1_pack_name(const unsigned char *sha1)
{
	static const char hex[] = "0123456789abcdef";
	static char *name, *base, *buf;
	int i;

	if (!base) {
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
		base = xmalloc(len + 60);
		sprintf(base, "%s/pack/pack-1234567890123456789012345678901234567890.pack", sha1_file_directory);
		name = base + len + 11;
	}

	buf = name;

	for (i = 0; i < 20; i++) {
		unsigned int val = *sha1++;
		*buf++ = hex[val >> 4];
		*buf++ = hex[val & 0xf];
	}
	
	return base;
}

char *sha1_pack_index_name(const unsigned char *sha1)
{
	static const char hex[] = "0123456789abcdef";
	static char *name, *base, *buf;
	int i;

	if (!base) {
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
		base = xmalloc(len + 60);
		sprintf(base, "%s/pack/pack-1234567890123456789012345678901234567890.idx", sha1_file_directory);
		name = base + len + 11;
	}

	buf = name;

	for (i = 0; i < 20; i++) {
		unsigned int val = *sha1++;
		*buf++ = hex[val >> 4];
		*buf++ = hex[val & 0xf];
	}
	
	return base;
}

224 225
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
226

M
Martin Waitz 已提交
227 228
static void read_info_alternates(const char * alternates, int depth);

J
Junio C Hamano 已提交
229 230
/*
 * Prepare alternate object database registry.
231 232 233 234 235
 *
 * The variable alt_odb_list points at the list of struct
 * alternate_object_database.  The elements on this list come from
 * non-empty elements from colon separated ALTERNATE_DB_ENVIRONMENT
 * environment variable, and $GIT_OBJECT_DIRECTORY/info/alternates,
236 237
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
238 239 240 241 242
 * contains "/the/directory/corresponding/to/.git/objects/...", while
 * its name points just after the slash at the end of ".git/objects/"
 * in the example above, and has enough space to hold 40-byte hex
 * SHA1, an extra slash for the first level indirection, and the
 * terminating NUL.
J
Junio C Hamano 已提交
243
 */
M
Martin Waitz 已提交
244
static int link_alt_odb_entry(const char * entry, int len, const char * relative_base, int depth)
245
{
M
Martin Waitz 已提交
246
	struct stat st;
247
	const char *objdir = get_object_directory();
M
Martin Waitz 已提交
248 249 250 251 252
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
	/* 43 = 40-byte + 2 '/' + terminating NUL */
	int pfxlen = len;
	int entlen = pfxlen + 43;
253
	int base_len = -1;
254

M
Martin Waitz 已提交
255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
	if (*entry != '/' && relative_base) {
		/* Relative alt-odb */
		if (base_len < 0)
			base_len = strlen(relative_base) + 1;
		entlen += base_len;
		pfxlen += base_len;
	}
	ent = xmalloc(sizeof(*ent) + entlen);

	if (*entry != '/' && relative_base) {
		memcpy(ent->base, relative_base, base_len - 1);
		ent->base[base_len - 1] = '/';
		memcpy(ent->base + base_len, entry, len);
	}
	else
		memcpy(ent->base, entry, pfxlen);

	ent->name = ent->base + pfxlen + 1;
	ent->base[pfxlen + 3] = '/';
	ent->base[pfxlen] = ent->base[entlen-1] = 0;

	/* Detect cases where alternate disappeared */
	if (stat(ent->base, &st) || !S_ISDIR(st.st_mode)) {
		error("object directory %s does not exist; "
		      "check .git/objects/info/alternates.",
		      ent->base);
		free(ent);
		return -1;
	}

	/* Prevent the common mistake of listing the same
	 * thing twice, or object directory itself.
	 */
	for (alt = alt_odb_list; alt; alt = alt->next) {
		if (!memcmp(ent->base, alt->base, pfxlen)) {
			free(ent);
			return -1;
		}
	}
	if (!memcmp(ent->base, objdir, pfxlen)) {
		free(ent);
		return -1;
	}

	/* add the alternate entry */
	*alt_odb_tail = ent;
	alt_odb_tail = &(ent->next);
	ent->next = NULL;

	/* recursively add alternates */
	read_info_alternates(ent->base, depth + 1);

	ent->base[pfxlen] = '/';

	return 0;
}

static void link_alt_odb_entries(const char *alt, const char *ep, int sep,
				 const char *relative_base, int depth)
{
	const char *cp, *last;

	if (depth > 5) {
		error("%s: ignoring alternate object stores, nesting too deep.",
				relative_base);
		return;
	}

323
	last = alt;
324 325 326 327 328 329 330 331
	while (last < ep) {
		cp = last;
		if (cp < ep && *cp == '#') {
			while (cp < ep && *cp != sep)
				cp++;
			last = cp + 1;
			continue;
		}
M
Martin Waitz 已提交
332 333
		while (cp < ep && *cp != sep)
			cp++;
334
		if (last != cp) {
M
Martin Waitz 已提交
335 336 337 338 339 340
			if ((*last != '/') && depth) {
				error("%s: ignoring relative alternate object store %s",
						relative_base, last);
			} else {
				link_alt_odb_entry(last, cp - last,
						relative_base, depth);
341
			}
342
		}
343
		while (cp < ep && *cp == sep)
344 345
			cp++;
		last = cp;
346
	}
347 348
}

M
Martin Waitz 已提交
349
static void read_info_alternates(const char * relative_base, int depth)
350
{
351
	char *map;
352
	size_t mapsz;
353
	struct stat st;
M
Martin Waitz 已提交
354 355
	char path[PATH_MAX];
	int fd;
356

M
Martin Waitz 已提交
357
	sprintf(path, "%s/info/alternates", relative_base);
358 359 360 361 362
	fd = open(path, O_RDONLY);
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
363
		return;
364
	}
365 366
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
367 368
	close(fd);

369
	link_alt_odb_entries(map, map + mapsz, '\n', relative_base, depth);
M
Martin Waitz 已提交
370

371
	munmap(map, mapsz);
372 373
}

M
Martin Waitz 已提交
374 375
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
376
	const char *alt;
M
Martin Waitz 已提交
377 378 379 380 381 382 383 384 385 386 387 388

	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	if (alt_odb_tail)
		return;
	alt_odb_tail = &alt_odb_list;
	link_alt_odb_entries(alt, alt + strlen(alt), ':', NULL, 0);

	read_info_alternates(get_object_directory(), 0);
}

389 390 391
static char *find_sha1_file(const unsigned char *sha1, struct stat *st)
{
	char *name = sha1_file_name(sha1);
392
	struct alternate_object_database *alt;
393 394 395

	if (!stat(name, st))
		return name;
396
	prepare_alt_odb();
397 398
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
399
		fill_sha1_path(name, sha1);
400 401
		if (!stat(alt->base, st))
			return alt->base;
402 403 404 405
	}
	return NULL;
}

406
static unsigned int pack_used_ctr;
407 408 409 410
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
static size_t peak_pack_mapped;
411
static size_t pack_mapped;
412
struct packed_git *packed_git;
413

414 415 416
void pack_report()
{
	fprintf(stderr,
417 418 419
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
420
		(size_t) getpagesize(),
421 422 423 424 425 426
		packed_git_window_size,
		packed_git_limit);
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
427 428
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
429 430 431 432 433 434
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
		pack_mapped, peak_pack_mapped);
}

435
static int check_packed_git_idx(const char *path,  struct packed_git *p)
436 437
{
	void *idx_map;
438
	struct pack_idx_header *hdr;
439
	size_t idx_size;
440
	uint32_t nr, i, *index;
441
	int fd = open(path, O_RDONLY);
442
	struct stat st;
443

444 445 446 447 448 449
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
450
	idx_size = xsize_t(st.st_size);
451 452 453 454
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
455
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
456 457
	close(fd);

458 459 460 461
	/* a future index format would start with this, as older git
	 * binaries would fail the non-monotonic index check below.
	 * give a nicer warning to the user if we can.
	 */
462 463
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
464
		munmap(idx_map, idx_size);
465 466 467 468
		return error("index file %s is a newer version"
			" and is not supported by this binary"
			" (try upgrading GIT to a newer version)",
			path);
469
	}
470

471
	nr = 0;
472
	index = idx_map;
473
	for (i = 0; i < 256; i++) {
474
		uint32_t n = ntohl(index[i]);
475 476
		if (n < nr) {
			munmap(idx_map, idx_size);
477
			return error("non-monotonic index %s", path);
478
		}
479 480 481 482 483 484 485 486 487 488
		nr = n;
	}

	/*
	 * Total size:
	 *  - 256 index entries 4 bytes each
	 *  - 24-byte entries * nr (20-byte sha1 + 4-byte offset)
	 *  - 20-byte SHA1 of the packfile
	 *  - 20-byte SHA1 file checksum
	 */
489 490
	if (idx_size != 4*256 + nr * 24 + 20 + 20) {
		munmap(idx_map, idx_size);
491
		return error("wrong index file size in %s", path);
492
	}
493

494 495 496
	p->index_version = 1;
	p->index_data = idx_map;
	p->index_size = idx_size;
497 498 499
	return 0;
}

500 501 502 503
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
504
{
505 506 507 508 509 510 511 512
	struct pack_window *w, *w_l;

	for (w_l = NULL, w = p->windows; w; w = w->next) {
		if (!w->inuse_cnt) {
			if (!*lru_w || w->last_used < (*lru_w)->last_used) {
				*lru_p = p;
				*lru_w = w;
				*lru_l = w_l;
513 514
			}
		}
515
		w_l = w;
516
	}
517 518 519 520 521 522 523 524 525 526 527
}

static int unuse_one_window(struct packed_git *current)
{
	struct packed_git *p, *lru_p = NULL;
	struct pack_window *lru_w = NULL, *lru_l = NULL;

	if (current)
		scan_windows(current, &lru_p, &lru_w, &lru_l);
	for (p = packed_git; p; p = p->next)
		scan_windows(p, &lru_p, &lru_w, &lru_l);
528 529 530 531 532 533 534
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
		else {
			lru_p->windows = lru_w->next;
535
			if (!lru_p->windows && lru_p != current) {
536 537 538 539 540
				close(lru_p->pack_fd);
				lru_p->pack_fd = -1;
			}
		}
		free(lru_w);
541
		pack_open_windows--;
542 543 544
		return 1;
	}
	return 0;
545 546
}

547 548 549 550 551 552 553
void release_pack_memory(size_t need)
{
	size_t cur = pack_mapped;
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
		; /* nothing */
}

554
void unuse_pack(struct pack_window **w_cursor)
555
{
556 557 558 559 560
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
561 562
}

563 564 565 566 567
/*
 * Do not call this directly as this leaks p->pack_fd on error return;
 * call open_packed_git() instead.
 */
static int open_packed_git_1(struct packed_git *p)
568
{
569 570 571 572
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
573
	long fd_flag;
574 575 576

	p->pack_fd = open(p->pack_name, O_RDONLY);
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
577
		return -1;
578 579

	/* If we created the struct before we had the pack we lack size. */
580 581
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
582
			return error("packfile %s not a regular file", p->pack_name);
583
		p->pack_size = st.st_size;
584
	} else if (p->pack_size != st.st_size)
585
		return error("packfile %s size changed", p->pack_name);
586

587 588 589 590 591
	/* We leave these file descriptors open with sliding mmap;
	 * there is no point keeping them open across exec(), though.
	 */
	fd_flag = fcntl(p->pack_fd, F_GETFD, 0);
	if (fd_flag < 0)
592
		return error("cannot determine file descriptor flags");
593 594
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
595
		return error("cannot set FD_CLOEXEC");
596

597
	/* Verify we recognize this pack file format. */
598
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
599
		return error("file %s is far too short to be a packfile", p->pack_name);
600
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
601
		return error("file %s is not a GIT packfile", p->pack_name);
602
	if (!pack_version_ok(hdr.hdr_version))
603
		return error("packfile %s is version %u and not supported"
604 605 606 607 608
			" (try upgrading GIT to a newer version)",
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
	if (num_packed_objects(p) != ntohl(hdr.hdr_entries))
609
		return error("packfile %s claims to have %u objects"
610 611 612 613
			" while index size indicates %u objects",
			p->pack_name, ntohl(hdr.hdr_entries),
			num_packed_objects(p));
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
614
		return error("end of packfile %s is unavailable", p->pack_name);
615
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
616
		return error("packfile %s signature is unavailable", p->pack_name);
617
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
618
	if (hashcmp(sha1, idx_sha1))
619 620
		return error("packfile %s does not match index", p->pack_name);
	return 0;
621 622
}

623 624 625 626 627 628 629 630 631 632 633
static int open_packed_git(struct packed_git *p)
{
	if (!open_packed_git_1(p))
		return 0;
	if (p->pack_fd != -1) {
		close(p->pack_fd);
		p->pack_fd = -1;
	}
	return -1;
}

634
static int in_window(struct pack_window *win, off_t offset)
635 636 637 638 639 640 641 642 643 644 645 646
{
	/* We must promise at least 20 bytes (one hash) after the
	 * offset is available from this window, otherwise the offset
	 * is not actually in this window and a different window (which
	 * has that one hash excess) must be used.  This is to support
	 * the object header and delta base parsing routines below.
	 */
	off_t win_off = win->offset;
	return win_off <= offset
		&& (offset + 20) <= (win_off + win->len);
}

647 648
unsigned char* use_pack(struct packed_git *p,
		struct pack_window **w_cursor,
649
		off_t offset,
650
		unsigned int *left)
651
{
652
	struct pack_window *win = *w_cursor;
653

654 655
	if (p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672

	/* Since packfiles end in a hash of their content and its
	 * pointless to ask for an offset into the middle of that
	 * hash, and the in_window function above wouldn't match
	 * don't allow an offset too close to the end of the file.
	 */
	if (offset > (p->pack_size - 20))
		die("offset beyond end of packfile (truncated pack?)");

	if (!win || !in_window(win, offset)) {
		if (win)
			win->inuse_cnt--;
		for (win = p->windows; win; win = win->next) {
			if (in_window(win, offset))
				break;
		}
		if (!win) {
673
			size_t window_align = packed_git_window_size / 2;
674
			off_t len;
675
			win = xcalloc(1, sizeof(*win));
676
			win->offset = (offset / window_align) * window_align;
677 678 679 680
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
681
			pack_mapped += win->len;
682 683
			while (packed_git_limit < pack_mapped
				&& unuse_one_window(p))
684
				; /* nothing */
685
			win->base = xmmap(NULL, win->len,
686 687 688
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
689 690 691
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
692 693 694 695 696 697
			pack_mmap_calls++;
			pack_open_windows++;
			if (pack_mapped > peak_pack_mapped)
				peak_pack_mapped = pack_mapped;
			if (pack_open_windows > peak_pack_open_windows)
				peak_pack_open_windows = pack_open_windows;
698 699 700
			win->next = p->windows;
			p->windows = win;
		}
701
	}
702 703 704 705 706
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
707
	offset -= win->offset;
708
	if (left)
709
		*left = win->len - xsize_t(offset);
710
	return win->base + offset;
711 712
}

713
struct packed_git *add_packed_git(const char *path, int path_len, int local)
714 715
{
	struct stat st;
716
	struct packed_git *p = xmalloc(sizeof(*p) + path_len + 2);
717

718 719 720 721 722 723
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
	path_len -= strlen(".idx");
	if (path_len < 1)
724
		return NULL;
725 726 727 728 729
	memcpy(p->pack_name, path, path_len);
	strcpy(p->pack_name + path_len, ".pack");
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode) ||
	    check_packed_git_idx(path, p)) {
		free(p);
730 731
		return NULL;
	}
732

733 734 735 736 737
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
	p->next = NULL;
738
	p->windows = NULL;
739
	p->pack_fd = -1;
740
	p->pack_local = local;
741
	p->mtime = st.st_mtime;
742 743
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
744 745 746
	return p;
}

747
struct packed_git *parse_pack_index(unsigned char *sha1)
748 749 750 751 752
{
	char *path = sha1_pack_index_name(sha1);
	return parse_pack_index_file(sha1, path);
}

753 754
struct packed_git *parse_pack_index_file(const unsigned char *sha1,
					 const char *idx_path)
755
{
756 757
	const char *path = sha1_pack_name(sha1);
	struct packed_git *p = xmalloc(sizeof(*p) + strlen(path) + 2);
758

759 760
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
761
		return NULL;
762
	}
763 764 765 766

	strcpy(p->pack_name, path);
	p->pack_size = 0;
	p->next = NULL;
767
	p->windows = NULL;
768
	p->pack_fd = -1;
769
	hashcpy(p->sha1, sha1);
770 771 772 773 774 775 776 777 778
	return p;
}

void install_packed_git(struct packed_git *pack)
{
	pack->next = packed_git;
	packed_git = pack;
}

779
static void prepare_packed_git_one(char *objdir, int local)
780 781 782 783 784 785 786 787 788
{
	char path[PATH_MAX];
	int len;
	DIR *dir;
	struct dirent *de;

	sprintf(path, "%s/pack", objdir);
	len = strlen(path);
	dir = opendir(path);
789
	if (!dir) {
J
Junio C Hamano 已提交
790
		if (errno != ENOENT)
791
			error("unable to open object pack directory: %s: %s",
J
Junio C Hamano 已提交
792
			      path, strerror(errno));
793
		return;
794
	}
795 796 797 798 799
	path[len++] = '/';
	while ((de = readdir(dir)) != NULL) {
		int namelen = strlen(de->d_name);
		struct packed_git *p;

800
		if (!has_extension(de->d_name, ".idx"))
801 802
			continue;

803
		/* Don't reopen a pack we already have. */
804
		strcpy(path + len, de->d_name);
805 806 807 808 809 810
		for (p = packed_git; p; p = p->next) {
			if (!memcmp(path, p->pack_name, len + namelen - 4))
				break;
		}
		if (p)
			continue;
811 812 813
		/* See if it really is a valid .idx file with corresponding
		 * .pack file that we can map.
		 */
814
		p = add_packed_git(path, len + namelen, local);
815 816
		if (!p)
			continue;
817
		install_packed_git(p);
818
	}
819
	closedir(dir);
820 821
}

822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875
static int sort_pack(const void *a_, const void *b_)
{
	struct packed_git *a = *((struct packed_git **)a_);
	struct packed_git *b = *((struct packed_git **)b_);
	int st;

	/*
	 * Local packs tend to contain objects specific to our
	 * variant of the project than remote ones.  In addition,
	 * remote ones could be on a network mounted filesystem.
	 * Favor local ones for these reasons.
	 */
	st = a->pack_local - b->pack_local;
	if (st)
		return -st;

	/*
	 * Younger packs tend to contain more recent objects,
	 * and more recent objects tend to get accessed more
	 * often.
	 */
	if (a->mtime < b->mtime)
		return 1;
	else if (a->mtime == b->mtime)
		return 0;
	return -1;
}

static void rearrange_packed_git(void)
{
	struct packed_git **ary, *p;
	int i, n;

	for (n = 0, p = packed_git; p; p = p->next)
		n++;
	if (n < 2)
		return;

	/* prepare an array of packed_git for easier sorting */
	ary = xcalloc(n, sizeof(struct packed_git *));
	for (n = 0, p = packed_git; p; p = p->next)
		ary[n++] = p;

	qsort(ary, n, sizeof(struct packed_git *), sort_pack);

	/* link them back again */
	for (i = 0; i < n - 1; i++)
		ary[i]->next = ary[i + 1];
	ary[n - 1]->next = NULL;
	packed_git = ary[0];

	free(ary);
}

876
static int prepare_packed_git_run_once = 0;
877
void prepare_packed_git(void)
878
{
879
	struct alternate_object_database *alt;
880

881
	if (prepare_packed_git_run_once)
882
		return;
883
	prepare_packed_git_one(get_object_directory(), 1);
884
	prepare_alt_odb();
885
	for (alt = alt_odb_list; alt; alt = alt->next) {
886
		alt->name[-1] = 0;
887
		prepare_packed_git_one(alt->base, 0);
888
		alt->name[-1] = '/';
889
	}
890
	rearrange_packed_git();
891 892 893
	prepare_packed_git_run_once = 1;
}

894
void reprepare_packed_git(void)
895 896 897
{
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
898 899
}

900
int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
901 902
{
	unsigned char real_sha1[20];
903
	hash_sha1_file(map, size, type, real_sha1);
904
	return hashcmp(sha1, real_sha1) ? -1 : 0;
905 906
}

907
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
908 909 910
{
	struct stat st;
	void *map;
911
	int fd;
912 913 914 915 916
	char *filename = find_sha1_file(sha1, &st);

	if (!filename) {
		return NULL;
	}
917

918
	fd = open(filename, O_RDONLY | sha1_file_open_flag);
919
	if (fd < 0) {
920 921 922 923 924 925 926 927 928 929 930
		/* See if it works without O_NOATIME */
		switch (sha1_file_open_flag) {
		default:
			fd = open(filename, O_RDONLY);
			if (fd >= 0)
				break;
		/* Fallthrough */
		case 0:
			return NULL;
		}

931 932 933
		/* If it failed once, it will probably fail again.
		 * Stop using O_NOATIME
		 */
934
		sha1_file_open_flag = 0;
935
	}
936 937
	*size = xsize_t(st.st_size);
	map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
938 939 940 941
	close(fd);
	return map;
}

942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957
int legacy_loose_object(unsigned char *map)
{
	unsigned int word;

	/*
	 * Is it a zlib-compressed buffer? If so, the first byte
	 * must be 0x78 (15-bit window size, deflated), and the
	 * first 16-bit word is evenly divisible by 31
	 */
	word = (map[0] << 8) + map[1];
	if (map[0] == 0x78 && !(word % 31))
		return 1;
	else
		return 0;
}

958
unsigned long unpack_object_header_gently(const unsigned char *buf, unsigned long len, enum object_type *type, unsigned long *sizep)
959
{
960
	unsigned shift;
961 962
	unsigned char c;
	unsigned long size;
963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
		if (len <= used)
			return 0;
		if (sizeof(long) * 8 <= shift)
			return 0;
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

static int unpack_sha1_header(z_stream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
{
	unsigned long size, used;
	static const char valid_loose_object_type[8] = {
		0, /* OBJ_EXT */
		1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
		0, /* "delta" and others are invalid in a loose object */
989
	};
990
	enum object_type type;
991

992 993 994 995 996
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
997 998
	stream->avail_out = bufsiz;

999
	if (legacy_loose_object(map)) {
1000 1001 1002 1003
		inflateInit(stream);
		return inflate(stream, 0);
	}

1004 1005
	used = unpack_object_header_gently(map, mapsize, &type, &size);
	if (!used || !valid_loose_object_type[type])
1006
		return -1;
1007 1008
	map += used;
	mapsize -= used;
1009 1010 1011 1012

	/* Set up the stream for the rest.. */
	stream->next_in = map;
	stream->avail_in = mapsize;
1013
	inflateInit(stream);
1014 1015

	/* And generate the fake traditional header */
1016
	stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1017
					 typename(type), size);
1018
	return 0;
1019 1020
}

1021
static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1022 1023
{
	int bytes = strlen(buffer) + 1;
1024
	unsigned char *buf = xmalloc(1+size);
1025
	unsigned long n;
1026
	int status = Z_OK;
1027

1028 1029 1030 1031 1032
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
		 * expect no more output and set avail_out to zer0,
		 * the input zlib stream may have bytes that express
		 * "this concludes the stream", and we *do* want to
		 * eat that input.
		 *
		 * Otherwise we would not be able to test that we
		 * consumed all the input to reach the expected size;
		 * we also want to check that zlib tells us that all
		 * went well with status == Z_STREAM_END at the end.
		 */
1047 1048
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1049 1050
		while (status == Z_OK)
			status = inflate(stream, Z_FINISH);
1051 1052
	}
	buf[size] = 0;
1053
	if (status == Z_STREAM_END && !stream->avail_in) {
1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064
		inflateEnd(stream);
		return buf;
	}

	if (status < 0)
		error("corrupt loose object '%s'", sha1_to_hex(sha1));
	else if (stream->avail_in)
		error("garbage at end of loose object '%s'",
		      sha1_to_hex(sha1));
	free(buf);
	return NULL;
1065 1066 1067 1068 1069 1070 1071
}

/*
 * We used to just use "sscanf()", but that's actually way
 * too permissive for what we want to check. So do an anal
 * object header parse by hand.
 */
1072
static int parse_sha1_header(const char *hdr, unsigned long *sizep)
1073
{
1074
	char type[10];
1075 1076 1077 1078 1079 1080
	int i;
	unsigned long size;

	/*
	 * The type can be at most ten bytes (including the 
	 * terminating '\0' that we add), and is followed by
1081
	 * a space.
1082
	 */
1083
	i = 0;
1084 1085 1086 1087
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1088 1089
		type[i++] = c;
		if (i >= sizeof(type))
1090 1091
			return -1;
	}
1092
	type[i] = 0;
1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114

	/*
	 * The length must follow immediately, and be in canonical
	 * decimal format (ie "010" is not valid).
	 */
	size = *hdr++ - '0';
	if (size > 9)
		return -1;
	if (size) {
		for (;;) {
			unsigned long c = *hdr - '0';
			if (c > 9)
				break;
			hdr++;
			size = size * 10 + c;
		}
	}
	*sizep = size;

	/*
	 * The length must be followed by a zero byte
	 */
1115
	return *hdr ? -1 : type_from_string(type);
1116 1117
}

1118
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1119
{
1120
	int ret;
1121
	z_stream stream;
1122
	char hdr[8192];
1123

1124
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1125
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1126 1127
		return NULL;

1128
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1129 1130
}

1131
static off_t get_delta_base(struct packed_git *p,
1132
				    struct pack_window **w_curs,
1133
				    off_t *curpos,
1134
				    enum object_type type,
1135
				    off_t delta_obj_offset)
1136
{
1137
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1138
	off_t base_offset;
1139

1140 1141 1142 1143 1144 1145
	/* use_pack() assured us we have [base_info, base_info + 20)
	 * as a range that we can look at without walking off the
	 * end of the mapped window.  Its actually the hash size
	 * that is assured.  An OFS_DELTA longer than the hash size
	 * is stupid, as then a REF_DELTA would be smaller to store.
	 */
1146
	if (type == OBJ_OFS_DELTA) {
1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
			if (!base_offset || base_offset & ~(~0UL >> 7))
				die("offset value overflow for delta base object");
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
		if (base_offset >= delta_obj_offset)
			die("delta base offset out of bound");
1160
		*curpos += used;
1161
	} else if (type == OBJ_REF_DELTA) {
1162 1163 1164 1165 1166
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
		if (!base_offset)
			die("failed to find delta-pack base object %s",
				sha1_to_hex(base_info));
1167
		*curpos += 20;
1168 1169
	} else
		die("I am totally screwed");
1170
	return base_offset;
1171 1172
}

J
Junio C Hamano 已提交
1173
/* forward declaration for a mutually recursive function */
1174
static int packed_object_info(struct packed_git *p, off_t offset,
1175
			      unsigned long *sizep);
J
Junio C Hamano 已提交
1176

N
Nicolas Pitre 已提交
1177
static int packed_delta_info(struct packed_git *p,
1178
			     struct pack_window **w_curs,
1179
			     off_t curpos,
1180
			     enum object_type type,
1181
			     off_t obj_offset,
N
Nicolas Pitre 已提交
1182
			     unsigned long *sizep)
1183
{
1184
	off_t base_offset;
J
Junio C Hamano 已提交
1185

1186 1187
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
	type = packed_object_info(p, base_offset, NULL);
J
Junio C Hamano 已提交
1188

1189 1190 1191 1192 1193 1194 1195
	/* We choose to only get the type of the base object and
	 * ignore potentially corrupt pack file that expects the delta
	 * based on a base with a wrong size.  This saves tons of
	 * inflate() calls.
	 */
	if (sizep) {
		const unsigned char *data;
1196
		unsigned char delta_head[20], *in;
1197 1198 1199 1200 1201 1202 1203 1204
		z_stream stream;
		int st;

		memset(&stream, 0, sizeof(stream));
		stream.next_out = delta_head;
		stream.avail_out = sizeof(delta_head);

		inflateInit(&stream);
1205
		do {
1206
			in = use_pack(p, w_curs, curpos, &stream.avail_in);
1207 1208
			stream.next_in = in;
			st = inflate(&stream, Z_FINISH);
1209
			curpos += stream.next_in - in;
1210 1211
		} while ((st == Z_OK || st == Z_BUF_ERROR)
			&& stream.total_out < sizeof(delta_head));
1212 1213 1214 1215 1216 1217 1218 1219 1220
		inflateEnd(&stream);
		if ((st != Z_STREAM_END) &&
		    stream.total_out != sizeof(delta_head))
			die("delta data unpack-initial failed");

		/* Examine the initial part of the delta to figure out
		 * the result size.
		 */
		data = delta_head;
1221 1222 1223

		/* ignore base size */
		get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1224

1225
		/* Read the result size */
1226
		*sizep = get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
1227
	}
1228 1229

	return type;
1230 1231
}

1232 1233
static int unpack_object_header(struct packed_git *p,
				struct pack_window **w_curs,
1234
				off_t *curpos,
1235
				unsigned long *sizep)
1236
{
1237 1238
	unsigned char *base;
	unsigned int left;
1239
	unsigned long used;
1240
	enum object_type type;
1241

1242 1243
	/* use_pack() assures us we have [base, base + 20) available
	 * as a range that we can look at at.  (Its actually the hash
P
Pavel Roskin 已提交
1244
	 * size that is assured.)  With our object header encoding
1245 1246 1247
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1248 1249
	base = use_pack(p, w_curs, *curpos, &left);
	used = unpack_object_header_gently(base, left, &type, sizep);
1250 1251
	if (!used)
		die("object offset outside of pack file");
1252
	*curpos += used;
1253

1254
	return type;
1255 1256
}

1257
const char *packed_object_info_detail(struct packed_git *p,
1258
				      off_t obj_offset,
1259 1260 1261 1262
				      unsigned long *size,
				      unsigned long *store_size,
				      unsigned int *delta_chain_length,
				      unsigned char *base_sha1)
1263
{
1264
	struct pack_window *w_curs = NULL;
1265 1266
	off_t curpos;
	unsigned long dummy;
N
Nicolas Pitre 已提交
1267
	unsigned char *next_sha1;
1268
	enum object_type type;
1269

N
Nicolas Pitre 已提交
1270
	*delta_chain_length = 0;
1271
	curpos = obj_offset;
1272
	type = unpack_object_header(p, &w_curs, &curpos, size);
N
Nicolas Pitre 已提交
1273 1274

	for (;;) {
1275
		switch (type) {
N
Nicolas Pitre 已提交
1276
		default:
1277
			die("pack %s contains unknown object type %d",
1278
			    p->pack_name, type);
N
Nicolas Pitre 已提交
1279 1280 1281 1282 1283
		case OBJ_COMMIT:
		case OBJ_TREE:
		case OBJ_BLOB:
		case OBJ_TAG:
			*store_size = 0; /* notyet */
1284
			unuse_pack(&w_curs);
1285
			return typename(type);
1286
		case OBJ_OFS_DELTA:
1287
			obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1288
			if (*delta_chain_length == 0) {
1289
				/* TODO: find base_sha1 as pointed by curpos */
1290
				hashclr(base_sha1);
1291 1292 1293
			}
			break;
		case OBJ_REF_DELTA:
1294
			next_sha1 = use_pack(p, &w_curs, curpos, NULL);
N
Nicolas Pitre 已提交
1295 1296
			if (*delta_chain_length == 0)
				hashcpy(base_sha1, next_sha1);
1297
			obj_offset = find_pack_entry_one(next_sha1, p);
N
Nicolas Pitre 已提交
1298 1299 1300
			break;
		}
		(*delta_chain_length)++;
1301
		curpos = obj_offset;
1302
		type = unpack_object_header(p, &w_curs, &curpos, &dummy);
1303 1304 1305
	}
}

1306
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1307
			      unsigned long *sizep)
1308
{
1309
	struct pack_window *w_curs = NULL;
1310 1311
	unsigned long size;
	off_t curpos = obj_offset;
1312
	enum object_type type;
1313

1314
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1315

1316
	switch (type) {
1317 1318
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1319 1320
		type = packed_delta_info(p, &w_curs, curpos,
					 type, obj_offset, sizep);
1321
		break;
1322 1323 1324 1325
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1326 1327
		if (sizep)
			*sizep = size;
1328
		break;
1329
	default:
1330
		die("pack %s contains unknown object type %d",
1331
		    p->pack_name, type);
1332
	}
1333
	unuse_pack(&w_curs);
1334
	return type;
1335 1336
}

1337
static void *unpack_compressed_entry(struct packed_git *p,
1338
				    struct pack_window **w_curs,
1339
				    off_t curpos,
1340
				    unsigned long size)
1341 1342 1343
{
	int st;
	z_stream stream;
1344
	unsigned char *buffer, *in;
1345 1346 1347 1348 1349 1350 1351 1352

	buffer = xmalloc(size + 1);
	buffer[size] = 0;
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
	stream.avail_out = size;

	inflateInit(&stream);
1353
	do {
1354
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1355 1356
		stream.next_in = in;
		st = inflate(&stream, Z_FINISH);
1357
		curpos += stream.next_in - in;
1358
	} while (st == Z_OK || st == Z_BUF_ERROR);
1359 1360 1361 1362 1363 1364 1365 1366 1367
	inflateEnd(&stream);
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1368 1369
#define MAX_DELTA_CACHE (256)

1370
static size_t delta_base_cached;
1371 1372 1373 1374 1375 1376

static struct delta_base_cache_lru_list {
	struct delta_base_cache_lru_list *prev;
	struct delta_base_cache_lru_list *next;
} delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };

1377
static struct delta_base_cache_entry {
1378 1379
	struct delta_base_cache_lru_list lru;
	void *data;
1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391
	struct packed_git *p;
	off_t base_offset;
	unsigned long size;
	enum object_type type;
} delta_base_cache[MAX_DELTA_CACHE];

static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
{
	unsigned long hash;

	hash = (unsigned long)p + (unsigned long)base_offset;
	hash += (hash >> 8) + (hash >> 16);
1392
	return hash % MAX_DELTA_CACHE;
1393 1394
}

1395
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1396
	unsigned long *base_size, enum object_type *type, int keep_cache)
1397
{
1398 1399 1400 1401 1402 1403 1404
	void *ret;
	unsigned long hash = pack_entry_hash(p, base_offset);
	struct delta_base_cache_entry *ent = delta_base_cache + hash;

	ret = ent->data;
	if (ret && ent->p == p && ent->base_offset == base_offset)
		goto found_cache_entry;
1405
	return unpack_entry(p, base_offset, type, base_size);
1406 1407

found_cache_entry:
1408
	if (!keep_cache) {
1409
		ent->data = NULL;
1410 1411
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1412 1413
		delta_base_cached -= ent->size;
	}
1414 1415 1416 1417 1418
	else {
		ret = xmalloc(ent->size + 1);
		memcpy(ret, ent->data, ent->size);
		((char *)ret)[ent->size] = 0;
	}
1419 1420 1421
	*type = ent->type;
	*base_size = ent->size;
	return ret;
1422 1423
}

1424 1425 1426 1427 1428
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
1429 1430
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1431 1432 1433 1434
		delta_base_cached -= ent->size;
	}
}

1435 1436 1437
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
1438
	unsigned long hash = pack_entry_hash(p, base_offset);
1439
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
1440
	struct delta_base_cache_lru_list *lru;
1441

1442 1443
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1444 1445 1446 1447 1448 1449

	for (lru = delta_base_cache_lru.next;
	     delta_base_cached > delta_base_cache_limit
	     && lru != &delta_base_cache_lru;
	     lru = lru->next) {
		struct delta_base_cache_entry *f = (void *)lru;
1450 1451 1452
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
1453 1454 1455 1456 1457 1458 1459
	for (lru = delta_base_cache_lru.next;
	     delta_base_cached > delta_base_cache_limit
	     && lru != &delta_base_cache_lru;
	     lru = lru->next) {
		struct delta_base_cache_entry *f = (void *)lru;
		release_delta_base_cache(f);
	}
1460

1461 1462 1463 1464 1465
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
1466 1467 1468 1469
	ent->lru.next = &delta_base_cache_lru;
	ent->lru.prev = delta_base_cache_lru.prev;
	delta_base_cache_lru.prev->next = &ent->lru;
	delta_base_cache_lru.prev = &ent->lru;
1470 1471
}

1472
static void *unpack_delta_entry(struct packed_git *p,
1473
				struct pack_window **w_curs,
1474
				off_t curpos,
1475
				unsigned long delta_size,
1476
				off_t obj_offset,
1477
				enum object_type *type,
1478
				unsigned long *sizep)
1479
{
1480
	void *delta_data, *result, *base;
1481 1482
	unsigned long base_size;
	off_t base_offset;
N
Nicolas Pitre 已提交
1483

1484
	base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1485
	base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1486
	if (!base)
1487 1488 1489
		die("failed to read delta base object"
		    " at %"PRIuMAX" from %s",
		    (uintmax_t)base_offset, p->pack_name);
1490

1491
	delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1492 1493
	result = patch_delta(base, base_size,
			     delta_data, delta_size,
1494
			     sizep);
1495 1496 1497
	if (!result)
		die("failed to apply delta");
	free(delta_data);
1498
	add_delta_base_cache(p, base_offset, base, base_size, *type);
1499 1500 1501
	return result;
}

1502
void *unpack_entry(struct packed_git *p, off_t obj_offset,
1503
		   enum object_type *type, unsigned long *sizep)
1504
{
1505
	struct pack_window *w_curs = NULL;
1506
	off_t curpos = obj_offset;
1507
	void *data;
1508

1509 1510
	*type = unpack_object_header(p, &w_curs, &curpos, sizep);
	switch (*type) {
1511 1512
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1513 1514
		data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
					  obj_offset, type, sizep);
1515
		break;
1516 1517 1518 1519
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1520
		data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1521
		break;
1522
	default:
1523
		die("unknown object type %i in %s", *type, p->pack_name);
1524
	}
1525
	unuse_pack(&w_curs);
1526
	return data;
1527 1528
}

1529
uint32_t num_packed_objects(const struct packed_git *p)
1530
{
1531
	/* See check_packed_git_idx() */
1532
	return (uint32_t)((p->index_size - 20 - 20 - 4*256) / 24);
1533 1534
}

1535
int nth_packed_object_sha1(const struct packed_git *p, uint32_t n,
1536 1537
			   unsigned char* sha1)
{
1538 1539
	const unsigned char *index = p->index_data;
	index += 4 * 256;
1540
	if (num_packed_objects(p) <= n)
1541
		return -1;
1542
	hashcpy(sha1, index + 24 * n + 4);
1543 1544 1545
	return 0;
}

1546
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
1547
				  struct packed_git *p)
1548
{
1549
	const uint32_t *level1_ofs = p->index_data;
1550 1551
	int hi = ntohl(level1_ofs[*sha1]);
	int lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1552 1553 1554
	const unsigned char *index = p->index_data;

	index += 4 * 256;
1555 1556 1557

	do {
		int mi = (lo + hi) / 2;
1558
		int cmp = hashcmp(index + 24 * mi + 4, sha1);
N
Nicolas Pitre 已提交
1559
		if (!cmp)
1560
			return ntohl(*((uint32_t *)((char *)index + (24 * mi))));
1561 1562 1563 1564 1565 1566 1567 1568
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586
static int matches_pack_name(struct packed_git *p, const char *ig)
{
	const char *last_c, *c;

	if (!strcmp(p->pack_name, ig))
		return 0;

	for (c = p->pack_name, last_c = c; *c;)
		if (*c == '/')
			last_c = ++c;
		else
			++c;
	if (!strcmp(last_c, ig))
		return 0;

	return 1;
}

1587
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e, const char **ignore_packed)
1588 1589
{
	struct packed_git *p;
1590
	off_t offset;
N
Nicolas Pitre 已提交
1591

1592 1593 1594
	prepare_packed_git();

	for (p = packed_git; p; p = p->next) {
1595 1596 1597
		if (ignore_packed) {
			const char **ig;
			for (ig = ignore_packed; *ig; ig++)
1598
				if (!matches_pack_name(p, *ig))
1599 1600 1601 1602
					break;
			if (*ig)
				continue;
		}
N
Nicolas Pitre 已提交
1603 1604
		offset = find_pack_entry_one(sha1, p);
		if (offset) {
1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616
			/*
			 * We are about to tell the caller where they can
			 * locate the requested object.  We better make
			 * sure the packfile is still here and can be
			 * accessed before supplying that answer, as
			 * it may have been deleted since the index
			 * was loaded!
			 */
			if (p->pack_fd == -1 && open_packed_git(p)) {
				error("packfile %s cannot be accessed", p->pack_name);
				continue;
			}
N
Nicolas Pitre 已提交
1617 1618 1619
			e->offset = offset;
			e->p = p;
			hashcpy(e->sha1, sha1);
1620
			return 1;
N
Nicolas Pitre 已提交
1621
		}
1622 1623 1624 1625
	}
	return 0;
}

1626 1627 1628 1629 1630 1631
struct packed_git *find_sha1_pack(const unsigned char *sha1, 
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
1632
		if (find_pack_entry_one(sha1, p))
1633 1634 1635
			return p;
	}
	return NULL;
1636

1637 1638
}

1639
static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
1640
{
1641
	int status;
1642 1643 1644
	unsigned long mapsize, size;
	void *map;
	z_stream stream;
N
Nicolas Pitre 已提交
1645
	char hdr[32];
1646

1647
	map = map_sha1_file(sha1, &mapsize);
1648 1649
	if (!map)
		return error("unable to find %s", sha1_to_hex(sha1));
1650 1651 1652
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
1653
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
1654
		status = error("unable to parse %s header", sha1_to_hex(sha1));
1655 1656
	else if (sizep)
		*sizep = size;
1657 1658 1659 1660 1661
	inflateEnd(&stream);
	munmap(map, mapsize);
	return status;
}

1662
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
1663 1664 1665 1666 1667 1668
{
	struct pack_entry e;

	if (!find_pack_entry(sha1, &e, NULL)) {
		reprepare_packed_git();
		if (!find_pack_entry(sha1, &e, NULL))
1669
			return sha1_loose_object_info(sha1, sizep);
1670
	}
1671
	return packed_object_info(e.p, e.offset, sizep);
1672 1673
}

1674 1675
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
1676 1677 1678
{
	struct pack_entry e;

1679
	if (!find_pack_entry(sha1, &e, NULL))
1680
		return NULL;
1681
	else
1682
		return cache_or_unpack_entry(e.p, e.offset, size, type, 1);
1683 1684
}

1685 1686 1687 1688 1689 1690 1691 1692
/*
 * This is meant to hold a *small* number of objects that you would
 * want read_sha1_file() to be able to return, but yet you do not want
 * to write them into the object store (e.g. a browse-only
 * application).
 */
static struct cached_object {
	unsigned char sha1[20];
1693
	enum object_type type;
1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710
	void *buf;
	unsigned long size;
} *cached_objects;
static int cached_object_nr, cached_object_alloc;

static struct cached_object *find_cached_object(const unsigned char *sha1)
{
	int i;
	struct cached_object *co = cached_objects;

	for (i = 0; i < cached_object_nr; i++, co++) {
		if (!hashcmp(co->sha1, sha1))
			return co;
	}
	return NULL;
}

1711 1712
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
1713 1714 1715
{
	struct cached_object *co;

1716
	hash_sha1_file(buf, len, typename(type), sha1);
1717 1718 1719 1720 1721 1722 1723 1724 1725 1726
	if (has_sha1_file(sha1) || find_cached_object(sha1))
		return 0;
	if (cached_object_alloc <= cached_object_nr) {
		cached_object_alloc = alloc_nr(cached_object_alloc);
		cached_objects = xrealloc(cached_objects,
					  sizeof(*cached_objects) *
					  cached_object_alloc);
	}
	co = &cached_objects[cached_object_nr++];
	co->size = len;
1727
	co->type = type;
J
Junio C Hamano 已提交
1728 1729
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
1730 1731 1732 1733
	hashcpy(co->sha1, sha1);
	return 0;
}

1734 1735
void *read_sha1_file(const unsigned char *sha1, enum object_type *type,
		     unsigned long *size)
1736 1737 1738
{
	unsigned long mapsize;
	void *map, *buf;
1739 1740 1741 1742 1743 1744 1745
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
		buf = xmalloc(co->size + 1);
		memcpy(buf, co->buf, co->size);
		((char*)buf)[co->size] = 0;
1746
		*type = co->type;
1747 1748 1749
		*size = co->size;
		return buf;
	}
1750

1751 1752 1753
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
1754
	map = map_sha1_file(sha1, &mapsize);
1755
	if (map) {
1756
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
1757 1758 1759
		munmap(map, mapsize);
		return buf;
	}
1760
	reprepare_packed_git();
1761
	return read_packed_sha1(sha1, type, size);
1762 1763
}

1764
void *read_object_with_reference(const unsigned char *sha1,
1765
				 const char *required_type_name,
1766 1767
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
1768
{
1769
	enum object_type type, required_type;
1770 1771
	void *buffer;
	unsigned long isize;
1772
	unsigned char actual_sha1[20];
1773

1774
	required_type = type_from_string(required_type_name);
1775
	hashcpy(actual_sha1, sha1);
1776 1777 1778
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
1779

1780
		buffer = read_sha1_file(actual_sha1, &type, &isize);
1781 1782
		if (!buffer)
			return NULL;
1783
		if (type == required_type) {
1784 1785
			*size = isize;
			if (actual_sha1_return)
1786
				hashcpy(actual_sha1_return, actual_sha1);
1787 1788 1789
			return buffer;
		}
		/* Handle references */
1790
		else if (type == OBJ_COMMIT)
1791
			ref_type = "tree ";
1792
		else if (type == OBJ_TAG)
1793 1794 1795 1796 1797 1798
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
1799

1800
		if (memcmp(buffer, ref_type, ref_length) ||
1801
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
1802 1803 1804
			free(buffer);
			return NULL;
		}
1805
		free(buffer);
1806 1807
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
1808 1809 1810
	}
}

N
Nicolas Pitre 已提交
1811
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
1812
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
1813
                                    char *hdr, int *hdrlen)
1814 1815 1816 1817
{
	SHA_CTX c;

	/* Generate the header */
N
Nicolas Pitre 已提交
1818
	*hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
1819 1820 1821 1822 1823 1824 1825 1826

	/* Sha1.. */
	SHA1_Init(&c);
	SHA1_Update(&c, hdr, *hdrlen);
	SHA1_Update(&c, buf, len);
	SHA1_Final(sha1, &c);
}

1827 1828 1829 1830 1831 1832
/*
 * Link the tempfile to the final place, possibly creating the
 * last directory level as you do so.
 *
 * Returns the errno on failure, 0 on success.
 */
1833
static int link_temp_to_file(const char *tmpfile, const char *filename)
1834 1835
{
	int ret;
S
Shawn Pearce 已提交
1836
	char *dir;
1837 1838 1839 1840 1841

	if (!link(tmpfile, filename))
		return 0;

	/*
S
Shawn Pearce 已提交
1842
	 * Try to mkdir the last path component if that failed.
1843 1844 1845 1846 1847 1848
	 *
	 * Re-try the "link()" regardless of whether the mkdir
	 * succeeds, since a race might mean that somebody
	 * else succeeded.
	 */
	ret = errno;
S
Shawn Pearce 已提交
1849 1850 1851
	dir = strrchr(filename, '/');
	if (dir) {
		*dir = 0;
1852
		if (!mkdir(filename, 0777) && adjust_shared_perm(filename)) {
1853
			*dir = '/';
S
Shawn Pearce 已提交
1854
			return -2;
1855
		}
S
Shawn Pearce 已提交
1856 1857 1858 1859
		*dir = '/';
		if (!link(tmpfile, filename))
			return 0;
		ret = errno;
1860 1861 1862 1863 1864 1865 1866
	}
	return ret;
}

/*
 * Move the just written object into its final resting place
 */
1867
int move_temp_to_file(const char *tmpfile, const char *filename)
1868 1869
{
	int ret = link_temp_to_file(tmpfile, filename);
1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883

	/*
	 * Coda hack - coda doesn't like cross-directory links,
	 * so we fall back to a rename, which will mean that it
	 * won't be able to check collisions, but that's not a
	 * big deal.
	 *
	 * The same holds for FAT formatted media.
	 *
	 * When this succeeds, we just return 0. We have nothing
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
		if (!rename(tmpfile, filename))
1884
			return 0;
1885
		ret = errno;
1886 1887 1888 1889
	}
	unlink(tmpfile);
	if (ret) {
		if (ret != EEXIST) {
1890
			return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
1891 1892 1893 1894 1895 1896 1897
		}
		/* FIXME!!! Collision check here ? */
	}

	return 0;
}

L
Linus Torvalds 已提交
1898 1899
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
1900
	if (write_in_full(fd, buf, len) < 0)
1901
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
1902 1903 1904
	return 0;
}

1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924
static int write_binary_header(unsigned char *hdr, enum object_type type, unsigned long len)
{
	int hdr_len;
	unsigned char c;

	c = (type << 4) | (len & 15);
	len >>= 4;
	hdr_len = 1;
	while (len) {
		*hdr++ = c | 0x80;
		hdr_len++;
		c = (len & 0x7f);
		len >>= 7;
	}
	*hdr = c;
	return hdr_len;
}

static void setup_object_header(z_stream *stream, const char *type, unsigned long len)
{
N
Nicolas Pitre 已提交
1925
	int obj_type, hdrlen;
1926 1927 1928 1929 1930 1931

	if (use_legacy_headers) {
		while (deflate(stream, 0) == Z_OK)
			/* nothing */;
		return;
	}
1932
	obj_type = type_from_string(type);
N
Nicolas Pitre 已提交
1933 1934 1935 1936
	hdrlen = write_binary_header(stream->next_out, obj_type, len);
	stream->total_out = hdrlen;
	stream->next_out += hdrlen;
	stream->avail_out -= hdrlen;
1937 1938
}

N
Nicolas Pitre 已提交
1939
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
1940 1941
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
1942
	char hdr[32];
R
Rene Scharfe 已提交
1943 1944 1945 1946 1947
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

1948
int write_sha1_file(void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
1949
{
1950
	int size, ret;
1951
	unsigned char *compressed;
1952 1953
	z_stream stream;
	unsigned char sha1[20];
1954
	char *filename;
1955
	static char tmpfile[PATH_MAX];
N
Nicolas Pitre 已提交
1956
	char hdr[32];
1957
	int fd, hdrlen;
1958

1959 1960 1961
	/* Normally if we have it in the pack then we do not bother writing
	 * it out into .git/objects/??/?{38} file.
	 */
R
Rene Scharfe 已提交
1962 1963
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	filename = sha1_file_name(sha1);
1964
	if (returnsha1)
1965
		hashcpy(returnsha1, sha1);
1966 1967
	if (has_sha1_file(sha1))
		return 0;
1968 1969
	fd = open(filename, O_RDONLY);
	if (fd >= 0) {
1970
		/*
1971 1972
		 * FIXME!!! We might do collision checking here, but we'd
		 * need to uncompress the old file and check it. Later.
1973
		 */
1974
		close(fd);
1975 1976 1977
		return 0;
	}

1978
	if (errno != ENOENT) {
1979
		return error("sha1 file %s: %s\n", filename, strerror(errno));
1980 1981 1982
	}

	snprintf(tmpfile, sizeof(tmpfile), "%s/obj_XXXXXX", get_object_directory());
1983

1984 1985
	fd = mkstemp(tmpfile);
	if (fd < 0) {
1986 1987 1988 1989
		if (errno == EPERM)
			return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
		else
			return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
1990 1991
	}

1992 1993
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
1994
	deflateInit(&stream, zlib_compression_level);
1995
	size = 8 + deflateBound(&stream, len+hdrlen);
1996
	compressed = xmalloc(size);
1997 1998 1999 2000

	/* Compress it */
	stream.next_out = compressed;
	stream.avail_out = size;
2001 2002

	/* First header.. */
N
Nicolas Pitre 已提交
2003
	stream.next_in = (unsigned char *)hdr;
2004
	stream.avail_in = hdrlen;
2005
	setup_object_header(&stream, type, len);
2006 2007 2008 2009

	/* Then the data itself.. */
	stream.next_in = buf;
	stream.avail_in = len;
2010 2011 2012 2013 2014 2015 2016 2017
	ret = deflate(&stream, Z_FINISH);
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);

	ret = deflateEnd(&stream);
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);

2018 2019
	size = stream.total_out;

L
Linus Torvalds 已提交
2020 2021
	if (write_buffer(fd, compressed, size) < 0)
		die("unable to write sha1 file");
2022
	fchmod(fd, 0444);
2023
	close(fd);
2024
	free(compressed);
2025

2026
	return move_temp_to_file(tmpfile, filename);
2027
}
2028

L
Linus Torvalds 已提交
2029 2030 2031 2032 2033
/*
 * We need to unpack and recompress the object for writing
 * it out to a different file.
 */
static void *repack_object(const unsigned char *sha1, unsigned long *objsize)
D
Daniel Barkalow 已提交
2034
{
L
Linus Torvalds 已提交
2035
	size_t size;
D
Daniel Barkalow 已提交
2036
	z_stream stream;
L
Linus Torvalds 已提交
2037 2038
	unsigned char *unpacked;
	unsigned long len;
2039
	enum object_type type;
N
Nicolas Pitre 已提交
2040
	char hdr[32];
L
Linus Torvalds 已提交
2041 2042
	int hdrlen;
	void *buf;
2043

2044
	/* need to unpack and recompress it by itself */
2045
	unpacked = read_packed_sha1(sha1, &type, &len);
2046 2047
	if (!unpacked)
		error("cannot read sha1_file for %s", sha1_to_hex(sha1));
D
Daniel Barkalow 已提交
2048

2049
	hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
D
Daniel Barkalow 已提交
2050

L
Linus Torvalds 已提交
2051 2052
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2053
	deflateInit(&stream, zlib_compression_level);
L
Linus Torvalds 已提交
2054 2055
	size = deflateBound(&stream, len + hdrlen);
	buf = xmalloc(size);
D
Daniel Barkalow 已提交
2056

L
Linus Torvalds 已提交
2057 2058 2059
	/* Compress it */
	stream.next_out = buf;
	stream.avail_out = size;
D
Daniel Barkalow 已提交
2060

L
Linus Torvalds 已提交
2061 2062 2063 2064 2065
	/* First header.. */
	stream.next_in = (void *)hdr;
	stream.avail_in = hdrlen;
	while (deflate(&stream, 0) == Z_OK)
		/* nothing */;
2066

L
Linus Torvalds 已提交
2067 2068 2069 2070 2071 2072 2073
	/* Then the data itself.. */
	stream.next_in = unpacked;
	stream.avail_in = len;
	while (deflate(&stream, Z_FINISH) == Z_OK)
		/* nothing */;
	deflateEnd(&stream);
	free(unpacked);
2074

L
Linus Torvalds 已提交
2075 2076 2077 2078 2079 2080 2081 2082
	*objsize = stream.total_out;
	return buf;
}

int write_sha1_to_fd(int fd, const unsigned char *sha1)
{
	int retval;
	unsigned long objsize;
2083
	void *buf = map_sha1_file(sha1, &objsize);
L
Linus Torvalds 已提交
2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094

	if (buf) {
		retval = write_buffer(fd, buf, objsize);
		munmap(buf, objsize);
		return retval;
	}

	buf = repack_object(sha1, &objsize);
	retval = write_buffer(fd, buf, objsize);
	free(buf);
	return retval;
D
Daniel Barkalow 已提交
2095 2096
}

2097 2098
int write_sha1_from_fd(const unsigned char *sha1, int fd, char *buffer,
		       size_t bufsize, size_t *bufposn)
2099
{
2100
	char tmpfile[PATH_MAX];
2101 2102 2103
	int local;
	z_stream stream;
	unsigned char real_sha1[20];
2104
	unsigned char discard[4096];
2105 2106 2107
	int ret;
	SHA_CTX c;

2108
	snprintf(tmpfile, sizeof(tmpfile), "%s/obj_XXXXXX", get_object_directory());
2109

2110
	local = mkstemp(tmpfile);
2111 2112 2113 2114 2115 2116
	if (local < 0) {
		if (errno == EPERM)
			return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
		else
			return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
	}
2117 2118 2119 2120 2121 2122 2123 2124 2125

	memset(&stream, 0, sizeof(stream));

	inflateInit(&stream);

	SHA1_Init(&c);

	do {
		ssize_t size;
2126 2127
		if (*bufposn) {
			stream.avail_in = *bufposn;
P
Pavel Roskin 已提交
2128
			stream.next_in = (unsigned char *) buffer;
2129 2130 2131 2132 2133 2134 2135
			do {
				stream.next_out = discard;
				stream.avail_out = sizeof(discard);
				ret = inflate(&stream, Z_SYNC_FLUSH);
				SHA1_Update(&c, discard, sizeof(discard) -
					    stream.avail_out);
			} while (stream.avail_in && ret == Z_OK);
L
Linus Torvalds 已提交
2136 2137
			if (write_buffer(local, buffer, *bufposn - stream.avail_in) < 0)
				die("unable to write sha1 file");
2138 2139 2140 2141 2142 2143
			memmove(buffer, buffer + *bufposn - stream.avail_in,
				stream.avail_in);
			*bufposn = stream.avail_in;
			if (ret != Z_OK)
				break;
		}
2144
		size = xread(fd, buffer + *bufposn, bufsize - *bufposn);
2145 2146
		if (size <= 0) {
			close(local);
2147
			unlink(tmpfile);
2148 2149 2150 2151 2152
			if (!size)
				return error("Connection closed?");
			perror("Reading from connection");
			return -1;
		}
2153 2154
		*bufposn += size;
	} while (1);
2155 2156 2157 2158 2159
	inflateEnd(&stream);

	close(local);
	SHA1_Final(real_sha1, &c);
	if (ret != Z_STREAM_END) {
2160
		unlink(tmpfile);
2161 2162
		return error("File %s corrupted", sha1_to_hex(sha1));
	}
2163
	if (hashcmp(sha1, real_sha1)) {
2164
		unlink(tmpfile);
2165
		return error("File %s has bad hash", sha1_to_hex(sha1));
2166
	}
2167 2168

	return move_temp_to_file(tmpfile, sha1_file_name(sha1));
2169 2170
}

2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

int has_pack_file(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_name(sha1), &st))
		return 0;
	return 1;
}

2187
int has_sha1_pack(const unsigned char *sha1, const char **ignore_packed)
2188 2189
{
	struct pack_entry e;
2190
	return find_pack_entry(sha1, &e, ignore_packed);
2191 2192
}

2193 2194 2195
int has_sha1_file(const unsigned char *sha1)
{
	struct stat st;
2196 2197
	struct pack_entry e;

2198
	if (find_pack_entry(sha1, &e, NULL))
2199
		return 1;
2200
	return find_sha1_file(sha1, &st) ? 1 : 0;
2201
}
J
Junio C Hamano 已提交
2202

2203 2204
/*
 * reads from fd as long as possible into a supplied buffer of size bytes.
2205
 * If necessary the buffer's size is increased using realloc()
2206 2207 2208 2209 2210 2211 2212
 *
 * returns 0 if anything went fine and -1 otherwise
 *
 * NOTE: both buf and size may change, but even when -1 is returned
 * you still have to free() it yourself.
 */
int read_pipe(int fd, char** return_buf, unsigned long* return_size)
2213
{
2214 2215 2216
	char* buf = *return_buf;
	unsigned long size = *return_size;
	int iret;
2217
	unsigned long off = 0;
2218

2219
	do {
2220
		iret = xread(fd, buf + off, size - off);
2221 2222 2223 2224
		if (iret > 0) {
			off += iret;
			if (off == size) {
				size *= 2;
J
Jonas Fonseca 已提交
2225
				buf = xrealloc(buf, size);
2226 2227 2228
			}
		}
	} while (iret > 0);
2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240

	*return_buf = buf;
	*return_size = off;

	if (iret < 0)
		return -1;
	return 0;
}

int index_pipe(unsigned char *sha1, int fd, const char *type, int write_object)
{
	unsigned long size = 4096;
J
Jonas Fonseca 已提交
2241
	char *buf = xmalloc(size);
2242 2243 2244
	int ret;

	if (read_pipe(fd, &buf, &size)) {
2245 2246 2247
		free(buf);
		return -1;
	}
2248

2249
	if (!type)
2250
		type = blob_type;
2251
	if (write_object)
2252
		ret = write_sha1_file(buf, size, type, sha1);
R
Rene Scharfe 已提交
2253 2254
	else
		ret = hash_sha1_file(buf, size, type, sha1);
2255 2256 2257 2258
	free(buf);
	return ret;
}

2259
int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object,
2260
	     enum object_type type, const char *path)
J
Junio C Hamano 已提交
2261
{
2262
	size_t size = xsize_t(st->st_size);
2263
	void *buf = NULL;
L
Linus Torvalds 已提交
2264
	int ret, re_allocated = 0;
J
Junio C Hamano 已提交
2265 2266

	if (size)
2267
		buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
J
Junio C Hamano 已提交
2268 2269
	close(fd);

2270
	if (!type)
2271
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2272 2273 2274 2275

	/*
	 * Convert blobs to git internal format
	 */
2276
	if ((type == OBJ_BLOB) && S_ISREG(st->st_mode)) {
L
Linus Torvalds 已提交
2277 2278
		unsigned long nsize = size;
		char *nbuf = buf;
2279
		if (convert_to_git(path, &nbuf, &nsize)) {
L
Linus Torvalds 已提交
2280 2281 2282 2283 2284 2285 2286 2287
			if (size)
				munmap(buf, size);
			size = nsize;
			buf = nbuf;
			re_allocated = 1;
		}
	}

2288
	if (write_object)
2289
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
2290
	else
2291
		ret = hash_sha1_file(buf, size, typename(type), sha1);
L
Linus Torvalds 已提交
2292 2293 2294 2295
	if (re_allocated) {
		free(buf);
		return ret;
	}
2296 2297 2298
	if (size)
		munmap(buf, size);
	return ret;
J
Junio C Hamano 已提交
2299
}
2300 2301 2302 2303 2304

int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object)
{
	int fd;
	char *target;
2305
	size_t len;
2306 2307 2308 2309 2310 2311 2312

	switch (st->st_mode & S_IFMT) {
	case S_IFREG:
		fd = open(path, O_RDONLY);
		if (fd < 0)
			return error("open(\"%s\"): %s", path,
				     strerror(errno));
2313
		if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path) < 0)
2314 2315 2316 2317
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
2318 2319 2320
		len = xsize_t(st->st_size);
		target = xmalloc(len + 1);
		if (readlink(path, target, len + 1) != st->st_size) {
2321 2322 2323 2324 2325
			char *errstr = strerror(errno);
			free(target);
			return error("readlink(\"%s\"): %s", path,
			             errstr);
		}
R
Rene Scharfe 已提交
2326
		if (!write_object)
2327 2328
			hash_sha1_file(target, len, blob_type, sha1);
		else if (write_sha1_file(target, len, blob_type, sha1))
2329 2330 2331 2332 2333 2334 2335 2336 2337
			return error("%s: failed to insert into database",
				     path);
		free(target);
		break;
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358

int read_pack_header(int fd, struct pack_header *header)
{
	char *c = (char*)header;
	ssize_t remaining = sizeof(struct pack_header);
	do {
		ssize_t r = xread(fd, c, remaining);
		if (r <= 0)
			/* "eof before pack header was fully read" */
			return PH_ERROR_EOF;
		remaining -= r;
		c += r;
	} while (remaining > 0);
	if (header->hdr_signature != htonl(PACK_SIGNATURE))
		/* "protocol error (pack signature mismatch detected)" */
		return PH_ERROR_PACK_SIGNATURE;
	if (!pack_version_ok(header->hdr_version))
		/* "protocol error (pack version unsupported)" */
		return PH_ERROR_PROTOCOL;
	return 0;
}