sha1_file.c 60.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 14 15
#include "blob.h"
#include "commit.h"
#include "tag.h"
#include "tree.h"
16
#include "refs.h"
17

18 19 20 21 22 23 24 25
#ifndef O_NOATIME
#if defined(__linux__) && (defined(__i386__) || defined(__PPC__))
#define O_NOATIME 01000000
#else
#define O_NOATIME 0
#endif
#endif

26 27 28 29 30 31
#ifdef NO_C99_FORMAT
#define SZ_FMT "lu"
#else
#define SZ_FMT "zu"
#endif

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

34 35
static unsigned int sha1_file_open_flag = O_NOATIME;

36
const signed char hexval_table[256] = {
37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 00-07 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 08-0f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 10-17 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 18-1f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 20-27 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 28-2f */
	  0,  1,  2,  3,  4,  5,  6,  7,		/* 30-37 */
	  8,  9, -1, -1, -1, -1, -1, -1,		/* 38-3f */
	 -1, 10, 11, 12, 13, 14, 15, -1,		/* 40-47 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 48-4f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 50-57 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 58-5f */
	 -1, 10, 11, 12, 13, 14, 15, -1,		/* 60-67 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 68-67 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 70-77 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 78-7f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 80-87 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 88-8f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 90-97 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* 98-9f */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* a0-a7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* a8-af */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* b0-b7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* b8-bf */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* c0-c7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* c8-cf */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* d0-d7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* d8-df */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* e0-e7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* e8-ef */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* f0-f7 */
	 -1, -1, -1, -1, -1, -1, -1, -1,		/* f8-ff */
};
70 71 72 73 74 75 76 77 78 79 80 81 82 83

int get_sha1_hex(const char *hex, unsigned char *sha1)
{
	int i;
	for (i = 0; i < 20; i++) {
		unsigned int val = (hexval(hex[0]) << 4) | hexval(hex[1]);
		if (val & ~0xff)
			return -1;
		*sha1++ = val;
		hex += 2;
	}
	return 0;
}

84 85 86
int safe_create_leading_directories(char *path)
{
	char *pos = path;
87 88
	struct stat st;

89 90
	if (*pos == '/')
		pos++;
91 92 93 94 95 96

	while (pos) {
		pos = strchr(pos, '/');
		if (!pos)
			break;
		*pos = 0;
97 98 99
		if (!stat(path, &st)) {
			/* path exists */
			if (!S_ISDIR(st.st_mode)) {
100
				*pos = '/';
101
				return -3;
102
			}
103
		}
104 105 106 107
		else if (mkdir(path, 0777)) {
			*pos = '/';
			return -1;
		}
108 109 110 111
		else if (adjust_shared_perm(path)) {
			*pos = '/';
			return -2;
		}
112 113 114 115
		*pos++ = '/';
	}
	return 0;
}
116

117 118
char * sha1_to_hex(const unsigned char *sha1)
{
L
Linus Torvalds 已提交
119 120
	static int bufno;
	static char hexbuffer[4][50];
121
	static const char hex[] = "0123456789abcdef";
L
Linus Torvalds 已提交
122
	char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
123 124 125 126 127 128 129
	int i;

	for (i = 0; i < 20; i++) {
		unsigned int val = *sha1++;
		*buf++ = hex[val >> 4];
		*buf++ = hex[val & 0xf];
	}
130 131
	*buf = '\0';

132 133 134
	return buffer;
}

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

147 148
/*
 * NOTE! This returns a statically allocated buffer, so you have to be
149
 * careful about using it. Do a "xstrdup()" if you need to save the
150
 * filename.
151 152 153
 *
 * 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 已提交
154
 * DB_ENVIRONMENT environment variable if it is not found in
155
 * the primary object database.
156 157 158 159 160 161
 */
char *sha1_file_name(const unsigned char *sha1)
{
	static char *name, *base;

	if (!base) {
J
Junio C Hamano 已提交
162
		const char *sha1_file_directory = get_object_directory();
163
		int len = strlen(sha1_file_directory);
164
		base = xmalloc(len + 60);
165 166 167 168 169 170
		memcpy(base, sha1_file_directory, len);
		memset(base+len, 0, 60);
		base[len] = '/';
		base[len+3] = '/';
		name = base + len + 1;
	}
171
	fill_sha1_path(name, sha1);
172 173 174
	return base;
}

175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195
char *sha1_pack_name(const unsigned char *sha1)
{
	static const char hex[] = "0123456789abcdef";
	static char *name, *base, *buf;
	int i;

	if (!base) {
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
		base = xmalloc(len + 60);
		sprintf(base, "%s/pack/pack-1234567890123456789012345678901234567890.pack", sha1_file_directory);
		name = base + len + 11;
	}

	buf = name;

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

197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
	return base;
}

char *sha1_pack_index_name(const unsigned char *sha1)
{
	static const char hex[] = "0123456789abcdef";
	static char *name, *base, *buf;
	int i;

	if (!base) {
		const char *sha1_file_directory = get_object_directory();
		int len = strlen(sha1_file_directory);
		base = xmalloc(len + 60);
		sprintf(base, "%s/pack/pack-1234567890123456789012345678901234567890.idx", sha1_file_directory);
		name = base + len + 11;
	}

	buf = name;

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

222 223 224
	return base;
}

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

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

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

M
Martin Waitz 已提交
256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
	if (*entry != '/' && relative_base) {
		/* Relative alt-odb */
		if (base_len < 0)
			base_len = strlen(relative_base) + 1;
		entlen += base_len;
		pfxlen += base_len;
	}
	ent = xmalloc(sizeof(*ent) + entlen);

	if (*entry != '/' && relative_base) {
		memcpy(ent->base, relative_base, base_len - 1);
		ent->base[base_len - 1] = '/';
		memcpy(ent->base + base_len, entry, len);
	}
	else
		memcpy(ent->base, entry, pfxlen);

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

	/* Detect cases where alternate disappeared */
	if (stat(ent->base, &st) || !S_ISDIR(st.st_mode)) {
		error("object directory %s does not exist; "
		      "check .git/objects/info/alternates.",
		      ent->base);
		free(ent);
		return -1;
	}

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

	/* add the alternate entry */
	*alt_odb_tail = ent;
	alt_odb_tail = &(ent->next);
	ent->next = NULL;

	/* recursively add alternates */
	read_info_alternates(ent->base, depth + 1);

	ent->base[pfxlen] = '/';

	return 0;
}

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

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

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

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

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

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

376
	munmap(map, mapsz);
377 378
}

M
Martin Waitz 已提交
379 380
void prepare_alt_odb(void)
{
T
Timo Hirvonen 已提交
381
	const char *alt;
M
Martin Waitz 已提交
382

S
Shawn O. Pearce 已提交
383 384 385
	if (alt_odb_tail)
		return;

M
Martin Waitz 已提交
386 387 388 389 390 391 392 393 394
	alt = getenv(ALTERNATE_DB_ENVIRONMENT);
	if (!alt) alt = "";

	alt_odb_tail = &alt_odb_list;
	link_alt_odb_entries(alt, alt + strlen(alt), ':', NULL, 0);

	read_info_alternates(get_object_directory(), 0);
}

395 396 397
static char *find_sha1_file(const unsigned char *sha1, struct stat *st)
{
	char *name = sha1_file_name(sha1);
398
	struct alternate_object_database *alt;
399 400 401

	if (!stat(name, st))
		return name;
402
	prepare_alt_odb();
403 404
	for (alt = alt_odb_list; alt; alt = alt->next) {
		name = alt->name;
405
		fill_sha1_path(name, sha1);
406 407
		if (!stat(alt->base, st))
			return alt->base;
408 409 410 411
	}
	return NULL;
}

412
static unsigned int pack_used_ctr;
413 414 415 416
static unsigned int pack_mmap_calls;
static unsigned int peak_pack_open_windows;
static unsigned int pack_open_windows;
static size_t peak_pack_mapped;
417
static size_t pack_mapped;
418
struct packed_git *packed_git;
419

J
Junio C Hamano 已提交
420
void pack_report(void)
421 422
{
	fprintf(stderr,
423 424 425
		"pack_report: getpagesize()            = %10" SZ_FMT "\n"
		"pack_report: core.packedGitWindowSize = %10" SZ_FMT "\n"
		"pack_report: core.packedGitLimit      = %10" SZ_FMT "\n",
426
		(size_t) getpagesize(),
427 428 429 430 431 432
		packed_git_window_size,
		packed_git_limit);
	fprintf(stderr,
		"pack_report: pack_used_ctr            = %10u\n"
		"pack_report: pack_mmap_calls          = %10u\n"
		"pack_report: pack_open_windows        = %10u / %10u\n"
433 434
		"pack_report: pack_mapped              = "
			"%10" SZ_FMT " / %10" SZ_FMT "\n",
435 436 437 438 439 440
		pack_used_ctr,
		pack_mmap_calls,
		pack_open_windows, peak_pack_open_windows,
		pack_mapped, peak_pack_mapped);
}

