sha1_file.c 71.1 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
#include "bulk-checkin.h"
22
#include "streaming.h"
23

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

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

35
const unsigned char null_sha1[20];
J
Junio C Hamano 已提交
36

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

58 59
static struct packed_git *last_found_pack;

60 61 62 63 64 65 66 67 68 69 70 71 72 73
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;
}

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 99 100 101 102
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);
}

103 104
int safe_create_leading_directories(char *path)
{
105
	char *pos = path + offset_1st_component(path);
106 107
	struct stat st;

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

137 138 139 140 141 142 143 144 145
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;
}

146 147 148 149 150 151 152 153 154 155 156 157
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];
	}
}

158 159
/*
 * NOTE! This returns a statically allocated buffer, so you have to be
160
 * careful about using it. Do an "xstrdup()" if you need to save the
161
 * filename.
162 163 164
 *
 * 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 已提交
165
 * DB_ENVIRONMENT environment variable if it is not found in
166
 * the primary object database.
167 168 169
 */
char *sha1_file_name(const unsigned char *sha1)
{
170 171 172
	static char buf[PATH_MAX];
	const char *objdir;
	int len;
173

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

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

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

204
	buf = *name;
205 206 207 208 209 210

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

212
	return *base;
213 214
}

215
char *sha1_pack_name(const unsigned char *sha1)
216
{
217
	static char *name, *base;
218

J
Junio C Hamano 已提交
219
	return sha1_get_pack_name(sha1, &name, &base, "pack");
220
}
221

222 223 224
char *sha1_pack_index_name(const unsigned char *sha1)
{
	static char *name, *base;
J
Junio C Hamano 已提交
225

J
Junio C Hamano 已提交
226
	return sha1_get_pack_name(sha1, &name, &base, "idx");
227 228
}

229 230
struct alternate_object_database *alt_odb_list;
static struct alternate_object_database **alt_odb_tail;
231

232
static int git_open_noatime(const char *name);
M
Martin Waitz 已提交
233

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

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

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

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

	/* Detect cases where alternate disappeared */
284
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
		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;
		}
	}
301
	if (!strcmp(ent->base, objdir)) {
M
Martin Waitz 已提交
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 327 328 329
		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;
	}

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

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

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

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

382
	munmap(map, mapsz);
383 384
}

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

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

S
Shawn O. Pearce 已提交
411 412 413
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
414 415 416 417
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
418
	link_alt_odb_entries(alt, alt + strlen(alt), PATH_SEP, NULL, 0);
M
Martin Waitz 已提交
419 420 421 422

	read_info_alternates(get_object_directory(), 0);
}

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

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

441 442 443 444 445 446
static int has_loose_object(const unsigned char *sha1)
{
	return has_loose_object_local(sha1) ||
	       has_loose_object_nonlocal(sha1);
}

447
static unsigned int pack_used_ctr;
448 449 450
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
451 452
static unsigned int pack_open_fds;
static unsigned int pack_max_fds;
453
static size_t peak_pack_mapped;
454
static size_t pack_mapped;
455
struct packed_git *packed_git;
456

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

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

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

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

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

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

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

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

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

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

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

651 652 653 654 655 656 657 658 659 660 661 662 663 664 665
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;
}

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

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

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

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

734 735 736 737 738
/*
 * 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)
739
{
740 741 742 743
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
744
	long fd_flag;
745

746 747 748
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767
	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 */

768
	p->pack_fd = git_open_noatime(p->pack_name);
769
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
770
		return -1;
771
	pack_open_fds++;
772 773

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

