sha1_file.c 99.5 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*
 * GIT - The information manager from hell
 *
 * Copyright (C) Linus Torvalds, 2005
 *
 * This handles basic git sha1 object files - packing, unpacking,
 * creation etc.
 */
#include "cache.h"
10
#include "string-list.h"
11
#include "lockfile.h"
12
#include "delta.h"
13
#include "pack.h"
14 15
#include "blob.h"
#include "commit.h"
16
#include "run-command.h"
17 18
#include "tag.h"
#include "tree.h"
19
#include "tree-walk.h"
20
#include "refs.h"
21
#include "pack-revindex.h"
22
#include "sha1-lookup.h"
23
#include "bulk-checkin.h"
24
#include "streaming.h"
25
#include "dir.h"
26
#include "mru.h"
J
Jeff King 已提交
27
#include "list.h"
28
#include "mergesort.h"
J
Jeff King 已提交
29
#include "quote.h"
30

31 32
#define SZ_FMT PRIuMAX
static inline uintmax_t sz_fmt(size_t s) { return s; }
33

34
const unsigned char null_sha1[20];
35
const struct object_id null_oid;
36 37 38 39 40 41
const struct object_id empty_tree_oid = {
	EMPTY_TREE_SHA1_BIN_LITERAL
};
const struct object_id empty_blob_oid = {
	EMPTY_BLOB_SHA1_BIN_LITERAL
};
J
Junio C Hamano 已提交
42

43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
/*
 * 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 = {
58
	EMPTY_TREE_SHA1_BIN_LITERAL,
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
	OBJ_TREE,
	"",
	0
};

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

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

107
enum scld_error safe_create_leading_directories(char *path)
108
{
109
	char *next_component = path + offset_1st_component(path);
110
	enum scld_error ret = SCLD_OK;
111

112
	while (ret == SCLD_OK && next_component) {
113
		struct stat st;
114
		char *slash = next_component, slash_character;
115

116 117 118 119
		while (*slash && !is_dir_sep(*slash))
			slash++;

		if (!*slash)
120
			break;
121

122
		next_component = slash + 1;
123
		while (is_dir_sep(*next_component))
124
			next_component++;
125
		if (!*next_component)
126
			break;
127

128
		slash_character = *slash;
129
		*slash = '\0';
130 131
		if (!stat(path, &st)) {
			/* path exists */
132 133
			if (!S_ISDIR(st.st_mode)) {
				errno = ENOTDIR;
134
				ret = SCLD_EXISTS;
135
			}
136
		} else if (mkdir(path, 0777)) {
137
			if (errno == EEXIST &&
138
			    !stat(path, &st) && S_ISDIR(st.st_mode))
139
				; /* somebody created it since we checked */
140 141 142 143 144 145 146 147 148 149 150
			else if (errno == ENOENT)
				/*
				 * Either mkdir() failed because
				 * somebody just pruned the containing
				 * directory, or stat() failed because
				 * the file that was in our way was
				 * just removed.  Either way, inform
				 * the caller that it might be worth
				 * trying again:
				 */
				ret = SCLD_VANISHED;
151
			else
152
				ret = SCLD_FAILED;
153
		} else if (adjust_shared_perm(path)) {
154
			ret = SCLD_PERMS;
155
		}
156
		*slash = slash_character;
157
	}
158
	return ret;
159
}
160

161
enum scld_error safe_create_leading_directories_const(const char *path)
162
{
163
	int save_errno;
164 165
	/* path points to cache entries, so xstrdup before messing with it */
	char *buf = xstrdup(path);
166
	enum scld_error result = safe_create_leading_directories(buf);
167 168

	save_errno = errno;
169
	free(buf);
170
	errno = save_errno;
171 172 173
	return result;
}

174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
int raceproof_create_file(const char *path, create_file_fn fn, void *cb)
{
	/*
	 * The number of times we will try to remove empty directories
	 * in the way of path. This is only 1 because if another
	 * process is racily creating directories that conflict with
	 * us, we don't want to fight against them.
	 */
	int remove_directories_remaining = 1;

	/*
	 * The number of times that we will try to create the
	 * directories containing path. We are willing to attempt this
	 * more than once, because another process could be trying to
	 * clean up empty directories at the same time as we are
	 * trying to create them.
	 */
	int create_directories_remaining = 3;

	/* A scratch copy of path, filled lazily if we need it: */
	struct strbuf path_copy = STRBUF_INIT;

	int ret, save_errno;

	/* Sanity check: */
	assert(*path);

retry_fn:
	ret = fn(path, cb);
	save_errno = errno;
	if (!ret)
		goto out;

	if (errno == EISDIR && remove_directories_remaining-- > 0) {
		/*
		 * A directory is in the way. Maybe it is empty; try
		 * to remove it:
		 */
		if (!path_copy.len)
			strbuf_addstr(&path_copy, path);

		if (!remove_dir_recursively(&path_copy, REMOVE_DIR_EMPTY_ONLY))
			goto retry_fn;
	} else if (errno == ENOENT && create_directories_remaining-- > 0) {
		/*
		 * Maybe the containing directory didn't exist, or
		 * maybe it was just deleted by a process that is
		 * racing with us to clean up empty directories. Try
		 * to create it:
		 */
		enum scld_error scld_result;

		if (!path_copy.len)
			strbuf_addstr(&path_copy, path);

		do {
			scld_result = safe_create_leading_directories(path_copy.buf);
			if (scld_result == SCLD_OK)
				goto retry_fn;
		} while (scld_result == SCLD_VANISHED && create_directories_remaining-- > 0);
	}

out:
	strbuf_release(&path_copy);
	errno = save_errno;
	return ret;
}

J
Jeff King 已提交
242
static void fill_sha1_path(struct strbuf *buf, const unsigned char *sha1)
243 244 245 246 247
{
	int i;
	for (i = 0; i < 20; i++) {
		static char hex[] = "0123456789abcdef";
		unsigned int val = sha1[i];
J
Jeff King 已提交
248 249
		strbuf_addch(buf, hex[val >> 4]);
		strbuf_addch(buf, hex[val & 0xf]);
250
		if (!i)
J
Jeff King 已提交
251
			strbuf_addch(buf, '/');
252 253 254
	}
}

255
const char *sha1_file_name(const unsigned char *sha1)
256
{
J
Jeff King 已提交
257
	static struct strbuf buf = STRBUF_INIT;
258

J
Jeff King 已提交
259 260
	strbuf_reset(&buf);
	strbuf_addf(&buf, "%s/", get_object_directory());
261

J
Jeff King 已提交
262 263
	fill_sha1_path(&buf, sha1);
	return buf.buf;
264 265
}

266 267 268 269 270 271
struct strbuf *alt_scratch_buf(struct alternate_object_database *alt)
{
	strbuf_setlen(&alt->scratch, alt->base_len);
	return &alt->scratch;
}

272 273 274
static const char *alt_sha1_path(struct alternate_object_database *alt,
				 const unsigned char *sha1)
{
275
	struct strbuf *buf = alt_scratch_buf(alt);
J
Jeff King 已提交
276
	fill_sha1_path(buf, sha1);
277
	return buf->buf;
278 279
}

280 281 282
 char *odb_pack_name(struct strbuf *buf,
		     const unsigned char *sha1,
		     const char *ext)
283
{
J
Jeff King 已提交
284 285
	strbuf_reset(buf);
	strbuf_addf(buf, "%s/pack/pack-%s.%s", get_object_directory(),
286
		    sha1_to_hex(sha1), ext);
J
Jeff King 已提交
287
	return buf->buf;
288 289
}

290
char *sha1_pack_name(const unsigned char *sha1)
291
{
J
Jeff King 已提交
292
	static struct strbuf buf = STRBUF_INIT;
293
	return odb_pack_name(&buf, sha1, "pack");
294
}
295

296 297
char *sha1_pack_index_name(const unsigned char *sha1)
{
J
Jeff King 已提交
298
	static struct strbuf buf = STRBUF_INIT;
299
	return odb_pack_name(&buf, sha1, "idx");
300 301
}

302 303
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
304

305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
/*
 * Return non-zero iff the path is usable as an alternate object database.
 */
static int alt_odb_usable(struct strbuf *path, const char *normalized_objdir)
{
	struct alternate_object_database *alt;

	/* Detect cases where alternate disappeared */
	if (!is_directory(path->buf)) {
		error("object directory %s does not exist; "
		      "check .git/objects/info/alternates.",
		      path->buf);
		return 0;
	}

	/*
	 * Prevent the common mistake of listing the same
	 * thing twice, or object directory itself.
	 */
	for (alt = alt_odb_list; alt; alt = alt->next) {
325
		if (!fspathcmp(path->buf, alt->path))
326 327 328 329 330 331 332 333
			return 0;
	}
	if (!fspathcmp(path->buf, normalized_objdir))
		return 0;

	return 1;
}

J
Junio C Hamano 已提交
334 335
/*
 * Prepare alternate object database registry.
336 337 338 339 340
 *
 * 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,
341 342
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
343 344 345 346 347
 * 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 已提交
348
 */
349 350
static int link_alt_odb_entry(const char *entry, const char *relative_base,
	int depth, const char *normalized_objdir)
351
{
M
Martin Waitz 已提交
352
	struct alternate_object_database *ent;
353
	struct strbuf pathbuf = STRBUF_INIT;
354

355
	if (!is_absolute_path(entry) && relative_base) {
356
		strbuf_realpath(&pathbuf, relative_base, 1);
357
		strbuf_addch(&pathbuf, '/');
M
Martin Waitz 已提交
358
	}
359
	strbuf_addstr(&pathbuf, entry);
M
Martin Waitz 已提交
360

361
	if (strbuf_normalize_path(&pathbuf) < 0 && relative_base) {
362 363 364 365 366
		error("unable to normalize alternate object path: %s",
		      pathbuf.buf);
		strbuf_release(&pathbuf);
		return -1;
	}
367 368 369 370 371

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

375 376
	if (!alt_odb_usable(&pathbuf, normalized_objdir)) {
		strbuf_release(&pathbuf);
M
Martin Waitz 已提交
377 378 379
		return -1;
	}

380
	ent = alloc_alt_odb(pathbuf.buf);
M
Martin Waitz 已提交
381 382 383 384 385 386 387

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

	/* recursively add alternates */
388
	read_info_alternates(pathbuf.buf, depth + 1);
M
Martin Waitz 已提交
389

390
	strbuf_release(&pathbuf);
M
Martin Waitz 已提交
391 392 393
	return 0;
}

J
Jeff King 已提交
394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422
static const char *parse_alt_odb_entry(const char *string,
				       int sep,
				       struct strbuf *out)
{
	const char *end;

	strbuf_reset(out);

	if (*string == '#') {
		/* comment; consume up to next separator */
		end = strchrnul(string, sep);
	} else if (*string == '"' && !unquote_c_style(out, string, &end)) {
		/*
		 * quoted path; unquote_c_style has copied the
		 * data for us and set "end". Broken quoting (e.g.,
		 * an entry that doesn't end with a quote) falls
		 * back to the unquoted case below.
		 */
	} else {
		/* normal, unquoted path */
		end = strchrnul(string, sep);
		strbuf_add(out, string, end - string);
	}

	if (*end)
		end++;
	return end;
}

423
static void link_alt_odb_entries(const char *alt, int len, int sep,
M
Martin Waitz 已提交
424 425
				 const char *relative_base, int depth)
{
426
	struct strbuf objdirbuf = STRBUF_INIT;
J
Jeff King 已提交
427
	struct strbuf entry = STRBUF_INIT;
M
Martin Waitz 已提交
428 429 430 431 432 433 434

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

J
Junio C Hamano 已提交
435
	strbuf_add_absolute_path(&objdirbuf, get_object_directory());
436 437 438
	if (strbuf_normalize_path(&objdirbuf) < 0)
		die("unable to normalize object directory: %s",
		    objdirbuf.buf);
439

J
Jeff King 已提交
440 441 442
	while (*alt) {
		alt = parse_alt_odb_entry(alt, sep, &entry);
		if (!entry.len)
443
			continue;
J
Jeff King 已提交
444
		link_alt_odb_entry(entry.buf, relative_base, depth, objdirbuf.buf);
445
	}
J
Jeff King 已提交
446
	strbuf_release(&entry);
447
	strbuf_release(&objdirbuf);
448 449
}