441
static int check_packed_git_idx(const char *path,  struct packed_git *p)
442 443
{
	void *idx_map;
444
	struct pack_idx_header *hdr;
445
	size_t idx_size;
446
	uint32_t version, nr, i, *index;
447
	int fd = open(path, O_RDONLY);
448
	struct stat st;
449

450 451 452 453 454 455
	if (fd < 0)
		return -1;
	if (fstat(fd, &st)) {
		close(fd);
		return -1;
	}
456
	idx_size = xsize_t(st.st_size);
457 458 459 460
	if (idx_size < 4 * 256 + 20 + 20) {
		close(fd);
		return error("index file %s is too small", path);
	}
461
	idx_map = xmmap(NULL, idx_size, PROT_READ, MAP_PRIVATE, fd, 0);
462 463
	close(fd);

464 465
	hdr = idx_map;
	if (hdr->idx_signature == htonl(PACK_IDX_SIGNATURE)) {
466 467 468 469 470 471 472 473 474 475
		version = ntohl(hdr->idx_version);
		if (version < 2 || version > 2) {
			munmap(idx_map, idx_size);
			return error("index file %s is version %d"
				     " and is not supported by this binary"
				     " (try upgrading GIT to a newer version)",
				     path, version);
		}
	} else
		version = 1;
476

477
	nr = 0;
478
	index = idx_map;
479 480
	if (version > 1)
		index += 2;  /* skip index header */
481
	for (i = 0; i < 256; i++) {
482
		uint32_t n = ntohl(index[i]);
483 484
		if (n < nr) {
			munmap(idx_map, idx_size);
485
			return error("non-monotonic index %s", path);
486
		}
487 488 489
		nr = n;
	}

490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
	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);
			return error("wrong index file size in %s", path);
		}
	} 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 已提交
517 518 519 520
		unsigned long max_size = min_size;
		if (nr)
			max_size += (nr - 1)*8;
		if (idx_size < min_size || idx_size > max_size) {
521 522 523 524 525 526 527 528 529 530 531
			munmap(idx_map, idx_size);
			return error("wrong index file size in %s", path);
		}
		if (idx_size != min_size) {
			/* make sure we can deal with large pack offsets */
			off_t x = 0x7fffffffUL, y = 0xffffffffUL;
			if (x > (x + 1) || y > (y + 1)) {
				munmap(idx_map, idx_size);
				return error("pack too large for current definition of off_t in %s", path);
			}
		}
532
	}
533

534
	p->index_version = version;
535 536
	p->index_data = idx_map;
	p->index_size = idx_size;
N
Nicolas Pitre 已提交
537
	p->num_objects = nr;
538 539 540
	return 0;
}

541
int open_pack_index(struct packed_git *p)
542 543 544 545 546 547 548 549 550 551 552 553 554 555
{
	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;
}

556 557 558 559
static void scan_windows(struct packed_git *p,
	struct packed_git **lru_p,
	struct pack_window **lru_w,
	struct pack_window **lru_l)
560
{
561 562 563 564 565 566 567 568
	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;
569 570
			}
		}
571
		w_l = w;
572
	}
573 574
}

575
static int unuse_one_window(struct packed_git *current, int keep_fd)
576 577 578 579 580 581 582 583
{
	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);
584 585 586 587 588 589 590
	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;
591
			if (!lru_p->windows && lru_p->pack_fd != keep_fd) {
592 593 594 595 596
				close(lru_p->pack_fd);
				lru_p->pack_fd = -1;
			}
		}
		free(lru_w);
597
		pack_open_windows--;
598 599 600
		return 1;
	}
	return 0;
601 602
}

603
void release_pack_memory(size_t need, int fd)
604 605
{
	size_t cur = pack_mapped;
606
	while (need >= (cur - pack_mapped) && unuse_one_window(NULL, fd))
607 608 609
		; /* nothing */
}

610
void unuse_pack(struct pack_window **w_cursor)
611
{
612 613 614 615 616
	struct pack_window *w = *w_cursor;
	if (w) {
		w->inuse_cnt--;
		*w_cursor = NULL;
	}
617 618
}

619 620 621 622 623
/*
 * 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)
624
{
625 626 627 628
	struct stat st;
	struct pack_header hdr;
	unsigned char sha1[20];
	unsigned char *idx_sha1;
629
	long fd_flag;
630

631 632 633
	if (!p->index_data && open_pack_index(p))
		return error("packfile %s index unavailable", p->pack_name);

634 635
	p->pack_fd = open(p->pack_name, O_RDONLY);
	if (p->pack_fd < 0 || fstat(p->pack_fd, &st))
636
		return -1;
637 638

	/* If we created the struct before we had the pack we lack size. */
639 640
	if (!p->pack_size) {
		if (!S_ISREG(st.st_mode))
641
			return error("packfile %s not a regular file", p->pack_name);
642
		p->pack_size = st.st_size;
643
	} else if (p->pack_size != st.st_size)
644
		return error("packfile %s size changed", p->pack_name);
645

646 647 648 649 650
	/* 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)
651
		return error("cannot determine file descriptor flags");
652 653
	fd_flag |= FD_CLOEXEC;
	if (fcntl(p->pack_fd, F_SETFD, fd_flag) == -1)
654
		return error("cannot set FD_CLOEXEC");
655

656
	/* Verify we recognize this pack file format. */
657
	if (read_in_full(p->pack_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
658
		return error("file %s is far too short to be a packfile", p->pack_name);
659
	if (hdr.hdr_signature != htonl(PACK_SIGNATURE))
660
		return error("file %s is not a GIT packfile", p->pack_name);
661
	if (!pack_version_ok(hdr.hdr_version))
662
		return error("packfile %s is version %u and not supported"
663 664 665 666
			" (try upgrading GIT to a newer version)",
			p->pack_name, ntohl(hdr.hdr_version));

	/* Verify the pack matches its index. */
N
Nicolas Pitre 已提交
667
	if (p->num_objects != ntohl(hdr.hdr_entries))
668
		return error("packfile %s claims to have %u objects"
N
Nicolas Pitre 已提交
669 670 671
			     " while index indicates %u objects",
			     p->pack_name, ntohl(hdr.hdr_entries),
			     p->num_objects);
672
	if (lseek(p->pack_fd, p->pack_size - sizeof(sha1), SEEK_SET) == -1)
673
		return error("end of packfile %s is unavailable", p->pack_name);
674
	if (read_in_full(p->pack_fd, sha1, sizeof(sha1)) != sizeof(sha1))
675
		return error("packfile %s signature is unavailable", p->pack_name);
676
	idx_sha1 = ((unsigned char *)p->index_data) + p->index_size - 40;
677
	if (hashcmp(sha1, idx_sha1))
678 679
		return error("packfile %s does not match index", p->pack_name);
	return 0;
680 681
}

682 683 684 685 686 687 688 689 690 691 692
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);
		p->pack_fd = -1;
	}
	return -1;
}

693
static int in_window(struct pack_window *win, off_t offset)
694 695 696 697 698 699 700 701 702 703 704 705
{
	/* 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);
}

706 707
unsigned char* use_pack(struct packed_git *p,
		struct pack_window **w_cursor,
708
		off_t offset,
709
		unsigned int *left)
710
{
711
	struct pack_window *win = *w_cursor;
712

713 714
	if (p->pack_fd == -1 && open_packed_git(p))
		die("packfile %s cannot be accessed", p->pack_name);
715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731

	/* Since packfiles end in a hash of their content and its
	 * 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.
	 */
	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) {
732
			size_t window_align = packed_git_window_size / 2;
733
			off_t len;
734
			win = xcalloc(1, sizeof(*win));
735
			win->offset = (offset / window_align) * window_align;
736 737 738 739
			len = p->pack_size - win->offset;
			if (len > packed_git_window_size)
				len = packed_git_window_size;
			win->len = (size_t)len;
740
			pack_mapped += win->len;
741
			while (packed_git_limit < pack_mapped
742
				&& unuse_one_window(p, p->pack_fd))
743
				; /* nothing */
744
			win->base = xmmap(NULL, win->len,
745 746 747
				PROT_READ, MAP_PRIVATE,
				p->pack_fd, win->offset);
			if (win->base == MAP_FAILED)
748 749 750
				die("packfile %s cannot be mapped: %s",
					p->pack_name,
					strerror(errno));
751 752 753 754 755 756
			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;
757 758 759
			win->next = p->windows;
			p->windows = win;
		}
760
	}
761 762 763 764 765
	if (win != *w_cursor) {
		win->last_used = pack_used_ctr++;
		win->inuse_cnt++;
		*w_cursor = win;
	}
766
	offset -= win->offset;
767
	if (left)
768
		*left = win->len - xsize_t(offset);
769
	return win->base + offset;
770 771
}

