sha1_file.c 59.5 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
#include "refs.h"
17

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

26 27
#ifdef NO_C99_FORMAT
#define SZ_FMT "lu"
28
static unsigned long sz_fmt(size_t s) { return (unsigned long)s; }
29 30
#else
#define SZ_FMT "zu"
31
static size_t sz_fmt(size_t s) { return s; }
32 33
#endif

34
const unsigned char null_sha1[20];
J
Junio C Hamano 已提交
35

36 37
static unsigned int sha1_file_open_flag = O_NOATIME;

38
const signed char hexval_table[256] = {
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 69 70 71
	 -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 */
};
72 73 74 75 76 77 78 79 80 81 82 83 84 85

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;
}

86 87 88
int safe_create_leading_directories(char *path)
{
	char *pos = path;
89 90
	struct stat st;

91
	if (is_absolute_path(path))
92
		pos++;
93 94 95 96 97 98

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

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

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

134 135 136
	return buffer;
}

137 138 139 140 141 142 143 144 145 146 147 148
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];
	}
}

149 150
/*
 * NOTE! This returns a statically allocated buffer, so you have to be
151
 * careful about using it. Do an "xstrdup()" if you need to save the
152
 * filename.
153 154 155
 *
 * 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 已提交
156
 * DB_ENVIRONMENT environment variable if it is not found in
157
 * the primary object database.
158 159 160 161 162 163
 */
char *sha1_file_name(const unsigned char *sha1)
{
	static char *name, *base;

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

177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
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];
	}
J
Junio C Hamano 已提交
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
	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];
	}
J
Junio C Hamano 已提交
223

224 225 226
	return base;
}

227 228
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
229

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

J
Junio C Hamano 已提交
232 233
/*
 * Prepare alternate object database registry.
234 235 236 237 238
 *
 * 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,
239 240
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
241 242 243 244 245
 * 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 已提交
246
 */
M
Martin Waitz 已提交
247
static int link_alt_odb_entry(const char * entry, int len, const char * relative_base, int depth)
248
{
M
Martin Waitz 已提交
249
	struct stat st;
250
	const char *objdir = get_object_directory();
M
Martin Waitz 已提交
251 252 253 254 255
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
	/* 43 = 40-byte + 2 '/' + terminating NUL */
	int pfxlen = len;
	int entlen = pfxlen + 43;
256
	int base_len = -1;
257

258
	if (!is_absolute_path(entry) && relative_base) {
M
Martin Waitz 已提交
259 260 261 262 263 264 265 266
		/* Relative alt-odb */
		if (base_len < 0)
			base_len = strlen(relative_base) + 1;
		entlen += base_len;
		pfxlen += base_len;
	}
	ent = xmalloc(sizeof(*ent) + entlen);

267
	if (!is_absolute_path(entry) && relative_base) {
M
Martin Waitz 已提交
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 323 324 325
		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;
	}

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

M
Martin Waitz 已提交
352
static void read_info_alternates(const char * relative_base, int depth)
353
{
354
	char *map;
355
	size_t mapsz;
356
	struct stat st;
357 358 359 360 361
	const char alt_file_name[] = "info/alternates";
	/* Given that relative_base is no longer than PATH_MAX,
	   ensure that "path" has enough space to append "/", the
	   file name, "info/alternates", and a trailing NUL.  */
	char path[PATH_MAX + 1 + sizeof alt_file_name];
M
Martin Waitz 已提交
362
	int fd;
363

364
	sprintf(path, "%s/%s", relative_base, alt_file_name);
365 366 367 368 369
	fd = open(path, O_RDONLY);
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
370
		return;
371
	}
372 373
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
374 375
	close(fd);

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

378
	munmap(map, mapsz);
379 380
}

M
Martin Waitz 已提交
381 382
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
383
	const char *alt;
M
Martin Waitz 已提交
384

S
Shawn O. Pearce 已提交
385 386 387
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
388 389 390 391 392 393 394 395 396
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

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

	read_info_alternates(get_object_directory(), 0);
}

397 398 399
static char *find_sha1_file(const unsigned char *sha1, struct stat *st)
{
	char *name = sha1_file_name(sha1);
400
	struct alternate_object_database *alt;
401 402 403

	if (!stat(name, st))
		return name;
404
	prepare_alt_odb();
405 406
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
407
		fill_sha1_path(name, sha1);
408 409
		if (!stat(alt->base, st))
			return alt->base;
410 411 412 413
	}
	return NULL;
}

414
static unsigned int pack_used_ctr;
415 416 417 418
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;
419
static size_t pack_mapped;
420
struct packed_git *packed_git;
421

J
Junio C Hamano 已提交
422
void pack_report(void)
423 424
{
	fprintf(stderr,
425 426 427
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
428 429 430
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
431 432 433 434
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
435 436
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
437 438 439
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
440
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
441 442
}

443
static int check_packed_git_idx(const char *path,  struct packed_git *p)
444 445
{
	void *idx_map;
446
	struct pack_idx_header *hdr;
447
	size_t idx_size;
448
	uint32_t version, nr, i, *index;
449
	int fd = open(path, O_RDONLY);
450
	struct stat st;
451

452 453 454 455 456 457
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
458
	idx_size = xsize_t(st.st_size);
459 460 461 462
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
463
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
464 465
	close(fd);

466 467
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
468 469 470 471 472 473 474 475 476 477
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
			return error("index file %s is version %d"
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
478

479
	nr = 0;
480
	index = idx_map;
481 482
	if (version > 1)
		index += 2;  /* skip index header */
483
	for (i = 0; i < 256; i++) {
484
		uint32_t n = ntohl(index[i]);
485 486
		if (n < nr) {
			munmap(idx_map, idx_size);
487
			return error("non-monotonic index %s", path);
488
		}
489 490 491
		nr = n;
	}

492 493 494 495 496 497 498 499 500 501
	if (version == 1) {
		/*
		 * 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
		 */
		if (idx_size != 4*256 + nr * 24 + 20 + 20) {
			munmap(idx_map, idx_size);
502
			return error("wrong index v1 file size in %s", path);
503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
		}
	} else if (version == 2) {
		/*
		 * Minimum size:
		 *  - 8 bytes of header
		 *  - 256 index entries 4 bytes each
		 *  - 20-byte sha1 entry * nr
		 *  - 4-byte crc entry * nr
		 *  - 4-byte offset entry * nr
		 *  - 20-byte SHA1 of the packfile
		 *  - 20-byte SHA1 file checksum
		 * And after the 4-byte offset table might be a
		 * variable sized table containing 8-byte entries
		 * for offsets larger than 2^31.
		 */
		unsigned long min_size = 8 + 4*256 + nr*(20 + 4 + 4) + 20 + 20;
L
Linus Torvalds 已提交
519 520 521 522
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
523
			munmap(idx_map, idx_size);
524
			return error("wrong index v2 file size in %s", path);
525
		}
526 527 528 529 530 531 532 533 534
		if (idx_size != min_size &&
		    /*
		     * make sure we can deal with large pack offsets.
		     * 31-bit signed offset won't be enough, neither
		     * 32-bit unsigned one will be.
		     */
		    (sizeof(off_t) <= 4)) {
			munmap(idx_map, idx_size);
			return error("pack too large for current definition of off_t in %s", path);
535
		}
536
	}
537

538
	p->index_version = version;
539 540
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
541
	p->num_objects = nr;
542 543 544
	return 0;
}

545
int open_pack_index(struct packed_git *p)
546 547 548 549 550 551 552 553 554 555 556 557 558 559
{
	char *idx_name;
	int ret;

	if (p->index_data)
		return 0;

	idx_name = xstrdup(p->pack_name);
	strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
	ret = check_packed_git_idx(idx_name, p);
	free(idx_name);
	return ret;
}

560 561 562 563
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
564
{
565 566 567 568 569 570 571 572
	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;
573 574
			}
		}
