sha1_file.c 80.2 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 "string-list.h"
11
#include "delta.h"
12
#include "pack.h"
13 14
#include "blob.h"
#include "commit.h"
15
#include "run-command.h"
16 17
#include "tag.h"
#include "tree.h"
18
#include "tree-walk.h"
19
#include "refs.h"
20
#include "pack-revindex.h"
21
#include "sha1-lookup.h"
22
#include "bulk-checkin.h"
23
#include "streaming.h"
24
#include "dir.h"
25

26 27 28 29 30 31 32 33
#ifndef O_NOATIME
#if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
#define O_NOATIME 01000000
#else
#define O_NOATIME 0
#endif
#endif

34 35
#define SZ_FMT PRIuMAX
static inline uintmax_t sz_fmt(size_t s) { return s; }
36

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

39 40 41
static const char *no_log_pack_access = "no_log_pack_access";
static const char *log_pack_access;

42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
/*
 * 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];
	enum object_type type;
	void *buf;
	unsigned long size;
} *cached_objects;
static int cached_object_nr, cached_object_alloc;

static struct cached_object empty_tree = {
57
	EMPTY_TREE_SHA1_BIN_LITERAL,
58 59 60 61 62
	OBJ_TREE,
	"",
	0
};

63 64
static struct packed_git *last_found_pack;

65 66 67 68 69 70 71 72 73 74 75 76 77 78
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;
	}
	if (!hashcmp(sha1, empty_tree.sha1))
		return &empty_tree;
	return NULL;
}

79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
int mkdir_in_gitdir(const char *path)
{
	if (mkdir(path, 0777)) {
		int saved_errno = errno;
		struct stat st;
		struct strbuf sb = STRBUF_INIT;

		if (errno != EEXIST)
			return -1;
		/*
		 * Are we looking at a path in a symlinked worktree
		 * whose original repository does not yet have it?
		 * e.g. .git/rr-cache pointing at its original
		 * repository in which the user hasn't performed any
		 * conflict resolution yet?
		 */
		if (lstat(path, &st) || !S_ISLNK(st.st_mode) ||
		    strbuf_readlink(&sb, path, st.st_size) ||
		    !is_absolute_path(sb.buf) ||
		    mkdir(sb.buf, 0777)) {
			strbuf_release(&sb);
			errno = saved_errno;
			return -1;
		}
		strbuf_release(&sb);
	}
	return adjust_shared_perm(path);
}

108 109
int safe_create_leading_directories(char *path)
{
110
	char *pos = path + offset_1st_component(path);
111 112
	struct stat st;

113 114 115 116
	while (pos) {
		pos = strchr(pos, '/');
		if (!pos)
			break;
117 118 119 120 121
		while (*++pos == '/')
			;
		if (!*pos)
			break;
		*--pos = '\0';
122 123 124
		if (!stat(path, &st)) {
			/* path exists */
			if (!S_ISDIR(st.st_mode)) {
125
				*pos = '/';
126
				return -3;
127
			}
128
		}
129
		else if (mkdir(path, 0777)) {
130 131 132 133 134 135 136
			if (errno == EEXIST &&
			    !stat(path, &st) && S_ISDIR(st.st_mode)) {
				; /* somebody created it since we checked */
			} else {
				*pos = '/';
				return -1;
			}
137
		}
138 139 140 141
		else if (adjust_shared_perm(path)) {
			*pos = '/';
			return -2;
		}
142 143 144 145
		*pos++ = '/';
	}
	return 0;
}
146

147 148 149 150 151 152 153 154 155
int safe_create_leading_directories_const(const char *path)
{
	/* path points to cache entries, so xstrdup before messing with it */
	char *buf = xstrdup(path);
	int result = safe_create_leading_directories(buf);
	free(buf);
	return result;
}

156 157 158 159 160 161 162 163 164 165 166 167
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];
	}
}

168 169
/*
 * NOTE! This returns a statically allocated buffer, so you have to be
170
 * careful about using it. Do an "xstrdup()" if you need to save the
171
 * filename.
172 173 174
 *
 * 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 已提交
175
 * DB_ENVIRONMENT environment variable if it is not found in
176
 * the primary object database.
177 178 179
 */
char *sha1_file_name(const unsigned char *sha1)
{
180 181 182
	static char buf[PATH_MAX];
	const char *objdir;
	int len;
183

184 185 186 187 188 189 190 191 192 193 194 195
	objdir = get_object_directory();
	len = strlen(objdir);

	/* '/' + sha1(2) + '/' + sha1(38) + '\0' */
	if (len + 43 > PATH_MAX)
		die("insanely long object directory %s", objdir);
	memcpy(buf, objdir, len);
	buf[len] = '/';
	buf[len+3] = '/';
	buf[len+42] = '\0';
	fill_sha1_path(buf + len + 1, sha1);
	return buf;
196 197
}

198
static char *sha1_get_pack_name(const unsigned char *sha1,
J
Junio C Hamano 已提交
199
				char **name, char **base, const char *which)
200 201
{
	static const char hex[] = "0123456789abcdef";
202
	char *buf;
203 204
	int i;

205
	if (!*base) {
206 207
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
208
		*base = xmalloc(len + 60);
J
Junio C Hamano 已提交
209 210
		sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
			sha1_file_directory, which);
211
		*name = *base + len + 11;
212 213
	}

214
	buf = *name;
215 216 217 218 219 220

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

222
	return *base;
223 224
}

225
char *sha1_pack_name(const unsigned char *sha1)
226
{
227
	static char *name, *base;
228

J
Junio C Hamano 已提交
229
	return sha1_get_pack_name(sha1, &name, &base, "pack");
230
}
231

232 233 234
char *sha1_pack_index_name(const unsigned char *sha1)
{
	static char *name, *base;
J
Junio C Hamano 已提交
235

J
Junio C Hamano 已提交
236
	return sha1_get_pack_name(sha1, &name, &base, "idx");
237 238
}

239 240
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
241

242
static int git_open_noatime(const char *name);
M
Martin Waitz 已提交
243

J
Junio C Hamano 已提交
244 245
/*
 * Prepare alternate object database registry.
246 247 248 249 250
 *
 * 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,
251 252
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
253 254 255 256 257
 * 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 已提交
258
 */
259
static int link_alt_odb_entry(const char *entry, const char *relative_base, int depth)
260
{
261
	const char *objdir = get_object_directory();
M
Martin Waitz 已提交
262 263
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
264 265
	int pfxlen, entlen;
	struct strbuf pathbuf = STRBUF_INIT;
266

267
	if (!is_absolute_path(entry) && relative_base) {
268 269
		strbuf_addstr(&pathbuf, real_path(relative_base));
		strbuf_addch(&pathbuf, '/');
M
Martin Waitz 已提交
270
	}
271
	strbuf_addstr(&pathbuf, entry);
M
Martin Waitz 已提交
272

273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
	normalize_path_copy(pathbuf.buf, pathbuf.buf);

	pfxlen = strlen(pathbuf.buf);

	/*
	 * The trailing slash after the directory name is given by
	 * this function at the end. Remove duplicates.
	 */
	while (pfxlen && pathbuf.buf[pfxlen-1] == '/')
		pfxlen -= 1;

	entlen = pfxlen + 43; /* '/' + 2 hex + '/' + 38 hex + NUL */
	ent = xmalloc(sizeof(*ent) + entlen);
	memcpy(ent->base, pathbuf.buf, pfxlen);
	strbuf_release(&pathbuf);
M
Martin Waitz 已提交
288 289 290 291 292 293

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

	/* Detect cases where alternate disappeared */
294
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
		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;
		}
	}
311
	if (!strcmp(ent->base, objdir)) {
M
Martin Waitz 已提交
312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328
		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;
}

329
static void link_alt_odb_entries(const char *alt, int len, int sep,
M
Martin Waitz 已提交
330 331
				 const char *relative_base, int depth)
{
332 333 334
	struct string_list entries = STRING_LIST_INIT_NODUP;
	char *alt_copy;
	int i;
M
Martin Waitz 已提交
335 336 337 338 339 340 341

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

342
	alt_copy = xmemdupz(alt, len);
343 344 345 346
	string_list_split_in_place(&entries, alt_copy, sep, -1);
	for (i = 0; i < entries.nr; i++) {
		const char *entry = entries.items[i].string;
		if (entry[0] == '\0' || entry[0] == '#')
347
			continue;
348 349 350 351 352
		if (!is_absolute_path(entry) && depth) {
			error("%s: ignoring relative alternate object store %s",
					relative_base, entry);
		} else {
			link_alt_odb_entry(entry, relative_base, depth);
353 354
		}
	}
355 356
	string_list_clear(&entries, 0);
	free(alt_copy);
357 358
}

359
void read_info_alternates(const char * relative_base, int depth)
360
{
361
	char *map;
362
	size_t mapsz;
363
	struct stat st;
364 365 366 367 368
	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 已提交
369
	int fd;
370

371
	sprintf(path, "%s/%s", relative_base, alt_file_name);
372
	fd = git_open_noatime(path);
373 374 375 376
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
377
		return;
378
	}
379 380
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
381 382
	close(fd);

383
	link_alt_odb_entries(map, mapsz, '\n', relative_base, depth);
M
Martin Waitz 已提交
384

385
	munmap(map, mapsz);
386 387
}

388 389 390
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
391
	int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
392
	char *alt = mkpath("%s\n", reference);
393 394 395 396
	write_or_die(fd, alt, strlen(alt));
	if (commit_lock_file(lock))
		die("could not close alternates file");
	if (alt_odb_tail)