772
struct packed_git *add_packed_git(const char *path, int path_len, int local)
773 774
{
	struct stat st;
775
	struct packed_git *p = xmalloc(sizeof(*p) + path_len + 2);
776

777 778 779 780 781 782
	/*
	 * Make sure a corresponding .pack file exists and that
	 * the index looks sane.
	 */
	path_len -= strlen(".idx");
	if (path_len < 1)
783
		return NULL;
784 785
	memcpy(p->pack_name, path, path_len);
	strcpy(p->pack_name + path_len, ".pack");
786
	if (stat(p->pack_name, &st) || !S_ISREG(st.st_mode)) {
787
		free(p);
788 789
		return NULL;
	}
790

791 792 793
	/* ok, it looks sane as far as we can check without
	 * actually mapping the pack file.
	 */
794 795 796 797
	p->index_version = 0;
	p->index_data = NULL;
	p->index_size = 0;
	p->num_objects = 0;
798 799
	p->pack_size = st.st_size;
	p->next = NULL;
800
	p->windows = NULL;
801
	p->pack_fd = -1;
802
	p->pack_local = local;
803
	p->mtime = st.st_mtime;
804 805
	if (path_len < 40 || get_sha1_hex(path + path_len - 40, p->sha1))
		hashclr(p->sha1);
806 807 808
	return p;
}

809
struct packed_git *parse_pack_index(unsigned char *sha1)
810 811 812 813 814
{
	char *path = sha1_pack_index_name(sha1);
	return parse_pack_index_file(sha1, path);
}

815 816
struct packed_git *parse_pack_index_file(const unsigned char *sha1,
					 const char *idx_path)
817
{
818 819
	const char *path = sha1_pack_name(sha1);
	struct packed_git *p = xmalloc(sizeof(*p) + strlen(path) + 2);
820

821 822
	if (check_packed_git_idx(idx_path, p)) {
		free(p);
823
		return NULL;
824
	}
825 826 827 828

	strcpy(p->pack_name, path);
	p->pack_size = 0;
	p->next = NULL;
829
	p->windows = NULL;
830
	p->pack_fd = -1;
831
	hashcpy(p->sha1, sha1);
832 833 834 835 836 837 838 839 840
	return p;
}

void install_packed_git(struct packed_git *pack)
{
	pack->next = packed_git;
	packed_git = pack;
}

841
static void prepare_packed_git_one(char *objdir, int local)
842
{
843 844 845 846
	/* 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];
847 848 849 850 851 852 853
	int len;
	DIR *dir;
	struct dirent *de;

	sprintf(path, "%s/pack", objdir);
	len = strlen(path);
	dir = opendir(path);
854
	if (!dir) {
J
Junio C Hamano 已提交
855
		if (errno != ENOENT)
856
			error("unable to open object pack directory: %s: %s",
J
Junio C Hamano 已提交
857
			      path, strerror(errno));
858
		return;
859
	}
860 861 862 863 864
	path[len++] = '/';
	while ((de = readdir(dir)) != NULL) {
		int namelen = strlen(de->d_name);
		struct packed_git *p;

865
		if (!has_extension(de->d_name, ".idx"))
866 867
			continue;

868 869 870
		if (len + namelen + 1 > sizeof(path))
			continue;

871
		/* Don't reopen a pack we already have. */
872
		strcpy(path + len, de->d_name);
873 874 875 876 877 878
		for (p = packed_git; p; p = p->next) {
			if (!memcmp(path, p->pack_name, len + namelen - 4))
				break;
		}
		if (p)
			continue;
879 880 881
		/* See if it really is a valid .idx file with corresponding
		 * .pack file that we can map.
		 */
882
		p = add_packed_git(path, len + namelen, local);
883 884
		if (!p)
			continue;
885
		install_packed_git(p);
886
	}
887
	closedir(dir);
888 889
}

890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943
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);
}

944
static int prepare_packed_git_run_once = 0;
945
void prepare_packed_git(void)
946
{
947
	struct alternate_object_database *alt;
948

949
	if (prepare_packed_git_run_once)
950
		return;
951
	prepare_packed_git_one(get_object_directory(), 1);
952
	prepare_alt_odb();
953
	for (alt = alt_odb_list; alt; alt = alt->next) {
954
		alt->name[-1] = 0;
955
		prepare_packed_git_one(alt->base, 0);
956
		alt->name[-1] = '/';
957
	}
958
	rearrange_packed_git();
959 960 961
	prepare_packed_git_run_once = 1;
}

962
void reprepare_packed_git(void)
963 964 965
{
	prepare_packed_git_run_once = 0;
	prepare_packed_git();
966 967
}

968
int check_sha1_signature(const unsigned char *sha1, void *map, unsigned long size, const char *type)
969 970
{
	unsigned char real_sha1[20];
971
	hash_sha1_file(map, size, type, real_sha1);
972
	return hashcmp(sha1, real_sha1) ? -1 : 0;
973 974
}

J
Junio C Hamano 已提交
975
static void *map_sha1_file(const unsigned char *sha1, unsigned long *size)
976 977 978
{
	struct stat st;
	void *map;
979
	int fd;
980 981 982 983 984
	char *filename = find_sha1_file(sha1, &st);

	if (!filename) {
		return NULL;
	}
985

986
	fd = open(filename, O_RDONLY | sha1_file_open_flag);
987
	if (fd < 0) {
988 989 990 991 992 993 994 995 996 997 998
		/* See if it works without O_NOATIME */
		switch (sha1_file_open_flag) {
		default:
			fd = open(filename, O_RDONLY);
			if (fd >= 0)
				break;
		/* Fallthrough */
		case 0:
			return NULL;
		}

999 1000 1001
		/* If it failed once, it will probably fail again.
		 * Stop using O_NOATIME
		 */
1002
		sha1_file_open_flag = 0;
1003
	}
1004 1005
	*size = xsize_t(st.st_size);
	map = xmmap(NULL, *size, PROT_READ, MAP_PRIVATE, fd, 0);
1006 1007 1008 1009
	close(fd);
	return map;
}

1010
static int legacy_loose_object(unsigned char *map)
1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025
{
	unsigned int word;

	/*
	 * Is it a zlib-compressed buffer? If so, the first byte
	 * must be 0x78 (15-bit window size, deflated), and the
	 * first 16-bit word is evenly divisible by 31
	 */
	word = (map[0] << 8) + map[1];
	if (map[0] == 0x78 && !(word % 31))
		return 1;
	else
		return 0;
}

1026
unsigned long unpack_object_header_gently(const unsigned char *buf, unsigned long len, enum object_type *type, unsigned long *sizep)
1027
{
1028
	unsigned shift;
1029 1030
	unsigned char c;
	unsigned long size;
1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
	unsigned long used = 0;

	c = buf[used++];
	*type = (c >> 4) & 7;
	size = c & 15;
	shift = 4;
	while (c & 0x80) {
		if (len <= used)
			return 0;
		if (sizeof(long) * 8 <= shift)
			return 0;
		c = buf[used++];
		size += (c & 0x7f) << shift;
		shift += 7;
	}
	*sizep = size;
	return used;
}

static int unpack_sha1_header(z_stream *stream, unsigned char *map, unsigned long mapsize, void *buffer, unsigned long bufsiz)
{
	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 */
1057
	};
1058
	enum object_type type;
1059

1060 1061 1062 1063 1064
	/* Get the data stream */
	memset(stream, 0, sizeof(*stream));
	stream->next_in = map;
	stream->avail_in = mapsize;
	stream->next_out = buffer;
1065 1066
	stream->avail_out = bufsiz;

1067
	if (legacy_loose_object(map)) {
1068 1069 1070 1071
		inflateInit(stream);
		return inflate(stream, 0);
	}

1072 1073 1074 1075 1076 1077 1078 1079

	/*
	 * 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 don't write it any longer.  But we
	 * can still read it.
	 */
1080 1081
	used = unpack_object_header_gently(map, mapsize, &type, &size);
	if (!used || !valid_loose_object_type[type])
1082
		return -1;
1083 1084
	map += used;
	mapsize -= used;
1085 1086 1087 1088

	/* Set up the stream for the rest.. */
	stream->next_in = map;
	stream->avail_in = mapsize;
1089
	inflateInit(stream);
1090 1091

	/* And generate the fake traditional header */
1092
	stream->total_out = 1 + snprintf(buffer, bufsiz, "%s %lu",
1093
					 typename(type), size);
1094
	return 0;
1095 1096
}