575
		w_l = w;
576
	}
577 578
}

579
static int unuse_one_window(struct packed_git *current, int keep_fd)
580 581 582 583 584 585 586 587
{
	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);
588 589 590 591 592 593 594
	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;
595
			if (!lru_p->windows && lru_p->pack_fd != keep_fd) {
596 597 598 599 600
				close(lru_p->pack_fd);
				lru_p->pack_fd = -1;
			}
		}
		free(lru_w);
601
		pack_open_windows--;
602 603 604
		return 1;
	}
	return 0;
605 606
}

607
void release_pack_memory(size_t need, int fd)
608 609
{
	size_t cur = pack_mapped;
610
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL, fd))
611 612 613
		; /* nothing */
}

614
void unuse_pack(struct pack_window **w_cursor)
615
{
616 617 618 619 620
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
621 622
}

623 624 625 626 627
/*
 * 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)
628
{
629 630 631 632
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
633
	long fd_flag;
634

635 636 637
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

638 639
	p->pack_fd = open(p->pack_name, O_RDONLY);
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
640
		return -1;
641 642

	/* If we created the struct before we had the pack we lack size. */
643 644
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
645
			return error("packfile %s not a regular file", p->pack_name);
646
		p->pack_size = st.st_size;
647
	} else if (p->pack_size != st.st_size)
648
		return error("packfile %s size changed", p->pack_name);
649

650 651 652 653 654
	/* 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)
655
		return error("cannot determine file descriptor flags");
656 657
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
658
		return error("cannot set FD_CLOEXEC");
659

660
	/* Verify we recognize this pack file format. */
661
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
662
		return error("file %s is far too short to be a packfile", p->pack_name);
663
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
664
		return error("file %s is not a GIT packfile", p->pack_name);
665
	if (!pack_version_ok(hdr.hdr_version))
666
		return error("packfile %s is version %u and not supported"
667 668 669 670
			" (try upgrading GIT to a newer version)",
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
671
	if (p->num_objects != ntohl(hdr.hdr_entries))
672
		return error("packfile %s claims to have %u objects"
N
Nicolas Pitre 已提交
673 674 675
			     " while index indicates %u objects",
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
676
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
677
		return error("end of packfile %s is unavailable", p->pack_name);
678
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
679
		return error("packfile %s signature is unavailable", p->pack_name);
680
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
681
	if (hashcmp(sha1, idx_sha1))
682 683
		return error("packfile %s does not match index", p->pack_name);
	return 0;
684 685
}

686 687 688 689 690 691 692 693 694 695 696
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;
}

697
static int in_window(struct pack_window *win, off_t offset)
698 699 700 701 702 703 704 705 706 707 708 709
{
	/* 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);
}

710 711
unsigned char* use_pack(struct packed_git *p,
		struct pack_window **w_cursor,
712
		off_t offset,
713
		unsigned int *left)
714
{
715
	struct pack_window *win = *w_cursor;
716

717 718
	if (p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735

	/* 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) {
736
			size_t window_align = packed_git_window_size / 2;
737
			off_t len;
738
			win = xcalloc(1, sizeof(*win));
739
			win->offset = (offset / window_align) * window_align;
740 741 742 743
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
744
			pack_mapped += win->len;
745
			while (packed_git_limit < pack_mapped
746
				&& unuse_one_window(p, p->pack_fd))
747
				; /* nothing */
748
			win->base = xmmap(NULL, win->len,
749 750 751
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
752 753 754
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
755 756 757 758 759 760
			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;
761 762 763
			win->next = p->windows;
			p->windows = win;
		}
764
	}
765 766 767 768 769
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
770
	offset -= win->offset;
771
	if (left)
772
		*left = win->len - xsize_t(offset);
773
	return win->base + offset;
774 775
}

776
struct packed_git *add_packed_git(const char *path, int path_len, int local)
777 778
{
	struct stat st;
779
	struct packed_git *p = xmalloc(sizeof(*p) + path_len + 2);
780

781 782 783 784 785 786
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
	path_len -= strlen(".idx");
	if (path_len < 1)
787
		return NULL;
788 789
	memcpy(p->pack_name, path, path_len);
	strcpy(p->pack_name + path_len, ".pack");
790
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
791
		free(p);
792 793
		return NULL;
	}
794

795 796 797
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
798 799 800 801
	p->index_version = 0;
	p->index_data = NULL;
	p->index_size = 0;
	p->num_objects = 0;
802 803
	p->pack_size = st.st_size;
	p->next = NULL;
804
	p->windows = NULL;
805
	p->pack_fd = -1;
806
	p->pack_local = local;
807
	p->mtime = st.st_mtime;
808 809
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
810 811 812
	return p;
}

813
struct packed_git *parse_pack_index(unsigned char *sha1)
814 815 816 817 818
{
	char *path = sha1_pack_index_name(sha1);
	return parse_pack_index_file(sha1, path);
}

819 820
struct packed_git *parse_pack_index_file(const unsigned char *sha1,
					 const char *idx_path)
