sha1_file.c 90.3 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"
27

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

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

39
const unsigned char null_sha1[20];
40
const struct object_id null_oid;
J
Junio C Hamano 已提交
41

42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
/*
 * This is meant to hold a *small* number of objects that you would
 * want read_sha1_file() to be able to return, but yet you do not want
 * to write them into the object store (e.g. a browse-only
 * application).
 */
static struct cached_object {
	unsigned char sha1[20];
	enum object_type type;
	void *buf;
	unsigned long size;
} *cached_objects;
static int cached_object_nr, cached_object_alloc;

static struct cached_object empty_tree = {
57
	EMPTY_TREE_SHA1_BIN_LITERAL,
58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76
	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;
}

77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105
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);
}

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

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

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

		if (!*slash)
119
			break;
120

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

127
		slash_character = *slash;
128
		*slash = '\0';
129 130
		if (!stat(path, &st)) {
			/* path exists */
131
			if (!S_ISDIR(st.st_mode))
132
				ret = SCLD_EXISTS;
133
		} else if (mkdir(path, 0777)) {
134
			if (errno == EEXIST &&
135
			    !stat(path, &st) && S_ISDIR(st.st_mode))
136
				; /* somebody created it since we checked */
137 138 139 140 141 142 143 144 145 146 147
			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;
148
			else
149
				ret = SCLD_FAILED;
150
		} else if (adjust_shared_perm(path)) {
151
			ret = SCLD_PERMS;
152
		}
153
		*slash = slash_character;
154
	}
155
	return ret;
156
}
157

158
enum scld_error safe_create_leading_directories_const(const char *path)
159 160 161
{
	/* path points to cache entries, so xstrdup before messing with it */
	char *buf = xstrdup(path);
162
	enum scld_error result = safe_create_leading_directories(buf);
163 164 165 166
	free(buf);
	return result;
}

167 168 169 170 171 172 173 174 175 176 177 178
static void fill_sha1_path(char *pathbuf, const unsigned char *sha1)
{
	int i;
	for (i = 0; i < 20; i++) {
		static char hex[] = "0123456789abcdef";
		unsigned int val = sha1[i];
		char *pos = pathbuf + i*2 + (i > 0);
		*pos++ = hex[val >> 4];
		*pos = hex[val & 0xf];
	}
}

179
const char *sha1_file_name(const unsigned char *sha1)
180
{
181 182 183
	static char buf[PATH_MAX];
	const char *objdir;
	int len;
184

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

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

199 200 201 202 203
/*
 * 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".
 */
204
static char *sha1_get_pack_name(const unsigned char *sha1,
J
Jeff King 已提交
205 206
				struct strbuf *buf,
				const char *which)
207
{
J
Jeff King 已提交
208 209 210 211
	strbuf_reset(buf);
	strbuf_addf(buf, "%s/pack/pack-%s.%s", get_object_directory(),
		    sha1_to_hex(sha1), which);
	return buf->buf;
212 213
}

214
char *sha1_pack_name(const unsigned char *sha1)
215
{
J
Jeff King 已提交
216 217
	static struct strbuf buf = STRBUF_INIT;
	return sha1_get_pack_name(sha1, &buf, "pack");
218
}
219

220 221
char *sha1_pack_index_name(const unsigned char *sha1)
{
J
Jeff King 已提交
222 223
	static struct strbuf buf = STRBUF_INIT;
	return sha1_get_pack_name(sha1, &buf, "idx");
224 225
}

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

J
Junio C Hamano 已提交
229 230
/*
 * Prepare alternate object database registry.
231 232 233 234 235
 *
 * 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,
236 237
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
238 239 240 241 242
 * 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 已提交
243
 */
244 245
static int link_alt_odb_entry(const char *entry, const char *relative_base,
	int depth, const char *normalized_objdir)
246
{
M
Martin Waitz 已提交
247 248
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
249
	size_t pfxlen, entlen;
250
	struct strbuf pathbuf = STRBUF_INIT;
251

252
	if (!is_absolute_path(entry) && relative_base) {
253 254
		strbuf_addstr(&pathbuf, real_path(relative_base));
		strbuf_addch(&pathbuf, '/');
M
Martin Waitz 已提交
255
	}
256
	strbuf_addstr(&pathbuf, entry);
M
Martin Waitz 已提交
257

258 259 260 261 262 263 264 265 266 267 268
	normalize_path_copy(pathbuf.buf, pathbuf.buf);

	pfxlen = strlen(pathbuf.buf);

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

269 270
	entlen = st_add(pfxlen, 43); /* '/' + 2 hex + '/' + 38 hex + NUL */
	ent = xmalloc(st_add(sizeof(*ent), entlen));
271 272
	memcpy(ent->base, pathbuf.buf, pfxlen);
	strbuf_release(&pathbuf);
M
Martin Waitz 已提交
273 274 275 276 277 278

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

	/* Detect cases where alternate disappeared */
279
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
280 281 282 283 284 285 286 287 288 289 290
		error("object directory %s does not exist; "
		      "check .git/objects/info/alternates.",
		      ent->base);
		free(ent);
		return -1;
	}

	/* Prevent the common mistake of listing the same
	 * thing twice, or object directory itself.
	 */
	for (alt = alt_odb_list; alt; alt = alt->next) {
291 292
		if (pfxlen == alt->name - alt->base - 1 &&
		    !memcmp(ent->base, alt->base, pfxlen)) {
M
Martin Waitz 已提交
293 294 295 296
			free(ent);
			return -1;
		}
	}
297
	if (!fspathcmp(ent->base, normalized_objdir)) {
M
Martin Waitz 已提交
298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
		free(ent);
		return -1;
	}

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

	/* recursively add alternates */
	read_info_alternates(ent->base, depth + 1);

	ent->base[pfxlen] = '/';

	return 0;
}

315
static void link_alt_odb_entries(const char *alt, int len, int sep,
M
Martin Waitz 已提交
316 317
				 const char *relative_base, int depth)
{
318 319 320
	struct string_list entries = STRING_LIST_INIT_NODUP;
	char *alt_copy;
	int i;
321
	struct strbuf objdirbuf = STRBUF_INIT;
M
Martin Waitz 已提交
322 323 324 325 326 327 328

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

J
Junio C Hamano 已提交
329
	strbuf_add_absolute_path(&objdirbuf, get_object_directory());
330 331
	normalize_path_copy(objdirbuf.buf, objdirbuf.buf);

332
	alt_copy = xmemdupz(alt, len);
333 334 335 336
	string_list_split_in_place(&entries, alt_copy, sep, -1);
	for (i = 0; i < entries.nr; i++) {
		const char *entry = entries.items[i].string;
		if (entry[0] == '\0' || entry[0] == '#')
337
			continue;
338 339 340 341
		if (!is_absolute_path(entry) && depth) {
			error("%s: ignoring relative alternate object store %s",
					relative_base, entry);
		} else {
342
			link_alt_odb_entry(entry, relative_base, depth, objdirbuf.buf);
343 344
		}
	}
345 346
	string_list_clear(&entries, 0);
	free(alt_copy);
347
	strbuf_release(&objdirbuf);
348 349
}

350
void read_info_alternates(const char * relative_base, int depth)
351
{
352
	char *map;
353
	size_t mapsz;
354
	struct stat st;
355
	char *path;
M
Martin Waitz 已提交
356
	int fd;
357

358
	path = xstrfmt("%s/info/alternates", relative_base);
359
	fd = git_open_noatime(path);
360
	free(path);
361 362 363 364
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
365
		return;
366
	}
367 368
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
369 370
	close(fd);

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

373
	munmap(map, mapsz);
374 375
}

376 377 378
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
379 380 381 382 383 384 385 386 387 388 389 390 391
	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;

392
		while (strbuf_getline(&line, in) != EOF) {
393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418
			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);
419 420
}

421
int foreach_alt_odb(alt_odb_fn fn, void *cb)
422 423
{
	struct alternate_object_database *ent;
424
	int r = 0;
425 426

	prepare_alt_odb();
427 428 429 430 431 432
	for (ent = alt_odb_list; ent; ent = ent->next) {
		r = fn(ent, cb);
		if (r)
			break;
	}
	return r;
433 434
}

M
Martin Waitz 已提交
435 436
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
437
	const char *alt;
M
Martin Waitz 已提交
438

S
Shawn O. Pearce 已提交
439 440 441
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
442 443 444 445
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
446
	link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
447 448 449 450

	read_info_alternates(get_object_directory(), 0);
}

451
/* Returns 1 if we have successfully freshened the file, 0 otherwise. */
452
static int freshen_file(const char *fn)
453
{
454 455 456
	struct utimbuf t;
	t.actime = t.modtime = time(NULL);
	return !utime(fn, &t);
457
}
458

459 460 461 462 463 464 465
/*
 * 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).
 */
