sha1_file.c 58.7 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
#include "pack-revindex.h"
18
#include "sha1-lookup.h"
19

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

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

36
const unsigned char null_sha1[20];
J
Junio C Hamano 已提交
37

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
char *sha1_to_hex(const unsigned char *sha1)
120
{
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
static char *sha1_get_pack_name(const unsigned char *sha1,
J
Junio C Hamano 已提交
178
				char **name, char **base, const char *which)
179 180
{
	static const char hex[] = "0123456789abcdef";
181
	char *buf;
182 183
	int i;

184
	if (!*base) {
185 186
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
187
		*base = xmalloc(len + 60);
J
Junio C Hamano 已提交
188 189
		sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
			sha1_file_directory, which);
190
		*name = *base + len + 11;
191 192
	}

193
	buf = *name;
194 195 196 197 198 199

	for (i = 0; i < 20; i++) {
		unsigned int val = *sha1++;
		*buf++ = hex[val >> 4];
		*buf++ = hex[val & 0xf];
	}
J
Junio C Hamano 已提交
200

201
	return *base;
202 203
}

204
char *sha1_pack_name(const unsigned char *sha1)
205
{
206
	static char *name, *base;
207

J
Junio C Hamano 已提交
208
	return sha1_get_pack_name(sha1, &name, &base, "pack");
209
}
210

211 212 213
char *sha1_pack_index_name(const unsigned char *sha1)
{
	static char *name, *base;
J
Junio C Hamano 已提交
214

J
Junio C Hamano 已提交
215
	return sha1_get_pack_name(sha1, &name, &base, "idx");
216 217
}

218 219
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
220

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

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

249
	if (!is_absolute_path(entry) && relative_base) {
M
Martin Waitz 已提交
250 251 252 253 254 255 256 257
		/* Relative alt-odb */
		if (base_len < 0)
			base_len = strlen(relative_base) + 1;
		entlen += base_len;
		pfxlen += base_len;
	}
	ent = xmalloc(sizeof(*ent) + entlen);

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

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

M
Martin Waitz 已提交
343
static void read_info_alternates(const char * relative_base, int depth)
344
{
345
	char *map;
346
	size_t mapsz;
347
	struct stat st;
348 349 350 351 352
	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 已提交
353
	int fd;
354

355
	sprintf(path, "%s/%s", relative_base, alt_file_name);
356 357 358 359 360
	fd = open(path, O_RDONLY);
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
361
		return;
362
	}
363 364
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
365 366
	close(fd);

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

369
	munmap(map, mapsz);
370 371
}

372 373 374 375 376 377 378 379 380 381 382 383
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
	int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), 1);
	char *alt = mkpath("%s/objects\n", reference);
	write_or_die(fd, alt, strlen(alt));
	if (commit_lock_file(lock))
		die("could not close alternates file");
	if (alt_odb_tail)
		link_alt_odb_entries(alt, alt + strlen(alt), '\n', NULL, 0);
}

M
Martin Waitz 已提交
384 385
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
386
	const char *alt;
M
Martin Waitz 已提交
387

S
Shawn O. Pearce 已提交
388 389 390
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
391 392 393 394 395 396 397 398 399
	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);
}

400
static int has_loose_object(const unsigned char *sha1)
401 402
{
	char *name = sha1_file_name(sha1);
403
	struct alternate_object_database *alt;
404

405 406
	if (!access(name, F_OK))
		return 1;
407
	prepare_alt_odb();
408 409
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
410
		fill_sha1_path(name, sha1);
411 412
		if (!access(alt->base, F_OK))
			return 1;
413
	}
414
	return 0;
415 416
}

417
static unsigned int pack_used_ctr;
418 419 420 421
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;
422
static size_t pack_mapped;
423
struct packed_git *packed_git;
424

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

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

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

469 470
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
471 472 473 474 475 476 477 478 479 480
		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;
481

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

495 496 497 498 499 500 501 502 503 504
	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);
505
			return error("wrong index v1 file size in %s", path);
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521
		}
	} 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 已提交
522 523 524 525
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
526
			munmap(idx_map, idx_size);
527
			return error("wrong index v2 file size in %s", path);
528
		}
529 530 531 532 533 534 535 536 537
		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);
538
		}
539
	}
540

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

548
int open_pack_index(struct packed_git *p)
549 550 551 552 553 554 555 556 557 558 559 560 561 562
{
	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;
}

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

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

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

617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632
void close_pack_windows(struct packed_git *p)
{
	while (p->windows) {
		struct pack_window *w = p->windows;

		if (w->inuse_cnt)
			die("pack '%s' still has open windows to it",
			    p->pack_name);
		munmap(w->base, w->len);
		pack_mapped -= w->len;
		pack_open_windows--;
		p->windows = w->next;
		free(w);
	}
}

633
void unuse_pack(struct pack_window **w_cursor)
634
{
635 636 637 638 639
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
640 641
}

642 643 644 645 646
/*
 * 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)
647
{
648 649 650 651
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
652
	long fd_flag;
653

654 655 656
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

657 658
	p->pack_fd = open(p->pack_name, O_RDONLY);
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
659
		return -1;
660 661

	/* If we created the struct before we had the pack we lack size. */
662 663
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
664
			return error("packfile %s not a regular file", p->pack_name);
665
		p->pack_size = st.st_size;
666
	} else if (p->pack_size != st.st_size)
667
		return error("packfile %s size changed", p->pack_name);
668