821
{
822 823
	const char *path = sha1_pack_name(sha1);
	struct packed_git *p = xmalloc(sizeof(*p) + strlen(path) + 2);
824

825 826
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
827
		return NULL;
828
	}
829 830 831 832

	strcpy(p->pack_name, path);
	p->pack_size = 0;
	p->next = NULL;
833
	p->windows = NULL;
834
	p->pack_fd = -1;
835
	hashcpy(p->sha1, sha1);
836 837 838 839 840 841 842 843 844
	return p;
}

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

845
static void prepare_packed_git_one(char *objdir, int local)
846
{
847 848 849 850
	/* Ensure that this buffer is large enough so that we can
	   append "/pack/" without clobbering the stack even if
	   strlen(objdir) were PATH_MAX.  */
	char path[PATH_MAX + 1 + 4 + 1 + 1];
851 852 853 854 855 856 857
	int len;
	DIR *dir;
	struct dirent *de;

	sprintf(path, "%s/pack", objdir);
	len = strlen(path);
	dir = opendir(path);
858
	if (!dir) {
J
Junio C Hamano 已提交
859
		if (errno != ENOENT)
860
			error("unable to open object pack directory: %s: %s",
J
Junio C Hamano 已提交
861
			      path, strerror(errno));
862
		return;
863
	}
864 865 866 867 868
	path[len++] = '/';
	while ((de = readdir(dir)) != NULL) {
		int namelen = strlen(de->d_name);
		struct packed_git *p;

869
		if (!has_extension(de->d_name, ".idx"))
870 871
			continue;

872 873 874
		if (len + namelen + 1 > sizeof(path))
			continue;

875
		/* Don't reopen a pack we already have. */
876
		strcpy(path + len, de->d_name);
877 878 879 880 881 882
		for (p = packed_git; p; p = p->next) {
			if (!memcmp(path, p->pack_name, len + namelen - 4))
				break;
		}
		if (p)
			continue;
883 884 885
		/* See if it really is a valid .idx file with corresponding
		 * .pack file that we can map.
		 */
886
		p = add_packed_git(path, len + namelen, local);
887 888
		if (!p)
			continue;
889
		install_packed_git(p);
890
	}
891
	closedir(dir);
892 893
}

894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947
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);
}

948
static int prepare_packed_git_run_once = 0;
949
void prepare_packed_git(void)
950
{
951
	struct alternate_object_database *alt;
952

953
	if (prepare_packed_git_run_once)
954
		return;
955
	prepare_packed_git_one(get_object_directory(), 1);
956
	prepare_alt_odb();
957
	for (alt = alt_odb_list; alt; alt = alt->next) {
958
		alt->name[-1] = 0;
959
		prepare_packed_git_one(alt->base, 0);
960
		alt->name[-1] = '/';
961
	}
962
	rearrange_packed_git();
963 964 965
	prepare_packed_git_run_once = 1;
}

966
void reprepare_packed_git(void)
967 968 969
{
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
970 971
}

972
int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
973 974
{
	unsigned char real_sha1[20];
975
	hash_sha1_file(map, size, type, real_sha1);
976
	return hashcmp(sha1, real_sha1) ? -1 : 0;
977 978
}

J
Junio C Hamano 已提交
979
static void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
980 981 982
{
	struct stat st;
	void *map;
983
	int fd;
984 985 986 987 988
	char *filename = find_sha1_file(sha1, &st);

	if (!filename) {
		return NULL;
	}
989

990
	fd = open(filename, O_RDONLY | sha1_file_open_flag);
991
	if (fd < 0) {
992 993 994 995 996 997 998 999 1000 1001 1002
		/* 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;
		}

1003 1004 1005
		/* If it failed once, it will probably fail again.
		 * Stop using O_NOATIME
		 */
1006
		sha1_file_open_flag = 0;
1007
	}
1008 1009
	*size = xsize_t(st.st_size);
	map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1010 1011 1012 1013
	close(fd);
	return map;
}

1014
static int legacy_loose_object(unsigned char *map)
1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029
{
	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;
}

1030
unsigned long unpack_object_header_gently(const unsigned char *buf, unsigned long len, enum object_type *type, unsigned long *sizep)
1031
{
1032
	unsigned shift;
1033 1034
	unsigned char c;
	unsigned long size;
1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060
	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 */
1061
	};
1062
	enum object_type type;
1063

1064 1065 1066 1067 1068
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1069 1070
	stream->avail_out = bufsiz;

1071
	if (legacy_loose_object(map)) {
1072 1073 1074 1075
		inflateInit(stream);
		return inflate(stream, 0);
	}

1076 1077 1078 1079 1080 1081 1082 1083

	/*
	 * There used to be a second loose object header format which
	 * was meant to mimic the in-pack format, allowing for direct
	 * copy of the object data.  This format turned up not to be
	 * really worth it and we don't write it any longer.  But we
	 * can still read it.
	 */
1084 1085
	used = unpack_object_header_gently(map, mapsize, &type, &size);
	if (!used || !valid_loose_object_type[type])
1086
		return -1;
1087 1088
	map += used;
	mapsize -= used;
1089 1090 1091 1092

	/* Set up the stream for the rest.. */
	stream->next_in = map;
	stream->avail_in = mapsize;
1093
	inflateInit(stream);
1094 1095

	/* And generate the fake traditional header */
1096
	stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1097
					 typename(type), size);
1098
	return 0;
1099 1100
}

1101
static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1102 1103
{
	int bytes = strlen(buffer) + 1;
1104
	unsigned char *buf = xmalloc(1+size);
1105
	unsigned long n;
1106
	int status = Z_OK;
1107

1108 1109 1110 1111 1112
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126
	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.
		 */
1127 1128
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1129 1130
		while (status == Z_OK)
			status = inflate(stream, Z_FINISH);
1131 1132
	}
	buf[size] = 0;
1133
	if (status == Z_STREAM_END && !stream->avail_in) {
1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144
		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;
1145 1146 1147 1148 1149 1150 1151
}

/*
 * 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.
 */
1152
static int parse_sha1_header(const char *hdr, unsigned long *sizep)
1153
{
1154
	char type[10];
1155 1156 1157 1158
	int i;
	unsigned long size;

	/*
J
Junio C Hamano 已提交
1159
	 * The type can be at most ten bytes (including the
1160
	 * terminating '\0' that we add), and is followed by
1161
	 * a space.
1162
	 */
1163
	i = 0;
1164 1165 1166 1167
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1168 1169
		type[i++] = c;
		if (i >= sizeof(type))
1170 1171
			return -1;
	}
