sha1_file.c 93.9 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 33 34 35 36 37 38
#ifndef O_NOATIME
#if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
#define O_NOATIME 01000000
#else
#define O_NOATIME 0
#endif
#endif

39 40
#define SZ_FMT PRIuMAX
static inline uintmax_t sz_fmt(size_t s) { return s; }
41

42
const unsigned char null_sha1[20];
43
const struct object_id null_oid;
44 45 46 47 48 49
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 已提交
50

51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
/*
 * 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 = {
66
	EMPTY_TREE_SHA1_BIN_LITERAL,
67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
	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;
}

86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
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);
}

115
enum scld_error safe_create_leading_directories(char *path)
116
{
117
	char *next_component = path + offset_1st_component(path);
118
	enum scld_error ret = SCLD_OK;
119

120
	while (ret == SCLD_OK && next_component) {
121
		struct stat st;
122
		char *slash = next_component, slash_character;
123

124 125 126 127
		while (*slash && !is_dir_sep(*slash))
			slash++;

		if (!*slash)
128
			break;
129

130
		next_component = slash + 1;
131
		while (is_dir_sep(*next_component))
132
			next_component++;
133
		if (!*next_component)
134
			break;
135

136
		slash_character = *slash;
137
		*slash = '\0';
138 139
		if (!stat(path, &st)) {
			/* path exists */
140
			if (!S_ISDIR(st.st_mode))
141
				ret = SCLD_EXISTS;
142
		} else if (mkdir(path, 0777)) {
143
			if (errno == EEXIST &&
144
			    !stat(path, &st) && S_ISDIR(st.st_mode))
145
				; /* somebody created it since we checked */
146 147 148 149 150 151 152 153 154 155 156
			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;
157
			else
158
				ret = SCLD_FAILED;
159
		} else if (adjust_shared_perm(path)) {
160
			ret = SCLD_PERMS;
161
		}
162
		*slash = slash_character;
163
	}
164
	return ret;
165
}
166

167
enum scld_error safe_create_leading_directories_const(const char *path)
168 169 170
{
	/* path points to cache entries, so xstrdup before messing with it */
	char *buf = xstrdup(path);
171
	enum scld_error result = safe_create_leading_directories(buf);
172 173 174 175
	free(buf);
	return result;
}

J
Jeff King 已提交
176
static void fill_sha1_path(struct strbuf *buf, const unsigned char *sha1)
177 178 179 180 181
{
	int i;
	for (i = 0; i < 20; i++) {
		static char hex[] = "0123456789abcdef";
		unsigned int val = sha1[i];
J
Jeff King 已提交
182 183
		strbuf_addch(buf, hex[val >> 4]);
		strbuf_addch(buf, hex[val & 0xf]);
184
		if (!i)
J
Jeff King 已提交
185
			strbuf_addch(buf, '/');
186 187 188
	}
}

189
const char *sha1_file_name(const unsigned char *sha1)
190
{
J
Jeff King 已提交
191
	static struct strbuf buf = STRBUF_INIT;
192

J
Jeff King 已提交
193 194
	strbuf_reset(&buf);
	strbuf_addf(&buf, "%s/", get_object_directory());
195

J
Jeff King 已提交
196 197
	fill_sha1_path(&buf, sha1);
	return buf.buf;
198 199
}

200 201 202 203 204 205
struct strbuf *alt_scratch_buf(struct alternate_object_database *alt)
{
	strbuf_setlen(&alt->scratch, alt->base_len);
	return &alt->scratch;
}

206 207 208
static const char *alt_sha1_path(struct alternate_object_database *alt,
				 const unsigned char *sha1)
{
209
	struct strbuf *buf = alt_scratch_buf(alt);
J
Jeff King 已提交
210
	fill_sha1_path(buf, sha1);
211
	return buf->buf;
212 213
}

214 215 216 217 218
/*
 * Return the name of the pack or index file with the specified sha1
 * in its filename.  *base and *name are scratch space that must be
 * provided by the caller.  which should be "pack" or "idx".
 */
219
static char *sha1_get_pack_name(const unsigned char *sha1,
J
Jeff King 已提交
220 221
				struct strbuf *buf,
				const char *which)
222
{
J
Jeff King 已提交
223 224 225 226
	strbuf_reset(buf);
	strbuf_addf(buf, "%s/pack/pack-%s.%s", get_object_directory(),
		    sha1_to_hex(sha1), which);
	return buf->buf;
227 228
}

229
char *sha1_pack_name(const unsigned char *sha1)
230
{
J
Jeff King 已提交
231 232
	static struct strbuf buf = STRBUF_INIT;
	return sha1_get_pack_name(sha1, &buf, "pack");
233
}
234

235 236
char *sha1_pack_index_name(const unsigned char *sha1)
{
J
Jeff King 已提交
237 238
	static struct strbuf buf = STRBUF_INIT;
	return sha1_get_pack_name(sha1, &buf, "idx");
239 240
}

241 242
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
243

244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
/*
 * 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) {
264
		if (!fspathcmp(path->buf, alt->path))
265 266 267 268 269 270 271 272
			return 0;
	}
	if (!fspathcmp(path->buf, normalized_objdir))
		return 0;

	return 1;
}

J
Junio C Hamano 已提交
273 274
/*
 * Prepare alternate object database registry.
275 276 277 278 279
 *
 * 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,
280 281
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
282 283 284 285 286
 * 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 已提交
287
 */
288 289
static int link_alt_odb_entry(const char *entry, const char *relative_base,
	int depth, const char *normalized_objdir)
290
{
M
Martin Waitz 已提交
291
	struct alternate_object_database *ent;
292
	struct strbuf pathbuf = STRBUF_INIT;
293

294
	if (!is_absolute_path(entry) && relative_base) {
295 296
		strbuf_addstr(&pathbuf, real_path(relative_base));
		strbuf_addch(&pathbuf, '/');
M
Martin Waitz 已提交
297
	}
298
	strbuf_addstr(&pathbuf, entry);
M
Martin Waitz 已提交
299

300
	if (strbuf_normalize_path(&pathbuf) < 0 && relative_base) {
301 302 303 304 305
		error("unable to normalize alternate object path: %s",
		      pathbuf.buf);
		strbuf_release(&pathbuf);
		return -1;
	}
306 307 308 309 310

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

314 315
	if (!alt_odb_usable(&pathbuf, normalized_objdir)) {
		strbuf_release(&pathbuf);
M
Martin Waitz 已提交
316 317 318
		return -1;
	}

319
	ent = alloc_alt_odb(pathbuf.buf);
M
Martin Waitz 已提交
320 321 322 323 324 325 326

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

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

329
	strbuf_release(&pathbuf);
M
Martin Waitz 已提交
330 331 332
	return 0;
}

J
Jeff King 已提交
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
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;
}

362
static void link_alt_odb_entries(const char *alt, int len, int sep,
M
Martin Waitz 已提交
363 364
				 const char *relative_base, int depth)
{
365
	struct strbuf objdirbuf = STRBUF_INIT;
J
Jeff King 已提交
366
	struct strbuf entry = STRBUF_INIT;
M
Martin Waitz 已提交
367 368 369 370 371 372 373

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

J
Junio C Hamano 已提交
374
	strbuf_add_absolute_path(&objdirbuf, get_object_directory());
375 376 377
	if (strbuf_normalize_path(&objdirbuf) < 0)
		die("unable to normalize object directory: %s",
		    objdirbuf.buf);
378

J
Jeff King 已提交
379 380 381
	while (*alt) {
		alt = parse_alt_odb_entry(alt, sep, &entry);
		if (!entry.len)
382
			continue;
J
Jeff King 已提交
383
		link_alt_odb_entry(entry.buf, relative_base, depth, objdirbuf.buf);
384
	}
J
Jeff King 已提交
385
	strbuf_release(&entry);
386
	strbuf_release(&objdirbuf);
387 388
}

389
void read_info_alternates(const char * relative_base, int depth)
390
{
391
	char *map;
392
	size_t mapsz;
393
	struct stat st;
394
	char *path;
M
Martin Waitz 已提交
395
	int fd;
396

397
	path = xstrfmt("%s/info/alternates", relative_base);
398
	fd = git_open(path);
399
	free(path);
400 401 402 403
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
404
		return;
405
	}
406 407
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
408 409
	close(fd);

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

412
	munmap(map, mapsz);
413 414
}

415 416 417 418
struct alternate_object_database *alloc_alt_odb(const char *dir)
{
	struct alternate_object_database *ent;

419
	FLEX_ALLOC_STR(ent, path, dir);
420 421 422
	strbuf_init(&ent->scratch, 0);
	strbuf_addf(&ent->scratch, "%s/", dir);
	ent->base_len = ent->scratch.len;
423 424 425 426

	return ent;
}

427 428 429
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
430 431 432 433 434 435 436 437 438 439 440 441 442
	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;

443
		while (strbuf_getline(&line, in) != EOF) {
444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469
			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);
470 471
}