450
void read_info_alternates(const char * relative_base, int depth)
451
{
452
	char *map;
453
	size_t mapsz;
454
	struct stat st;
455
	char *path;
M
Martin Waitz 已提交
456
	int fd;
457

458
	path = xstrfmt("%s/info/alternates", relative_base);
459
	fd = git_open(path);
460
	free(path);
461 462 463 464
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
465
		return;
466
	}
467 468
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
469 470
	close(fd);

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

473
	munmap(map, mapsz);
474 475
}

476 477 478 479
struct alternate_object_database *alloc_alt_odb(const char *dir)
{
	struct alternate_object_database *ent;

480
	FLEX_ALLOC_STR(ent, path, dir);
481 482 483
	strbuf_init(&ent->scratch, 0);
	strbuf_addf(&ent->scratch, "%s/", dir);
	ent->base_len = ent->scratch.len;
484 485 486 487

	return ent;
}

488 489 490
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
491 492 493 494 495 496 497 498 499 500 501 502 503
	char *alts = git_pathdup("objects/info/alternates");
	FILE *in, *out;

	hold_lock_file_for_update(lock, alts, LOCK_DIE_ON_ERROR);
	out = fdopen_lock_file(lock, "w");
	if (!out)
		die_errno("unable to fdopen alternates lockfile");

	in = fopen(alts, "r");
	if (in) {
		struct strbuf line = STRBUF_INIT;
		int found = 0;

504
		while (strbuf_getline(&line, in) != EOF) {
505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
			if (!strcmp(reference, line.buf)) {
				found = 1;
				break;
			}
			fprintf_or_die(out, "%s\n", line.buf);
		}

		strbuf_release(&line);
		fclose(in);

		if (found) {
			rollback_lock_file(lock);
			lock = NULL;
		}
	}
	else if (errno != ENOENT)
		die_errno("unable to read alternates file");

	if (lock) {
		fprintf_or_die(out, "%s\n", reference);
		if (commit_lock_file(lock))
			die_errno("unable to move new alternates file into place");
		if (alt_odb_tail)
			link_alt_odb_entries(reference, strlen(reference), '\n', NULL, 0);
	}
	free(alts);
531 532
}

533 534 535 536 537 538 539 540 541 542 543
void add_to_alternates_memory(const char *reference)
{
	/*
	 * Make sure alternates are initialized, or else our entry may be
	 * overwritten when they are.
	 */
	prepare_alt_odb();

	link_alt_odb_entries(reference, strlen(reference), '\n', NULL, 0);
}

544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612
/*
 * Compute the exact path an alternate is at and returns it. In case of
 * error NULL is returned and the human readable error is added to `err`
 * `path` may be relative and should point to $GITDIR.
 * `err` must not be null.
 */
char *compute_alternate_path(const char *path, struct strbuf *err)
{
	char *ref_git = NULL;
	const char *repo, *ref_git_s;
	int seen_error = 0;

	ref_git_s = real_path_if_valid(path);
	if (!ref_git_s) {
		seen_error = 1;
		strbuf_addf(err, _("path '%s' does not exist"), path);
		goto out;
	} else
		/*
		 * Beware: read_gitfile(), real_path() and mkpath()
		 * return static buffer
		 */
		ref_git = xstrdup(ref_git_s);

	repo = read_gitfile(ref_git);
	if (!repo)
		repo = read_gitfile(mkpath("%s/.git", ref_git));
	if (repo) {
		free(ref_git);
		ref_git = xstrdup(repo);
	}

	if (!repo && is_directory(mkpath("%s/.git/objects", ref_git))) {
		char *ref_git_git = mkpathdup("%s/.git", ref_git);
		free(ref_git);
		ref_git = ref_git_git;
	} else if (!is_directory(mkpath("%s/objects", ref_git))) {
		struct strbuf sb = STRBUF_INIT;
		seen_error = 1;
		if (get_common_dir(&sb, ref_git)) {
			strbuf_addf(err,
				    _("reference repository '%s' as a linked "
				      "checkout is not supported yet."),
				    path);
			goto out;
		}

		strbuf_addf(err, _("reference repository '%s' is not a "
					"local repository."), path);
		goto out;
	}

	if (!access(mkpath("%s/shallow", ref_git), F_OK)) {
		strbuf_addf(err, _("reference repository '%s' is shallow"),
			    path);
		seen_error = 1;
		goto out;
	}

	if (!access(mkpath("%s/info/grafts", ref_git), F_OK)) {
		strbuf_addf(err,
			    _("reference repository '%s' is grafted"),
			    path);
		seen_error = 1;
		goto out;
	}

out:
	if (seen_error) {
613
		FREE_AND_NULL(ref_git);
614 615 616 617 618
	}

	return ref_git;
}

619
int foreach_alt_odb(alt_odb_fn fn, void *cb)
620 621
{
	struct alternate_object_database *ent;
622
	int r = 0;
623 624

	prepare_alt_odb();
625 626 627 628 629 630
	for (ent = alt_odb_list; ent; ent = ent->next) {
		r = fn(ent, cb);
		if (r)
			break;
	}
	return r;
631 632
}

M
Martin Waitz 已提交
633 634
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
635
	const char *alt;
M
Martin Waitz 已提交
636

S
Shawn O. Pearce 已提交
637 638 639
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
640 641 642 643
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
644
	link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
645 646 647 648

	read_info_alternates(get_object_directory(), 0);
}

649
/* Returns 1 if we have successfully freshened the file, 0 otherwise. */
650
static int freshen_file(const char *fn)
651
{
652 653 654
	struct utimbuf t;
	t.actime = t.modtime = time(NULL);
	return !utime(fn, &t);
655
}
656

657 658 659 660 661 662 663
/*
 * All of the check_and_freshen functions return 1 if the file exists and was
 * freshened (if freshening was requested), 0 otherwise. If they return
 * 0, you should not assume that it is safe to skip a write of the object (it
 * either does not exist on disk, or has a stale mtime and may be subject to
 * pruning).
 */
664
int check_and_freshen_file(const char *fn, int freshen)
665 666 667
{
	if (access(fn, F_OK))
		return 0;
668
	if (freshen && !freshen_file(fn))
669 670 671 672 673 674 675 676 677 678
		return 0;
	return 1;
}

static int check_and_freshen_local(const unsigned char *sha1, int freshen)
{
	return check_and_freshen_file(sha1_file_name(sha1), freshen);
}

static int check_and_freshen_nonlocal(const unsigned char *sha1, int freshen)
679 680
{
	struct alternate_object_database *alt;
681
	prepare_alt_odb();
682
	for (alt = alt_odb_list; alt; alt = alt->next) {
683 684
		const char *path = alt_sha1_path(alt, sha1);
		if (check_and_freshen_file(path, freshen))
685
			return 1;
686
	}
687
	return 0;
688 689
}

690 691 692 693 694 695 696 697 698 699 700
static int check_and_freshen(const unsigned char *sha1, int freshen)
{
	return check_and_freshen_local(sha1, freshen) ||
	       check_and_freshen_nonlocal(sha1, freshen);
}

int has_loose_object_nonlocal(const unsigned char *sha1)
{
	return check_and_freshen_nonlocal(sha1, 0);
}

701 702
static int has_loose_object(const unsigned char *sha1)
{
703
	return check_and_freshen(sha1, 0);
704 705
}

706
static unsigned int pack_used_ctr;
707 708 709
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
710 711
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
712
static size_t peak_pack_mapped;
713
static size_t pack_mapped;
714
struct packed_git *packed_git;
715

716 717 718
static struct mru packed_git_mru_storage;
struct mru *packed_git_mru = &packed_git_mru_storage;

J
Junio C Hamano 已提交
719
void pack_report(void)
720 721
{
	fprintf(stderr,
722 723 724
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
725 726 727
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
728 729 730 731
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
732 733
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
734 735 736
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
737
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
738 739
}

740 741 742 743 744 745
/*
 * Open and mmap the index file at path, perform a couple of
 * consistency checks, then record its information to p.  Return 0 on
 * success.
 */
static int check_packed_git_idx(const char *path, struct packed_git *p)
746 747
{
	void *idx_map;
748
	struct pack_idx_header *hdr;
749
	size_t idx_size;
750
	uint32_t version, nr, i, *index;
751
	int fd = git_open(path);
752
	struct stat st;
753

754 755 756 757 758 759
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
760
	idx_size = xsize_t(st.st_size);
761 762 763 764
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
765
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
766 767
	close(fd);

768 769
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
770 771 772
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
773
			return error("index file %s is version %"PRIu32
774 775 776 777 778 779
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
780

781
	nr = 0;
782
	index = idx_map;
783 784
	if (version > 1)
		index += 2;  /* skip index header */
785
	for (i = 0; i < 256; i++) {
786
		uint32_t n = ntohl(index[i]);
787 788
		if (n < nr) {
			munmap(idx_map, idx_size);
789
			return error("non-monotonic index %s", path);
790
		}
791 792 793
		nr = n;
	}

794 795 796 797 798 799 800 801 802 803
	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);
804
			return error("wrong index v1 file size in %s", path);
805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820
		}
	} 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 已提交
821 822 823 824
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
825
			munmap(idx_map, idx_size);
826
			return error("wrong index v2 file size in %s", path);
827
		}
828 829 830 831 832 833 834 835 836
		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);
837
		}
838
	}
839

840
	p->index_version = version;
841 842
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
843
	p->num_objects = nr;
844 845 846
	return 0;
}

847
int open_pack_index(struct packed_git *p)
848 849
{
	char *idx_name;
850
	size_t len;
851 852 853 854 855
	int ret;

	if (p->index_data)
		return 0;

856 857 858
	if (!strip_suffix(p->pack_name, ".pack", &len))
		die("BUG: pack_name does not end in .pack");
	idx_name = xstrfmt("%.*s.idx", (int)len, p->pack_name);
859 860 861 862 863
	ret = check_packed_git_idx(idx_name, p);
	free(idx_name);
	return ret;
}

864 865 866 867
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
868
{
869 870 871 872 873 874 875 876
	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;
877 878
			}
		}
879
		w_l = w;
880
	}
881 882
}

883
static int unuse_one_window(struct packed_git *current)
884 885 886 887 888 889 890 891
{
	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);
892 893 894 895 896
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
897
		else
898 899
			lru_p->windows = lru_w->next;
		free(lru_w);
900
		pack_open_windows--;
901 902 903
		return 1;
	}
	return 0;
904 905
}

906
void release_pack_memory(size_t need)
907 908
{
	size_t cur = pack_mapped;
909
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
910 911 912
		; /* nothing */
}

913 914 915 916 917 918 919 920 921 922 923 924 925
static void mmap_limit_check(size_t length)
{
	static size_t limit = 0;
	if (!limit) {
		limit = git_env_ulong("GIT_MMAP_LIMIT", 0);
		if (!limit)
			limit = SIZE_MAX;
	}
	if (length > limit)
		die("attempting to mmap %"PRIuMAX" over limit %"PRIuMAX,
		    (uintmax_t)length, (uintmax_t)limit);
}

J
Jeff King 已提交
926 927
void *xmmap_gently(void *start, size_t length,
		  int prot, int flags, int fd, off_t offset)
928
{
929 930 931 932
	void *ret;

	mmap_limit_check(length);
	ret = mmap(start, length, prot, flags, fd, offset);
933 934 935
	if (ret == MAP_FAILED) {
		if (!length)
			return NULL;
936
		release_pack_memory(length);
937 938 939 940 941
		ret = mmap(start, length, prot, flags, fd, offset);
	}
	return ret;
}

J
Jeff King 已提交
942 943 944 945 946
void *xmmap(void *start, size_t length,
	int prot, int flags, int fd, off_t offset)
{
	void *ret = xmmap_gently(start, length, prot, flags, fd, offset);
	if (ret == MAP_FAILED)
J
Junio C Hamano 已提交
947
		die_errno("mmap failed");
J
Jeff King 已提交
948 949 950
	return ret;
}

951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966
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);
	}
}

967 968 969 970 971 972 973 974 975 976 977 978
static int close_pack_fd(struct packed_git *p)
{
	if (p->pack_fd < 0)
		return 0;

	close(p->pack_fd);
	pack_open_fds--;
	p->pack_fd = -1;

	return 1;
}

979 980 981 982 983 984 985 986 987 988 989 990 991
static void close_pack(struct packed_git *p)
{
	close_pack_windows(p);
	close_pack_fd(p);
	close_pack_index(p);
}

