sha1_file.c 90.2 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*
 * GIT - The information manager from hell
 *
 * Copyright (C) Linus Torvalds, 2005
 *
 * This handles basic git sha1 object files - packing, unpacking,
 * creation etc.
 */
#include "cache.h"
10
#include "string-list.h"
11
#include "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

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

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

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

40 41 42 43 44 45 46 47 48 49 50 51 52 53 54
/*
 * 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 = {
55
	EMPTY_TREE_SHA1_BIN_LITERAL,
56 57 58 59 60
	OBJ_TREE,
	"",
	0
};

61 62 63 64 65 66
/*
 * A pointer to the last packed_git in which an object was found.
 * When an object is sought, we look in this packfile first, because
 * objects that are looked up at similar times are often in the same
 * packfile as one another.
 */
67 68
static struct packed_git *last_found_pack;

69 70 71 72 73 74 75 76 77 78 79 80 81 82
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;
}

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

112
enum scld_error safe_create_leading_directories(char *path)
113
{
114
	char *next_component = path + offset_1st_component(path);
115
	enum scld_error ret = SCLD_OK;
116

117
	while (ret == SCLD_OK && next_component) {
118
		struct stat st;
119
		char *slash = next_component, slash_character;
120

121 122 123 124
		while (*slash && !is_dir_sep(*slash))
			slash++;

		if (!*slash)
125
			break;
126

127
		next_component = slash + 1;
128
		while (is_dir_sep(*next_component))
129
			next_component++;
130
		if (!*next_component)
131
			break;
132

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

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

173 174 175 176 177 178 179 180 181 182 183 184
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];
	}
}

185
const char *sha1_file_name(const unsigned char *sha1)
186
{
187 188 189
	static char buf[PATH_MAX];
	const char *objdir;
	int len;
190

191 192 193 194 195 196 197 198 199 200 201 202
	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;
203 204
}

205 206 207 208 209
/*
 * 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".
 */
210
static char *sha1_get_pack_name(const unsigned char *sha1,
J
Junio C Hamano 已提交
211
				char **name, char **base, const char *which)
212 213
{
	static const char hex[] = "0123456789abcdef";
214
	char *buf;
215 216
	int i;

217
	if (!*base) {
218 219
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
220
		*base = xmalloc(len + 60);
J
Junio C Hamano 已提交
221 222
		sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
			sha1_file_directory, which);
223
		*name = *base + len + 11;
224 225
	}

226
	buf = *name;
227 228 229 230 231 232

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

234
	return *base;
235 236
}

237
char *sha1_pack_name(const unsigned char *sha1)
238
{
239
	static char *name, *base;
240

J
Junio C Hamano 已提交
241
	return sha1_get_pack_name(sha1, &name, &base, "pack");
242
}
243

244 245 246
char *sha1_pack_index_name(const unsigned char *sha1)
{
	static char *name, *base;
J
Junio C Hamano 已提交
247

J
Junio C Hamano 已提交
248
	return sha1_get_pack_name(sha1, &name, &base, "idx");
249 250
}

251 252
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
253

J
Junio C Hamano 已提交
254 255
/*
 * Prepare alternate object database registry.
256 257 258 259 260
 *
 * 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,
261 262
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
263 264 265 266 267
 * 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 已提交
268
 */
269 270
static int link_alt_odb_entry(const char *entry, const char *relative_base,
	int depth, const char *normalized_objdir)
271
{
M
Martin Waitz 已提交
272 273
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
274 275
	int pfxlen, entlen;
	struct strbuf pathbuf = STRBUF_INIT;
276

277
	if (!is_absolute_path(entry) && relative_base) {
278 279
		strbuf_addstr(&pathbuf, real_path(relative_base));
		strbuf_addch(&pathbuf, '/');
M
Martin Waitz 已提交
280
	}
281
	strbuf_addstr(&pathbuf, entry);
M
Martin Waitz 已提交
282

283 284 285 286 287 288 289 290 291 292 293 294 295 296 297
	normalize_path_copy(pathbuf.buf, pathbuf.buf);

	pfxlen = strlen(pathbuf.buf);

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

	entlen = pfxlen + 43; /* '/' + 2 hex + '/' + 38 hex + NUL */
	ent = xmalloc(sizeof(*ent) + entlen);
	memcpy(ent->base, pathbuf.buf, pfxlen);
	strbuf_release(&pathbuf);
M
Martin Waitz 已提交
298 299 300 301 302 303

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

	/* Detect cases where alternate disappeared */
304
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
305 306 307 308 309 310 311 312 313 314 315
		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) {
316 317
		if (pfxlen == alt->name - alt->base - 1 &&
		    !memcmp(ent->base, alt->base, pfxlen)) {
M
Martin Waitz 已提交
318 319 320 321
			free(ent);
			return -1;
		}
	}
322
	if (!strcmp_icase(ent->base, normalized_objdir)) {
M
Martin Waitz 已提交
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
		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;
}

340
static void link_alt_odb_entries(const char *alt, int len, int sep,
M
Martin Waitz 已提交
341 342
				 const char *relative_base, int depth)
{
343 344 345
	struct string_list entries = STRING_LIST_INIT_NODUP;
	char *alt_copy;
	int i;
346
	struct strbuf objdirbuf = STRBUF_INIT;
M
Martin Waitz 已提交
347 348 349 350 351 352 353

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

J
Junio C Hamano 已提交
354
	strbuf_add_absolute_path(&objdirbuf, get_object_directory());
355 356
	normalize_path_copy(objdirbuf.buf, objdirbuf.buf);

357
	alt_copy = xmemdupz(alt, len);
358 359 360 361
	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] == '#')
362
			continue;
363 364 365 366
		if (!is_absolute_path(entry) && depth) {
			error("%s: ignoring relative alternate object store %s",
					relative_base, entry);
		} else {
367
			link_alt_odb_entry(entry, relative_base, depth, objdirbuf.buf);
368 369
		}
	}
370 371
	string_list_clear(&entries, 0);
	free(alt_copy);
372
	strbuf_release(&objdirbuf);
373 374
}

375
void read_info_alternates(const char * relative_base, int depth)
376
{
377
	char *map;
378
	size_t mapsz;
379
	struct stat st;
380
	char *path;
M
Martin Waitz 已提交
381
	int fd;
382

383
	path = xstrfmt("%s/info/alternates", relative_base);
384
	fd = git_open_noatime(path);
385
	free(path);
386 387 388 389
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
390
		return;
391
	}