669 670 671 672 673
	/* 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)
674
		return error("cannot determine file descriptor flags");
675 676
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
677
		return error("cannot set FD_CLOEXEC");
678

679
	/* Verify we recognize this pack file format. */
680
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
681
		return error("file %s is far too short to be a packfile", p->pack_name);
682
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
683
		return error("file %s is not a GIT packfile", p->pack_name);
684
	if (!pack_version_ok(hdr.hdr_version))
685
		return error("packfile %s is version %u and not supported"
686 687 688 689
			" (try upgrading GIT to a newer version)",
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
690
	if (p->num_objects != ntohl(hdr.hdr_entries))
691
		return error("packfile %s claims to have %u objects"
N
Nicolas Pitre 已提交
692 693 694
			     " while index indicates %u objects",
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
695
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
696
		return error("end of packfile %s is unavailable", p->pack_name);
697
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
698
		return error("packfile %s signature is unavailable", p->pack_name);
699
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
700
	if (hashcmp(sha1, idx_sha1))
701 702
		return error("packfile %s does not match index", p->pack_name);
	return 0;
703 704
}

705 706 707 708 709 710 711 712 713 714 715
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;
}

716
static int in_window(struct pack_window *win, off_t offset)
717 718 719 720 721 722 723 724 725 726 727 728
{
	/* 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);
}

729 730
unsigned char* use_pack(struct packed_git *p,
		struct pack_window **w_cursor,
731
		off_t offset,
732
		unsigned int *left)
733
{
734
	struct pack_window *win = *w_cursor;
735

736 737
	if (p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754

	/* 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) {
755
			size_t window_align = packed_git_window_size / 2;
756
			off_t len;
757
			win = xcalloc(1, sizeof(*win));
758
			win->offset = (offset / window_align) * window_align;
759 760 761 762
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
763
			pack_mapped += win->len;
764
			while (packed_git_limit < pack_mapped
765
				&& unuse_one_window(p, p->pack_fd))
766
				; /* nothing */
767
			win->base = xmmap(NULL, win->len,
768 769 770
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
771 772 773
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
774 775 776 777 778 779
			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;
780 781 782
			win->next = p->windows;
			p->windows = win;
		}
783
	}
784 785 786 787 788
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
789
	offset -= win->offset;
790
	if (left)
791
		*left = win->len - xsize_t(offset);
792
	return win->base + offset;
793 794
}

795
struct packed_git *add_packed_git(const char *path, int path_len, int local)
796 797
{
	struct stat st;
798
	struct packed_git *p = xmalloc(sizeof(*p) + path_len + 2);
799

800 801 802 803 804 805
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
	path_len -= strlen(".idx");
	if (path_len < 1)
806
		return NULL;
807 808
	memcpy(p->pack_name, path, path_len);
	strcpy(p->pack_name + path_len, ".pack");
809
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
810
		free(p);
811 812
		return NULL;
	}
813

814 815 816
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
817 818 819 820
	p->index_version = 0;
	p->index_data = NULL;
	p->index_size = 0;
	p->num_objects = 0;
821 822
	p->pack_size = st.st_size;
	p->next = NULL;
823
	p->windows = NULL;
824
	p->pack_fd = -1;
825
	p->pack_local = local;
826
	p->mtime = st.st_mtime;
827 828
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
829 830 831
	return p;
}

832
struct packed_git *parse_pack_index(unsigned char *sha1)
833
{
834
	const char *idx_path = sha1_pack_index_name(sha1);
835 836
	const char *path = sha1_pack_name(sha1);
	struct packed_git *p = xmalloc(sizeof(*p) + strlen(path) + 2);
837

838 839
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
840
		return NULL;
841
	}
842 843 844 845

	strcpy(p->pack_name, path);
	p->pack_size = 0;
	p->next = NULL;
846
	p->windows = NULL;
847
	p->pack_fd = -1;
848
	hashcpy(p->sha1, sha1);
849 850 851 852 853 854 855 856 857
	return p;
}

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

858
static void prepare_packed_git_one(char *objdir, int local)
859
{
860 861 862 863
	/* 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];
864 865 866 867 868 869 870
	int len;
	DIR *dir;
	struct dirent *de;

	sprintf(path, "%s/pack", objdir);
	len = strlen(path);
	dir = opendir(path);
871
	if (!dir) {
J
Junio C Hamano 已提交
872
		if (errno != ENOENT)
873
			error("unable to open object pack directory: %s: %s",
J
Junio C Hamano 已提交
874
			      path, strerror(errno));
875
		return;
876
	}
877 878 879 880 881
	path[len++] = '/';
	while ((de = readdir(dir)) != NULL) {
		int namelen = strlen(de->d_name);
		struct packed_git *p;

882
		if (!has_extension(de->d_name, ".idx"))
883 884
			continue;

885 886 887
		if (len + namelen + 1 > sizeof(path))
			continue;

888
		/* Don't reopen a pack we already have. */
889
		strcpy(path + len, de->d_name);
890 891 892 893 894 895
		for (p = packed_git; p; p = p->next) {
			if (!memcmp(path, p->pack_name, len + namelen - 4))
				break;
		}
		if (p)
			continue;
896 897 898
		/* See if it really is a valid .idx file with corresponding
		 * .pack file that we can map.
		 */
899
		p = add_packed_git(path, len + namelen, local);
900 901
		if (!p)
			continue;
902
		install_packed_git(p);
903
	}
904
	closedir(dir);
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 948 949 950 951 952 953 954 955 956 957 958 959 960
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);
}

