sha1_file.c 71.6 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 "delta.h"
11
#include "pack.h"
12 13
#include "blob.h"
#include "commit.h"
14
#include "run-command.h"
15 16
#include "tag.h"
#include "tree.h"
17
#include "tree-walk.h"
18
#include "refs.h"
19
#include "pack-revindex.h"
20
#include "sha1-lookup.h"
21

22 23 24 25 26 27 28 29
#ifndef O_NOATIME
#if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
#define O_NOATIME 01000000
#else
#define O_NOATIME 0
#endif
#endif

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

33
const unsigned char null_sha1[20];
J
Junio C Hamano 已提交
34

35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
/*
 * 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 = {
50
	EMPTY_TREE_SHA1_BIN_LITERAL,
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
	OBJ_TREE,
	"",
	0
};

static struct cached_object *find_cached_object(const unsigned char *sha1)
{
	int i;
	struct cached_object *co = cached_objects;

	for (i = 0; i < cached_object_nr; i++, co++) {
		if (!hashcmp(co->sha1, sha1))
			return co;
	}
	if (!hashcmp(sha1, empty_tree.sha1))
		return &empty_tree;
	return NULL;
}

70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
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);
}

99 100
int safe_create_leading_directories(char *path)
{
101
	char *pos = path + offset_1st_component(path);
102 103
	struct stat st;

104 105 106 107
	while (pos) {
		pos = strchr(pos, '/');
		if (!pos)
			break;
108 109 110 111 112
		while (*++pos == '/')
			;
		if (!*pos)
			break;
		*--pos = '\0';
113 114 115
		if (!stat(path, &st)) {
			/* path exists */
			if (!S_ISDIR(st.st_mode)) {
116
				*pos = '/';
117
				return -3;
118
			}
119
		}
120 121 122 123
		else if (mkdir(path, 0777)) {
			*pos = '/';
			return -1;
		}
124 125 126 127
		else if (adjust_shared_perm(path)) {
			*pos = '/';
			return -2;
		}
128 129 130 131
		*pos++ = '/';
	}
	return 0;
}
132

133 134 135 136 137 138 139 140 141
int safe_create_leading_directories_const(const char *path)
{
	/* path points to cache entries, so xstrdup before messing with it */
	char *buf = xstrdup(path);
	int result = safe_create_leading_directories(buf);
	free(buf);
	return result;
}

142 143 144 145 146 147 148 149 150 151 152 153
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];
	}
}

154 155
/*
 * NOTE! This returns a statically allocated buffer, so you have to be
156
 * careful about using it. Do an "xstrdup()" if you need to save the
157
 * filename.
158 159 160
 *
 * Also note that this returns the location for creating.  Reading
 * SHA1 file can happen from any alternate directory listed in the
J
Junio C Hamano 已提交
161
 * DB_ENVIRONMENT environment variable if it is not found in
162
 * the primary object database.
163 164 165
 */
char *sha1_file_name(const unsigned char *sha1)
{
166 167 168
	static char buf[PATH_MAX];
	const char *objdir;
	int len;
169

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

184
static char *sha1_get_pack_name(const unsigned char *sha1,
J
Junio C Hamano 已提交
185
				char **name, char **base, const char *which)
186 187
{
	static const char hex[] = "0123456789abcdef";
188
	char *buf;
189 190
	int i;

191
	if (!*base) {
192 193
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
194
		*base = xmalloc(len + 60);
J
Junio C Hamano 已提交
195 196
		sprintf(*base, "%s/pack/pack-1234567890123456789012345678901234567890.%s",
			sha1_file_directory, which);
197
		*name = *base + len + 11;
198 199
	}

200
	buf = *name;
201 202 203 204 205 206

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

208
	return *base;
209 210
}

211
char *sha1_pack_name(const unsigned char *sha1)
212
{
213
	static char *name, *base;
214

J
Junio C Hamano 已提交
215
	return sha1_get_pack_name(sha1, &name, &base, "pack");
216
}
217

218 219 220
char *sha1_pack_index_name(const unsigned char *sha1)
{
	static char *name, *base;
J
Junio C Hamano 已提交
221

J
Junio C Hamano 已提交
222
	return sha1_get_pack_name(sha1, &name, &base, "idx");
223 224
}

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

M
Martin Waitz 已提交
228
static void read_info_alternates(const char * alternates, int depth);
229
static int git_open_noatime(const char *name);
M
Martin Waitz 已提交
230

J
Junio C Hamano 已提交
231 232
/*
 * Prepare alternate object database registry.
233 234 235 236 237
 *
 * 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,
238 239
 * whose contents is similar to that environment variable but can be
 * LF separated.  Its base points at a statically allocated buffer that
240 241 242 243 244
 * 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 已提交
245
 */
M
Martin Waitz 已提交
246
static int link_alt_odb_entry(const char * entry, int len, const char * relative_base, int depth)
247
{
248
	const char *objdir = get_object_directory();
M
Martin Waitz 已提交
249 250 251 252 253
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
	/* 43 = 40-byte + 2 '/' + terminating NUL */
	int pfxlen = len;
	int entlen = pfxlen + 43;
254
	int base_len = -1;
255

256
	if (!is_absolute_path(entry) && relative_base) {
M
Martin Waitz 已提交
257 258 259 260 261 262 263 264
		/* Relative alt-odb */
		if (base_len < 0)
			base_len = strlen(relative_base) + 1;
		entlen += base_len;
		pfxlen += base_len;
	}
	ent = xmalloc(sizeof(*ent) + entlen);

265
	if (!is_absolute_path(entry) && relative_base) {
M
Martin Waitz 已提交
266 267 268 269 270 271 272 273 274 275 276 277
		memcpy(ent->base, relative_base, base_len - 1);
		ent->base[base_len - 1] = '/';
		memcpy(ent->base + base_len, entry, len);
	}
	else
		memcpy(ent->base, entry, pfxlen);

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

	/* Detect cases where alternate disappeared */
278
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
		error("object directory %s does not exist; "
		      "check .git/objects/info/alternates.",
		      ent->base);
		free(ent);
		return -1;
	}

	/* Prevent the common mistake of listing the same
	 * thing twice, or object directory itself.
	 */
	for (alt = alt_odb_list; alt; alt = alt->next) {
		if (!memcmp(ent->base, alt->base, pfxlen)) {
			free(ent);
			return -1;
		}
	}
	if (!memcmp(ent->base, objdir, pfxlen)) {
		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;
}

static void link_alt_odb_entries(const char *alt, const char *ep, int sep,
				 const char *relative_base, int depth)
{
	const char *cp, *last;

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

324
	last = alt;
325 326 327 328 329 330 331 332
	while (last < ep) {
		cp = last;
		if (cp < ep && *cp == '#') {
			while (cp < ep && *cp != sep)
				cp++;
			last = cp + 1;
			continue;
		}
M
Martin Waitz 已提交
333 334
		while (cp < ep && *cp != sep)
			cp++;
335
		if (last != cp) {
336
			if (!is_absolute_path(last) && depth) {
M
Martin Waitz 已提交
337 338 339 340 341
				error("%s: ignoring relative alternate object store %s",
						relative_base, last);
			} else {
				link_alt_odb_entry(last, cp - last,
						relative_base, depth);
342
			}
343
		}
344
		while (cp < ep && *cp == sep)
345 346
			cp++;
		last = cp;
347
	}
348 349
}

M
Martin Waitz 已提交
350
static void read_info_alternates(const char * relative_base, int depth)
351
{
352
	char *map;
353
	size_t mapsz;
354
	struct stat st;
355 356 357 358 359
	const char alt_file_name[] = "info/alternates";
	/* Given that relative_base is no longer than PATH_MAX,
	   ensure that "path" has enough space to append "/", the
	   file name, "info/alternates", and a trailing NUL.  */
	char path[PATH_MAX + 1 + sizeof alt_file_name];
M
Martin Waitz 已提交
360
	int fd;
361

362
	sprintf(path, "%s/%s", relative_base, alt_file_name);
363
	fd = git_open_noatime(path);
364 365 366 367
	if (fd < 0)
		return;
	if (fstat(fd, &st) || (st.st_size == 0)) {
		close(fd);
368
		return;
369
	}
370 371
	mapsz = xsize_t(st.st_size);
	map = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, fd, 0);
372 373
	close(fd);

374
	link_alt_odb_entries(map, map + mapsz, '\n', relative_base, depth);
M
Martin Waitz 已提交
375

376
	munmap(map, mapsz);
377 378
}