397
		link_alt_odb_entries(alt, strlen(alt), '\n', NULL, 0);
398 399
}

400 401 402 403 404 405 406 407 408 409
void foreach_alt_odb(alt_odb_fn fn, void *cb)
{
	struct alternate_object_database *ent;

	prepare_alt_odb();
	for (ent = alt_odb_list; ent; ent = ent->next)
		if (fn(ent, cb))
			return;
}

M
Martin Waitz 已提交
410 411
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
412
	const char *alt;
M
Martin Waitz 已提交
413

S
Shawn O. Pearce 已提交
414 415 416
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
417 418 419 420
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
421
	link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
422 423 424 425

	read_info_alternates(get_object_directory(), 0);
}

426
static int has_loose_object_local(const unsigned char *sha1)
427 428
{
	char *name = sha1_file_name(sha1);
429 430
	return !access(name, F_OK);
}
431

432 433 434
int has_loose_object_nonlocal(const unsigned char *sha1)
{
	struct alternate_object_database *alt;
435
	prepare_alt_odb();
436
	for (alt = alt_odb_list; alt; alt = alt->next) {
437
		fill_sha1_path(alt->name, sha1);
438 439
		if (!access(alt->base, F_OK))
			return 1;
440
	}
441
	return 0;
442 443
}

444 445 446 447 448 449
static int has_loose_object(const unsigned char *sha1)
{
	return has_loose_object_local(sha1) ||
	       has_loose_object_nonlocal(sha1);
}

450
static unsigned int pack_used_ctr;
451 452 453
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
454 455
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
456
static size_t peak_pack_mapped;
457
static size_t pack_mapped;
458
struct packed_git *packed_git;
459

J
Junio C Hamano 已提交
460
void pack_report(void)
461 462
{
	fprintf(stderr,
463 464 465
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
466 467 468
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
469 470 471 472
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
473 474
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
475 476 477
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
478
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
479 480
}

481
static int check_packed_git_idx(const char *path,  struct packed_git *p)
482 483
{
	void *idx_map;
484
	struct pack_idx_header *hdr;
485
	size_t idx_size;
486
	uint32_t version, nr, i, *index;
487
	int fd = git_open_noatime(path);
488
	struct stat st;
489

490 491 492 493 494 495
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
496
	idx_size = xsize_t(st.st_size);
497 498 499 500
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
501
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
502 503
	close(fd);

504 505
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
506 507 508
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
509
			return error("index file %s is version %"PRIu32
510 511 512 513 514 515
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
516

517
	nr = 0;
518
	index = idx_map;
519 520
	if (version > 1)
		index += 2;  /* skip index header */
521
	for (i = 0; i < 256; i++) {
522
		uint32_t n = ntohl(index[i]);
523 524
		if (n < nr) {
			munmap(idx_map, idx_size);
525
			return error("non-monotonic index %s", path);
526
		}
527 528 529
		nr = n;
	}

530 531 532 533 534 535 536 537 538 539
	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);
540
			return error("wrong index v1 file size in %s", path);
541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556
		}
	} 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 已提交
557 558 559 560
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
561
			munmap(idx_map, idx_size);
562
			return error("wrong index v2 file size in %s", path);
563
		}
564 565 566 567 568 569 570 571 572
		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);
573
		}
574
	}
575

576
	p->index_version = version;
577 578
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
579
	p->num_objects = nr;
580 581 582
	return 0;
}

583
int open_pack_index(struct packed_git *p)
584 585 586 587 588 589 590 591 592 593 594 595 596 597
{
	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;
}

598 599 600 601
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
602
{
603 604 605 606 607 608 609 610
	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;
611 612
			}
		}
613
		w_l = w;
614
	}
615 616
}

617
static int unuse_one_window(struct packed_git *current)
618 619 620 621 622 623 624 625
{
	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);
626 627 628 629 630
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
631
		else
632 633
			lru_p->windows = lru_w->next;
		free(lru_w);
634
		pack_open_windows--;
635 636 637
		return 1;
	}
	return 0;
638 639
}

640
void release_pack_memory(size_t need)
641 642
{
	size_t cur = pack_mapped;
643
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
644 645 646
		; /* nothing */
}

647 648 649 650 651 652 653
void *xmmap(void *start, size_t length,
	int prot, int flags, int fd, off_t offset)
{
	void *ret = mmap(start, length, prot, flags, fd, offset);
	if (ret == MAP_FAILED) {
		if (!length)
			return NULL;
654
		release_pack_memory(length);
655 656 657 658 659 660 661
		ret = mmap(start, length, prot, flags, fd, offset);
		if (ret == MAP_FAILED)
			die_errno("Out of memory? mmap failed");
	}
	return ret;
}

662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677
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);
	}
}

678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754
/*
 * The LRU pack is the one with the oldest MRU window, preferring packs
 * with no used windows, or the oldest mtime if it has no windows allocated.
 */
static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
{
	struct pack_window *w, *this_mru_w;
	int has_windows_inuse = 0;

	/*
	 * Reject this pack if it has windows and the previously selected
	 * one does not.  If this pack does not have windows, reject
	 * it if the pack file is newer than the previously selected one.
	 */
	if (*lru_p && !*mru_w && (p->windows || p->mtime > (*lru_p)->mtime))
		return;

	for (w = this_mru_w = p->windows; w; w = w->next) {
		/*
		 * Reject this pack if any of its windows are in use,
		 * but the previously selected pack did not have any
		 * inuse windows.  Otherwise, record that this pack
		 * has windows in use.
		 */
		if (w->inuse_cnt) {
			if (*accept_windows_inuse)
				has_windows_inuse = 1;
			else
				return;
		}

		if (w->last_used > this_mru_w->last_used)
			this_mru_w = w;

		/*
		 * Reject this pack if it has windows that have been
		 * used more recently than the previously selected pack.
		 * If the previously selected pack had windows inuse and
		 * we have not encountered a window in this pack that is
		 * inuse, skip this check since we prefer a pack with no
		 * inuse windows to one that has inuse windows.
		 */
		if (*mru_w && *accept_windows_inuse == has_windows_inuse &&
		    this_mru_w->last_used > (*mru_w)->last_used)
			return;
	}

	/*
	 * Select this pack.
	 */
	*mru_w = this_mru_w;
	*lru_p = p;
	*accept_windows_inuse = has_windows_inuse;
}

static int close_one_pack(void)
{
	struct packed_git *p, *lru_p = NULL;
	struct pack_window *mru_w = NULL;
	int accept_windows_inuse = 1;

	for (p = packed_git; p; p = p->next) {
		if (p->pack_fd == -1)
			continue;
		find_lru_pack(p, &lru_p, &mru_w, &accept_windows_inuse);
	}

	if (lru_p) {
		close(lru_p->pack_fd);
		pack_open_fds--;
		lru_p->pack_fd = -1;
		return 1;
	}

	return 0;
}

755
void unuse_pack(struct pack_window **w_cursor)
756
{
757 758 759 760 761
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
762 763
}

764 765 766 767 768 769 770 771
void close_pack_index(struct packed_git *p)
{
	if (p->index_data) {
		munmap((void *)p->index_data, p->index_size);
		p->index_data = NULL;
	}
}

772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788
/*
 * This is used by git-repack in case a newly created pack happens to
 * contain the same set of objects as an existing one.  In that case
 * the resulting file might be different even if its name would be the
 * same.  It is best to close any reference to the old pack before it is
 * replaced on disk.  Of course no index pointers nor windows for given pack
 * must subsist at this point.  If ever objects from this pack are requested
 * again, the new version of the pack will be reinitialized through
 * reprepare_packed_git().
 */
void free_pack_by_name(const char *pack_name)
{
	struct packed_git *p, **pp = &packed_git;

	while (*pp) {
		p = *pp;
		if (strcmp(pack_name, p->pack_name) == 0) {
789
			clear_delta_base_cache();
790
			close_pack_windows(p);
791
			if (p->pack_fd != -1) {
792
				close(p->pack_fd);
793 794
				pack_open_fds--;
			}
795
			close_pack_index(p);
796 797
			free(p->bad_object_sha1);
			*pp = p->next;
798 799
			if (last_found_pack == p)
				last_found_pack = NULL;
800 801 802 803 804 805 806
			free(p);
			return;
		}
		pp = &p->next;
	}
}

807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824
static unsigned int get_max_fd_limit(void)
{
#ifdef RLIMIT_NOFILE
	struct rlimit lim;

	if (getrlimit(RLIMIT_NOFILE, &lim))
		die_errno("cannot get RLIMIT_NOFILE");

	return lim.rlim_cur;
#elif defined(_SC_OPEN_MAX)
	return sysconf(_SC_OPEN_MAX);
#elif defined(OPEN_MAX)
	return OPEN_MAX;
#else
	return 1; /* see the caller ;-) */
#endif
}

825 826 827 828 829
/*
 * 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)
830
{
831 832 833 834
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
835
	long fd_flag;
836

837 838 839
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

840
	if (!pack_max_fds) {
841
		unsigned int max_fds = get_max_fd_limit();
842 843 844 845 846 847 848 849

		/* Save 3 for stdin/stdout/stderr, 22 for work */
		if (25 < max_fds)
			pack_max_fds = max_fds - 25;
		else
			pack_max_fds = 1;
	}

850
	while (pack_max_fds <= pack_open_fds && close_one_pack())
851 852
		; /* nothing */

853
	p->pack_fd = git_open_noatime(p->pack_name);
854
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
855
		return -1;
856
	pack_open_fds++;
857 858

	/* If we created the struct before we had the pack we lack size. */