961
static int prepare_packed_git_run_once = 0;
962
void prepare_packed_git(void)
963
{
964
	struct alternate_object_database *alt;
965

966
	if (prepare_packed_git_run_once)
967
		return;
968
	prepare_packed_git_one(get_object_directory(), 1);
969
	prepare_alt_odb();
970
	for (alt = alt_odb_list; alt; alt = alt->next) {
971
		alt->name[-1] = 0;
972
		prepare_packed_git_one(alt->base, 0);
973
		alt->name[-1] = '/';
974
	}
975
	rearrange_packed_git();
976 977 978
	prepare_packed_git_run_once = 1;
}

979
void reprepare_packed_git(void)
980 981 982
{
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
983 984
}

985
int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
986 987
{
	unsigned char real_sha1[20];
988
	hash_sha1_file(map, size, type, real_sha1);
989
	return hashcmp(sha1, real_sha1) ? -1 : 0;
990 991
}

992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
static int git_open_noatime(const char *name)
{
	static int sha1_file_open_flag = O_NOATIME;
	int fd = open(name, O_RDONLY | sha1_file_open_flag);

	/* Might the failure be due to O_NOATIME? */
	if (fd < 0 && errno != ENOENT && sha1_file_open_flag) {
		fd = open(name, O_RDONLY);
		if (fd >= 0)
			sha1_file_open_flag = 0;
	}
	return fd;
}

static int open_sha1_file(const unsigned char *sha1)
{
	int fd;
	char *name = sha1_file_name(sha1);
	struct alternate_object_database *alt;

	fd = git_open_noatime(name);
	if (fd >= 0)
		return fd;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
		fill_sha1_path(name, sha1);
		fd = git_open_noatime(alt->base);
		if (fd >= 0)
			return fd;
	}
	return -1;
}

J
Junio C Hamano 已提交
1028
static void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1029 1030
{
	void *map;
1031
	int fd;
1032

1033 1034 1035 1036
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1037

1038 1039 1040
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1041
		}
1042
		close(fd);
1043 1044 1045 1046
	}
	return map;
}

1047
static int legacy_loose_object(unsigned char *map)
1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
{
	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;
}

1063
unsigned long unpack_object_header_gently(const unsigned char *buf, unsigned long len, enum object_type *type, unsigned long *sizep)
1064
{
1065
	unsigned shift;
1066 1067
	unsigned char c;
	unsigned long size;
1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
	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 */
1094
	};
1095
	enum object_type type;
1096

1097 1098 1099 1100 1101
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1102 1103
	stream->avail_out = bufsiz;

1104
	if (legacy_loose_object(map)) {
1105 1106 1107 1108
		inflateInit(stream);
		return inflate(stream, 0);
	}

1109 1110 1111 1112 1113 1114 1115 1116

	/*
	 * 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.
	 */
1117 1118
	used = unpack_object_header_gently(map, mapsize, &type, &size);
	if (!used || !valid_loose_object_type[type])
1119
		return -1;
1120 1121
	map += used;
	mapsize -= used;
1122 1123 1124 1125

	/* Set up the stream for the rest.. */
	stream->next_in = map;
	stream->avail_in = mapsize;
1126
	inflateInit(stream);
1127 1128

	/* And generate the fake traditional header */
1129
	stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1130
					 typename(type), size);
1131
	return 0;
1132 1133
}

1134
static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1135 1136
{
	int bytes = strlen(buffer) + 1;
1137
	unsigned char *buf = xmalloc(1+size);
1138
	unsigned long n;
1139
	int status = Z_OK;
1140

1141 1142 1143 1144 1145
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159
	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.
		 */
1160 1161
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1162 1163
		while (status == Z_OK)
			status = inflate(stream, Z_FINISH);
1164 1165
	}
	buf[size] = 0;
1166
	if (status == Z_STREAM_END && !stream->avail_in) {
1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177
		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;
1178 1179 1180 1181 1182 1183 1184
}

/*
 * 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.
 */
1185
static int parse_sha1_header(const char *hdr, unsigned long *sizep)
1186
{
1187
	char type[10];
1188 1189 1190 1191
	int i;
	unsigned long size;

	/*
J
Junio C Hamano 已提交
1192
	 * The type can be at most ten bytes (including the
1193
	 * terminating '\0' that we add), and is followed by
1194
	 * a space.
1195
	 */
1196
	i = 0;
1197 1198 1199 1200
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1201 1202
		type[i++] = c;
		if (i >= sizeof(type))
1203 1204
			return -1;
	}
1205
	type[i] = 0;
1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227

	/*
	 * 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
	 */
1228
	return *hdr ? -1 : type_from_string(type);
1229 1230
}

1231
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1232
{
1233
	int ret;
1234
	z_stream stream;
1235
	char hdr[8192];
1236

1237
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1238
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1239 1240
		return NULL;

1241
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1242 1243
}

N
Nicolas Pitre 已提交
1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280
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));
}

1281
static off_t get_delta_base(struct packed_git *p,
1282
				    struct pack_window **w_curs,
1283
				    off_t *curpos,
1284
				    enum object_type type,
1285
				    off_t delta_obj_offset)