472 473 474 475 476 477 478 479 480 481 482
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);
}

483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 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 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
/*
 * 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) {
		free(ref_git);
		ref_git = NULL;
	}

	return ref_git;
}

559
int foreach_alt_odb(alt_odb_fn fn, void *cb)
560 561
{
	struct alternate_object_database *ent;
562
	int r = 0;
563 564

	prepare_alt_odb();
565 566 567 568 569 570
	for (ent = alt_odb_list; ent; ent = ent->next) {
		r = fn(ent, cb);
		if (r)
			break;
	}
	return r;
571 572
}

M
Martin Waitz 已提交
573 574
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
575
	const char *alt;
M
Martin Waitz 已提交
576

S
Shawn O. Pearce 已提交
577 578 579
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
580 581 582 583
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
584
	link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
585 586 587 588

	read_info_alternates(get_object_directory(), 0);
}

589
/* Returns 1 if we have successfully freshened the file, 0 otherwise. */
590
static int freshen_file(const char *fn)
591
{
592 593 594
	struct utimbuf t;
	t.actime = t.modtime = time(NULL);
	return !utime(fn, &t);
595
}
596

597 598 599 600 601 602 603
/*
 * 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).
 */
604 605 606 607
static int check_and_freshen_file(const char *fn, int freshen)
{
	if (access(fn, F_OK))
		return 0;
608
	if (freshen && !freshen_file(fn))
609 610 611 612 613 614 615 616 617 618
		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)
619 620
{
	struct alternate_object_database *alt;
621
	prepare_alt_odb();
622
	for (alt = alt_odb_list; alt; alt = alt->next) {
623 624
		const char *path = alt_sha1_path(alt, sha1);
		if (check_and_freshen_file(path, freshen))
625
			return 1;
626
	}
627
	return 0;
628 629
}

630 631 632 633 634 635 636 637 638 639 640
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);
}

641 642
static int has_loose_object(const unsigned char *sha1)
{
643
	return check_and_freshen(sha1, 0);
644 645
}

646
static unsigned int pack_used_ctr;
647 648 649
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
650 651
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
652
static size_t peak_pack_mapped;
653
static size_t pack_mapped;
654
struct packed_git *packed_git;
655

656 657 658
static struct mru packed_git_mru_storage;
struct mru *packed_git_mru = &packed_git_mru_storage;

J
Junio C Hamano 已提交
659
void pack_report(void)
660 661
{
	fprintf(stderr,
662 663 664
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
665 666 667
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
668 669 670 671
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
672 673
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
674 675 676
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
677
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
678 679
}

680 681 682 683 684 685
/*
 * 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)
686 687
{
	void *idx_map;
688
	struct pack_idx_header *hdr;
689
	size_t idx_size;
690
	uint32_t version, nr, i, *index;
691
	int fd = git_open(path);
692
	struct stat st;
693

694 695 696 697 698 699
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
700
	idx_size = xsize_t(st.st_size);
701 702 703 704
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
705
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
706 707
	close(fd);

708 709
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
710 711 712
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
713
			return error("index file %s is version %"PRIu32
714 715 716 717 718 719
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
720

721
	nr = 0;
722
	index = idx_map;
723 724
	if (version > 1)
		index += 2;  /* skip index header */
725
	for (i = 0; i < 256; i++) {
726
		uint32_t n = ntohl(index[i]);
727 728
		if (n < nr) {
			munmap(idx_map, idx_size);
729
			return error("non-monotonic index %s", path);
730
		}
731 732 733
		nr = n;
	}

734 735 736 737 738 739 740 741 742 743
	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);
744
			return error("wrong index v1 file size in %s", path);
745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760
		}
	} 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 已提交
761 762 763 764
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
765
			munmap(idx_map, idx_size);
766
			return error("wrong index v2 file size in %s", path);
767
		}
768 769 770 771 772 773 774 775 776
		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);
777
		}
778
	}
779

780
	p->index_version = version;
781 782
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
783
	p->num_objects = nr;
784 785 786
	return 0;
}

787
int open_pack_index(struct packed_git *p)
788 789
{
	char *idx_name;
790
	size_t len;
791 792 793 794 795
	int ret;

	if (p->index_data)
		return 0;

796 797 798
	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);
799 800 801 802 803
	ret = check_packed_git_idx(idx_name, p);
	free(idx_name);
	return ret;
}

804 805 806 807
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
808
{
809 810 811 812 813 814 815 816
	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;
817 818
			}
		}
819
		w_l = w;
820
	}
821 822
}

823
static int unuse_one_window(struct packed_git *current)
824 825 826 827 828 829 830 831
{
	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);
832 833 834 835 836
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
837
		else
838 839
			lru_p->windows = lru_w->next;
		free(lru_w);
840
		pack_open_windows--;
841 842 843
		return 1;
	}
	return 0;
844 845
}

846
void release_pack_memory(size_t need)
847 848
{
	size_t cur = pack_mapped;
849
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
850 851 852
		; /* nothing */
}

853 854 855 856 857 858 859 860 861 862 863 864 865
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 已提交
866 867
void *xmmap_gently(void *start, size_t length,
		  int prot, int flags, int fd, off_t offset)
868
{
869 870 871 872
	void *ret;

	mmap_limit_check(length);
	ret = mmap(start, length, prot, flags, fd, offset);
873 874 875
	if (ret == MAP_FAILED) {
		if (!length)
			return NULL;
876
		release_pack_memory(length);
877 878 879 880 881
		ret = mmap(start, length, prot, flags, fd, offset);
	}
	return ret;
}

J
Jeff King 已提交
882 883 884 885 886
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 已提交
887
		die_errno("mmap failed");
J
Jeff King 已提交
888 889 890
	return ret;
}

891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906
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);
	}
}

907 908 909 910 911 912 913 914 915 916 917 918
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;
}

919 920 921 922 923 924 925 926 927 928 929 930 931
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)
932
			die("BUG: want to close pack marked 'do-not-close'");
933 934 935 936 937
		else
			close_pack(p);
}


938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004
/*
 * 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);
	}

1005 1006
	if (lru_p)
		return close_pack_fd(lru_p);
1007 1008 1009 1010

	return 0;
}

1011
void unuse_pack(struct pack_window **w_cursor)
1012
{
1013 1014 1015 1016 1017
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
1018 1019
}

1020 1021 1022 1023 1024 1025 1026 1027
void close_pack_index(struct packed_git *p)
{
	if (p->index_data) {
		munmap((void *)p->index_data, p->index_size);
		p->index_data = NULL;
	}
}

1028 1029 1030
static unsigned int get_max_fd_limit(void)
{
#ifdef RLIMIT_NOFILE
1031 1032
	{
		struct rlimit lim;
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
		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
1061

1062
#ifdef OPEN_MAX
1063 1064 1065 1066 1067 1068
	return OPEN_MAX;
#else
	return 1; /* see the caller ;-) */
#endif
}

1069 1070 1071 1072 1073
/*
 * 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)
1074
{
1075 1076 1077 1078
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
1079
	long fd_flag;
1080

1081 1082 1083
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

1084
	if (!pack_max_fds) {
1085
		unsigned int max_fds = get_max_fd_limit();
1086 1087 1088 1089 1090 1091 1092 1093

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

1094
	while (pack_max_fds <= pack_open_fds && close_one_pack())
1095 1096
		; /* nothing */

1097
	p->pack_fd = git_open(p->pack_name);
1098
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
1099
		return -1;
1100
	pack_open_fds++;
1101 1102

	/* If we created the struct before we had the pack we lack size. */
1103 1104
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
1105
			return error("packfile %s not a regular file", p->pack_name);
1106
		p->pack_size = st.st_size;
1107
	} else if (p->pack_size != st.st_size)
1108
		return error("packfile %s size changed", p->pack_name);
1109

1110 1111 1112 1113 1114
	/* 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)
1115
		return error("cannot determine file descriptor flags");
1116 1117
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
1118
		return error("cannot set FD_CLOEXEC");
1119

1120
	/* Verify we recognize this pack file format. */
1121
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
1122
		return error("file %s is far too short to be a packfile", p->pack_name);
1123
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
1124
		return error("file %s is not a GIT packfile", p->pack_name);
1125
	if (!pack_version_ok(hdr.hdr_version))