1097
static void *unpack_sha1_rest(z_stream *stream, void *buffer, unsigned long size, const unsigned char *sha1)
1098 1099
{
	int bytes = strlen(buffer) + 1;
1100
	unsigned char *buf = xmalloc(1+size);
1101
	unsigned long n;
1102
	int status = Z_OK;
1103

1104 1105 1106 1107 1108
	n = stream->total_out - bytes;
	if (n > size)
		n = size;
	memcpy(buf, (char *) buffer + bytes, n);
	bytes = n;
1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
	if (bytes <= size) {
		/*
		 * The above condition must be (bytes <= size), not
		 * (bytes < size).  In other words, even though we
		 * expect no more output and set avail_out to zer0,
		 * 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.
		 */
1123 1124
		stream->next_out = buf + bytes;
		stream->avail_out = size - bytes;
1125 1126
		while (status == Z_OK)
			status = inflate(stream, Z_FINISH);
1127 1128
	}
	buf[size] = 0;
1129
	if (status == Z_STREAM_END && !stream->avail_in) {
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140
		inflateEnd(stream);
		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;
1141 1142 1143 1144 1145 1146 1147
}

/*
 * 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.
 */
1148
static int parse_sha1_header(const char *hdr, unsigned long *sizep)
1149
{
1150
	char type[10];
1151 1152 1153 1154
	int i;
	unsigned long size;

	/*
J
Junio C Hamano 已提交
1155
	 * The type can be at most ten bytes (including the
1156
	 * terminating '\0' that we add), and is followed by
1157
	 * a space.
1158
	 */
1159
	i = 0;
1160 1161 1162 1163
	for (;;) {
		char c = *hdr++;
		if (c == ' ')
			break;
1164 1165
		type[i++] = c;
		if (i >= sizeof(type))
1166 1167
			return -1;
	}
1168
	type[i] = 0;
1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190

	/*
	 * 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
	 */
1191
	return *hdr ? -1 : type_from_string(type);
1192 1193
}

1194
static void *unpack_sha1_file(void *map, unsigned long mapsize, enum object_type *type, unsigned long *size, const unsigned char *sha1)
1195
{
1196
	int ret;
1197
	z_stream stream;
1198
	char hdr[8192];
1199

1200
	ret = unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr));
1201
	if (ret < Z_OK || (*type = parse_sha1_header(hdr, size)) < 0)
1202 1203
		return NULL;

1204
	return unpack_sha1_rest(&stream, hdr, *size, sha1);
1205 1206
}

N
Nicolas Pitre 已提交
1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243
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;
	z_stream stream;
	int st;

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

	inflateInit(&stream);
	do {
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
		stream.next_in = in;
		st = inflate(&stream, Z_FINISH);
		curpos += stream.next_in - in;
	} while ((st == Z_OK || st == Z_BUF_ERROR) &&
		 stream.total_out < sizeof(delta_head));
	inflateEnd(&stream);
	if ((st != Z_STREAM_END) && stream.total_out != sizeof(delta_head))
		die("delta data unpack-initial failed");

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

1244
static off_t get_delta_base(struct packed_git *p,
1245
				    struct pack_window **w_curs,
1246
				    off_t *curpos,
1247
				    enum object_type type,
1248
				    off_t delta_obj_offset)
1249
{
1250
	unsigned char *base_info = use_pack(p, w_curs, *curpos, NULL);
1251
	off_t base_offset;
1252

1253 1254 1255 1256 1257 1258
	/* 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.
	 */
1259
	if (type == OBJ_OFS_DELTA) {
1260 1261 1262 1263 1264
		unsigned used = 0;
		unsigned char c = base_info[used++];
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
1265
			if (!base_offset || MSB(base_offset, 7))
1266 1267 1268 1269 1270 1271 1272
				die("offset value overflow for delta base object");
			c = base_info[used++];
			base_offset = (base_offset << 7) + (c & 127);
		}
		base_offset = delta_obj_offset - base_offset;
		if (base_offset >= delta_obj_offset)
			die("delta base offset out of bound");
1273
		*curpos += used;
1274
	} else if (type == OBJ_REF_DELTA) {
1275 1276 1277 1278 1279
		/* The base entry _must_ be in the same pack */
		base_offset = find_pack_entry_one(base_info, p);
		if (!base_offset)
			die("failed to find delta-pack base object %s",
				sha1_to_hex(base_info));
1280
		*curpos += 20;
1281 1282
	} else
		die("I am totally screwed");
1283
	return base_offset;
1284 1285
}

J
Junio C Hamano 已提交
1286
/* forward declaration for a mutually recursive function */
1287
static int packed_object_info(struct packed_git *p, off_t offset,
1288
			      unsigned long *sizep);
J
Junio C Hamano 已提交
1289

N
Nicolas Pitre 已提交
1290
static int packed_delta_info(struct packed_git *p,
1291
			     struct pack_window **w_curs,
1292
			     off_t curpos,
1293
			     enum object_type type,
1294
			     off_t obj_offset,
N
Nicolas Pitre 已提交
1295
			     unsigned long *sizep)
1296
{
1297
	off_t base_offset;
J
Junio C Hamano 已提交
1298

1299 1300
	base_offset = get_delta_base(p, w_curs, &curpos, type, obj_offset);
	type = packed_object_info(p, base_offset, NULL);
J
Junio C Hamano 已提交
1301

1302 1303 1304 1305 1306
	/* 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.
	 */
N
Nicolas Pitre 已提交
1307 1308
	if (sizep)
		*sizep = get_size_from_delta(p, w_curs, curpos);
1309 1310

	return type;
1311 1312
}

1313 1314
static int unpack_object_header(struct packed_git *p,
				struct pack_window **w_curs,
1315
				off_t *curpos,
1316
				unsigned long *sizep)
1317
{
1318 1319
	unsigned char *base;
	unsigned int left;
1320
	unsigned long used;
1321
	enum object_type type;
1322

1323 1324
	/* use_pack() assures us we have [base, base + 20) available
	 * as a range that we can look at at.  (Its actually the hash
P
Pavel Roskin 已提交
1325
	 * size that is assured.)  With our object header encoding
1326 1327 1328
	 * the maximum deflated object size is 2^137, which is just
	 * insane, so we know won't exceed what we have been given.
	 */
1329 1330
	base = use_pack(p, w_curs, *curpos, &left);
	used = unpack_object_header_gently(base, left, &type, sizep);
1331 1332
	if (!used)
		die("object offset outside of pack file");
1333
	*curpos += used;
1334

1335
	return type;
1336 1337
}

1338
const char *packed_object_info_detail(struct packed_git *p,
1339
				      off_t obj_offset,
1340 1341 1342 1343
				      unsigned long *size,
				      unsigned long *store_size,
				      unsigned int *delta_chain_length,
				      unsigned char *base_sha1)
1344
{
1345
	struct pack_window *w_curs = NULL;
1346 1347
	off_t curpos;
	unsigned long dummy;
N
Nicolas Pitre 已提交
1348
	unsigned char *next_sha1;
1349
	enum object_type type;
1350

N
Nicolas Pitre 已提交
1351
	*delta_chain_length = 0;
1352
	curpos = obj_offset;
1353
	type = unpack_object_header(p, &w_curs, &curpos, size);
N
Nicolas Pitre 已提交
1354 1355

	for (;;) {
1356
		switch (type) {
N
Nicolas Pitre 已提交
1357
		default:
1358
			die("pack %s contains unknown object type %d",
1359
			    p->pack_name, type);
N
Nicolas Pitre 已提交
1360 1361 1362 1363 1364
		case OBJ_COMMIT:
		case OBJ_TREE:
		case OBJ_BLOB:
		case OBJ_TAG:
			*store_size = 0; /* notyet */
1365
			unuse_pack(&w_curs);
1366
			return typename(type);
1367
		case OBJ_OFS_DELTA:
1368
			obj_offset = get_delta_base(p, &w_curs, &curpos, type, obj_offset);
1369
			if (*delta_chain_length == 0) {
1370
				/* TODO: find base_sha1 as pointed by curpos */
1371
				hashclr(base_sha1);
1372 1373 1374
			}
			break;
		case OBJ_REF_DELTA:
1375
			next_sha1 = use_pack(p, &w_curs, curpos, NULL);
N
Nicolas Pitre 已提交
1376 1377
			if (*delta_chain_length == 0)
				hashcpy(base_sha1, next_sha1);
1378
			obj_offset = find_pack_entry_one(next_sha1, p);
N
Nicolas Pitre 已提交
1379 1380 1381
			break;
		}
		(*delta_chain_length)++;
1382
		curpos = obj_offset;
1383
		type = unpack_object_header(p, &w_curs, &curpos, &dummy);
1384 1385 1386
	}
}

1387
static int packed_object_info(struct packed_git *p, off_t obj_offset,
1388
			      unsigned long *sizep)
1389
{
1390
	struct pack_window *w_curs = NULL;
1391 1392
	unsigned long size;
	off_t curpos = obj_offset;
1393
	enum object_type type;
1394

1395
	type = unpack_object_header(p, &w_curs, &curpos, &size);
1396

1397
	switch (type) {
1398 1399
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1400 1401
		type = packed_delta_info(p, &w_curs, curpos,
					 type, obj_offset, sizep);
1402
		break;
1403 1404 1405 1406
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1407 1408
		if (sizep)
			*sizep = size;
1409
		break;
1410
	default:
1411
		die("pack %s contains unknown object type %d",
1412
		    p->pack_name, type);
1413
	}
1414
	unuse_pack(&w_curs);
1415
	return type;
1416 1417
}