781 782 783 784 785
	/* 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)
786
		return error("cannot determine file descriptor flags");
787 788
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
789
		return error("cannot set FD_CLOEXEC");
790

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

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

817 818 819 820 821 822
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);
823
		pack_open_fds--;
824 825 826 827 828
		p->pack_fd = -1;
	}
	return -1;
}

829
static int in_window(struct pack_window *win, off_t offset)
830 831 832 833 834 835 836 837 838 839 840 841
{
	/* 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);
}

842
unsigned char *use_pack(struct packed_git *p,
843
		struct pack_window **w_cursor,
844
		off_t offset,
845
		unsigned long *left)
846
{
847
	struct pack_window *win = *w_cursor;
848

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

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

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

917 918 919 920 921 922 923 924
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;
}

925 926 927 928 929
static void try_to_free_pack_memory(size_t size)
{
	release_pack_memory(size, -1);
}

930
struct packed_git *add_packed_git(const char *path, int path_len, int local)
931
{
932
	static int have_set_try_to_free_routine;
933
	struct stat st;
934
	struct packed_git *p = alloc_packed_git(path_len + 2);
935

936 937 938 939 940
	if (!have_set_try_to_free_routine) {
		have_set_try_to_free_routine = 1;
		set_try_to_free_routine(try_to_free_pack_memory);
	}

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

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

956
	strcpy(p->pack_name + path_len, ".pack");
957
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
958
		free(p);
959 960
		return NULL;
	}
961

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

973
struct packed_git *parse_pack_index(unsigned char *sha1, const char *idx_path)
974
{
975
	const char *path = sha1_pack_name(sha1);
976
	struct packed_git *p = alloc_packed_git(strlen(path) + 1);
977

978 979
	strcpy(p->pack_name, path);
	hashcpy(p->sha1, sha1);
980 981
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
982
		return NULL;
983
	}
984 985 986 987 988 989

	return p;
}

void install_packed_git(struct packed_git *pack)
{
990 991 992
	if (pack->pack_fd != -1)
		pack_open_fds++;

993 994 995 996
	pack->next = packed_git;
	packed_git = pack;
}

997
static void prepare_packed_git_one(char *objdir, int local)
998
{
999 1000 1001 1002
	/* 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];
1003 1004 1005 1006 1007 1008 1009
	int len;
	DIR *dir;
	struct dirent *de;

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

1021
		if (!has_extension(de->d_name, ".idx"))
1022 1023
			continue;

1024 1025 1026
		if (len + namelen + 1 > sizeof(path))
			continue;

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

1100
static int prepare_packed_git_run_once = 0;
1101
void prepare_packed_git(void)
1102
{
1103
	struct alternate_object_database *alt;
1104

1105
	if (prepare_packed_git_run_once)
1106
		return;
1107
	prepare_packed_git_one(get_object_directory(), 1);
1108
	prepare_alt_odb();
1109
	for (alt = alt_odb_list; alt; alt = alt->next) {
1110
		alt->name[-1] = 0;
1111
		prepare_packed_git_one(alt->base, 0);
1112
		alt->name[-1] = '/';
1113
	}
1114
	rearrange_packed_git();
1115 1116 1117
	prepare_packed_git_run_once = 1;
}

1118
void reprepare_packed_git(void)
1119
{
1120
	discard_revindex();
1121 1122
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
1123 1124
}

1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136
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++;
}

1137
static const struct packed_git *has_packed_and_bad(const unsigned char *sha1)
1138 1139 1140 1141 1142 1143 1144
{
	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))
1145 1146
				return p;
	return NULL;
1147 1148
}

1149 1150 1151 1152 1153 1154 1155 1156
/*
 * With an in-core object data in "map", rehash it to make sure the
 * object name actually matches "sha1" to detect object corruption.
 * With "map" == NULL, try reading the object named with "sha1" using
 * the streaming interface and rehash it to do the same.
 */
int check_sha1_signature(const unsigned char *sha1, void *map,
			 unsigned long size, const char *type)
1157 1158
{
	unsigned char real_sha1[20];
1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189
	enum object_type obj_type;
	struct git_istream *st;
	git_SHA_CTX c;
	char hdr[32];
	int hdrlen;

	if (map) {
		hash_sha1_file(map, size, type, real_sha1);
		return hashcmp(sha1, real_sha1) ? -1 : 0;
	}

	st = open_istream(sha1, &obj_type, &size, NULL);
	if (!st)
		return -1;

	/* Generate the header */
	hdrlen = sprintf(hdr, "%s %lu", typename(obj_type), size) + 1;

	/* Sha1.. */
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, hdrlen);
	for (;;) {
		char buf[1024 * 16];
		ssize_t readlen = read_istream(st, buf, sizeof(buf));

		if (!readlen)
			break;
		git_SHA1_Update(&c, buf, readlen);
	}
	git_SHA1_Final(real_sha1, &c);
	close_istream(st);
1190
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1191 1192
}

1193
static int git_open_noatime(const char *name)
1194 1195 1196
{
	static int sha1_file_open_flag = O_NOATIME;

1197 1198
	for (;;) {
		int fd = open(name, O_RDONLY | sha1_file_open_flag);
1199
		if (fd >= 0)
1200 1201 1202 1203
			return fd;

		/* Might the failure be due to O_NOATIME? */
		if (errno != ENOENT && sha1_file_open_flag) {
1204
			sha1_file_open_flag = 0;
1205 1206 1207 1208
			continue;
		}

		return -1;
1209 1210 1211 1212 1213 1214 1215 1216 1217
	}
}

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

1218
	fd = git_open_noatime(name);
1219 1220 1221 1222 1223 1224 1225 1226
	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);
1227
		fd = git_open_noatime(alt->base);
1228 1229 1230 1231 1232 1233
		if (fd >= 0)
			return fd;
	}
	return -1;
}

1234
void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
1235 1236
{
	void *map;
1237
	int fd;
1238

1239 1240 1241 1242
	fd = open_sha1_file(sha1);
	map = NULL;
	if (fd >= 0) {
		struct stat st;
1243

1244 1245
		if (!fstat(fd, &st)) {
			*size = xsize_t(st.st_size);
1246 1247 1248 1249 1250
			if (!*size) {
				/* mmap() is forbidden on empty files */
				error("object file %s is empty", sha1_file_name(sha1));
				return NULL;
			}
1251
			map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1252
		}
1253
		close(fd);
1254 1255 1256 1257
	}
	return map;
}

1258 1259 1260 1261 1262 1263 1264 1265
/*
 * 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)
1266 1267 1268 1269
{
	unsigned int word;

	/*
1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294
	 * 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.
1295 1296
	 */
	word = (map[0] << 8) + map[1];
1297
	if ((map[0] & 0x8F) == 0x08 && !(word % 31))
1298
		return 0;
1299 1300
	else
		return 1;
1301 1302
}

1303 1304
unsigned long unpack_object_header_buffer(const unsigned char *buf,
		unsigned long len, enum object_type *type, unsigned long *sizep)