859 860
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
861
			return error("packfile %s not a regular file", p->pack_name);
862
		p->pack_size = st.st_size;
863
	} else if (p->pack_size != st.st_size)
864
		return error("packfile %s size changed", p->pack_name);
865

866 867 868 869 870
	/* 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)
871
		return error("cannot determine file descriptor flags");
872 873
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
874
		return error("cannot set FD_CLOEXEC");
875

876
	/* Verify we recognize this pack file format. */
877
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
878
		return error("file %s is far too short to be a packfile", p->pack_name);
879
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
880
		return error("file %s is not a GIT packfile", p->pack_name);
881
	if (!pack_version_ok(hdr.hdr_version))
882 883
		return error("packfile %s is version %"PRIu32" and not"
			" supported (try upgrading GIT to a newer version)",
884 885 886
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
887
	if (p->num_objects != ntohl(hdr.hdr_entries))
888 889
		return error("packfile %s claims to have %"PRIu32" objects"
			     " while index indicates %"PRIu32" objects",
N
Nicolas Pitre 已提交
890 891
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
892
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
893
		return error("end of packfile %s is unavailable", p->pack_name);
894
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
895
		return error("packfile %s signature is unavailable", p->pack_name);
896
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
897
	if (hashcmp(sha1, idx_sha1))
898 899
		return error("packfile %s does not match index", p->pack_name);
	return 0;
900 901
}

902 903 904 905 906 907
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);
908
		pack_open_fds--;
909 910 911 912 913
		p->pack_fd = -1;
	}
	return -1;
}

914
static int in_window(struct pack_window *win, off_t offset)
915 916 917 918 919 920 921 922 923 924 925 926
{
	/* 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);
}

927
unsigned char *use_pack(struct packed_git *p,
928
		struct pack_window **w_cursor,
929
		off_t offset,
930
		unsigned long *left)
931
{
932
	struct pack_window *win = *w_cursor;
933

F
Felipe Contreras 已提交
934
	/* Since packfiles end in a hash of their content and it's
935 936 937 938
	 * 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.
	 */
939 940
	if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
941 942 943 944 945 946 947 948 949 950 951
	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) {
952
			size_t window_align = packed_git_window_size / 2;
953
			off_t len;
954 955 956 957

			if (p->pack_fd == -1 && open_packed_git(p))
				die("packfile %s cannot be accessed", p->pack_name);

958
			win = xcalloc(1, sizeof(*win));
959
			win->offset = (offset / window_align) * window_align;
960 961 962 963
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
964
			pack_mapped += win->len;
965
			while (packed_git_limit < pack_mapped
966
				&& unuse_one_window(p))
967
				; /* nothing */
968
			win->base = xmmap(NULL, win->len,
969 970 971
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
972 973 974
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
975 976 977 978 979 980
			if (!win->offset && win->len == p->pack_size
				&& !p->do_not_close) {
				close(p->pack_fd);
				pack_open_fds--;
				p->pack_fd = -1;
			}
981 982 983 984 985 986
			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;
987 988 989
			win->next = p->windows;
			p->windows = win;
		}
990
	}
991 992 993 994 995
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
996
	offset -= win->offset;
997
	if (left)
998
		*left = win->len - xsize_t(offset);
999
	return win->base + offset;
1000 1001
}

1002 1003 1004 1005 1006 1007 1008 1009
static struct packed_git *alloc_packed_git(int extra)
{
	struct packed_git *p = xmalloc(sizeof(*p) + extra);
	memset(p, 0, sizeof(*p));
	p->pack_fd = -1;
	return p;
}

1010 1011
static void try_to_free_pack_memory(size_t size)
{
1012
	release_pack_memory(size);
1013 1014
}

1015
struct packed_git *add_packed_git(const char *path, int path_len, int local)
1016
{
1017
	static int have_set_try_to_free_routine;
1018
	struct stat st;
1019
	struct packed_git *p = alloc_packed_git(path_len + 2);
1020

1021 1022 1023 1024 1025
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

1026 1027 1028 1029 1030
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
	path_len -= strlen(".idx");
1031 1032
	if (path_len < 1) {
		free(p);
1033
		return NULL;
1034
	}
1035
	memcpy(p->pack_name, path, path_len);
1036 1037 1038 1039 1040

	strcpy(p->pack_name + path_len, ".keep");
	if (!access(p->pack_name, F_OK))
		p->pack_keep = 1;

1041
	strcpy(p->pack_name + path_len, ".pack");
1042
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1043
		free(p);
1044 1045
		return NULL;
	}
1046

1047 1048 1049 1050
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
1051
	p->pack_local = local;
1052
	p->mtime = st.st_mtime;
1053 1054
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
1055 1056 1057
	return p;
}

1058
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1059
{
1060
	const char *path = sha1_pack_name(sha1);
1061
	struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1062

1063 1064
	strcpy(p->pack_name, path);
	hashcpy(p->sha1, sha1);
1065 1066
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
1067
		return NULL;
1068
	}
1069 1070 1071 1072 1073 1074

	return p;
}

void install_packed_git(struct packed_git *pack)
{
1075 1076 1077
	if (pack->pack_fd != -1)
		pack_open_fds++;

1078 1079 1080 1081
	pack->next = packed_git;
	packed_git = pack;
}

1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138
void (*report_garbage)(const char *desc, const char *path);

static void report_helper(const struct string_list *list,
			  int seen_bits, int first, int last)
{
	const char *msg;
	switch (seen_bits) {
	case 0:
		msg = "no corresponding .idx nor .pack";
		break;
	case 1:
		msg = "no corresponding .idx";
		break;
	case 2:
		msg = "no corresponding .pack";
		break;
	default:
		return;
	}
	for (; first < last; first++)
		report_garbage(msg, list->items[first].string);
}

static void report_pack_garbage(struct string_list *list)
{
	int i, baselen = -1, first = 0, seen_bits = 0;

	if (!report_garbage)
		return;

	sort_string_list(list);

	for (i = 0; i < list->nr; i++) {
		const char *path = list->items[i].string;
		if (baselen != -1 &&
		    strncmp(path, list->items[first].string, baselen)) {
			report_helper(list, seen_bits, first, i);
			baselen = -1;
			seen_bits = 0;
		}
		if (baselen == -1) {
			const char *dot = strrchr(path, '.');
			if (!dot) {
				report_garbage("garbage found", path);
				continue;
			}
			baselen = dot - path + 1;
			first = i;
		}
		if (!strcmp(path + baselen, "pack"))
			seen_bits |= 1;
		else if (!strcmp(path + baselen, "idx"))
			seen_bits |= 2;
	}
	report_helper(list, seen_bits, first, list->nr);
}

1139
static void prepare_packed_git_one(char *objdir, int local)
1140
{
1141 1142 1143 1144
	/* 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];
1145 1146 1147
	int len;
	DIR *dir;
	struct dirent *de;
1148
	struct string_list garbage = STRING_LIST_INIT_DUP;
1149 1150 1151 1152

	sprintf(path, "%s/pack", objdir);
	len = strlen(path);
	dir = opendir(path);
1153
	if (!dir) {
J
Junio C Hamano 已提交
1154
		if (errno != ENOENT)
1155
			error("unable to open object pack directory: %s: %s",
J
Junio C Hamano 已提交
1156
			      path, strerror(errno));
1157
		return;
1158
	}
1159 1160 1161 1162 1163
	path[len++] = '/';
	while ((de = readdir(dir)) != NULL) {
		int namelen = strlen(de->d_name);
		struct packed_git *p;

1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174
		if (len + namelen + 1 > sizeof(path)) {
			if (report_garbage) {
				struct strbuf sb = STRBUF_INIT;
				strbuf_addf(&sb, "%.*s/%s", len - 1, path, de->d_name);
				report_garbage("path too long", sb.buf);
				strbuf_release(&sb);
			}
			continue;
		}

		if (is_dot_or_dotdot(de->d_name))
1175 1176
			continue;

1177
		strcpy(path + len, de->d_name);
1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191

		if (has_extension(de->d_name, ".idx")) {
			/* Don't reopen a pack we already have. */
			for (p = packed_git; p; p = p->next) {
				if (!memcmp(path, p->pack_name, len + namelen - 4))
					break;
			}
			if (p == NULL &&
			    /*
			     * See if it really is a valid .idx file with
			     * corresponding .pack file that we can map.
			     */
			    (p = add_packed_git(path, len + namelen, local)) != NULL)
				install_packed_git(p);
1192
		}
1193 1194 1195 1196 1197 1198 1199 1200 1201 1202

		if (!report_garbage)
			continue;

		if (has_extension(de->d_name, ".idx") ||
		    has_extension(de->d_name, ".pack") ||
		    has_extension(de->d_name, ".keep"))
			string_list_append(&garbage, path);
		else
			report_garbage("garbage found", path);
1203
	}
1204
	closedir(dir);
1205 1206
	report_pack_garbage(&garbage);
	string_list_clear(&garbage, 0);
1207 1208
}

1209 1210 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 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262
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);
}

1263
static int prepare_packed_git_run_once = 0;
1264
void prepare_packed_git(void)
1265
{
1266
	struct alternate_object_database *alt;
1267

1268
	if (prepare_packed_git_run_once)
1269
		return;
1270
	prepare_packed_git_one(get_object_directory(), 1);
1271
	prepare_alt_odb();
1272
	for (alt = alt_odb_list; alt; alt = alt->next) {
1273
		alt->name[-1] = 0;
1274
		prepare_packed_git_one(alt->base, 0);
1275
		alt->name[-1] = '/';
1276
	}
1277
	rearrange_packed_git();
1278 1279 1280
	prepare_packed_git_run_once = 1;
}