1286
{
1287
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1288
	off_t base_offset;
1289

1290 1291 1292 1293 1294 1295
	/* 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.
	 */
1296
	if (type == OBJ_OFS_DELTA) {
1297 1298 1299 1300 1301
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1302
			if (!base_offset || MSB(base_offset, 7))
1303 1304 1305 1306 1307 1308 1309
				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");
1310
		*curpos += used;
1311
	} else if (type == OBJ_REF_DELTA) {
1312 1313 1314 1315 1316
		/* 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));
1317
		*curpos += 20;
1318 1319
	} else
		die("I am totally screwed");
1320
	return base_offset;
1321 1322
}

J
Junio C Hamano 已提交
1323
/* forward declaration for a mutually recursive function */
1324
static int packed_object_info(struct packed_git *p, off_t offset,
1325
			      unsigned long *sizep);
J
Junio C Hamano 已提交
1326

N
Nicolas Pitre 已提交
1327
static int packed_delta_info(struct packed_git *p,
1328
			     struct pack_window **w_curs,
1329
			     off_t curpos,
1330
			     enum object_type type,
1331
			     off_t obj_offset,
N
Nicolas Pitre 已提交
1332
			     unsigned long *sizep)
1333
{
1334
	off_t base_offset;
J
Junio C Hamano 已提交
1335

1336 1337
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
	type = packed_object_info(p, base_offset, NULL);
J
Junio C Hamano 已提交
1338

1339 1340 1341 1342 1343
	/* 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 已提交
1344 1345
	if (sizep)
		*sizep = get_size_from_delta(p, w_curs, curpos);
1346 1347

	return type;
1348 1349
}

1350 1351
static int unpack_object_header(struct packed_git *p,
				struct pack_window **w_curs,
1352
				off_t *curpos,
1353
				unsigned long *sizep)
1354
{
1355 1356
	unsigned char *base;
	unsigned int left;
1357
	unsigned long used;
1358
	enum object_type type;
1359

1360 1361
	/* 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 已提交
1362
	 * size that is assured.)  With our object header encoding
1363 1364 1365
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1366 1367
	base = use_pack(p, w_curs, *curpos, &left);
	used = unpack_object_header_gently(base, left, &type, sizep);
1368 1369
	if (!used)
		die("object offset outside of pack file");
1370
	*curpos += used;
1371

1372
	return type;
1373 1374
}

1375
const char *packed_object_info_detail(struct packed_git *p,
1376
				      off_t obj_offset,
1377 1378 1379 1380
				      unsigned long *size,
				      unsigned long *store_size,
				      unsigned int *delta_chain_length,
				      unsigned char *base_sha1)
1381
{
1382
	struct pack_window *w_curs = NULL;
1383 1384
	off_t curpos;
	unsigned long dummy;
N
Nicolas Pitre 已提交
1385
	unsigned char *next_sha1;
1386
	enum object_type type;
1387
	struct revindex_entry *revidx;
1388

N
Nicolas Pitre 已提交
1389
	*delta_chain_length = 0;
1390
	curpos = obj_offset;
1391
	type = unpack_object_header(p, &w_curs, &curpos, size);
N
Nicolas Pitre 已提交
1392

1393 1394 1395
	revidx = find_pack_revindex(p, obj_offset);
	*store_size = revidx[1].offset - obj_offset;

N
Nicolas Pitre 已提交
1396
	for (;;) {
1397
		switch (type) {
N
Nicolas Pitre 已提交
1398
		default:
1399
			die("pack %s contains unknown object type %d",
1400
			    p->pack_name, type);
N
Nicolas Pitre 已提交
1401 1402 1403 1404
		case OBJ_COMMIT:
		case OBJ_TREE:
		case OBJ_BLOB:
		case OBJ_TAG:
1405
			unuse_pack(&w_curs);
1406
			return typename(type);
1407
		case OBJ_OFS_DELTA:
1408
			obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1409
			if (*delta_chain_length == 0) {
1410 1411
				revidx = find_pack_revindex(p, obj_offset);
				hashcpy(base_sha1, nth_packed_object_sha1(p, revidx->nr));
1412 1413 1414
			}
			break;
		case OBJ_REF_DELTA:
1415
			next_sha1 = use_pack(p, &w_curs, curpos, NULL);
N
Nicolas Pitre 已提交
1416 1417
			if (*delta_chain_length == 0)
				hashcpy(base_sha1, next_sha1);
1418
			obj_offset = find_pack_entry_one(next_sha1, p);
N
Nicolas Pitre 已提交
1419 1420 1421
			break;
		}
		(*delta_chain_length)++;
1422
		curpos = obj_offset;
1423
		type = unpack_object_header(p, &w_curs, &curpos, &dummy);
1424 1425 1426
	}
}

1427
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1428
			      unsigned long *sizep)
1429
{
1430
	struct pack_window *w_curs = NULL;
1431 1432
	unsigned long size;
	off_t curpos = obj_offset;
1433
	enum object_type type;
1434

1435
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1436

1437
	switch (type) {
1438 1439
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1440 1441
		type = packed_delta_info(p, &w_curs, curpos,
					 type, obj_offset, sizep);
1442
		break;
1443 1444 1445 1446
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1447 1448
		if (sizep)
			*sizep = size;
1449
		break;
1450
	default:
1451
		die("pack %s contains unknown object type %d",
1452
		    p->pack_name, type);
1453
	}
1454
	unuse_pack(&w_curs);
1455
	return type;
1456 1457
}

1458
static void *unpack_compressed_entry(struct packed_git *p,
1459
				    struct pack_window **w_curs,
1460
				    off_t curpos,
1461
				    unsigned long size)
1462 1463 1464
{
	int st;
	z_stream stream;
1465
	unsigned char *buffer, *in;
1466 1467 1468 1469 1470 1471 1472 1473

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

	inflateInit(&stream);
1474
	do {
1475
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1476 1477
		stream.next_in = in;
		st = inflate(&stream, Z_FINISH);
1478
		curpos += stream.next_in - in;
1479
	} while (st == Z_OK || st == Z_BUF_ERROR);
1480 1481 1482 1483 1484 1485 1486 1487 1488
	inflateEnd(&stream);
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1489 1490
#define MAX_DELTA_CACHE (256)

1491
static size_t delta_base_cached;
1492 1493 1494 1495 1496 1497

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

1498
static struct delta_base_cache_entry {
1499 1500
	struct delta_base_cache_lru_list lru;
	void *data;
1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512
	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);
1513
	return hash % MAX_DELTA_CACHE;
1514 1515
}

1516
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1517
	unsigned long *base_size, enum object_type *type, int keep_cache)
1518
{
1519 1520 1521 1522 1523 1524 1525
	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;
1526
	return unpack_entry(p, base_offset, type, base_size);
1527 1528

found_cache_entry:
1529
	if (!keep_cache) {
1530
		ent->data = NULL;
1531 1532
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1533
		delta_base_cached -= ent->size;
P
Pierre Habouzit 已提交
1534 1535
	} else {
		ret = xmemdupz(ent->data, ent->size);
1536
	}
1537 1538 1539
	*type = ent->type;
	*base_size = ent->size;
	return ret;
1540 1541
}

1542 1543 1544 1545 1546
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
1547 1548
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1549 1550 1551 1552
		delta_base_cached -= ent->size;
	}
}

1553 1554 1555
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
1556
	unsigned long hash = pack_entry_hash(p, base_offset);
1557
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
1558
	struct delta_base_cache_lru_list *lru;
1559

1560 1561
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1562 1563 1564 1565 1566 1567

	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;
1568 1569 1570
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
1571 1572 1573 1574 1575 1576 1577
	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);
	}
1578

1579 1580 1581 1582 1583
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
1584 1585 1586 1587
	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;
1588 1589
}

1590
static void *unpack_delta_entry(struct packed_git *p,
1591
				struct pack_window **w_curs,
1592
				off_t curpos,
1593
				unsigned long delta_size,
1594
				off_t obj_offset,
1595
				enum object_type *type,
1596
				unsigned long *sizep)
1597
{
1598
	void *delta_data, *result, *base;
1599 1600
	unsigned long base_size;
	off_t base_offset;
N
Nicolas Pitre 已提交
1601

1602
	base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1603
	base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1604
	if (!base)
1605 1606 1607
		die("failed to read delta base object"
		    " at %"PRIuMAX" from %s",
		    (uintmax_t)base_offset, p->pack_name);
1608

1609
	delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1610 1611 1612 1613
	if (!delta_data)
		die("failed to unpack compressed delta"
		    " at %"PRIuMAX" from %s",
		    (uintmax_t)curpos, p->pack_name);
1614 1615
	result = patch_delta(base, base_size,
			     delta_data, delta_size,
1616
			     sizep);
1617 1618 1619
	if (!result)
		die("failed to apply delta");
	free(delta_data);
1620
	add_delta_base_cache(p, base_offset, base, base_size, *type);
1621 1622 1623
	return result;
}

1624
void *unpack_entry(struct packed_git *p, off_t obj_offset,
1625
		   enum object_type *type, unsigned long *sizep)
1626
{
1627
	struct pack_window *w_curs = NULL;
1628
	off_t curpos = obj_offset;
1629
	void *data;
1630

1631 1632
	*type = unpack_object_header(p, &w_curs, &curpos, sizep);
	switch (*type) {
1633 1634
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1635 1636
		data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
					  obj_offset, type, sizep);
1637
		break;
1638 1639 1640 1641
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1642
		data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1643
		break;
1644
	default:
1645
		die("unknown object type %i in %s", *type, p->pack_name);
1646
	}
1647
	unuse_pack(&w_curs);
1648
	return data;
1649 1650
}

1651
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1652
					    uint32_t n)
1653
{
1654
	const unsigned char *index = p->index_data;
1655 1656 1657 1658 1659
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
1660
	if (n >= p->num_objects)
1661
		return NULL;
1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686
	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)));
	}
1687 1688
}

1689
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
1690
				  struct packed_git *p)
1691
{
1692 1693
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
1694 1695 1696 1697 1698 1699
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

	if (debug_lookup < 0)
		debug_lookup = !!getenv("GIT_DEBUG_LOOKUP");
1700

1701 1702 1703 1704 1705 1706
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
1707 1708 1709 1710
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
1711
	index += 4 * 256;
1712 1713
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
		printf("%02x%02x%02x... lo %u hi %u nr %u\n",
		       sha1[0], sha1[1], sha1[2], lo, hi, p->num_objects);

	if (use_lookup < 0)
		use_lookup = !!getenv("GIT_USE_LOOKUP");
	if (use_lookup) {
		int pos = sha1_entry_pos(index, stride, 0,
					 lo, hi, p->num_objects, sha1);
		if (pos < 0)
			return 0;
		return nth_packed_object_offset(p, pos);
	}
1734 1735

	do {
1736
		unsigned mi = (lo + hi) / 2;
1737 1738 1739 1740 1741
		int cmp = hashcmp(index + mi * stride, sha1);

		if (debug_lookup)
			printf("lo %u hi %u rg %u mi %u\n",
			       lo, hi, hi - lo, mi);
N
Nicolas Pitre 已提交
1742
		if (!cmp)
1743
			return nth_packed_object_offset(p, mi);
1744 1745 1746 1747 1748 1749 1750 1751
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

1752
int matches_pack_name(struct packed_git *p, const char *name)
1753 1754 1755
{
	const char *last_c, *c;

1756 1757
	if (!strcmp(p->pack_name, name))
		return 1;
1758 1759 1760 1761 1762 1763

	for (c = p->pack_name, last_c = c; *c;)
		if (*c == '/')
			last_c = ++c;
		else
			++c;
1764 1765
	if (!strcmp(last_c, name))
		return 1;
1766

1767
	return 0;
1768 1769
}

1770
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e, const char **ignore_packed)
1771
{
1772
	static struct packed_git *last_found = (void *)1;
1773
	struct packed_git *p;
1774
	off_t offset;
N
Nicolas Pitre 已提交
1775

1776
	prepare_packed_git();
1777 1778 1779
	if (!packed_git)
		return 0;
	p = (last_found == (void *)1) ? packed_git : last_found;
1780

1781
	do {
1782 1783 1784
		if (ignore_packed) {
			const char **ig;
			for (ig = ignore_packed; *ig; ig++)
1785
				if (matches_pack_name(p, *ig))
1786 1787
					break;
			if (*ig)
1788
				goto next;
1789
		}
1790

N
Nicolas Pitre 已提交
1791 1792
		offset = find_pack_entry_one(sha1, p);
		if (offset) {
1793 1794 1795 1796 1797 1798 1799 1800 1801 1802
			/*
			 * 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);
1803
				goto next;
1804
			}
N
Nicolas Pitre 已提交
1805 1806 1807
			e->offset = offset;
			e->p = p;
			hashcpy(e->sha1, sha1);
1808
			last_found = p;
1809
			return 1;
N
Nicolas Pitre 已提交
1810
		}
1811 1812 1813 1814 1815 1816 1817 1818 1819

		next:
		if (p == last_found)
			p = packed_git;
		else
			p = p->next;
		if (p == last_found)
			p = p->next;
	} while (p);
1820 1821 1822
	return 0;
}

J
Junio C Hamano 已提交
1823
struct packed_git *find_sha1_pack(const unsigned char *sha1,
1824 1825 1826 1827 1828
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
1829
		if (find_pack_entry_one(sha1, p))
1830 1831 1832
			return p;
	}
	return NULL;
1833

1834 1835
}

1836
static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
1837
{
1838
	int status;
1839 1840 1841
	unsigned long mapsize, size;
	void *map;
	z_stream stream;
N
Nicolas Pitre 已提交
1842
	char hdr[32];
1843

1844
	map = map_sha1_file(sha1, &mapsize);
1845 1846
	if (!map)
		return error("unable to find %s", sha1_to_hex(sha1));
1847 1848 1849
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
1850
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
1851
		status = error("unable to parse %s header", sha1_to_hex(sha1));
1852 1853
	else if (sizep)
		*sizep = size;
1854 1855 1856 1857 1858
	inflateEnd(&stream);
	munmap(map, mapsize);
	return status;
}

1859
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
1860 1861 1862 1863 1864 1865
{
	struct pack_entry e;

	if (!find_pack_entry(sha1, &e, NULL)) {
		reprepare_packed_git();
		if (!find_pack_entry(sha1, &e, NULL))
1866
			return sha1_loose_object_info(sha1, sizep);
1867
	}
1868
	return packed_object_info(e.p, e.offset, sizep);
1869 1870
}

1871 1872
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
1873 1874 1875
{
	struct pack_entry e;

1876
	if (!find_pack_entry(sha1, &e, NULL))
1877
		return NULL;
1878
	else
1879
		return cache_or_unpack_entry(e.p, e.offset, size, type, 1);
1880 1881
}

1882 1883 1884 1885 1886 1887 1888 1889
/*
 * 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];
1890
	enum object_type type;
1891 1892 1893 1894 1895
	void *buf;
	unsigned long size;
} *cached_objects;
static int cached_object_nr, cached_object_alloc;

J
Jeff King 已提交
1896 1897 1898 1899 1900 1901 1902 1903 1904
static struct cached_object empty_tree = {
	/* empty tree sha1: 4b825dc642cb6eb9a060e54bf8d69288fbee4904 */
	"\x4b\x82\x5d\xc6\x42\xcb\x6e\xb9\xa0\x60"
	"\xe5\x4b\xf8\xd6\x92\x88\xfb\xee\x49\x04",
	OBJ_TREE,
	"",
	0
};

1905 1906 1907 1908 1909 1910 1911 1912 1913
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;
	}
J
Jeff King 已提交
1914 1915
	if (!hashcmp(sha1, empty_tree.sha1))
		return &empty_tree;
1916 1917 1918
	return NULL;
}

