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

M
Martin Waitz 已提交
232
static void read_info_alternates(const char * alternates, int depth);
233
static int git_open_noatime(const char *name);
M
Martin Waitz 已提交
234

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

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

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

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

	/* Detect cases where alternate disappeared */
285
	if (!is_directory(ent->base)) {
M
Martin Waitz 已提交
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 327 328 329 330
		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;
	}

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

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

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

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

383
	munmap(map, mapsz);
384 385
}

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

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

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

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

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

	read_info_alternates(get_object_directory(), 0);
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

	return p;
}

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

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

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

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

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

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

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

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

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

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

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

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

1150 1151 1152 1153 1154 1155 1156 1157
/*
 * 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)
1158 1159
{
	unsigned char real_sha1[20];
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 1190
	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);
1191
	return hashcmp(sha1, real_sha1) ? -1 : 0;
1192 1193
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

	return type;
1600 1601
}

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

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

1625
	return type;
1626 1627
}

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

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

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

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

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

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

	return buffer;
}

1694 1695
#define MAX_DELTA_CACHE (256)

1696
static size_t delta_base_cached;
1697 1698 1699 1700 1701 1702

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1890 1891
int do_check_packed_object_crc;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2126 2127
}

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

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

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

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

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

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

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

	return status;
2195 2196
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2318
	return NULL;
2319 2320
}

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

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

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

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

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

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

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

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

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

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

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

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

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

2447 2448 2449
/* Finalize a file on disk, and close it. */
static void close_sha1_file(int fd)
{
2450 2451
	if (fsync_object_files)
		fsync_or_die(fd, "sha1 file");
2452
	if (close(fd) != 0)
2453
		die_errno("error when closing sha1 file");
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 2481
/* 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");
2482
	fd = git_mkstemp_mode(buffer, 0444);
2483
	if (fd < 0 && dirlen && errno == ENOENT) {
2484
		/* Make sure the directory exists */
P
Patrick Higgins 已提交
2485
		memcpy(buffer, filename, dirlen);
2486
		buffer[dirlen-1] = 0;
2487
		if (mkdir(buffer, 0777) || adjust_shared_perm(buffer))
2488 2489 2490 2491
			return -1;

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

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

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

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

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

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

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

2553
	close_sha1_file(fd);
2554

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

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

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

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

	return ret;
2603 2604
}

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

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

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

2623
	if (find_pack_entry(sha1, &e))
2624
		return 1;
2625
	return has_loose_object(sha1);
2626
}
J
Junio C Hamano 已提交
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 2655
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");
}

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

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

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

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

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

2709 2710
#define SMALL_FILE_SIZE (32*1024)

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

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

2734
/*
2735 2736
 * This creates one packfile per large blob unless bulk-checkin
 * machinery is "plugged".
2737 2738 2739 2740
 *
 * 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
2741 2742 2743 2744 2745 2746 2747
 * (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.
2748 2749 2750 2751 2752
 */
static int index_stream(unsigned char *sha1, int fd, size_t size,
			enum object_type type, const char *path,
			unsigned flags)
{
2753
	return index_bulk_checkin(sha1, fd, size, type, path, flags);
2754 2755
}

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

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

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

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

2815 2816 2817 2818 2819 2820 2821 2822
	if (header->hdr_signature != htonl(PACK_SIGNATURE))
		/* "protocol error (pack signature mismatch detected)" */
		return PH_ERROR_PACK_SIGNATURE;
	if (!pack_version_ok(header->hdr_version))
		/* "protocol error (pack version unsupported)" */
		return PH_ERROR_PROTOCOL;
	return 0;
}
J
Jeff King 已提交
2823 2824 2825 2826 2827 2828 2829 2830 2831 2832

void assert_sha1_type(const unsigned char *sha1, enum object_type expect)
{
	enum object_type type = sha1_object_info(sha1, NULL);
	if (type < 0)
		die("%s is not a valid object", sha1_to_hex(sha1));
	if (type != expect)
		die("%s is not a valid '%s' object", sha1_to_hex(sha1),
		    typename(expect));
}