379 380 381
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
382
	int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
383
	char *alt = mkpath("%s\n", reference);
384 385 386 387 388 389 390
	write_or_die(fd, alt, strlen(alt));
	if (commit_lock_file(lock))
		die("could not close alternates file");
	if (alt_odb_tail)
		link_alt_odb_entries(alt, alt + strlen(alt), '\n', NULL, 0);
}

391 392 393 394 395 396 397 398 399 400
void foreach_alt_odb(alt_odb_fn fn, void *cb)
{
	struct alternate_object_database *ent;

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

M
Martin Waitz 已提交
401 402
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
403
	const char *alt;
M
Martin Waitz 已提交
404

S
Shawn O. Pearce 已提交
405 406 407
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
408 409 410 411
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
412
	link_alt_odb_entries(alt, alt + strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
413 414 415 416

	read_info_alternates(get_object_directory(), 0);
}

417
static int has_loose_object_local(const unsigned char *sha1)
418 419
{
	char *name = sha1_file_name(sha1);
420 421
	return !access(name, F_OK);
}
422

423 424 425
int has_loose_object_nonlocal(const unsigned char *sha1)
{
	struct alternate_object_database *alt;
426
	prepare_alt_odb();
427
	for (alt = alt_odb_list; alt; alt = alt->next) {
428
		fill_sha1_path(alt->name, sha1);
429 430
		if (!access(alt->base, F_OK))
			return 1;
431
	}
432
	return 0;
433 434
}

435 436 437 438 439 440
static int has_loose_object(const unsigned char *sha1)
{
	return has_loose_object_local(sha1) ||
	       has_loose_object_nonlocal(sha1);
}

441
static unsigned int pack_used_ctr;
442 443 444
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
445 446
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
447
static size_t peak_pack_mapped;
448
static size_t pack_mapped;
449
struct packed_git *packed_git;
450

J
Junio C Hamano 已提交
451
void pack_report(void)
452 453
{
	fprintf(stderr,
454 455 456
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
457 458 459
		sz_fmt(getpagesize()),
		sz_fmt(packed_git_window_size),
		sz_fmt(packed_git_limit));
460 461 462 463
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
464 465
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
466 467 468
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
469
		sz_fmt(pack_mapped), sz_fmt(peak_pack_mapped));
470 471
}

472
static int check_packed_git_idx(const char *path,  struct packed_git *p)
473 474
{
	void *idx_map;
475
	struct pack_idx_header *hdr;
476
	size_t idx_size;
477
	uint32_t version, nr, i, *index;
478
	int fd = git_open_noatime(path);
479
	struct stat st;
480

481 482 483 484 485 486
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
487
	idx_size = xsize_t(st.st_size);
488 489 490 491
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
492
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
493 494
	close(fd);

495 496
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
497 498 499
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
500
			return error("index file %s is version %"PRIu32
501 502 503 504 505 506
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
507

508
	nr = 0;
509
	index = idx_map;
510 511
	if (version > 1)
		index += 2;  /* skip index header */
512
	for (i = 0; i < 256; i++) {
513
		uint32_t n = ntohl(index[i]);
514 515
		if (n < nr) {
			munmap(idx_map, idx_size);
516
			return error("non-monotonic index %s", path);
517
		}
518 519 520
		nr = n;
	}

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

567
	p->index_version = version;
568 569
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
570
	p->num_objects = nr;
571 572 573
	return 0;
}

574
int open_pack_index(struct packed_git *p)
575 576 577 578 579 580 581 582 583 584 585 586 587 588
{
	char *idx_name;
	int ret;

	if (p->index_data)
		return 0;

	idx_name = xstrdup(p->pack_name);
	strcpy(idx_name + strlen(idx_name) - strlen(".pack"), ".idx");
	ret = check_packed_git_idx(idx_name, p);
	free(idx_name);
	return ret;
}

589 590 591 592
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
593
{
594 595 596 597 598 599 600 601
	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;
602 603
			}
		}
604
		w_l = w;
605
	}
606 607
}

608
static int unuse_one_window(struct packed_git *current, int keep_fd)
609 610 611 612 613 614 615 616
{
	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);
617 618 619 620 621 622 623
	if (lru_p) {
		munmap(lru_w->base, lru_w->len);
		pack_mapped -= lru_w->len;
		if (lru_l)
			lru_l->next = lru_w->next;
		else {
			lru_p->windows = lru_w->next;
624 625
			if (!lru_p->windows && lru_p->pack_fd != -1
				&& lru_p->pack_fd != keep_fd) {
626
				close(lru_p->pack_fd);
627
				pack_open_fds--;
628 629 630 631
				lru_p->pack_fd = -1;
			}
		}
		free(lru_w);
632
		pack_open_windows--;
633 634 635
		return 1;
	}
	return 0;
636 637
}

638
void release_pack_memory(size_t need, int fd)
639 640
{
	size_t cur = pack_mapped;
641
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL, fd))
642 643 644
		; /* nothing */
}

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

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

676
void unuse_pack(struct pack_window **w_cursor)
677
{
678 679 680 681 682
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
683 684
}

685 686 687 688 689 690 691 692
void close_pack_index(struct packed_git *p)
{
	if (p->index_data) {
		munmap((void *)p->index_data, p->index_size);
		p->index_data = NULL;
	}
}

693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709
/*
 * This is used by git-repack in case a newly created pack happens to
 * contain the same set of objects as an existing one.  In that case
 * the resulting file might be different even if its name would be the
 * same.  It is best to close any reference to the old pack before it is
 * replaced on disk.  Of course no index pointers nor windows for given pack
 * must subsist at this point.  If ever objects from this pack are requested
 * again, the new version of the pack will be reinitialized through
 * reprepare_packed_git().
 */
void free_pack_by_name(const char *pack_name)
{
	struct packed_git *p, **pp = &packed_git;

	while (*pp) {
		p = *pp;
		if (strcmp(pack_name, p->pack_name) == 0) {
710
			clear_delta_base_cache();
711
			close_pack_windows(p);
712
			if (p->pack_fd != -1) {
713
				close(p->pack_fd);
714 715
				pack_open_fds--;
			}
716
			close_pack_index(p);
717 718 719 720 721 722 723 724 725
			free(p->bad_object_sha1);
			*pp = p->next;
			free(p);
			return;
		}
		pp = &p->next;
	}
}

726 727 728 729 730
/*
 * 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)
731
{
732 733 734 735
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
736
	long fd_flag;
737

738 739 740
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759
	if (!pack_max_fds) {
		struct rlimit lim;
		unsigned int max_fds;

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

		max_fds = lim.rlim_cur;

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

	while (pack_max_fds <= pack_open_fds && unuse_one_window(NULL, -1))
		; /* nothing */

760
	p->pack_fd = git_open_noatime(p->pack_name);
761
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
762
		return -1;
763
	pack_open_fds++;
764 765

	/* If we created the struct before we had the pack we lack size. */
766 767
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
768
			return error("packfile %s not a regular file", p->pack_name);
769
		p->pack_size = st.st_size;
770
	} else if (p->pack_size != st.st_size)
771
		return error("packfile %s size changed", p->pack_name);
772

773 774 775 776 777
	/* 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)
778
		return error("cannot determine file descriptor flags");
779 780
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
781
		return error("cannot set FD_CLOEXEC");
782

783
	/* Verify we recognize this pack file format. */