void close_all_packs(void)
{
	struct packed_git *p;

	for (p = packed_git; p; p = p->next)
		if (p->do_not_close)
992
			die("BUG: want to close pack marked 'do-not-close'");
993 994 995 996 997
		else
			close_pack(p);
}


998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064
/*
 * 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);
	}

1065 1066
	if (lru_p)
		return close_pack_fd(lru_p);
1067 1068 1069 1070

	return 0;
}

1071
void unuse_pack(struct pack_window **w_cursor)
1072
{
1073 1074 1075 1076 1077
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
1078 1079
}

1080 1081 1082 1083 1084 1085 1086 1087
void close_pack_index(struct packed_git *p)
{
	if (p->index_data) {
		munmap((void *)p->index_data, p->index_size);
		p->index_data = NULL;
	}
}

1088 1089 1090
static unsigned int get_max_fd_limit(void)
{
#ifdef RLIMIT_NOFILE
1091 1092
	{
		struct rlimit lim;
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
		if (!getrlimit(RLIMIT_NOFILE, &lim))
			return lim.rlim_cur;
	}
#endif

#ifdef _SC_OPEN_MAX
	{
		long open_max = sysconf(_SC_OPEN_MAX);
		if (0 < open_max)
			return open_max;
		/*
		 * Otherwise, we got -1 for one of the two
		 * reasons:
		 *
		 * (1) sysconf() did not understand _SC_OPEN_MAX
		 *     and signaled an error with -1; or
		 * (2) sysconf() said there is no limit.
		 *
		 * We _could_ clear errno before calling sysconf() to
		 * tell these two cases apart and return a huge number
		 * in the latter case to let the caller cap it to a
		 * value that is not so selfish, but letting the
		 * fallback OPEN_MAX codepath take care of these cases
		 * is a lot simpler.
		 */
	}
#endif
1121

1122
#ifdef OPEN_MAX
1123 1124 1125 1126 1127 1128
	return OPEN_MAX;
#else
	return 1; /* see the caller ;-) */
#endif
}

1129 1130 1131 1132 1133
/*
 * 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)
1134
{
1135 1136 1137 1138
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
1139
	long fd_flag;
1140

1141 1142 1143
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

1144
	if (!pack_max_fds) {
1145
		unsigned int max_fds = get_max_fd_limit();
1146 1147 1148 1149 1150 1151 1152 1153

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

1154
	while (pack_max_fds <= pack_open_fds && close_one_pack())
1155 1156
		; /* nothing */

1157
	p->pack_fd = git_open(p->pack_name);
1158
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
1159
		return -1;
1160
	pack_open_fds++;
1161 1162

	/* If we created the struct before we had the pack we lack size. */
1163 1164
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
1165
			return error("packfile %s not a regular file", p->pack_name);
1166
		p->pack_size = st.st_size;
1167
	} else if (p->pack_size != st.st_size)
1168
		return error("packfile %s size changed", p->pack_name);
1169

1170 1171 1172 1173 1174
	/* 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)
1175
		return error("cannot determine file descriptor flags");
1176 1177
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
1178
		return error("cannot set FD_CLOEXEC");
1179

1180
	/* Verify we recognize this pack file format. */
1181
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
1182
		return error("file %s is far too short to be a packfile", p->pack_name);
1183
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
1184
		return error("file %s is not a GIT packfile", p->pack_name);
1185
	if (!pack_version_ok(hdr.hdr_version))
1186 1187
		return error("packfile %s is version %"PRIu32" and not"
			" supported (try upgrading GIT to a newer version)",
1188 1189 1190
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
1191
	if (p->num_objects != ntohl(hdr.hdr_entries))
1192 1193
		return error("packfile %s claims to have %"PRIu32" objects"
			     " while index indicates %"PRIu32" objects",
N
Nicolas Pitre 已提交
1194 1195
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
1196
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
1197
		return error("end of packfile %s is unavailable", p->pack_name);
1198
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
1199
		return error("packfile %s signature is unavailable", p->pack_name);
1200
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
1201
	if (hashcmp(sha1, idx_sha1))
1202 1203
		return error("packfile %s does not match index", p->pack_name);
	return 0;
1204 1205
}

1206 1207 1208 1209
static int open_packed_git(struct packed_git *p)
{
	if (!open_packed_git_1(p))
		return 0;
1210
	close_pack_fd(p);
1211 1212 1213
	return -1;
}

1214
static int in_window(struct pack_window *win, off_t offset)
1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226
{
	/* 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);
}

1227
unsigned char *use_pack(struct packed_git *p,
1228
		struct pack_window **w_cursor,
1229
		off_t offset,
1230
		unsigned long *left)
1231
{
1232
	struct pack_window *win = *w_cursor;
1233

F
Felipe Contreras 已提交
1234
	/* Since packfiles end in a hash of their content and it's
1235 1236 1237 1238
	 * 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.
	 */
1239 1240
	if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
1241 1242
	if (offset > (p->pack_size - 20))
		die("offset beyond end of packfile (truncated pack?)");
1243
	if (offset < 0)
1244
		die(_("offset before end of packfile (broken .idx?)"));
1245 1246 1247 1248 1249 1250 1251 1252 1253

	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) {
1254
			size_t window_align = packed_git_window_size / 2;
1255
			off_t len;
1256 1257 1258 1259

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

1260
			win = xcalloc(1, sizeof(*win));
1261
			win->offset = (offset / window_align) * window_align;
1262 1263 1264 1265
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
1266
			pack_mapped += win->len;
1267
			while (packed_git_limit < pack_mapped
1268
				&& unuse_one_window(p))
1269
				; /* nothing */
1270
			win->base = xmmap(NULL, win->len,
1271 1272 1273
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
1274 1275
				die_errno("packfile %s cannot be mapped",
					  p->pack_name);
1276
			if (!win->offset && win->len == p->pack_size
1277 1278
				&& !p->do_not_close)
				close_pack_fd(p);
1279 1280 1281 1282 1283 1284
			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;
1285 1286 1287
			win->next = p->windows;
			p->windows = win;
		}
1288
	}
1289 1290 1291 1292 1293
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
1294
	offset -= win->offset;
1295
	if (left)
1296
		*left = win->len - xsize_t(offset);
1297
	return win->base + offset;
1298 1299
}

1300 1301
static struct packed_git *alloc_packed_git(int extra)
{
1302
	struct packed_git *p = xmalloc(st_add(sizeof(*p), extra));
1303 1304 1305 1306 1307
	memset(p, 0, sizeof(*p));
	p->pack_fd = -1;
	return p;
}

1308 1309
static void try_to_free_pack_memory(size_t size)
{
1310
	release_pack_memory(size);
1311 1312
}

1313
struct packed_git *add_packed_git(const char *path, size_t path_len, int local)
1314
{
1315
	static int have_set_try_to_free_routine;
1316
	struct stat st;
1317 1318
	size_t alloc;
	struct packed_git *p;
1319

1320 1321 1322 1323 1324
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

1325 1326 1327 1328
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
1329
	if (!strip_suffix_mem(path, &path_len, ".idx"))
1330
		return NULL;
1331 1332 1333 1334 1335

	/*
	 * ".pack" is long enough to hold any suffix we're adding (and
	 * the use xsnprintf double-checks that)
	 */
1336
	alloc = st_add3(path_len, strlen(".pack"), 1);
1337
	p = alloc_packed_git(alloc);
1338
	memcpy(p->pack_name, path, path_len);
1339

1340
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".keep");
1341 1342 1343
	if (!access(p->pack_name, F_OK))
		p->pack_keep = 1;

1344
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".pack");
1345
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1346
		free(p);
1347 1348
		return NULL;
	}
1349

1350 1351 1352 1353
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
1354
	p->pack_local = local;
1355
	p->mtime = st.st_mtime;
1356 1357
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
1358 1359 1360
	return p;
}

1361
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1362
{
1363
	const char *path = sha1_pack_name(sha1);
1364
	size_t alloc = st_add(strlen(path), 1);
1365
	struct packed_git *p = alloc_packed_git(alloc);
1366

1367
	memcpy(p->pack_name, path, alloc); /* includes NUL */
1368
	hashcpy(p->sha1, sha1);
1369 1370
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
1371
		return NULL;
1372
	}
1373 1374 1375 1376 1377 1378

	return p;
}

void install_packed_git(struct packed_git *pack)
{
1379 1380 1381
	if (pack->pack_fd != -1)
		pack_open_fds++;

1382 1383 1384 1385
	pack->next = packed_git;
	packed_git = pack;
}

1386
void (*report_garbage)(unsigned seen_bits, const char *path);
1387 1388 1389 1390

static void report_helper(const struct string_list *list,
			  int seen_bits, int first, int last)
{
1391
	if (seen_bits == (PACKDIR_FILE_PACK|PACKDIR_FILE_IDX))
1392
		return;
1393

1394
	for (; first < last; first++)
1395
		report_garbage(seen_bits, list->items[first].string);
1396 1397 1398 1399 1400 1401 1402 1403 1404
}

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

	if (!report_garbage)
		return;

1405
	string_list_sort(list);
1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417

	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) {
1418
				report_garbage(PACKDIR_FILE_GARBAGE, path);
1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431
				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);
}

1432
static void prepare_packed_git_one(char *objdir, int local)
1433
{
1434 1435
	struct strbuf path = STRBUF_INIT;
	size_t dirnamelen;
1436 1437
	DIR *dir;
	struct dirent *de;
1438
	struct string_list garbage = STRING_LIST_INIT_DUP;
1439

1440 1441 1442
	strbuf_addstr(&path, objdir);
	strbuf_addstr(&path, "/pack");
	dir = opendir(path.buf);
1443
	if (!dir) {
J
Junio C Hamano 已提交
1444
		if (errno != ENOENT)
1445 1446
			error_errno("unable to open object pack directory: %s",
				    path.buf);
1447
		strbuf_release(&path);
1448
		return;
1449
	}
1450 1451
	strbuf_addch(&path, '/');
	dirnamelen = path.len;
1452 1453
	while ((de = readdir(dir)) != NULL) {
		struct packed_git *p;
1454
		size_t base_len;
1455 1456

		if (is_dot_or_dotdot(de->d_name))
1457 1458
			continue;

1459 1460
		strbuf_setlen(&path, dirnamelen);
		strbuf_addstr(&path, de->d_name);
1461

1462 1463
		base_len = path.len;
		if (strip_suffix_mem(path.buf, &base_len, ".idx")) {
1464 1465
			/* Don't reopen a pack we already have. */
			for (p = packed_git; p; p = p->next) {
1466 1467 1468 1469
				size_t len;
				if (strip_suffix(p->pack_name, ".pack", &len) &&
				    len == base_len &&
				    !memcmp(p->pack_name, path.buf, len))
1470 1471 1472 1473 1474 1475 1476
					break;
			}
			if (p == NULL &&
			    /*
			     * See if it really is a valid .idx file with
			     * corresponding .pack file that we can map.
			     */
1477
			    (p = add_packed_git(path.buf, path.len, local)) != NULL)
1478
				install_packed_git(p);
1479
		}
1480 1481 1482 1483

		if (!report_garbage)
			continue;

J
Jeff King 已提交
1484 1485 1486 1487
		if (ends_with(de->d_name, ".idx") ||
		    ends_with(de->d_name, ".pack") ||
		    ends_with(de->d_name, ".bitmap") ||
		    ends_with(de->d_name, ".keep"))
1488
			string_list_append(&garbage, path.buf);
1489
		else
1490
			report_garbage(PACKDIR_FILE_GARBAGE, path.buf);
1491
	}
1492
	closedir(dir);
1493 1494
	report_pack_garbage(&garbage);
	string_list_clear(&garbage, 0);
1495
	strbuf_release(&path);
1496 1497
}

1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523
static int approximate_object_count_valid;

/*
 * Give a fast, rough count of the number of objects in the repository. This
 * ignores loose objects completely. If you have a lot of them, then either
 * you should repack because your performance will be awful, or they are
 * all unreachable objects about to be pruned, in which case they're not really
 * interesting as a measure of repo size in the first place.
 */
unsigned long approximate_object_count(void)
{
	static unsigned long count;
	if (!approximate_object_count_valid) {
		struct packed_git *p;

		prepare_packed_git();
		count = 0;
		for (p = packed_git; p; p = p->next) {
			if (open_pack_index(p))
				continue;
			count += p->num_objects;
		}
	}
	return count;
}