1305
{
1306
	unsigned shift;
1307
	unsigned long size, c;
1308 1309 1310 1311 1312 1313 1314
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
1315
		if (len <= used || bitsizeof(long) <= shift) {
1316
			error("bad object header");
1317 1318
			size = used = 0;
			break;
1319
		}
1320 1321 1322 1323 1324 1325 1326 1327
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

J
Junio C Hamano 已提交
1328
int unpack_sha1_header(git_zstream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
1329 1330 1331 1332 1333 1334
{
	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 */
1335
	};
1336
	enum object_type type;
1337

1338 1339 1340 1341 1342
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1343 1344
	stream->avail_out = bufsiz;

1345 1346 1347 1348 1349 1350 1351 1352 1353 1354
	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;
1355

1356 1357 1358 1359
		/* Set up the stream for the rest.. */
		stream->next_in = map;
		stream->avail_in = mapsize;
		git_inflate_init(stream);
1360

1361 1362 1363 1364 1365
		/* And generate the fake traditional header */
		stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
						 typename(type), size);
		return 0;
	}
1366
	git_inflate_init(stream);
1367
	return git_inflate(stream, 0);
1368 1369
}

1370
static void *unpack_sha1_rest(git_zstream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1371 1372
{
	int bytes = strlen(buffer) + 1;
1373
	unsigned char *buf = xmallocz(size);
1374
	unsigned long n;
1375
	int status = Z_OK;
1376

1377 1378 1379 1380 1381
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1382 1383 1384 1385
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
J
Junio C Hamano 已提交
1386
		 * expect no more output and set avail_out to zero,
1387 1388 1389 1390 1391 1392 1393 1394 1395
		 * 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.
		 */
1396 1397
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1398
		while (status == Z_OK)
1399
			status = git_inflate(stream, Z_FINISH);
1400
	}
1401
	if (status == Z_STREAM_END && !stream->avail_in) {
1402
		git_inflate_end(stream);
1403 1404 1405 1406 1407 1408 1409 1410 1411 1412
		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;
1413 1414 1415 1416 1417 1418 1419
}

/*
 * 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.
 */
1420
int parse_sha1_header(const char *hdr, unsigned long *sizep)
1421
{
1422
	char type[10];
1423 1424 1425 1426
	int i;
	unsigned long size;

	/*
J
Junio C Hamano 已提交
1427
	 * The type can be at most ten bytes (including the
1428
	 * terminating '\0' that we add), and is followed by
1429
	 * a space.
1430
	 */
1431
	i = 0;
1432 1433 1434 1435
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1436 1437
		type[i++] = c;
		if (i >= sizeof(type))
1438 1439
			return -1;
	}
1440
	type[i] = 0;
1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462

	/*
	 * 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
	 */
1463
	return *hdr ? -1 : type_from_string(type);
1464 1465
}

1466
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1467
{
1468
	int ret;
1469
	git_zstream stream;
1470
	char hdr[8192];
1471

1472
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1473
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1474 1475
		return NULL;

1476
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1477 1478
}

N
Nicolas Pitre 已提交
1479 1480 1481 1482 1483 1484
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;
1485
	git_zstream stream;
N
Nicolas Pitre 已提交
1486 1487 1488 1489 1490 1491
	int st;

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

1492
	git_inflate_init(&stream);
N
Nicolas Pitre 已提交
1493 1494 1495
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
1496
		st = git_inflate(&stream, Z_FINISH);
N
Nicolas Pitre 已提交
1497 1498 1499
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
1500
	git_inflate_end(&stream);
1501 1502 1503 1504
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head)) {
		error("delta data unpack-initial failed");
		return 0;
	}
N
Nicolas Pitre 已提交
1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517

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

1518
static off_t get_delta_base(struct packed_git *p,
1519
				    struct pack_window **w_curs,
1520
				    off_t *curpos,
1521
				    enum object_type type,
1522
				    off_t delta_obj_offset)
1523
{
1524
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1525
	off_t base_offset;
1526

1527 1528 1529 1530 1531 1532
	/* 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.
	 */
1533
	if (type == OBJ_OFS_DELTA) {
1534 1535 1536 1537 1538
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1539
			if (!base_offset || MSB(base_offset, 7))
1540
				return 0;  /* overflow */
1541 1542 1543 1544
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
1545
		if (base_offset <= 0 || base_offset >= delta_obj_offset)
1546
			return 0;  /* out of bound */
1547
		*curpos += used;
1548
	} else if (type == OBJ_REF_DELTA) {
1549 1550
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
1551
		*curpos += 20;
1552 1553
	} else
		die("I am totally screwed");
1554
	return base_offset;
1555 1556
}

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

N
Nicolas Pitre 已提交
1561
static int packed_delta_info(struct packed_git *p,
1562
			     struct pack_window **w_curs,
1563
			     off_t curpos,
1564
			     enum object_type type,
1565
			     off_t obj_offset,
N
Nicolas Pitre 已提交
1566
			     unsigned long *sizep)
1567
{
1568
	off_t base_offset;
J
Junio C Hamano 已提交
1569

1570
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
1571 1572
	if (!base_offset)
		return OBJ_BAD;
1573
	type = packed_object_info(p, base_offset, NULL, NULL);
1574
	if (type <= OBJ_NONE) {
1575 1576 1577 1578 1579 1580
		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);
1581 1582 1583 1584 1585
		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 已提交
1586

1587 1588 1589 1590 1591
	/* 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.
	 */
1592
	if (sizep) {
N
Nicolas Pitre 已提交
1593
		*sizep = get_size_from_delta(p, w_curs, curpos);
1594 1595 1596
		if (*sizep == 0)
			type = OBJ_BAD;
	}
1597 1598

	return type;
1599 1600
}