784
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
785
		return error("file %s is far too short to be a packfile", p->pack_name);
786
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
787
		return error("file %s is not a GIT packfile", p->pack_name);
788
	if (!pack_version_ok(hdr.hdr_version))
789 790
		return error("packfile %s is version %"PRIu32" and not"
			" supported (try upgrading GIT to a newer version)",
791 792 793
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
794
	if (p->num_objects != ntohl(hdr.hdr_entries))
795 796
		return error("packfile %s claims to have %"PRIu32" objects"
			     " while index indicates %"PRIu32" objects",
N
Nicolas Pitre 已提交
797 798
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
799
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
800
		return error("end of packfile %s is unavailable", p->pack_name);
801
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
802
		return error("packfile %s signature is unavailable", p->pack_name);
803
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
804
	if (hashcmp(sha1, idx_sha1))
805 806
		return error("packfile %s does not match index", p->pack_name);
	return 0;
807 808
}

809 810 811 812 813 814
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);
815
		pack_open_fds--;
816 817 818 819 820
		p->pack_fd = -1;
	}
	return -1;
}

821
static int in_window(struct pack_window *win, off_t offset)
822 823 824 825 826 827 828 829 830 831 832 833
{
	/* 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);
}

834
unsigned char *use_pack(struct packed_git *p,
835
		struct pack_window **w_cursor,
836
		off_t offset,
837
		unsigned long *left)
838
{
839
	struct pack_window *win = *w_cursor;
840

F
Felipe Contreras 已提交
841
	/* Since packfiles end in a hash of their content and it's
842 843 844 845
	 * 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.
	 */
846 847
	if (!p->pack_size && p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
848 849 850 851 852 853 854 855 856 857 858
	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) {
859
			size_t window_align = packed_git_window_size / 2;
860
			off_t len;
861 862 863 864

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

865
			win = xcalloc(1, sizeof(*win));
866
			win->offset = (offset / window_align) * window_align;
867 868 869 870
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
871
			pack_mapped += win->len;
872
			while (packed_git_limit < pack_mapped
873
				&& unuse_one_window(p, p->pack_fd))
874
				; /* nothing */
875
			win->base = xmmap(NULL, win->len,
876 877 878
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
879 880 881
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
882 883 884 885 886 887
			if (!win->offset && win->len == p->pack_size
				&& !p->do_not_close) {
				close(p->pack_fd);
				pack_open_fds--;
				p->pack_fd = -1;
			}
888 889 890 891 892 893
			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;
894 895 896
			win->next = p->windows;
			p->windows = win;
		}
897
	}
898 899 900 901 902
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
903
	offset -= win->offset;
904
	if (left)
905
		*left = win->len - xsize_t(offset);
906
	return win->base + offset;
907 908
}

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

917 918 919 920 921
static void try_to_free_pack_memory(size_t size)
{
	release_pack_memory(size, -1);
}

922
struct packed_git *add_packed_git(const char *path, int path_len, int local)
923
{
924
	static int have_set_try_to_free_routine;
925
	struct stat st;
926
	struct packed_git *p = alloc_packed_git(path_len + 2);
927

928 929 930 931 932
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

933 934 935 936 937
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
	path_len -= strlen(".idx");
938 939
	if (path_len < 1) {
		free(p);
940
		return NULL;
941
	}
942
	memcpy(p->pack_name, path, path_len);
943 944 945 946 947

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

948
	strcpy(p->pack_name + path_len, ".pack");
949
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
950
		free(p);
951 952
		return NULL;
	}
953

954 955 956 957
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
	p->pack_size = st.st_size;
958
	p->pack_local = local;
959
	p->mtime = st.st_mtime;
960 961
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
962 963 964
	return p;
}

965
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
966
{
967
	const char *path = sha1_pack_name(sha1);
968
	struct packed_git *p = alloc_packed_git(strlen(path) + 1);
969

970 971
	strcpy(p->pack_name, path);
	hashcpy(p->sha1, sha1);
972 973
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
974
		return NULL;
975
	}
976 977 978 979 980 981

	return p;
}

void install_packed_git(struct packed_git *pack)
{
982 983 984
	if (pack->pack_fd != -1)
		pack_open_fds++;

985 986 987 988
	pack->next = packed_git;
	packed_git = pack;
}

989
static void prepare_packed_git_one(char *objdir, int local)
990
{
991 992 993 994
	/* Ensure that this buffer is large enough so that we can
	   append "/pack/" without clobbering the stack even if
	   strlen(objdir) were PATH_MAX.  */
	char path[PATH_MAX + 1 + 4 + 1 + 1];
995 996 997 998 999 1000 1001
	int len;
	DIR *dir;
	struct dirent *de;

	sprintf(path, "%s/pack", objdir);
	len = strlen(path);
	dir = opendir(path);
1002
	if (!dir) {
J
Junio C Hamano 已提交
1003
		if (errno != ENOENT)
1004
			error("unable to open object pack directory: %s: %s",
J
Junio C Hamano 已提交
1005
			      path, strerror(errno));
1006
		return;
1007
	}
1008 1009 1010 1011 1012
	path[len++] = '/';
	while ((de = readdir(dir)) != NULL) {
		int namelen = strlen(de->d_name);
		struct packed_git *p;

1013
		if (!has_extension(de->d_name, ".idx"))
1014 1015
			continue;

1016 1017 1018
		if (len + namelen + 1 > sizeof(path))
			continue;

1019
		/* Don't reopen a pack we already have. */
1020
		strcpy(path + len, de->d_name);
1021 1022 1023 1024 1025 1026
		for (p = packed_git; p; p = p->next) {
			if (!memcmp(path, p->pack_name, len + namelen - 4))
				break;
		}
		if (p)
			continue;
1027 1028 1029
		/* See if it really is a valid .idx file with corresponding
		 * .pack file that we can map.
		 */
1030
		p = add_packed_git(path, len + namelen, local);
1031 1032
		if (!p)
			continue;
1033
		install_packed_git(p);
1034
	}
1035
	closedir(dir);
1036 1037
}

1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091
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);
}

1092
static int prepare_packed_git_run_once = 0;
1093
void prepare_packed_git(void)
1094
{
1095
	struct alternate_object_database *alt;
1096

1097
	if (prepare_packed_git_run_once)
1098
		return;
1099
	prepare_packed_git_one(get_object_directory(), 1);
1100
	prepare_alt_odb();
1101
	for (alt = alt_odb_list; alt; alt = alt->next) {
1102
		alt->name[-1] = 0;
1103
		prepare_packed_git_one(alt->base, 0);
1104
		alt->name[-1] = '/';
1105
	}
1106
	rearrange_packed_git();
1107 1108 1109
	prepare_packed_git_run_once = 1;
}

1110
void reprepare_packed_git(void)
1111
{
1112
	discard_revindex();
1113 1114
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1115 1116
}

1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128
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++;
}

1129
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1130 1131 1132 1133 1134 1135 1136
{
	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))
1137 1138
				return p;
	return NULL;
1139 1140
}

1141
int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
1142 1143
{
	unsigned char real_sha1[20];
1144
	hash_sha1_file(map, size, type, real_sha1);
1145
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1146 1147
}

1148
static int git_open_noatime(const char *name)
1149 1150 1151
{
	static int sha1_file_open_flag = O_NOATIME;

1152 1153
	for (;;) {
		int fd = open(name, O_RDONLY | sha1_file_open_flag);
1154
		if (fd >= 0)
1155 1156 1157 1158
			return fd;

		/* Might the failure be due to O_NOATIME? */
		if (errno != ENOENT && sha1_file_open_flag) {
1159
			sha1_file_open_flag = 0;
1160 1161 1162 1163
			continue;
		}

		return -1;
1164 1165 1166 1167 1168 1169 1170 1171 1172
	}
}