1126 1127
		return error("packfile %s is version %"PRIu32" and not"
			" supported (try upgrading GIT to a newer version)",
1128 1129 1130
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
1131
	if (p->num_objects != ntohl(hdr.hdr_entries))
1132 1133
		return error("packfile %s claims to have %"PRIu32" objects"
			     " while index indicates %"PRIu32" objects",
N
Nicolas Pitre 已提交
1134 1135
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
1136
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
1137
		return error("end of packfile %s is unavailable", p->pack_name);
1138
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
1139
		return error("packfile %s signature is unavailable", p->pack_name);
1140
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
1141
	if (hashcmp(sha1, idx_sha1))
1142 1143
		return error("packfile %s does not match index", p->pack_name);
	return 0;
1144 1145
}

1146 1147 1148 1149
static int open_packed_git(struct packed_git *p)
{
	if (!open_packed_git_1(p))
		return 0;
1150
	close_pack_fd(p);
1151 1152 1153
	return -1;
}

1154
static int in_window(struct pack_window *win, off_t offset)
1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166
{
	/* 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);
}

1167
unsigned char *use_pack(struct packed_git *p,
1168
		struct pack_window **w_cursor,
1169
		off_t offset,
1170
		unsigned long *left)
1171
{
1172
	struct pack_window *win = *w_cursor;
1173

F
Felipe Contreras 已提交
1174
	/* Since packfiles end in a hash of their content and it's
1175 1176 1177 1178
	 * 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.
	 */
1179 1180
	if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
1181 1182
	if (offset > (p->pack_size - 20))
		die("offset beyond end of packfile (truncated pack?)");
1183
	if (offset < 0)
1184
		die(_("offset before end of packfile (broken .idx?)"));
1185 1186 1187 1188 1189 1190 1191 1192 1193

	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) {
1194
			size_t window_align = packed_git_window_size / 2;
1195
			off_t len;
1196 1197 1198 1199

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

1200
			win = xcalloc(1, sizeof(*win));
1201
			win->offset = (offset / window_align) * window_align;
1202 1203 1204 1205
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
1206
			pack_mapped += win->len;
1207
			while (packed_git_limit < pack_mapped
1208
				&& unuse_one_window(p))
1209
				; /* nothing */
1210
			win->base = xmmap(NULL, win->len,
1211 1212 1213
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
1214 1215
				die_errno("packfile %s cannot be mapped",
					  p->pack_name);
1216
			if (!win->offset && win->len == p->pack_size
1217 1218
				&& !p->do_not_close)
				close_pack_fd(p);
1219 1220 1221 1222 1223 1224
			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;
1225 1226 1227
			win->next = p->windows;
			p->windows = win;
		}
1228
	}
1229 1230 1231 1232 1233
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
1234
	offset -= win->offset;
1235
	if (left)
1236
		*left = win->len - xsize_t(offset);
1237
	return win->base + offset;
1238 1239
}

1240 1241
static struct packed_git *alloc_packed_git(int extra)
{
1242
	struct packed_git *p = xmalloc(st_add(sizeof(*p), extra));
1243 1244 1245 1246 1247
	memset(p, 0, sizeof(*p));
	p->pack_fd = -1;
	return p;
}

1248 1249
static void try_to_free_pack_memory(size_t size)
{
1250
	release_pack_memory(size);
1251 1252
}

1253
struct packed_git *add_packed_git(const char *path, size_t path_len, int local)
1254
{
1255
	static int have_set_try_to_free_routine;
1256
	struct stat st;
1257 1258
	size_t alloc;
	struct packed_git *p;
1259

1260 1261 1262 1263 1264
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

1265 1266 1267 1268
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
1269
	if (!strip_suffix_mem(path, &path_len, ".idx"))
1270
		return NULL;
1271 1272 1273 1274 1275

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

1280
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".keep");
1281 1282 1283
	if (!access(p->pack_name, F_OK))
		p->pack_keep = 1;

1284
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".pack");
1285
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1286
		free(p);
1287 1288
		return NULL;
	}
1289

1290 1291 1292 1293
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
1294
	p->pack_local = local;
1295
	p->mtime = st.st_mtime;
1296 1297
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
1298 1299 1300
	return p;
}

1301
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1302
{
1303
	const char *path = sha1_pack_name(sha1);
1304
	size_t alloc = st_add(strlen(path), 1);
1305
	struct packed_git *p = alloc_packed_git(alloc);
1306

1307
	memcpy(p->pack_name, path, alloc); /* includes NUL */
1308
	hashcpy(p->sha1, sha1);
1309 1310
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
1311
		return NULL;
1312
	}
1313 1314 1315 1316 1317 1318

	return p;
}

void install_packed_git(struct packed_git *pack)
{
1319 1320 1321
	if (pack->pack_fd != -1)
		pack_open_fds++;

1322 1323 1324 1325
	pack->next = packed_git;
	packed_git = pack;
}

1326
void (*report_garbage)(unsigned seen_bits, const char *path);
1327 1328 1329 1330

static void report_helper(const struct string_list *list,
			  int seen_bits, int first, int last)
{
1331
	if (seen_bits == (PACKDIR_FILE_PACK|PACKDIR_FILE_IDX))
1332
		return;
1333

1334
	for (; first < last; first++)
1335
		report_garbage(seen_bits, list->items[first].string);
1336 1337 1338 1339 1340 1341 1342 1343 1344
}

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

	if (!report_garbage)
		return;

1345
	string_list_sort(list);
1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357

	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) {
1358
				report_garbage(PACKDIR_FILE_GARBAGE, path);
1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371
				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);
}

1372
static void prepare_packed_git_one(char *objdir, int local)
1373
{
1374 1375
	struct strbuf path = STRBUF_INIT;
	size_t dirnamelen;
1376 1377
	DIR *dir;
	struct dirent *de;
1378
	struct string_list garbage = STRING_LIST_INIT_DUP;
1379

1380 1381 1382
	strbuf_addstr(&path, objdir);
	strbuf_addstr(&path, "/pack");
	dir = opendir(path.buf);
1383
	if (!dir) {
J
Junio C Hamano 已提交
1384
		if (errno != ENOENT)
1385 1386
			error_errno("unable to open object pack directory: %s",
				    path.buf);
1387
		strbuf_release(&path);
1388
		return;
1389
	}
1390 1391
	strbuf_addch(&path, '/');
	dirnamelen = path.len;
1392 1393
	while ((de = readdir(dir)) != NULL) {
		struct packed_git *p;
1394
		size_t base_len;
1395 1396

		if (is_dot_or_dotdot(de->d_name))
1397 1398
			continue;

1399 1400
		strbuf_setlen(&path, dirnamelen);
		strbuf_addstr(&path, de->d_name);
1401

1402 1403
		base_len = path.len;
		if (strip_suffix_mem(path.buf, &base_len, ".idx")) {
1404 1405
			/* Don't reopen a pack we already have. */
			for (p = packed_git; p; p = p->next) {
1406 1407 1408 1409
				size_t len;
				if (strip_suffix(p->pack_name, ".pack", &len) &&
				    len == base_len &&
				    !memcmp(p->pack_name, path.buf, len))
1410 1411 1412 1413 1414 1415 1416
					break;
			}
			if (p == NULL &&
			    /*
			     * See if it really is a valid .idx file with
			     * corresponding .pack file that we can map.
			     */
1417
			    (p = add_packed_git(path.buf, path.len, local)) != NULL)
1418
				install_packed_git(p);
1419
		}
1420 1421 1422 1423

		if (!report_garbage)
			continue;

J
Jeff King 已提交
1424 1425 1426 1427
		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"))
1428
			string_list_append(&garbage, path.buf);
1429
		else
1430
			report_garbage(PACKDIR_FILE_GARBAGE, path.buf);
1431
	}
1432
	closedir(dir);
1433 1434
	report_pack_garbage(&garbage);
	string_list_clear(&garbage, 0);
1435
	strbuf_release(&path);
1436 1437
}

1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463
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;
}

1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
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;
}

1474 1475
static int sort_pack(const void *a_, const void *b_)
{
1476 1477
	const struct packed_git *a = a_;
	const struct packed_git *b = b_;
1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503
	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)
{
1504 1505
	packed_git = llist_mergesort(packed_git, get_next_packed_git,
				     set_next_packed_git, sort_pack);
1506 1507
}

1508 1509 1510 1511 1512 1513 1514 1515 1516
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);
}

1517
static int prepare_packed_git_run_once = 0;
1518
void prepare_packed_git(void)
1519
{
1520
	struct alternate_object_database *alt;
1521

1522
	if (prepare_packed_git_run_once)
1523
		return;
1524
	prepare_packed_git_one(get_object_directory(), 1);
1525
	prepare_alt_odb();
1526 1527
	for (alt = alt_odb_list; alt; alt = alt->next)
		prepare_packed_git_one(alt->path, 0);
1528
	rearrange_packed_git();
1529
	prepare_packed_git_mru();
1530 1531 1532
	prepare_packed_git_run_once = 1;
}

1533
void reprepare_packed_git(void)
1534
{
1535
	approximate_object_count_valid = 0;
1536 1537
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1538 1539
}

1540 1541 1542 1543 1544
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++)
1545
		if (!hashcmp(sha1, p->bad_object_sha1 + GIT_SHA1_RAWSZ * i))
1546
			return;
1547 1548 1549 1550
	p->bad_object_sha1 = xrealloc(p->bad_object_sha1,
				      st_mult(GIT_SHA1_RAWSZ,
					      st_add(p->num_bad_objects, 1)));
	hashcpy(p->bad_object_sha1 + GIT_SHA1_RAWSZ * p->num_bad_objects, sha1);
1551 1552 1553
	p->num_bad_objects++;
}