1601 1602 1603 1604
int unpack_object_header(struct packed_git *p,
			 struct pack_window **w_curs,
			 off_t *curpos,
			 unsigned long *sizep)
1605
{
1606
	unsigned char *base;
1607
	unsigned long left;
1608
	unsigned long used;
1609
	enum object_type type;
1610

1611
	/* use_pack() assures us we have [base, base + 20) available
1612
	 * as a range that we can look at.  (Its actually the hash
P
Pavel Roskin 已提交
1613
	 * size that is assured.)  With our object header encoding
1614 1615 1616
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1617
	base = use_pack(p, w_curs, *curpos, &left);
1618 1619 1620 1621 1622
	used = unpack_object_header_buffer(base, left, &type, sizep);
	if (!used) {
		type = OBJ_BAD;
	} else
		*curpos += used;
1623

1624
	return type;
1625 1626
}

1627
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1628
			      unsigned long *sizep, int *rtype)
1629
{
1630
	struct pack_window *w_curs = NULL;
1631 1632
	unsigned long size;
	off_t curpos = obj_offset;
1633
	enum object_type type;
1634

1635
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1636 1637
	if (rtype)
		*rtype = type; /* representation type */
1638

1639
	switch (type) {
1640 1641
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1642 1643
		type = packed_delta_info(p, &w_curs, curpos,
					 type, obj_offset, sizep);
1644
		break;
1645 1646 1647 1648
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1649 1650
		if (sizep)
			*sizep = size;
1651
		break;
1652
	default:
1653 1654 1655
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      type, (uintmax_t)obj_offset, p->pack_name);
		type = OBJ_BAD;
1656
	}
1657
	unuse_pack(&w_curs);
1658
	return type;
1659 1660
}

1661
static void *unpack_compressed_entry(struct packed_git *p,
1662
				    struct pack_window **w_curs,
1663
				    off_t curpos,
1664
				    unsigned long size)
1665 1666
{
	int st;
1667
	git_zstream stream;
1668
	unsigned char *buffer, *in;
1669

1670
	buffer = xmallocz(size);
1671 1672
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
1673
	stream.avail_out = size + 1;
1674

1675
	git_inflate_init(&stream);
1676
	do {
1677
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1678
		stream.next_in = in;
1679
		st = git_inflate(&stream, Z_FINISH);
1680 1681
		if (!stream.avail_out)
			break; /* the payload is larger than it should be */
1682
		curpos += stream.next_in - in;
1683
	} while (st == Z_OK || st == Z_BUF_ERROR);
1684
	git_inflate_end(&stream);
1685 1686 1687 1688 1689 1690 1691 1692
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1693 1694
#define MAX_DELTA_CACHE (256)

1695
static size_t delta_base_cached;
1696 1697 1698 1699 1700 1701

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

1702
static struct delta_base_cache_entry {
1703 1704
	struct delta_base_cache_lru_list lru;
	void *data;
1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716
	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);
1717
	return hash % MAX_DELTA_CACHE;
1718 1719
}

1720 1721 1722 1723 1724 1725 1726
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);
}

1727
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1728
	unsigned long *base_size, enum object_type *type, int keep_cache)
1729
{
1730 1731 1732 1733 1734
	void *ret;
	unsigned long hash = pack_entry_hash(p, base_offset);
	struct delta_base_cache_entry *ent = delta_base_cache + hash;

	ret = ent->data;
1735 1736
	if (!ret || ent->p != p || ent->base_offset != base_offset)
		return unpack_entry(p, base_offset, type, base_size);
1737

1738
	if (!keep_cache) {
1739
		ent->data = NULL;
1740 1741
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1742
		delta_base_cached -= ent->size;
P
Pierre Habouzit 已提交
1743 1744
	} else {
		ret = xmemdupz(ent->data, ent->size);
1745
	}
1746 1747 1748
	*type = ent->type;
	*base_size = ent->size;
	return ret;
1749 1750
}

1751 1752 1753 1754 1755
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
1756 1757
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1758 1759 1760 1761
		delta_base_cached -= ent->size;
	}
}

1762 1763 1764 1765 1766 1767 1768
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]);
}

1769 1770 1771
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
1772
	unsigned long hash = pack_entry_hash(p, base_offset);
1773
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
1774
	struct delta_base_cache_lru_list *lru;
1775

1776 1777
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1778 1779 1780 1781 1782 1783

	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;
1784 1785 1786
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
1787 1788 1789 1790 1791 1792 1793
	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);
	}
1794

1795 1796 1797 1798 1799
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
1800 1801 1802 1803
	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;
1804 1805
}

1806 1807 1808
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size);

1809
static void *unpack_delta_entry(struct packed_git *p,
1810
				struct pack_window **w_curs,
1811
				off_t curpos,
1812
				unsigned long delta_size,
1813
				off_t obj_offset,
1814
				enum object_type *type,
1815
				unsigned long *sizep)