1281
void reprepare_packed_git(void)
1282
{
1283
	discard_revindex();
1284 1285
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1286 1287
}

1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299
static void mark_bad_packed_object(struct packed_git *p,
				   const unsigned char *sha1)
{
	unsigned i;
	for (i = 0; i < p->num_bad_objects; i++)
		if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
			return;
	p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
	hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
	p->num_bad_objects++;
}

1300
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1301 1302 1303 1304 1305 1306 1307
{
	struct packed_git *p;
	unsigned i;

	for (p = packed_git; p; p = p->next)
		for (i = 0; i < p->num_bad_objects; i++)
			if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
1308 1309
				return p;
	return NULL;
1310 1311
}

1312 1313 1314 1315 1316 1317 1318 1319
/*
 * With an in-core object data in "map", rehash it to make sure the
 * object name actually matches "sha1" to detect object corruption.
 * With "map" == NULL, try reading the object named with "sha1" using
 * the streaming interface and rehash it to do the same.
 */
int check_sha1_signature(const unsigned char *sha1, void *map,
			 unsigned long size, const char *type)
1320 1321
{
	unsigned char real_sha1[20];
1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346
	enum object_type obj_type;
	struct git_istream *st;
	git_SHA_CTX c;
	char hdr[32];
	int hdrlen;

	if (map) {
		hash_sha1_file(map, size, type, real_sha1);
		return hashcmp(sha1, real_sha1) ? -1 : 0;
	}

	st = open_istream(sha1, &obj_type, &size, NULL);
	if (!st)
		return -1;

	/* Generate the header */
	hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;

	/* Sha1.. */
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, hdrlen);
	for (;;) {
		char buf[1024 * 16];
		ssize_t readlen = read_istream(st, buf, sizeof(buf));

1347 1348 1349 1350
		if (readlen < 0) {
			close_istream(st);
			return -1;
		}
1351 1352 1353 1354 1355 1356
		if (!readlen)
			break;
		git_SHA1_Update(&c, buf, readlen);
	}
	git_SHA1_Final(real_sha1, &c);
	close_istream(st);
1357
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1358 1359
}

1360
static int git_open_noatime(const char *name)
1361 1362 1363
{
	static int sha1_file_open_flag = O_NOATIME;

1364 1365
	for (;;) {
		int fd = open(name, O_RDONLY | sha1_file_open_flag);
1366
		if (fd >= 0)
1367 1368 1369 1370
			return fd;

		/* Might the failure be due to O_NOATIME? */
		if (errno != ENOENT && sha1_file_open_flag) {
1371
			sha1_file_open_flag = 0;
1372 1373 1374 1375
			continue;
		}

		return -1;
1376 1377 1378
	}
}

1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398
static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
{
	char *name = sha1_file_name(sha1);
	struct alternate_object_database *alt;

	if (!lstat(name, st))
		return 0;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
		fill_sha1_path(name, sha1);
		if (!lstat(alt->base, st))
			return 0;
	}

	return -1;
}

1399 1400 1401 1402 1403 1404
static int open_sha1_file(const unsigned char *sha1)
{
	int fd;
	char *name = sha1_file_name(sha1);
	struct alternate_object_database *alt;

1405
	fd = git_open_noatime(name);
1406 1407 1408 1409 1410 1411 1412 1413
	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);
1414
		fd = git_open_noatime(alt->base);
1415 1416 1417 1418 1419 1420
		if (fd >= 0)
			return fd;
	}
	return -1;
}

1421
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1422 1423
{
	void *map;
1424
	int fd;
1425

1426 1427 1428 1429
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1430

1431 1432
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
1433 1434 1435 1436 1437
			if (!*size) {
				/* mmap() is forbidden on empty files */
				error("object file %s is empty", sha1_file_name(sha1));
				return NULL;
			}
1438
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1439
		}
1440
		close(fd);
1441 1442 1443 1444
	}
	return map;
}

1445 1446 1447 1448 1449 1450 1451 1452
/*
 * 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 no longer write loose objects in that
 * format.
 */
static int experimental_loose_object(unsigned char *map)
1453 1454 1455 1456
{
	unsigned int word;

	/*
1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481
	 * We must determine if the buffer contains the standard
	 * zlib-deflated stream or the experimental format based
	 * on the in-pack object format. Compare the header byte
	 * for each format:
	 *
	 * RFC1950 zlib w/ deflate : 0www1000 : 0 <= www <= 7
	 * Experimental pack-based : Stttssss : ttt = 1,2,3,4
	 *
	 * If bit 7 is clear and bits 0-3 equal 8, the buffer MUST be
	 * in standard loose-object format, UNLESS it is a Git-pack
	 * format object *exactly* 8 bytes in size when inflated.
	 *
	 * However, RFC1950 also specifies that the 1st 16-bit word
	 * must be divisible by 31 - this checksum tells us our buffer
	 * is in the standard format, giving a false positive only if
	 * the 1st word of the Git-pack format object happens to be
	 * divisible by 31, ie:
	 *      ((byte0 * 256) + byte1) % 31 = 0
	 *   =>        0ttt10000www1000 % 31 = 0
	 *
	 * As it happens, this case can only arise for www=3 & ttt=1
	 * - ie, a Commit object, which would have to be 8 bytes in
	 * size. As no Commit can be that small, we find that the
	 * combination of these two criteria (bitmask & checksum)
	 * can always correctly determine the buffer format.
1482 1483
	 */
	word = (map[0] << 8) + map[1];
1484
	if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1485
		return 0;
1486 1487
	else
		return 1;
1488 1489
}

1490 1491
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1492
{
1493
	unsigned shift;
1494
	unsigned long size, c;
1495 1496 1497 1498 1499 1500 1501
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1502
		if (len <= used || bitsizeof(long) <= shift) {
1503
			error("bad object header");
1504 1505
			size = used = 0;
			break;
1506
		}
1507 1508 1509 1510 1511 1512 1513 1514
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

J
Junio C Hamano 已提交
1515
int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1516 1517 1518 1519 1520 1521
{
	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 */
1522
	};
1523
	enum object_type type;
1524

1525 1526 1527 1528 1529
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1530 1531
	stream->avail_out = bufsiz;

1532 1533 1534 1535 1536 1537 1538 1539 1540 1541
	if (experimental_loose_object(map)) {
		/*
		 * The old experimental format we no longer produce;
		 * we can still read it.
		 */
		used = unpack_object_header_buffer(map, mapsize, &type, &size);
		if (!used || !valid_loose_object_type[type])
			return -1;
		map += used;
		mapsize -= used;
1542

1543 1544 1545 1546
		/* Set up the stream for the rest.. */
		stream->next_in = map;
		stream->avail_in = mapsize;
		git_inflate_init(stream);
1547

1548 1549 1550 1551 1552
		/* And generate the fake traditional header */
		stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
						 typename(type), size);
		return 0;
	}
1553
	git_inflate_init(stream);
1554
	return git_inflate(stream, 0);
1555 1556
}

1557
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1558 1559
{
	int bytes = strlen(buffer) + 1;
1560
	unsigned char *buf = xmallocz(size);
1561
	unsigned long n;
1562
	int status = Z_OK;
1563

1564 1565 1566 1567 1568
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1569 1570 1571 1572
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1573
		 * expect no more output and set avail_out to zero,
1574 1575 1576 1577 1578 1579 1580 1581 1582
		 * 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.
		 */
1583 1584
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1585
		while (status == Z_OK)
1586
			status = git_inflate(stream, Z_FINISH);
1587
	}
1588
	if (status == Z_STREAM_END && !stream->avail_in) {
1589
		git_inflate_end(stream);
1590 1591 1592 1593 1594 1595 1596 1597 1598 1599
		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;
1600 1601 1602 1603 1604 1605 1606
}

/*
 * 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.
 */
1607
int parse_sha1_header(const char *hdr, unsigned long *sizep)
1608
{
1609
	char type[10];
1610 1611 1612 1613
	int i;
	unsigned long size;

	/*
J
Junio C Hamano 已提交
1614
	 * The type can be at most ten bytes (including the
1615
	 * terminating '\0' that we add), and is followed by
1616
	 * a space.
1617
	 */
1618
	i = 0;
1619 1620 1621 1622
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1623 1624
		type[i++] = c;
		if (i >= sizeof(type))
1625 1626
			return -1;
	}
1627
	type[i] = 0;
1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649

	/*
	 * 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
	 */
1650
	return *hdr ? -1 : type_from_string(type);
1651 1652
}

1653
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1654
{
1655
	int ret;
1656
	git_zstream stream;
1657
	char hdr[8192];
1658

1659
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1660
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1661 1662
		return NULL;

1663
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1664 1665
}

N
Nicolas Pitre 已提交
1666 1667 1668 1669 1670 1671
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;
1672
	git_zstream stream;
N
Nicolas Pitre 已提交
1673 1674 1675 1676 1677 1678
	int st;

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

1679
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
1680 1681 1682
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
1683
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
1684 1685 1686
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
1687
	git_inflate_end(&stream);
1688 1689 1690 1691
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704

	/* 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));
}

1705
static off_t get_delta_base(struct packed_git *p,
1706
				    struct pack_window **w_curs,
1707
				    off_t *curpos,
1708
				    enum object_type type,
1709
				    off_t delta_obj_offset)
1710
{
1711
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1712
	off_t base_offset;
1713

1714 1715 1716 1717 1718 1719
	/* 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.
	 */