1172
	type[i] = 0;
1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194

	/*
	 * 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
	 */
1195
	return *hdr ? -1 : type_from_string(type);
1196 1197
}

1198
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1199
{
1200
	int ret;
1201
	z_stream stream;
1202
	char hdr[8192];
1203

1204
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1205
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1206 1207
		return NULL;

1208
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1209 1210
}

N
Nicolas Pitre 已提交
1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247
unsigned long get_size_from_delta(struct packed_git *p,
				  struct pack_window **w_curs,
			          off_t curpos)
{
	const unsigned char *data;
	unsigned char delta_head[20], *in;
	z_stream stream;
	int st;

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

	inflateInit(&stream);
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
		st = inflate(&stream, Z_FINISH);
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
	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;

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

	/* Read the result size */
	return get_delta_hdr_size(&data, delta_head+sizeof(delta_head));
}

1248
static off_t get_delta_base(struct packed_git *p,
1249
				    struct pack_window **w_curs,
1250
				    off_t *curpos,
1251
				    enum object_type type,
1252
				    off_t delta_obj_offset)
1253
{
1254
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1255
	off_t base_offset;
1256

1257 1258 1259 1260 1261 1262
	/* 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.
	 */
1263
	if (type == OBJ_OFS_DELTA) {
1264 1265 1266 1267 1268
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1269
			if (!base_offset || MSB(base_offset, 7))
1270 1271 1272 1273 1274 1275 1276
				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");
1277
		*curpos += used;
1278
	} else if (type == OBJ_REF_DELTA) {
1279 1280 1281 1282 1283
		/* 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));
1284
		*curpos += 20;
1285 1286
	} else
		die("I am totally screwed");
1287
	return base_offset;
1288 1289
}

J
Junio C Hamano 已提交
1290
/* forward declaration for a mutually recursive function */
1291
static int packed_object_info(struct packed_git *p, off_t offset,
1292
			      unsigned long *sizep);
J
Junio C Hamano 已提交
1293

N
Nicolas Pitre 已提交
1294
static int packed_delta_info(struct packed_git *p,
1295
			     struct pack_window **w_curs,
1296
			     off_t curpos,
1297
			     enum object_type type,
1298
			     off_t obj_offset,
N
Nicolas Pitre 已提交
1299
			     unsigned long *sizep)
1300
{
1301
	off_t base_offset;
J
Junio C Hamano 已提交
1302

1303 1304
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
	type = packed_object_info(p, base_offset, NULL);
J
Junio C Hamano 已提交
1305

1306 1307 1308 1309 1310
	/* 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.
	 */
N
Nicolas Pitre 已提交
1311 1312
	if (sizep)
		*sizep = get_size_from_delta(p, w_curs, curpos);
1313 1314

	return type;
1315 1316
}

1317 1318
static int unpack_object_header(struct packed_git *p,
				struct pack_window **w_curs,
1319
				off_t *curpos,
1320
				unsigned long *sizep)
1321
{
1322 1323
	unsigned char *base;
	unsigned int left;
1324
	unsigned long used;
1325
	enum object_type type;
1326

1327 1328
	/* 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 已提交
1329
	 * size that is assured.)  With our object header encoding
1330 1331 1332
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1333 1334
	base = use_pack(p, w_curs, *curpos, &left);
	used = unpack_object_header_gently(base, left, &type, sizep);
1335 1336
	if (!used)
		die("object offset outside of pack file");
1337
	*curpos += used;
1338

1339
	return type;
1340 1341
}

1342
const char *packed_object_info_detail(struct packed_git *p,
1343
				      off_t obj_offset,
1344 1345 1346 1347
				      unsigned long *size,
				      unsigned long *store_size,
				      unsigned int *delta_chain_length,
				      unsigned char *base_sha1)
1348
{
1349
	struct pack_window *w_curs = NULL;
1350 1351
	off_t curpos;
	unsigned long dummy;
N
Nicolas Pitre 已提交
1352
	unsigned char *next_sha1;
1353
	enum object_type type;
1354

N
Nicolas Pitre 已提交
1355
	*delta_chain_length = 0;
1356
	curpos = obj_offset;
1357
	type = unpack_object_header(p, &w_curs, &curpos, size);
N
Nicolas Pitre 已提交
1358 1359

	for (;;) {
1360
		switch (type) {
N
Nicolas Pitre 已提交
1361
		default:
1362
			die("pack %s contains unknown object type %d",
1363
			    p->pack_name, type);
N
Nicolas Pitre 已提交
1364 1365 1366 1367 1368
		case OBJ_COMMIT:
		case OBJ_TREE:
		case OBJ_BLOB:
		case OBJ_TAG:
			*store_size = 0; /* notyet */
1369
			unuse_pack(&w_curs);
1370
			return typename(type);
1371
		case OBJ_OFS_DELTA:
1372
			obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1373
			if (*delta_chain_length == 0) {
1374
				/* TODO: find base_sha1 as pointed by curpos */
1375
				hashclr(base_sha1);
1376 1377 1378
			}
			break;
		case OBJ_REF_DELTA:
1379
			next_sha1 = use_pack(p, &w_curs, curpos, NULL);
N
Nicolas Pitre 已提交
1380 1381
			if (*delta_chain_length == 0)
				hashcpy(base_sha1, next_sha1);
1382
			obj_offset = find_pack_entry_one(next_sha1, p);
N
Nicolas Pitre 已提交
1383 1384 1385
			break;
		}
		(*delta_chain_length)++;
1386
		curpos = obj_offset;
1387
		type = unpack_object_header(p, &w_curs, &curpos, &dummy);
1388 1389 1390
	}
}

1391
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1392
			      unsigned long *sizep)
1393
{
1394
	struct pack_window *w_curs = NULL;
1395 1396
	unsigned long size;
	off_t curpos = obj_offset;
1397
	enum object_type type;
1398

1399
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1400

1401
	switch (type) {
1402 1403
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1404 1405
		type = packed_delta_info(p, &w_curs, curpos,
					 type, obj_offset, sizep);
1406
		break;
1407 1408 1409 1410
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1411 1412
		if (sizep)
			*sizep = size;
1413
		break;
1414
	default:
1415
		die("pack %s contains unknown object type %d",
1416
		    p->pack_name, type);
1417
	}
1418
	unuse_pack(&w_curs);
1419
	return type;
1420 1421
}