1554
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1555 1556 1557 1558 1559 1560 1561
{
	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))
1562 1563
				return p;
	return NULL;
1564 1565
}

1566 1567 1568 1569 1570 1571 1572 1573
/*
 * 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)
1574 1575
{
	unsigned char real_sha1[20];
1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591
	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 */
1592
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(obj_type), size) + 1;
1593 1594 1595 1596 1597 1598 1599 1600

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

1601 1602 1603 1604
		if (readlen < 0) {
			close_istream(st);
			return -1;
		}
1605 1606 1607 1608 1609 1610
		if (!readlen)
			break;
		git_SHA1_Update(&c, buf, readlen);
	}
	git_SHA1_Final(real_sha1, &c);
	close_istream(st);
1611
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1612 1613
}

1614
int git_open(const char *name)
1615
{
1616
	static int sha1_file_open_flag = O_NOATIME | O_CLOEXEC;
1617

1618
	for (;;) {
1619 1620 1621 1622
		int fd;

		errno = 0;
		fd = open(name, O_RDONLY | sha1_file_open_flag);
1623
		if (fd >= 0)
1624 1625
			return fd;

1626 1627 1628
		/* Try again w/o O_CLOEXEC: the kernel might not support it */
		if ((sha1_file_open_flag & O_CLOEXEC) && errno == EINVAL) {
			sha1_file_open_flag &= ~O_CLOEXEC;
1629 1630 1631
			continue;
		}

1632 1633 1634 1635 1636
		/* Might the failure be due to O_NOATIME? */
		if (errno != ENOENT && (sha1_file_open_flag & O_NOATIME)) {
			sha1_file_open_flag &= ~O_NOATIME;
			continue;
		}
1637
		return -1;
1638 1639 1640
	}
}

1641 1642 1643 1644
static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
{
	struct alternate_object_database *alt;

1645
	if (!lstat(sha1_file_name(sha1), st))
1646 1647 1648 1649 1650
		return 0;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
1651 1652
		const char *path = alt_sha1_path(alt, sha1);
		if (!lstat(path, st))
1653 1654 1655 1656 1657 1658
			return 0;
	}

	return -1;
}

1659 1660 1661 1662
static int open_sha1_file(const unsigned char *sha1)
{
	int fd;
	struct alternate_object_database *alt;
1663
	int most_interesting_errno;
1664

1665
	fd = git_open(sha1_file_name(sha1));
1666 1667
	if (fd >= 0)
		return fd;
1668
	most_interesting_errno = errno;
1669 1670 1671

	prepare_alt_odb();
	for (alt = alt_odb_list; alt; alt = alt->next) {
1672
		const char *path = alt_sha1_path(alt, sha1);
1673
		fd = git_open(path);
1674 1675
		if (fd >= 0)
			return fd;
1676 1677
		if (most_interesting_errno == ENOENT)
			most_interesting_errno = errno;
1678
	}
1679
	errno = most_interesting_errno;
1680 1681 1682
	return -1;
}

1683
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1684 1685
{
	void *map;
1686
	int fd;
1687

1688 1689 1690 1691
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1692

1693 1694
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
1695 1696 1697 1698 1699
			if (!*size) {
				/* mmap() is forbidden on empty files */
				error("object file %s is empty", sha1_file_name(sha1));
				return NULL;
			}
1700
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1701
		}
1702
		close(fd);
1703 1704 1705 1706
	}
	return map;
}

1707 1708
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1709
{
1710
	unsigned shift;
1711
	unsigned long size, c;
1712 1713 1714 1715 1716 1717 1718
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1719
		if (len <= used || bitsizeof(long) <= shift) {
1720
			error("bad object header");
1721 1722
			size = used = 0;
			break;
1723
		}
1724 1725 1726 1727 1728 1729 1730 1731
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

1732 1733 1734
static int unpack_sha1_short_header(git_zstream *stream,
				    unsigned char *map, unsigned long mapsize,
				    void *buffer, unsigned long bufsiz)
1735
{
1736 1737 1738 1739 1740
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1741 1742
	stream->avail_out = bufsiz;

1743
	git_inflate_init(stream);
1744
	return git_inflate(stream, 0);
1745 1746
}

1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762
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;
}

1763 1764 1765 1766 1767 1768
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;

1769 1770 1771
	status = unpack_sha1_short_header(stream, map, mapsize, buffer, bufsiz);
	if (status < Z_OK)
		return -1;
1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798

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

1799
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1800 1801
{
	int bytes = strlen(buffer) + 1;
1802
	unsigned char *buf = xmallocz(size);
1803
	unsigned long n;
1804
	int status = Z_OK;
1805

1806 1807 1808 1809 1810
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1811 1812 1813 1814
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1815
		 * expect no more output and set avail_out to zero,
1816 1817 1818 1819 1820 1821 1822 1823 1824
		 * 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.
		 */
1825 1826
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1827
		while (status == Z_OK)
1828
			status = git_inflate(stream, Z_FINISH);
1829
	}
1830
	if (status == Z_STREAM_END && !stream->avail_in) {
1831
		git_inflate_end(stream);
1832 1833 1834 1835 1836 1837 1838 1839 1840 1841
		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;
1842 1843 1844 1845 1846 1847 1848
}

/*
 * 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.
 */
1849 1850
static int parse_sha1_header_extended(const char *hdr, struct object_info *oi,
			       unsigned int flags)
1851
{
1852
	const char *type_buf = hdr;
1853
	unsigned long size;
1854
	int type, type_len = 0;
1855 1856

	/*
1857
	 * The type can be of any size but is followed by
1858
	 * a space.
1859 1860 1861
	 */
	for (;;) {
		char c = *hdr++;
1862 1863
		if (!c)
			return -1;
1864 1865
		if (c == ' ')
			break;
1866
		type_len++;
1867
	}
1868 1869 1870 1871 1872 1873

	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ä 已提交
1874
	 * we're obtaining the type using '--allow-unknown-type'
1875 1876 1877 1878 1879 1880 1881 1882
	 * option.
	 */
	if ((flags & LOOKUP_UNKNOWN_OBJECT) && (type < 0))
		type = 0;
	else if (type < 0)
		die("invalid object type");
	if (oi->typep)
		*oi->typep = type;
1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899

	/*
	 * 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;
		}
	}
1900 1901 1902

	if (oi->sizep)
		*oi->sizep = size;
1903 1904 1905 1906

	/*
	 * The length must be followed by a zero byte
	 */
1907 1908 1909 1910 1911
	return *hdr ? -1 : type;
}

int parse_sha1_header(const char *hdr, unsigned long *sizep)
{
1912
	struct object_info oi = OBJECT_INFO_INIT;
1913 1914 1915

	oi.sizep = sizep;
	return parse_sha1_header_extended(hdr, &oi, LOOKUP_REPLACE_OBJECT);
1916 1917
}

1918
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1919
{
1920
	int ret;
1921
	git_zstream stream;
1922
	char hdr[8192];
1923

1924
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1925
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1926 1927
		return NULL;

1928
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1929 1930
}

N
Nicolas Pitre 已提交
1931 1932 1933 1934 1935 1936
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;
1937
	git_zstream stream;
N
Nicolas Pitre 已提交
1938 1939 1940 1941 1942 1943
	int st;

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

1944
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
1945 1946 1947
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
1948
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
1949 1950 1951
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
1952
	git_inflate_end(&stream);
1953 1954 1955 1956
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969

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

1970
static off_t get_delta_base(struct packed_git *p,
1971
				    struct pack_window **w_curs,
1972
				    off_t *curpos,
1973
				    enum object_type type,
1974
				    off_t delta_obj_offset)
1975
{
1976
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1977
	off_t base_offset;
1978

1979 1980 1981 1982 1983 1984
	/* 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.
	 */
1985
	if (type == OBJ_OFS_DELTA) {
1986 1987 1988 1989 1990
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1991
			if (!base_offset || MSB(base_offset, 7))
1992
				return 0;  /* overflow */
1993 1994 1995 1996
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
1997
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
1998
			return 0;  /* out of bound */
1999
		*curpos += used;
2000
	} else if (type == OBJ_REF_DELTA) {
2001 2002
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
2003
		*curpos += 20;
2004 2005
	} else
		die("I am totally screwed");
2006
	return base_offset;
2007 2008
}

2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040
/*
 * 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;
}

2041 2042 2043 2044
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
2045
{
2046
	unsigned char *base;
2047
	unsigned long left;
2048
	unsigned long used;
2049
	enum object_type type;
2050

2051
	/* use_pack() assures us we have [base, base + 20) available
2052
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
2053
	 * size that is assured.)  With our object header encoding
2054 2055 2056
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
2057
	base = use_pack(p, w_curs, *curpos, &left);
2058 2059 2060 2061 2062
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
2063

2064
	return type;
2065 2066
}

2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084
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

2085 2086 2087 2088 2089
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)
2090
{
2091 2092 2093
	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;
2094

2095 2096
	while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
		off_t base_offset;
2097
		unsigned long size;
2098 2099 2100
		/* 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 已提交
2101
			ALLOC_ARRAY(poi_stack, poi_stack_alloc);
2102 2103 2104 2105 2106 2107
			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 */