1524 1525 1526 1527 1528 1529 1530 1531 1532 1533
static void *get_next_packed_git(const void *p)
{
	return ((const struct packed_git *)p)->next;
}

static void set_next_packed_git(void *p, void *next)
{
	((struct packed_git *)p)->next = next;
}

1534 1535
static int sort_pack(const void *a_, const void *b_)
{
1536 1537
	const struct packed_git *a = a_;
	const struct packed_git *b = b_;
1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563
	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)
{
1564 1565
	packed_git = llist_mergesort(packed_git, get_next_packed_git,
				     set_next_packed_git, sort_pack);
1566 1567
}

1568 1569 1570 1571 1572 1573 1574 1575 1576
static void prepare_packed_git_mru(void)
{
	struct packed_git *p;

	mru_clear(packed_git_mru);
	for (p = packed_git; p; p = p->next)
		mru_append(packed_git_mru, p);
}

1577
static int prepare_packed_git_run_once = 0;
1578
void prepare_packed_git(void)
1579
{
1580
	struct alternate_object_database *alt;
1581

1582
	if (prepare_packed_git_run_once)
1583
		return;
1584
	prepare_packed_git_one(get_object_directory(), 1);
1585
	prepare_alt_odb();
1586 1587
	for (alt = alt_odb_list; alt; alt = alt->next)
		prepare_packed_git_one(alt->path, 0);
1588
	rearrange_packed_git();
1589
	prepare_packed_git_mru();
1590 1591 1592
	prepare_packed_git_run_once = 1;
}

1593
void reprepare_packed_git(void)
1594
{
1595
	approximate_object_count_valid = 0;
1596 1597
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1598 1599
}

1600 1601 1602 1603 1604
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++)
1605
		if (!hashcmp(sha1, p->bad_object_sha1 + GIT_SHA1_RAWSZ * i))
1606
			return;
1607
	p->bad_object_sha1 = xrealloc(p->bad_object_sha1,
1608
				      st_mult(GIT_MAX_RAWSZ,
1609 1610
					      st_add(p->num_bad_objects, 1)));
	hashcpy(p->bad_object_sha1 + GIT_SHA1_RAWSZ * p->num_bad_objects, sha1);
1611 1612 1613
	p->num_bad_objects++;
}

1614
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1615 1616 1617 1618 1619 1620 1621
{
	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))
1622 1623
				return p;
	return NULL;
1624 1625
}

1626 1627 1628 1629 1630 1631 1632 1633
/*
 * 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)
1634 1635
{
	unsigned char real_sha1[20];
1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651
	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 */
1652
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(obj_type), size) + 1;
1653 1654 1655 1656 1657 1658 1659 1660

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

1661 1662 1663 1664
		if (readlen < 0) {
			close_istream(st);
			return -1;
		}
1665 1666 1667 1668 1669 1670
		if (!readlen)
			break;
		git_SHA1_Update(&c, buf, readlen);
	}
	git_SHA1_Final(real_sha1, &c);
	close_istream(st);
1671
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1672 1673
}

1674
int git_open_cloexec(const char *name, int flags)
1675
{
1676 1677
	int fd;
	static int o_cloexec = O_CLOEXEC;
1678

1679 1680
	fd = open(name, flags | o_cloexec);
	if ((o_cloexec & O_CLOEXEC) && fd < 0 && errno == EINVAL) {
1681
		/* Try again w/o O_CLOEXEC: the kernel might not support it */
1682 1683
		o_cloexec &= ~O_CLOEXEC;
		fd = open(name, flags | o_cloexec);
1684
	}
1685

1686 1687 1688 1689 1690 1691 1692 1693 1694
#if defined(F_GETFL) && defined(F_SETFL) && defined(FD_CLOEXEC)
	{
		static int fd_cloexec = FD_CLOEXEC;

		if (!o_cloexec && 0 <= fd && fd_cloexec) {
			/* Opened w/o O_CLOEXEC?  try with fcntl(2) to add it */
			int flags = fcntl(fd, F_GETFL);
			if (fcntl(fd, F_SETFL, flags | fd_cloexec))
				fd_cloexec = 0;
1695
		}
1696
	}
1697
#endif
1698
	return fd;
1699 1700
}

1701 1702 1703 1704 1705 1706 1707 1708 1709 1710
/*
 * Find "sha1" as a loose object in the local repository or in an alternate.
 * Returns 0 on success, negative on failure.
 *
 * The "path" out-parameter will give the path of the object we found (if any).
 * Note that it may point to static storage and is only valid until another
 * call to sha1_file_name(), etc.
 */
static int stat_sha1_file(const unsigned char *sha1, struct stat *st,
			  const char **path)
1711 1712 1713
{
	struct alternate_object_database *alt;

1714 1715
	*path = sha1_file_name(sha1);
	if (!lstat(*path, st))
1716 1717 1718 1719 1720
		return 0;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
1721 1722
		*path = alt_sha1_path(alt, sha1);
		if (!lstat(*path, st))
1723 1724 1725 1726 1727 1728
			return 0;
	}

	return -1;
}

1729 1730 1731 1732 1733
/*
 * Like stat_sha1_file(), but actually open the object and return the
 * descriptor. See the caveats on the "path" parameter above.
 */
static int open_sha1_file(const unsigned char *sha1, const char **path)
1734 1735 1736
{
	int fd;
	struct alternate_object_database *alt;
1737
	int most_interesting_errno;
1738

1739 1740
	*path = sha1_file_name(sha1);
	fd = git_open(*path);
1741 1742
	if (fd >= 0)
		return fd;
1743
	most_interesting_errno = errno;
1744 1745 1746

	prepare_alt_odb();
	for (alt = alt_odb_list; alt; alt = alt->next) {
1747 1748
		*path = alt_sha1_path(alt, sha1);
		fd = git_open(*path);
1749 1750
		if (fd >= 0)
			return fd;
1751 1752
		if (most_interesting_errno == ENOENT)
			most_interesting_errno = errno;
1753
	}
1754
	errno = most_interesting_errno;
1755 1756 1757
	return -1;
}

1758 1759 1760 1761 1762 1763 1764
/*
 * Map the loose object at "path" if it is not NULL, or the path found by
 * searching for a loose object named "sha1".
 */
static void *map_sha1_file_1(const char *path,
			     const unsigned char *sha1,
			     unsigned long *size)
1765 1766
{
	void *map;
1767
	int fd;
1768

1769 1770 1771 1772
	if (path)
		fd = git_open(path);
	else
		fd = open_sha1_file(sha1, &path);
1773 1774 1775
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1776

1777 1778
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
1779 1780
			if (!*size) {
				/* mmap() is forbidden on empty files */
1781
				error("object file %s is empty", path);
1782 1783
				return NULL;
			}
1784
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1785
		}
1786
		close(fd);
1787 1788 1789 1790
	}
	return map;
}

1791 1792 1793 1794 1795
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
{
	return map_sha1_file_1(NULL, sha1, size);
}

1796 1797
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1798
{
1799
	unsigned shift;
1800
	unsigned long size, c;
1801 1802 1803 1804 1805 1806 1807
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1808
		if (len <= used || bitsizeof(long) <= shift) {
1809
			error("bad object header");
1810 1811
			size = used = 0;
			break;
1812
		}
1813 1814 1815 1816 1817 1818 1819 1820
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

1821 1822 1823
static int unpack_sha1_short_header(git_zstream *stream,
				    unsigned char *map, unsigned long mapsize,
				    void *buffer, unsigned long bufsiz)
1824
{
1825 1826 1827 1828 1829
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1830 1831
	stream->avail_out = bufsiz;

1832
	git_inflate_init(stream);
1833
	return git_inflate(stream, 0);
1834 1835
}

1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851
int unpack_sha1_header(git_zstream *stream,
		       unsigned char *map, unsigned long mapsize,
		       void *buffer, unsigned long bufsiz)
{
	int status = unpack_sha1_short_header(stream, map, mapsize,
					      buffer, bufsiz);

	if (status < Z_OK)
		return status;

	/* Make sure we have the terminating NUL */
	if (!memchr(buffer, '\0', stream->next_out - (unsigned char *)buffer))
		return -1;
	return 0;
}

1852 1853 1854 1855 1856 1857
static int unpack_sha1_header_to_strbuf(git_zstream *stream, unsigned char *map,
					unsigned long mapsize, void *buffer,
					unsigned long bufsiz, struct strbuf *header)
{
	int status;

1858 1859 1860
	status = unpack_sha1_short_header(stream, map, mapsize, buffer, bufsiz);
	if (status < Z_OK)
		return -1;
1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887

	/*
	 * Check if entire header is unpacked in the first iteration.
	 */
	if (memchr(buffer, '\0', stream->next_out - (unsigned char *)buffer))
		return 0;

	/*
	 * buffer[0..bufsiz] was not large enough.  Copy the partial
	 * result out to header, and then append the result of further
	 * reading the stream.
	 */
	strbuf_add(header, buffer, stream->next_out - (unsigned char *)buffer);
	stream->next_out = buffer;
	stream->avail_out = bufsiz;

	do {
		status = git_inflate(stream, 0);
		strbuf_add(header, buffer, stream->next_out - (unsigned char *)buffer);
		if (memchr(buffer, '\0', stream->next_out - (unsigned char *)buffer))
			return 0;
		stream->next_out = buffer;
		stream->avail_out = bufsiz;
	} while (status != Z_STREAM_END);
	return -1;
}

1888
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1889 1890
{
	int bytes = strlen(buffer) + 1;
1891
	unsigned char *buf = xmallocz(size);
1892
	unsigned long n;
1893
	int status = Z_OK;
1894

1895 1896 1897 1898 1899
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1900 1901 1902 1903
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1904
		 * expect no more output and set avail_out to zero,
1905 1906 1907 1908 1909 1910 1911 1912 1913
		 * 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.
		 */
1914 1915
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1916
		while (status == Z_OK)
1917
			status = git_inflate(stream, Z_FINISH);
1918
	}
1919
	if (status == Z_STREAM_END && !stream->avail_in) {
1920
		git_inflate_end(stream);
1921 1922 1923 1924 1925 1926 1927 1928 1929 1930
		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;
1931 1932 1933 1934 1935 1936 1937
}

/*
 * 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.
 */
1938 1939
static int parse_sha1_header_extended(const char *hdr, struct object_info *oi,
			       unsigned int flags)
1940
{
1941
	const char *type_buf = hdr;
1942
	unsigned long size;
1943
	int type, type_len = 0;
1944 1945

	/*
1946
	 * The type can be of any size but is followed by
1947
	 * a space.
1948 1949 1950
	 */
	for (;;) {
		char c = *hdr++;
1951 1952
		if (!c)
			return -1;
1953 1954
		if (c == ' ')
			break;
1955
		type_len++;
1956
	}
1957 1958 1959 1960 1961 1962

	type = type_from_string_gently(type_buf, type_len, 1);
	if (oi->typename)
		strbuf_add(oi->typename, type_buf, type_len);
	/*
	 * Set type to 0 if its an unknown object and
V
Ville Skyttä 已提交
1963
	 * we're obtaining the type using '--allow-unknown-type'
1964 1965 1966 1967 1968 1969 1970 1971
	 * option.
	 */
	if ((flags & LOOKUP_UNKNOWN_OBJECT) && (type < 0))
		type = 0;
	else if (type < 0)
		die("invalid object type");
	if (oi->typep)
		*oi->typep = type;
1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988

	/*
	 * 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;
		}
	}
1989 1990 1991

	if (oi->sizep)
		*oi->sizep = size;
1992 1993 1994 1995

	/*
	 * The length must be followed by a zero byte
	 */
1996 1997 1998 1999 2000
	return *hdr ? -1 : type;
}

int parse_sha1_header(const char *hdr, unsigned long *sizep)
{
2001
	struct object_info oi = OBJECT_INFO_INIT;
2002 2003 2004

	oi.sizep = sizep;
	return parse_sha1_header_extended(hdr, &oi, LOOKUP_REPLACE_OBJECT);
2005 2006
}

2007
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
2008
{
2009
	int ret;
2010
	git_zstream stream;
2011
	char hdr[8192];
2012

2013
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
2014
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
2015 2016
		return NULL;

2017
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
2018 2019
}

N
Nicolas Pitre 已提交
2020 2021 2022 2023 2024 2025
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;
2026
	git_zstream stream;
N
Nicolas Pitre 已提交
2027 2028 2029 2030 2031 2032
	int st;

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

2033
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
2034 2035 2036
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
2037
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
2038 2039 2040
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
2041
	git_inflate_end(&stream);
2042 2043 2044 2045
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058

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

2059
static off_t get_delta_base(struct packed_git *p,
2060
				    struct pack_window **w_curs,
2061
				    off_t *curpos,
2062
				    enum object_type type,
2063
				    off_t delta_obj_offset)
2064
{
2065
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
2066
	off_t base_offset;
2067

2068 2069 2070 2071 2072 2073
	/* 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.
	 */
2074
	if (type == OBJ_OFS_DELTA) {
2075 2076 2077 2078 2079
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
2080
			if (!base_offset || MSB(base_offset, 7))
2081
				return 0;  /* overflow */
2082 2083 2084 2085
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
2086
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
2087
			return 0;  /* out of bound */
2088
		*curpos += used;
2089
	} else if (type == OBJ_REF_DELTA) {
2090 2091
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
2092
		*curpos += 20;
2093 2094
	} else
		die("I am totally screwed");
2095
	return base_offset;
2096 2097
}

2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129
/*
 * Like get_delta_base above, but we return the sha1 instead of the pack
 * offset. This means it is cheaper for REF deltas (we do not have to do
 * the final object lookup), but more expensive for OFS deltas (we
 * have to load the revidx to convert the offset back into a sha1).
 */
static const unsigned char *get_delta_base_sha1(struct packed_git *p,
						struct pack_window **w_curs,
						off_t curpos,
						enum object_type type,
						off_t delta_obj_offset)
{
	if (type == OBJ_REF_DELTA) {
		unsigned char *base = use_pack(p, w_curs, curpos, NULL);
		return base;
	} else if (type == OBJ_OFS_DELTA) {
		struct revindex_entry *revidx;
		off_t base_offset = get_delta_base(p, w_curs, &curpos,
						   type, delta_obj_offset);

		if (!base_offset)
			return NULL;

		revidx = find_pack_revindex(p, base_offset);
		if (!revidx)
			return NULL;

		return nth_packed_object_sha1(p, revidx->nr);
	} else
		return NULL;
}

2130 2131 2132 2133
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
2134
{
2135
	unsigned char *base;
2136
	unsigned long left;
2137
	unsigned long used;
2138
	enum object_type type;
2139

2140
	/* use_pack() assures us we have [base, base + 20) available
2141
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
2142
	 * size that is assured.)  With our object header encoding
2143 2144 2145
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
2146
	base = use_pack(p, w_curs, *curpos, &left);
2147 2148 2149 2150 2151
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
2152

2153
	return type;
2154 2155
}

2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173
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

2174 2175 2176 2177 2178
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)
2179
{
2180 2181 2182
	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;
2183

2184 2185
	while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
		off_t base_offset;
2186
		unsigned long size;
2187 2188 2189
		/* 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);
J
Jeff King 已提交
2190
			ALLOC_ARRAY(poi_stack, poi_stack_alloc);
2191 2192 2193 2194 2195 2196
			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 */
2197
		base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
2198 2199 2200
		if (!base_offset)
			goto unwind;
		curpos = obj_offset = base_offset;
2201
		type = unpack_object_header(p, w_curs, &curpos, &size);
2202 2203 2204 2205 2206 2207 2208 2209 2210 2211
		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;
		}
	}