466 467 468 469
static int check_and_freshen_file(const char *fn, int freshen)
{
	if (access(fn, F_OK))
		return 0;
470
	if (freshen && !freshen_file(fn))
471 472 473 474 475 476 477 478 479 480
		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)
481 482
{
	struct alternate_object_database *alt;
483
	prepare_alt_odb();
484
	for (alt = alt_odb_list; alt; alt = alt->next) {
485
		fill_sha1_path(alt->name, sha1);
486
		if (check_and_freshen_file(alt->base, freshen))
487
			return 1;
488
	}
489
	return 0;
490 491
}

492 493 494 495 496 497 498 499 500 501 502
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);
}

503 504
static int has_loose_object(const unsigned char *sha1)
{
505
	return check_and_freshen(sha1, 0);
506 507
}

508
static unsigned int pack_used_ctr;
509 510 511
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
512 513
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
514
static size_t peak_pack_mapped;
515
static size_t pack_mapped;
516
struct packed_git *packed_git;
517

518 519 520
static struct mru packed_git_mru_storage;
struct mru *packed_git_mru = &packed_git_mru_storage;

J
Junio C Hamano 已提交
521
void pack_report(void)
522 523
{
	fprintf(stderr,
524 525 526
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
527 528 529
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
530 531 532 533
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
534 535
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
536 537 538
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
539
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
540 541
}

542 543 544 545 546 547
/*
 * 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)
548 549
{
	void *idx_map;
550
	struct pack_idx_header *hdr;
551
	size_t idx_size;
552
	uint32_t version, nr, i, *index;
553
	int fd = git_open_noatime(path);
554
	struct stat st;
555

556 557 558 559 560 561
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
562
	idx_size = xsize_t(st.st_size);
563 564 565 566
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
567
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
568 569
	close(fd);

570 571
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
572 573 574
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
575
			return error("index file %s is version %"PRIu32
576 577 578 579 580 581
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
582

583
	nr = 0;
584
	index = idx_map;
585 586
	if (version > 1)
		index += 2;  /* skip index header */
587
	for (i = 0; i < 256; i++) {
588
		uint32_t n = ntohl(index[i]);
589 590
		if (n < nr) {
			munmap(idx_map, idx_size);
591
			return error("non-monotonic index %s", path);
592
		}
593 594 595
		nr = n;
	}

596 597 598 599 600 601 602 603 604 605
	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);
606
			return error("wrong index v1 file size in %s", path);
607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622
		}
	} 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 已提交
623 624 625 626
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
627
			munmap(idx_map, idx_size);
628
			return error("wrong index v2 file size in %s", path);
629
		}
630 631 632 633 634 635 636 637 638
		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);
639
		}
640
	}
641

642
	p->index_version = version;
643 644
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
645
	p->num_objects = nr;
646 647 648
	return 0;
}

649
int open_pack_index(struct packed_git *p)
650 651
{
	char *idx_name;
652
	size_t len;
653 654 655 656 657
	int ret;

	if (p->index_data)
		return 0;

658 659 660
	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);
661 662 663 664 665
	ret = check_packed_git_idx(idx_name, p);
	free(idx_name);
	return ret;
}

666 667 668 669
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
670
{
671 672 673 674 675 676 677 678
	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;
679 680
			}
		}
681
		w_l = w;
682
	}
683 684
}

685
static int unuse_one_window(struct packed_git *current)
686 687 688 689 690 691 692 693
{
	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);
694 695 696 697 698
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
699
		else
700 701
			lru_p->windows = lru_w->next;
		free(lru_w);
702
		pack_open_windows--;
703 704 705
		return 1;
	}
	return 0;
706 707
}

708
void release_pack_memory(size_t need)
709 710
{
	size_t cur = pack_mapped;
711
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
712 713 714
		; /* nothing */
}

715 716 717 718 719 720 721 722 723 724 725 726 727
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 已提交
728 729
void *xmmap_gently(void *start, size_t length,
		  int prot, int flags, int fd, off_t offset)
730
{
731 732 733 734
	void *ret;

	mmap_limit_check(length);
	ret = mmap(start, length, prot, flags, fd, offset);
735 736 737
	if (ret == MAP_FAILED) {
		if (!length)
			return NULL;
738
		release_pack_memory(length);
739 740 741 742 743
		ret = mmap(start, length, prot, flags, fd, offset);
	}
	return ret;
}

J
Jeff King 已提交
744 745 746 747 748
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 已提交
749
		die_errno("mmap failed");
J
Jeff King 已提交
750 751 752
	return ret;
}

753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768
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);
	}
}

769 770 771 772 773 774 775 776 777 778 779 780
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;
}

781 782 783 784 785 786 787 788 789 790 791 792 793
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)
794
			die("BUG: want to close pack marked 'do-not-close'");
795 796 797 798 799
		else
			close_pack(p);
}


800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866
/*
 * 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);
	}

867 868
	if (lru_p)
		return close_pack_fd(lru_p);
869 870 871 872

	return 0;
}

873
void unuse_pack(struct pack_window **w_cursor)
874
{
875 876 877 878 879
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
880 881
}

882 883 884 885 886 887 888 889
void close_pack_index(struct packed_git *p)
{
	if (p->index_data) {
		munmap((void *)p->index_data, p->index_size);
		p->index_data = NULL;
	}
}

890 891 892
static unsigned int get_max_fd_limit(void)
{
#ifdef RLIMIT_NOFILE
893 894
	{
		struct rlimit lim;
895

896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922
		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
923

924
#ifdef OPEN_MAX
925 926 927 928 929 930
	return OPEN_MAX;
#else
	return 1; /* see the caller ;-) */
#endif
}

931 932 933 934 935
/*
 * 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)
936
{
937 938 939 940
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
941
	long fd_flag;
942

943 944 945
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

946
	if (!pack_max_fds) {
947
		unsigned int max_fds = get_max_fd_limit();
948 949 950 951 952 953 954 955

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

956
	while (pack_max_fds <= pack_open_fds && close_one_pack())
957 958
		; /* nothing */

959
	p->pack_fd = git_open_noatime(p->pack_name);
960
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
961
		return -1;
962
	pack_open_fds++;
963 964

	/* If we created the struct before we had the pack we lack size. */
965 966
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
967
			return error("packfile %s not a regular file", p->pack_name);
968
		p->pack_size = st.st_size;
969
	} else if (p->pack_size != st.st_size)
970
		return error("packfile %s size changed", p->pack_name);
971

972 973 974 975 976
	/* 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)
977
		return error("cannot determine file descriptor flags");
978 979
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
980
		return error("cannot set FD_CLOEXEC");
981

982
	/* Verify we recognize this pack file format. */
983
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
984
		return error("file %s is far too short to be a packfile", p->pack_name);
985
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
986
		return error("file %s is not a GIT packfile", p->pack_name);
987
	if (!pack_version_ok(hdr.hdr_version))
988 989
		return error("packfile %s is version %"PRIu32" and not"
			" supported (try upgrading GIT to a newer version)",
990 991 992
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
993
	if (p->num_objects != ntohl(hdr.hdr_entries))
994 995
		return error("packfile %s claims to have %"PRIu32" objects"
			     " while index indicates %"PRIu32" objects",
N
Nicolas Pitre 已提交
996 997
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
998
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
999
		return error("end of packfile %s is unavailable", p->pack_name);
1000
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
1001
		return error("packfile %s signature is unavailable", p->pack_name);
1002
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
1003
	if (hashcmp(sha1, idx_sha1))
1004 1005
		return error("packfile %s does not match index", p->pack_name);
	return 0;
1006 1007
}

1008 1009 1010 1011
static int open_packed_git(struct packed_git *p)
{
	if (!open_packed_git_1(p))
		return 0;
1012
	close_pack_fd(p);
1013 1014 1015
	return -1;
}

1016
static int in_window(struct pack_window *win, off_t offset)
1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028
{
	/* 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);
}

1029
unsigned char *use_pack(struct packed_git *p,
1030
		struct pack_window **w_cursor,
1031
		off_t offset,
1032
		unsigned long *left)
1033
{
1034
	struct pack_window *win = *w_cursor;
1035

F
Felipe Contreras 已提交
1036
	/* Since packfiles end in a hash of their content and it's
1037 1038 1039 1040
	 * 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.
	 */
1041 1042
	if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
1043 1044
	if (offset > (p->pack_size - 20))
		die("offset beyond end of packfile (truncated pack?)");
1045
	if (offset < 0)
1046
		die(_("offset before end of packfile (broken .idx?)"));
1047 1048 1049 1050 1051 1052 1053 1054 1055

	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) {
1056
			size_t window_align = packed_git_window_size / 2;
1057
			off_t len;
1058 1059 1060 1061

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

1062
			win = xcalloc(1, sizeof(*win));
1063
			win->offset = (offset / window_align) * window_align;
1064 1065 1066 1067
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
1068
			pack_mapped += win->len;
1069
			while (packed_git_limit < pack_mapped
1070
				&& unuse_one_window(p))
1071
				; /* nothing */
1072
			win->base = xmmap(NULL, win->len,
1073 1074 1075
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
1076 1077
				die_errno("packfile %s cannot be mapped",
					  p->pack_name);
1078
			if (!win->offset && win->len == p->pack_size
1079 1080
				&& !p->do_not_close)
				close_pack_fd(p);
1081 1082 1083 1084 1085 1086
			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;
1087 1088 1089
			win->next = p->windows;
			p->windows = win;
		}
1090
	}
1091 1092 1093 1094 1095
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
1096
	offset -= win->offset;
1097
	if (left)
1098
		*left = win->len - xsize_t(offset);
1099
	return win->base + offset;
1100 1101
}