2108
		base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
2109 2110 2111
		if (!base_offset)
			goto unwind;
		curpos = obj_offset = base_offset;
2112
		type = unpack_object_header(p, w_curs, &curpos, &size);
2113 2114 2115 2116 2117 2118 2119 2120 2121 2122
		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;
		}
	}

2123
	switch (type) {
2124
	case OBJ_BAD:
2125 2126 2127 2128
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2129
		break;
2130
	default:
2131 2132 2133
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
2134
	}
2135 2136 2137 2138

out:
	if (poi_stack != small_poi_stack)
		free(poi_stack);
2139
	return type;
2140 2141 2142 2143 2144 2145 2146 2147 2148 2149

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

2152 2153
int packed_object_info(struct packed_git *p, off_t obj_offset,
		       struct object_info *oi)
2154 2155 2156 2157 2158 2159
{
	struct pack_window *w_curs = NULL;
	unsigned long size;
	off_t curpos = obj_offset;
	enum object_type type;

2160 2161 2162 2163
	/*
	 * We always get the representation type, but only convert it to
	 * a "real" type later if the caller is interested.
	 */
2164 2165
	type = unpack_object_header(p, &w_curs, &curpos, &size);

2166
	if (oi->sizep) {
2167 2168 2169 2170 2171 2172 2173 2174
		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;
			}
2175 2176
			*oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
			if (*oi->sizep == 0) {
2177 2178 2179 2180
				type = OBJ_BAD;
				goto out;
			}
		} else {
2181
			*oi->sizep = size;
2182 2183 2184
		}
	}

2185
	if (oi->disk_sizep) {
2186
		struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2187
		*oi->disk_sizep = revidx[1].offset - obj_offset;
2188 2189
	}

2190 2191 2192
	if (oi->typep) {
		*oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
		if (*oi->typep < 0) {
2193 2194 2195 2196
			type = OBJ_BAD;
			goto out;
		}
	}
2197

2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213
	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);
	}

2214 2215 2216 2217 2218
out:
	unuse_pack(&w_curs);
	return type;
}

2219
static void *unpack_compressed_entry(struct packed_git *p,
2220
				    struct pack_window **w_curs,
2221
				    off_t curpos,
2222
				    unsigned long size)
2223 2224
{
	int st;
2225
	git_zstream stream;
2226
	unsigned char *buffer, *in;
2227

2228 2229 2230
	buffer = xmallocz_gently(size);
	if (!buffer)
		return NULL;
2231 2232
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
2233
	stream.avail_out = size + 1;
2234

2235
	git_inflate_init(&stream);
2236
	do {
2237
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
2238
		stream.next_in = in;
2239
		st = git_inflate(&stream, Z_FINISH);
2240 2241
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
2242
		curpos += stream.next_in - in;
2243
	} while (st == Z_OK || st == Z_BUF_ERROR);
2244
	git_inflate_end(&stream);
2245 2246 2247 2248 2249 2250 2251 2252
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

J
Jeff King 已提交
2253
static struct hashmap delta_base_cache;
2254
static size_t delta_base_cached;
2255

J
Jeff King 已提交
2256
static LIST_HEAD(delta_base_cache_lru);
2257

J
Jeff King 已提交
2258
struct delta_base_cache_key {
2259 2260
	struct packed_git *p;
	off_t base_offset;
J
Jeff King 已提交
2261 2262 2263 2264 2265 2266 2267
};

struct delta_base_cache_entry {
	struct hashmap hash;
	struct delta_base_cache_key key;
	struct list_head lru;
	void *data;
2268 2269
	unsigned long size;
	enum object_type type;
J
Jeff King 已提交
2270
};
2271

J
Jeff King 已提交
2272
static unsigned int pack_entry_hash(struct packed_git *p, off_t base_offset)
2273
{
J
Jeff King 已提交
2274
	unsigned int hash;
2275

J
Jeff King 已提交
2276
	hash = (unsigned int)(intptr_t)p + (unsigned int)base_offset;
2277
	hash += (hash >> 8) + (hash >> 16);
J
Jeff King 已提交
2278
	return hash;
2279 2280
}

2281 2282
static struct delta_base_cache_entry *
get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
2283
{
J
Jeff King 已提交
2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299
	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;
2300 2301
}

J
Jeff King 已提交
2302 2303
static int delta_base_cache_hash_cmp(const void *va, const void *vb,
				     const void *vkey)
2304
{
J
Jeff King 已提交
2305 2306 2307 2308 2309 2310
	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);
2311 2312
}

2313 2314
static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
{
J
Jeff King 已提交
2315
	return !!get_delta_base_cache_entry(p, base_offset);
2316 2317
}

2318 2319 2320 2321 2322 2323
/*
 * 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)
2324
{
J
Jeff King 已提交
2325
	hashmap_remove(&delta_base_cache, ent, &ent->key);
J
Jeff King 已提交
2326
	list_del(&ent->lru);
2327
	delta_base_cached -= ent->size;
J
Jeff King 已提交
2328
	free(ent);
2329 2330
}

2331
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2332
	unsigned long *base_size, enum object_type *type)
2333
{
2334
	struct delta_base_cache_entry *ent;
2335

2336
	ent = get_delta_base_cache_entry(p, base_offset);
J
Jeff King 已提交
2337
	if (!ent)
2338
		return unpack_entry(p, base_offset, type, base_size);
2339 2340 2341

	*type = ent->type;
	*base_size = ent->size;
2342
	return xmemdupz(ent->data, ent->size);
2343 2344
}

2345 2346
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
J
Jeff King 已提交
2347 2348
	free(ent->data);
	detach_delta_base_cache_entry(ent);
2349 2350
}

2351 2352
void clear_delta_base_cache(void)
{
J
Jeff King 已提交
2353 2354 2355 2356 2357 2358 2359
	struct hashmap_iter iter;
	struct delta_base_cache_entry *entry;
	for (entry = hashmap_iter_first(&delta_base_cache, &iter);
	     entry;
	     entry = hashmap_iter_next(&iter)) {
		release_delta_base_cache(entry);
	}
2360 2361
}

2362 2363 2364
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 已提交
2365
	struct delta_base_cache_entry *ent = xmalloc(sizeof(*ent));
2366
	struct list_head *lru, *tmp;
2367

2368
	delta_base_cached += base_size;
2369

2370
	list_for_each_safe(lru, tmp, &delta_base_cache_lru) {
J
Jeff King 已提交
2371 2372 2373 2374
		struct delta_base_cache_entry *f =
			list_entry(lru, struct delta_base_cache_entry, lru);
		if (delta_base_cached <= delta_base_cache_limit)
			break;
2375 2376
		release_delta_base_cache(f);
	}
2377

J
Jeff King 已提交
2378 2379
	ent->key.p = p;
	ent->key.base_offset = base_offset;
2380 2381 2382
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
J
Jeff King 已提交
2383
	list_add_tail(&ent->lru, &delta_base_cache_lru);
J
Jeff King 已提交
2384 2385 2386 2387 2388

	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);
2389 2390
}

2391 2392 2393
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

2394 2395
static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
{
2396 2397 2398
	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);
2399 2400
}

2401 2402
int do_check_packed_object_crc;

2403 2404 2405 2406 2407 2408 2409
#define UNPACK_ENTRY_STACK_PREALLOC 64
struct unpack_entry_stack_ent {
	off_t obj_offset;
	off_t curpos;
	unsigned long size;
};

2410
void *unpack_entry(struct packed_git *p, off_t obj_offset,
2411
		   enum object_type *final_type, unsigned long *final_size)
2412
{
2413
	struct pack_window *w_curs = NULL;
2414
	off_t curpos = obj_offset;
2415 2416 2417 2418 2419 2420 2421
	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;
2422

2423
	write_pack_access_log(p, obj_offset);
2424

2425 2426 2427 2428 2429 2430
	/* PHASE 1: drill down to the innermost base object */
	for (;;) {
		off_t base_offset;
		int i;
		struct delta_base_cache_entry *ent;

2431
		ent = get_delta_base_cache_entry(p, curpos);
J
Jeff King 已提交
2432
		if (ent) {
2433 2434 2435
			type = ent->type;
			data = ent->data;
			size = ent->size;
2436
			detach_delta_base_cache_entry(ent);
2437 2438 2439 2440
			base_from_cache = 1;
			break;
		}

2441 2442
		if (do_check_packed_object_crc && p->index_version > 1) {
			struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2443
			off_t len = revidx[1].offset - obj_offset;
2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472
			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 已提交
2473
			ALLOC_ARRAY(delta_stack, delta_stack_alloc);
2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484
			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;
2485 2486
	}

2487 2488
	/* PHASE 2: handle the base */
	switch (type) {
2489 2490
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
2491
		if (data)
2492
			die("BUG: unpack_entry: left loop at a valid delta");
2493
		break;
2494 2495 2496 2497
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2498 2499
		if (!base_from_cache)
			data = unpack_compressed_entry(p, &w_curs, curpos, size);
2500
		break;
2501
	default:
2502 2503
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 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 2561 2562 2563 2564
		      type, (uintmax_t)obj_offset, p->pack_name);
	}

	/* PHASE 3: apply deltas in order */

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

		data = NULL;

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

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

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

		if (!base)
			continue;

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

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

		data = patch_delta(base, base_size,
				   delta_data, delta_size,
				   &size);