392 393
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
394 395
	close(fd);

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

398
	munmap(map, mapsz);
399 400
}

401 402 403
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
	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;

		while (strbuf_getline(&line, in, '\n') != EOF) {
			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);
444 445
}

446
int foreach_alt_odb(alt_odb_fn fn, void *cb)
447 448
{
	struct alternate_object_database *ent;
449
	int r = 0;
450 451

	prepare_alt_odb();
452 453 454 455 456 457
	for (ent = alt_odb_list; ent; ent = ent->next) {
		r = fn(ent, cb);
		if (r)
			break;
	}
	return r;
458 459
}

M
Martin Waitz 已提交
460 461
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
462
	const char *alt;
M
Martin Waitz 已提交
463

S
Shawn O. Pearce 已提交
464 465 466
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
467 468 469 470
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
471
	link_alt_odb_entries(alt, strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
472 473 474 475

	read_info_alternates(get_object_directory(), 0);
}

476
/* Returns 1 if we have successfully freshened the file, 0 otherwise. */
477
static int freshen_file(const char *fn)
478
{
479 480 481
	struct utimbuf t;
	t.actime = t.modtime = time(NULL);
	return !utime(fn, &t);
482
}
483

484 485 486 487 488 489 490
/*
 * 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).
 */
491 492 493 494
static int check_and_freshen_file(const char *fn, int freshen)
{
	if (access(fn, F_OK))
		return 0;
495
	if (freshen && !freshen_file(fn))
496 497 498 499 500 501 502 503 504 505
		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)
506 507
{
	struct alternate_object_database *alt;
508
	prepare_alt_odb();
509
	for (alt = alt_odb_list; alt; alt = alt->next) {
510
		fill_sha1_path(alt->name, sha1);
511
		if (check_and_freshen_file(alt->base, freshen))
512
			return 1;
513
	}
514
	return 0;
515 516
}

517 518 519 520 521 522 523 524 525 526 527
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);
}

528 529
static int has_loose_object(const unsigned char *sha1)
{
530
	return check_and_freshen(sha1, 0);
531 532
}

533
static unsigned int pack_used_ctr;
534 535 536
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
537 538
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
539
static size_t peak_pack_mapped;
540
static size_t pack_mapped;
541
struct packed_git *packed_git;
542

J
Junio C Hamano 已提交
543
void pack_report(void)
544 545
{
	fprintf(stderr,
546 547 548
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
549 550 551
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
552 553 554 555
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
556 557
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
558 559 560
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
561
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
562 563
}

564 565 566 567 568 569
/*
 * 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)
570 571
{
	void *idx_map;
572
	struct pack_idx_header *hdr;
573
	size_t idx_size;
574
	uint32_t version, nr, i, *index;
575
	int fd = git_open_noatime(path);
576
	struct stat st;
577

578 579 580 581 582 583
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
584
	idx_size = xsize_t(st.st_size);
585 586 587 588
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
589
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
590 591
	close(fd);

592 593
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
594 595 596
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
597
			return error("index file %s is version %"PRIu32
598 599 600 601 602 603
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
604

605
	nr = 0;
606
	index = idx_map;
607 608
	if (version > 1)
		index += 2;  /* skip index header */
609
	for (i = 0; i < 256; i++) {
610
		uint32_t n = ntohl(index[i]);
611 612
		if (n < nr) {
			munmap(idx_map, idx_size);
613
			return error("non-monotonic index %s", path);
614
		}
615 616 617
		nr = n;
	}

618 619 620 621 622 623 624 625 626 627
	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);
628
			return error("wrong index v1 file size in %s", path);
629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
		}
	} 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 已提交
645 646 647 648
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
649
			munmap(idx_map, idx_size);
650
			return error("wrong index v2 file size in %s", path);
651
		}
652 653 654 655 656 657 658 659 660
		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);
661
		}
662
	}
663

664
	p->index_version = version;
665 666
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
667
	p->num_objects = nr;
668 669 670
	return 0;
}

671
int open_pack_index(struct packed_git *p)
672 673
{
	char *idx_name;
674
	size_t len;
675 676 677 678 679
	int ret;

	if (p->index_data)
		return 0;

680 681 682
	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);
683 684 685 686 687
	ret = check_packed_git_idx(idx_name, p);
	free(idx_name);
	return ret;
}

688 689 690 691
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
692
{
693 694 695 696 697 698 699 700
	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;
701 702
			}
		}
703
		w_l = w;
704
	}
705 706
}

707
static int unuse_one_window(struct packed_git *current)
708 709 710 711 712 713 714 715
{
	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);
716 717 718 719 720
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
721
		else
722 723
			lru_p->windows = lru_w->next;
		free(lru_w);
724
		pack_open_windows--;
725 726 727
		return 1;
	}
	return 0;
728 729
}

730
void release_pack_memory(size_t need)
731 732
{
	size_t cur = pack_mapped;
733
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL))
734 735 736
		; /* nothing */
}

737 738 739 740 741 742 743 744 745 746 747 748 749
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 已提交
750 751
void *xmmap_gently(void *start, size_t length,
		  int prot, int flags, int fd, off_t offset)
752
{
753 754 755 756
	void *ret;

	mmap_limit_check(length);
	ret = mmap(start, length, prot, flags, fd, offset);
757 758 759
	if (ret == MAP_FAILED) {
		if (!length)
			return NULL;
760
		release_pack_memory(length);
761 762 763 764 765
		ret = mmap(start, length, prot, flags, fd, offset);
	}
	return ret;
}

J
Jeff King 已提交
766 767 768 769 770
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 已提交
771
		die_errno("mmap failed");
J
Jeff King 已提交
772 773 774
	return ret;
}

775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790
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);
	}
}

791 792 793 794 795 796 797 798 799 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 867
/*
 * The LRU pack is the one with the oldest MRU window, preferring packs
 * with no used windows, or the oldest mtime if it has no windows allocated.
 */
static void find_lru_pack(struct packed_git *p, struct packed_git **lru_p, struct pack_window **mru_w, int *accept_windows_inuse)
{
	struct pack_window *w, *this_mru_w;
	int has_windows_inuse = 0;

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

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

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

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

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

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

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

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

	return 0;
}

868
void unuse_pack(struct pack_window **w_cursor)
869
{
870 871 872 873 874
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
875 876
}

877 878 879 880 881 882 883 884
void close_pack_index(struct packed_git *p)
{
	if (p->index_data) {
		munmap((void *)p->index_data, p->index_size);
		p->index_data = NULL;
	}
}