1418
static void *unpack_compressed_entry(struct packed_git *p,
1419
				    struct pack_window **w_curs,
1420
				    off_t curpos,
1421
				    unsigned long size)
1422 1423 1424
{
	int st;
	z_stream stream;
1425
	unsigned char *buffer, *in;
1426 1427 1428 1429 1430 1431 1432 1433

	buffer = xmalloc(size + 1);
	buffer[size] = 0;
	memset(&stream, 0, sizeof(stream));
	stream.next_out = buffer;
	stream.avail_out = size;

	inflateInit(&stream);
1434
	do {
1435
		in = use_pack(p, w_curs, curpos, &stream.avail_in);
1436 1437
		stream.next_in = in;
		st = inflate(&stream, Z_FINISH);
1438
		curpos += stream.next_in - in;
1439
	} while (st == Z_OK || st == Z_BUF_ERROR);
1440 1441 1442 1443 1444 1445 1446 1447 1448
	inflateEnd(&stream);
	if ((st != Z_STREAM_END) || stream.total_out != size) {
		free(buffer);
		return NULL;
	}

	return buffer;
}

1449 1450
#define MAX_DELTA_CACHE (256)

1451
static size_t delta_base_cached;
1452 1453 1454 1455 1456 1457

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

1458
static struct delta_base_cache_entry {
1459 1460
	struct delta_base_cache_lru_list lru;
	void *data;
1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472
	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);
1473
	return hash % MAX_DELTA_CACHE;
1474 1475
}

1476
static void *cache_or_unpack_entry(struct packed_git *p, off_t base_offset,
1477
	unsigned long *base_size, enum object_type *type, int keep_cache)
1478
{
1479 1480 1481 1482 1483 1484 1485
	void *ret;
	unsigned long hash = pack_entry_hash(p, base_offset);
	struct delta_base_cache_entry *ent = delta_base_cache + hash;

	ret = ent->data;
	if (ret && ent->p == p && ent->base_offset == base_offset)
		goto found_cache_entry;
1486
	return unpack_entry(p, base_offset, type, base_size);
1487 1488

found_cache_entry:
1489
	if (!keep_cache) {
1490
		ent->data = NULL;
1491 1492
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1493 1494
		delta_base_cached -= ent->size;
	}
1495 1496 1497 1498 1499
	else {
		ret = xmalloc(ent->size + 1);
		memcpy(ret, ent->data, ent->size);
		((char *)ret)[ent->size] = 0;
	}
1500 1501 1502
	*type = ent->type;
	*base_size = ent->size;
	return ret;
1503 1504
}

1505 1506 1507 1508 1509
static inline void release_delta_base_cache(struct delta_base_cache_entry *ent)
{
	if (ent->data) {
		free(ent->data);
		ent->data = NULL;
1510 1511
		ent->lru.next->prev = ent->lru.prev;
		ent->lru.prev->next = ent->lru.next;
1512 1513 1514 1515
		delta_base_cached -= ent->size;
	}
}

1516 1517 1518
static void add_delta_base_cache(struct packed_git *p, off_t base_offset,
	void *base, unsigned long base_size, enum object_type type)
{
1519
	unsigned long hash = pack_entry_hash(p, base_offset);
1520
	struct delta_base_cache_entry *ent = delta_base_cache + hash;
1521
	struct delta_base_cache_lru_list *lru;
1522

1523 1524
	release_delta_base_cache(ent);
	delta_base_cached += base_size;
1525 1526 1527 1528 1529 1530

	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;
1531 1532 1533
		if (f->type == OBJ_BLOB)
			release_delta_base_cache(f);
	}
1534 1535 1536 1537 1538 1539 1540
	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);
	}
1541

1542 1543 1544 1545 1546
	ent->p = p;
	ent->base_offset = base_offset;
	ent->type = type;
	ent->data = base;
	ent->size = base_size;
1547 1548 1549 1550
	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;
1551 1552
}

1553
static void *unpack_delta_entry(struct packed_git *p,
1554
				struct pack_window **w_curs,
1555
				off_t curpos,
1556
				unsigned long delta_size,
1557
				off_t obj_offset,
1558
				enum object_type *type,
1559
				unsigned long *sizep)
1560
{
1561
	void *delta_data, *result, *base;
1562 1563
	unsigned long base_size;
	off_t base_offset;
N
Nicolas Pitre 已提交
1564

1565
	base_offset = get_delta_base(p, w_curs, &curpos, *type, obj_offset);
1566
	base = cache_or_unpack_entry(p, base_offset, &base_size, type, 0);
1567
	if (!base)
1568 1569 1570
		die("failed to read delta base object"
		    " at %"PRIuMAX" from %s",
		    (uintmax_t)base_offset, p->pack_name);
1571

1572
	delta_data = unpack_compressed_entry(p, w_curs, curpos, delta_size);
1573 1574
	result = patch_delta(base, base_size,
			     delta_data, delta_size,
1575
			     sizep);
1576 1577 1578
	if (!result)
		die("failed to apply delta");
	free(delta_data);
1579
	add_delta_base_cache(p, base_offset, base, base_size, *type);
1580 1581 1582
	return result;
}

1583
void *unpack_entry(struct packed_git *p, off_t obj_offset,
1584
		   enum object_type *type, unsigned long *sizep)
1585
{
1586
	struct pack_window *w_curs = NULL;
1587
	off_t curpos = obj_offset;
1588
	void *data;
1589

1590 1591
	*type = unpack_object_header(p, &w_curs, &curpos, sizep);
	switch (*type) {
1592 1593
	case OBJ_OFS_DELTA:
	case OBJ_REF_DELTA:
1594 1595
		data = unpack_delta_entry(p, &w_curs, curpos, *sizep,
					  obj_offset, type, sizep);
1596
		break;
1597 1598 1599 1600
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
1601
		data = unpack_compressed_entry(p, &w_curs, curpos, *sizep);
1602
		break;
1603
	default:
1604
		die("unknown object type %i in %s", *type, p->pack_name);
1605
	}
1606
	unuse_pack(&w_curs);
1607
	return data;
1608 1609
}

1610
const unsigned char *nth_packed_object_sha1(struct packed_git *p,
1611
					    uint32_t n)
1612
{
1613
	const unsigned char *index = p->index_data;
1614 1615 1616 1617 1618
	if (!index) {
		if (open_pack_index(p))
			return NULL;
		index = p->index_data;
	}
N
Nicolas Pitre 已提交
1619
	if (n >= p->num_objects)
1620
		return NULL;
1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645
	index += 4 * 256;
	if (p->index_version == 1) {
		return index + 24 * n + 4;
	} else {
		index += 8;
		return index + 20 * n;
	}
}

static off_t nth_packed_object_offset(const struct packed_git *p, uint32_t n)
{
	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)));
	}
1646 1647
}

1648
off_t find_pack_entry_one(const unsigned char *sha1,
N
Nicolas Pitre 已提交
1649
				  struct packed_git *p)
1650
{
1651 1652
	const uint32_t *level1_ofs = p->index_data;
	const unsigned char *index = p->index_data;
1653
	unsigned hi, lo;
1654

1655 1656 1657 1658 1659 1660
	if (!index) {
		if (open_pack_index(p))
			return 0;
		level1_ofs = p->index_data;
		index = p->index_data;
	}
1661 1662 1663 1664
	if (p->index_version > 1) {
		level1_ofs += 2;
		index += 8;
	}
1665
	index += 4 * 256;
1666 1667
	hi = ntohl(level1_ofs[*sha1]);
	lo = ((*sha1 == 0x0) ? 0 : ntohl(level1_ofs[*sha1 - 1]));
1668 1669

	do {
1670 1671 1672
		unsigned mi = (lo + hi) / 2;
		unsigned x = (p->index_version > 1) ? (mi * 20) : (mi * 24 + 4);
		int cmp = hashcmp(index + x, sha1);
N
Nicolas Pitre 已提交
1673
		if (!cmp)
1674
			return nth_packed_object_offset(p, mi);
1675 1676 1677 1678 1679 1680 1681 1682
		if (cmp > 0)
			hi = mi;
		else
			lo = mi+1;
	} while (lo < hi);
	return 0;
}

1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700
static int matches_pack_name(struct packed_git *p, const char *ig)
{
	const char *last_c, *c;

	if (!strcmp(p->pack_name, ig))
		return 0;

	for (c = p->pack_name, last_c = c; *c;)
		if (*c == '/')
			last_c = ++c;
		else
			++c;
	if (!strcmp(last_c, ig))
		return 0;

	return 1;
}