1816
{
1817
	void *delta_data, *result, *base;
1818 1819
	unsigned long base_size;
	off_t base_offset;
N
Nicolas Pitre 已提交
1820

1821
	base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1822 1823 1824 1825 1826 1827
	if (!base_offset) {
		error("failed to validate delta base reference "
		      "at offset %"PRIuMAX" from %s",
		      (uintmax_t)curpos, p->pack_name);
		return NULL;
	}
1828
	unuse_pack(w_curs);
1829
	base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1830 1831 1832 1833 1834 1835 1836
	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.
		 */
1837 1838 1839 1840 1841 1842
		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);
1843 1844 1845 1846 1847
		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);
1848
		base = read_object(base_sha1, type, &base_size);
1849 1850 1851
		if (!base)
			return NULL;
	}
1852

1853
	delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1854 1855 1856 1857 1858 1859 1860
	if (!delta_data) {
		error("failed to unpack compressed delta "
		      "at offset %"PRIuMAX" from %s",
		      (uintmax_t)curpos, p->pack_name);
		free(base);
		return NULL;
	}
1861 1862
	result = patch_delta(base, base_size,
			     delta_data, delta_size,
1863
			     sizep);
1864 1865 1866
	if (!result)
		die("failed to apply delta");
	free(delta_data);
1867
	add_delta_base_cache(p, base_offset, base, base_size, *type);
1868 1869 1870
	return result;
}

1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888
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);
}

1889 1890
int do_check_packed_object_crc;

1891
void *unpack_entry(struct packed_git *p, off_t obj_offset,
1892
		   enum object_type *type, unsigned long *sizep)
1893
{
1894
	struct pack_window *w_curs = NULL;
1895
	off_t curpos = obj_offset;
1896
	void *data;
1897

1898 1899 1900
	if (log_pack_access)
		write_pack_access_log(p, obj_offset);

1901 1902 1903 1904 1905 1906 1907 1908 1909
	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);
1910
			unuse_pack(&w_curs);
1911 1912 1913 1914
			return NULL;
		}
	}

1915 1916
	*type = unpack_object_header(p, &w_curs, &curpos, sizep);
	switch (*type) {
1917 1918
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1919 1920
		data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
					  obj_offset, type, sizep);
1921
		break;
1922 1923 1924 1925
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1926
		data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1927
		break;
1928
	default:
1929 1930 1931
		data = NULL;
		error("unknown object type %i at offset %"PRIuMAX" in %s",
		      *type, (uintmax_t)obj_offset, p->pack_name);
1932
	}
1933
	unuse_pack(&w_curs);
1934
	return data;
1935 1936
}

1937
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1938
					    uint32_t n)
1939
{
1940
	const unsigned char *index = p->index_data;
1941 1942 1943 1944 1945
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
1946
	if (n >= p->num_objects)
1947
		return NULL;
1948 1949 1950 1951 1952 1953 1954 1955 1956
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

N
Nicolas Pitre 已提交
1957
off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972
{
	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)));
	}
1973 1974
}

1975
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
1976
				  struct packed_git *p)
1977
{
1978 1979
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
1980 1981 1982 1983 1984 1985
	unsigned hi, lo, stride;
	static int use_lookup = -1;
	static int debug_lookup = -1;

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

1987 1988 1989 1990 1991 1992
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
1993 1994 1995 1996
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
1997
	index += 4 * 256;
1998 1999
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
2000 2001 2002 2003 2004 2005 2006 2007
	if (p->index_version > 1) {
		stride = 20;
	} else {
		stride = 24;
		index += 4;
	}

	if (debug_lookup)
2008
		printf("%02x%02x%02x... lo %u hi %u nr %"PRIu32"\n",
2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019
		       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);
	}
2020 2021

	do {
2022
		unsigned mi = (lo + hi) / 2;
2023 2024 2025 2026 2027
		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 已提交
2028
		if (!cmp)
2029
			return nth_packed_object_offset(p, mi);
2030 2031 2032 2033 2034 2035 2036 2037
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

2038
int is_pack_valid(struct packed_git *p)
2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058
{
	/* 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);
}

2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092
static int fill_pack_entry(const unsigned char *sha1,
			   struct pack_entry *e,
			   struct packed_git *p)
{
	off_t offset;

	if (p->num_bad_objects) {
		unsigned i;
		for (i = 0; i < p->num_bad_objects; i++)
			if (!hashcmp(sha1, p->bad_object_sha1 + 20 * i))
				return 0;
	}

	offset = find_pack_entry_one(sha1, p);
	if (!offset)
		return 0;

	/*
	 * We are about to tell the caller where they can locate the
	 * requested object.  We better make sure the packfile is
	 * still here and can be accessed before supplying that
	 * answer, as it may have been deleted since the index was
	 * loaded!
	 */
	if (!is_pack_valid(p)) {
		warning("packfile %s cannot be accessed", p->pack_name);
		return 0;
	}
	e->offset = offset;
	e->p = p;
	hashcpy(e->sha1, sha1);
	return 1;
}

2093
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e)
2094 2095
{
	struct packed_git *p;
N
Nicolas Pitre 已提交
2096

2097
	prepare_packed_git();
2098 2099
	if (!packed_git)
		return 0;
2100

2101 2102
	if (last_found_pack && fill_pack_entry(sha1, e, last_found_pack))
		return 1;
2103

2104 2105 2106
	for (p = packed_git; p; p = p->next) {
		if (p == last_found_pack || !fill_pack_entry(sha1, e, p))
			continue;
2107

2108 2109 2110
		last_found_pack = p;
		return 1;
	}
2111 2112 2113
	return 0;
}

