sha1_file.c 71.7 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
	struct alternate_object_database *ent;
	struct alternate_object_database *alt;
251 252
	int pfxlen, entlen;
	struct strbuf pathbuf = STRBUF_INIT;
253

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

260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
	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 已提交
275 276 277 278 279 280

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

	/* Detect cases where alternate disappeared */
281
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
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 324 325 326
		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;
	}

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

M
Martin Waitz 已提交
353
static void read_info_alternates(const char * relative_base, int depth)
354
{
355
	char *map;
356
	size_t mapsz;
357
	struct stat st;
358 359 360 361 362
	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 已提交
363
	int fd;
364

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

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

379
	munmap(map, mapsz);
380 381
}

382 383 384
void add_to_alternates_file(const char *reference)
{
	struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
385
	int fd = hold_lock_file_for_append(lock, git_path("objects/info/alternates"), LOCK_DIE_ON_ERROR);
386
	char *alt = mkpath("%s\n", reference);
387 388 389 390 391 392 393
	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);
}

394 395 396 397 398 399 400 401 402 403
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 已提交
404 405
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
406
	const char *alt;
M
Martin Waitz 已提交
407

S
Shawn O. Pearce 已提交
408 409 410
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
411 412 413 414
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
415
	link_alt_odb_entries(alt, alt + strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
416 417 418 419

	read_info_alternates(get_object_directory(), 0);
}

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

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

438 439 440 441 442 443
static int has_loose_object(const unsigned char *sha1)
{
	return has_loose_object_local(sha1) ||
	       has_loose_object_nonlocal(sha1);
}

444
static unsigned int pack_used_ctr;
445 446 447
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
448 449
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
450
static size_t peak_pack_mapped;
451
static size_t pack_mapped;
452
struct packed_git *packed_git;
453

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

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

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

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

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

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

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

577
int open_pack_index(struct packed_git *p)
578 579 580 581 582 583 584 585 586 587 588 589 590 591
{
	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;
}

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

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

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

648 649 650 651 652 653 654 655 656 657 658 659 660 661 662
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;
}

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

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

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

696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712
/*
 * 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) {
713
			clear_delta_base_cache();
714
			close_pack_windows(p);
715
			if (p->pack_fd != -1) {
716
				close(p->pack_fd);
717 718
				pack_open_fds--;
			}
719
			close_pack_index(p);
720 721 722 723 724 725 726 727 728
			free(p->bad_object_sha1);
			*pp = p->next;
			free(p);
			return;
		}
		pp = &p->next;
	}
}

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

741 742 743
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762
	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 */

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

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

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

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

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

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

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

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

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

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

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

912 913 914 915 916 917 918 919
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;
}

920 921 922 923 924
static void try_to_free_pack_memory(size_t size)
{
	release_pack_memory(size, -1);
}

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

931 932 933 934 935
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

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

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

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

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

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

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

	return p;
}

void install_packed_git(struct packed_git *pack)
{
985 986 987
	if (pack->pack_fd != -1)
		pack_open_fds++;

988 989 990 991
	pack->next = packed_git;
	packed_git = pack;
}

992
static void prepare_packed_git_one(char *objdir, int local)
993
{
994 995 996 997
	/* 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];
998 999 1000 1001 1002 1003 1004
	int len;
	DIR *dir;
	struct dirent *de;

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

1016
		if (!has_extension(de->d_name, ".idx"))
1017 1018
			continue;

1019 1020 1021
		if (len + namelen + 1 > sizeof(path))
			continue;

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

1095
static int prepare_packed_git_run_once = 0;
1096
void prepare_packed_git(void)
1097
{
1098
	struct alternate_object_database *alt;
1099

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

1113
void reprepare_packed_git(void)
1114
{
1115
	discard_revindex();
1116 1117
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1118 1119
}

1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131
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++;
}

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

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

1151
static int git_open_noatime(const char *name)
1152 1153 1154
{
	static int sha1_file_open_flag = O_NOATIME;

1155 1156
	for (;;) {
		int fd = open(name, O_RDONLY | sha1_file_open_flag);
1157
		if (fd >= 0)
1158 1159 1160 1161
			return fd;

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

		return -1;
1167 1168 1169 1170 1171 1172 1173 1174 1175
	}
}

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

1176
	fd = git_open_noatime(name);
1177 1178 1179 1180 1181 1182 1183 1184
	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);
1185
		fd = git_open_noatime(alt->base);
1186 1187 1188 1189 1190 1191
		if (fd >= 0)
			return fd;
	}
	return -1;
}

1192
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1193 1194
{
	void *map;
1195
	int fd;
1196

1197 1198 1199 1200
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1201

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

1211 1212 1213 1214 1215 1216 1217 1218
/*
 * 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)
1219 1220 1221 1222
{
	unsigned int word;

	/*
1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247
	 * 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.
1248 1249
	 */
	word = (map[0] << 8) + map[1];
1250
	if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1251
		return 0;
1252 1253
	else
		return 1;
1254 1255
}

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

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

J
Junio C Hamano 已提交
1280
int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1281 1282 1283 1284 1285 1286
{
	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 */
1287
	};
1288
	enum object_type type;
1289

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

1297 1298 1299 1300 1301 1302 1303 1304 1305 1306
	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;
1307

1308 1309 1310 1311
		/* Set up the stream for the rest.. */
		stream->next_in = map;
		stream->avail_in = mapsize;
		git_inflate_init(stream);
1312

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

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

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

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

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

	/*
	 * 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
	 */
1415
	return *hdr ? -1 : type_from_string(type);
1416 1417
}

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

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

1428
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1429 1430
}

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

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

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

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

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

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

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

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

1522
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1523 1524
	if (!base_offset)
		return OBJ_BAD;