1701
static int find_pack_entry(const unsigned char *sha1, struct pack_entry *e, const char **ignore_packed)
1702
{
1703
	static struct packed_git *last_found = (void *)1;
1704
	struct packed_git *p;
1705
	off_t offset;
N
Nicolas Pitre 已提交
1706

1707
	prepare_packed_git();
1708 1709 1710
	if (!packed_git)
		return 0;
	p = (last_found == (void *)1) ? packed_git : last_found;
1711

1712
	do {
1713 1714 1715
		if (ignore_packed) {
			const char **ig;
			for (ig = ignore_packed; *ig; ig++)
1716
				if (!matches_pack_name(p, *ig))
1717 1718
					break;
			if (*ig)
1719
				goto next;
1720
		}
1721

N
Nicolas Pitre 已提交
1722 1723
		offset = find_pack_entry_one(sha1, p);
		if (offset) {
1724 1725 1726 1727 1728 1729 1730 1731 1732 1733
			/*
			 * 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 (p->pack_fd == -1 && open_packed_git(p)) {
				error("packfile %s cannot be accessed", p->pack_name);
1734
				goto next;
1735
			}
N
Nicolas Pitre 已提交
1736 1737 1738
			e->offset = offset;
			e->p = p;
			hashcpy(e->sha1, sha1);
1739
			last_found = p;
1740
			return 1;
N
Nicolas Pitre 已提交
1741
		}
1742 1743 1744 1745 1746 1747 1748 1749 1750

		next:
		if (p == last_found)
			p = packed_git;
		else
			p = p->next;
		if (p == last_found)
			p = p->next;
	} while (p);
1751 1752 1753
	return 0;
}

J
Junio C Hamano 已提交
1754
struct packed_git *find_sha1_pack(const unsigned char *sha1,
1755 1756 1757 1758 1759
				  struct packed_git *packs)
{
	struct packed_git *p;

	for (p = packs; p; p = p->next) {
N
Nicolas Pitre 已提交
1760
		if (find_pack_entry_one(sha1, p))
1761 1762 1763
			return p;
	}
	return NULL;
1764

1765 1766
}

1767
static int sha1_loose_object_info(const unsigned char *sha1, unsigned long *sizep)
1768
{
1769
	int status;
1770 1771 1772
	unsigned long mapsize, size;
	void *map;
	z_stream stream;
N
Nicolas Pitre 已提交
1773
	char hdr[32];
1774

1775
	map = map_sha1_file(sha1, &mapsize);
1776 1777
	if (!map)
		return error("unable to find %s", sha1_to_hex(sha1));
1778 1779 1780
	if (unpack_sha1_header(&stream, map, mapsize, hdr, sizeof(hdr)) < 0)
		status = error("unable to unpack %s header",
			       sha1_to_hex(sha1));
1781
	else if ((status = parse_sha1_header(hdr, &size)) < 0)
1782
		status = error("unable to parse %s header", sha1_to_hex(sha1));
1783 1784
	else if (sizep)
		*sizep = size;
1785 1786 1787 1788 1789
	inflateEnd(&stream);
	munmap(map, mapsize);
	return status;
}

1790
int sha1_object_info(const unsigned char *sha1, unsigned long *sizep)
1791 1792 1793 1794 1795 1796
{
	struct pack_entry e;

	if (!find_pack_entry(sha1, &e, NULL)) {
		reprepare_packed_git();
		if (!find_pack_entry(sha1, &e, NULL))
1797
			return sha1_loose_object_info(sha1, sizep);
1798
	}
1799
	return packed_object_info(e.p, e.offset, sizep);
1800 1801
}

1802 1803
static void *read_packed_sha1(const unsigned char *sha1,
			      enum object_type *type, unsigned long *size)
1804 1805 1806
{
	struct pack_entry e;

1807
	if (!find_pack_entry(sha1, &e, NULL))
1808
		return NULL;
1809
	else
1810
		return cache_or_unpack_entry(e.p, e.offset, size, type, 1);
1811 1812
}

1813 1814 1815 1816 1817 1818 1819 1820
/*
 * 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];
1821
	enum object_type type;
1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838
	void *buf;
	unsigned long size;
} *cached_objects;
static int cached_object_nr, cached_object_alloc;

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

1839 1840
int pretend_sha1_file(void *buf, unsigned long len, enum object_type type,
		      unsigned char *sha1)
1841 1842 1843
{
	struct cached_object *co;

1844
	hash_sha1_file(buf, len, typename(type), sha1);
1845 1846 1847 1848 1849 1850 1851 1852 1853 1854
	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;
1855
	co->type = type;
J
Junio C Hamano 已提交
1856 1857
	co->buf = xmalloc(len);
	memcpy(co->buf, buf, len);
1858 1859 1860 1861
	hashcpy(co->sha1, sha1);
	return 0;
}

1862 1863
void *read_sha1_file(const unsigned char *sha1, enum object_type *type,
		     unsigned long *size)
1864 1865 1866
{
	unsigned long mapsize;
	void *map, *buf;
1867 1868 1869 1870 1871 1872 1873
	struct cached_object *co;

	co = find_cached_object(sha1);
	if (co) {
		buf = xmalloc(co->size + 1);
		memcpy(buf, co->buf, co->size);
		((char*)buf)[co->size] = 0;
1874
		*type = co->type;
1875 1876 1877
		*size = co->size;
		return buf;
	}
1878

1879 1880 1881
	buf = read_packed_sha1(sha1, type, size);
	if (buf)
		return buf;
1882
	map = map_sha1_file(sha1, &mapsize);
1883
	if (map) {
1884
		buf = unpack_sha1_file(map, mapsize, type, size, sha1);
1885 1886 1887
		munmap(map, mapsize);
		return buf;
	}
1888
	reprepare_packed_git();
1889
	return read_packed_sha1(sha1, type, size);
1890 1891
}

1892
void *read_object_with_reference(const unsigned char *sha1,
1893
				 const char *required_type_name,
1894 1895
				 unsigned long *size,
				 unsigned char *actual_sha1_return)
1896
{
1897
	enum object_type type, required_type;
1898 1899
	void *buffer;
	unsigned long isize;
1900
	unsigned char actual_sha1[20];
1901

1902
	required_type = type_from_string(required_type_name);
1903
	hashcpy(actual_sha1, sha1);
1904 1905 1906
	while (1) {
		int ref_length = -1;
		const char *ref_type = NULL;
1907

1908
		buffer = read_sha1_file(actual_sha1, &type, &isize);
1909 1910
		if (!buffer)
			return NULL;
1911
		if (type == required_type) {
1912 1913
			*size = isize;
			if (actual_sha1_return)
1914
				hashcpy(actual_sha1_return, actual_sha1);
1915 1916 1917
			return buffer;
		}
		/* Handle references */
1918
		else if (type == OBJ_COMMIT)
1919
			ref_type = "tree ";
1920
		else if (type == OBJ_TAG)
1921 1922 1923 1924 1925 1926
			ref_type = "object ";
		else {
			free(buffer);
			return NULL;
		}
		ref_length = strlen(ref_type);
1927

1928
		if (memcmp(buffer, ref_type, ref_length) ||
1929
		    get_sha1_hex((char *) buffer + ref_length, actual_sha1)) {
1930 1931 1932
			free(buffer);
			return NULL;
		}
1933
		free(buffer);
1934 1935
		/* Now we have the ID of the referred-to object in
		 * actual_sha1.  Check again. */
1936 1937 1938
	}
}

N
Nicolas Pitre 已提交
1939
static void write_sha1_file_prepare(const void *buf, unsigned long len,
R
Rene Scharfe 已提交
1940
                                    const char *type, unsigned char *sha1,
N
Nicolas Pitre 已提交
1941
                                    char *hdr, int *hdrlen)
1942 1943 1944 1945
{
	SHA_CTX c;

	/* Generate the header */
N
Nicolas Pitre 已提交
1946
	*hdrlen = sprintf(hdr, "%s %lu", type, len)+1;
1947 1948 1949 1950 1951 1952 1953 1954

	/* Sha1.. */
	SHA1_Init(&c);
	SHA1_Update(&c, hdr, *hdrlen);
	SHA1_Update(&c, buf, len);
	SHA1_Final(sha1, &c);
}

1955 1956 1957 1958 1959 1960
/*
 * Link the tempfile to the final place, possibly creating the
 * last directory level as you do so.
 *
 * Returns the errno on failure, 0 on success.
 */
1961
static int link_temp_to_file(const char *tmpfile, const char *filename)
1962 1963
{
	int ret;
S
Shawn Pearce 已提交
1964
	char *dir;
1965 1966 1967 1968 1969

	if (!link(tmpfile, filename))
		return 0;

	/*
S
Shawn Pearce 已提交
1970
	 * Try to mkdir the last path component if that failed.
1971 1972 1973 1974 1975 1976
	 *
	 * Re-try the "link()" regardless of whether the mkdir
	 * succeeds, since a race might mean that somebody
	 * else succeeded.
	 */
	ret = errno;
S
Shawn Pearce 已提交
1977 1978 1979
	dir = strrchr(filename, '/');
	if (dir) {
		*dir = 0;
1980
		if (!mkdir(filename, 0777) && adjust_shared_perm(filename)) {
1981
			*dir = '/';
S
Shawn Pearce 已提交
1982
			return -2;
1983
		}
S
Shawn Pearce 已提交
1984 1985 1986 1987
		*dir = '/';
		if (!link(tmpfile, filename))
			return 0;
		ret = errno;
1988 1989 1990 1991 1992 1993 1994
	}
	return ret;
}

/*
 * Move the just written object into its final resting place
 */
1995
int move_temp_to_file(const char *tmpfile, const char *filename)
1996 1997
{
	int ret = link_temp_to_file(tmpfile, filename);
1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011

	/*
	 * 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.
	 *
	 * When this succeeds, we just return 0. We have nothing
	 * left to unlink.
	 */
	if (ret && ret != EEXIST) {
		if (!rename(tmpfile, filename))
2012
			return 0;
2013
		ret = errno;
2014 2015 2016 2017
	}
	unlink(tmpfile);
	if (ret) {
		if (ret != EEXIST) {
2018
			return error("unable to write sha1 filename %s: %s\n", filename, strerror(ret));
2019 2020 2021 2022 2023 2024 2025
		}
		/* FIXME!!! Collision check here ? */
	}

	return 0;
}

L
Linus Torvalds 已提交
2026 2027
static int write_buffer(int fd, const void *buf, size_t len)
{
L
Linus Torvalds 已提交
2028
	if (write_in_full(fd, buf, len) < 0)
2029
		return error("file write error (%s)", strerror(errno));
L
Linus Torvalds 已提交
2030 2031 2032
	return 0;
}

N
Nicolas Pitre 已提交
2033
int hash_sha1_file(const void *buf, unsigned long len, const char *type,
R
Rene Scharfe 已提交
2034 2035
                   unsigned char *sha1)
{
N
Nicolas Pitre 已提交
2036
	char hdr[32];
R
Rene Scharfe 已提交
2037 2038 2039 2040 2041
	int hdrlen;
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	return 0;
}

2042
int write_sha1_file(void *buf, unsigned long len, const char *type, unsigned char *returnsha1)
2043
{
2044
	int size, ret;
2045
	unsigned char *compressed;
2046 2047
	z_stream stream;
	unsigned char sha1[20];
2048
	char *filename;
2049
	static char tmpfile[PATH_MAX];
N
Nicolas Pitre 已提交
2050
	char hdr[32];
2051
	int fd, hdrlen;
2052

2053 2054 2055
	/* Normally if we have it in the pack then we do not bother writing
	 * it out into .git/objects/??/?{38} file.
	 */
R
Rene Scharfe 已提交
2056 2057
	write_sha1_file_prepare(buf, len, type, sha1, hdr, &hdrlen);
	filename = sha1_file_name(sha1);
2058
	if (returnsha1)
2059
		hashcpy(returnsha1, sha1);
2060 2061
	if (has_sha1_file(sha1))
		return 0;
2062 2063
	fd = open(filename, O_RDONLY);
	if (fd >= 0) {
2064
		/*
2065 2066
		 * FIXME!!! We might do collision checking here, but we'd
		 * need to uncompress the old file and check it. Later.
2067
		 */
2068
		close(fd);
2069 2070 2071
		return 0;
	}

2072
	if (errno != ENOENT) {
2073
		return error("sha1 file %s: %s\n", filename, strerror(errno));
2074 2075
	}

2076
	snprintf(tmpfile, sizeof(tmpfile), "%s/tmp_obj_XXXXXX", get_object_directory());
2077

2078 2079
	fd = mkstemp(tmpfile);
	if (fd < 0) {
2080 2081 2082 2083
		if (errno == EPERM)
			return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
		else
			return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
2084 2085
	}

2086 2087
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2088
	deflateInit(&stream, zlib_compression_level);
2089
	size = 8 + deflateBound(&stream, len+hdrlen);
2090
	compressed = xmalloc(size);
2091 2092 2093 2094

	/* Compress it */
	stream.next_out = compressed;
	stream.avail_out = size;
2095 2096

	/* First header.. */
N
Nicolas Pitre 已提交
2097
	stream.next_in = (unsigned char *)hdr;
2098
	stream.avail_in = hdrlen;
2099 2100
	while (deflate(&stream, 0) == Z_OK)
		/* nothing */;
2101 2102 2103 2104

	/* Then the data itself.. */
	stream.next_in = buf;
	stream.avail_in = len;
2105 2106 2107 2108 2109 2110 2111 2112
	ret = deflate(&stream, Z_FINISH);
	if (ret != Z_STREAM_END)
		die("unable to deflate new object %s (%d)", sha1_to_hex(sha1), ret);

	ret = deflateEnd(&stream);
	if (ret != Z_OK)
		die("deflateEnd on object %s failed (%d)", sha1_to_hex(sha1), ret);

2113 2114
	size = stream.total_out;

L
Linus Torvalds 已提交
2115 2116
	if (write_buffer(fd, compressed, size) < 0)
		die("unable to write sha1 file");
2117
	fchmod(fd, 0444);
2118 2119
	if (close(fd))
		die("unable to write sha1 file");
2120
	free(compressed);
2121

2122
	return move_temp_to_file(tmpfile, filename);
2123
}
2124

L
Linus Torvalds 已提交
2125 2126 2127 2128 2129
/*
 * We need to unpack and recompress the object for writing
 * it out to a different file.
 */
static void *repack_object(const unsigned char *sha1, unsigned long *objsize)
D
Daniel Barkalow 已提交
2130
{
L
Linus Torvalds 已提交
2131
	size_t size;
D
Daniel Barkalow 已提交
2132
	z_stream stream;
L
Linus Torvalds 已提交
2133 2134
	unsigned char *unpacked;
	unsigned long len;
2135
	enum object_type type;
N
Nicolas Pitre 已提交
2136
	char hdr[32];
L
Linus Torvalds 已提交
2137 2138
	int hdrlen;
	void *buf;
2139

2140
	/* need to unpack and recompress it by itself */
2141
	unpacked = read_packed_sha1(sha1, &type, &len);
2142 2143
	if (!unpacked)
		error("cannot read sha1_file for %s", sha1_to_hex(sha1));
D
Daniel Barkalow 已提交
2144

2145
	hdrlen = sprintf(hdr, "%s %lu", typename(type), len) + 1;
D
Daniel Barkalow 已提交
2146

L
Linus Torvalds 已提交
2147 2148
	/* Set it up */
	memset(&stream, 0, sizeof(stream));
2149
	deflateInit(&stream, zlib_compression_level);
L
Linus Torvalds 已提交
2150 2151
	size = deflateBound(&stream, len + hdrlen);
	buf = xmalloc(size);
D
Daniel Barkalow 已提交
2152

L
Linus Torvalds 已提交
2153 2154 2155
	/* Compress it */
	stream.next_out = buf;
	stream.avail_out = size;
D
Daniel Barkalow 已提交
2156

L
Linus Torvalds 已提交
2157 2158 2159 2160 2161
	/* First header.. */
	stream.next_in = (void *)hdr;
	stream.avail_in = hdrlen;
	while (deflate(&stream, 0) == Z_OK)
		/* nothing */;
2162

L
Linus Torvalds 已提交
2163 2164 2165 2166 2167 2168 2169
	/* Then the data itself.. */
	stream.next_in = unpacked;
	stream.avail_in = len;
	while (deflate(&stream, Z_FINISH) == Z_OK)
		/* nothing */;
	deflateEnd(&stream);
	free(unpacked);
2170

L
Linus Torvalds 已提交
2171 2172 2173 2174 2175 2176 2177 2178
	*objsize = stream.total_out;
	return buf;
}

int write_sha1_to_fd(int fd, const unsigned char *sha1)
{
	int retval;
	unsigned long objsize;
2179
	void *buf = map_sha1_file(sha1, &objsize);
L
Linus Torvalds 已提交
2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190

	if (buf) {
		retval = write_buffer(fd, buf, objsize);
		munmap(buf, objsize);
		return retval;
	}

	buf = repack_object(sha1, &objsize);
	retval = write_buffer(fd, buf, objsize);
	free(buf);
	return retval;
D
Daniel Barkalow 已提交
2191 2192
}

2193 2194
int write_sha1_from_fd(const unsigned char *sha1, int fd, char *buffer,
		       size_t bufsize, size_t *bufposn)
2195
{
2196
	char tmpfile[PATH_MAX];
2197 2198 2199
	int local;
	z_stream stream;
	unsigned char real_sha1[20];
2200
	unsigned char discard[4096];
2201 2202 2203
	int ret;
	SHA_CTX c;

2204
	snprintf(tmpfile, sizeof(tmpfile), "%s/tmp_obj_XXXXXX", get_object_directory());
2205

2206
	local = mkstemp(tmpfile);
2207 2208 2209 2210 2211 2212
	if (local < 0) {
		if (errno == EPERM)
			return error("insufficient permission for adding an object to repository database %s\n", get_object_directory());
		else
			return error("unable to create temporary sha1 filename %s: %s\n", tmpfile, strerror(errno));
	}
2213 2214 2215 2216 2217 2218 2219 2220 2221

	memset(&stream, 0, sizeof(stream));

	inflateInit(&stream);

	SHA1_Init(&c);

	do {
		ssize_t size;
2222 2223
		if (*bufposn) {
			stream.avail_in = *bufposn;
P
Pavel Roskin 已提交
2224
			stream.next_in = (unsigned char *) buffer;
2225 2226 2227 2228 2229 2230 2231
			do {
				stream.next_out = discard;
				stream.avail_out = sizeof(discard);
				ret = inflate(&stream, Z_SYNC_FLUSH);
				SHA1_Update(&c, discard, sizeof(discard) -
					    stream.avail_out);
			} while (stream.avail_in && ret == Z_OK);
L
Linus Torvalds 已提交
2232 2233
			if (write_buffer(local, buffer, *bufposn - stream.avail_in) < 0)
				die("unable to write sha1 file");
2234 2235 2236 2237 2238 2239
			memmove(buffer, buffer + *bufposn - stream.avail_in,
				stream.avail_in);
			*bufposn = stream.avail_in;
			if (ret != Z_OK)
				break;
		}
2240
		size = xread(fd, buffer + *bufposn, bufsize - *bufposn);
2241 2242
		if (size <= 0) {
			close(local);
2243
			unlink(tmpfile);
2244 2245 2246 2247 2248
			if (!size)
				return error("Connection closed?");
			perror("Reading from connection");
			return -1;
		}
2249 2250
		*bufposn += size;
	} while (1);
2251 2252
	inflateEnd(&stream);

2253
	fchmod(local, 0444);
2254 2255
	if (close(local) != 0)
		die("unable to write sha1 file");
2256 2257
	SHA1_Final(real_sha1, &c);
	if (ret != Z_STREAM_END) {
2258
		unlink(tmpfile);
2259 2260
		return error("File %s corrupted", sha1_to_hex(sha1));
	}
2261
	if (hashcmp(sha1, real_sha1)) {
2262
		unlink(tmpfile);
2263
		return error("File %s has bad hash", sha1_to_hex(sha1));
2264
	}
2265 2266

	return move_temp_to_file(tmpfile, sha1_file_name(sha1));
2267 2268
}

2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284
int has_pack_index(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_index_name(sha1), &st))
		return 0;
	return 1;
}