J
Junio C Hamano 已提交
2114
struct packed_git *find_sha1_pack(const unsigned char *sha1,
2115 2116 2117 2118 2119
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
2120
		if (find_pack_entry_one(sha1, p))
2121 2122 2123
			return p;
	}
	return NULL;
2124

2125 2126
}

2127
static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
2128
{
2129
	int status;
2130 2131
	unsigned long mapsize, size;
	void *map;
2132
	git_zstream stream;
N
Nicolas Pitre 已提交
2133
	char hdr[32];
2134

2135
	map = map_sha1_file(sha1, &mapsize);
2136 2137
	if (!map)
		return error("unable to find %s", sha1_to_hex(sha1));
2138 2139 2140
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
2141
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
2142
		status = error("unable to parse %s header", sha1_to_hex(sha1));
2143 2144
	else if (sizep)
		*sizep = size;
2145
	git_inflate_end(&stream);
2146 2147 2148 2149
	munmap(map, mapsize);
	return status;
}

2150 2151
/* returns enum object_type or negative */
int sha1_object_info_extended(const unsigned char *sha1, struct object_info *oi)
2152
{
2153
	struct cached_object *co;
2154
	struct pack_entry e;
2155
	int status, rtype;
2156

2157 2158
	co = find_cached_object(sha1);
	if (co) {
2159 2160 2161
		if (oi->sizep)
			*(oi->sizep) = co->size;
		oi->whence = OI_CACHED;
2162 2163 2164
		return co->type;
	}

2165
	if (!find_pack_entry(sha1, &e)) {
2166
		/* Most likely it's a loose object. */
2167 2168 2169
		status = sha1_loose_object_info(sha1, oi->sizep);
		if (status >= 0) {
			oi->whence = OI_LOOSE;
2170
			return status;
2171
		}
2172 2173

		/* Not a loose object; someone else may have just packed it. */
2174
		reprepare_packed_git();
2175
		if (!find_pack_entry(sha1, &e))
2176
			return status;
2177
	}
2178

2179
	status = packed_object_info(e.p, e.offset, oi->sizep, &rtype);
2180 2181
	if (status < 0) {
		mark_bad_packed_object(e.p, sha1);
2182
		status = sha1_object_info_extended(sha1, oi);
2183 2184
	} else if (in_delta_base_cache(e.p, e.offset)) {
		oi->whence = OI_DBCACHED;
2185 2186 2187 2188 2189 2190
	} 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);
2191 2192 2193
	}

	return status;
2194 2195
}

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

2204 2205
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
2206 2207
{
	struct pack_entry e;
2208
	void *data;
2209

2210
	if (!find_pack_entry(sha1, &e))
2211
		return NULL;
2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222
	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);
2223
		data = read_object(sha1, type, size);
2224 2225
	}
	return data;
2226 2227
}

2228 2229
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
2230 2231 2232
{
	struct cached_object *co;

2233
	hash_sha1_file(buf, len, typename(type), sha1);
2234 2235 2236 2237 2238 2239 2240 2241 2242 2243
	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;
2244
	co->type = type;
J
Junio C Hamano 已提交
2245 2246
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
2247 2248 2249 2250
	hashcpy(co->sha1, sha1);
	return 0;
}

2251 2252
static void *read_object(const unsigned char *sha1, enum object_type *type,
			 unsigned long *size)
2253 2254 2255
{
	unsigned long mapsize;
	void *map, *buf;
2256 2257 2258 2259
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
2260
		*type = co->type;
2261
		*size = co->size;
P
Pierre Habouzit 已提交
2262
		return xmemdupz(co->buf, co->size);
2263
	}
2264

2265 2266 2267
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
2268
	map = map_sha1_file(sha1, &mapsize);
2269
	if (map) {
2270
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
2271 2272 2273
		munmap(map, mapsize);
		return buf;
	}
2274
	reprepare_packed_git();
2275
	return read_packed_sha1(sha1, type, size);
2276 2277
}

2278 2279 2280 2281 2282
/*
 * 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.
 */
2283 2284 2285 2286
void *read_sha1_file_extended(const unsigned char *sha1,
			      enum object_type *type,
			      unsigned long *size,
			      unsigned flag)