1525
	type = packed_object_info(p, base_offset, NULL, NULL);
1526
	if (type <= OBJ_NONE) {
1527 1528 1529 1530 1531 1532
		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);
1533 1534 1535 1536 1537
		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 已提交
1538

1539 1540 1541 1542 1543
	/* 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.
	 */
1544
	if (sizep) {
N
Nicolas Pitre 已提交
1545
		*sizep = get_size_from_delta(p, w_curs, curpos);
1546 1547 1548
		if (*sizep == 0)
			type = OBJ_BAD;
	}
1549 1550

	return type;
1551 1552
}

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

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

1576
	return type;
1577 1578
}

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

1587
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1588 1589
	if (rtype)
		*rtype = type; /* representation type */
1590

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

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

1622
	buffer = xmallocz(size);
1623 1624
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
1625
	stream.avail_out = size + 1;
1626

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

	return buffer;
}

1645 1646
#define MAX_DELTA_CACHE (256)

1647
static size_t delta_base_cached;
1648 1649 1650 1651 1652 1653

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

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

1672 1673 1674 1675 1676 1677 1678
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);
}

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

	ret = ent->data;
1687 1688
	if (!ret || ent->p != p || ent->base_offset != base_offset)
		return unpack_entry(p, base_offset, type, base_size);
1689

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

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

1714 1715 1716 1717 1718 1719 1720
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]);
}

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

1728 1729
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1730 1731 1732 1733 1734 1735

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

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

1758 1759 1760
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

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

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

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

1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840
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);
}

1841 1842
int do_check_packed_object_crc;

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

1850 1851 1852
	if (log_pack_access)
		write_pack_access_log(p, obj_offset);

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

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

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

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

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

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

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

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

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

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

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

2017
	prepare_packed_git();
2018 2019 2020
	if (!packed_git)
		return 0;
	p = (last_found == (void *)1) ? packed_git : last_found;
2021

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

		next:
		if (p == last_found)
			p = packed_git;
		else
			p = p->next;
		if (p == last_found)
			p = p->next;
	} while (p);
2059 2060 2061
	return 0;
}

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

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

2073 2074
}

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

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

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

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

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

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

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

	return status;
2142 2143
}

2144 2145 2146 2147 2148 2149 2150 2151
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);
}

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

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

2176 2177
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2178 2179 2180
{
	struct cached_object *co;

2181
	hash_sha1_file(buf, len, typename(type), sha1);
2182 2183 2184 2185 2186 2187 2188 2189 2190 2191
	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;
2192
	co->type = type;
J
Junio C Hamano 已提交
2193 2194
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
2195 2196 2197 2198
	hashcpy(co->sha1, sha1);
	return 0;
}

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

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

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

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

2242 2243
	errno = 0;
	data = read_object(repl, type, size);
2244
	if (data)
2245
		return data;
2246

2247
	if (errno && errno != ENOENT)
2248 2249
		die_errno("failed to read object %s", sha1_to_hex(sha1));

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

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

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

2265
	return NULL;
2266 2267
}

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

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

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

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

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

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

	/* Sha1.. */
2326 2327 2328 2329
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
2330 2331
}

2332
/*
2333 2334 2335 2336
 * 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.
2337
 */
2338
int move_temp_to_file(const char *tmpfile, const char *filename)
2339
{
2340
	int ret = 0;
2341

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

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

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

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

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

2394 2395 2396
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
2397 2398
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
2399
	if (close(fd) != 0)
2400
		die_errno("error when closing sha1 file");
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 2426 2427 2428
/* 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");
2429
	fd = git_mkstemp_mode(buffer, 0444);
2430
	if (fd < 0 && dirlen && errno == ENOENT) {
2431
		/* Make sure the directory exists */
P
Patrick Higgins 已提交
2432
		memcpy(buffer, filename, dirlen);
2433
		buffer[dirlen-1] = 0;
2434
		if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2435 2436 2437 2438
			return -1;

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

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

R
Rene Scharfe 已提交
2455
	filename = sha1_file_name(sha1);
2456
	fd = create_tmpfile(tmpfile, sizeof(tmpfile), filename);
2457
	if (fd < 0) {
2458
		if (errno == EACCES)
2459 2460 2461
			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));
2462 2463
	}

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

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

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

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

2500
	close_sha1_file(fd);
2501

2502 2503 2504 2505 2506 2507 2508 2509 2510
	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));
	}

2511
	return move_temp_to_file(tmpfile, filename);
2512
}
2513

2514
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537
{
	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;
2538
	int ret;
2539

2540
	if (has_loose_object(sha1))
2541 2542 2543 2544 2545
		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;
2546 2547 2548 2549
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
2550 2551
}

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

2560 2561 2562 2563 2564 2565
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

2566 2567
int has_sha1_file(const unsigned char *sha1)
{
2568 2569
	struct pack_entry e;

2570
	if (find_pack_entry(sha1, &e))
2571
		return 1;
2572
	return has_loose_object(sha1);
2573
}
J
Junio C Hamano 已提交
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 2600 2601 2602
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");
}

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

2610
	if (!type)
2611
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2612 2613 2614 2615

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

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

2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655
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;
}

2656 2657
#define SMALL_FILE_SIZE (32*1024)

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

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

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 2726 2727 2728
/*
 * 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);
2729
		ssize_t actual;
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 2757 2758 2759

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

2760 2761 2762 2763 2764 2765 2766 2767
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);
2768
	else if (size <= big_file_threshold || type != OBJ_BLOB)
2769
		ret = index_core(sha1, fd, size, type, path, flags);
2770 2771
	else
		ret = index_stream(sha1, fd, size, type, path, flags);
2772
	close(fd);
2773
	return ret;
J
Junio C Hamano 已提交
2774
}
2775

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

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

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

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

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