2212
	switch (type) {
2213
	case OBJ_BAD:
2214 2215 2216 2217
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2218
		break;
2219
	default:
2220 2221 2222
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
2223
	}
2224 2225 2226 2227

out:
	if (poi_stack != small_poi_stack)
		free(poi_stack);
2228
	return type;
2229 2230 2231 2232 2233 2234 2235 2236 2237 2238

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

2241 2242
int packed_object_info(struct packed_git *p, off_t obj_offset,
		       struct object_info *oi)
2243 2244 2245 2246 2247 2248
{
	struct pack_window *w_curs = NULL;
	unsigned long size;
	off_t curpos = obj_offset;
	enum object_type type;

2249 2250 2251 2252
	/*
	 * We always get the representation type, but only convert it to
	 * a "real" type later if the caller is interested.
	 */
2253 2254
	type = unpack_object_header(p, &w_curs, &curpos, &size);

2255
	if (oi->sizep) {
2256 2257 2258 2259 2260 2261 2262 2263
		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;
			}
2264 2265
			*oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
			if (*oi->sizep == 0) {
2266 2267 2268 2269
				type = OBJ_BAD;
				goto out;
			}
		} else {
2270
			*oi->sizep = size;
2271 2272 2273
		}
	}

2274
	if (oi->disk_sizep) {
2275
		struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2276
		*oi->disk_sizep = revidx[1].offset - obj_offset;
2277 2278
	}

2279 2280 2281
	if (oi->typep) {
		*oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
		if (*oi->typep < 0) {
2282 2283 2284 2285
			type = OBJ_BAD;
			goto out;
		}
	}
2286

2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302
	if (oi->delta_base_sha1) {
		if (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
			const unsigned char *base;

			base = get_delta_base_sha1(p, &w_curs, curpos,
						   type, obj_offset);
			if (!base) {
				type = OBJ_BAD;
				goto out;
			}

			hashcpy(oi->delta_base_sha1, base);
		} else
			hashclr(oi->delta_base_sha1);
	}

2303 2304 2305 2306 2307
out:
	unuse_pack(&w_curs);
	return type;
}

2308
static void *unpack_compressed_entry(struct packed_git *p,
2309
				    struct pack_window **w_curs,
2310
				    off_t curpos,
2311
				    unsigned long size)
2312 2313
{
	int st;
2314
	git_zstream stream;
2315
	unsigned char *buffer, *in;
2316

2317 2318 2319
	buffer = xmallocz_gently(size);
	if (!buffer)
		return NULL;
2320 2321
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
2322
	stream.avail_out = size + 1;
2323

2324
	git_inflate_init(&stream);
2325
	do {
2326
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
2327
		stream.next_in = in;
2328
		st = git_inflate(&stream, Z_FINISH);
2329 2330
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
2331
		curpos += stream.next_in - in;
2332
	} while (st == Z_OK || st == Z_BUF_ERROR);
2333
	git_inflate_end(&stream);
2334 2335 2336 2337 2338 2339 2340 2341
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

J
Jeff King 已提交
2342
static struct hashmap delta_base_cache;
2343
static size_t delta_base_cached;
2344

J
Jeff King 已提交
2345
static LIST_HEAD(delta_base_cache_lru);
2346

J
Jeff King 已提交
2347
struct delta_base_cache_key {
2348 2349
	struct packed_git *p;
	off_t base_offset;
J
Jeff King 已提交
2350 2351 2352 2353 2354 2355 2356
};

struct delta_base_cache_entry {
	struct hashmap hash;
	struct delta_base_cache_key key;
	struct list_head lru;
	void *data;
2357 2358
	unsigned long size;
	enum object_type type;
J
Jeff King 已提交
2359
};
2360

J
Jeff King 已提交
2361
static unsigned int pack_entry_hash(struct packed_git *p, off_t base_offset)
2362
{
J
Jeff King 已提交
2363
	unsigned int hash;
2364

J
Jeff King 已提交
2365
	hash = (unsigned int)(intptr_t)p + (unsigned int)base_offset;
2366
	hash += (hash >> 8) + (hash >> 16);
J
Jeff King 已提交
2367
	return hash;
2368 2369
}

2370 2371
static struct delta_base_cache_entry *
get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
2372
{
J
Jeff King 已提交
2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388
	struct hashmap_entry entry;
	struct delta_base_cache_key key;

	if (!delta_base_cache.cmpfn)
		return NULL;

	hashmap_entry_init(&entry, pack_entry_hash(p, base_offset));
	key.p = p;
	key.base_offset = base_offset;
	return hashmap_get(&delta_base_cache, &entry, &key);
}

static int delta_base_cache_key_eq(const struct delta_base_cache_key *a,
				   const struct delta_base_cache_key *b)
{
	return a->p == b->p && a->base_offset == b->base_offset;
2389 2390
}

J
Jeff King 已提交
2391 2392
static int delta_base_cache_hash_cmp(const void *va, const void *vb,
				     const void *vkey)
2393
{
J
Jeff King 已提交
2394 2395 2396 2397 2398 2399
	const struct delta_base_cache_entry *a = va, *b = vb;
	const struct delta_base_cache_key *key = vkey;
	if (key)
		return !delta_base_cache_key_eq(&a->key, key);
	else
		return !delta_base_cache_key_eq(&a->key, &b->key);
2400 2401
}

2402 2403
static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
{
J
Jeff King 已提交
2404
	return !!get_delta_base_cache_entry(p, base_offset);
2405 2406
}

2407 2408 2409 2410 2411 2412
/*
 * Remove the entry from the cache, but do _not_ free the associated
 * entry data. The caller takes ownership of the "data" buffer, and
 * should copy out any fields it wants before detaching.
 */
static void detach_delta_base_cache_entry(struct delta_base_cache_entry *ent)
2413
{
J
Jeff King 已提交
2414
	hashmap_remove(&delta_base_cache, ent, &ent->key);
J
Jeff King 已提交
2415
	list_del(&ent->lru);
2416
	delta_base_cached -= ent->size;
J
Jeff King 已提交
2417
	free(ent);
2418 2419
}

2420
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2421
	unsigned long *base_size, enum object_type *type)
2422
{
2423
	struct delta_base_cache_entry *ent;
2424

2425
	ent = get_delta_base_cache_entry(p, base_offset);
J
Jeff King 已提交
2426
	if (!ent)
2427
		return unpack_entry(p, base_offset, type, base_size);
2428 2429 2430

	*type = ent->type;
	*base_size = ent->size;
2431
	return xmemdupz(ent->data, ent->size);
2432 2433
}

2434 2435
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
J
Jeff King 已提交
2436 2437
	free(ent->data);
	detach_delta_base_cache_entry(ent);
2438 2439
}

2440 2441
void clear_delta_base_cache(void)
{
2442 2443 2444 2445
	struct list_head *lru, *tmp;
	list_for_each_safe(lru, tmp, &delta_base_cache_lru) {
		struct delta_base_cache_entry *entry =
			list_entry(lru, struct delta_base_cache_entry, lru);
J
Jeff King 已提交
2446 2447
		release_delta_base_cache(entry);
	}
2448 2449
}

2450 2451 2452
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
J
Jeff King 已提交
2453
	struct delta_base_cache_entry *ent = xmalloc(sizeof(*ent));
2454
	struct list_head *lru, *tmp;
2455

2456
	delta_base_cached += base_size;
2457

2458
	list_for_each_safe(lru, tmp, &delta_base_cache_lru) {
J
Jeff King 已提交
2459 2460 2461 2462
		struct delta_base_cache_entry *f =
			list_entry(lru, struct delta_base_cache_entry, lru);
		if (delta_base_cached <= delta_base_cache_limit)
			break;
2463 2464
		release_delta_base_cache(f);
	}
2465

J
Jeff King 已提交
2466 2467
	ent->key.p = p;
	ent->key.base_offset = base_offset;
2468 2469 2470
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
J
Jeff King 已提交
2471
	list_add_tail(&ent->lru, &delta_base_cache_lru);
J
Jeff King 已提交
2472 2473 2474 2475 2476

	if (!delta_base_cache.cmpfn)
		hashmap_init(&delta_base_cache, delta_base_cache_hash_cmp, 0);
	hashmap_entry_init(ent, pack_entry_hash(p, base_offset));
	hashmap_add(&delta_base_cache, ent);
2477 2478
}

2479 2480 2481
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

2482 2483
static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
{
2484 2485 2486
	static struct trace_key pack_access = TRACE_KEY_INIT(PACK_ACCESS);
	trace_printf_key(&pack_access, "%s %"PRIuMAX"\n",
			 p->pack_name, (uintmax_t)obj_offset);
2487 2488
}

2489 2490
int do_check_packed_object_crc;

2491 2492 2493 2494 2495 2496 2497
#define UNPACK_ENTRY_STACK_PREALLOC 64
struct unpack_entry_stack_ent {
	off_t obj_offset;
	off_t curpos;
	unsigned long size;
};

2498
void *unpack_entry(struct packed_git *p, off_t obj_offset,
2499
		   enum object_type *final_type, unsigned long *final_size)