2565 2566 2567 2568 2569 2570 2571 2572 2573

		/*
		 * 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.
		 */
2574
		if (!data)
2575
			error("failed to apply delta");
2576

2577
		free(delta_data);
2578
	}
2579 2580 2581 2582

	*final_type = type;
	*final_size = size;

2583
	unuse_pack(&w_curs);
2584 2585 2586 2587

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

2588
	return data;
2589 2590
}

2591
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2592
					    uint32_t n)
2593
{
2594
	const unsigned char *index = p->index_data;
2595 2596 2597 2598 2599
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
2600
	if (n >= p->num_objects)
2601
		return NULL;
2602 2603 2604 2605 2606 2607 2608 2609 2610
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

2611 2612 2613 2614 2615 2616
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)
2617
		die(_("offset before start of pack index for %s (corrupt index?)"),
2618 2619 2620
		    p->pack_name);
	/* No need to check for underflow; .idx files must be at least 8 bytes */
	if (ptr >= end - 8)
2621
		die(_("offset beyond end of pack index for %s (truncated index?)"),
2622 2623 2624
		    p->pack_name);
}

N
Nicolas Pitre 已提交
2625
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637
{
	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;
2638
		check_pack_index_ptr(p, index);
2639 2640 2641
		return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
				   ntohl(*((uint32_t *)(index + 4)));
	}
2642 2643
}

2644
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
2645
				  struct packed_git *p)
2646
{
2647 2648
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
2649 2650 2651 2652 2653 2654
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

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

2656 2657 2658 2659 2660 2661
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
2662 2663 2664 2665
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
2666
	index += 4 * 256;
2667 2668
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2669 2670 2671 2672 2673 2674 2675 2676
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
2677
		printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688
		       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);
	}
2689 2690

	do {
2691
		unsigned mi = (lo + hi) / 2;
2692 2693 2694 2695 2696
		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 已提交
2697
		if (!cmp)
2698
			return nth_packed_object_offset(p, mi);
2699 2700 2701 2702 2703 2704 2705 2706
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

2707
int is_pack_valid(struct packed_git *p)
2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727
{
	/* 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);
}

2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751
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!
	 */
2752
	if (!is_pack_valid(p))
2753 2754 2755 2756 2757 2758 2759
		return 0;
	e->offset = offset;
	e->p = p;
	hashcpy(e->sha1, sha1);
	return 1;
}

2760 2761 2762 2763
/*
 * Iff a pack file contains the object named by sha1, return true and
 * store its location to e.
 */
2764
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2765
{
2766
	struct mru_entry *p;
N
Nicolas Pitre 已提交
2767

2768
	prepare_packed_git();
2769 2770
	if (!packed_git)
		return 0;
2771

2772 2773 2774
	for (p = packed_git_mru->head; p; p = p->next) {
		if (fill_pack_entry(sha1, e, p->item)) {
			mru_mark(packed_git_mru, p);
2775 2776
			return 1;
		}
2777
	}
2778 2779 2780
	return 0;
}

J
Junio C Hamano 已提交
2781
struct packed_git *find_sha1_pack(const unsigned char *sha1,
2782 2783 2784 2785 2786
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
2787
		if (find_pack_entry_one(sha1, p))
2788 2789 2790
			return p;
	}
	return NULL;
2791

2792 2793
}

2794
static int sha1_loose_object_info(const unsigned char *sha1,
2795 2796
				  struct object_info *oi,
				  int flags)
2797
{
2798 2799
	int status = 0;
	unsigned long mapsize;
2800
	void *map;
2801
	git_zstream stream;
N
Nicolas Pitre 已提交
2802
	char hdr[32];
2803
	struct strbuf hdrbuf = STRBUF_INIT;
2804

2805 2806 2807
	if (oi->delta_base_sha1)
		hashclr(oi->delta_base_sha1);

2808 2809
	/*
	 * If we don't care about type or size, then we don't
2810 2811 2812 2813 2814
	 * 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.
2815
	 */
2816
	if (!oi->typep && !oi->typename && !oi->sizep) {
2817 2818 2819 2820
		struct stat st;
		if (stat_sha1_file(sha1, &st) < 0)
			return -1;
		if (oi->disk_sizep)
2821
			*oi->disk_sizep = st.st_size;
2822 2823 2824
		return 0;
	}

2825
	map = map_sha1_file(sha1, &mapsize);
2826
	if (!map)
2827
		return -1;
2828 2829
	if (oi->disk_sizep)
		*oi->disk_sizep = mapsize;
2830 2831 2832 2833 2834
	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)
2835 2836
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
2837 2838 2839 2840 2841 2842 2843
	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)
2844
		status = error("unable to parse %s header", sha1_to_hex(sha1));
2845
	git_inflate_end(&stream);
2846
	munmap(map, mapsize);
2847
	if (status && oi->typep)
2848
		*oi->typep = status;
2849
	strbuf_release(&hdrbuf);
2850
	return 0;
2851 2852
}

2853
int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi, unsigned flags)
2854
{
2855
	struct cached_object *co;
2856
	struct pack_entry e;
2857
	int rtype;
2858
	enum object_type real_type;
2859
	const unsigned char *real = lookup_replace_object_extended(sha1, flags);
2860

2861
	co = find_cached_object(real);
2862
	if (co) {
2863 2864
		if (oi->typep)
			*(oi->typep) = co->type;
2865 2866
		if (oi->sizep)
			*(oi->sizep) = co->size;
2867 2868
		if (oi->disk_sizep)
			*(oi->disk_sizep) = 0;
2869 2870
		if (oi->delta_base_sha1)
			hashclr(oi->delta_base_sha1);
2871 2872
		if (oi->typename)
			strbuf_addstr(oi->typename, typename(co->type));
2873
		oi->whence = OI_CACHED;
2874
		return 0;
2875 2876
	}

2877
	if (!find_pack_entry(real, &e)) {
2878
		/* Most likely it's a loose object. */
2879
		if (!sha1_loose_object_info(real, oi, flags)) {
2880
			oi->whence = OI_LOOSE;
2881
			return 0;
2882
		}
2883 2884

		/* Not a loose object; someone else may have just packed it. */
2885
		reprepare_packed_git();
2886
		if (!find_pack_entry(real, &e))
2887
			return -1;
2888
	}
2889

2890 2891 2892 2893 2894 2895 2896
	/*
	 * 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;

2897
	rtype = packed_object_info(e.p, e.offset, oi);
2898
	if (rtype < 0) {
2899
		mark_bad_packed_object(e.p, real);
2900 2901
		if (oi->typep == &real_type)
			oi->typep = NULL;
2902
		return sha1_object_info_extended(real, oi, 0);
2903 2904
	} else if (in_delta_base_cache(e.p, e.offset)) {
		oi->whence = OI_DBCACHED;
2905 2906 2907 2908 2909 2910
	} 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);
2911
	}
2912 2913 2914 2915
	if (oi->typename)
		strbuf_addstr(oi->typename, typename(*oi->typep));
	if (oi->typep == &real_type)
		oi->typep = NULL;
2916

2917
	return 0;
2918 2919
}

2920
/* returns enum object_type or negative */
2921 2922
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
{
2923
	enum object_type type;
2924
	struct object_info oi = OBJECT_INFO_INIT;
2925

2926
	oi.typep = &type;
2927
	oi.sizep = sizep;
2928
	if (sha1_object_info_extended(sha1, &oi, LOOKUP_REPLACE_OBJECT) < 0)
2929 2930
		return -1;
	return type;
2931 2932
}

2933 2934
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
2935 2936
{
	struct pack_entry e;
2937
	void *data;
2938

2939
	if (!find_pack_entry(sha1, &e))
2940
		return NULL;
2941
	data = cache_or_unpack_entry(e.p, e.offset, size, type);
2942 2943 2944 2945 2946 2947 2948 2949 2950 2951
	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);
2952
		data = read_object(sha1, type, size);
2953 2954
	}
	return data;
2955 2956
}

2957 2958
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2959 2960 2961
{
	struct cached_object *co;

2962
	hash_sha1_file(buf, len, typename(type), sha1);
2963 2964
	if (has_sha1_file(sha1) || find_cached_object(sha1))
		return 0;
2965
	ALLOC_GROW(cached_objects, cached_object_nr + 1, cached_object_alloc);
2966 2967
	co = &cached_objects[cached_object_nr++];
	co->size = len;
2968
	co->type = type;
J
Junio C Hamano 已提交
2969 2970
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
2971 2972 2973 2974
	hashcpy(co->sha1, sha1);
	return 0;
}