885 886 887 888 889
/*
 * This is used by git-repack in case a newly created pack happens to
 * contain the same set of objects as an existing one.  In that case
 * the resulting file might be different even if its name would be the
 * same.  It is best to close any reference to the old pack before it is
J
Justin Lebar 已提交
890
 * replaced on disk.  Of course no index pointers or windows for given pack
891 892 893 894 895 896 897 898 899 900 901
 * must subsist at this point.  If ever objects from this pack are requested
 * again, the new version of the pack will be reinitialized through
 * reprepare_packed_git().
 */
void free_pack_by_name(const char *pack_name)
{
	struct packed_git *p, **pp = &packed_git;

	while (*pp) {
		p = *pp;
		if (strcmp(pack_name, p->pack_name) == 0) {
902
			clear_delta_base_cache();
903
			close_pack_windows(p);
904
			if (p->pack_fd != -1) {
905
				close(p->pack_fd);
906 907
				pack_open_fds--;
			}
908
			close_pack_index(p);
909 910
			free(p->bad_object_sha1);
			*pp = p->next;
911 912
			if (last_found_pack == p)
				last_found_pack = NULL;
913 914 915 916 917 918 919
			free(p);
			return;
		}
		pp = &p->next;
	}
}

920 921 922
static unsigned int get_max_fd_limit(void)
{
#ifdef RLIMIT_NOFILE
923 924
	{
		struct rlimit lim;
925

926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952
		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
953

954
#ifdef OPEN_MAX
955 956 957 958 959 960
	return OPEN_MAX;
#else
	return 1; /* see the caller ;-) */
#endif
}

961 962 963 964 965
/*
 * 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)
966
{
967 968 969 970
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
971
	long fd_flag;
972

973 974 975
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

976
	if (!pack_max_fds) {
977
		unsigned int max_fds = get_max_fd_limit();
978 979 980 981 982 983 984 985

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

986
	while (pack_max_fds <= pack_open_fds && close_one_pack())
987 988
		; /* nothing */

989
	p->pack_fd = git_open_noatime(p->pack_name);
990
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
991
		return -1;
992
	pack_open_fds++;
993 994

	/* If we created the struct before we had the pack we lack size. */
995 996
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
997
			return error("packfile %s not a regular file", p->pack_name);
998
		p->pack_size = st.st_size;
999
	} else if (p->pack_size != st.st_size)
1000
		return error("packfile %s size changed", p->pack_name);
1001

1002 1003 1004 1005 1006
	/* 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)
1007
		return error("cannot determine file descriptor flags");
1008 1009
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
1010
		return error("cannot set FD_CLOEXEC");
1011

1012
	/* Verify we recognize this pack file format. */
1013
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
1014
		return error("file %s is far too short to be a packfile", p->pack_name);
1015
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
1016
		return error("file %s is not a GIT packfile", p->pack_name);
1017
	if (!pack_version_ok(hdr.hdr_version))
1018 1019
		return error("packfile %s is version %"PRIu32" and not"
			" supported (try upgrading GIT to a newer version)",
1020 1021 1022
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
1023
	if (p->num_objects != ntohl(hdr.hdr_entries))
1024 1025
		return error("packfile %s claims to have %"PRIu32" objects"
			     " while index indicates %"PRIu32" objects",
N
Nicolas Pitre 已提交
1026 1027
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
1028
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
1029
		return error("end of packfile %s is unavailable", p->pack_name);
1030
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
1031
		return error("packfile %s signature is unavailable", p->pack_name);
1032
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
1033
	if (hashcmp(sha1, idx_sha1))
1034 1035
		return error("packfile %s does not match index", p->pack_name);
	return 0;
1036 1037
}

1038 1039 1040 1041 1042 1043
static int open_packed_git(struct packed_git *p)
{
	if (!open_packed_git_1(p))
		return 0;
	if (p->pack_fd != -1) {
		close(p->pack_fd);
1044
		pack_open_fds--;
1045 1046 1047 1048 1049
		p->pack_fd = -1;
	}
	return -1;
}

1050
static int in_window(struct pack_window *win, off_t offset)
1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
{
	/* 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);
}

1063
unsigned char *use_pack(struct packed_git *p,
1064
		struct pack_window **w_cursor,
1065
		off_t offset,
1066
		unsigned long *left)
1067
{
1068
	struct pack_window *win = *w_cursor;
1069

F
Felipe Contreras 已提交
1070
	/* Since packfiles end in a hash of their content and it's
1071 1072 1073 1074
	 * 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.
	 */
1075 1076
	if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087
	if (offset > (p->pack_size - 20))
		die("offset beyond end of packfile (truncated pack?)");

	if (!win || !in_window(win, offset)) {
		if (win)
			win->inuse_cnt--;
		for (win = p->windows; win; win = win->next) {
			if (in_window(win, offset))
				break;
		}
		if (!win) {
1088
			size_t window_align = packed_git_window_size / 2;
1089
			off_t len;
1090 1091 1092 1093

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

1094
			win = xcalloc(1, sizeof(*win));
1095
			win->offset = (offset / window_align) * window_align;
1096 1097 1098 1099
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
1100
			pack_mapped += win->len;
1101
			while (packed_git_limit < pack_mapped
1102
				&& unuse_one_window(p))
1103
				; /* nothing */
1104
			win->base = xmmap(NULL, win->len,
1105 1106 1107
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
1108 1109 1110
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
1111 1112 1113 1114 1115 1116
			if (!win->offset && win->len == p->pack_size
				&& !p->do_not_close) {
				close(p->pack_fd);
				pack_open_fds--;
				p->pack_fd = -1;
			}
1117 1118 1119 1120 1121 1122
			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;
1123 1124 1125
			win->next = p->windows;
			p->windows = win;
		}
1126
	}
1127 1128 1129 1130 1131
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
1132
	offset -= win->offset;
1133
	if (left)
1134
		*left = win->len - xsize_t(offset);
1135
	return win->base + offset;
1136 1137
}

1138 1139 1140 1141 1142 1143 1144 1145
static struct packed_git *alloc_packed_git(int extra)
{
	struct packed_git *p = xmalloc(sizeof(*p) + extra);
	memset(p, 0, sizeof(*p));
	p->pack_fd = -1;
	return p;
}

1146 1147
static void try_to_free_pack_memory(size_t size)
{
1148
	release_pack_memory(size);
1149 1150
}

1151
struct packed_git *add_packed_git(const char *path, size_t path_len, int local)
1152
{
1153
	static int have_set_try_to_free_routine;
1154
	struct stat st;
1155 1156
	size_t alloc;
	struct packed_git *p;
1157

1158 1159 1160 1161 1162
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

1163 1164 1165 1166
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
1167
	if (!strip_suffix_mem(path, &path_len, ".idx"))
1168
		return NULL;
1169 1170 1171 1172 1173 1174 1175

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

1178
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".keep");
1179 1180 1181
	if (!access(p->pack_name, F_OK))
		p->pack_keep = 1;

1182
	xsnprintf(p->pack_name + path_len, alloc - path_len, ".pack");
1183
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
1184
		free(p);
1185 1186
		return NULL;
	}
1187

1188 1189 1190 1191
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
1192
	p->pack_local = local;
1193
	p->mtime = st.st_mtime;
1194 1195
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
1196 1197 1198
	return p;
}