int has_pack_file(const unsigned char *sha1)
{
	struct stat st;
	if (stat(sha1_pack_name(sha1), &st))
		return 0;
	return 1;
}

2285
int has_sha1_pack(const unsigned char *sha1, const char **ignore_packed)
2286 2287
{
	struct pack_entry e;
2288
	return find_pack_entry(sha1, &e, ignore_packed);
2289 2290
}

2291 2292 2293
int has_sha1_file(const unsigned char *sha1)
{
	struct stat st;
2294 2295
	struct pack_entry e;

2296
	if (find_pack_entry(sha1, &e, NULL))
2297
		return 1;
2298
	return find_sha1_file(sha1, &st) ? 1 : 0;
2299
}
J
Junio C Hamano 已提交
2300

2301 2302
/*
 * reads from fd as long as possible into a supplied buffer of size bytes.
2303
 * If necessary the buffer's size is increased using realloc()
2304 2305 2306
 *
 * returns 0 if anything went fine and -1 otherwise
 *
2307 2308
 * The buffer is always NUL-terminated, not including it in returned size.
 *
2309 2310 2311
 * NOTE: both buf and size may change, but even when -1 is returned
 * you still have to free() it yourself.
 */
2312
int read_fd(int fd, char **return_buf, unsigned long *return_size)
2313
{
2314
	char *buf = *return_buf;
2315
	unsigned long size = *return_size;
2316
	ssize_t iret;
2317
	unsigned long off = 0;
2318

2319 2320 2321 2322 2323
	if (!buf || size <= 1) {
		size = 1024;
		buf = xrealloc(buf, size);
	}

2324
	do {
2325
		iret = xread(fd, buf + off, (size - 1) - off);
2326 2327
		if (iret > 0) {
			off += iret;
2328 2329
			if (off == size - 1) {
				size = alloc_nr(size);
J
Jonas Fonseca 已提交
2330
				buf = xrealloc(buf, size);
2331 2332 2333
			}
		}
	} while (iret > 0);
2334

2335 2336
	buf[off] = '\0';

2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347
	*return_buf = buf;
	*return_size = off;

	if (iret < 0)
		return -1;
	return 0;
}