2287
{
2288
	void *data;
2289
	char *path;
2290
	const struct packed_git *p;
2291 2292
	const unsigned char *repl = (flag & READ_SHA1_FILE_REPLACE)
		? lookup_replace_object(sha1) : sha1;
2293

2294 2295
	errno = 0;
	data = read_object(repl, type, size);
2296
	if (data)
2297
		return data;
2298

2299
	if (errno && errno != ENOENT)
2300 2301
		die_errno("failed to read object %s", sha1_to_hex(sha1));

2302
	/* die if we replaced an object with one that does not exist */
2303
	if (repl != sha1)
2304 2305 2306
		die("replacement %s not found for %s",
		    sha1_to_hex(repl), sha1_to_hex(sha1));

2307 2308 2309 2310
	if (has_loose_object(repl)) {
		path = sha1_file_name(sha1);
		die("loose object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), path);
2311
	}
2312

2313 2314 2315
	if ((p = has_packed_and_bad(repl)) != NULL)
		die("packed object %s (stored in %s) is corrupt",
		    sha1_to_hex(repl), p->pack_name);
2316

2317
	return NULL;
2318 2319
}

2320
void *read_object_with_reference(const unsigned char *sha1,
2321
				 const char *required_type_name,
2322 2323
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
2324
{
2325
	enum object_type type, required_type;
2326 2327
	void *buffer;
	unsigned long isize;
2328
	unsigned char actual_sha1[20];
2329

2330
	required_type = type_from_string(required_type_name);
2331
	hashcpy(actual_sha1, sha1);
2332 2333 2334
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
2335

2336
		buffer = read_sha1_file(actual_sha1, &type, &isize);
2337 2338
		if (!buffer)
			return NULL;
2339
		if (type == required_type) {
2340 2341
			*size = isize;
			if (actual_sha1_return)
2342
				hashcpy(actual_sha1_return, actual_sha1);
2343 2344 2345
			return buffer;
		}
		/* Handle references */
2346
		else if (type == OBJ_COMMIT)
2347
			ref_type = "tree ";
2348
		else if (type == OBJ_TAG)
2349 2350 2351 2352 2353 2354
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
2355

2356 2357
		if (ref_length + 40 > isize ||
		    memcmp(buffer, ref_type, ref_length) ||
2358
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
2359 2360 2361
			free(buffer);
			return NULL;
		}
2362
		free(buffer);
2363 2364
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
2365 2366 2367
	}
}

N
Nicolas Pitre 已提交
2368
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
2369
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
2370
                                    char *hdr, int *hdrlen)
2371
{
2372
	git_SHA_CTX c;
2373 2374

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

	/* Sha1.. */
2378 2379 2380 2381
	git_SHA1_Init(&c);
	git_SHA1_Update(&c, hdr, *hdrlen);
	git_SHA1_Update(&c, buf, len);
	git_SHA1_Final(sha1, &c);
2382 2383
}

2384
/*
2385 2386 2387 2388
 * 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.
2389
 */
2390
int move_temp_to_file(const char *tmpfile, const char *filename)
2391
{
2392
	int ret = 0;
2393

2394
	if (object_creation_mode == OBJECT_CREATION_USES_RENAMES)
2395 2396
		goto try_rename;
	else if (link(tmpfile, filename))
2397
		ret = errno;
2398 2399 2400 2401 2402 2403 2404 2405 2406

	/*
	 * 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.
	 *
2407
	 * When this succeeds, we just return.  We have nothing
2408 2409 2410
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
2411
	try_rename:
2412
		if (!rename(tmpfile, filename))
2413
			goto out;
2414
		ret = errno;
2415
	}
2416
	unlink_or_warn(tmpfile);
2417 2418
	if (ret) {
		if (ret != EEXIST) {
2419
			return error("unable to write sha1 filename %s: %s", filename, strerror(ret));
2420 2421 2422 2423
		}
		/* FIXME!!! Collision check here ? */
	}

2424
out:
2425
	if (adjust_shared_perm(filename))
2426
		return error("unable to set permission to '%s'", filename);
2427 2428 2429
	return 0;
}

L
Linus Torvalds 已提交
2430 2431
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2432
	if (write_in_full(fd, buf, len) < 0)
2433
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2434 2435 2436
	return 0;
}

N
Nicolas Pitre 已提交
2437
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2438 2439
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2440
	char hdr[32];
R
Rene Scharfe 已提交
2441 2442 2443 2444 2445
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

2446 2447 2448
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
2449 2450
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
2451
	if (close(fd) != 0)
2452
		die_errno("error when closing sha1 file");
2453 2454
}

2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480
/* 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");
2481
	fd = git_mkstemp_mode(buffer, 0444);
2482
	if (fd < 0 && dirlen && errno == ENOENT) {
2483
		/* Make sure the directory exists */
P
Patrick Higgins 已提交
2484
		memcpy(buffer, filename, dirlen);
2485
		buffer[dirlen-1] = 0;
2486
		if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2487 2488 2489 2490
			return -1;

		/* Try again */
		strcpy(buffer + dirlen - 1, "/tmp_obj_XXXXXX");
2491
		fd = git_mkstemp_mode(buffer, 0444);
2492 2493 2494 2495
	}
	return fd;
}

2496
static int write_loose_object(const unsigned char *sha1, char *hdr, int hdrlen,
2497
			      const void *buf, unsigned long len, time_t mtime)
2498
{
2499
	int fd, ret;
2500
	unsigned char compressed[4096];
2501
	git_zstream stream;
2502 2503
	git_SHA_CTX c;
	unsigned char parano_sha1[20];
2504
	char *filename;
2505
	static char tmp_file[PATH_MAX];
2506

R
Rene Scharfe 已提交
2507
	filename = sha1_file_name(sha1);
2508
	fd = create_tmpfile(tmp_file, sizeof(tmp_file), filename);
2509
	if (fd < 0) {
2510
		if (errno == EACCES)
2511
			return error("insufficient permission for adding an object to repository database %s", get_object_directory());
2512
		else
2513
			return error("unable to create temporary file: %s", strerror(errno));
2514 2515
	}

2516 2517
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2518
	git_deflate_init(&stream, zlib_compression_level);
2519
	stream.next_out = compressed;
2520
	stream.avail_out = sizeof(compressed);
2521
	git_SHA1_Init(&c);
2522 2523

	/* First header.. */
N
Nicolas Pitre 已提交
2524
	stream.next_in = (unsigned char *)hdr;
2525
	stream.avail_in = hdrlen;
2526 2527
	while (git_deflate(&stream, 0) == Z_OK)
		; /* nothing */
2528
	git_SHA1_Update(&c, hdr, hdrlen);
2529 2530

	/* Then the data itself.. */
2531
	stream.next_in = (void *)buf;
2532
	stream.avail_in = len;
2533
	do {
2534
		unsigned char *in0 = stream.next_in;
2535
		ret = git_deflate(&stream, Z_FINISH);
2536
		git_SHA1_Update(&c, in0, stream.next_in - in0);
2537 2538 2539 2540 2541 2542
		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);

2543 2544
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);
2545
	ret = git_deflate_end_gently(&stream);