1422
static void *unpack_compressed_entry(struct packed_git *p,
1423
				    struct pack_window **w_curs,
1424
				    off_t curpos,
1425
				    unsigned long size)
1426 1427 1428
{
	int st;
	z_stream stream;
1429
	unsigned char *buffer, *in;
1430 1431 1432 1433 1434 1435 1436 1437

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

	inflateInit(&stream);
1438
	do {
1439
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1440 1441
		stream.next_in = in;
		st = inflate(&stream, Z_FINISH);
1442
		curpos += stream.next_in - in;
1443
	} while (st == Z_OK || st == Z_BUF_ERROR);
1444 1445 1446 1447 1448 1449 1450 1451 1452
	inflateEnd(&stream);
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1453 1454
#define MAX_DELTA_CACHE (256)

1455
static size_t delta_base_cached;
1456 1457 1458 1459 1460 1461

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 };

1462
static struct delta_base_cache_entry {
1463 1464
	struct delta_base_cache_lru_list lru;
	void *data;
1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476
	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);
1477
	return hash % MAX_DELTA_CACHE;
1478 1479
}

1480
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1481
	unsigned long *base_size, enum object_type *type, int keep_cache)
1482
{
1483 1484 1485 1486 1487 1488 1489
	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;
1490
	return unpack_entry(p, base_offset, type, base_size);
1491 1492

found_cache_entry:
1493
	if (!keep_cache) {
1494
		ent->data = NULL;
1495 1496
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1497
		delta_base_cached -= ent->size;
P
Pierre Habouzit 已提交
1498 1499
	} else {
		ret = xmemdupz(ent->data, ent->size);
1500
	}
1501 1502 1503
	*type = ent->type;
	*base_size = ent->size;
	return ret;
1504 1505
}

1506 1507 1508 1509 1510
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
1511 1512
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1513 1514 1515 1516
		delta_base_cached -= ent->size;
	}
}

1517 1518 1519
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
1520
	unsigned long hash = pack_entry_hash(p, base_offset);
1521
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
1522
	struct delta_base_cache_lru_list *lru;
1523

1524 1525
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1526 1527 1528 1529 1530 1531

	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;
1532 1533 1534
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
1535 1536 1537 1538 1539 1540 1541
	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);
	}
1542

1543 1544 1545 1546 1547
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
1548 1549 1550 1551
	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;
1552 1553
}

1554
static void *unpack_delta_entry(struct packed_git *p,
1555
				struct pack_window **w_curs,
1556
				off_t curpos,
1557
				unsigned long delta_size,
1558
				off_t obj_offset,
1559
				enum object_type *type,
1560
				unsigned long *sizep)
1561
{
1562
	void *delta_data, *result, *base;
1563 1564
	unsigned long base_size;
	off_t base_offset;
N
Nicolas Pitre 已提交
1565

1566
	base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1567
	base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1568
	if (!base)
1569 1570 1571
		die("failed to read delta base object"
		    " at %"PRIuMAX" from %s",
		    (uintmax_t)base_offset, p->pack_name);
1572

1573
	delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1574 1575 1576 1577
	if (!delta_data)
		die("failed to unpack compressed delta"
		    " at %"PRIuMAX" from %s",
		    (uintmax_t)curpos, p->pack_name);
1578 1579
	result = patch_delta(base, base_size,
			     delta_data, delta_size,
1580
			     sizep);
1581 1582 1583
	if (!result)
		die("failed to apply delta");
	free(delta_data);
1584
	add_delta_base_cache(p, base_offset, base, base_size, *type);
1585 1586 1587
	return result;
}

1588
void *unpack_entry(struct packed_git *p, off_t obj_offset,
1589
		   enum object_type *type, unsigned long *sizep)
1590
{
1591
	struct pack_window *w_curs = NULL;
1592
	off_t curpos = obj_offset;
1593
	void *data;
1594

1595 1596
	*type = unpack_object_header(p, &w_curs, &curpos, sizep);
	switch (*type) {
1597 1598
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1599 1600
		data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
					  obj_offset, type, sizep);
1601
		break;
1602 1603 1604 1605
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1606
		data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1607
		break;
1608
	default:
1609
		die("unknown object type %i in %s", *type, p->pack_name);
1610
	}
1611
	unuse_pack(&w_curs);
1612
	return data;
1613 1614
}

1615
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1616
					    uint32_t n)
1617
{
1618
	const unsigned char *index = p->index_data;
1619 1620 1621 1622 1623
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
1624
	if (n >= p->num_objects)
1625
		return NULL;
1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

static off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
{
	const unsigned char *index = p->index_data;
	index += 4 * 256;
	if (p->index_version == 1) {
		return ntohl(*((uint32_t *)(index + 24 * n)));
	} else {
		uint32_t off;
		index += 8 + p->num_objects * (20 + 4);
		off = ntohl(*((uint32_t *)(index + 4 * n)));
		if (!(off & 0x80000000))
			return off;
		index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
		return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
				   ntohl(*((uint32_t *)(index + 4)));
	}
1651 1652
}

1653
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
1654
				  struct packed_git *p)