1199
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
1200
{
1201
	const char *path = sha1_pack_name(sha1);
1202
	struct packed_git *p = alloc_packed_git(strlen(path) + 1);
1203

1204 1205
	strcpy(p->pack_name, path);
	hashcpy(p->sha1, sha1);
1206 1207
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
1208
		return NULL;
1209
	}
1210 1211 1212 1213 1214 1215

	return p;
}

void install_packed_git(struct packed_git *pack)
{
1216 1217 1218
	if (pack->pack_fd != -1)
		pack_open_fds++;

1219 1220 1221 1222
	pack->next = packed_git;
	packed_git = pack;
}

1223 1224 1225 1226 1227 1228 1229 1230
void (*report_garbage)(const char *desc, const char *path);

static void report_helper(const struct string_list *list,
			  int seen_bits, int first, int last)
{
	const char *msg;
	switch (seen_bits) {
	case 0:
1231
		msg = "no corresponding .idx or .pack";
1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252
		break;
	case 1:
		msg = "no corresponding .idx";
		break;
	case 2:
		msg = "no corresponding .pack";
		break;
	default:
		return;
	}
	for (; first < last; first++)
		report_garbage(msg, list->items[first].string);
}

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

	if (!report_garbage)
		return;

1253
	string_list_sort(list);
1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279

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

1280
static void prepare_packed_git_one(char *objdir, int local)
1281
{
1282 1283
	struct strbuf path = STRBUF_INIT;
	size_t dirnamelen;
1284 1285
	DIR *dir;
	struct dirent *de;
1286
	struct string_list garbage = STRING_LIST_INIT_DUP;
1287

1288 1289 1290
	strbuf_addstr(&path, objdir);
	strbuf_addstr(&path, "/pack");
	dir = opendir(path.buf);
1291
	if (!dir) {
J
Junio C Hamano 已提交
1292
		if (errno != ENOENT)
1293
			error("unable to open object pack directory: %s: %s",
1294 1295
			      path.buf, strerror(errno));
		strbuf_release(&path);
1296
		return;
1297
	}
1298 1299
	strbuf_addch(&path, '/');
	dirnamelen = path.len;
1300 1301
	while ((de = readdir(dir)) != NULL) {
		struct packed_git *p;
1302
		size_t base_len;
1303 1304

		if (is_dot_or_dotdot(de->d_name))
1305 1306
			continue;

1307 1308
		strbuf_setlen(&path, dirnamelen);
		strbuf_addstr(&path, de->d_name);
1309

1310 1311
		base_len = path.len;
		if (strip_suffix_mem(path.buf, &base_len, ".idx")) {
1312 1313
			/* Don't reopen a pack we already have. */
			for (p = packed_git; p; p = p->next) {
1314 1315 1316 1317
				size_t len;
				if (strip_suffix(p->pack_name, ".pack", &len) &&
				    len == base_len &&
				    !memcmp(p->pack_name, path.buf, len))
1318 1319 1320 1321 1322 1323 1324
					break;
			}
			if (p == NULL &&
			    /*
			     * See if it really is a valid .idx file with
			     * corresponding .pack file that we can map.
			     */
1325
			    (p = add_packed_git(path.buf, path.len, local)) != NULL)
1326
				install_packed_git(p);
1327
		}
1328 1329 1330 1331

		if (!report_garbage)
			continue;

J
Jeff King 已提交
1332 1333 1334 1335
		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"))
1336
			string_list_append(&garbage, path.buf);
1337
		else
1338
			report_garbage("garbage found", path.buf);
1339
	}
1340
	closedir(dir);
1341 1342
	report_pack_garbage(&garbage);
	string_list_clear(&garbage, 0);
1343
	strbuf_release(&path);
1344 1345
}

1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399
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);
}

1400
static int prepare_packed_git_run_once = 0;
1401
void prepare_packed_git(void)
1402
{
1403
	struct alternate_object_database *alt;
1404

1405
	if (prepare_packed_git_run_once)
1406
		return;
1407
	prepare_packed_git_one(get_object_directory(), 1);
1408
	prepare_alt_odb();
1409
	for (alt = alt_odb_list; alt; alt = alt->next) {
1410
		alt->name[-1] = 0;
1411
		prepare_packed_git_one(alt->base, 0);
1412
		alt->name[-1] = '/';
1413
	}
1414
	rearrange_packed_git();
1415 1416 1417
	prepare_packed_git_run_once = 1;
}

1418
void reprepare_packed_git(void)
1419 1420 1421
{
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1422 1423
}

1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435
static void mark_bad_packed_object(struct packed_git *p,
				   const unsigned char *sha1)
{
	unsigned i;
	for (i = 0; i < p->num_bad_objects; i++)
		if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
			return;
	p->bad_object_sha1 = xrealloc(p->bad_object_sha1, 20 * (p->num_bad_objects + 1));
	hashcpy(p->bad_object_sha1 + 20 * p->num_bad_objects, sha1);
	p->num_bad_objects++;
}

1436
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1437 1438 1439 1440 1441 1442 1443
{
	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))
1444 1445
				return p;
	return NULL;
1446 1447
}

1448 1449 1450 1451 1452 1453 1454 1455
/*
 * 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)
1456 1457
{
	unsigned char real_sha1[20];
1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
	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 */
1474
	hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", typename(obj_type), size) + 1;
1475 1476 1477 1478 1479 1480 1481 1482

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

1483 1484 1485 1486
		if (readlen < 0) {
			close_istream(st);
			return -1;
		}