2546 2547
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);
2548 2549 2550
	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));
2551

2552
	close_sha1_file(fd);
2553

2554 2555 2556 2557
	if (mtime) {
		struct utimbuf utb;
		utb.actime = mtime;
		utb.modtime = mtime;
2558
		if (utime(tmp_file, &utb) < 0)
2559
			warning("failed utime() on %s: %s",
2560
				tmp_file, strerror(errno));
2561 2562
	}

2563
	return move_temp_to_file(tmp_file, filename);
2564
}
2565

2566
int write_sha1_file(const void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589
{
	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;
2590
	int ret;
2591

2592
	if (has_loose_object(sha1))
2593 2594 2595 2596 2597
		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;
2598 2599 2600 2601
	ret = write_loose_object(sha1, hdr, hdrlen, buf, len, mtime);
	free(buf);

	return ret;
2602 2603
}

2604 2605 2606 2607 2608 2609 2610 2611
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

2612 2613 2614 2615 2616 2617
int has_sha1_pack(const unsigned char *sha1)
{
	struct pack_entry e;
	return find_pack_entry(sha1, &e);
}

2618 2619
int has_sha1_file(const unsigned char *sha1)
{
2620 2621
	struct pack_entry e;

2622
	if (find_pack_entry(sha1, &e))
2623
		return 1;
2624
	return has_loose_object(sha1);
2625
}
J
Junio C Hamano 已提交
2626

2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654
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");
}

2655
static int index_mem(unsigned char *sha1, void *buf, size_t size,
2656 2657
		     enum object_type type,
		     const char *path, unsigned flags)
2658
{
L
Linus Torvalds 已提交
2659
	int ret, re_allocated = 0;
2660
	int write_object = flags & HASH_WRITE_OBJECT;
J
Junio C Hamano 已提交
2661

2662
	if (!type)
2663
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2664 2665 2666 2667

	/*
	 * Convert blobs to git internal format
	 */
2668
	if ((type == OBJ_BLOB) && path) {
2669
		struct strbuf nbuf = STRBUF_INIT;
2670
		if (convert_to_git(path, buf, size, &nbuf,
2671
				   write_object ? safe_crlf : SAFE_CRLF_FALSE)) {
2672
			buf = strbuf_detach(&nbuf, &size);
L
Linus Torvalds 已提交
2673 2674 2675
			re_allocated = 1;
		}
	}
2676
	if (flags & HASH_FORMAT_CHECK) {
2677 2678 2679 2680 2681 2682 2683
		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 已提交
2684

2685
	if (write_object)
2686
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
2687
	else
2688
		ret = hash_sha1_file(buf, size, typename(type), sha1);
2689
	if (re_allocated)
L
Linus Torvalds 已提交
2690
		free(buf);
2691 2692 2693
	return ret;
}

2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707
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;
}

2708 2709
#define SMALL_FILE_SIZE (32*1024)

2710 2711 2712
static int index_core(unsigned char *sha1, int fd, size_t size,
		      enum object_type type, const char *path,
		      unsigned flags)
2713 2714 2715
{
	int ret;

2716
	if (!size) {
2717
		ret = index_mem(sha1, NULL, size, type, path, flags);
2718 2719 2720
	} else if (size <= SMALL_FILE_SIZE) {
		char *buf = xmalloc(size);
		if (size == read_in_full(fd, buf, size))
2721
			ret = index_mem(sha1, buf, size, type, path, flags);
2722 2723 2724
		else
			ret = error("short read %s", strerror(errno));
		free(buf);
2725
	} else {
2726
		void *buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
2727
		ret = index_mem(sha1, buf, size, type, path, flags);
2728
		munmap(buf, size);
2729
	}
2730 2731 2732
	return ret;
}

2733
/*
2734 2735
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
2736 2737 2738 2739
 *
 * 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
2740 2741 2742 2743 2744 2745 2746
 * (or equivalent in-core API described above). However, that is
 * somewhat complicated, as we do not know the size of the filter
 * result, which we need to know beforehand when writing a git object.
 * Since the primary motivation for trying to stream from the working
 * tree file and to avoid mmaping it in core is to deal with large
 * binary blobs, they generally do not want to get any conversion, and
 * callers should avoid this code path when filters are requested.
2747 2748 2749 2750 2751
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
2752
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
2753 2754
}

2755 2756 2757 2758 2759 2760 2761 2762
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);
2763 2764
	else if (size <= big_file_threshold || type != OBJ_BLOB ||
		 (path && would_convert_to_git(path, NULL, 0, 0)))
2765
		ret = index_core(sha1, fd, size, type, path, flags);
2766 2767
	else
		ret = index_stream(sha1, fd, size, type, path, flags);
2768
	close(fd);
2769
	return ret;
J
Junio C Hamano 已提交
2770
}
2771

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

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

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

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

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