2975 2976
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size)
2977 2978 2979
{
	unsigned long mapsize;
	void *map, *buf;
2980 2981 2982 2983
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
2984
		*type = co->type;
2985
		*size = co->size;
P
Pierre Habouzit 已提交
2986
		return xmemdupz(co->buf, co->size);
2987
	}
2988

2989 2990 2991
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
2992
	map = map_sha1_file(sha1, &mapsize);
2993
	if (map) {
2994
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2995 2996 2997
		munmap(map, mapsize);
		return buf;
	}
2998
	reprepare_packed_git();
2999
	return read_packed_sha1(sha1, type, size);
3000 3001
}

3002 3003 3004 3005 3006
/*
 * 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.
 */
3007 3008 3009 3010
void *read_sha1_file_extended(const unsigned char *sha1,
			      enum object_type *type,
			      unsigned long *size,
			      unsigned flag)
3011
{
3012
	void *data;
3013
	const struct packed_git *p;
3014
	const unsigned char *repl = lookup_replace_object_extended(sha1, flag);
3015

3016 3017
	errno = 0;
	data = read_object(repl, type, size);
3018
	if (data)
3019
		return data;
3020

3021
	if (errno && errno != ENOENT)
3022 3023
		die_errno("failed to read object %s", sha1_to_hex(sha1));

3024
	/* die if we replaced an object with one that does not exist */
3025
	if (repl != sha1)
3026 3027 3028
		die("replacement %s not found for %s",
		    sha1_to_hex(repl), sha1_to_hex(sha1));

3029
	if (has_loose_object(repl)) {
3030 3031
		const char *path = sha1_file_name(sha1);

3032 3033
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
3034
	}
3035

3036 3037 3038
	if ((p = has_packed_and_bad(repl)) != NULL)
		die("packed object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), p->pack_name);
3039

3040
	return NULL;
3041 3042
}

3043
void *read_object_with_reference(const unsigned char *sha1,
3044
				 const char *required_type_name,
3045 3046
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
3047
{
3048
	enum object_type type, required_type;
3049 3050
	void *buffer;
	unsigned long isize;
3051
	unsigned char actual_sha1[20];
3052

3053
	required_type = type_from_string(required_type_name);
3054
	hashcpy(actual_sha1, sha1);
3055 3056 3057
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
3058

3059
		buffer = read_sha1_file(actual_sha1, &type, &isize);
3060 3061
		if (!buffer)
			return NULL;
3062
		if (type == required_type) {
3063 3064
			*size = isize;
			if (actual_sha1_return)
3065
				hashcpy(actual_sha1_return, actual_sha1);
3066 3067 3068
			return buffer;
		}
		/* Handle references */
3069
		else if (type == OBJ_COMMIT)
3070
			ref_type = "tree ";
3071
		else if (type == OBJ_TAG)
3072 3073 3074 3075 3076 3077
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
3078

3079 3080
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
3081
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
3082 3083 3084
			free(buffer);
			return NULL;
		}
3085
		free(buffer);
3086 3087
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
3088 3089 3090
	}
}

N
Nicolas Pitre 已提交
3091
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
3092
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
3093
                                    char *hdr, int *hdrlen)
3094
{
3095
	git_SHA_CTX c;
3096 3097

	/* Generate the header */
3098
	*hdrlen = xsnprintf(hdr, *hdrlen, "%s %lu", type, len)+1;
3099 3100

	/* Sha1.. */
3101 3102 3103 3104
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
3105 3106
}

3107
/*
3108
 * Move the just written object into its final resting place.
3109
 */
3110
int finalize_object_file(const char *tmpfile, const char *filename)
3111
{
3112
	int ret = 0;
3113

3114
	if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
3115 3116
		goto try_rename;
	else if (link(tmpfile, filename))
3117
		ret = errno;
3118 3119 3120 3121 3122 3123 3124 3125 3126

	/*
	 * 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.
	 *
3127
	 * When this succeeds, we just return.  We have nothing
3128 3129 3130
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
3131
	try_rename:
3132
		if (!rename(tmpfile, filename))
3133
			goto out;
3134
		ret = errno;
3135
	}
3136
	unlink_or_warn(tmpfile);
3137 3138
	if (ret) {
		if (ret != EEXIST) {
3139
			return error_errno("unable to write sha1 filename %s", filename);
3140 3141 3142 3143
		}
		/* FIXME!!! Collision check here ? */
	}

3144
out:
3145
	if (adjust_shared_perm(filename))
3146
		return error("unable to set permission to '%s'", filename);
3147 3148 3149
	return 0;
}

L
Linus Torvalds 已提交
3150 3151
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
3152
	if (write_in_full(fd, buf, len) < 0)
3153
		return error_errno("file write error");
L
Linus Torvalds 已提交
3154 3155 3156
	return 0;
}

N
Nicolas Pitre 已提交
3157
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
3158 3159
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
3160
	char hdr[32];
3161
	int hdrlen = sizeof(hdr);
R
Rene Scharfe 已提交
3162 3163 3164 3165
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

3166 3167 3168
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
3169 3170
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
3171
	if (close(fd) != 0)
3172
		die_errno("error when closing sha1 file");
3173 3174
}

3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190
/* 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 已提交
3191
static int create_tmpfile(struct strbuf *tmp, const char *filename)
3192 3193 3194
{
	int fd, dirlen = directory_size(filename);

J
Jeff King 已提交
3195 3196 3197 3198
	strbuf_reset(tmp);
	strbuf_add(tmp, filename, dirlen);
	strbuf_addstr(tmp, "tmp_obj_XXXXXX");
	fd = git_mkstemp_mode(tmp->buf, 0444);
3199
	if (fd < 0 && dirlen && errno == ENOENT) {
J
Jeff King 已提交
3200 3201 3202 3203 3204 3205 3206 3207 3208
		/*
		 * 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)
3209
			return -1;
J
Jeff King 已提交
3210
		if (adjust_shared_perm(tmp->buf))
3211 3212 3213
			return -1;

		/* Try again */
J
Jeff King 已提交
3214 3215
		strbuf_addstr(tmp, "/tmp_obj_XXXXXX");
		fd = git_mkstemp_mode(tmp->buf, 0444);
3216 3217 3218 3219
	}
	return fd;
}

3220
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
3221
			      const void *buf, unsigned long len, time_t mtime)
3222
{
3223
	int fd, ret;
3224
	unsigned char compressed[4096];
3225
	git_zstream stream;
3226 3227
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
J
Jeff King 已提交
3228
	static struct strbuf tmp_file = STRBUF_INIT;
3229
	const char *filename = sha1_file_name(sha1);
3230

J
Jeff King 已提交
3231
	fd = create_tmpfile(&tmp_file, filename);
3232
	if (fd < 0) {
3233
		if (errno == EACCES)
3234
			return error("insufficient permission for adding an object to repository database %s", get_object_directory());
3235
		else
3236
			return error_errno("unable to create temporary file");
3237 3238
	}

3239
	/* Set it up */
3240
	git_deflate_init(&stream, zlib_compression_level);
3241
	stream.next_out = compressed;
3242
	stream.avail_out = sizeof(compressed);
3243
	git_SHA1_Init(&c);
3244 3245

	/* First header.. */
N
Nicolas Pitre 已提交
3246
	stream.next_in = (unsigned char *)hdr;
3247
	stream.avail_in = hdrlen;
3248 3249
	while (git_deflate(&stream, 0) == Z_OK)
		; /* nothing */
3250
	git_SHA1_Update(&c, hdr, hdrlen);
3251 3252

	/* Then the data itself.. */
3253
	stream.next_in = (void *)buf;
3254
	stream.avail_in = len;
3255
	do {
3256
		unsigned char *in0 = stream.next_in;
3257
		ret = git_deflate(&stream, Z_FINISH);
3258
		git_SHA1_Update(&c, in0, stream.next_in - in0);
3259 3260 3261 3262 3263 3264
		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);

3265 3266
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
3267
	ret = git_deflate_end_gently(&stream);
3268 3269
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
3270 3271 3272
	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));
3273

3274
	close_sha1_file(fd);
3275

3276 3277 3278 3279
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
J
Jeff King 已提交
3280
		if (utime(tmp_file.buf, &utb) < 0)
3281
			warning_errno("failed utime() on %s", tmp_file.buf);
3282 3283
	}

J
Jeff King 已提交
3284
	return finalize_object_file(tmp_file.buf, filename);
3285
}
3286

3287 3288 3289 3290 3291 3292 3293 3294
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;
3295 3296 3297 3298 3299 3300 3301 3302
	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;
3303 3304
}