1487 1488 1489 1490 1491 1492
		if (!readlen)
			break;
		git_SHA1_Update(&c, buf, readlen);
	}
	git_SHA1_Final(real_sha1, &c);
	close_istream(st);
1493
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1494 1495
}

1496
int git_open_noatime(const char *name)
1497 1498 1499
{
	static int sha1_file_open_flag = O_NOATIME;

1500
	for (;;) {
1501 1502 1503 1504
		int fd;

		errno = 0;
		fd = open(name, O_RDONLY | sha1_file_open_flag);
1505
		if (fd >= 0)
1506 1507 1508 1509
			return fd;

		/* Might the failure be due to O_NOATIME? */
		if (errno != ENOENT && sha1_file_open_flag) {
1510
			sha1_file_open_flag = 0;
1511 1512 1513 1514
			continue;
		}

		return -1;
1515 1516 1517
	}
}

1518 1519 1520 1521
static int stat_sha1_file(const unsigned char *sha1, struct stat *st)
{
	struct alternate_object_database *alt;

1522
	if (!lstat(sha1_file_name(sha1), st))
1523 1524 1525 1526 1527
		return 0;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
1528
		fill_sha1_path(alt->name, sha1);
1529 1530 1531 1532 1533 1534 1535
		if (!lstat(alt->base, st))
			return 0;
	}

	return -1;
}

1536 1537 1538 1539
static int open_sha1_file(const unsigned char *sha1)
{
	int fd;
	struct alternate_object_database *alt;
1540
	int most_interesting_errno;
1541

1542
	fd = git_open_noatime(sha1_file_name(sha1));
1543 1544
	if (fd >= 0)
		return fd;
1545
	most_interesting_errno = errno;
1546 1547 1548

	prepare_alt_odb();
	for (alt = alt_odb_list; alt; alt = alt->next) {
1549
		fill_sha1_path(alt->name, sha1);
1550
		fd = git_open_noatime(alt->base);
1551 1552
		if (fd >= 0)
			return fd;
1553 1554
		if (most_interesting_errno == ENOENT)
			most_interesting_errno = errno;
1555
	}
1556
	errno = most_interesting_errno;
1557 1558 1559
	return -1;
}

1560
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1561 1562
{
	void *map;
1563
	int fd;
1564

1565 1566 1567 1568
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1569

1570 1571
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
1572 1573 1574 1575 1576
			if (!*size) {
				/* mmap() is forbidden on empty files */
				error("object file %s is empty", sha1_file_name(sha1));
				return NULL;
			}
1577
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1578
		}
1579
		close(fd);
1580 1581 1582 1583
	}
	return map;
}

1584 1585
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1586
{
1587
	unsigned shift;
1588
	unsigned long size, c;
1589 1590 1591 1592 1593 1594 1595
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1596
		if (len <= used || bitsizeof(long) <= shift) {
1597
			error("bad object header");
1598 1599
			size = used = 0;
			break;
1600
		}
1601 1602 1603 1604 1605 1606 1607 1608
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

J
Junio C Hamano 已提交
1609
int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1610
{
1611 1612 1613 1614 1615
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1616 1617
	stream->avail_out = bufsiz;

1618
	git_inflate_init(stream);
1619
	return git_inflate(stream, 0);
1620 1621
}

1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655
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;

	status = unpack_sha1_header(stream, map, mapsize, buffer, bufsiz);

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

1656
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1657 1658
{
	int bytes = strlen(buffer) + 1;
1659
	unsigned char *buf = xmallocz(size);
1660
	unsigned long n;
1661
	int status = Z_OK;
1662

1663 1664 1665 1666 1667
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1668 1669 1670 1671
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1672
		 * expect no more output and set avail_out to zero,
1673 1674 1675 1676 1677 1678 1679 1680 1681
		 * 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.
		 */
1682 1683
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1684
		while (status == Z_OK)
1685
			status = git_inflate(stream, Z_FINISH);
1686
	}
1687
	if (status == Z_STREAM_END && !stream->avail_in) {
1688
		git_inflate_end(stream);
1689 1690 1691 1692 1693 1694 1695 1696 1697 1698
		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;
1699 1700 1701 1702 1703 1704 1705
}

/*
 * 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.
 */
1706 1707
static int parse_sha1_header_extended(const char *hdr, struct object_info *oi,
			       unsigned int flags)
1708
{
1709
	const char *type_buf = hdr;
1710
	unsigned long size;
1711
	int type, type_len = 0;
1712 1713

	/*
1714
	 * The type can be of any size but is followed by
1715
	 * a space.
1716 1717 1718 1719 1720
	 */
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1721
		type_len++;
1722
	}
1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737

	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
	 * we're obtaining the type using '--allow-unkown-type'
	 * option.
	 */
	if ((flags & LOOKUP_UNKNOWN_OBJECT) && (type < 0))
		type = 0;
	else if (type < 0)
		die("invalid object type");
	if (oi->typep)
		*oi->typep = type;
1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754

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

	if (oi->sizep)
		*oi->sizep = size;
1758 1759 1760 1761

	/*
	 * The length must be followed by a zero byte
	 */
1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772
	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);
1773 1774
}

1775
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1776
{
1777
	int ret;
1778
	git_zstream stream;
1779
	char hdr[8192];
1780

1781
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1782
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1783 1784
		return NULL;

1785
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1786 1787
}

N
Nicolas Pitre 已提交
1788 1789 1790 1791 1792 1793
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;
1794
	git_zstream stream;
N
Nicolas Pitre 已提交
1795 1796 1797 1798 1799 1800
	int st;

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

1801
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
1802 1803 1804
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
1805
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
1806 1807 1808
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
1809
	git_inflate_end(&stream);
1810 1811 1812 1813
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826

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

1827
static off_t get_delta_base(struct packed_git *p,
1828
				    struct pack_window **w_curs,
1829
				    off_t *curpos,
1830
				    enum object_type type,
1831
				    off_t delta_obj_offset)
1832
{
1833
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1834
	off_t base_offset;
1835

1836 1837 1838 1839 1840 1841
	/* 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.
	 */
1842
	if (type == OBJ_OFS_DELTA) {
1843 1844 1845 1846 1847
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1848
			if (!base_offset || MSB(base_offset, 7))
1849
				return 0;  /* overflow */
1850 1851 1852 1853
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
1854
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
1855
			return 0;  /* out of bound */
1856
		*curpos += used;
1857
	} else if (type == OBJ_REF_DELTA) {
1858 1859
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
1860
		*curpos += 20;
1861 1862
	} else
		die("I am totally screwed");
1863
	return base_offset;
1864 1865
}