static int open_sha1_file(const unsigned char *sha1)
{
	int fd;
	char *name = sha1_file_name(sha1);
	struct alternate_object_database *alt;

1173
	fd = git_open_noatime(name);
1174 1175 1176 1177 1178 1179 1180 1181
	if (fd >= 0)
		return fd;

	prepare_alt_odb();
	errno = ENOENT;
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
		fill_sha1_path(name, sha1);
1182
		fd = git_open_noatime(alt->base);
1183 1184 1185 1186 1187 1188
		if (fd >= 0)
			return fd;
	}
	return -1;
}

1189
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1190 1191
{
	void *map;
1192
	int fd;
1193

1194 1195 1196 1197
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1198

1199 1200 1201
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1202
		}
1203
		close(fd);
1204 1205 1206 1207
	}
	return map;
}

1208 1209 1210 1211 1212 1213 1214 1215
/*
 * There used to be a second loose object header format which
 * was meant to mimic the in-pack format, allowing for direct
 * copy of the object data.  This format turned up not to be
 * really worth it and we no longer write loose objects in that
 * format.
 */
static int experimental_loose_object(unsigned char *map)
1216 1217 1218 1219
{
	unsigned int word;

	/*
1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244
	 * We must determine if the buffer contains the standard
	 * zlib-deflated stream or the experimental format based
	 * on the in-pack object format. Compare the header byte
	 * for each format:
	 *
	 * RFC1950 zlib w/ deflate : 0www1000 : 0 <= www <= 7
	 * Experimental pack-based : Stttssss : ttt = 1,2,3,4
	 *
	 * If bit 7 is clear and bits 0-3 equal 8, the buffer MUST be
	 * in standard loose-object format, UNLESS it is a Git-pack
	 * format object *exactly* 8 bytes in size when inflated.
	 *
	 * However, RFC1950 also specifies that the 1st 16-bit word
	 * must be divisible by 31 - this checksum tells us our buffer
	 * is in the standard format, giving a false positive only if
	 * the 1st word of the Git-pack format object happens to be
	 * divisible by 31, ie:
	 *      ((byte0 * 256) + byte1) % 31 = 0
	 *   =>        0ttt10000www1000 % 31 = 0
	 *
	 * As it happens, this case can only arise for www=3 & ttt=1
	 * - ie, a Commit object, which would have to be 8 bytes in
	 * size. As no Commit can be that small, we find that the
	 * combination of these two criteria (bitmask & checksum)
	 * can always correctly determine the buffer format.
1245 1246
	 */
	word = (map[0] << 8) + map[1];
1247
	if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1248
		return 0;
1249 1250
	else
		return 1;
1251 1252
}

1253 1254
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1255
{
1256
	unsigned shift;
1257
	unsigned long size, c;
1258 1259 1260 1261 1262 1263 1264
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1265
		if (len <= used || bitsizeof(long) <= shift) {
1266
			error("bad object header");
1267
			return 0;
1268
		}
1269 1270 1271 1272 1273 1274 1275 1276
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

J
Junio C Hamano 已提交
1277
int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1278 1279 1280 1281 1282 1283
{
	unsigned long size, used;
	static const char valid_loose_object_type[8] = {
		0, /* OBJ_EXT */
		1, 1, 1, 1, /* "commit", "tree", "blob", "tag" */
		0, /* "delta" and others are invalid in a loose object */
1284
	};
1285
	enum object_type type;
1286

1287 1288 1289 1290 1291
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1292 1293
	stream->avail_out = bufsiz;

1294 1295 1296 1297 1298 1299 1300 1301 1302 1303
	if (experimental_loose_object(map)) {
		/*
		 * The old experimental format we no longer produce;
		 * we can still read it.
		 */
		used = unpack_object_header_buffer(map, mapsize, &type, &size);
		if (!used || !valid_loose_object_type[type])
			return -1;
		map += used;
		mapsize -= used;
1304

1305 1306 1307 1308
		/* Set up the stream for the rest.. */
		stream->next_in = map;
		stream->avail_in = mapsize;
		git_inflate_init(stream);
1309

1310 1311 1312 1313 1314
		/* And generate the fake traditional header */
		stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
						 typename(type), size);
		return 0;
	}
1315
	git_inflate_init(stream);
1316
	return git_inflate(stream, 0);
1317 1318
}

1319
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1320 1321
{
	int bytes = strlen(buffer) + 1;
1322
	unsigned char *buf = xmallocz(size);
1323
	unsigned long n;
1324
	int status = Z_OK;
1325

1326 1327 1328 1329 1330
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1331 1332 1333 1334
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1335
		 * expect no more output and set avail_out to zero,
1336 1337 1338 1339 1340 1341 1342 1343 1344
		 * 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.
		 */
1345 1346
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1347
		while (status == Z_OK)
1348
			status = git_inflate(stream, Z_FINISH);
1349
	}
1350
	if (status == Z_STREAM_END && !stream->avail_in) {
1351
		git_inflate_end(stream);
1352 1353 1354 1355 1356 1357 1358 1359 1360 1361
		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;
1362 1363 1364 1365 1366 1367 1368
}

/*
 * 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.
 */
1369
int parse_sha1_header(const char *hdr, unsigned long *sizep)
1370
{
1371
	char type[10];
1372 1373 1374 1375
	int i;
	unsigned long size;

	/*
J
Junio C Hamano 已提交
1376
	 * The type can be at most ten bytes (including the
1377
	 * terminating '\0' that we add), and is followed by
1378
	 * a space.
1379
	 */
1380
	i = 0;
1381 1382 1383 1384
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1385 1386
		type[i++] = c;
		if (i >= sizeof(type))
1387 1388
			return -1;
	}
1389
	type[i] = 0;
1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411

	/*
	 * The length must follow immediately, and be in canonical
	 * decimal format (ie "010" is not valid).
	 */
	size = *hdr++ - '0';
	if (size > 9)
		return -1;
	if (size) {
		for (;;) {
			unsigned long c = *hdr - '0';
			if (c > 9)
				break;
			hdr++;
			size = size * 10 + c;
		}
	}
	*sizep = size;

	/*
	 * The length must be followed by a zero byte
	 */
1412
	return *hdr ? -1 : type_from_string(type);
1413 1414
}

1415
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1416
{
1417
	int ret;
1418
	git_zstream stream;
1419
	char hdr[8192];
1420

1421
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1422
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1423 1424
		return NULL;

1425
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1426 1427
}

N
Nicolas Pitre 已提交
1428 1429 1430 1431 1432 1433
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;
1434
	git_zstream stream;
N
Nicolas Pitre 已提交
1435 1436 1437 1438 1439 1440
	int st;

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

1441
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
1442 1443 1444
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
1445
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
1446 1447 1448
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
1449
	git_inflate_end(&stream);
1450 1451 1452 1453
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466

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

1467
static off_t get_delta_base(struct packed_git *p,
1468
				    struct pack_window **w_curs,
1469
				    off_t *curpos,
1470
				    enum object_type type,
1471
				    off_t delta_obj_offset)
1472
{
1473
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1474
	off_t base_offset;
1475

1476 1477 1478 1479 1480 1481
	/* 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.
	 */
1482
	if (type == OBJ_OFS_DELTA) {
1483 1484 1485 1486 1487
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1488
			if (!base_offset || MSB(base_offset, 7))
1489
				return 0;  /* overflow */
1490 1491 1492 1493
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
1494
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
1495
			return 0;  /* out of bound */
1496
		*curpos += used;
1497
	} else if (type == OBJ_REF_DELTA) {
1498 1499
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
1500
		*curpos += 20;
1501 1502
	} else
		die("I am totally screwed");
1503
	return base_offset;
1504 1505
}

J
Junio C Hamano 已提交
1506
/* forward declaration for a mutually recursive function */
1507
static int packed_object_info(struct packed_git *p, off_t offset,
1508
			      unsigned long *sizep, int *rtype);
J
Junio C Hamano 已提交
1509