1919 1920
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
1921 1922 1923
{
	struct cached_object *co;

1924
	hash_sha1_file(buf, len, typename(type), sha1);
1925 1926 1927 1928 1929 1930 1931 1932 1933 1934
	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;
1935
	co->type = type;
J
Junio C Hamano 已提交
1936 1937
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
1938 1939 1940 1941
	hashcpy(co->sha1, sha1);
	return 0;
}

1942 1943
void *read_sha1_file(const unsigned char *sha1, enum object_type *type,
		     unsigned long *size)
1944 1945 1946
{
	unsigned long mapsize;
	void *map, *buf;
1947 1948 1949 1950
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
1951
		*type = co->type;
1952
		*size = co->size;
P
Pierre Habouzit 已提交
1953
		return xmemdupz(co->buf, co->size);
1954
	}
1955

1956 1957 1958
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
1959
	map = map_sha1_file(sha1, &mapsize);
1960
	if (map) {
1961
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
1962 1963 1964
		munmap(map, mapsize);
		return buf;
	}
1965
	reprepare_packed_git();
1966
	return read_packed_sha1(sha1, type, size);
1967 1968
}

1969
void *read_object_with_reference(const unsigned char *sha1,
1970
				 const char *required_type_name,
1971 1972
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
1973
{
1974
	enum object_type type, required_type;
1975 1976
	void *buffer;
	unsigned long isize;
1977
	unsigned char actual_sha1[20];
1978

1979
	required_type = type_from_string(required_type_name);
1980
	hashcpy(actual_sha1, sha1);
1981 1982 1983
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
1984

1985
		buffer = read_sha1_file(actual_sha1, &type, &isize);
1986 1987
		if (!buffer)
			return NULL;
1988
		if (type == required_type) {
1989 1990
			*size = isize;
			if (actual_sha1_return)
1991
				hashcpy(actual_sha1_return, actual_sha1);
1992 1993 1994
			return buffer;
		}
		/* Handle references */
1995
		else if (type == OBJ_COMMIT)
1996
			ref_type = "tree ";
1997
		else if (type == OBJ_TAG)
1998 1999 2000 2001 2002 2003
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
2004

2005 2006
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
2007
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2008 2009 2010
			free(buffer);
			return NULL;
		}
2011
		free(buffer);
2012 2013
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
2014 2015 2016
	}
}