1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897
/*
 * 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;
}

1898 1899 1900 1901
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
1902
{
1903
	unsigned char *base;
1904
	unsigned long left;
1905
	unsigned long used;
1906
	enum object_type type;
1907

1908
	/* use_pack() assures us we have [base, base + 20) available
1909
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
1910
	 * size that is assured.)  With our object header encoding
1911 1912 1913
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1914
	base = use_pack(p, w_curs, *curpos, &left);
1915 1916 1917 1918 1919
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
1920

1921
	return type;
1922 1923
}

1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941
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

1942 1943 1944 1945 1946
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)
1947
{
1948 1949 1950
	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;
1951

1952 1953
	while (type == OBJ_OFS_DELTA || type == OBJ_REF_DELTA) {
		off_t base_offset;
1954
		unsigned long size;
1955 1956 1957 1958 1959 1960 1961 1962 1963 1964
		/* Push the object we're going to leave behind */
		if (poi_stack_nr >= poi_stack_alloc && poi_stack == small_poi_stack) {
			poi_stack_alloc = alloc_nr(poi_stack_nr);
			poi_stack = xmalloc(sizeof(off_t)*poi_stack_alloc);
			memcpy(poi_stack, small_poi_stack, sizeof(off_t)*poi_stack_nr);
		} else {
			ALLOC_GROW(poi_stack, poi_stack_nr+1, poi_stack_alloc);
		}
		poi_stack[poi_stack_nr++] = obj_offset;
		/* If parsing the base offset fails, just unwind */
1965
		base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1966 1967 1968
		if (!base_offset)
			goto unwind;
		curpos = obj_offset = base_offset;
1969
		type = unpack_object_header(p, w_curs, &curpos, &size);
1970 1971 1972 1973 1974 1975 1976 1977 1978 1979
		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;
		}
	}

1980
	switch (type) {
1981
	case OBJ_BAD:
1982 1983 1984 1985
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1986
		break;
1987
	default:
1988 1989 1990
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
1991
	}
1992 1993 1994 1995

out:
	if (poi_stack != small_poi_stack)
		free(poi_stack);
1996
	return type;
1997 1998 1999 2000 2001 2002 2003 2004 2005 2006

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

2009
static int packed_object_info(struct packed_git *p, off_t obj_offset,
2010
			      struct object_info *oi)
2011 2012 2013 2014 2015 2016
{
	struct pack_window *w_curs = NULL;
	unsigned long size;
	off_t curpos = obj_offset;
	enum object_type type;

2017 2018 2019 2020
	/*
	 * We always get the representation type, but only convert it to
	 * a "real" type later if the caller is interested.
	 */
2021 2022
	type = unpack_object_header(p, &w_curs, &curpos, &size);

2023
	if (oi->sizep) {
2024 2025 2026 2027 2028 2029 2030 2031
		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;
			}
2032 2033
			*oi->sizep = get_size_from_delta(p, &w_curs, tmp_pos);
			if (*oi->sizep == 0) {
2034 2035 2036 2037
				type = OBJ_BAD;
				goto out;
			}
		} else {
2038
			*oi->sizep = size;
2039 2040 2041
		}
	}

2042
	if (oi->disk_sizep) {
2043
		struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
2044
		*oi->disk_sizep = revidx[1].offset - obj_offset;
2045 2046
	}

2047 2048 2049
	if (oi->typep) {
		*oi->typep = packed_to_object_type(p, obj_offset, type, &w_curs, curpos);
		if (*oi->typep < 0) {
2050 2051 2052 2053
			type = OBJ_BAD;
			goto out;
		}
	}
2054

2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070
	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);
	}

2071 2072 2073 2074 2075
out:
	unuse_pack(&w_curs);
	return type;
}

2076
static void *unpack_compressed_entry(struct packed_git *p,
2077
				    struct pack_window **w_curs,
2078
				    off_t curpos,
2079
				    unsigned long size)
2080 2081
{
	int st;
2082
	git_zstream stream;
2083
	unsigned char *buffer, *in;
2084

2085 2086 2087
	buffer = xmallocz_gently(size);
	if (!buffer)
		return NULL;
2088 2089
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
2090
	stream.avail_out = size + 1;
2091

2092
	git_inflate_init(&stream);
2093
	do {
2094
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
2095
		stream.next_in = in;
2096
		st = git_inflate(&stream, Z_FINISH);
2097 2098
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
2099
		curpos += stream.next_in - in;
2100
	} while (st == Z_OK || st == Z_BUF_ERROR);
2101
	git_inflate_end(&stream);
2102 2103 2104 2105 2106 2107 2108 2109
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

2110 2111
#define MAX_DELTA_CACHE (256)

2112
static size_t delta_base_cached;
2113 2114 2115 2116 2117 2118

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

2119
static struct delta_base_cache_entry {
2120 2121
	struct delta_base_cache_lru_list lru;
	void *data;
2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133
	struct packed_git *p;
	off_t base_offset;
	unsigned long size;
	enum object_type type;
} delta_base_cache[MAX_DELTA_CACHE];

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

	hash = (unsigned long)p + (unsigned long)base_offset;
	hash += (hash >> 8) + (hash >> 16);
2134
	return hash % MAX_DELTA_CACHE;
2135 2136
}

2137 2138
static struct delta_base_cache_entry *
get_delta_base_cache_entry(struct packed_git *p, off_t base_offset)
2139 2140
{
	unsigned long hash = pack_entry_hash(p, base_offset);
2141 2142 2143 2144 2145 2146
	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)
{
2147 2148 2149
	return (ent->data && ent->p == p && ent->base_offset == base_offset);
}

2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164
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;
}

2165
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
2166
	unsigned long *base_size, enum object_type *type, int keep_cache)
2167
{
2168
	struct delta_base_cache_entry *ent;
2169 2170
	void *ret;

2171 2172 2173
	ent = get_delta_base_cache_entry(p, base_offset);

	if (!eq_delta_base_cache_entry(ent, p, base_offset))
2174
		return unpack_entry(p, base_offset, type, base_size);
2175

2176 2177 2178 2179 2180
	ret = ent->data;

	if (!keep_cache)
		clear_delta_base_cache_entry(ent);
	else
P
Pierre Habouzit 已提交
2181
		ret = xmemdupz(ent->data, ent->size);
2182 2183 2184
	*type = ent->type;
	*base_size = ent->size;
	return ret;
2185 2186
}