1720
	if (type == OBJ_OFS_DELTA) {
1721 1722 1723 1724 1725
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1726
			if (!base_offset || MSB(base_offset, 7))
1727
				return 0;  /* overflow */
1728 1729 1730 1731
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
1732
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
1733
			return 0;  /* out of bound */
1734
		*curpos += used;
1735
	} else if (type == OBJ_REF_DELTA) {
1736 1737
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
1738
		*curpos += 20;
1739 1740
	} else
		die("I am totally screwed");
1741
	return base_offset;
1742 1743
}

1744 1745 1746 1747
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
1748
{
1749
	unsigned char *base;
1750
	unsigned long left;
1751
	unsigned long used;
1752
	enum object_type type;
1753

1754
	/* use_pack() assures us we have [base, base + 20) available
1755
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
1756
	 * size that is assured.)  With our object header encoding
1757 1758 1759
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1760
	base = use_pack(p, w_curs, *curpos, &left);
1761 1762 1763 1764 1765
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
1766

1767
	return type;
1768 1769
}

1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787
static int retry_bad_packed_offset(struct packed_git *p, off_t obj_offset)
{
	int type;
	struct revindex_entry *revidx;
	const unsigned char *sha1;
	revidx = find_pack_revindex(p, obj_offset);
	if (!revidx)
		return OBJ_BAD;
	sha1 = nth_packed_object_sha1(p, revidx->nr);
	mark_bad_packed_object(p, sha1);
	type = sha1_object_info(sha1, NULL);
	if (type <= OBJ_NONE)
		return OBJ_BAD;
	return type;
}

#define POI_STACK_PREALLOC 64

1788 1789 1790 1791 1792
static enum object_type packed_to_object_type(struct packed_git *p,
					      off_t obj_offset,
					      enum object_type type,
					      struct pack_window **w_curs,
					      off_t curpos)
1793
{
1794 1795 1796
	off_t small_poi_stack[POI_STACK_PREALLOC];
	off_t *poi_stack = small_poi_stack;
	int poi_stack_nr = 0, poi_stack_alloc = POI_STACK_PREALLOC;
1797

1798 1799
	while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
		off_t base_offset;
1800
		unsigned long size;
1801 1802 1803 1804 1805 1806 1807 1808 1809 1810
		/* Push the object we're going to leave behind */
		if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
			poi_stack_alloc = alloc_nr(poi_stack_nr);
			poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
			memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
		} else {
			ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
		}
		poi_stack[poi_stack_nr++] = obj_offset;
		/* If parsing the base offset fails, just unwind */
1811
		base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1812 1813 1814
		if (!base_offset)
			goto unwind;
		curpos = obj_offset = base_offset;
1815
		type = unpack_object_header(p, w_curs, &curpos, &size);
1816 1817 1818 1819 1820 1821 1822 1823 1824 1825
		if (type <= OBJ_NONE) {
			/* If getting the base itself fails, we first
			 * retry the base, otherwise unwind */
			type = retry_bad_packed_offset(p, base_offset);
			if (type > OBJ_NONE)
				goto out;
			goto unwind;
		}
	}

1826
	switch (type) {
1827
	case OBJ_BAD:
1828 1829 1830 1831
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1832
		break;
1833
	default:
1834 1835 1836
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
1837
	}
1838 1839 1840 1841

out:
	if (poi_stack != small_poi_stack)
		free(poi_stack);
1842
	return type;
1843 1844 1845 1846 1847 1848 1849 1850 1851 1852

unwind:
	while (poi_stack_nr) {
		obj_offset = poi_stack[--poi_stack_nr];
		type = retry_bad_packed_offset(p, obj_offset);
		if (type > OBJ_NONE)
			goto out;
	}
	type = OBJ_BAD;
	goto out;
1853 1854
}

1855
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1856
			      struct object_info *oi)
1857 1858 1859 1860 1861 1862
{
	struct pack_window *w_curs = NULL;
	unsigned long size;
	off_t curpos = obj_offset;
	enum object_type type;

1863 1864 1865 1866
	/*
	 * We always get the representation type, but only convert it to
	 * a "real" type later if the caller is interested.
	 */
1867 1868
	type = unpack_object_header(p, &w_curs, &curpos, &size);

1869
	if (oi->sizep) {
1870 1871 1872 1873 1874 1875 1876 1877
		if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
			off_t tmp_pos = curpos;
			off_t base_offset = get_delta_base(p, &w_curs, &tmp_pos,
							   type, obj_offset);
			if (!base_offset) {
				type = OBJ_BAD;
				goto out;
			}
1878 1879
			*oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
			if (*oi->sizep == 0) {
1880 1881 1882 1883
				type = OBJ_BAD;
				goto out;
			}
		} else {
1884
			*oi->sizep = size;
1885 1886 1887
		}
	}

1888
	if (oi->disk_sizep) {
1889
		struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
1890
		*oi->disk_sizep = revidx[1].offset - obj_offset;
1891 1892
	}

1893 1894 1895
	if (oi->typep) {
		*oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
		if (*oi->typep < 0) {
1896 1897 1898 1899
			type = OBJ_BAD;
			goto out;
		}
	}
1900 1901 1902 1903 1904 1905

out:
	unuse_pack(&w_curs);
	return type;
}

1906
static void *unpack_compressed_entry(struct packed_git *p,
1907
				    struct pack_window **w_curs,
1908
				    off_t curpos,
1909
				    unsigned long size)
1910 1911
{
	int st;
1912
	git_zstream stream;
1913
	unsigned char *buffer, *in;
1914

1915
	buffer = xmallocz(size);
1916 1917
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
1918
	stream.avail_out = size + 1;
1919

1920
	git_inflate_init(&stream);
1921
	do {
1922
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1923
		stream.next_in = in;
1924
		st = git_inflate(&stream, Z_FINISH);
1925 1926
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
1927
		curpos += stream.next_in - in;
1928
	} while (st == Z_OK || st == Z_BUF_ERROR);
1929
	git_inflate_end(&stream);
1930 1931 1932 1933 1934 1935 1936 1937
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1938 1939
#define MAX_DELTA_CACHE (256)

1940
static size_t delta_base_cached;
1941 1942 1943 1944 1945 1946

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

1947
static struct delta_base_cache_entry {
1948 1949
	struct delta_base_cache_lru_list lru;
	void *data;
1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961
	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);
1962
	return hash % MAX_DELTA_CACHE;
1963 1964
}

1965 1966
static struct delta_base_cache_entry *
get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
1967 1968
{
	unsigned long hash = pack_entry_hash(p, base_offset);
1969 1970 1971 1972 1973 1974
	return delta_base_cache + hash;
}

static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
				     struct packed_git *p, off_t base_offset)
{
1975 1976 1977
	return (ent->data && ent->p == p && ent->base_offset == base_offset);
}

1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992
static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
{
	struct delta_base_cache_entry *ent;
	ent = get_delta_base_cache_entry(p, base_offset);
	return eq_delta_base_cache_entry(ent, p, base_offset);
}

static void clear_delta_base_cache_entry(struct delta_base_cache_entry *ent)
{
	ent->data = NULL;
	ent->lru.next->prev = ent->lru.prev;
	ent->lru.prev->next = ent->lru.next;
	delta_base_cached -= ent->size;
}

1993
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1994
	unsigned long *base_size, enum object_type *type, int keep_cache)
1995
{
1996
	struct delta_base_cache_entry *ent;
1997 1998
	void *ret;

1999 2000 2001
	ent = get_delta_base_cache_entry(p, base_offset);

	if (!eq_delta_base_cache_entry(ent, p, base_offset))
2002
		return unpack_entry(p, base_offset, type, base_size);
2003

2004 2005 2006 2007 2008
	ret = ent->data;

	if (!keep_cache)
		clear_delta_base_cache_entry(ent);
	else
P
Pierre Habouzit 已提交
2009
		ret = xmemdupz(ent->data, ent->size);
2010 2011 2012
	*type = ent->type;
	*base_size = ent->size;
	return ret;
2013 2014
}

2015 2016 2017 2018 2019
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
2020 2021
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
2022 2023 2024 2025
		delta_base_cached -= ent->size;
	}
}

2026 2027 2028 2029 2030 2031 2032
void clear_delta_base_cache(void)
{
	unsigned long p;
	for (p = 0; p < MAX_DELTA_CACHE; p++)
		release_delta_base_cache(&delta_base_cache[p]);
}

2033 2034 2035
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
2036
	unsigned long hash = pack_entry_hash(p, base_offset);
2037
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
2038
	struct delta_base_cache_lru_list *lru;
2039

2040 2041
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
2042 2043 2044 2045 2046 2047

	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;
2048 2049 2050
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
2051 2052 2053 2054 2055 2056 2057
	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);
	}
2058

2059 2060 2061 2062 2063
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
2064 2065 2066 2067
	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;
2068 2069
}

2070 2071 2072
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

2073 2074 2075 2076
static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
{
	static FILE *log_file;

2077 2078 2079 2080 2081 2082 2083
	if (!log_pack_access)
		log_pack_access = getenv("GIT_TRACE_PACK_ACCESS");
	if (!log_pack_access)
		log_pack_access = no_log_pack_access;
	if (log_pack_access == no_log_pack_access)
		return;

2084 2085 2086 2087 2088
	if (!log_file) {
		log_file = fopen(log_pack_access, "w");
		if (!log_file) {
			error("cannot open pack access log '%s' for writing: %s",
			      log_pack_access, strerror(errno));
2089
			log_pack_access = no_log_pack_access;
2090 2091 2092 2093 2094 2095 2096 2097
			return;
		}
	}
	fprintf(log_file, "%s %"PRIuMAX"\n",
		p->pack_name, (uintmax_t)obj_offset);
	fflush(log_file);
}