1655
{
1656 1657
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
1658
	unsigned hi, lo;
1659

1660 1661 1662 1663 1664 1665
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
1666 1667 1668 1669
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
1670
	index += 4 * 256;
1671 1672
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1673 1674

	do {
1675 1676 1677
		unsigned mi = (lo + hi) / 2;
		unsigned x = (p->index_version > 1) ? (mi * 20) : (mi * 24 + 4);
		int cmp = hashcmp(index + x, sha1);
N
Nicolas Pitre 已提交
1678
		if (!cmp)
1679
			return nth_packed_object_offset(p, mi);
1680 1681 1682 1683 1684 1685 1686 1687
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

1688
int matches_pack_name(struct packed_git *p, const char *name)
1689 1690 1691
{
	const char *last_c, *c;

1692 1693
	if (!strcmp(p->pack_name, name))
		return 1;
1694 1695 1696 1697 1698 1699

	for (c = p->pack_name, last_c = c; *c;)
		if (*c == '/')
			last_c = ++c;
		else
			++c;
1700 1701
	if (!strcmp(last_c, name))
		return 1;
1702

1703
	return 0;
1704 1705
}

1706
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e, const char **ignore_packed)
1707
{
1708
	static struct packed_git *last_found = (void *)1;
1709
	struct packed_git *p;
1710
	off_t offset;
N
Nicolas Pitre 已提交
1711

1712
	prepare_packed_git();
1713 1714 1715
	if (!packed_git)
		return 0;
	p = (last_found == (void *)1) ? packed_git : last_found;
1716

1717
	do {
1718 1719 1720
		if (ignore_packed) {
			const char **ig;
			for (ig = ignore_packed; *ig; ig++)
1721
				if (matches_pack_name(p, *ig))
1722 1723
					break;
			if (*ig)
1724
				goto next;
1725
		}
1726

N
Nicolas Pitre 已提交
1727 1728
		offset = find_pack_entry_one(sha1, p);
		if (offset) {
1729 1730 1731 1732 1733 1734 1735 1736 1737 1738
			/*
			 * 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);
1739
				goto next;
1740
			}
N
Nicolas Pitre 已提交
1741 1742 1743
			e->offset = offset;
			e->p = p;
			hashcpy(e->sha1, sha1);
1744
			last_found = p;
1745
			return 1;
N
Nicolas Pitre 已提交
1746
		}
1747 1748 1749 1750 1751 1752 1753 1754 1755

		next:
		if (p == last_found)
			p = packed_git;
		else
			p = p->next;
		if (p == last_found)
			p = p->next;
	} while (p);
1756 1757 1758
	return 0;
}

J
Junio C Hamano 已提交
1759
struct packed_git *find_sha1_pack(const unsigned char *sha1,
1760 1761 1762 1763 1764
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
1765
		if (find_pack_entry_one(sha1, p))
1766 1767 1768
			return p;
	}
	return NULL;
1769

1770 1771
}

1772
static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
1773
{
1774
	int status;
1775 1776 1777
	unsigned long mapsize, size;
	void *map;
	z_stream stream;
N
Nicolas Pitre 已提交
1778
	char hdr[32];
1779

1780
	map = map_sha1_file(sha1, &mapsize);
1781 1782
	if (!map)
		return error("unable to find %s", sha1_to_hex(sha1));
1783 1784 1785
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
1786
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
1787
		status = error("unable to parse %s header", sha1_to_hex(sha1));
1788 1789
	else if (sizep)
		*sizep = size;
1790 1791 1792 1793 1794
	inflateEnd(&stream);
	munmap(map, mapsize);
	return status;
}

1795
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
1796 1797 1798 1799 1800 1801
{
	struct pack_entry e;

	if (!find_pack_entry(sha1, &e, NULL)) {
		reprepare_packed_git();
		if (!find_pack_entry(sha1, &e, NULL))
1802
			return sha1_loose_object_info(sha1, sizep);
1803
	}
1804
	return packed_object_info(e.p, e.offset, sizep);
1805 1806
}

1807 1808
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
1809 1810 1811
{
	struct pack_entry e;

1812
	if (!find_pack_entry(sha1, &e, NULL))
1813
		return NULL;
1814
	else
1815
		return cache_or_unpack_entry(e.p, e.offset, size, type, 1);
1816 1817
}

1818 1819 1820 1821 1822 1823 1824 1825
/*
 * 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];
1826
	enum object_type type;
1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843
	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;
}

1844 1845
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
1846 1847 1848
{
	struct cached_object *co;

1849
	hash_sha1_file(buf, len, typename(type), sha1);
1850 1851 1852 1853 1854 1855 1856 1857 1858 1859
	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;
1860
	co->type = type;
J
Junio C Hamano 已提交
1861 1862
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
1863 1864 1865 1866
	hashcpy(co->sha1, sha1);
	return 0;
}

1867 1868
void *read_sha1_file(const unsigned char *sha1, enum object_type *type,
		     unsigned long *size)
1869 1870 1871
{
	unsigned long mapsize;
	void *map, *buf;
1872 1873 1874 1875
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
1876
		*type = co->type;
1877
		*size = co->size;
P
Pierre Habouzit 已提交
1878
		return xmemdupz(co->buf, co->size);
1879
	}
1880

1881 1882 1883
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
1884
	map = map_sha1_file(sha1, &mapsize);
1885
	if (map) {
1886
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
1887 1888 1889
		munmap(map, mapsize);
		return buf;
	}
1890
	reprepare_packed_git();
1891
	return read_packed_sha1(sha1, type, size);
1892 1893
}

1894
void *read_object_with_reference(const unsigned char *sha1,
1895
				 const char *required_type_name,
1896 1897
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
1898
{
1899
	enum object_type type, required_type;
1900 1901
	void *buffer;
	unsigned long isize;
1902
	unsigned char actual_sha1[20];
1903

1904
	required_type = type_from_string(required_type_name);
1905
	hashcpy(actual_sha1, sha1);
1906 1907 1908
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
1909

1910
		buffer = read_sha1_file(actual_sha1, &type, &isize);
1911 1912
		if (!buffer)
			return NULL;
1913
		if (type == required_type) {
1914 1915
			*size = isize;
			if (actual_sha1_return)
1916
				hashcpy(actual_sha1_return, actual_sha1);
1917 1918 1919
			return buffer;
		}
		/* Handle references */
1920
		else if (type == OBJ_COMMIT)
1921
			ref_type = "tree ";
1922
		else if (type == OBJ_TAG)
1923 1924 1925 1926 1927 1928
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
1929

1930
		if (memcmp(buffer, ref_type, ref_length) ||
1931
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
1932 1933 1934
			free(buffer);
			return NULL;
		}
1935
		free(buffer);
1936 1937
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
1938 1939 1940
	}
}

N
Nicolas Pitre 已提交
1941
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
1942
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
1943
                                    char *hdr, int *hdrlen)
1944 1945 1946 1947
{
	SHA_CTX c;

	/* Generate the header */
N
Nicolas Pitre 已提交
1948
	*hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
1949 1950 1951 1952 1953 1954 1955 1956

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

1957 1958 1959 1960 1961 1962
/*
 * 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.
 */
1963
static int link_temp_to_file(const char *tmpfile, const char *filename)
1964 1965
{
	int ret;
S
Shawn Pearce 已提交
1966
	char *dir;
1967 1968 1969 1970 1971

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

	/*
S
Shawn Pearce 已提交
1972
	 * Try to mkdir the last path component if that failed.
1973 1974 1975 1976 1977 1978
	 *
	 * Re-try the "link()" regardless of whether the mkdir
	 * succeeds, since a race might mean that somebody
	 * else succeeded.
	 */
	ret = errno;
S
Shawn Pearce 已提交
1979 1980 1981
	dir = strrchr(filename, '/');
	if (dir) {
		*dir = 0;
1982
		if (!mkdir(filename, 0777) && adjust_shared_perm(filename)) {
1983
			*dir = '/';
S
Shawn Pearce 已提交
1984
			return -2;
1985
		}
S
Shawn Pearce 已提交
1986 1987 1988 1989
		*dir = '/';
		if (!link(tmpfile, filename))
			return 0;
		ret = errno;
1990 1991 1992 1993 1994 1995 1996
	}
	return ret;
}

/*
 * Move the just written object into its final resting place
 */
1997
int move_temp_to_file(const char *tmpfile, const char *filename)
1998 1999
{
	int ret = link_temp_to_file(tmpfile, filename);
2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013

	/*
	 * 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))
2014
			return 0;
2015
		ret = errno;
2016 2017 2018 2019
	}
	unlink(tmpfile);
	if (ret) {
		if (ret != EEXIST) {
2020
			return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
2021 2022 2023 2024 2025 2026 2027
		}
		/* FIXME!!! Collision check here ? */
	}

	return 0;
}

L
Linus Torvalds 已提交
2028 2029
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2030
	if (write_in_full(fd, buf, len) < 0)
2031
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2032 2033 2034
	return 0;
}