int index_pipe(unsigned char *sha1, int fd, const char *type, int write_object)
{
	unsigned long size = 4096;
J
Jonas Fonseca 已提交
2348
	char *buf = xmalloc(size);
2349 2350
	int ret;

2351
	if (read_fd(fd, &buf, &size)) {
2352 2353 2354
		free(buf);
		return -1;
	}
2355

2356
	if (!type)
2357
		type = blob_type;
2358
	if (write_object)
2359
		ret = write_sha1_file(buf, size, type, sha1);
R
Rene Scharfe 已提交
2360 2361
	else
		ret = hash_sha1_file(buf, size, type, sha1);
2362 2363 2364 2365
	free(buf);
	return ret;
}

2366
int index_fd(unsigned char *sha1, int fd, struct stat *st, int write_object,
2367
	     enum object_type type, const char *path)
J
Junio C Hamano 已提交
2368
{
2369
	size_t size = xsize_t(st->st_size);
2370
	void *buf = NULL;
L
Linus Torvalds 已提交
2371
	int ret, re_allocated = 0;
J
Junio C Hamano 已提交
2372 2373

	if (size)
2374
		buf = xmmap(NULL, size, PROT_READ, MAP_PRIVATE, fd, 0);
J
Junio C Hamano 已提交
2375 2376
	close(fd);

2377
	if (!type)
2378
		type = OBJ_BLOB;
L
Linus Torvalds 已提交
2379 2380 2381 2382

	/*
	 * Convert blobs to git internal format
	 */
2383
	if ((type == OBJ_BLOB) && S_ISREG(st->st_mode)) {
L
Linus Torvalds 已提交
2384
		unsigned long nsize = size;
2385 2386 2387
		char *nbuf = convert_to_git(path, buf, &nsize);
		if (nbuf) {
			munmap(buf, size);
L
Linus Torvalds 已提交
2388 2389 2390 2391 2392 2393
			size = nsize;
			buf = nbuf;
			re_allocated = 1;
		}
	}

2394
	if (write_object)
2395
		ret = write_sha1_file(buf, size, typename(type), sha1);
R
Rene Scharfe 已提交
2396
	else
2397
		ret = hash_sha1_file(buf, size, typename(type), sha1);
L
Linus Torvalds 已提交
2398 2399 2400 2401
	if (re_allocated) {
		free(buf);
		return ret;
	}
2402 2403 2404
	if (size)
		munmap(buf, size);
	return ret;
J
Junio C Hamano 已提交
2405
}
2406 2407 2408 2409 2410

int index_path(unsigned char *sha1, const char *path, struct stat *st, int write_object)
{
	int fd;
	char *target;
2411
	size_t len;
2412 2413 2414 2415 2416 2417 2418

	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));
2419
		if (index_fd(sha1, fd, st, write_object, OBJ_BLOB, path) < 0)
2420 2421 2422 2423
			return error("%s: failed to insert into database",
				     path);
		break;
	case S_IFLNK:
2424 2425 2426
		len = xsize_t(st->st_size);
		target = xmalloc(len + 1);
		if (readlink(path, target, len + 1) != st->st_size) {
2427 2428 2429 2430 2431
			char *errstr = strerror(errno);
			free(target);
			return error("readlink(\"%s\"): %s", path,
			             errstr);
		}
R
Rene Scharfe 已提交
2432
		if (!write_object)
2433 2434
			hash_sha1_file(target, len, blob_type, sha1);
		else if (write_sha1_file(target, len, blob_type, sha1))
2435 2436 2437 2438
			return error("%s: failed to insert into database",
				     path);
		free(target);
		break;
2439 2440
	case S_IFDIR:
		return resolve_gitlink_ref(path, "HEAD", sha1);
2441 2442 2443 2444 2445
	default:
		return error("%s: unsupported file type", path);
	}
	return 0;
}
2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466

int read_pack_header(int fd, struct pack_header *header)
{
	char *c = (char*)header;
	ssize_t remaining = sizeof(struct pack_header);
	do {
		ssize_t r = xread(fd, c, remaining);
		if (r <= 0)
			/* "eof before pack header was fully read" */
			return PH_ERROR_EOF;
		remaining -= r;
		c += r;
	} while (remaining > 0);
	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;
}