2098 2099
int do_check_packed_object_crc;

2100 2101 2102 2103 2104 2105 2106
#define UNPACK_ENTRY_STACK_PREALLOC 64
struct unpack_entry_stack_ent {
	off_t obj_offset;
	off_t curpos;
	unsigned long size;
};

2107
void *unpack_entry(struct packed_git *p, off_t obj_offset,
2108
		   enum object_type *final_type, unsigned long *final_size)
2109
{
2110
	struct pack_window *w_curs = NULL;
2111
	off_t curpos = obj_offset;
2112 2113 2114 2115 2116 2117 2118
	void *data = NULL;
	unsigned long size;
	enum object_type type;
	struct unpack_entry_stack_ent small_delta_stack[UNPACK_ENTRY_STACK_PREALLOC];
	struct unpack_entry_stack_ent *delta_stack = small_delta_stack;
	int delta_stack_nr = 0, delta_stack_alloc = UNPACK_ENTRY_STACK_PREALLOC;
	int base_from_cache = 0;
2119

2120
	if (log_pack_access != no_log_pack_access)
2121 2122
		write_pack_access_log(p, obj_offset);

2123 2124 2125 2126 2127 2128
	/* PHASE 1: drill down to the innermost base object */
	for (;;) {
		off_t base_offset;
		int i;
		struct delta_base_cache_entry *ent;

2129 2130 2131 2132 2133 2134 2135 2136 2137 2138
		ent = get_delta_base_cache_entry(p, curpos);
		if (eq_delta_base_cache_entry(ent, p, curpos)) {
			type = ent->type;
			data = ent->data;
			size = ent->size;
			clear_delta_base_cache_entry(ent);
			base_from_cache = 1;
			break;
		}

2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182
		if (do_check_packed_object_crc && p->index_version > 1) {
			struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
			unsigned long len = revidx[1].offset - obj_offset;
			if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
				const unsigned char *sha1 =
					nth_packed_object_sha1(p, revidx->nr);
				error("bad packed object CRC for %s",
				      sha1_to_hex(sha1));
				mark_bad_packed_object(p, sha1);
				unuse_pack(&w_curs);
				return NULL;
			}
		}

		type = unpack_object_header(p, &w_curs, &curpos, &size);
		if (type != OBJ_OFS_DELTA && type != OBJ_REF_DELTA)
			break;

		base_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
		if (!base_offset) {
			error("failed to validate delta base reference "
			      "at offset %"PRIuMAX" from %s",
			      (uintmax_t)curpos, p->pack_name);
			/* bail to phase 2, in hopes of recovery */
			data = NULL;
			break;
		}

		/* push object, proceed to base */
		if (delta_stack_nr >= delta_stack_alloc
		    && delta_stack == small_delta_stack) {
			delta_stack_alloc = alloc_nr(delta_stack_nr);
			delta_stack = xmalloc(sizeof(*delta_stack)*delta_stack_alloc);
			memcpy(delta_stack, small_delta_stack,
			       sizeof(*delta_stack)*delta_stack_nr);
		} else {
			ALLOC_GROW(delta_stack, delta_stack_nr+1, delta_stack_alloc);
		}
		i = delta_stack_nr++;
		delta_stack[i].obj_offset = obj_offset;
		delta_stack[i].curpos = curpos;
		delta_stack[i].size = size;

		curpos = obj_offset = base_offset;
2183 2184
	}

2185 2186
	/* PHASE 2: handle the base */
	switch (type) {
2187 2188
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
2189 2190
		if (data)
			die("BUG in unpack_entry: left loop at a valid delta");
2191
		break;
2192 2193 2194 2195
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2196 2197
		if (!base_from_cache)
			data = unpack_compressed_entry(p, &w_curs, curpos, size);
2198
		break;
2199
	default:
2200 2201
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262
		      type, (uintmax_t)obj_offset, p->pack_name);
	}

	/* PHASE 3: apply deltas in order */

	/* invariants:
	 *   'data' holds the base data, or NULL if there was corruption
	 */
	while (delta_stack_nr) {
		void *delta_data;
		void *base = data;
		unsigned long delta_size, base_size = size;
		int i;

		data = NULL;

		if (base)
			add_delta_base_cache(p, obj_offset, base, base_size, type);

		if (!base) {
			/*
			 * We're probably in deep shit, but let's try to fetch
			 * the required base anyway from another pack or loose.
			 * This is costly but should happen only in the presence
			 * of a corrupted pack, and is better than failing outright.
			 */
			struct revindex_entry *revidx;
			const unsigned char *base_sha1;
			revidx = find_pack_revindex(p, obj_offset);
			if (revidx) {
				base_sha1 = nth_packed_object_sha1(p, revidx->nr);
				error("failed to read delta base object %s"
				      " at offset %"PRIuMAX" from %s",
				      sha1_to_hex(base_sha1), (uintmax_t)obj_offset,
				      p->pack_name);
				mark_bad_packed_object(p, base_sha1);
				base = read_object(base_sha1, &type, &base_size);
			}
		}

		i = --delta_stack_nr;
		obj_offset = delta_stack[i].obj_offset;
		curpos = delta_stack[i].curpos;
		delta_size = delta_stack[i].size;

		if (!base)
			continue;

		delta_data = unpack_compressed_entry(p, &w_curs, curpos, delta_size);

		if (!delta_data) {
			error("failed to unpack compressed delta "
			      "at offset %"PRIuMAX" from %s",
			      (uintmax_t)curpos, p->pack_name);
			data = NULL;
			continue;
		}

		data = patch_delta(base, base_size,
				   delta_data, delta_size,
				   &size);
2263 2264 2265 2266 2267 2268 2269 2270 2271

		/*
		 * We could not apply the delta; warn the user, but keep going.
		 * Our failure will be noticed either in the next iteration of
		 * the loop, or if this is the final delta, in the caller when
		 * we return NULL. Those code paths will take care of making
		 * a more explicit warning and retrying with another copy of
		 * the object.
		 */
2272
		if (!data)
2273
			error("failed to apply delta");
2274

2275
		free(delta_data);
2276
	}
2277 2278 2279 2280

	*final_type = type;
	*final_size = size;

2281
	unuse_pack(&w_curs);
2282
	return data;
2283 2284
}

2285
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2286
					    uint32_t n)
2287
{
2288
	const unsigned char *index = p->index_data;
2289 2290 2291 2292 2293
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
2294
	if (n >= p->num_objects)
2295
		return NULL;
2296 2297 2298 2299 2300 2301 2302 2303 2304
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

N
Nicolas Pitre 已提交
2305
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320
{
	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)));
	}
2321 2322
}

2323
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
2324
				  struct packed_git *p)
2325
{
2326 2327
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
2328 2329 2330 2331 2332 2333
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

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

2335 2336 2337 2338 2339 2340
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
2341 2342 2343 2344
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
2345
	index += 4 * 256;
2346 2347
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2348 2349 2350 2351 2352 2353 2354 2355
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
2356
		printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367
		       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);
	}