1102 1103
static struct packed_git *alloc_packed_git(int extra)
{
1104
	struct packed_git *p = xmalloc(st_add(sizeof(*p), extra));
1105 1106 1107 1108 1109
	memset(p, 0, sizeof(*p));
	p->pack_fd = -1;
	return p;
}

1110 1111
static void try_to_free_pack_memory(size_t size)
{
1112
	release_pack_memory(size);
1113 1114
}

1115
struct packed_git *add_packed_git(const char *path, size_t path_len, int local)
1116
{
1117
	static int have_set_try_to_free_routine;
1118
	struct stat st;
1119 1120
	size_t alloc;
	struct packed_git *p;
1121

1122 1123 1124 1125 1126
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

1127 1128 1129 1130
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
1131
	if (!strip_suffix_mem(path, &path_len, ".idx"))
1132
		return NULL;
1133 1134 1135 1136 1137

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

1142
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".keep");
1143 1144 1145
	if (!access(p->pack_name, F_OK))
		p->pack_keep = 1;

1146
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".pack");
1147
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1148
		free(p);
1149 1150
		return NULL;
	}
1151

1152 1153 1154 1155
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
1156
	p->pack_local = local;
1157
	p->mtime = st.st_mtime;
1158 1159
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
1160 1161 1162
	return p;
}

1163
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1164
{
1165
	const char *path = sha1_pack_name(sha1);
1166
	size_t alloc = st_add(strlen(path), 1);
1167
	struct packed_git *p = alloc_packed_git(alloc);
1168

1169
	memcpy(p->pack_name, path, alloc); /* includes NUL */
1170
	hashcpy(p->sha1, sha1);
1171 1172
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
1173
		return NULL;
1174
	}
1175 1176 1177 1178 1179 1180

	return p;
}

void install_packed_git(struct packed_git *pack)
{
1181 1182 1183
	if (pack->pack_fd != -1)
		pack_open_fds++;

1184 1185 1186 1187
	pack->next = packed_git;
	packed_git = pack;
}

1188
void (*report_garbage)(unsigned seen_bits, const char *path);
1189 1190 1191 1192

static void report_helper(const struct string_list *list,
			  int seen_bits, int first, int last)
{
1193
	if (seen_bits == (PACKDIR_FILE_PACK|PACKDIR_FILE_IDX))
1194
		return;
1195

1196
	for (; first < last; first++)
1197
		report_garbage(seen_bits, list->items[first].string);
1198 1199 1200 1201 1202 1203 1204 1205 1206
}

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

	if (!report_garbage)
		return;

1207
	string_list_sort(list);
1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219

	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) {
1220
				report_garbage(PACKDIR_FILE_GARBAGE, path);
1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233
				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);
}

1234
static void prepare_packed_git_one(char *objdir, int local)
1235
{
1236 1237
	struct strbuf path = STRBUF_INIT;
	size_t dirnamelen;
1238 1239
	DIR *dir;
	struct dirent *de;
1240
	struct string_list garbage = STRING_LIST_INIT_DUP;
1241

1242 1243 1244
	strbuf_addstr(&path, objdir);
	strbuf_addstr(&path, "/pack");
	dir = opendir(path.buf);
1245
	if (!dir) {
J
Junio C Hamano 已提交
1246
		if (errno != ENOENT)
1247 1248
			error_errno("unable to open object pack directory: %s",
				    path.buf);
1249
		strbuf_release(&path);
1250
		return;
1251
	}
1252 1253
	strbuf_addch(&path, '/');
	dirnamelen = path.len;
1254 1255
	while ((de = readdir(dir)) != NULL) {
		struct packed_git *p;
1256
		size_t base_len;
1257 1258

		if (is_dot_or_dotdot(de->d_name))
1259 1260
			continue;

1261 1262
		strbuf_setlen(&path, dirnamelen);
		strbuf_addstr(&path, de->d_name);
1263

1264 1265
		base_len = path.len;
		if (strip_suffix_mem(path.buf, &base_len, ".idx")) {
1266 1267
			/* Don't reopen a pack we already have. */
			for (p = packed_git; p; p = p->next) {
1268 1269 1270 1271
				size_t len;
				if (strip_suffix(p->pack_name, ".pack", &len) &&
				    len == base_len &&
				    !memcmp(p->pack_name, path.buf, len))
1272 1273 1274 1275 1276 1277 1278
					break;
			}
			if (p == NULL &&
			    /*
			     * See if it really is a valid .idx file with
			     * corresponding .pack file that we can map.
			     */
1279
			    (p = add_packed_git(path.buf, path.len, local)) != NULL)
1280
				install_packed_git(p);
1281
		}
1282 1283 1284 1285

		if (!report_garbage)
			continue;

J
Jeff King 已提交
1286 1287 1288 1289
		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"))
1290
			string_list_append(&garbage, path.buf);
1291
		else
1292
			report_garbage(PACKDIR_FILE_GARBAGE, path.buf);
1293
	}
1294
	closedir(dir);
1295 1296
	report_pack_garbage(&garbage);
	string_list_clear(&garbage, 0);
1297
	strbuf_release(&path);
1298 1299
}

1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353
static int sort_pack(const void *a_, const void *b_)
{
	struct packed_git *a = *((struct packed_git **)a_);
	struct packed_git *b = *((struct packed_git **)b_);
	int st;

	/*
	 * Local packs tend to contain objects specific to our
	 * variant of the project than remote ones.  In addition,
	 * remote ones could be on a network mounted filesystem.
	 * Favor local ones for these reasons.
	 */
	st = a->pack_local - b->pack_local;
	if (st)
		return -st;

	/*
	 * Younger packs tend to contain more recent objects,
	 * and more recent objects tend to get accessed more
	 * often.
	 */
	if (a->mtime < b->mtime)
		return 1;
	else if (a->mtime == b->mtime)
		return 0;
	return -1;
}

static void rearrange_packed_git(void)
{
	struct packed_git **ary, *p;
	int i, n;

	for (n = 0, p = packed_git; p; p = p->next)
		n++;
	if (n < 2)
		return;

	/* prepare an array of packed_git for easier sorting */
	ary = xcalloc(n, sizeof(struct packed_git *));
	for (n = 0, p = packed_git; p; p = p->next)
		ary[n++] = p;

	qsort(ary, n, sizeof(struct packed_git *), sort_pack);

	/* link them back again */
	for (i = 0; i < n - 1; i++)
		ary[i]->next = ary[i + 1];
	ary[n - 1]->next = NULL;
	packed_git = ary[0];

	free(ary);
}

1354 1355 1356 1357 1358 1359 1360 1361 1362
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);
}

1363
static int prepare_packed_git_run_once = 0;
1364
void prepare_packed_git(void)
1365
{
1366
	struct alternate_object_database *alt;
1367

1368
	if (prepare_packed_git_run_once)
1369
		return;
1370
	prepare_packed_git_one(get_object_directory(), 1);
1371
	prepare_alt_odb();
1372
	for (alt = alt_odb_list; alt; alt = alt->next) {
1373
		alt->name[-1] = 0;
1374
		prepare_packed_git_one(alt->base, 0);
1375
		alt->name[-1] = '/';
1376
	}
1377
	rearrange_packed_git();
1378
	prepare_packed_git_mru();
1379 1380 1381
	prepare_packed_git_run_once = 1;
}

1382
void reprepare_packed_git(void)
1383 1384 1385
{
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1386 1387
}

1388 1389 1390 1391 1392
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++)
1393
		if (!hashcmp(sha1, p->bad_object_sha1 + GIT_SHA1_RAWSZ * i))
1394
			return;
1395 1396 1397 1398
	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);
1399 1400 1401
	p->num_bad_objects++;
}

1402
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1403 1404 1405 1406 1407 1408 1409
{
	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))
1410 1411
				return p;
	return NULL;
1412 1413
}