N
Nicolas Pitre 已提交
2035
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2036 2037
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2038
	char hdr[32];
R
Rene Scharfe 已提交
2039 2040 2041 2042 2043
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

2044
int write_sha1_file(void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2045
{
2046
	int size, ret;
2047
	unsigned char *compressed;
2048 2049
	z_stream stream;
	unsigned char sha1[20];
2050
	char *filename;
2051
	static char tmpfile[PATH_MAX];
N
Nicolas Pitre 已提交
2052
	char hdr[32];
2053
	int fd, hdrlen;
2054

2055 2056 2057
	/* Normally if we have it in the pack then we do not bother writing
	 * it out into .git/objects/??/?{38} file.
	 */
R
Rene Scharfe 已提交
2058 2059
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	filename = sha1_file_name(sha1);
2060
	if (returnsha1)
2061
		hashcpy(returnsha1, sha1);
2062 2063
	if (has_sha1_file(sha1))
		return 0;
2064 2065
	fd = open(filename, O_RDONLY);
	if (fd >= 0) {
2066
		/*
2067 2068
		 * FIXME!!! We might do collision checking here, but we'd
		 * need to uncompress the old file and check it. Later.
2069
		 */
2070
		close(fd);
2071 2072 2073
		return 0;
	}

2074
	if (errno != ENOENT) {
2075
		return error("sha1 file %s: %s\n", filename, strerror(errno));
2076 2077
	}

2078
	snprintf(tmpfile, sizeof(tmpfile), "%s/tmp_obj_XXXXXX", get_object_directory());
2079

2080 2081
	fd = mkstemp(tmpfile);
	if (fd < 0) {
2082 2083 2084 2085
		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));
2086 2087
	}

2088 2089
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2090
	deflateInit(&stream, zlib_compression_level);
2091
	size = 8 + deflateBound(&stream, len+hdrlen);
2092
	compressed = xmalloc(size);
2093 2094 2095 2096

	/* Compress it */
	stream.next_out = compressed;
	stream.avail_out = size;
2097 2098

	/* First header.. */
N
Nicolas Pitre 已提交
2099
	stream.next_in = (unsigned char *)hdr;
2100
	stream.avail_in = hdrlen;
2101 2102
	while (deflate(&stream, 0) == Z_OK)
		/* nothing */;
2103 2104 2105 2106

	/* Then the data itself.. */
	stream.next_in = buf;
	stream.avail_in = len;
2107 2108 2109 2110 2111 2112 2113 2114
	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);

2115 2116
	size = stream.total_out;

L
Linus Torvalds 已提交
2117 2118
	if (write_buffer(fd, compressed, size) < 0)
		die("unable to write sha1 file");
2119
	fchmod(fd, 0444);
2120 2121
	if (close(fd))
		die("unable to write sha1 file");
2122
	free(compressed);
2123

2124
	return move_temp_to_file(tmpfile, filename);
2125
}
2126

L
Linus Torvalds 已提交
2127 2128 2129 2130 2131
/*
 * 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 已提交
2132
{
L
Linus Torvalds 已提交
2133
	size_t size;
D
Daniel Barkalow 已提交
2134
	z_stream stream;
L
Linus Torvalds 已提交
2135 2136
	unsigned char *unpacked;
	unsigned long len;
2137
	enum object_type type;
N
Nicolas Pitre 已提交
2138
	char hdr[32];
L
Linus Torvalds 已提交
2139 2140
	int hdrlen;
	void *buf;
2141

2142
	/* need to unpack and recompress it by itself */
2143
	unpacked = read_packed_sha1(sha1, &type, &len);
2144 2145
	if (!unpacked)
		error("cannot read sha1_file for %s", sha1_to_hex(sha1));
D
Daniel Barkalow 已提交
2146

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

L
Linus Torvalds 已提交
2149 2150
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2151
	deflateInit(&stream, zlib_compression_level);
L
Linus Torvalds 已提交
2152 2153
	size = deflateBound(&stream, len + hdrlen);
	buf = xmalloc(size);
D
Daniel Barkalow 已提交
2154

L
Linus Torvalds 已提交
2155 2156 2157
	/* Compress it */
	stream.next_out = buf;
	stream.avail_out = size;
D
Daniel Barkalow 已提交
2158

L
Linus Torvalds 已提交
2159 2160 2161 2162 2163
	/* First header.. */
	stream.next_in = (void *)hdr;
	stream.avail_in = hdrlen;
	while (deflate(&stream, 0) == Z_OK)
		/* nothing */;
2164

L
Linus Torvalds 已提交
2165 2166 2167 2168 2169 2170 2171
	/* Then the data itself.. */
	stream.next_in = unpacked;
	stream.avail_in = len;
	while (deflate(&stream, Z_FINISH) == Z_OK)
		/* nothing */;
	deflateEnd(&stream);
	free(unpacked);
2172

L
Linus Torvalds 已提交
2173 2174 2175 2176 2177 2178 2179 2180
	*objsize = stream.total_out;
	return buf;
}