N
Nicolas Pitre 已提交
2017
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
2018
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
2019
                                    char *hdr, int *hdrlen)
2020 2021 2022 2023
{
	SHA_CTX c;

	/* Generate the header */
N
Nicolas Pitre 已提交
2024
	*hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2025 2026 2027 2028 2029 2030 2031 2032

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

2033 2034 2035
/*
 * Move the just written object into its final resting place
 */
2036
int move_temp_to_file(const char *tmpfile, const char *filename)
2037
{
2038
	int ret = link(tmpfile, filename);
2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052

	/*
	 * 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))
2053
			return 0;
2054
		ret = errno;
2055 2056 2057 2058
	}
	unlink(tmpfile);
	if (ret) {
		if (ret != EEXIST) {
2059
			return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
2060 2061 2062 2063 2064 2065 2066
		}
		/* FIXME!!! Collision check here ? */
	}

	return 0;
}

L
Linus Torvalds 已提交
2067 2068
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2069
	if (write_in_full(fd, buf, len) < 0)
2070
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2071 2072 2073
	return 0;
}

N
Nicolas Pitre 已提交
2074
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2075 2076
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2077
	char hdr[32];
R
Rene Scharfe 已提交
2078 2079 2080 2081 2082
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

2083 2084 2085 2086 2087 2088 2089 2090 2091
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
	/* For safe-mode, we could fsync_or_die(fd, "sha1 file") here */
	fchmod(fd, 0444);
	if (close(fd) != 0)
		die("unable to write sha1 file");
}