1414 1415 1416 1417 1418 1419 1420 1421
/*
 * 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)
1422 1423
{
	unsigned char real_sha1[20];
1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439
	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 */
1440
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(obj_type), size) + 1;
1441 1442 1443 1444 1445 1446 1447 1448

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

1449 1450 1451 1452
		if (readlen < 0) {
			close_istream(st);
			return -1;
		}
1453 1454 1455 1456 1457 1458
		if (!readlen)
			break;
		git_SHA1_Update(&c, buf, readlen);
	}
	git_SHA1_Final(real_sha1, &c);
	close_istream(st);
1459
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1460 1461
}

1462
int git_open_noatime(const char *name)
1463 1464 1465
{
	static int sha1_file_open_flag = O_NOATIME;

1466
	for (;;) {
1467 1468 1469 1470
		int fd;

		errno = 0;
		fd = open(name, O_RDONLY | sha1_file_open_flag);
1471
		if (fd >= 0)
1472 1473 1474 1475
			return fd;

		/* Might the failure be due to O_NOATIME? */
		if (errno != ENOENT && sha1_file_open_flag) {
1476
			sha1_file_open_flag = 0;
1477 1478 1479 1480
			continue;
		}

		return -1;
1481 1482 1483
	}
}

1484 1485 1486 1487
static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
{
	struct alternate_object_database *alt;

1488
	if (!lstat(sha1_file_name(sha1), st))
1489 1490 1491 1492 1493
		return 0;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
1494
		fill_sha1_path(alt->name, sha1);
1495 1496 1497 1498 1499 1500 1501
		if (!lstat(alt->base, st))
			return 0;
	}

	return -1;
}

1502 1503 1504 1505
static int open_sha1_file(const unsigned char *sha1)
{
	int fd;
	struct alternate_object_database *alt;
1506
	int most_interesting_errno;
1507

1508
	fd = git_open_noatime(sha1_file_name(sha1));
1509 1510
	if (fd >= 0)
		return fd;
1511
	most_interesting_errno = errno;
1512 1513 1514

	prepare_alt_odb();
	for (alt = alt_odb_list; alt; alt = alt->next) {
1515
		fill_sha1_path(alt->name, sha1);
1516
		fd = git_open_noatime(alt->base);
1517 1518
		if (fd >= 0)
			return fd;
1519 1520
		if (most_interesting_errno == ENOENT)
			most_interesting_errno = errno;
1521
	}
1522
	errno = most_interesting_errno;
1523 1524 1525
	return -1;
}

1526
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1527 1528
{
	void *map;
1529
	int fd;
1530

1531 1532 1533 1534
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1535

1536 1537
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
1538 1539 1540 1541 1542
			if (!*size) {
				/* mmap() is forbidden on empty files */
				error("object file %s is empty", sha1_file_name(sha1));
				return NULL;
			}
1543
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1544
		}
1545
		close(fd);
1546 1547 1548 1549
	}
	return map;
}

1550 1551
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1552
{
1553
	unsigned shift;
1554
	unsigned long size, c;
1555 1556 1557 1558 1559 1560 1561
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1562
		if (len <= used || bitsizeof(long) <= shift) {
1563
			error("bad object header");
1564 1565
			size = used = 0;
			break;
1566
		}
1567 1568 1569 1570 1571 1572 1573 1574
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

1575 1576 1577
static int unpack_sha1_short_header(git_zstream *stream,
				    unsigned char *map, unsigned long mapsize,
				    void *buffer, unsigned long bufsiz)
1578
{
1579 1580 1581 1582 1583
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1584 1585
	stream->avail_out = bufsiz;

1586
	git_inflate_init(stream);
1587
	return git_inflate(stream, 0);
1588 1589
}

1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605
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;
}

1606 1607 1608 1609 1610 1611
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;

1612 1613 1614
	status = unpack_sha1_short_header(stream, map, mapsize, buffer, bufsiz);
	if (status < Z_OK)
		return -1;
1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641

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

1642
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1643 1644
{
	int bytes = strlen(buffer) + 1;
1645
	unsigned char *buf = xmallocz(size);
1646
	unsigned long n;
1647
	int status = Z_OK;
1648

1649 1650 1651 1652 1653
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1654 1655 1656 1657
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1658
		 * expect no more output and set avail_out to zero,
1659 1660 1661 1662 1663 1664 1665 1666 1667
		 * 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.
		 */
1668 1669
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1670
		while (status == Z_OK)
1671
			status = git_inflate(stream, Z_FINISH);
1672
	}
1673
	if (status == Z_STREAM_END && !stream->avail_in) {
1674
		git_inflate_end(stream);
1675 1676 1677 1678 1679 1680 1681 1682 1683 1684
		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;
1685 1686 1687 1688 1689 1690 1691
}

/*
 * 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.
 */
1692 1693
static int parse_sha1_header_extended(const char *hdr, struct object_info *oi,
			       unsigned int flags)
1694
{
1695
	const char *type_buf = hdr;
1696
	unsigned long size;
1697
	int type, type_len = 0;
1698 1699

	/*
1700
	 * The type can be of any size but is followed by
1701
	 * a space.
1702 1703 1704
	 */
	for (;;) {
		char c = *hdr++;
1705 1706
		if (!c)
			return -1;
1707 1708
		if (c == ' ')
			break;
1709
		type_len++;
1710
	}
1711 1712 1713 1714 1715 1716

	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ä 已提交
1717
	 * we're obtaining the type using '--allow-unknown-type'
1718 1719 1720 1721 1722 1723 1724 1725
	 * option.
	 */
	if ((flags & LOOKUP_UNKNOWN_OBJECT) && (type < 0))
		type = 0;
	else if (type < 0)
		die("invalid object type");
	if (oi->typep)
		*oi->typep = type;
1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742

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

	if (oi->sizep)
		*oi->sizep = size;
1746 1747 1748 1749

	/*
	 * The length must be followed by a zero byte
	 */
1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760
	return *hdr ? -1 : type;
}

int parse_sha1_header(const char *hdr, unsigned long *sizep)
{
	struct object_info oi;

	oi.sizep = sizep;
	oi.typename = NULL;
	oi.typep = NULL;
	return parse_sha1_header_extended(hdr, &oi, LOOKUP_REPLACE_OBJECT);
1761 1762
}

1763
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1764
{
1765
	int ret;
1766
	git_zstream stream;
1767
	char hdr[8192];
1768

1769
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1770
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1771 1772
		return NULL;

1773
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1774 1775
}

N
Nicolas Pitre 已提交
1776 1777 1778 1779 1780 1781
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;
1782
	git_zstream stream;
N
Nicolas Pitre 已提交
1783 1784 1785 1786 1787 1788
	int st;

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

1789
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
1790 1791 1792
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
1793
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
1794 1795 1796
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
1797
	git_inflate_end(&stream);
1798 1799 1800 1801
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814

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

1815
static off_t get_delta_base(struct packed_git *p,
1816
				    struct pack_window **w_curs,
1817
				    off_t *curpos,
1818
				    enum object_type type,
1819
				    off_t delta_obj_offset)
1820
{
1821
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1822
	off_t base_offset;
1823

1824 1825 1826 1827 1828 1829
	/* 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.
	 */
1830
	if (type == OBJ_OFS_DELTA) {
1831 1832 1833 1834 1835
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1836
			if (!base_offset || MSB(base_offset, 7))
1837
				return 0;  /* overflow */
1838 1839 1840 1841
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
1842
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
1843
			return 0;  /* out of bound */
1844
		*curpos += used;
1845
	} else if (type == OBJ_REF_DELTA) {
1846 1847
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
1848
		*curpos += 20;
1849 1850
	} else
		die("I am totally screwed");
1851
	return base_offset;
1852 1853
}

1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885
/*
 * 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;
}

1886 1887 1888 1889
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
1890
{
1891
	unsigned char *base;
1892
	unsigned long left;
1893
	unsigned long used;
1894
	enum object_type type;
1895

1896
	/* use_pack() assures us we have [base, base + 20) available
1897
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
1898
	 * size that is assured.)  With our object header encoding
1899 1900 1901
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1902
	base = use_pack(p, w_curs, *curpos, &left);
1903 1904 1905 1906 1907
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
1908

1909
	return type;
1910 1911
}

1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929
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

1930 1931 1932 1933 1934
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)
1935
{
1936 1937 1938
	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;
1939

1940 1941
	while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
		off_t base_offset;
1942
		unsigned long size;
1943 1944 1945
		/* 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 已提交
1946
			ALLOC_ARRAY(poi_stack, poi_stack_alloc);
1947 1948 1949 1950 1951 1952
			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 */
1953
		base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1954 1955 1956
		if (!base_offset)
			goto unwind;
		curpos = obj_offset = base_offset;
1957
		type = unpack_object_header(p, w_curs, &curpos, &size);