int write_sha1_to_fd(int fd, const unsigned char *sha1)
{
	int retval;
	unsigned long objsize;
2181
	void *buf = map_sha1_file(sha1, &objsize);
L
Linus Torvalds 已提交
2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192

	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 已提交
2193 2194
}

2195 2196
int write_sha1_from_fd(const unsigned char *sha1, int fd, char *buffer,
		       size_t bufsize, size_t *bufposn)
2197
{
2198
	char tmpfile[PATH_MAX];
2199 2200 2201
	int local;
	z_stream stream;
	unsigned char real_sha1[20];
2202
	unsigned char discard[4096];
2203 2204 2205
	int ret;
	SHA_CTX c;

2206
	snprintf(tmpfile, sizeof(tmpfile), "%s/tmp_obj_XXXXXX", get_object_directory());
2207

2208
	local = mkstemp(tmpfile);
2209 2210 2211 2212 2213 2214
	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));
	}
2215 2216 2217 2218 2219 2220 2221 2222 2223

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

	inflateInit(&stream);

	SHA1_Init(&c);

	do {
		ssize_t size;
2224 2225
		if (*bufposn) {
			stream.avail_in = *bufposn;
P
Pavel Roskin 已提交
2226
			stream.next_in = (unsigned char *) buffer;
2227 2228 2229 2230 2231 2232 2233
			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 已提交
2234 2235
			if (write_buffer(local, buffer, *bufposn - stream.avail_in) < 0)
				die("unable to write sha1 file");
2236 2237 2238 2239 2240 2241
			memmove(buffer, buffer + *bufposn - stream.avail_in,
				stream.avail_in);
			*bufposn = stream.avail_in;
			if (ret != Z_OK)
				break;
		}
2242
		size = xread(fd, buffer + *bufposn, bufsize - *bufposn);
2243 2244
		if (size <= 0) {
			close(local);
2245
			unlink(tmpfile);
2246 2247 2248 2249 2250
			if (!size)
				return error("Connection closed?");
			perror("Reading from connection");
			return -1;
		}
2251 2252
		*bufposn += size;
	} while (1);
2253 2254
	inflateEnd(&stream);

2255
	fchmod(local, 0444);
2256 2257
	if (close(local) != 0)
		die("unable to write sha1 file");
2258 2259
	SHA1_Final(real_sha1, &c);
	if (ret != Z_STREAM_END) {
2260
		unlink(tmpfile);
2261 2262
		return error("File %s corrupted", sha1_to_hex(sha1));
	}
2263
	if (hashcmp(sha1, real_sha1)) {
2264
		unlink(tmpfile);
2265
		return error("File %s has bad hash", sha1_to_hex(sha1));
2266
	}
2267 2268

	return move_temp_to_file(tmpfile, sha1_file_name(sha1));
2269 2270
}

2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286
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;
}

2287
int has_sha1_pack(const unsigned char *sha1, const char **ignore_packed)
2288 2289
{
	struct pack_entry e;
2290
	return find_pack_entry(sha1, &e, ignore_packed);
2291 2292
}

2293 2294 2295
int has_sha1_file(const unsigned char *sha1)
{
	struct stat st;
2296 2297
	struct pack_entry e;

2298
	if (find_pack_entry(sha1, &e, NULL))
2299
		return 1;
2300
	return find_sha1_file(sha1, &st) ? 1 : 0;
2301
}
J
Junio C Hamano 已提交
2302

2303 2304
int index_pipe(unsigned char *sha1, int fd, const char *type, int write_object)
{
2305
	struct strbuf buf;
2306 2307
	int ret;

2308 2309 2310
	strbuf_init(&buf, 0);
	if (strbuf_read(&buf, fd, 4096) < 0) {
		strbuf_release(&buf);
2311 2312
		return -1;
	}
2313

2314
	if (!type)
2315
		type = blob_type;
2316
	if (write_object)
2317
		ret = write_sha1_file(buf.buf, buf.len, type, sha1);
R
Rene Scharfe 已提交
2318
	else
2319 2320 2321
		ret = hash_sha1_file(buf.buf, buf.len, type, sha1);
	strbuf_release(&buf);

2322 2323 2324
	return ret;
}

2325
int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object,
2326
	     enum object_type type, const char *path)
J
Junio C Hamano 已提交
2327
{
2328
	size_t size = xsize_t(st->st_size);
2329
	void *buf = NULL;
L
Linus Torvalds 已提交
2330
	int ret, re_allocated = 0;
J
Junio C Hamano 已提交
2331 2332

	if (size)
2333
		buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
J
Junio C Hamano 已提交
2334 2335
	close(fd);

2336
	if (!type)
2337
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2338 2339 2340 2341

	/*
	 * Convert blobs to git internal format
	 */
2342
	if ((type == OBJ_BLOB) && S_ISREG(st->st_mode)) {
2343 2344 2345
		struct strbuf nbuf;
		strbuf_init(&nbuf, 0);
		if (convert_to_git(path, buf, size, &nbuf)) {
2346
			munmap(buf, size);
2347
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
2348 2349 2350 2351
			re_allocated = 1;
		}
	}

2352
	if (write_object)
2353
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
2354
	else
2355
		ret = hash_sha1_file(buf, size, typename(type), sha1);
L
Linus Torvalds 已提交
2356 2357 2358 2359
	if (re_allocated) {
		free(buf);
		return ret;
	}
2360 2361 2362
	if (size)
		munmap(buf, size);
	return ret;
J
Junio C Hamano 已提交
2363
}
2364 2365 2366 2367 2368

int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object)
{
	int fd;
	char *target;
2369
	size_t len;
2370 2371 2372 2373 2374 2375 2376

	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));
2377
		if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path) < 0)
2378 2379 2380 2381
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
2382 2383 2384
		len = xsize_t(st->st_size);
		target = xmalloc(len + 1);
		if (readlink(path, target, len + 1) != st->st_size) {
2385 2386 2387 2388 2389
			char *errstr = strerror(errno);
			free(target);
			return error("readlink(\"%s\"): %s", path,
			             errstr);
		}
R
Rene Scharfe 已提交
2390
		if (!write_object)
2391 2392
			hash_sha1_file(target, len, blob_type, sha1);
		else if (write_sha1_file(target, len, blob_type, sha1))
2393 2394 2395 2396
			return error("%s: failed to insert into database",
				     path);
		free(target);
		break;
2397 2398
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
2399 2400 2401 2402 2403
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424

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;
}