2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121
/* Size of directory component, including the ending '/' */
static inline int directory_size(const char *filename)
{
	const char *s = strrchr(filename, '/');
	if (!s)
		return 0;
	return s - filename + 1;
}

/*
 * This creates a temporary file in the same directory as the final
 * 'filename'
 *
 * We want to avoid cross-directory filename renames, because those
 * can have problems on various filesystems (FAT, NFS, Coda).
 */
static int create_tmpfile(char *buffer, size_t bufsiz, const char *filename)
{
	int fd, dirlen = directory_size(filename);

	if (dirlen + 20 > bufsiz) {
		errno = ENAMETOOLONG;
		return -1;
	}
	memcpy(buffer, filename, dirlen);
	strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
	fd = mkstemp(buffer);
	if (fd < 0 && dirlen) {
		/* Make sure the directory exists */
		buffer[dirlen-1] = 0;
2122
		if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2123 2124 2125 2126 2127 2128 2129 2130 2131
			return -1;

		/* Try again */
		strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
		fd = mkstemp(buffer);
	}
	return fd;
}

2132 2133
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
			      void *buf, unsigned long len, time_t mtime)
2134
{
2135
	int fd, size, ret;
2136
	unsigned char *compressed;
2137
	z_stream stream;
2138
	char *filename;
2139
	static char tmpfile[PATH_MAX];
2140

R
Rene Scharfe 已提交
2141
	filename = sha1_file_name(sha1);
2142
	fd = create_tmpfile(tmpfile, sizeof(tmpfile), filename);
2143
	if (fd < 0) {
2144 2145 2146 2147
		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));
2148 2149
	}

2150 2151
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2152
	deflateInit(&stream, zlib_compression_level);
2153
	size = 8 + deflateBound(&stream, len+hdrlen);
2154
	compressed = xmalloc(size);
2155 2156 2157 2158

	/* Compress it */
	stream.next_out = compressed;
	stream.avail_out = size;
2159 2160

	/* First header.. */
N
Nicolas Pitre 已提交
2161
	stream.next_in = (unsigned char *)hdr;
2162
	stream.avail_in = hdrlen;