2187 2188 2189 2190 2191
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
2192 2193
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
2194 2195 2196 2197
		delta_base_cached -= ent->size;
	}
}

2198 2199 2200 2201 2202 2203 2204
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]);
}

2205 2206 2207
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
2208
	unsigned long hash = pack_entry_hash(p, base_offset);
2209
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
2210
	struct delta_base_cache_lru_list *lru;
2211

2212 2213
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
2214 2215 2216 2217 2218 2219

	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;
2220 2221 2222
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
2223 2224 2225 2226 2227 2228 2229
	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);
	}
2230

2231 2232 2233 2234 2235
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
2236 2237 2238 2239
	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;
2240 2241
}

2242 2243 2244
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

2245 2246
static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
{
2247 2248 2249
	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);
2250 2251
}

2252 2253
int do_check_packed_object_crc;

2254 2255 2256 2257 2258 2259 2260
#define UNPACK_ENTRY_STACK_PREALLOC 64
struct unpack_entry_stack_ent {
	off_t obj_offset;
	off_t curpos;
	unsigned long size;
};

2261
void *unpack_entry(struct packed_git *p, off_t obj_offset,
2262
		   enum object_type *final_type, unsigned long *final_size)
2263
{
2264
	struct pack_window *w_curs = NULL;
2265
	off_t curpos = obj_offset;
2266 2267 2268 2269 2270 2271 2272
	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;
2273

2274
	write_pack_access_log(p, obj_offset);
2275

2276 2277 2278 2279 2280 2281
	/* PHASE 1: drill down to the innermost base object */
	for (;;) {
		off_t base_offset;
		int i;
		struct delta_base_cache_entry *ent;

2282 2283 2284 2285 2286 2287 2288 2289 2290 2291
		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;
		}

2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335
		if (do_check_packed_object_crc && p->index_version > 1) {
			struct revindex_entry *revidx = find_pack_revindex(p, obj_offset);
			unsigned long len = revidx[1].offset - obj_offset;
			if (check_pack_crc(p, &w_curs, obj_offset, len, revidx->nr)) {
				const unsigned char *sha1 =
					nth_packed_object_sha1(p, revidx->nr);
				error("bad packed object CRC for %s",
				      sha1_to_hex(sha1));
				mark_bad_packed_object(p, sha1);
				unuse_pack(&w_curs);
				return NULL;
			}
		}

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

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

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

		curpos = obj_offset = base_offset;
2336 2337
	}

2338 2339
	/* PHASE 2: handle the base */
	switch (type) {
2340 2341
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
2342 2343
		if (data)
			die("BUG in unpack_entry: left loop at a valid delta");
2344
		break;
2345 2346 2347 2348
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
2349 2350
		if (!base_from_cache)
			data = unpack_compressed_entry(p, &w_curs, curpos, size);
2351
		break;
2352
	default:
2353 2354
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
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 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415
		      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);
2416 2417 2418 2419 2420 2421 2422 2423 2424

		/*
		 * 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.
		 */
2425
		if (!data)
2426
			error("failed to apply delta");
2427

2428
		free(delta_data);
2429
	}
2430 2431 2432 2433

	*final_type = type;
	*final_size = size;

2434
	unuse_pack(&w_curs);
2435 2436 2437 2438

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

2439
	return data;
2440 2441
}

2442
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
2443
					    uint32_t n)
2444
{
2445
	const unsigned char *index = p->index_data;
2446 2447 2448 2449 2450
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
2451
	if (n >= p->num_objects)
2452
		return NULL;
2453 2454 2455 2456 2457 2458 2459 2460 2461
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

N
Nicolas Pitre 已提交
2462
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477
{
	const unsigned char *index = p->index_data;
	index += 4 * 256;
	if (p->index_version == 1) {
		return ntohl(*((uint32_t *)(index + 24 * n)));
	} else {
		uint32_t off;
		index += 8 + p->num_objects * (20 + 4);
		off = ntohl(*((uint32_t *)(index + 4 * n)));
		if (!(off & 0x80000000))
			return off;
		index += p->num_objects * 4 + (off & 0x7fffffff) * 8;
		return (((uint64_t)ntohl(*((uint32_t *)(index + 0)))) << 32) |
				   ntohl(*((uint32_t *)(index + 4)));
	}
2478 2479
}

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

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

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

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

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

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

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

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

2604
	prepare_packed_git();
2605 2606
	if (!packed_git)
		return 0;
2607

2608 2609
	if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
		return 1;
2610

2611
	for (p = packed_git; p; p = p->next) {
2612 2613
		if (p == last_found_pack)
			continue; /* we already checked this one */
2614

2615 2616 2617 2618
		if (fill_pack_entry(sha1, e, p)) {
			last_found_pack = p;
			return 1;
		}
2619
	}
2620 2621 2622
	return 0;
}

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

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

2634 2635
}

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

2647 2648 2649
	if (oi->delta_base_sha1)
		hashclr(oi->delta_base_sha1);

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

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

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

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

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

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

2732 2733 2734 2735 2736 2737 2738
	/*
	 * 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;

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

2759
	return 0;
2760 2761
}

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

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

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

2781
	if (!find_pack_entry(sha1, &e))
2782
		return NULL;
2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793
	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);
2794
		data = read_object(sha1, type, size);
2795 2796
	}
	return data;
2797 2798
}

2799 2800
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2801 2802 2803
{
	struct cached_object *co;

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

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

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

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

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

2858 2859
	errno = 0;
	data = read_object(repl, type, size);
2860
	if (data)
2861
		return data;
2862

2863
	if (errno && errno != ENOENT)
2864 2865
		die_errno("failed to read object %s", sha1_to_hex(sha1));

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

2871
	if (has_loose_object(repl)) {
2872 2873
		const char *path = sha1_file_name(sha1);

2874 2875
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
2876
	}
2877

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

2882
	return NULL;
2883 2884
}

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

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

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

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

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

	/* Generate the header */
2940
	*hdrlen = xsnprintf(hdr, *hdrlen, "%s %lu", type, len)+1;
2941 2942

	/* Sha1.. */
2943 2944 2945 2946
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
2947 2948
}

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

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

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

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

L
Linus Torvalds 已提交
2992 2993
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2994
	if (write_in_full(fd, buf, len) < 0)