2500
{
2501
	struct pack_window *w_curs = NULL;
2502
	off_t curpos = obj_offset;
2503 2504 2505 2506 2507 2508 2509
	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;
2510

2511
	write_pack_access_log(p, obj_offset);
2512

2513 2514 2515 2516 2517 2518
	/* PHASE 1: drill down to the innermost base object */
	for (;;) {
		off_t base_offset;
		int i;
		struct delta_base_cache_entry *ent;

2519
		ent = get_delta_base_cache_entry(p, curpos);
J
Jeff King 已提交
2520
		if (ent) {
2521 2522 2523
			type = ent->type;
			data = ent->data;
			size = ent->size;
2524
			detach_delta_base_cache_entry(ent);
2525 2526 2527 2528
			base_from_cache = 1;
			break;
		}

2529 2530
		if (do_check_packed_object_crc && p->index_version > 1) {
			struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2531
			off_t len = revidx[1].offset - obj_offset;
2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560
			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);
J
Jeff King 已提交
2561
			ALLOC_ARRAY(delta_stack, delta_stack_alloc);
2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572
			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;
2573 2574
	}

2575 2576
	/* PHASE 2: handle the base */
	switch (type) {
2577 2578
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
2579
		if (data)
2580
			die("BUG: unpack_entry: left loop at a valid delta");
2581
		break;
2582 2583 2584 2585
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2586 2587
		if (!base_from_cache)
			data = unpack_compressed_entry(p, &w_curs, curpos, size);
2588
		break;
2589
	default:
2590 2591
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602
		      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;
2603
		void *external_base = NULL;
2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629
		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);
2630
				external_base = base;
2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648
			}
		}

		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;
2649
			free(external_base);
2650 2651 2652 2653 2654 2655
			continue;
		}

		data = patch_delta(base, base_size,
				   delta_data, delta_size,
				   &size);
2656 2657 2658 2659 2660 2661 2662 2663 2664

		/*
		 * 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.
		 */
2665
		if (!data)
2666
			error("failed to apply delta");
2667

2668
		free(delta_data);
2669
		free(external_base);
2670
	}
2671 2672 2673 2674

	*final_type = type;
	*final_size = size;

2675
	unuse_pack(&w_curs);
2676 2677 2678 2679

	if (delta_stack != small_delta_stack)
		free(delta_stack);

2680
	return data;
2681 2682
}

2683
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2684
					    uint32_t n)
2685
{
2686
	const unsigned char *index = p->index_data;
2687 2688 2689 2690 2691
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
2692
	if (n >= p->num_objects)
2693
		return NULL;
2694 2695 2696 2697 2698 2699 2700 2701 2702
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713
const struct object_id *nth_packed_object_oid(struct object_id *oid,
					      struct packed_git *p,
					      uint32_t n)
{
	const unsigned char *hash = nth_packed_object_sha1(p, n);
	if (!hash)
		return NULL;
	hashcpy(oid->hash, hash);
	return oid;
}

2714 2715 2716 2717 2718 2719
void check_pack_index_ptr(const struct packed_git *p, const void *vptr)
{
	const unsigned char *ptr = vptr;
	const unsigned char *start = p->index_data;
	const unsigned char *end = start + p->index_size;
	if (ptr < start)
2720
		die(_("offset before start of pack index for %s (corrupt index?)"),
2721 2722 2723
		    p->pack_name);
	/* No need to check for underflow; .idx files must be at least 8 bytes */
	if (ptr >= end - 8)
2724
		die(_("offset beyond end of pack index for %s (truncated index?)"),
2725 2726 2727
		    p->pack_name);
}

N
Nicolas Pitre 已提交
2728
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740
{
	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;
2741
		check_pack_index_ptr(p, index);
2742 2743 2744
		return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
				   ntohl(*((uint32_t *)(index + 4)));
	}
2745 2746
}

2747
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
2748
				  struct packed_git *p)
2749
{
2750 2751
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
2752 2753 2754 2755 2756 2757
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

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

2759 2760 2761 2762 2763 2764
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
2765 2766 2767 2768
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
2769
	index += 4 * 256;
2770 2771
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2772 2773 2774 2775 2776 2777 2778 2779
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
2780
		printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791
		       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);
	}
2792 2793

	do {
2794
		unsigned mi = (lo + hi) / 2;
2795 2796 2797 2798 2799
		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 已提交
2800
		if (!cmp)
2801
			return nth_packed_object_offset(p, mi);
2802 2803 2804 2805 2806 2807 2808 2809
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

2810
int is_pack_valid(struct packed_git *p)
2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830
{
	/* 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);
}

2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854
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!
	 */
2855
	if (!is_pack_valid(p))
2856 2857 2858 2859 2860 2861 2862
		return 0;
	e->offset = offset;
	e->p = p;
	hashcpy(e->sha1, sha1);
	return 1;
}

2863 2864 2865 2866
/*
 * Iff a pack file contains the object named by sha1, return true and
 * store its location to e.
 */
2867
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2868
{
2869
	struct mru_entry *p;
N
Nicolas Pitre 已提交
2870

2871
	prepare_packed_git();
2872 2873
	if (!packed_git)
		return 0;
2874

2875 2876 2877
	for (p = packed_git_mru->head; p; p = p->next) {
		if (fill_pack_entry(sha1, e, p->item)) {
			mru_mark(packed_git_mru, p);
2878 2879
			return 1;
		}
2880
	}
2881 2882 2883
	return 0;
}

J
Junio C Hamano 已提交
2884
struct packed_git *find_sha1_pack(const unsigned char *sha1,
2885 2886 2887 2888 2889
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
2890
		if (find_pack_entry_one(sha1, p))
2891 2892 2893
			return p;
	}
	return NULL;
2894

2895 2896
}

2897
static int sha1_loose_object_info(const unsigned char *sha1,
2898 2899
				  struct object_info *oi,
				  int flags)
2900
{
2901 2902
	int status = 0;
	unsigned long mapsize;
2903
	void *map;
2904
	git_zstream stream;
N
Nicolas Pitre 已提交
2905
	char hdr[32];
2906
	struct strbuf hdrbuf = STRBUF_INIT;
2907

2908 2909 2910
	if (oi->delta_base_sha1)
		hashclr(oi->delta_base_sha1);

2911 2912
	/*
	 * If we don't care about type or size, then we don't
2913 2914 2915 2916 2917
	 * need to look inside the object at all. Note that we
	 * do not optimize out the stat call, even if the
	 * caller doesn't care about the disk-size, since our
	 * return value implicitly indicates whether the
	 * object even exists.
2918
	 */
2919
	if (!oi->typep && !oi->typename && !oi->sizep) {
2920
		const char *path;
2921
		struct stat st;
2922
		if (stat_sha1_file(sha1, &st, &path) < 0)
2923 2924
			return -1;
		if (oi->disk_sizep)
2925
			*oi->disk_sizep = st.st_size;
2926 2927 2928
		return 0;
	}

2929
	map = map_sha1_file(sha1, &mapsize);
2930
	if (!map)
2931
		return -1;
2932 2933
	if (oi->disk_sizep)
		*oi->disk_sizep = mapsize;
2934 2935 2936 2937 2938
	if ((flags & LOOKUP_UNKNOWN_OBJECT)) {
		if (unpack_sha1_header_to_strbuf(&stream, map, mapsize, hdr, sizeof(hdr), &hdrbuf) < 0)
			status = error("unable to unpack %s header with --allow-unknown-type",
				       sha1_to_hex(sha1));
	} else if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
2939 2940
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
2941 2942 2943 2944 2945 2946 2947
	if (status < 0)
		; /* Do nothing */
	else if (hdrbuf.len) {
		if ((status = parse_sha1_header_extended(hdrbuf.buf, oi, flags)) < 0)
			status = error("unable to parse %s header with --allow-unknown-type",
				       sha1_to_hex(sha1));
	} else if ((status = parse_sha1_header_extended(hdr, oi, flags)) < 0)
2948
		status = error("unable to parse %s header", sha1_to_hex(sha1));
2949
	git_inflate_end(&stream);
2950
	munmap(map, mapsize);
2951
	if (status && oi->typep)
2952
		*oi->typep = status;
2953
	strbuf_release(&hdrbuf);
2954
	return (status < 0) ? status : 0;
2955 2956
}

2957
int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi, unsigned flags)
2958
{
2959
	struct cached_object *co;
2960
	struct pack_entry e;
2961
	int rtype;
2962
	enum object_type real_type;
2963
	const unsigned char *real = lookup_replace_object_extended(sha1, flags);
2964

2965
	co = find_cached_object(real);
2966
	if (co) {
2967 2968
		if (oi->typep)
			*(oi->typep) = co->type;
2969 2970
		if (oi->sizep)
			*(oi->sizep) = co->size;
2971 2972
		if (oi->disk_sizep)
			*(oi->disk_sizep) = 0;
2973 2974
		if (oi->delta_base_sha1)
			hashclr(oi->delta_base_sha1);
2975 2976
		if (oi->typename)
			strbuf_addstr(oi->typename, typename(co->type));
2977
		oi->whence = OI_CACHED;
2978
		return 0;
2979 2980
	}

2981
	if (!find_pack_entry(real, &e)) {
2982
		/* Most likely it's a loose object. */
2983
		if (!sha1_loose_object_info(real, oi, flags)) {
2984
			oi->whence = OI_LOOSE;
2985
			return 0;
2986
		}
2987 2988

		/* Not a loose object; someone else may have just packed it. */
2989
		reprepare_packed_git();
2990
		if (!find_pack_entry(real, &e))
2991
			return -1;
2992
	}
2993

2994 2995 2996 2997 2998 2999 3000
	/*
	 * packed_object_info() does not follow the delta chain to
	 * find out the real type, unless it is given oi->typep.
	 */
	if (oi->typename && !oi->typep)
		oi->typep = &real_type;

3001
	rtype = packed_object_info(e.p, e.offset, oi);
3002
	if (rtype < 0) {
3003
		mark_bad_packed_object(e.p, real);
3004 3005
		if (oi->typep == &real_type)
			oi->typep = NULL;
3006
		return sha1_object_info_extended(real, oi, 0);
3007 3008
	} else if (in_delta_base_cache(e.p, e.offset)) {
		oi->whence = OI_DBCACHED;
3009 3010 3011 3012 3013 3014
	} 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);
3015
	}
3016 3017 3018 3019
	if (oi->typename)
		strbuf_addstr(oi->typename, typename(*oi->typep));
	if (oi->typep == &real_type)
		oi->typep = NULL;
3020

3021
	return 0;
3022 3023
}

3024
/* returns enum object_type or negative */
3025 3026
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
{
3027
	enum object_type type;
3028
	struct object_info oi = OBJECT_INFO_INIT;
3029

3030
	oi.typep = &type;
3031
	oi.sizep = sizep;
3032
	if (sha1_object_info_extended(sha1, &oi, LOOKUP_REPLACE_OBJECT) < 0)
3033 3034
		return -1;
	return type;
3035 3036
}

3037 3038
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
3039 3040
{
	struct pack_entry e;
3041
	void *data;
3042

3043
	if (!find_pack_entry(sha1, &e))
3044
		return NULL;
3045
	data = cache_or_unpack_entry(e.p, e.offset, size, type);
3046 3047 3048 3049 3050 3051 3052 3053 3054 3055
	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);
3056
		data = read_object(sha1, type, size);
3057 3058
	}
	return data;
3059 3060
}

3061 3062
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
3063 3064 3065
{
	struct cached_object *co;

3066
	hash_sha1_file(buf, len, typename(type), sha1);
3067 3068
	if (has_sha1_file(sha1) || find_cached_object(sha1))
		return 0;
3069
	ALLOC_GROW(cached_objects, cached_object_nr + 1, cached_object_alloc);
3070 3071
	co = &cached_objects[cached_object_nr++];
	co->size = len;
3072
	co->type = type;
J
Junio C Hamano 已提交
3073 3074
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
3075 3076 3077 3078
	hashcpy(co->sha1, sha1);
	return 0;
}

3079 3080
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size)
3081 3082 3083
{
	unsigned long mapsize;
	void *map, *buf;
3084 3085 3086 3087
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
3088
		*type = co->type;
3089
		*size = co->size;
P
Pierre Habouzit 已提交
3090
		return xmemdupz(co->buf, co->size);
3091
	}
3092

3093 3094 3095
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
3096
	map = map_sha1_file(sha1, &mapsize);
3097
	if (map) {
3098
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
3099 3100 3101
		munmap(map, mapsize);
		return buf;
	}
3102
	reprepare_packed_git();
3103
	return read_packed_sha1(sha1, type, size);