2163 2164
	while (deflate(&stream, 0) == Z_OK)
		/* nothing */;
2165 2166 2167 2168

	/* Then the data itself.. */
	stream.next_in = buf;
	stream.avail_in = len;
2169 2170 2171 2172 2173 2174 2175 2176
	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);

2177 2178
	size = stream.total_out;

L
Linus Torvalds 已提交
2179 2180
	if (write_buffer(fd, compressed, size) < 0)
		die("unable to write sha1 file");
2181
	close_sha1_file(fd);
2182
	free(compressed);
2183

2184 2185 2186 2187 2188 2189 2190 2191 2192
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
		if (utime(tmpfile, &utb) < 0)
			warning("failed utime() on %s: %s",
				tmpfile, strerror(errno));
	}

2193
	return move_temp_to_file(tmpfile, filename);
2194
}
2195

2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220
int write_sha1_file(void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
{
	unsigned char sha1[20];
	char hdr[32];
	int hdrlen;

	/* Normally if we have it in the pack then we do not bother writing
	 * it out into .git/objects/??/?{38} file.
	 */
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	if (returnsha1)
		hashcpy(returnsha1, sha1);
	if (has_sha1_file(sha1))
		return 0;
	return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
}

int force_object_loose(const unsigned char *sha1, time_t mtime)
{
	void *buf;
	unsigned long len;
	enum object_type type;
	char hdr[32];
	int hdrlen;

2221
	if (has_loose_object(sha1))
2222 2223 2224 2225 2226 2227 2228 2229
		return 0;
	buf = read_packed_sha1(sha1, &type, &len);
	if (!buf)
		return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
	hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
	return write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
}

2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245
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;
}

2246
int has_sha1_pack(const unsigned char *sha1, const char **ignore_packed)
2247 2248
{
	struct pack_entry e;
2249
	return find_pack_entry(sha1, &e, ignore_packed);
2250 2251
}

2252 2253
int has_sha1_file(const unsigned char *sha1)
{
2254 2255
	struct pack_entry e;

2256
	if (find_pack_entry(sha1, &e, NULL))
2257
		return 1;
2258
	return has_loose_object(sha1);
2259
}
J
Junio C Hamano 已提交
2260

2261 2262
int index_pipe(unsigned char *sha1, int fd, const char *type, int write_object)
{
2263
	struct strbuf buf;
2264 2265
	int ret;

2266 2267 2268
	strbuf_init(&buf, 0);
	if (strbuf_read(&buf, fd, 4096) < 0) {
		strbuf_release(&buf);
2269 2270
		return -1;
	}
2271

2272
	if (!type)
2273
		type = blob_type;
2274
	if (write_object)
2275
		ret = write_sha1_file(buf.buf, buf.len, type, sha1);
R
Rene Scharfe 已提交
2276
	else
2277 2278 2279
		ret = hash_sha1_file(buf.buf, buf.len, type, sha1);
	strbuf_release(&buf);

2280 2281 2282
	return ret;
}

2283
int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object,
2284
	     enum object_type type, const char *path)
J
Junio C Hamano 已提交
2285
{
2286
	size_t size = xsize_t(st->st_size);
2287
	void *buf = NULL;
L
Linus Torvalds 已提交
2288
	int ret, re_allocated = 0;
J
Junio C Hamano 已提交
2289 2290

	if (size)
2291
		buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
J
Junio C Hamano 已提交
2292 2293
	close(fd);

2294
	if (!type)
2295
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2296 2297 2298 2299

	/*
	 * Convert blobs to git internal format
	 */
2300
	if ((type == OBJ_BLOB) && S_ISREG(st->st_mode)) {
2301 2302
		struct strbuf nbuf;
		strbuf_init(&nbuf, 0);
2303 2304
		if (convert_to_git(path, buf, size, &nbuf,
		                   write_object ? safe_crlf : 0)) {
2305
			munmap(buf, size);
2306
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
2307 2308 2309 2310
			re_allocated = 1;
		}
	}

2311
	if (write_object)
2312
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
2313
	else
2314
		ret = hash_sha1_file(buf, size, typename(type), sha1);
L
Linus Torvalds 已提交
2315 2316 2317 2318
	if (re_allocated) {
		free(buf);
		return ret;
	}
2319 2320 2321
	if (size)
		munmap(buf, size);
	return ret;
J
Junio C Hamano 已提交
2322
}
2323 2324 2325 2326 2327

int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object)
{
	int fd;
	char *target;
2328
	size_t len;
2329 2330 2331 2332 2333 2334 2335

	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));
2336
		if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path) < 0)
2337 2338 2339 2340
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
2341 2342 2343
		len = xsize_t(st->st_size);
		target = xmalloc(len + 1);
		if (readlink(path, target, len + 1) != st->st_size) {
2344 2345 2346 2347 2348
			char *errstr = strerror(errno);
			free(target);
			return error("readlink(\"%s\"): %s", path,
			             errstr);
		}
R
Rene Scharfe 已提交
2349
		if (!write_object)
2350 2351
			hash_sha1_file(target, len, blob_type, sha1);
		else if (write_sha1_file(target, len, blob_type, sha1))
2352 2353 2354 2355
			return error("%s: failed to insert into database",
				     path);
		free(target);
		break;
2356 2357
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
2358 2359 2360 2361 2362
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
2363 2364 2365

int read_pack_header(int fd, struct pack_header *header)
{
2366 2367 2368 2369
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

2370 2371 2372 2373 2374 2375 2376 2377
	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;
}