1958 1959 1960 1961 1962 1963 1964 1965 1966 1967
		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;
		}
	}

1968
	switch (type) {
1969
	case OBJ_BAD:
1970 1971 1972 1973
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1974
		break;
1975
	default:
1976 1977 1978
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
1979
	}
1980 1981 1982 1983

out:
	if (poi_stack != small_poi_stack)
		free(poi_stack);
1984
	return type;
1985 1986 1987 1988 1989 1990 1991 1992 1993 1994

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

1997
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1998
			      struct object_info *oi)
1999 2000 2001 2002 2003 2004
{
	struct pack_window *w_curs = NULL;
	unsigned long size;
	off_t curpos = obj_offset;
	enum object_type type;

2005 2006 2007 2008
	/*
	 * We always get the representation type, but only convert it to
	 * a "real" type later if the caller is interested.
	 */
2009 2010
	type = unpack_object_header(p, &w_curs, &curpos, &size);

2011
	if (oi->sizep) {
2012 2013 2014 2015 2016 2017 2018 2019
		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;
			}
2020 2021
			*oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
			if (*oi->sizep == 0) {
2022 2023 2024 2025
				type = OBJ_BAD;
				goto out;
			}
		} else {
2026
			*oi->sizep = size;
2027 2028 2029
		}
	}

2030
	if (oi->disk_sizep) {
2031
		struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2032
		*oi->disk_sizep = revidx[1].offset - obj_offset;
2033 2034
	}

2035 2036 2037
	if (oi->typep) {
		*oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
		if (*oi->typep < 0) {
2038 2039 2040 2041
			type = OBJ_BAD;
			goto out;
		}
	}
2042

2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058
	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);
	}

2059 2060 2061 2062 2063
out:
	unuse_pack(&w_curs);
	return type;
}

2064
static void *unpack_compressed_entry(struct packed_git *p,
2065
				    struct pack_window **w_curs,
2066
				    off_t curpos,
2067
				    unsigned long size)
2068 2069
{
	int st;
2070
	git_zstream stream;
2071
	unsigned char *buffer, *in;
2072

2073 2074 2075
	buffer = xmallocz_gently(size);
	if (!buffer)
		return NULL;
2076 2077
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
2078
	stream.avail_out = size + 1;
2079

2080
	git_inflate_init(&stream);
2081
	do {
2082
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
2083
		stream.next_in = in;
2084
		st = git_inflate(&stream, Z_FINISH);
2085 2086
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
2087
		curpos += stream.next_in - in;
2088
	} while (st == Z_OK || st == Z_BUF_ERROR);
2089
	git_inflate_end(&stream);
2090 2091 2092 2093 2094 2095 2096 2097
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

2098 2099
#define MAX_DELTA_CACHE (256)

2100
static size_t delta_base_cached;
2101 2102 2103 2104 2105 2106

static struct delta_base_cache_lru_list {
	struct delta_base_cache_lru_list *prev;
	struct delta_base_cache_lru_list *next;
} delta_base_cache_lru = { &delta_base_cache_lru, &delta_base_cache_lru };

2107
static struct delta_base_cache_entry {
2108 2109
	struct delta_base_cache_lru_list lru;
	void *data;
2110 2111 2112 2113 2114 2115 2116 2117 2118 2119
	struct packed_git *p;
	off_t base_offset;
	unsigned long size;
	enum object_type type;
} delta_base_cache[MAX_DELTA_CACHE];

static unsigned long pack_entry_hash(struct packed_git *p, off_t base_offset)
{
	unsigned long hash;

2120
	hash = (unsigned long)(intptr_t)p + (unsigned long)base_offset;
2121
	hash += (hash >> 8) + (hash >> 16);
2122
	return hash % MAX_DELTA_CACHE;
2123 2124
}

2125 2126
static struct delta_base_cache_entry *
get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
2127 2128
{
	unsigned long hash = pack_entry_hash(p, base_offset);
2129 2130 2131 2132 2133 2134
	return delta_base_cache + hash;
}

static int eq_delta_base_cache_entry(struct delta_base_cache_entry *ent,
				     struct packed_git *p, off_t base_offset)
{
2135 2136 2137
	return (ent->data && ent->p == p && ent->base_offset == base_offset);
}

2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152
static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
{
	struct delta_base_cache_entry *ent;
	ent = get_delta_base_cache_entry(p, base_offset);
	return eq_delta_base_cache_entry(ent, p, base_offset);
}

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

2153
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2154
	unsigned long *base_size, enum object_type *type, int keep_cache)
2155
{
2156
	struct delta_base_cache_entry *ent;
2157 2158
	void *ret;

2159 2160 2161
	ent = get_delta_base_cache_entry(p, base_offset);

	if (!eq_delta_base_cache_entry(ent, p, base_offset))
2162
		return unpack_entry(p, base_offset, type, base_size);
2163

2164 2165 2166 2167 2168
	ret = ent->data;

	if (!keep_cache)
		clear_delta_base_cache_entry(ent);
	else
P
Pierre Habouzit 已提交
2169
		ret = xmemdupz(ent->data, ent->size);
2170 2171 2172
	*type = ent->type;
	*base_size = ent->size;
	return ret;
2173 2174
}

2175 2176 2177 2178 2179
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
2180 2181
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
2182 2183 2184 2185
		delta_base_cached -= ent->size;
	}
}

2186 2187 2188 2189 2190 2191 2192
void clear_delta_base_cache(void)
{
	unsigned long p;
	for (p = 0; p < MAX_DELTA_CACHE; p++)
		release_delta_base_cache(&delta_base_cache[p]);
}

2193 2194 2195
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
2196
	unsigned long hash = pack_entry_hash(p, base_offset);
2197
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
2198
	struct delta_base_cache_lru_list *lru;
2199

2200 2201
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
2202 2203 2204 2205 2206 2207

	for (lru = delta_base_cache_lru.next;
	     delta_base_cached > delta_base_cache_limit
	     && lru != &delta_base_cache_lru;
	     lru = lru->next) {
		struct delta_base_cache_entry *f = (void *)lru;
2208 2209 2210
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
2211 2212 2213 2214 2215 2216 2217
	for (lru = delta_base_cache_lru.next;
	     delta_base_cached > delta_base_cache_limit
	     && lru != &delta_base_cache_lru;
	     lru = lru->next) {
		struct delta_base_cache_entry *f = (void *)lru;
		release_delta_base_cache(f);
	}
2218

2219 2220 2221 2222 2223
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
2224 2225 2226 2227
	ent->lru.next = &delta_base_cache_lru;
	ent->lru.prev = delta_base_cache_lru.prev;
	delta_base_cache_lru.prev->next = &ent->lru;
	delta_base_cache_lru.prev = &ent->lru;
2228 2229
}

2230 2231 2232
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

2233 2234
static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
{
2235 2236 2237
	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);
2238 2239
}

2240 2241
int do_check_packed_object_crc;

2242 2243 2244 2245 2246 2247 2248
#define UNPACK_ENTRY_STACK_PREALLOC 64
struct unpack_entry_stack_ent {
	off_t obj_offset;
	off_t curpos;
	unsigned long size;
};

2249
void *unpack_entry(struct packed_git *p, off_t obj_offset,
2250
		   enum object_type *final_type, unsigned long *final_size)
2251
{
2252
	struct pack_window *w_curs = NULL;
2253
	off_t curpos = obj_offset;
2254 2255 2256 2257 2258 2259 2260
	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;
2261

2262
	write_pack_access_log(p, obj_offset);
2263

2264 2265 2266 2267 2268 2269
	/* PHASE 1: drill down to the innermost base object */
	for (;;) {
		off_t base_offset;
		int i;
		struct delta_base_cache_entry *ent;

2270 2271 2272 2273 2274 2275 2276 2277 2278 2279
		ent = get_delta_base_cache_entry(p, curpos);
		if (eq_delta_base_cache_entry(ent, p, curpos)) {
			type = ent->type;
			data = ent->data;
			size = ent->size;
			clear_delta_base_cache_entry(ent);
			base_from_cache = 1;
			break;
		}

2280 2281
		if (do_check_packed_object_crc && p->index_version > 1) {
			struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2282
			off_t len = revidx[1].offset - obj_offset;
2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311
			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 已提交
2312
			ALLOC_ARRAY(delta_stack, delta_stack_alloc);
2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323
			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;
2324 2325
	}

2326 2327
	/* PHASE 2: handle the base */
	switch (type) {
2328 2329
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
2330
		if (data)
2331
			die("BUG: unpack_entry: left loop at a valid delta");
2332
		break;
2333 2334 2335 2336
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2337 2338
		if (!base_from_cache)
			data = unpack_compressed_entry(p, &w_curs, curpos, size);
2339
		break;
2340
	default:
2341 2342
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403
		      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);
2404 2405 2406 2407 2408 2409 2410 2411 2412

		/*
		 * 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.
		 */
2413
		if (!data)
2414
			error("failed to apply delta");
2415

2416
		free(delta_data);
2417
	}
2418 2419 2420 2421

	*final_type = type;
	*final_size = size;

2422
	unuse_pack(&w_curs);
2423 2424 2425 2426

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

2427
	return data;
2428 2429
}