3104 3105
}

3106 3107 3108 3109 3110
/*
 * 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.
 */
3111 3112 3113 3114
void *read_sha1_file_extended(const unsigned char *sha1,
			      enum object_type *type,
			      unsigned long *size,
			      unsigned flag)
3115
{
3116
	void *data;
3117
	const struct packed_git *p;
3118 3119
	const char *path;
	struct stat st;
3120
	const unsigned char *repl = lookup_replace_object_extended(sha1, flag);
3121

3122 3123
	errno = 0;
	data = read_object(repl, type, size);
3124
	if (data)
3125
		return data;
3126

3127
	if (errno && errno != ENOENT)
3128 3129
		die_errno("failed to read object %s", sha1_to_hex(sha1));

3130
	/* die if we replaced an object with one that does not exist */
3131
	if (repl != sha1)
3132 3133 3134
		die("replacement %s not found for %s",
		    sha1_to_hex(repl), sha1_to_hex(sha1));

3135
	if (!stat_sha1_file(repl, &st, &path))
3136 3137
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
3138

3139 3140 3141
	if ((p = has_packed_and_bad(repl)) != NULL)
		die("packed object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), p->pack_name);
3142

3143
	return NULL;
3144 3145
}

3146
void *read_object_with_reference(const unsigned char *sha1,
3147
				 const char *required_type_name,
3148 3149
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
3150
{
3151
	enum object_type type, required_type;
3152 3153
	void *buffer;
	unsigned long isize;
3154
	unsigned char actual_sha1[20];
3155

3156
	required_type = type_from_string(required_type_name);
3157
	hashcpy(actual_sha1, sha1);
3158 3159 3160
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
3161

3162
		buffer = read_sha1_file(actual_sha1, &type, &isize);
3163 3164
		if (!buffer)
			return NULL;
3165
		if (type == required_type) {
3166 3167
			*size = isize;
			if (actual_sha1_return)
3168
				hashcpy(actual_sha1_return, actual_sha1);
3169 3170 3171
			return buffer;
		}
		/* Handle references */
3172
		else if (type == OBJ_COMMIT)
3173
			ref_type = "tree ";
3174
		else if (type == OBJ_TAG)
3175 3176 3177 3178 3179 3180
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
3181

3182 3183
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
3184
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
3185 3186 3187
			free(buffer);
			return NULL;
		}
3188
		free(buffer);
3189 3190
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
3191 3192 3193
	}
}

N
Nicolas Pitre 已提交
3194
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
3195
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
3196
                                    char *hdr, int *hdrlen)
3197
{
3198
	git_SHA_CTX c;
3199 3200

	/* Generate the header */
3201
	*hdrlen = xsnprintf(hdr, *hdrlen, "%s %lu", type, len)+1;
3202 3203

	/* Sha1.. */
3204 3205 3206 3207
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
3208 3209
}

3210
/*
3211
 * Move the just written object into its final resting place.
3212
 */
3213
int finalize_object_file(const char *tmpfile, const char *filename)
3214
{
3215
	int ret = 0;
3216

3217
	if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
3218 3219
		goto try_rename;
	else if (link(tmpfile, filename))
3220
		ret = errno;
3221 3222 3223 3224 3225 3226 3227 3228 3229

	/*
	 * 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.
	 *
3230
	 * When this succeeds, we just return.  We have nothing
3231 3232 3233
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
3234
	try_rename:
3235
		if (!rename(tmpfile, filename))
3236
			goto out;
3237
		ret = errno;
3238
	}
3239
	unlink_or_warn(tmpfile);
3240 3241
	if (ret) {
		if (ret != EEXIST) {
3242
			return error_errno("unable to write sha1 filename %s", filename);
3243 3244 3245 3246
		}
		/* FIXME!!! Collision check here ? */
	}

3247
out:
3248
	if (adjust_shared_perm(filename))
3249
		return error("unable to set permission to '%s'", filename);
3250 3251 3252
	return 0;
}

L
Linus Torvalds 已提交
3253 3254
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
3255
	if (write_in_full(fd, buf, len) < 0)
3256
		return error_errno("file write error");
L
Linus Torvalds 已提交
3257 3258 3259
	return 0;
}

N
Nicolas Pitre 已提交
3260
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
3261 3262
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
3263
	char hdr[32];
3264
	int hdrlen = sizeof(hdr);
R
Rene Scharfe 已提交
3265 3266 3267 3268
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

3269 3270 3271
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
3272 3273
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
3274
	if (close(fd) != 0)
3275
		die_errno("error when closing sha1 file");
3276 3277
}

3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293
/* 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).
 */
J
Jeff King 已提交
3294
static int create_tmpfile(struct strbuf *tmp, const char *filename)
3295 3296 3297
{
	int fd, dirlen = directory_size(filename);

J
Jeff King 已提交
3298 3299 3300 3301
	strbuf_reset(tmp);
	strbuf_add(tmp, filename, dirlen);
	strbuf_addstr(tmp, "tmp_obj_XXXXXX");
	fd = git_mkstemp_mode(tmp->buf, 0444);
3302
	if (fd < 0 && dirlen && errno == ENOENT) {
J
Jeff King 已提交
3303 3304 3305 3306 3307 3308 3309 3310 3311
		/*
		 * Make sure the directory exists; note that the contents
		 * of the buffer are undefined after mkstemp returns an
		 * error, so we have to rewrite the whole buffer from
		 * scratch.
		 */
		strbuf_reset(tmp);
		strbuf_add(tmp, filename, dirlen - 1);
		if (mkdir(tmp->buf, 0777) && errno != EEXIST)
3312
			return -1;
J
Jeff King 已提交
3313
		if (adjust_shared_perm(tmp->buf))
3314 3315 3316
			return -1;

		/* Try again */
J
Jeff King 已提交
3317 3318
		strbuf_addstr(tmp, "/tmp_obj_XXXXXX");
		fd = git_mkstemp_mode(tmp->buf, 0444);
3319 3320 3321 3322
	}
	return fd;
}

3323
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
3324
			      const void *buf, unsigned long len, time_t mtime)
3325
{
3326
	int fd, ret;
3327
	unsigned char compressed[4096];
3328
	git_zstream stream;
3329 3330
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
J
Jeff King 已提交
3331
	static struct strbuf tmp_file = STRBUF_INIT;
3332
	const char *filename = sha1_file_name(sha1);
3333

J
Jeff King 已提交
3334
	fd = create_tmpfile(&tmp_file, filename);
3335
	if (fd < 0) {
3336
		if (errno == EACCES)
3337
			return error("insufficient permission for adding an object to repository database %s", get_object_directory());
3338
		else
3339
			return error_errno("unable to create temporary file");
3340 3341
	}

3342
	/* Set it up */
3343
	git_deflate_init(&stream, zlib_compression_level);
3344
	stream.next_out = compressed;
3345
	stream.avail_out = sizeof(compressed);
3346
	git_SHA1_Init(&c);
3347 3348

	/* First header.. */
N
Nicolas Pitre 已提交
3349
	stream.next_in = (unsigned char *)hdr;
3350
	stream.avail_in = hdrlen;
3351 3352
	while (git_deflate(&stream, 0) == Z_OK)
		; /* nothing */
3353
	git_SHA1_Update(&c, hdr, hdrlen);
3354 3355

	/* Then the data itself.. */
3356
	stream.next_in = (void *)buf;
3357
	stream.avail_in = len;
3358
	do {
3359
		unsigned char *in0 = stream.next_in;
3360
		ret = git_deflate(&stream, Z_FINISH);
3361
		git_SHA1_Update(&c, in0, stream.next_in - in0);
3362 3363 3364 3365 3366 3367
		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);

3368 3369
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
3370
	ret = git_deflate_end_gently(&stream);
3371 3372
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
3373 3374 3375
	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));
3376

3377
	close_sha1_file(fd);
3378

3379 3380 3381 3382
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
J
Jeff King 已提交
3383
		if (utime(tmp_file.buf, &utb) < 0)
3384
			warning_errno("failed utime() on %s", tmp_file.buf);
3385 3386
	}

J
Jeff King 已提交
3387
	return finalize_object_file(tmp_file.buf, filename);
3388
}
3389

3390 3391 3392 3393 3394 3395 3396 3397
static int freshen_loose_object(const unsigned char *sha1)
{
	return check_and_freshen(sha1, 1);
}

static int freshen_packed_object(const unsigned char *sha1)
{
	struct pack_entry e;
3398 3399 3400 3401 3402 3403 3404 3405
	if (!find_pack_entry(sha1, &e))
		return 0;
	if (e.p->freshened)
		return 1;
	if (!freshen_file(e.p->pack_name))
		return 0;
	e.p->freshened = 1;
	return 1;
3406 3407
}

3408
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *sha1)
3409 3410
{
	char hdr[32];
3411
	int hdrlen = sizeof(hdr);
3412 3413 3414 3415 3416

	/* 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);
3417
	if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3418 3419 3420 3421
		return 0;
	return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
}

3422 3423 3424 3425 3426 3427 3428
int hash_sha1_file_literally(const void *buf, unsigned long len, const char *type,
			     unsigned char *sha1, unsigned flags)
{
	char *header;
	int hdrlen, status = 0;

	/* type string, SP, %lu of the length plus NUL must fit this */
3429 3430
	hdrlen = strlen(type) + 32;
	header = xmalloc(hdrlen);
3431 3432 3433 3434
	write_sha1_file_prepare(buf, len, type, sha1, header, &hdrlen);

	if (!(flags & HASH_WRITE_OBJECT))
		goto cleanup;
J
Junio C Hamano 已提交
3435
	if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3436 3437 3438 3439 3440 3441 3442 3443
		goto cleanup;
	status = write_loose_object(sha1, header, hdrlen, buf, len, 0);

cleanup:
	free(header);
	return status;
}

3444 3445 3446 3447 3448 3449 3450
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;
3451
	int ret;
3452

3453
	if (has_loose_object(sha1))
3454 3455 3456 3457
		return 0;
	buf = read_packed_sha1(sha1, &type, &len);
	if (!buf)
		return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
3458
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(type), len) + 1;
3459 3460 3461 3462
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
3463 3464
}

3465 3466 3467 3468 3469 3470 3471 3472
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

3473 3474 3475 3476 3477 3478
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

3479
int has_sha1_file_with_flags(const unsigned char *sha1, int flags)
3480
{
3481 3482
	struct pack_entry e;

3483 3484
	if (!startup_info->have_repository)
		return 0;
3485
	if (find_pack_entry(sha1, &e))
3486
		return 1;
3487 3488
	if (has_loose_object(sha1))
		return 1;
3489 3490
	if (flags & HAS_SHA1_QUICK)
		return 0;
3491 3492
	reprepare_packed_git();
	return find_pack_entry(sha1, &e);
3493 3494 3495 3496 3497
}

int has_object_file(const struct object_id *oid)
{
	return has_sha1_file(oid->hash);
3498
}
J
Junio C Hamano 已提交
3499

3500 3501 3502 3503 3504
int has_object_file_with_flags(const struct object_id *oid, int flags)
{
	return has_sha1_file_with_flags(oid->hash, flags);
}

3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532
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");
}

3533
static int index_mem(unsigned char *sha1, void *buf, size_t size,
3534 3535
		     enum object_type type,
		     const char *path, unsigned flags)