2995
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2996 2997 2998
	return 0;
}

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

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

3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042
/* Size of directory component, including the ending '/' */
static inline int directory_size(const char *filename)
{
	const char *s = strrchr(filename, '/');
	if (!s)
		return 0;
	return s - filename + 1;
}

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

	if (dirlen + 20 > bufsiz) {
		errno = ENAMETOOLONG;
		return -1;
	}
	memcpy(buffer, filename, dirlen);
	strcpy(buffer + dirlen, "tmp_obj_XXXXXX");
3043
	fd = git_mkstemp_mode(buffer, 0444);
3044
	if (fd < 0 && dirlen && errno == ENOENT) {
3045
		/* Make sure the directory exists */
P
Patrick Higgins 已提交
3046
		memcpy(buffer, filename, dirlen);
3047
		buffer[dirlen-1] = 0;
3048 3049 3050
		if (mkdir(buffer, 0777) && errno != EEXIST)
			return -1;
		if (adjust_shared_perm(buffer))
3051 3052 3053 3054
			return -1;

		/* Try again */
		strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
3055
		fd = git_mkstemp_mode(buffer, 0444);
3056 3057 3058 3059
	}
	return fd;
}

3060
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
3061
			      const void *buf, unsigned long len, time_t mtime)
3062
{
3063
	int fd, ret;
3064
	unsigned char compressed[4096];
3065
	git_zstream stream;
3066 3067
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
3068
	static char tmp_file[PATH_MAX];
3069
	const char *filename = sha1_file_name(sha1);
3070

3071
	fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
3072
	if (fd < 0) {
3073
		if (errno == EACCES)
3074
			return error("insufficient permission for adding an object to repository database %s", get_object_directory());
3075
		else
3076
			return error("unable to create temporary file: %s", strerror(errno));
3077 3078
	}

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

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

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

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

3114
	close_sha1_file(fd);
3115

3116 3117 3118 3119
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
3120
		if (utime(tmp_file, &utb) < 0)
3121
			warning("failed utime() on %s: %s",
3122
				tmp_file, strerror(errno));
3123 3124
	}

3125
	return finalize_object_file(tmp_file, filename);
3126
}
3127

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

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

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

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

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

cleanup:
	free(header);
	return status;
}

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

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

	return ret;
3201 3202
}

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

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

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

3221
	if (find_pack_entry(sha1, &e))
3222
		return 1;
3223 3224
	if (has_loose_object(sha1))
		return 1;
3225 3226
	if (flags & HAS_SHA1_QUICK)
		return 0;
3227 3228
	reprepare_packed_git();
	return find_pack_entry(sha1, &e);
3229
}
J
Junio C Hamano 已提交
3230

3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258
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");
}

3259
static int index_mem(unsigned char *sha1, void *buf, size_t size,
3260 3261
		     enum object_type type,
		     const char *path, unsigned flags)
3262
{
L
Linus Torvalds 已提交
3263
	int ret, re_allocated = 0;
3264
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
3265

3266
	if (!type)
3267
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
3268 3269 3270 3271

	/*
	 * Convert blobs to git internal format
	 */
3272
	if ((type == OBJ_BLOB) && path) {
3273
		struct strbuf nbuf = STRBUF_INIT;
3274
		if (convert_to_git(path, buf, size, &nbuf,
3275
				   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
3276
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
3277 3278 3279
			re_allocated = 1;
		}
	}
3280
	if (flags & HASH_FORMAT_CHECK) {
3281 3282 3283 3284 3285 3286 3287
		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 已提交
3288

3289
	if (write_object)
3290
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
3291
	else
3292
		ret = hash_sha1_file(buf, size, typename(type), sha1);
3293
	if (re_allocated)
L
Linus Torvalds 已提交
3294
		free(buf);
3295 3296 3297
	return ret;
}

3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320
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;
}

3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334
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;
}

3335 3336
#define SMALL_FILE_SIZE (32*1024)

3337 3338 3339
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
3340 3341 3342
{
	int ret;

3343
	if (!size) {
3344
		ret = index_mem(sha1, "", size, type, path, flags);
3345 3346 3347
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
3348
			ret = index_mem(sha1, buf, size, type, path, flags);
3349 3350 3351
		else
			ret = error("short read %s", strerror(errno));
		free(buf);
3352
	} else {
3353
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
3354
		ret = index_mem(sha1, buf, size, type, path, flags);
3355
		munmap(buf, size);
3356
	}
3357 3358 3359
	return ret;
}

3360
/*
3361 3362
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
3363 3364 3365 3366
 *
 * 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
3367 3368 3369 3370 3371 3372 3373
 * (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.
3374 3375 3376 3377 3378
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
3379
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
3380 3381
}

3382 3383 3384 3385 3386
int index_fd(unsigned char *sha1, int fd, struct stat *st,
	     enum object_type type, const char *path, unsigned flags)
{
	int ret;

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

3406
int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
3407 3408
{
	int fd;
3409
	struct strbuf sb = STRBUF_INIT;
3410 3411 3412 3413 3414 3415 3416

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

int read_pack_header(int fd, struct pack_header *header)
{
3444 3445 3446 3447
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

3448 3449 3450 3451 3452 3453 3454 3455
	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 已提交
3456 3457 3458 3459 3460 3461 3462 3463 3464 3465

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));
}
3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 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 3518 3519 3520 3521 3522

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;
		return error("unable to open %s: %s", path->buf, strerror(errno));
	}

	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;
		}
	}
	strbuf_setlen(path, baselen);

	if (!r && subdir_cb)
		r = subdir_cb(subdir_nr, path->buf, data);

	closedir(dir);
	return r;
}

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

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

3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556
	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);
3557
	strbuf_release(&buf);
3558

3559 3560
	return r;
}
3561 3562 3563 3564 3565 3566 3567 3568 3569 3570

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;
3571 3572 3573 3574 3575 3576 3577 3578 3579 3580
	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;
3581 3582
}

3583
int for_each_loose_object(each_loose_object_fn cb, void *data, unsigned flags)
3584 3585 3586 3587 3588 3589 3590 3591 3592
{
	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;

3593 3594 3595
	if (flags & FOR_EACH_OBJECT_LOCAL_ONLY)
		return 0;

3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619
	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;
}

3620
int for_each_packed_object(each_packed_object_fn cb, void *data, unsigned flags)
3621 3622 3623
{
	struct packed_git *p;
	int r = 0;
3624
	int pack_errors = 0;
3625 3626 3627

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