2430
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2431
					    uint32_t n)
2432
{
2433
	const unsigned char *index = p->index_data;
2434 2435 2436 2437 2438
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
2439
	if (n >= p->num_objects)
2440
		return NULL;
2441 2442 2443 2444 2445 2446 2447 2448 2449
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

2450 2451 2452 2453 2454 2455
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)
2456
		die(_("offset before start of pack index for %s (corrupt index?)"),
2457 2458 2459
		    p->pack_name);
	/* No need to check for underflow; .idx files must be at least 8 bytes */
	if (ptr >= end - 8)
2460
		die(_("offset beyond end of pack index for %s (truncated index?)"),
2461 2462 2463
		    p->pack_name);
}

N
Nicolas Pitre 已提交
2464
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476
{
	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;
2477
		check_pack_index_ptr(p, index);
2478 2479 2480
		return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
				   ntohl(*((uint32_t *)(index + 4)));
	}
2481 2482
}

2483
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
2484
				  struct packed_git *p)
2485
{
2486 2487
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
2488 2489 2490 2491 2492 2493
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

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

2495 2496 2497 2498 2499 2500
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
2501 2502 2503 2504
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
2505
	index += 4 * 256;
2506 2507
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2508 2509 2510 2511 2512 2513 2514 2515
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
2516
		printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527
		       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);
	}
2528 2529

	do {
2530
		unsigned mi = (lo + hi) / 2;
2531 2532 2533 2534 2535
		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 已提交
2536
		if (!cmp)
2537
			return nth_packed_object_offset(p, mi);
2538 2539 2540 2541 2542 2543 2544 2545
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

2546
int is_pack_valid(struct packed_git *p)
2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566
{
	/* 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);
}

2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590
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!
	 */
2591
	if (!is_pack_valid(p))
2592 2593 2594 2595 2596 2597 2598
		return 0;
	e->offset = offset;
	e->p = p;
	hashcpy(e->sha1, sha1);
	return 1;
}

2599 2600 2601 2602
/*
 * Iff a pack file contains the object named by sha1, return true and
 * store its location to e.
 */
2603
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2604
{
2605
	struct mru_entry *p;
N
Nicolas Pitre 已提交
2606

2607
	prepare_packed_git();
2608 2609
	if (!packed_git)
		return 0;
2610

2611 2612 2613
	for (p = packed_git_mru->head; p; p = p->next) {
		if (fill_pack_entry(sha1, e, p->item)) {
			mru_mark(packed_git_mru, p);
2614 2615
			return 1;
		}
2616
	}
2617 2618 2619
	return 0;
}

J
Junio C Hamano 已提交
2620
struct packed_git *find_sha1_pack(const unsigned char *sha1,
2621 2622 2623 2624 2625
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
2626
		if (find_pack_entry_one(sha1, p))
2627 2628 2629
			return p;
	}
	return NULL;
2630

2631 2632
}

2633
static int sha1_loose_object_info(const unsigned char *sha1,
2634 2635
				  struct object_info *oi,
				  int flags)
2636
{
2637 2638
	int status = 0;
	unsigned long mapsize;
2639
	void *map;
2640
	git_zstream stream;
N
Nicolas Pitre 已提交
2641
	char hdr[32];
2642
	struct strbuf hdrbuf = STRBUF_INIT;
2643

2644 2645 2646
	if (oi->delta_base_sha1)
		hashclr(oi->delta_base_sha1);

2647 2648
	/*
	 * If we don't care about type or size, then we don't
2649 2650 2651 2652 2653
	 * 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.
2654
	 */
2655
	if (!oi->typep && !oi->typename && !oi->sizep) {
2656 2657 2658 2659
		struct stat st;
		if (stat_sha1_file(sha1, &st) < 0)
			return -1;
		if (oi->disk_sizep)
2660
			*oi->disk_sizep = st.st_size;
2661 2662 2663
		return 0;
	}

2664
	map = map_sha1_file(sha1, &mapsize);
2665
	if (!map)
2666
		return -1;
2667 2668
	if (oi->disk_sizep)
		*oi->disk_sizep = mapsize;
2669 2670 2671 2672 2673
	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)
2674 2675
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
2676 2677 2678 2679 2680 2681 2682
	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)
2683
		status = error("unable to parse %s header", sha1_to_hex(sha1));
2684
	git_inflate_end(&stream);
2685
	munmap(map, mapsize);
2686
	if (status && oi->typep)
2687
		*oi->typep = status;
2688
	strbuf_release(&hdrbuf);
2689
	return 0;
2690 2691
}

2692
int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi, unsigned flags)
2693
{
2694
	struct cached_object *co;
2695
	struct pack_entry e;
2696
	int rtype;
2697
	enum object_type real_type;
2698
	const unsigned char *real = lookup_replace_object_extended(sha1, flags);
2699

2700
	co = find_cached_object(real);
2701
	if (co) {
2702 2703
		if (oi->typep)
			*(oi->typep) = co->type;
2704 2705
		if (oi->sizep)
			*(oi->sizep) = co->size;
2706 2707
		if (oi->disk_sizep)
			*(oi->disk_sizep) = 0;
2708 2709
		if (oi->delta_base_sha1)
			hashclr(oi->delta_base_sha1);
2710 2711
		if (oi->typename)
			strbuf_addstr(oi->typename, typename(co->type));
2712
		oi->whence = OI_CACHED;
2713
		return 0;
2714 2715
	}

2716
	if (!find_pack_entry(real, &e)) {
2717
		/* Most likely it's a loose object. */
2718
		if (!sha1_loose_object_info(real, oi, flags)) {
2719
			oi->whence = OI_LOOSE;
2720
			return 0;
2721
		}
2722 2723

		/* Not a loose object; someone else may have just packed it. */
2724
		reprepare_packed_git();
2725
		if (!find_pack_entry(real, &e))
2726
			return -1;
2727
	}
2728

2729 2730 2731 2732 2733 2734 2735
	/*
	 * 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;

2736
	rtype = packed_object_info(e.p, e.offset, oi);
2737
	if (rtype < 0) {
2738
		mark_bad_packed_object(e.p, real);
2739 2740
		if (oi->typep == &real_type)
			oi->typep = NULL;
2741
		return sha1_object_info_extended(real, oi, 0);
2742 2743
	} else if (in_delta_base_cache(e.p, e.offset)) {
		oi->whence = OI_DBCACHED;
2744 2745 2746 2747 2748 2749
	} 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);
2750
	}
2751 2752 2753 2754
	if (oi->typename)
		strbuf_addstr(oi->typename, typename(*oi->typep));
	if (oi->typep == &real_type)
		oi->typep = NULL;
2755

2756
	return 0;
2757 2758
}

2759
/* returns enum object_type or negative */
2760 2761
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
{
2762
	enum object_type type;
R
Ramsay Jones 已提交
2763
	struct object_info oi = {NULL};
2764

2765
	oi.typep = &type;
2766
	oi.sizep = sizep;
2767
	if (sha1_object_info_extended(sha1, &oi, LOOKUP_REPLACE_OBJECT) < 0)
2768 2769
		return -1;
	return type;
2770 2771
}

2772 2773
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
2774 2775
{
	struct pack_entry e;
2776
	void *data;
2777

2778
	if (!find_pack_entry(sha1, &e))
2779
		return NULL;
2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790
	data = cache_or_unpack_entry(e.p, e.offset, size, type, 1);
	if (!data) {
		/*
		 * We're probably in deep shit, but let's try to fetch
		 * the required object anyway from another pack or loose.
		 * This should happen only in the presence of a corrupted
		 * pack, and is better than failing outright.
		 */
		error("failed to read object %s at offset %"PRIuMAX" from %s",
		      sha1_to_hex(sha1), (uintmax_t)e.offset, e.p->pack_name);
		mark_bad_packed_object(e.p, sha1);
2791
		data = read_object(sha1, type, size);
2792 2793
	}
	return data;
2794 2795
}

2796 2797
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2798 2799 2800
{
	struct cached_object *co;

2801
	hash_sha1_file(buf, len, typename(type), sha1);
2802 2803
	if (has_sha1_file(sha1) || find_cached_object(sha1))
		return 0;
2804
	ALLOC_GROW(cached_objects, cached_object_nr + 1, cached_object_alloc);
2805 2806
	co = &cached_objects[cached_object_nr++];
	co->size = len;
2807
	co->type = type;
J
Junio C Hamano 已提交
2808 2809
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
2810 2811 2812 2813
	hashcpy(co->sha1, sha1);
	return 0;
}

2814 2815
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size)
2816 2817 2818
{
	unsigned long mapsize;
	void *map, *buf;
2819 2820 2821 2822
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
2823
		*type = co->type;
2824
		*size = co->size;
P
Pierre Habouzit 已提交
2825
		return xmemdupz(co->buf, co->size);
2826
	}