N
Nicolas Pitre 已提交
1510
static int packed_delta_info(struct packed_git *p,
1511
			     struct pack_window **w_curs,
1512
			     off_t curpos,
1513
			     enum object_type type,
1514
			     off_t obj_offset,
N
Nicolas Pitre 已提交
1515
			     unsigned long *sizep)
1516
{
1517
	off_t base_offset;
J
Junio C Hamano 已提交
1518

1519
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1520 1521
	if (!base_offset)
		return OBJ_BAD;
1522
	type = packed_object_info(p, base_offset, NULL, NULL);
1523
	if (type <= OBJ_NONE) {
1524 1525 1526 1527 1528 1529
		struct revindex_entry *revidx;
		const unsigned char *base_sha1;
		revidx = find_pack_revindex(p, base_offset);
		if (!revidx)
			return OBJ_BAD;
		base_sha1 = nth_packed_object_sha1(p, revidx->nr);
1530 1531 1532 1533 1534
		mark_bad_packed_object(p, base_sha1);
		type = sha1_object_info(base_sha1, NULL);
		if (type <= OBJ_NONE)
			return OBJ_BAD;
	}
J
Junio C Hamano 已提交
1535

1536 1537 1538 1539 1540
	/* We choose to only get the type of the base object and
	 * ignore potentially corrupt pack file that expects the delta
	 * based on a base with a wrong size.  This saves tons of
	 * inflate() calls.
	 */
1541
	if (sizep) {
N
Nicolas Pitre 已提交
1542
		*sizep = get_size_from_delta(p, w_curs, curpos);
1543 1544 1545
		if (*sizep == 0)
			type = OBJ_BAD;
	}
1546 1547

	return type;
1548 1549
}

1550 1551 1552 1553
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
1554
{
1555
	unsigned char *base;
1556
	unsigned long left;
1557
	unsigned long used;
1558
	enum object_type type;
1559

1560
	/* use_pack() assures us we have [base, base + 20) available
1561
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
1562
	 * size that is assured.)  With our object header encoding
1563 1564 1565
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1566
	base = use_pack(p, w_curs, *curpos, &left);
1567 1568 1569 1570 1571
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
1572

1573
	return type;
1574 1575
}

1576
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1577
			      unsigned long *sizep, int *rtype)
1578
{
1579
	struct pack_window *w_curs = NULL;
1580 1581
	unsigned long size;
	off_t curpos = obj_offset;
1582
	enum object_type type;
1583

1584
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1585 1586
	if (rtype)
		*rtype = type; /* representation type */
1587

1588
	switch (type) {
1589 1590
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1591 1592
		type = packed_delta_info(p, &w_curs, curpos,
					 type, obj_offset, sizep);
1593
		break;
1594 1595 1596 1597
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1598 1599
		if (sizep)
			*sizep = size;
1600
		break;
1601
	default:
1602 1603 1604
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
1605
	}
1606
	unuse_pack(&w_curs);
1607
	return type;
1608 1609
}

1610
static void *unpack_compressed_entry(struct packed_git *p,
1611
				    struct pack_window **w_curs,
1612
				    off_t curpos,
1613
				    unsigned long size)
1614 1615
{
	int st;
1616
	git_zstream stream;
1617
	unsigned char *buffer, *in;
1618

1619
	buffer = xmallocz(size);
1620 1621
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
1622
	stream.avail_out = size + 1;
1623

1624
	git_inflate_init(&stream);
1625
	do {
1626
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1627
		stream.next_in = in;
1628
		st = git_inflate(&stream, Z_FINISH);
1629 1630
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
1631
		curpos += stream.next_in - in;
1632
	} while (st == Z_OK || st == Z_BUF_ERROR);
1633
	git_inflate_end(&stream);
1634 1635 1636 1637 1638 1639 1640 1641
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1642 1643
#define MAX_DELTA_CACHE (256)

1644
static size_t delta_base_cached;
1645 1646 1647 1648 1649 1650

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

1651
static struct delta_base_cache_entry {
1652 1653
	struct delta_base_cache_lru_list lru;
	void *data;
1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665
	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);
1666
	return hash % MAX_DELTA_CACHE;
1667 1668
}

1669 1670 1671 1672 1673 1674 1675
static int in_delta_base_cache(struct packed_git *p, off_t base_offset)
{
	unsigned long hash = pack_entry_hash(p, base_offset);
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
	return (ent->data && ent->p == p && ent->base_offset == base_offset);
}

1676
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1677
	unsigned long *base_size, enum object_type *type, int keep_cache)
1678
{
1679 1680 1681 1682 1683
	void *ret;
	unsigned long hash = pack_entry_hash(p, base_offset);
	struct delta_base_cache_entry *ent = delta_base_cache + hash;

	ret = ent->data;
1684 1685
	if (!ret || ent->p != p || ent->base_offset != base_offset)
		return unpack_entry(p, base_offset, type, base_size);
1686

1687
	if (!keep_cache) {
1688
		ent->data = NULL;
1689 1690
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1691
		delta_base_cached -= ent->size;
P
Pierre Habouzit 已提交
1692 1693
	} else {
		ret = xmemdupz(ent->data, ent->size);
1694
	}
1695 1696 1697
	*type = ent->type;
	*base_size = ent->size;
	return ret;
1698 1699
}

1700 1701 1702 1703 1704
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
1705 1706
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1707 1708 1709 1710
		delta_base_cached -= ent->size;
	}
}

1711 1712 1713 1714 1715 1716 1717
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]);
}

1718 1719 1720
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
1721
	unsigned long hash = pack_entry_hash(p, base_offset);
1722
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
1723
	struct delta_base_cache_lru_list *lru;
1724

1725 1726
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1727 1728 1729 1730 1731 1732

	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;
1733 1734 1735
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
1736 1737 1738 1739 1740 1741 1742
	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);
	}
1743

1744 1745 1746 1747 1748
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
1749 1750 1751 1752
	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;
1753 1754
}

1755 1756 1757
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

1758
static void *unpack_delta_entry(struct packed_git *p,
1759
				struct pack_window **w_curs,
1760
				off_t curpos,
1761
				unsigned long delta_size,
1762
				off_t obj_offset,
1763
				enum object_type *type,
1764
				unsigned long *sizep)
1765
{
1766
	void *delta_data, *result, *base;
1767 1768
	unsigned long base_size;
	off_t base_offset;
N
Nicolas Pitre 已提交
1769

1770
	base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1771 1772 1773 1774 1775 1776
	if (!base_offset) {
		error("failed to validate delta base reference "
		      "at offset %"PRIuMAX" from %s",
		      (uintmax_t)curpos, p->pack_name);
		return NULL;
	}
1777
	unuse_pack(w_curs);
1778
	base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1779 1780 1781 1782 1783 1784 1785
	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.
		 */
1786 1787 1788 1789 1790 1791
		struct revindex_entry *revidx;
		const unsigned char *base_sha1;
		revidx = find_pack_revindex(p, base_offset);
		if (!revidx)
			return NULL;
		base_sha1 = nth_packed_object_sha1(p, revidx->nr);
1792 1793 1794 1795 1796
		error("failed to read delta base object %s"
		      " at offset %"PRIuMAX" from %s",
		      sha1_to_hex(base_sha1), (uintmax_t)base_offset,
		      p->pack_name);
		mark_bad_packed_object(p, base_sha1);
1797
		base = read_object(base_sha1, type, &base_size);
1798 1799 1800
		if (!base)
			return NULL;
	}
1801

1802
	delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1803 1804 1805 1806 1807 1808 1809
	if (!delta_data) {
		error("failed to unpack compressed delta "
		      "at offset %"PRIuMAX" from %s",
		      (uintmax_t)curpos, p->pack_name);
		free(base);
		return NULL;
	}
1810 1811
	result = patch_delta(base, base_size,
			     delta_data, delta_size,
1812
			     sizep);