3536
{
L
Linus Torvalds 已提交
3537
	int ret, re_allocated = 0;
3538
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
3539

3540
	if (!type)
3541
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
3542 3543 3544 3545

	/*
	 * Convert blobs to git internal format
	 */
3546
	if ((type == OBJ_BLOB) && path) {
3547
		struct strbuf nbuf = STRBUF_INIT;
3548
		if (convert_to_git(path, buf, size, &nbuf,
3549
				   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3550
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
3551 3552 3553
			re_allocated = 1;
		}
	}
3554
	if (flags & HASH_FORMAT_CHECK) {
3555 3556 3557 3558 3559 3560 3561
		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 已提交
3562

3563
	if (write_object)
3564
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
3565
	else
3566
		ret = hash_sha1_file(buf, size, typename(type), sha1);
3567
	if (re_allocated)
L
Linus Torvalds 已提交
3568
		free(buf);
3569 3570 3571
	return ret;
}

3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594
static int index_stream_convert_blob(unsigned char *sha1, int fd,
				     const char *path, unsigned flags)
{
	int ret;
	const int write_object = flags & HASH_WRITE_OBJECT;
	struct strbuf sbuf = STRBUF_INIT;

	assert(path);
	assert(would_convert_to_git_filter_fd(path));

	convert_to_git_filter_fd(path, fd, &sbuf,
				 write_object ? safe_crlf : SAFE_CRLF_FALSE);

	if (write_object)
		ret = write_sha1_file(sbuf.buf, sbuf.len, typename(OBJ_BLOB),
				      sha1);
	else
		ret = hash_sha1_file(sbuf.buf, sbuf.len, typename(OBJ_BLOB),
				     sha1);
	strbuf_release(&sbuf);
	return ret;
}

3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608
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;
}

3609 3610
#define SMALL_FILE_SIZE (32*1024)

3611 3612 3613
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
3614 3615 3616
{
	int ret;

3617
	if (!size) {
3618
		ret = index_mem(sha1, "", size, type, path, flags);
3619 3620 3621
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
3622
			ret = index_mem(sha1, buf, size, type, path, flags);
3623
		else
3624
			ret = error_errno("short read");
3625
		free(buf);
3626
	} else {
3627
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3628
		ret = index_mem(sha1, buf, size, type, path, flags);
3629
		munmap(buf, size);
3630
	}
3631 3632 3633
	return ret;
}

3634
/*
3635 3636
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
3637 3638 3639 3640
 *
 * 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
3641 3642 3643 3644 3645 3646 3647
 * (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.
3648 3649 3650 3651 3652
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
3653
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
3654 3655
}

3656 3657 3658 3659 3660
int index_fd(unsigned char *sha1, int fd, struct stat *st,
	     enum object_type type, const char *path, unsigned flags)
{
	int ret;

3661 3662 3663 3664
	/*
	 * Call xsize_t() only when needed to avoid potentially unnecessary
	 * die() for large files.
	 */
3665 3666 3667
	if (type == OBJ_BLOB && path && would_convert_to_git_filter_fd(path))
		ret = index_stream_convert_blob(sha1, fd, path, flags);
	else if (!S_ISREG(st->st_mode))
3668
		ret = index_pipe(sha1, fd, type, path, flags);
3669
	else if (st->st_size <= big_file_threshold || type != OBJ_BLOB ||
3670
		 (path && would_convert_to_git(path)))
3671 3672
		ret = index_core(sha1, fd, xsize_t(st->st_size), type, path,
				 flags);
3673
	else
3674 3675
		ret = index_stream(sha1, fd, xsize_t(st->st_size), type, path,
				   flags);
3676
	close(fd);
3677
	return ret;
J
Junio C Hamano 已提交
3678
}
3679

3680
int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3681 3682
{
	int fd;
3683
	struct strbuf sb = STRBUF_INIT;
3684 3685 3686 3687 3688

	switch (st->st_mode & S_IFMT) {
	case S_IFREG:
		fd = open(path, O_RDONLY);
		if (fd < 0)
3689
			return error_errno("open(\"%s\")", path);
3690
		if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3691 3692 3693 3694
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
3695 3696
		if (strbuf_readlink(&sb, path, st->st_size))
			return error_errno("readlink(\"%s\")", path);
3697
		if (!(flags & HASH_WRITE_OBJECT))
3698 3699
			hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
		else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3700 3701
			return error("%s: failed to insert into database",
				     path);
3702
		strbuf_release(&sb);
3703
		break;
3704 3705
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
3706 3707 3708 3709 3710
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
3711 3712 3713

int read_pack_header(int fd, struct pack_header *header)
{
3714 3715 3716 3717
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

3718 3719 3720 3721 3722 3723 3724 3725
	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 已提交
3726 3727 3728 3729 3730 3731 3732 3733 3734 3735

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));
}
3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751

static int for_each_file_in_obj_subdir(int subdir_nr,
				       struct strbuf *path,
				       each_loose_object_fn obj_cb,
				       each_loose_cruft_fn cruft_cb,
				       each_loose_subdir_fn subdir_cb,
				       void *data)
{
	size_t baselen = path->len;
	DIR *dir = opendir(path->buf);
	struct dirent *de;
	int r = 0;

	if (!dir) {
		if (errno == ENOENT)
			return 0;
3752
		return error_errno("unable to open %s", path->buf);
3753 3754 3755 3756 3757 3758 3759 3760 3761
	}

	while ((de = readdir(dir))) {
		if (is_dot_or_dotdot(de->d_name))
			continue;

		strbuf_setlen(path, baselen);
		strbuf_addf(path, "/%s", de->d_name);

3762
		if (strlen(de->d_name) == GIT_SHA1_HEXSZ - 2)  {
3763
			char hex[GIT_MAX_HEXSZ+1];
3764
			struct object_id oid;
3765

3766 3767
			xsnprintf(hex, sizeof(hex), "%02x%s",
				  subdir_nr, de->d_name);
3768
			if (!get_oid_hex(hex, &oid)) {
3769
				if (obj_cb) {
3770
					r = obj_cb(&oid, path->buf, data);
3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783
					if (r)
						break;
				}
				continue;
			}
		}

		if (cruft_cb) {
			r = cruft_cb(de->d_name, path->buf, data);
			if (r)
				break;
		}
	}
3784
	closedir(dir);
3785

3786
	strbuf_setlen(path, baselen);
3787 3788 3789 3790 3791 3792
	if (!r && subdir_cb)
		r = subdir_cb(subdir_nr, path->buf, data);

	return r;
}

3793
int for_each_loose_file_in_objdir_buf(struct strbuf *path,
3794 3795 3796 3797 3798
			    each_loose_object_fn obj_cb,
			    each_loose_cruft_fn cruft_cb,
			    each_loose_subdir_fn subdir_cb,
			    void *data)
{
3799
	size_t baselen = path->len;
3800 3801 3802 3803
	int r = 0;
	int i;

	for (i = 0; i < 256; i++) {
3804 3805
		strbuf_addf(path, "/%02x", i);
		r = for_each_file_in_obj_subdir(i, path, obj_cb, cruft_cb,
3806
						subdir_cb, data);
3807
		strbuf_setlen(path, baselen);
3808 3809 3810 3811
		if (r)
			break;
	}

3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826
	return r;
}

int for_each_loose_file_in_objdir(const char *path,
				  each_loose_object_fn obj_cb,
				  each_loose_cruft_fn cruft_cb,
				  each_loose_subdir_fn subdir_cb,
				  void *data)
{
	struct strbuf buf = STRBUF_INIT;
	int r;

	strbuf_addstr(&buf, path);
	r = for_each_loose_file_in_objdir_buf(&buf, obj_cb, cruft_cb,
					      subdir_cb, data);
3827
	strbuf_release(&buf);
3828

3829 3830
	return r;
}
3831 3832 3833 3834 3835 3836 3837 3838 3839 3840

struct loose_alt_odb_data {
	each_loose_object_fn *cb;
	void *data;
};

static int loose_from_alt_odb(struct alternate_object_database *alt,
			      void *vdata)
{
	struct loose_alt_odb_data *data = vdata;
3841 3842 3843
	struct strbuf buf = STRBUF_INIT;
	int r;

3844
	strbuf_addstr(&buf, alt->path);
3845 3846 3847 3848 3849
	r = for_each_loose_file_in_objdir_buf(&buf,
					      data->cb, NULL, NULL,
					      data->data);
	strbuf_release(&buf);
	return r;
3850 3851
}

3852
int for_each_loose_object(each_loose_object_fn cb, void *data, unsigned flags)
3853 3854 3855 3856 3857 3858 3859 3860 3861
{
	struct loose_alt_odb_data alt;
	int r;

	r = for_each_loose_file_in_objdir(get_object_directory(),
					  cb, NULL, NULL, data);
	if (r)
		return r;

3862 3863 3864
	if (flags & FOR_EACH_OBJECT_LOCAL_ONLY)
		return 0;

3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875
	alt.cb = cb;
	alt.data = data;
	return foreach_alt_odb(loose_from_alt_odb, &alt);
}

static int for_each_object_in_pack(struct packed_git *p, each_packed_object_fn cb, void *data)
{
	uint32_t i;
	int r = 0;

	for (i = 0; i < p->num_objects; i++) {
3876
		struct object_id oid;
3877

3878
		if (!nth_packed_object_oid(&oid, p, i))
3879 3880 3881
			return error("unable to get sha1 of object %u in %s",
				     i, p->pack_name);

3882
		r = cb(&oid, p, i, data);
3883 3884 3885 3886 3887 3888
		if (r)
			break;
	}
	return r;
}

3889
int for_each_packed_object(each_packed_object_fn cb, void *data, unsigned flags)
3890 3891 3892
{
	struct packed_git *p;
	int r = 0;
3893
	int pack_errors = 0;
3894 3895 3896

	prepare_packed_git();
	for (p = packed_git; p; p = p->next) {
3897 3898
		if ((flags & FOR_EACH_OBJECT_LOCAL_ONLY) && !p->pack_local)
			continue;
3899 3900 3901 3902
		if (open_pack_index(p)) {
			pack_errors = 1;
			continue;
		}
3903 3904 3905 3906
		r = for_each_object_in_pack(p, cb, data);
		if (r)
			break;
	}
3907
	return r ? r : pack_errors;
3908
}
3909 3910 3911 3912 3913 3914 3915 3916

static int check_stream_sha1(git_zstream *stream,
			     const char *hdr,
			     unsigned long size,
			     const char *path,
			     const unsigned char *expected_sha1)
{
	git_SHA_CTX c;
3917
	unsigned char real_sha1[GIT_MAX_RAWSZ];
3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950
	unsigned char buf[4096];
	unsigned long total_read;
	int status = Z_OK;

	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, stream->total_out);

	/*
	 * We already read some bytes into hdr, but the ones up to the NUL
	 * do not count against the object's content size.
	 */
	total_read = stream->total_out - strlen(hdr) - 1;

	/*
	 * This size comparison must be "<=" to read the final zlib packets;
	 * see the comment in unpack_sha1_rest for details.
	 */
	while (total_read <= size &&
	       (status == Z_OK || status == Z_BUF_ERROR)) {
		stream->next_out = buf;
		stream->avail_out = sizeof(buf);
		if (size - total_read < stream->avail_out)
			stream->avail_out = size - total_read;
		status = git_inflate(stream, Z_FINISH);
		git_SHA1_Update(&c, buf, stream->next_out - buf);
		total_read += stream->next_out - buf;
	}
	git_inflate_end(stream);

	if (status != Z_STREAM_END) {
		error("corrupt loose object '%s'", sha1_to_hex(expected_sha1));
		return -1;
	}
3951 3952 3953 3954 3955
	if (stream->avail_in) {
		error("garbage at end of loose object '%s'",
		      sha1_to_hex(expected_sha1));
		return -1;
	}
3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024

	git_SHA1_Final(real_sha1, &c);
	if (hashcmp(expected_sha1, real_sha1)) {
		error("sha1 mismatch for %s (expected %s)", path,
		      sha1_to_hex(expected_sha1));
		return -1;
	}

	return 0;
}

int read_loose_object(const char *path,
		      const unsigned char *expected_sha1,
		      enum object_type *type,
		      unsigned long *size,
		      void **contents)
{
	int ret = -1;
	void *map = NULL;
	unsigned long mapsize;
	git_zstream stream;
	char hdr[32];

	*contents = NULL;

	map = map_sha1_file_1(path, NULL, &mapsize);
	if (!map) {
		error_errno("unable to mmap %s", path);
		goto out;
	}

	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0) {
		error("unable to unpack header of %s", path);
		goto out;
	}

	*type = parse_sha1_header(hdr, size);
	if (*type < 0) {
		error("unable to parse header of %s", path);
		git_inflate_end(&stream);
		goto out;
	}

	if (*type == OBJ_BLOB) {
		if (check_stream_sha1(&stream, hdr, *size, path, expected_sha1) < 0)
			goto out;
	} else {
		*contents = unpack_sha1_rest(&stream, hdr, *size, expected_sha1);
		if (!*contents) {
			error("unable to unpack contents of %s", path);
			git_inflate_end(&stream);
			goto out;
		}
		if (check_sha1_signature(expected_sha1, *contents,
					 *size, typename(*type))) {
			error("sha1 mismatch for %s (expected %s)", path,
			      sha1_to_hex(expected_sha1));
			free(*contents);
			goto out;
		}
	}

	ret = 0; /* everything checks out */

out:
	if (map)
		munmap(map, mapsize);
	return ret;
}