2827

2828 2829 2830
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
2831
	map = map_sha1_file(sha1, &mapsize);
2832
	if (map) {
2833
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2834 2835 2836
		munmap(map, mapsize);
		return buf;
	}
2837
	reprepare_packed_git();
2838
	return read_packed_sha1(sha1, type, size);
2839 2840
}

2841 2842 2843 2844 2845
/*
 * 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.
 */
2846 2847 2848 2849
void *read_sha1_file_extended(const unsigned char *sha1,
			      enum object_type *type,
			      unsigned long *size,
			      unsigned flag)
2850
{
2851
	void *data;
2852
	const struct packed_git *p;
2853
	const unsigned char *repl = lookup_replace_object_extended(sha1, flag);
2854

2855 2856
	errno = 0;
	data = read_object(repl, type, size);
2857
	if (data)
2858
		return data;
2859

2860
	if (errno && errno != ENOENT)
2861 2862
		die_errno("failed to read object %s", sha1_to_hex(sha1));

2863
	/* die if we replaced an object with one that does not exist */
2864
	if (repl != sha1)
2865 2866 2867
		die("replacement %s not found for %s",
		    sha1_to_hex(repl), sha1_to_hex(sha1));

2868
	if (has_loose_object(repl)) {
2869 2870
		const char *path = sha1_file_name(sha1);

2871 2872
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
2873
	}
2874

2875 2876 2877
	if ((p = has_packed_and_bad(repl)) != NULL)
		die("packed object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), p->pack_name);
2878

2879
	return NULL;
2880 2881
}

2882
void *read_object_with_reference(const unsigned char *sha1,
2883
				 const char *required_type_name,
2884 2885
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
2886
{
2887
	enum object_type type, required_type;
2888 2889
	void *buffer;
	unsigned long isize;
2890
	unsigned char actual_sha1[20];
2891

2892
	required_type = type_from_string(required_type_name);
2893
	hashcpy(actual_sha1, sha1);
2894 2895 2896
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
2897

2898
		buffer = read_sha1_file(actual_sha1, &type, &isize);
2899 2900
		if (!buffer)
			return NULL;
2901
		if (type == required_type) {
2902 2903
			*size = isize;
			if (actual_sha1_return)
2904
				hashcpy(actual_sha1_return, actual_sha1);
2905 2906 2907
			return buffer;
		}
		/* Handle references */
2908
		else if (type == OBJ_COMMIT)
2909
			ref_type = "tree ";
2910
		else if (type == OBJ_TAG)
2911 2912 2913 2914 2915 2916
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
2917

2918 2919
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
2920
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2921 2922 2923
			free(buffer);
			return NULL;
		}
2924
		free(buffer);
2925 2926
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
2927 2928 2929
	}
}

N
Nicolas Pitre 已提交
2930
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
2931
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
2932
                                    char *hdr, int *hdrlen)
2933
{
2934
	git_SHA_CTX c;
2935 2936

	/* Generate the header */
2937
	*hdrlen = xsnprintf(hdr, *hdrlen, "%s %lu", type, len)+1;
2938 2939

	/* Sha1.. */
2940 2941 2942 2943
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
2944 2945
}

2946
/*
2947
 * Move the just written object into its final resting place.
2948
 */
2949
int finalize_object_file(const char *tmpfile, const char *filename)
2950
{
2951
	int ret = 0;
2952

2953
	if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2954 2955
		goto try_rename;
	else if (link(tmpfile, filename))
2956
		ret = errno;
2957 2958 2959 2960 2961 2962 2963 2964 2965

	/*
	 * 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.
	 *
2966
	 * When this succeeds, we just return.  We have nothing
2967 2968 2969
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
2970
	try_rename:
2971
		if (!rename(tmpfile, filename))
2972
			goto out;
2973
		ret = errno;
2974
	}
2975
	unlink_or_warn(tmpfile);
2976 2977
	if (ret) {
		if (ret != EEXIST) {
2978
			return error_errno("unable to write sha1 filename %s", filename);
2979 2980 2981 2982
		}
		/* FIXME!!! Collision check here ? */
	}

2983
out:
2984
	if (adjust_shared_perm(filename))
2985
		return error("unable to set permission to '%s'", filename);
2986 2987 2988
	return 0;
}

L
Linus Torvalds 已提交
2989 2990
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2991
	if (write_in_full(fd, buf, len) < 0)
2992
		return error_errno("file write error");
L
Linus Torvalds 已提交
2993 2994 2995
	return 0;
}

N
Nicolas Pitre 已提交
2996
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2997 2998
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2999
	char hdr[32];
3000
	int hdrlen = sizeof(hdr);
R
Rene Scharfe 已提交
3001 3002 3003 3004
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

3005 3006 3007
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
3008 3009
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
3010
	if (close(fd) != 0)
3011
		die_errno("error when closing sha1 file");
3012 3013
}

3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029
/* 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 已提交
3030
static int create_tmpfile(struct strbuf *tmp, const char *filename)
3031 3032 3033
{
	int fd, dirlen = directory_size(filename);

J
Jeff King 已提交
3034 3035 3036 3037
	strbuf_reset(tmp);
	strbuf_add(tmp, filename, dirlen);
	strbuf_addstr(tmp, "tmp_obj_XXXXXX");
	fd = git_mkstemp_mode(tmp->buf, 0444);
3038
	if (fd < 0 && dirlen && errno == ENOENT) {
J
Jeff King 已提交
3039 3040 3041 3042 3043 3044 3045 3046 3047
		/*
		 * 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)
3048
			return -1;
J
Jeff King 已提交
3049
		if (adjust_shared_perm(tmp->buf))
3050 3051 3052
			return -1;

		/* Try again */
J
Jeff King 已提交
3053 3054
		strbuf_addstr(tmp, "/tmp_obj_XXXXXX");
		fd = git_mkstemp_mode(tmp->buf, 0444);
3055 3056 3057 3058
	}
	return fd;
}

3059
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
3060
			      const void *buf, unsigned long len, time_t mtime)
3061
{
3062
	int fd, ret;
3063
	unsigned char compressed[4096];
3064
	git_zstream stream;
3065 3066
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
J
Jeff King 已提交
3067
	static struct strbuf tmp_file = STRBUF_INIT;
3068
	const char *filename = sha1_file_name(sha1);
3069

J
Jeff King 已提交
3070
	fd = create_tmpfile(&tmp_file, filename);
3071
	if (fd < 0) {
3072
		if (errno == EACCES)
3073
			return error("insufficient permission for adding an object to repository database %s", get_object_directory());
3074
		else
3075
			return error_errno("unable to create temporary file");
3076 3077
	}

3078
	/* Set it up */
3079
	git_deflate_init(&stream, zlib_compression_level);
3080
	stream.next_out = compressed;
3081
	stream.avail_out = sizeof(compressed);
3082
	git_SHA1_Init(&c);
3083 3084

	/* First header.. */
N
Nicolas Pitre 已提交
3085
	stream.next_in = (unsigned char *)hdr;
3086
	stream.avail_in = hdrlen;
3087 3088
	while (git_deflate(&stream, 0) == Z_OK)
		; /* nothing */
3089
	git_SHA1_Update(&c, hdr, hdrlen);
3090 3091

	/* Then the data itself.. */
3092
	stream.next_in = (void *)buf;
3093
	stream.avail_in = len;
3094
	do {
3095
		unsigned char *in0 = stream.next_in;
3096
		ret = git_deflate(&stream, Z_FINISH);
3097
		git_SHA1_Update(&c, in0, stream.next_in - in0);
3098 3099 3100 3101 3102 3103
		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);

3104 3105
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
3106
	ret = git_deflate_end_gently(&stream);
3107 3108
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
3109 3110 3111
	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));
3112

3113
	close_sha1_file(fd);
3114

3115 3116 3117 3118
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
J
Jeff King 已提交
3119
		if (utime(tmp_file.buf, &utb) < 0)
3120
			warning_errno("failed utime() on %s", tmp_file.buf);
3121 3122
	}

J
Jeff King 已提交
3123
	return finalize_object_file(tmp_file.buf, filename);
3124
}
3125

3126 3127 3128 3129 3130 3131 3132 3133
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;
3134 3135 3136 3137 3138 3139 3140 3141
	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;
3142 3143
}