1813 1814 1815
	if (!result)
		die("failed to apply delta");
	free(delta_data);
1816
	add_delta_base_cache(p, base_offset, base, base_size, *type);
1817 1818 1819
	return result;
}

1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837
static void write_pack_access_log(struct packed_git *p, off_t obj_offset)
{
	static FILE *log_file;

	if (!log_file) {
		log_file = fopen(log_pack_access, "w");
		if (!log_file) {
			error("cannot open pack access log '%s' for writing: %s",
			      log_pack_access, strerror(errno));
			log_pack_access = NULL;
			return;
		}
	}
	fprintf(log_file, "%s %"PRIuMAX"\n",
		p->pack_name, (uintmax_t)obj_offset);
	fflush(log_file);
}

1838 1839
int do_check_packed_object_crc;

1840
void *unpack_entry(struct packed_git *p, off_t obj_offset,
1841
		   enum object_type *type, unsigned long *sizep)
1842
{
1843
	struct pack_window *w_curs = NULL;
1844
	off_t curpos = obj_offset;
1845
	void *data;
1846

1847 1848 1849
	if (log_pack_access)
		write_pack_access_log(p, obj_offset);

1850 1851 1852 1853 1854 1855 1856 1857 1858
	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);
1859
			unuse_pack(&w_curs);
1860 1861 1862 1863
			return NULL;
		}
	}

1864 1865
	*type = unpack_object_header(p, &w_curs, &curpos, sizep);
	switch (*type) {
1866 1867
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1868 1869
		data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
					  obj_offset, type, sizep);
1870
		break;
1871 1872 1873 1874
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1875
		data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1876
		break;
1877
	default:
1878 1879 1880
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      *type, (uintmax_t)obj_offset, p->pack_name);
1881
	}
1882
	unuse_pack(&w_curs);
1883
	return data;
1884 1885
}

1886
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1887
					    uint32_t n)
1888
{
1889
	const unsigned char *index = p->index_data;
1890 1891 1892 1893 1894
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
1895
	if (n >= p->num_objects)
1896
		return NULL;
1897 1898 1899 1900 1901 1902 1903 1904 1905
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

N
Nicolas Pitre 已提交
1906
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921
{
	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)));
	}
1922 1923
}

1924
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
1925
				  struct packed_git *p)
1926
{
1927 1928
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
1929 1930 1931 1932 1933 1934
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

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

1936 1937 1938 1939 1940 1941
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
1942 1943 1944 1945
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
1946
	index += 4 * 256;
1947 1948
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1949 1950 1951 1952 1953 1954 1955 1956
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
1957
		printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968
		       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);
	}
1969 1970

	do {
1971
		unsigned mi = (lo + hi) / 2;
1972 1973 1974 1975 1976
		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 已提交
1977
		if (!cmp)
1978
			return nth_packed_object_offset(p, mi);
1979 1980 1981 1982 1983 1984 1985 1986
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

1987
int is_pack_valid(struct packed_git *p)
1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007
{
	/* 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);
}

2008
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2009
{
2010
	static struct packed_git *last_found = (void *)1;
2011
	struct packed_git *p;
2012
	off_t offset;
N
Nicolas Pitre 已提交
2013

2014
	prepare_packed_git();
2015 2016 2017
	if (!packed_git)
		return 0;
	p = (last_found == (void *)1) ? packed_git : last_found;
2018

2019
	do {
2020 2021 2022 2023 2024 2025 2026
		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))
					goto next;
		}

N
Nicolas Pitre 已提交
2027 2028
		offset = find_pack_entry_one(sha1, p);
		if (offset) {
2029 2030 2031 2032 2033 2034 2035 2036
			/*
			 * 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!
			 */
2037
			if (!is_pack_valid(p)) {
2038
				error("packfile %s cannot be accessed", p->pack_name);
2039
				goto next;
2040
			}
N
Nicolas Pitre 已提交
2041 2042 2043
			e->offset = offset;
			e->p = p;
			hashcpy(e->sha1, sha1);
2044
			last_found = p;
2045
			return 1;
N
Nicolas Pitre 已提交
2046
		}
2047 2048 2049 2050 2051 2052 2053 2054 2055

		next:
		if (p == last_found)
			p = packed_git;
		else
			p = p->next;
		if (p == last_found)
			p = p->next;
	} while (p);
2056 2057 2058
	return 0;
}

J
Junio C Hamano 已提交
2059
struct packed_git *find_sha1_pack(const unsigned char *sha1,
2060 2061 2062 2063 2064
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
2065
		if (find_pack_entry_one(sha1, p))
2066 2067 2068
			return p;
	}
	return NULL;
2069

2070 2071
}

2072
static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
2073
{
2074
	int status;
2075 2076
	unsigned long mapsize, size;
	void *map;
2077
	git_zstream stream;
N
Nicolas Pitre 已提交
2078
	char hdr[32];
2079

2080
	map = map_sha1_file(sha1, &mapsize);
2081 2082
	if (!map)
		return error("unable to find %s", sha1_to_hex(sha1));
2083 2084 2085
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
2086
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
2087
		status = error("unable to parse %s header", sha1_to_hex(sha1));
2088 2089
	else if (sizep)
		*sizep = size;
2090
	git_inflate_end(&stream);
2091 2092 2093 2094
	munmap(map, mapsize);
	return status;
}

2095 2096
/* returns enum object_type or negative */
int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi)
2097
{
2098
	struct cached_object *co;
2099
	struct pack_entry e;
2100
	int status, rtype;
2101

2102 2103
	co = find_cached_object(sha1);
	if (co) {
2104 2105 2106
		if (oi->sizep)
			*(oi->sizep) = co->size;
		oi->whence = OI_CACHED;
2107 2108 2109
		return co->type;
	}

2110
	if (!find_pack_entry(sha1, &e)) {
2111
		/* Most likely it's a loose object. */
2112 2113 2114
		status = sha1_loose_object_info(sha1, oi->sizep);
		if (status >= 0) {
			oi->whence = OI_LOOSE;
2115
			return status;
2116
		}
2117 2118

		/* Not a loose object; someone else may have just packed it. */
2119
		reprepare_packed_git();
2120
		if (!find_pack_entry(sha1, &e))
2121
			return status;
2122
	}
2123

2124
	status = packed_object_info(e.p, e.offset, oi->sizep, &rtype);
2125 2126
	if (status < 0) {
		mark_bad_packed_object(e.p, sha1);
2127
		status = sha1_object_info_extended(sha1, oi);
2128 2129
	} else if (in_delta_base_cache(e.p, e.offset)) {
		oi->whence = OI_DBCACHED;
2130 2131 2132 2133 2134 2135
	} 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);
2136 2137 2138
	}

	return status;
2139 2140
}

2141 2142 2143 2144 2145 2146 2147 2148
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
{
	struct object_info oi;

	oi.sizep = sizep;
	return sha1_object_info_extended(sha1, &oi);
}

2149 2150
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
2151 2152
{
	struct pack_entry e;
2153
	void *data;
2154

2155
	if (!find_pack_entry(sha1, &e))
2156
		return NULL;
2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167
	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);
2168
		data = read_object(sha1, type, size);
2169 2170
	}
	return data;
2171 2172
}

2173 2174
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2175 2176 2177
{
	struct cached_object *co;

2178
	hash_sha1_file(buf, len, typename(type), sha1);
2179 2180 2181 2182 2183 2184 2185 2186 2187 2188
	if (has_sha1_file(sha1) || find_cached_object(sha1))
		return 0;
	if (cached_object_alloc <= cached_object_nr) {
		cached_object_alloc = alloc_nr(cached_object_alloc);
		cached_objects = xrealloc(cached_objects,
					  sizeof(*cached_objects) *
					  cached_object_alloc);
	}
	co = &cached_objects[cached_object_nr++];
	co->size = len;
2189
	co->type = type;
J
Junio C Hamano 已提交
2190 2191
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
2192 2193 2194 2195
	hashcpy(co->sha1, sha1);
	return 0;
}