2368 2369

	do {
2370
		unsigned mi = (lo + hi) / 2;
2371 2372 2373 2374 2375
		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 已提交
2376
		if (!cmp)
2377
			return nth_packed_object_offset(p, mi);
2378 2379 2380 2381 2382 2383 2384 2385
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

2386
int is_pack_valid(struct packed_git *p)
2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406
{
	/* An already open pack is known to be valid. */
	if (p->pack_fd != -1)
		return 1;

	/* If the pack has one window completely covering the
	 * file size, the pack is known to be valid even if
	 * the descriptor is not currently open.
	 */
	if (p->windows) {
		struct pack_window *w = p->windows;

		if (!w->offset && w->len == p->pack_size)
			return 1;
	}

	/* Force the pack to open to prove its valid. */
	return !open_packed_git(p);
}

2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440
static int fill_pack_entry(const unsigned char *sha1,
			   struct pack_entry *e,
			   struct packed_git *p)
{
	off_t offset;

	if (p->num_bad_objects) {
		unsigned i;
		for (i = 0; i < p->num_bad_objects; i++)
			if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
				return 0;
	}

	offset = find_pack_entry_one(sha1, p);
	if (!offset)
		return 0;

	/*
	 * 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 (!is_pack_valid(p)) {
		warning("packfile %s cannot be accessed", p->pack_name);
		return 0;
	}
	e->offset = offset;
	e->p = p;
	hashcpy(e->sha1, sha1);
	return 1;
}

2441
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2442 2443
{
	struct packed_git *p;
N
Nicolas Pitre 已提交
2444

2445
	prepare_packed_git();
2446 2447
	if (!packed_git)
		return 0;
2448

2449 2450
	if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
		return 1;
2451

2452 2453 2454
	for (p = packed_git; p; p = p->next) {
		if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
			continue;
2455

2456 2457 2458
		last_found_pack = p;
		return 1;
	}
2459 2460 2461
	return 0;
}

J
Junio C Hamano 已提交
2462
struct packed_git *find_sha1_pack(const unsigned char *sha1,
2463 2464 2465 2466 2467
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
2468
		if (find_pack_entry_one(sha1, p))
2469 2470 2471
			return p;
	}
	return NULL;
2472

2473 2474
}

2475
static int sha1_loose_object_info(const unsigned char *sha1,
2476
				  struct object_info *oi)
2477
{
2478
	int status;
2479 2480
	unsigned long mapsize, size;
	void *map;
2481
	git_zstream stream;
N
Nicolas Pitre 已提交
2482
	char hdr[32];
2483

2484 2485 2486 2487
	/*
	 * If we don't care about type or size, then we don't
	 * need to look inside the object at all.
	 */
2488 2489
	if (!oi->typep && !oi->sizep) {
		if (oi->disk_sizep) {
2490 2491 2492
			struct stat st;
			if (stat_sha1_file(sha1, &st) < 0)
				return -1;
2493
			*oi->disk_sizep = st.st_size;
2494 2495 2496 2497
		}
		return 0;
	}

2498
	map = map_sha1_file(sha1, &mapsize);
2499
	if (!map)
2500
		return -1;
2501 2502
	if (oi->disk_sizep)
		*oi->disk_sizep = mapsize;
2503 2504 2505
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
2506
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
2507
		status = error("unable to parse %s header", sha1_to_hex(sha1));
2508 2509
	else if (oi->sizep)
		*oi->sizep = size;
2510
	git_inflate_end(&stream);
2511
	munmap(map, mapsize);
2512 2513
	if (oi->typep)
		*oi->typep = status;
2514
	return 0;
2515 2516
}

2517 2518
/* returns enum object_type or negative */
int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi)
2519
{
2520
	struct cached_object *co;
2521
	struct pack_entry e;
2522
	int rtype;
2523

2524 2525
	co = find_cached_object(sha1);
	if (co) {
2526 2527
		if (oi->typep)
			*(oi->typep) = co->type;
2528 2529
		if (oi->sizep)
			*(oi->sizep) = co->size;
2530 2531
		if (oi->disk_sizep)
			*(oi->disk_sizep) = 0;
2532
		oi->whence = OI_CACHED;
2533
		return 0;
2534 2535
	}

2536
	if (!find_pack_entry(sha1, &e)) {
2537
		/* Most likely it's a loose object. */
2538
		if (!sha1_loose_object_info(sha1, oi)) {
2539
			oi->whence = OI_LOOSE;
2540
			return 0;
2541
		}
2542 2543

		/* Not a loose object; someone else may have just packed it. */
2544
		reprepare_packed_git();
2545
		if (!find_pack_entry(sha1, &e))
2546
			return -1;
2547
	}
2548

2549
	rtype = packed_object_info(e.p, e.offset, oi);
2550
	if (rtype < 0) {
2551
		mark_bad_packed_object(e.p, sha1);
2552
		return sha1_object_info_extended(sha1, oi);
2553 2554
	} else if (in_delta_base_cache(e.p, e.offset)) {
		oi->whence = OI_DBCACHED;
2555 2556 2557 2558 2559 2560
	} else {
		oi->whence = OI_PACKED;
		oi->u.packed.offset = e.offset;
		oi->u.packed.pack = e.p;
		oi->u.packed.is_delta = (rtype == OBJ_REF_DELTA ||
					 rtype == OBJ_OFS_DELTA);
2561 2562
	}

2563
	return 0;
2564 2565
}

2566 2567
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
{
2568
	enum object_type type;
R
Ramsay Jones 已提交
2569
	struct object_info oi = {NULL};
2570

2571
	oi.typep = &type;
2572
	oi.sizep = sizep;
2573 2574 2575
	if (sha1_object_info_extended(sha1, &oi) < 0)
		return -1;
	return type;
2576 2577
}

2578 2579
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
2580 2581
{
	struct pack_entry e;
2582
	void *data;
2583

2584
	if (!find_pack_entry(sha1, &e))
2585
		return NULL;
2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596
	data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
	if (!data) {
		/*
		 * We're probably in deep shit, but let's try to fetch
		 * the required object anyway from another pack or loose.
		 * This should happen only in the presence of a corrupted
		 * pack, and is better than failing outright.
		 */
		error("failed to read object %s at offset %"PRIuMAX" from %s",
		      sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
		mark_bad_packed_object(e.p, sha1);
2597
		data = read_object(sha1, type, size);
2598 2599
	}
	return data;
2600 2601
}

2602 2603
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2604 2605 2606
{
	struct cached_object *co;

2607
	hash_sha1_file(buf, len, typename(type), sha1);
2608 2609 2610 2611 2612 2613 2614 2615 2616 2617
	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;
2618
	co->type = type;
J
Junio C Hamano 已提交
2619 2620
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
2621 2622 2623 2624
	hashcpy(co->sha1, sha1);
	return 0;
}

2625 2626
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size)
2627 2628 2629
{
	unsigned long mapsize;
	void *map, *buf;
2630 2631 2632 2633
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
2634
		*type = co->type;
2635
		*size = co->size;
P
Pierre Habouzit 已提交
2636
		return xmemdupz(co->buf, co->size);
2637
	}
2638

2639 2640 2641
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
2642
	map = map_sha1_file(sha1, &mapsize);
2643
	if (map) {
2644
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2645 2646 2647
		munmap(map, mapsize);
		return buf;
	}
2648
	reprepare_packed_git();
2649
	return read_packed_sha1(sha1, type, size);
2650 2651
}

2652 2653 2654 2655 2656
/*
 * This function dies on corrupt objects; the callers who want to
 * deal with them should arrange to call read_object() and give error
 * messages themselves.
 */
2657 2658 2659 2660
void *read_sha1_file_extended(const unsigned char *sha1,
			      enum object_type *type,
			      unsigned long *size,
			      unsigned flag)
2661
{
2662
	void *data;
2663
	char *path;
2664
	const struct packed_git *p;
2665 2666
	const unsigned char *repl = (flag & READ_SHA1_FILE_REPLACE)
		? lookup_replace_object(sha1) : sha1;
2667

2668 2669
	errno = 0;
	data = read_object(repl, type, size);
2670
	if (data)
2671
		return data;
2672

2673
	if (errno && errno != ENOENT)
2674 2675
		die_errno("failed to read object %s", sha1_to_hex(sha1));

2676
	/* die if we replaced an object with one that does not exist */
2677
	if (repl != sha1)
2678 2679 2680
		die("replacement %s not found for %s",
		    sha1_to_hex(repl), sha1_to_hex(sha1));

2681 2682 2683 2684
	if (has_loose_object(repl)) {
		path = sha1_file_name(sha1);
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
2685
	}
2686

2687 2688 2689
	if ((p = has_packed_and_bad(repl)) != NULL)
		die("packed object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), p->pack_name);
2690

2691
	return NULL;
2692 2693
}

2694
void *read_object_with_reference(const unsigned char *sha1,
2695
				 const char *required_type_name,
2696 2697
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
2698
{
2699
	enum object_type type, required_type;
2700 2701
	void *buffer;
	unsigned long isize;
2702
	unsigned char actual_sha1[20];
2703

2704
	required_type = type_from_string(required_type_name);
2705
	hashcpy(actual_sha1, sha1);
2706 2707 2708
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
2709

2710
		buffer = read_sha1_file(actual_sha1, &type, &isize);
2711 2712
		if (!buffer)
			return NULL;
2713
		if (type == required_type) {
2714 2715
			*size = isize;
			if (actual_sha1_return)
2716
				hashcpy(actual_sha1_return, actual_sha1);
2717 2718 2719
			return buffer;
		}
		/* Handle references */
2720
		else if (type == OBJ_COMMIT)
2721
			ref_type = "tree ";
2722
		else if (type == OBJ_TAG)
2723 2724 2725 2726 2727 2728
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
2729

2730 2731
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
2732
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2733 2734 2735
			free(buffer);
			return NULL;
		}
2736
		free(buffer);
2737 2738
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
2739 2740 2741
	}
}

N
Nicolas Pitre 已提交
2742
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
2743
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
2744
                                    char *hdr, int *hdrlen)
2745
{
2746
	git_SHA_CTX c;
2747 2748

	/* Generate the header */
N
Nicolas Pitre 已提交
2749
	*hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
2750 2751

	/* Sha1.. */
2752 2753 2754 2755
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
2756 2757
}

2758
/*
2759 2760 2761 2762
 * Move the just written object into its final resting place.
 * NEEDSWORK: this should be renamed to finalize_temp_file() as
 * "moving" is only a part of what it does, when no patch between
 * master to pu changes the call sites of this function.
2763
 */
2764
int move_temp_to_file(const char *tmpfile, const char *filename)
2765
{
2766
	int ret = 0;
2767

2768
	if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2769 2770
		goto try_rename;
	else if (link(tmpfile, filename))
2771
		ret = errno;
2772 2773 2774 2775 2776 2777 2778 2779 2780

	/*
	 * 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.
	 *
2781
	 * When this succeeds, we just return.  We have nothing
2782 2783 2784
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
2785
	try_rename:
2786
		if (!rename(tmpfile, filename))
2787
			goto out;
2788
		ret = errno;
2789
	}
2790
	unlink_or_warn(tmpfile);
2791 2792
	if (ret) {
		if (ret != EEXIST) {
2793
			return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2794 2795 2796 2797
		}
		/* FIXME!!! Collision check here ? */
	}

2798
out:
2799
	if (adjust_shared_perm(filename))
2800
		return error("unable to set permission to '%s'", filename);
2801 2802 2803
	return 0;
}

L
Linus Torvalds 已提交
2804 2805
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2806
	if (write_in_full(fd, buf, len) < 0)
2807
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2808 2809 2810
	return 0;
}

N
Nicolas Pitre 已提交
2811
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2812 2813
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2814
	char hdr[32];
R
Rene Scharfe 已提交
2815 2816 2817 2818 2819
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

2820 2821 2822
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
2823 2824
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
2825
	if (close(fd) != 0)
2826
		die_errno("error when closing sha1 file");
2827 2828
}