3144
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *sha1)
3145 3146
{
	char hdr[32];
3147
	int hdrlen = sizeof(hdr);
3148 3149 3150 3151 3152

	/* 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);
3153
	if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3154 3155 3156 3157
		return 0;
	return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
}

3158 3159 3160 3161 3162 3163 3164
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 */
3165 3166
	hdrlen = strlen(type) + 32;
	header = xmalloc(hdrlen);
3167 3168 3169 3170
	write_sha1_file_prepare(buf, len, type, sha1, header, &hdrlen);

	if (!(flags & HASH_WRITE_OBJECT))
		goto cleanup;
J
Junio C Hamano 已提交
3171
	if (freshen_packed_object(sha1) || freshen_loose_object(sha1))
3172 3173 3174 3175 3176 3177 3178 3179
		goto cleanup;
	status = write_loose_object(sha1, header, hdrlen, buf, len, 0);

cleanup:
	free(header);
	return status;
}

3180 3181 3182 3183 3184 3185 3186
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;
3187
	int ret;
3188

3189
	if (has_loose_object(sha1))
3190 3191 3192 3193
		return 0;
	buf = read_packed_sha1(sha1, &type, &len);
	if (!buf)
		return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
3194
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(type), len) + 1;
3195 3196 3197 3198
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
3199 3200
}

3201 3202 3203 3204 3205 3206 3207 3208
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

3209 3210 3211 3212 3213 3214
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

3215
int has_sha1_file_with_flags(const unsigned char *sha1, int flags)
3216
{
3217 3218
	struct pack_entry e;

3219
	if (find_pack_entry(sha1, &e))
3220
		return 1;
3221 3222
	if (has_loose_object(sha1))
		return 1;
3223 3224
	if (flags & HAS_SHA1_QUICK)
		return 0;
3225 3226
	reprepare_packed_git();
	return find_pack_entry(sha1, &e);
3227 3228 3229 3230 3231
}

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

3234 3235 3236 3237 3238
int has_object_file_with_flags(const struct object_id *oid, int flags)
{
	return has_sha1_file_with_flags(oid->hash, flags);
}

3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266
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");
}

3267
static int index_mem(unsigned char *sha1, void *buf, size_t size,
3268 3269
		     enum object_type type,
		     const char *path, unsigned flags)
3270
{
L
Linus Torvalds 已提交
3271
	int ret, re_allocated = 0;
3272
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
3273

3274
	if (!type)
3275
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
3276 3277 3278 3279

	/*
	 * Convert blobs to git internal format
	 */
3280
	if ((type == OBJ_BLOB) && path) {
3281
		struct strbuf nbuf = STRBUF_INIT;
3282
		if (convert_to_git(path, buf, size, &nbuf,
3283
				   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3284
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
3285 3286 3287
			re_allocated = 1;
		}
	}
3288
	if (flags & HASH_FORMAT_CHECK) {
3289 3290 3291 3292 3293 3294 3295
		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 已提交
3296

3297
	if (write_object)
3298
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
3299
	else
3300
		ret = hash_sha1_file(buf, size, typename(type), sha1);
3301
	if (re_allocated)
L
Linus Torvalds 已提交
3302
		free(buf);
3303 3304 3305
	return ret;
}

3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328
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;
}

3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342
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;
}

3343 3344
#define SMALL_FILE_SIZE (32*1024)

3345 3346 3347
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
3348 3349 3350
{
	int ret;

3351
	if (!size) {
3352
		ret = index_mem(sha1, "", size, type, path, flags);
3353 3354 3355
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
3356
			ret = index_mem(sha1, buf, size, type, path, flags);
3357
		else
3358
			ret = error_errno("short read");
3359
		free(buf);
3360
	} else {
3361
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3362
		ret = index_mem(sha1, buf, size, type, path, flags);
3363
		munmap(buf, size);
3364
	}
3365 3366 3367
	return ret;
}

3368
/*
3369 3370
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
3371 3372 3373 3374
 *
 * 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
3375 3376 3377 3378 3379 3380 3381
 * (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.
3382 3383 3384 3385 3386
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
3387
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
3388 3389
}

3390 3391 3392 3393 3394
int index_fd(unsigned char *sha1, int fd, struct stat *st,
	     enum object_type type, const char *path, unsigned flags)
{
	int ret;

3395 3396 3397 3398
	/*
	 * Call xsize_t() only when needed to avoid potentially unnecessary
	 * die() for large files.
	 */
3399 3400 3401
	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))
3402
		ret = index_pipe(sha1, fd, type, path, flags);
3403
	else if (st->st_size <= big_file_threshold || type != OBJ_BLOB ||
3404
		 (path && would_convert_to_git(path)))
3405 3406
		ret = index_core(sha1, fd, xsize_t(st->st_size), type, path,
				 flags);
3407
	else
3408 3409
		ret = index_stream(sha1, fd, xsize_t(st->st_size), type, path,
				   flags);
3410
	close(fd);
3411
	return ret;
J
Junio C Hamano 已提交
3412
}
3413

3414
int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3415 3416
{
	int fd;
3417
	struct strbuf sb = STRBUF_INIT;
3418 3419 3420 3421 3422

	switch (st->st_mode & S_IFMT) {
	case S_IFREG:
		fd = open(path, O_RDONLY);
		if (fd < 0)
3423
			return error_errno("open(\"%s\")", path);
3424
		if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
3425 3426 3427 3428
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
3429 3430
		if (strbuf_readlink(&sb, path, st->st_size))
			return error_errno("readlink(\"%s\")", path);
3431
		if (!(flags & HASH_WRITE_OBJECT))
3432 3433
			hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
		else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
3434 3435
			return error("%s: failed to insert into database",
				     path);
3436
		strbuf_release(&sb);
3437
		break;
3438 3439
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
3440 3441 3442 3443 3444
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
3445 3446 3447

int read_pack_header(int fd, struct pack_header *header)
{
3448 3449 3450 3451
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

3452 3453 3454 3455 3456 3457 3458 3459
	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 已提交
3460 3461 3462 3463 3464 3465 3466 3467 3468 3469

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));
}
3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485

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;
3486
		return error_errno("unable to open %s", path->buf);
3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517
	}

	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;
		}
	}
3518
	closedir(dir);
3519

3520
	strbuf_setlen(path, baselen);
3521 3522 3523 3524 3525 3526
	if (!r && subdir_cb)
		r = subdir_cb(subdir_nr, path->buf, data);

	return r;
}

3527
int for_each_loose_file_in_objdir_buf(struct strbuf *path,
3528 3529 3530 3531 3532
			    each_loose_object_fn obj_cb,
			    each_loose_cruft_fn cruft_cb,
			    each_loose_subdir_fn subdir_cb,
			    void *data)
{
3533
	size_t baselen = path->len;
3534 3535 3536 3537
	int r = 0;
	int i;

	for (i = 0; i < 256; i++) {
3538 3539
		strbuf_addf(path, "/%02x", i);
		r = for_each_file_in_obj_subdir(i, path, obj_cb, cruft_cb,
3540
						subdir_cb, data);
3541
		strbuf_setlen(path, baselen);
3542 3543 3544 3545
		if (r)
			break;
	}

3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560
	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);
3561
	strbuf_release(&buf);
3562

3563 3564
	return r;
}
3565 3566 3567 3568 3569 3570 3571 3572 3573 3574

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;
3575 3576 3577 3578 3579 3580 3581 3582 3583 3584
	struct strbuf buf = STRBUF_INIT;
	int r;

	/* copy base not including trailing '/' */
	strbuf_add(&buf, alt->base, alt->name - alt->base - 1);
	r = for_each_loose_file_in_objdir_buf(&buf,
					      data->cb, NULL, NULL,
					      data->data);
	strbuf_release(&buf);
	return r;
3585 3586
}

3587
int for_each_loose_object(each_loose_object_fn cb, void *data, unsigned flags)
3588 3589 3590 3591 3592 3593 3594 3595 3596
{
	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;

3597 3598 3599
	if (flags & FOR_EACH_OBJECT_LOCAL_ONLY)
		return 0;

3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623
	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;
}

3624
int for_each_packed_object(each_packed_object_fn cb, void *data, unsigned flags)
3625 3626 3627
{
	struct packed_git *p;
	int r = 0;
3628
	int pack_errors = 0;
3629 3630 3631

	prepare_packed_git();
	for (p = packed_git; p; p = p->next) {
3632 3633
		if ((flags & FOR_EACH_OBJECT_LOCAL_ONLY) && !p->pack_local)
			continue;
3634 3635 3636 3637
		if (open_pack_index(p)) {
			pack_errors = 1;
			continue;
		}
3638 3639 3640 3641
		r = for_each_object_in_pack(p, cb, data);
		if (r)
			break;
	}
3642
	return r ? r : pack_errors;
3643
}