2196 2197
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size)
2198 2199 2200
{
	unsigned long mapsize;
	void *map, *buf;
2201 2202 2203 2204
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
2205
		*type = co->type;
2206
		*size = co->size;
P
Pierre Habouzit 已提交
2207
		return xmemdupz(co->buf, co->size);
2208
	}
2209

2210 2211 2212
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
2213
	map = map_sha1_file(sha1, &mapsize);
2214
	if (map) {
2215
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2216 2217 2218
		munmap(map, mapsize);
		return buf;
	}
2219
	reprepare_packed_git();
2220
	return read_packed_sha1(sha1, type, size);
2221 2222
}

2223 2224 2225 2226 2227
/*
 * 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.
 */
2228 2229 2230 2231
void *read_sha1_file_extended(const unsigned char *sha1,
			      enum object_type *type,
			      unsigned long *size,
			      unsigned flag)
2232
{
2233
	void *data;
2234
	char *path;
2235
	const struct packed_git *p;
2236 2237
	const unsigned char *repl = (flag & READ_SHA1_FILE_REPLACE)
		? lookup_replace_object(sha1) : sha1;
2238

2239 2240
	errno = 0;
	data = read_object(repl, type, size);
2241
	if (data)
2242
		return data;
2243

2244
	if (errno && errno != ENOENT)
2245 2246
		die_errno("failed to read object %s", sha1_to_hex(sha1));

2247
	/* die if we replaced an object with one that does not exist */
2248
	if (repl != sha1)
2249 2250 2251
		die("replacement %s not found for %s",
		    sha1_to_hex(repl), sha1_to_hex(sha1));

2252 2253 2254 2255
	if (has_loose_object(repl)) {
		path = sha1_file_name(sha1);
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
2256
	}
2257

2258 2259 2260
	if ((p = has_packed_and_bad(repl)) != NULL)
		die("packed object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), p->pack_name);
2261

2262
	return NULL;
2263 2264
}

2265
void *read_object_with_reference(const unsigned char *sha1,
2266
				 const char *required_type_name,
2267 2268
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
2269
{
2270
	enum object_type type, required_type;
2271 2272
	void *buffer;
	unsigned long isize;
2273
	unsigned char actual_sha1[20];
2274

2275
	required_type = type_from_string(required_type_name);
2276
	hashcpy(actual_sha1, sha1);
2277 2278 2279
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
2280

2281
		buffer = read_sha1_file(actual_sha1, &type, &isize);
2282 2283
		if (!buffer)
			return NULL;
2284
		if (type == required_type) {
2285 2286
			*size = isize;
			if (actual_sha1_return)
2287
				hashcpy(actual_sha1_return, actual_sha1);
2288 2289 2290
			return buffer;
		}
		/* Handle references */
2291
		else if (type == OBJ_COMMIT)
2292
			ref_type = "tree ";
2293
		else if (type == OBJ_TAG)
2294 2295 2296 2297 2298 2299
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
2300

2301 2302
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
2303
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2304 2305 2306
			free(buffer);
			return NULL;
		}
2307
		free(buffer);
2308 2309
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
2310 2311 2312
	}
}

N
Nicolas Pitre 已提交
2313
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
2314
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
2315
                                    char *hdr, int *hdrlen)
2316
{
2317
	git_SHA_CTX c;
2318 2319

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

	/* Sha1.. */
2323 2324 2325 2326
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
2327 2328
}

2329
/*
2330 2331 2332 2333
 * Move the just written object into its final resting place.
 * NEEDSWORK: this should be renamed to finalize_temp_file() as
 * "moving" is only a part of what it does, when no patch between
 * master to pu changes the call sites of this function.
2334
 */
2335
int move_temp_to_file(const char *tmpfile, const char *filename)
2336
{
2337
	int ret = 0;
2338

2339
	if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2340 2341
		goto try_rename;
	else if (link(tmpfile, filename))
2342
		ret = errno;
2343 2344 2345 2346 2347 2348 2349 2350 2351

	/*
	 * 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.
	 *
2352
	 * When this succeeds, we just return.  We have nothing
2353 2354 2355
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
2356
	try_rename:
2357
		if (!rename(tmpfile, filename))
2358
			goto out;
2359
		ret = errno;
2360
	}
2361
	unlink_or_warn(tmpfile);
2362 2363
	if (ret) {
		if (ret != EEXIST) {
2364
			return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
2365 2366 2367 2368
		}
		/* FIXME!!! Collision check here ? */
	}

2369
out:
2370
	if (adjust_shared_perm(filename))
2371
		return error("unable to set permission to '%s'", filename);
2372 2373 2374
	return 0;
}

L
Linus Torvalds 已提交
2375 2376
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2377
	if (write_in_full(fd, buf, len) < 0)
2378
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2379 2380 2381
	return 0;
}

N
Nicolas Pitre 已提交
2382
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2383 2384
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2385
	char hdr[32];
R
Rene Scharfe 已提交
2386 2387 2388 2389 2390
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

2391 2392 2393
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
2394 2395
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
2396
	if (close(fd) != 0)
2397
		die_errno("error when closing sha1 file");
2398 2399
}

2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425
/* 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");
2426
	fd = git_mkstemp_mode(buffer, 0444);
2427
	if (fd < 0 && dirlen && errno == ENOENT) {
2428
		/* Make sure the directory exists */
P
Patrick Higgins 已提交
2429
		memcpy(buffer, filename, dirlen);
2430
		buffer[dirlen-1] = 0;
2431
		if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2432 2433 2434 2435
			return -1;

		/* Try again */
		strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2436
		fd = git_mkstemp_mode(buffer, 0444);
2437 2438 2439 2440
	}
	return fd;
}

2441
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2442
			      const void *buf, unsigned long len, time_t mtime)
2443
{
2444
	int fd, ret;
2445
	unsigned char compressed[4096];
2446
	git_zstream stream;
2447 2448
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
2449
	char *filename;
2450
	static char tmpfile[PATH_MAX];
2451

R
Rene Scharfe 已提交
2452
	filename = sha1_file_name(sha1);
2453
	fd = create_tmpfile(tmpfile, sizeof(tmpfile), filename);
2454
	if (fd < 0) {
2455
		if (errno == EACCES)
2456 2457 2458
			return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
		else
			return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
2459 2460
	}

2461 2462
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2463
	git_deflate_init(&stream, zlib_compression_level);
2464
	stream.next_out = compressed;
2465
	stream.avail_out = sizeof(compressed);
2466
	git_SHA1_Init(&c);
2467 2468

	/* First header.. */
N
Nicolas Pitre 已提交
2469
	stream.next_in = (unsigned char *)hdr;
2470
	stream.avail_in = hdrlen;
2471 2472
	while (git_deflate(&stream, 0) == Z_OK)
		; /* nothing */
2473
	git_SHA1_Update(&c, hdr, hdrlen);
2474 2475

	/* Then the data itself.. */
2476
	stream.next_in = (void *)buf;
2477
	stream.avail_in = len;
2478
	do {
2479
		unsigned char *in0 = stream.next_in;
2480
		ret = git_deflate(&stream, Z_FINISH);
2481
		git_SHA1_Update(&c, in0, stream.next_in - in0);
2482 2483 2484 2485 2486 2487
		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);

2488 2489
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2490
	ret = git_deflate_end_gently(&stream);
2491 2492
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2493 2494 2495
	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));
2496

2497
	close_sha1_file(fd);
2498

2499 2500 2501 2502 2503 2504 2505 2506 2507
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
		if (utime(tmpfile, &utb) < 0)
			warning("failed utime() on %s: %s",
				tmpfile, strerror(errno));
	}

2508
	return move_temp_to_file(tmpfile, filename);
2509
}
2510