2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854
/* 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");
2855
	fd = git_mkstemp_mode(buffer, 0444);
2856
	if (fd < 0 && dirlen && errno == ENOENT) {
2857
		/* Make sure the directory exists */
P
Patrick Higgins 已提交
2858
		memcpy(buffer, filename, dirlen);
2859
		buffer[dirlen-1] = 0;
2860
		if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2861 2862 2863 2864
			return -1;

		/* Try again */
		strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2865
		fd = git_mkstemp_mode(buffer, 0444);
2866 2867 2868 2869
	}
	return fd;
}

2870
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2871
			      const void *buf, unsigned long len, time_t mtime)
2872
{
2873
	int fd, ret;
2874
	unsigned char compressed[4096];
2875
	git_zstream stream;
2876 2877
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
2878
	char *filename;
2879
	static char tmp_file[PATH_MAX];
2880

R
Rene Scharfe 已提交
2881
	filename = sha1_file_name(sha1);
2882
	fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2883
	if (fd < 0) {
2884
		if (errno == EACCES)
2885
			return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2886
		else
2887
			return error("unable to create temporary file: %s", strerror(errno));
2888 2889
	}

2890 2891
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2892
	git_deflate_init(&stream, zlib_compression_level);
2893
	stream.next_out = compressed;
2894
	stream.avail_out = sizeof(compressed);
2895
	git_SHA1_Init(&c);
2896 2897

	/* First header.. */
N
Nicolas Pitre 已提交
2898
	stream.next_in = (unsigned char *)hdr;
2899
	stream.avail_in = hdrlen;
2900 2901
	while (git_deflate(&stream, 0) == Z_OK)
		; /* nothing */
2902
	git_SHA1_Update(&c, hdr, hdrlen);
2903 2904

	/* Then the data itself.. */
2905
	stream.next_in = (void *)buf;
2906
	stream.avail_in = len;
2907
	do {
2908
		unsigned char *in0 = stream.next_in;
2909
		ret = git_deflate(&stream, Z_FINISH);
2910
		git_SHA1_Update(&c, in0, stream.next_in - in0);
2911 2912 2913 2914 2915 2916
		if (write_buffer(fd, compressed, stream.next_out - compressed) < 0)
			die("unable to write sha1 file");
		stream.next_out = compressed;
		stream.avail_out = sizeof(compressed);
	} while (ret == Z_OK);

2917 2918
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2919
	ret = git_deflate_end_gently(&stream);
2920 2921
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2922 2923 2924
	git_SHA1_Final(parano_sha1, &c);
	if (hashcmp(sha1, parano_sha1) != 0)
		die("confused by unstable object source data for %s", sha1_to_hex(sha1));
2925

2926
	close_sha1_file(fd);
2927

2928 2929 2930 2931
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
2932
		if (utime(tmp_file, &utb) < 0)
2933
			warning("failed utime() on %s: %s",
2934
				tmp_file, strerror(errno));
2935 2936
	}

2937
	return move_temp_to_file(tmp_file, filename);
2938
}
2939

2940
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963
{
	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;
2964
	int ret;
2965

2966
	if (has_loose_object(sha1))
2967 2968 2969 2970 2971
		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;
2972 2973 2974 2975
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
2976 2977
}

2978 2979 2980 2981 2982 2983 2984 2985
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

2986 2987 2988 2989 2990 2991
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

2992 2993
int has_sha1_file(const unsigned char *sha1)
{
2994 2995
	struct pack_entry e;

2996
	if (find_pack_entry(sha1, &e))
2997
		return 1;
2998 2999 3000 3001
	if (has_loose_object(sha1))
		return 1;
	reprepare_packed_git();
	return find_pack_entry(sha1, &e);
3002
}
J
Junio C Hamano 已提交
3003

3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031
static void check_tree(const void *buf, size_t size)
{
	struct tree_desc desc;
	struct name_entry entry;

	init_tree_desc(&desc, buf, size);
	while (tree_entry(&desc, &entry))
		/* do nothing
		 * tree_entry() will die() on malformed entries */
		;
}

static void check_commit(const void *buf, size_t size)
{
	struct commit c;
	memset(&c, 0, sizeof(c));
	if (parse_commit_buffer(&c, buf, size))
		die("corrupt commit");
}

static void check_tag(const void *buf, size_t size)
{
	struct tag t;
	memset(&t, 0, sizeof(t));
	if (parse_tag_buffer(&t, buf, size))
		die("corrupt tag");
}

3032
static int index_mem(unsigned char *sha1, void *buf, size_t size,
3033 3034
		     enum object_type type,
		     const char *path, unsigned flags)
3035
{
L
Linus Torvalds 已提交
3036
	int ret, re_allocated = 0;
3037
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
3038

3039
	if (!type)
3040
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
3041 3042 3043 3044

	/*
	 * Convert blobs to git internal format
	 */
3045
	if ((type == OBJ_BLOB) && path) {
3046
		struct strbuf nbuf = STRBUF_INIT;
3047
		if (convert_to_git(path, buf, size, &nbuf,
3048
				   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3049
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
3050 3051 3052
			re_allocated = 1;
		}
	}
3053
	if (flags & HASH_FORMAT_CHECK) {
3054 3055 3056 3057 3058 3059 3060
		if (type == OBJ_TREE)
			check_tree(buf, size);
		if (type == OBJ_COMMIT)
			check_commit(buf, size);
		if (type == OBJ_TAG)
			check_tag(buf, size);
	}
L
Linus Torvalds 已提交
3061

3062
	if (write_object)
3063
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
3064
	else
3065
		ret = hash_sha1_file(buf, size, typename(type), sha1);
3066
	if (re_allocated)
L
Linus Torvalds 已提交
3067
		free(buf);
3068 3069 3070
	return ret;
}

3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084
static int index_pipe(unsigned char *sha1, int fd, enum object_type type,
		      const char *path, unsigned flags)
{
	struct strbuf sbuf = STRBUF_INIT;
	int ret;

	if (strbuf_read(&sbuf, fd, 4096) >= 0)
		ret = index_mem(sha1, sbuf.buf, sbuf.len, type,	path, flags);
	else
		ret = -1;
	strbuf_release(&sbuf);
	return ret;
}

3085 3086
#define SMALL_FILE_SIZE (32*1024)

3087 3088 3089
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
3090 3091 3092
{
	int ret;

3093
	if (!size) {
3094
		ret = index_mem(sha1, NULL, size, type, path, flags);
3095 3096 3097
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
3098
			ret = index_mem(sha1, buf, size, type, path, flags);
3099 3100 3101
		else
			ret = error("short read %s", strerror(errno));
		free(buf);
3102
	} else {
3103
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3104
		ret = index_mem(sha1, buf, size, type, path, flags);
3105
		munmap(buf, size);
3106
	}
3107 3108 3109
	return ret;
}

3110
/*
3111 3112
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
3113 3114 3115 3116
 *
 * This also bypasses the usual "convert-to-git" dance, and that is on
 * purpose. We could write a streaming version of the converting
 * functions and insert that before feeding the data to fast-import
3117 3118 3119 3120 3121 3122 3123
 * (or equivalent in-core API described above). However, that is
 * somewhat complicated, as we do not know the size of the filter
 * result, which we need to know beforehand when writing a git object.
 * Since the primary motivation for trying to stream from the working
 * tree file and to avoid mmaping it in core is to deal with large
 * binary blobs, they generally do not want to get any conversion, and
 * callers should avoid this code path when filters are requested.
3124 3125 3126 3127 3128
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
3129
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
3130 3131
}

3132 3133 3134 3135 3136 3137 3138 3139
int index_fd(unsigned char *sha1, int fd, struct stat *st,
	     enum object_type type, const char *path, unsigned flags)
{
	int ret;
	size_t size = xsize_t(st->st_size);

	if (!S_ISREG(st->st_mode))
		ret = index_pipe(sha1, fd, type, path, flags);
3140 3141
	else if (size <= big_file_threshold || type != OBJ_BLOB ||
		 (path && would_convert_to_git(path, NULL, 0, 0)))
3142
		ret = index_core(sha1, fd, size, type, path, flags);
3143 3144
	else
		ret = index_stream(sha1, fd, size, type, path, flags);
3145
	close(fd);
3146
	return ret;
J
Junio C Hamano 已提交
3147
}
3148

3149
int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3150 3151
{
	int fd;
3152
	struct strbuf sb = STRBUF_INIT;
3153 3154 3155 3156 3157 3158 3159

	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));
3160
		if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3161 3162 3163 3164
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
3165
		if (strbuf_readlink(&sb, path, st->st_size)) {
3166 3167 3168 3169
			char *errstr = strerror(errno);
			return error("readlink(\"%s\"): %s", path,
			             errstr);
		}
3170
		if (!(flags & HASH_WRITE_OBJECT))
3171 3172
			hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
		else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3173 3174
			return error("%s: failed to insert into database",
				     path);
3175
		strbuf_release(&sb);
3176
		break;
3177 3178
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
3179 3180 3181 3182 3183
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
3184 3185 3186

int read_pack_header(int fd, struct pack_header *header)
{
3187 3188 3189 3190
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

3191 3192 3193 3194 3195 3196 3197 3198
	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;
}
J
Jeff King 已提交
3199 3200 3201 3202 3203 3204 3205 3206 3207 3208

void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
{
	enum object_type type = sha1_object_info(sha1, NULL);
	if (type < 0)
		die("%s is not a valid object", sha1_to_hex(sha1));
	if (type != expect)
		die("%s is not a valid '%s' object", sha1_to_hex(sha1),
		    typename(expect));
}