3305
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *sha1)
3306 3307
{
	char hdr[32];
3308
	int hdrlen = sizeof(hdr);
3309 3310 3311 3312 3313

	/* 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);
3314
	if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3315 3316 3317 3318
		return 0;
	return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
}

3319 3320 3321 3322 3323 3324 3325
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 */
3326 3327
	hdrlen = strlen(type) + 32;
	header = xmalloc(hdrlen);
3328 3329 3330 3331
	write_sha1_file_prepare(buf, len, type, sha1, header, &hdrlen);

	if (!(flags & HASH_WRITE_OBJECT))
		goto cleanup;
J
Junio C Hamano 已提交
3332
	if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3333 3334 3335 3336 3337 3338 3339 3340
		goto cleanup;
	status = write_loose_object(sha1, header, hdrlen, buf, len, 0);

cleanup:
	free(header);
	return status;
}

3341 3342 3343 3344 3345 3346 3347
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;
3348
	int ret;
3349

3350
	if (has_loose_object(sha1))
3351 3352 3353 3354
		return 0;
	buf = read_packed_sha1(sha1, &type, &len);
	if (!buf)
		return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
3355
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(type), len) + 1;
3356 3357 3358 3359
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
3360 3361
}

3362 3363 3364 3365 3366 3367 3368 3369
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

3370 3371 3372 3373 3374 3375
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

3376
int has_sha1_file_with_flags(const unsigned char *sha1, int flags)
3377
{
3378 3379
	struct pack_entry e;

3380
	if (find_pack_entry(sha1, &e))
3381
		return 1;
3382 3383
	if (has_loose_object(sha1))
		return 1;
3384 3385
	if (flags & HAS_SHA1_QUICK)
		return 0;
3386 3387
	reprepare_packed_git();
	return find_pack_entry(sha1, &e);
3388 3389 3390 3391 3392
}

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

3395 3396 3397 3398 3399
int has_object_file_with_flags(const struct object_id *oid, int flags)
{
	return has_sha1_file_with_flags(oid->hash, flags);
}

3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427
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");
}

3428
static int index_mem(unsigned char *sha1, void *buf, size_t size,
3429 3430
		     enum object_type type,
		     const char *path, unsigned flags)
3431
{
L
Linus Torvalds 已提交
3432
	int ret, re_allocated = 0;
3433
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
3434

3435
	if (!type)
3436
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
3437 3438 3439 3440

	/*
	 * Convert blobs to git internal format
	 */
3441
	if ((type == OBJ_BLOB) && path) {
3442
		struct strbuf nbuf = STRBUF_INIT;
3443
		if (convert_to_git(path, buf, size, &nbuf,
3444
				   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3445
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
3446 3447 3448
			re_allocated = 1;
		}
	}
3449
	if (flags & HASH_FORMAT_CHECK) {
3450 3451 3452 3453 3454 3455 3456
		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 已提交
3457

3458
	if (write_object)
3459
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
3460
	else
3461
		ret = hash_sha1_file(buf, size, typename(type), sha1);
3462
	if (re_allocated)
L
Linus Torvalds 已提交
3463
		free(buf);
3464 3465 3466
	return ret;
}

3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489
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;
}

3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503
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;
}

3504 3505
#define SMALL_FILE_SIZE (32*1024)

3506 3507 3508
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
3509 3510 3511
{
	int ret;

3512
	if (!size) {
3513
		ret = index_mem(sha1, "", size, type, path, flags);
3514 3515 3516
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
3517
			ret = index_mem(sha1, buf, size, type, path, flags);
3518
		else
3519
			ret = error_errno("short read");
3520
		free(buf);
3521
	} else {
3522
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3523
		ret = index_mem(sha1, buf, size, type, path, flags);
3524
		munmap(buf, size);
3525
	}
3526 3527 3528
	return ret;
}

3529
/*
3530 3531
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
3532 3533 3534 3535
 *
 * 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
3536 3537 3538 3539 3540 3541 3542
 * (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.
3543 3544 3545 3546 3547
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
3548
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
3549 3550
}

3551 3552 3553 3554 3555
int index_fd(unsigned char *sha1, int fd, struct stat *st,
	     enum object_type type, const char *path, unsigned flags)
{
	int ret;

3556 3557 3558 3559
	/*
	 * Call xsize_t() only when needed to avoid potentially unnecessary
	 * die() for large files.
	 */
3560 3561 3562
	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))
3563
		ret = index_pipe(sha1, fd, type, path, flags);
3564
	else if (st->st_size <= big_file_threshold || type != OBJ_BLOB ||
3565
		 (path && would_convert_to_git(path)))
3566 3567
		ret = index_core(sha1, fd, xsize_t(st->st_size), type, path,
				 flags);
3568
	else
3569 3570
		ret = index_stream(sha1, fd, xsize_t(st->st_size), type, path,
				   flags);
3571
	close(fd);
3572
	return ret;
J
Junio C Hamano 已提交
3573
}
3574

3575
int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3576 3577
{
	int fd;
3578
	struct strbuf sb = STRBUF_INIT;
3579 3580 3581 3582 3583

	switch (st->st_mode & S_IFMT) {
	case S_IFREG:
		fd = open(path, O_RDONLY);
		if (fd < 0)
3584
			return error_errno("open(\"%s\")", path);
3585
		if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3586 3587 3588 3589
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
3590 3591
		if (strbuf_readlink(&sb, path, st->st_size))
			return error_errno("readlink(\"%s\")", path);
3592
		if (!(flags & HASH_WRITE_OBJECT))
3593 3594
			hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
		else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3595 3596
			return error("%s: failed to insert into database",
				     path);
3597
		strbuf_release(&sb);
3598
		break;
3599 3600
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
3601 3602 3603 3604 3605
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
3606 3607 3608

int read_pack_header(int fd, struct pack_header *header)
{
3609 3610 3611 3612
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

3613 3614 3615 3616 3617 3618 3619 3620
	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 已提交
3621 3622 3623 3624 3625 3626 3627 3628 3629 3630

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));
}
3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646

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;
3647
		return error_errno("unable to open %s", path->buf);
3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678
	}

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

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

		if (strlen(de->d_name) == 38)  {
			char hex[41];
			unsigned char sha1[20];

			snprintf(hex, sizeof(hex), "%02x%s",
				 subdir_nr, de->d_name);
			if (!get_sha1_hex(hex, sha1)) {
				if (obj_cb) {
					r = obj_cb(sha1, path->buf, data);
					if (r)
						break;
				}
				continue;
			}
		}

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

3681
	strbuf_setlen(path, baselen);
3682 3683 3684 3685 3686 3687
	if (!r && subdir_cb)
		r = subdir_cb(subdir_nr, path->buf, data);

	return r;
}

3688
int for_each_loose_file_in_objdir_buf(struct strbuf *path,
3689 3690 3691 3692 3693
			    each_loose_object_fn obj_cb,
			    each_loose_cruft_fn cruft_cb,
			    each_loose_subdir_fn subdir_cb,
			    void *data)
{
3694
	size_t baselen = path->len;
3695 3696 3697 3698
	int r = 0;
	int i;

	for (i = 0; i < 256; i++) {
3699 3700
		strbuf_addf(path, "/%02x", i);
		r = for_each_file_in_obj_subdir(i, path, obj_cb, cruft_cb,
3701
						subdir_cb, data);
3702
		strbuf_setlen(path, baselen);
3703 3704 3705 3706
		if (r)
			break;
	}

3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721
	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);
3722
	strbuf_release(&buf);
3723

3724 3725
	return r;
}
3726 3727 3728 3729 3730 3731 3732 3733 3734 3735

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;
3736 3737 3738
	struct strbuf buf = STRBUF_INIT;
	int r;

3739
	strbuf_addstr(&buf, alt->path);
3740 3741 3742 3743 3744
	r = for_each_loose_file_in_objdir_buf(&buf,
					      data->cb, NULL, NULL,
					      data->data);
	strbuf_release(&buf);
	return r;
3745 3746
}

3747
int for_each_loose_object(each_loose_object_fn cb, void *data, unsigned flags)
3748 3749 3750 3751 3752 3753 3754 3755 3756
{
	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;

3757 3758 3759
	if (flags & FOR_EACH_OBJECT_LOCAL_ONLY)
		return 0;

3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783
	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++) {
		const unsigned char *sha1 = nth_packed_object_sha1(p, i);

		if (!sha1)
			return error("unable to get sha1 of object %u in %s",
				     i, p->pack_name);

		r = cb(sha1, p, i, data);
		if (r)
			break;
	}
	return r;
}

3784
int for_each_packed_object(each_packed_object_fn cb, void *data, unsigned flags)
3785 3786 3787
{
	struct packed_git *p;
	int r = 0;
3788
	int pack_errors = 0;
3789 3790 3791

	prepare_packed_git();
	for (p = packed_git; p; p = p->next) {
3792 3793
		if ((flags & FOR_EACH_OBJECT_LOCAL_ONLY) && !p->pack_local)
			continue;
3794 3795 3796 3797
		if (open_pack_index(p)) {
			pack_errors = 1;
			continue;
		}
3798 3799 3800 3801
		r = for_each_object_in_pack(p, cb, data);
		if (r)
			break;
	}
3802
	return r ? r : pack_errors;
3803
}