2511
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534
{
	unsigned char sha1[20];
	char hdr[32];
	int hdrlen;

	/* Normally if we have it in the pack then we do not bother writing
	 * it out into .git/objects/??/?{38} file.
	 */
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	if (returnsha1)
		hashcpy(returnsha1, sha1);
	if (has_sha1_file(sha1))
		return 0;
	return write_loose_object(sha1, hdr, hdrlen, buf, len, 0);
}

int force_object_loose(const unsigned char *sha1, time_t mtime)
{
	void *buf;
	unsigned long len;
	enum object_type type;
	char hdr[32];
	int hdrlen;
2535
	int ret;
2536

2537
	if (has_loose_object(sha1))
2538 2539 2540 2541 2542
		return 0;
	buf = read_packed_sha1(sha1, &type, &len);
	if (!buf)
		return error("cannot read sha1_file for %s", sha1_to_hex(sha1));
	hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
2543 2544 2545 2546
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
2547 2548
}

2549 2550 2551 2552 2553 2554 2555 2556
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

2557 2558 2559 2560 2561 2562
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

2563 2564
int has_sha1_file(const unsigned char *sha1)
{
2565 2566
	struct pack_entry e;

2567
	if (find_pack_entry(sha1, &e))
2568
		return 1;
2569
	return has_loose_object(sha1);
2570
}
J
Junio C Hamano 已提交
2571

2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599
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");
}

2600
static int index_mem(unsigned char *sha1, void *buf, size_t size,
2601 2602
		     enum object_type type,
		     const char *path, unsigned flags)
2603
{
L
Linus Torvalds 已提交
2604
	int ret, re_allocated = 0;
2605
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
2606

2607
	if (!type)
2608
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2609 2610 2611 2612

	/*
	 * Convert blobs to git internal format
	 */
2613
	if ((type == OBJ_BLOB) && path) {
2614
		struct strbuf nbuf = STRBUF_INIT;
2615 2616
		if (convert_to_git(path, buf, size, &nbuf,
		                   write_object ? safe_crlf : 0)) {
2617
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
2618 2619 2620
			re_allocated = 1;
		}
	}
2621
	if (flags & HASH_FORMAT_CHECK) {
2622 2623 2624 2625 2626 2627 2628
		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 已提交
2629

2630
	if (write_object)
2631
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
2632
	else
2633
		ret = hash_sha1_file(buf, size, typename(type), sha1);
2634
	if (re_allocated)
L
Linus Torvalds 已提交
2635
		free(buf);
2636 2637 2638
	return ret;
}

2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652
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;
}

2653 2654
#define SMALL_FILE_SIZE (32*1024)

2655 2656 2657
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
2658 2659 2660
{
	int ret;

2661
	if (!size) {
2662
		ret = index_mem(sha1, NULL, size, type, path, flags);
2663 2664 2665
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
2666
			ret = index_mem(sha1, buf, size, type, path, flags);
2667 2668 2669
		else
			ret = error("short read %s", strerror(errno));
		free(buf);
2670
	} else {
2671
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
2672
		ret = index_mem(sha1, buf, size, type, path, flags);
2673
		munmap(buf, size);
2674
	}
2675 2676 2677
	return ret;
}

2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725
/*
 * This creates one packfile per large blob, because the caller
 * immediately wants the result sha1, and fast-import can report the
 * object name via marks mechanism only by closing the created
 * packfile.
 *
 * 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
 * (or equivalent in-core API described above), but 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, and
 * by definition they do _not_ want to get any conversion.
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
	struct child_process fast_import;
	char export_marks[512];
	const char *argv[] = { "fast-import", "--quiet", export_marks, NULL };
	char tmpfile[512];
	char fast_import_cmd[512];
	char buf[512];
	int len, tmpfd;

	strcpy(tmpfile, git_path("hashstream_XXXXXX"));
	tmpfd = git_mkstemp_mode(tmpfile, 0600);
	if (tmpfd < 0)
		die_errno("cannot create tempfile: %s", tmpfile);
	if (close(tmpfd))
		die_errno("cannot close tempfile: %s", tmpfile);
	sprintf(export_marks, "--export-marks=%s", tmpfile);

	memset(&fast_import, 0, sizeof(fast_import));
	fast_import.in = -1;
	fast_import.argv = argv;
	fast_import.git_cmd = 1;
	if (start_command(&fast_import))
		die_errno("index-stream: git fast-import failed");

	len = sprintf(fast_import_cmd, "blob\nmark :1\ndata %lu\n",
		      (unsigned long) size);
	write_or_whine(fast_import.in, fast_import_cmd, len,
		       "index-stream: feeding fast-import");
	while (size) {
		char buf[10240];
		size_t sz = size < sizeof(buf) ? size : sizeof(buf);
2726
		ssize_t actual;
2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756

		actual = read_in_full(fd, buf, sz);
		if (actual < 0)
			die_errno("index-stream: reading input");
		if (write_in_full(fast_import.in, buf, actual) != actual)
			die_errno("index-stream: feeding fast-import");
		size -= actual;
	}
	if (close(fast_import.in))
		die_errno("index-stream: closing fast-import");
	if (finish_command(&fast_import))
		die_errno("index-stream: finishing fast-import");

	tmpfd = open(tmpfile, O_RDONLY);
	if (tmpfd < 0)
		die_errno("index-stream: cannot open fast-import mark");
	len = read(tmpfd, buf, sizeof(buf));
	if (len < 0)
		die_errno("index-stream: reading fast-import mark");
	if (close(tmpfd) < 0)
		die_errno("index-stream: closing fast-import mark");
	if (unlink(tmpfile))
		die_errno("index-stream: unlinking fast-import mark");
	if (len != 44 ||
	    memcmp(":1 ", buf, 3) ||
	    get_sha1_hex(buf + 3, sha1))
		die_errno("index-stream: unexpected fast-import mark: <%s>", buf);
	return 0;
}

2757 2758 2759 2760 2761 2762 2763 2764
int index_fd(unsigned char *sha1, int fd, struct stat *st,
	     enum object_type type, const char *path, unsigned flags)
{
	int ret;
	size_t size = xsize_t(st->st_size);

	if (!S_ISREG(st->st_mode))
		ret = index_pipe(sha1, fd, type, path, flags);
2765
	else if (size <= big_file_threshold || type != OBJ_BLOB)
2766
		ret = index_core(sha1, fd, size, type, path, flags);
2767 2768
	else
		ret = index_stream(sha1, fd, size, type, path, flags);
2769
	close(fd);
2770
	return ret;
J
Junio C Hamano 已提交
2771
}
2772

2773
int index_path(unsigned char *sha1, const char *path, struct stat *st, unsigned flags)
2774 2775
{
	int fd;
2776
	struct strbuf sb = STRBUF_INIT;
2777 2778 2779 2780 2781 2782 2783

	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));
2784
		if (index_fd(sha1, fd, st, OBJ_BLOB, path, flags) < 0)
2785 2786 2787 2788
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
2789
		if (strbuf_readlink(&sb, path, st->st_size)) {
2790 2791 2792 2793
			char *errstr = strerror(errno);
			return error("readlink(\"%s\"): %s", path,
			             errstr);
		}
2794
		if (!(flags & HASH_WRITE_OBJECT))
2795 2796
			hash_sha1_file(sb.buf, sb.len, blob_type, sha1);
		else if (write_sha1_file(sb.buf, sb.len, blob_type, sha1))
2797 2798
			return error("%s: failed to insert into database",
				     path);
2799
		strbuf_release(&sb);
2800
		break;
2801 2802
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
2803 2804 2805 2806 2807
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
2808 2809 2810

int read_pack_header(int fd, struct pack_header *header)
{
2811 2812 2813 2814
	if (read_in_full(fd, header, sizeof(*header)) < sizeof(*header))
		/* "eof before pack header was fully read" */
		return PH_ERROR_EOF;

2815 2816 2817 2818 2819 2820 2821 2822
	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 已提交
2823 2824 2825 2826 2827 2828 2829 2830 2831 2832

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