index-pack.c 47.8 KB
Newer Older
1
#include "builtin.h"
2
#include "config.h"
S
Sergey Vlasov 已提交
3 4 5
#include "delta.h"
#include "pack.h"
#include "csum-file.h"
6 7 8 9
#include "blob.h"
#include "commit.h"
#include "tag.h"
#include "tree.h"
N
Nicolas Pitre 已提交
10
#include "progress.h"
11
#include "fsck.h"
12
#include "exec-cmd.h"
13
#include "streaming.h"
14
#include "thread-utils.h"
15
#include "packfile.h"
16
#include "object-store.h"
S
Sergey Vlasov 已提交
17 18

static const char index_pack_usage[] =
J
Junio C Hamano 已提交
19
"git index-pack [-v] [-o <index-file>] [--keep | --keep=<msg>] [--verify] [--strict] (<pack-file> | --stdin [--fix-thin] [<pack-file>])";
S
Sergey Vlasov 已提交
20

21
struct object_entry {
G
Geert Bosch 已提交
22
	struct pack_idx_entry idx;
23
	unsigned long size;
24 25 26
	unsigned char hdr_size;
	signed char type;
	signed char real_type;
S
Sergey Vlasov 已提交
27 28
};

29
struct object_stat {
30 31
	unsigned delta_depth;
	int base_object_no;
32 33
};

34
struct base_data {
35 36
	struct base_data *base;
	struct base_data *child;
37
	struct object_entry *obj;
38 39
	void *data;
	unsigned long size;
40 41
	int ref_first, ref_last;
	int ofs_first, ofs_last;
42 43
};

44 45 46 47 48 49
struct thread_local {
#ifndef NO_PTHREADS
	pthread_t thread;
#endif
	struct base_data *base_cache;
	size_t base_cache_used;
50
	int pack_fd;
51 52
};

53
/* Remember to update object flag allocation in object.h */
54 55 56
#define FLAG_LINK (1u<<20)
#define FLAG_CHECKED (1u<<21)

57 58 59 60 61 62
struct ofs_delta_entry {
	off_t offset;
	int obj_no;
};

struct ref_delta_entry {
63
	struct object_id oid;
64
	int obj_no;
S
Sergey Vlasov 已提交
65 66 67
};

static struct object_entry *objects;
68
static struct object_stat *obj_stat;
69 70
static struct ofs_delta_entry *ofs_deltas;
static struct ref_delta_entry *ref_deltas;
71
static struct thread_local nothread_data;
S
Sergey Vlasov 已提交
72
static int nr_objects;
73 74 75
static int nr_ofs_deltas;
static int nr_ref_deltas;
static int ref_deltas_alloc;
76
static int nr_resolved_deltas;
77
static int nr_threads;
S
Sergey Vlasov 已提交
78

79
static int from_stdin;
80
static int strict;
81
static int do_fsck_object;
82
static struct fsck_options fsck_options = FSCK_OPTIONS_STRICT;
N
Nicolas Pitre 已提交
83
static int verbose;
84
static int show_resolving_progress;
85
static int show_stat;
86
static int check_self_contained_and_connected;
N
Nicolas Pitre 已提交
87

88
static struct progress *progress;
89

90 91
/* We always read in 4kB chunks. */
static unsigned char input_buffer[4096];
92 93
static unsigned int input_offset, input_len;
static off_t consumed_bytes;
94
static off_t max_input_size;
95
static unsigned deepest_delta;
96
static git_hash_ctx input_ctx;
97
static uint32_t input_crc32;
98 99
static int input_fd, output_fd;
static const char *curr_pack;
100

101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118
#ifndef NO_PTHREADS

static struct thread_local *thread_data;
static int nr_dispatched;
static int threads_active;

static pthread_mutex_t read_mutex;
#define read_lock()		lock_mutex(&read_mutex)
#define read_unlock()		unlock_mutex(&read_mutex)

static pthread_mutex_t counter_mutex;
#define counter_lock()		lock_mutex(&counter_mutex)
#define counter_unlock()	unlock_mutex(&counter_mutex)

static pthread_mutex_t work_mutex;
#define work_lock()		lock_mutex(&work_mutex)
#define work_unlock()		unlock_mutex(&work_mutex)

119 120 121 122
static pthread_mutex_t deepest_delta_mutex;
#define deepest_delta_lock()	lock_mutex(&deepest_delta_mutex)
#define deepest_delta_unlock()	unlock_mutex(&deepest_delta_mutex)

123 124 125 126
static pthread_mutex_t type_cas_mutex;
#define type_cas_lock()		lock_mutex(&type_cas_mutex)
#define type_cas_unlock()	unlock_mutex(&type_cas_mutex)

127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145
static pthread_key_t key;

static inline void lock_mutex(pthread_mutex_t *mutex)
{
	if (threads_active)
		pthread_mutex_lock(mutex);
}

static inline void unlock_mutex(pthread_mutex_t *mutex)
{
	if (threads_active)
		pthread_mutex_unlock(mutex);
}

/*
 * Mutex and conditional variable can't be statically-initialized on Windows.
 */
static void init_thread(void)
{
146
	int i;
147 148 149
	init_recursive_mutex(&read_mutex);
	pthread_mutex_init(&counter_mutex, NULL);
	pthread_mutex_init(&work_mutex, NULL);
150
	pthread_mutex_init(&type_cas_mutex, NULL);
151 152
	if (show_stat)
		pthread_mutex_init(&deepest_delta_mutex, NULL);
153 154
	pthread_key_create(&key, NULL);
	thread_data = xcalloc(nr_threads, sizeof(*thread_data));
155 156 157 158 159 160
	for (i = 0; i < nr_threads; i++) {
		thread_data[i].pack_fd = open(curr_pack, O_RDONLY);
		if (thread_data[i].pack_fd == -1)
			die_errno(_("unable to open %s"), curr_pack);
	}

161 162 163 164 165
	threads_active = 1;
}

static void cleanup_thread(void)
{
166
	int i;
167 168 169 170 171 172
	if (!threads_active)
		return;
	threads_active = 0;
	pthread_mutex_destroy(&read_mutex);
	pthread_mutex_destroy(&counter_mutex);
	pthread_mutex_destroy(&work_mutex);
173
	pthread_mutex_destroy(&type_cas_mutex);
174 175
	if (show_stat)
		pthread_mutex_destroy(&deepest_delta_mutex);
176 177
	for (i = 0; i < nr_threads; i++)
		close(thread_data[i].pack_fd);
178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
	pthread_key_delete(key);
	free(thread_data);
}

#else

#define read_lock()
#define read_unlock()

#define counter_lock()
#define counter_unlock()

#define work_lock()
#define work_unlock()

193 194 195
#define deepest_delta_lock()
#define deepest_delta_unlock()

196 197 198
#define type_cas_lock()
#define type_cas_unlock()

199 200 201
#endif


202
static int mark_link(struct object *obj, int type, void *data, struct fsck_options *options)
203 204 205 206 207
{
	if (!obj)
		return -1;

	if (type != OBJ_ANY && obj->type != type)
208
		die(_("object type mismatch at %s"), oid_to_hex(&obj->oid));
209 210 211 212 213 214 215

	obj->flags |= FLAG_LINK;
	return 0;
}

/* The content of each linked object must have been checked
   or it must be already present in the object database */
216
static unsigned check_object(struct object *obj)
217 218
{
	if (!obj)
219
		return 0;
220 221

	if (!(obj->flags & FLAG_LINK))
222
		return 0;
223 224 225

	if (!(obj->flags & FLAG_CHECKED)) {
		unsigned long size;
226
		int type = oid_object_info(the_repository, &obj->oid, &size);
227 228
		if (type <= 0)
			die(_("did not receive expected object %s"),
229
			      oid_to_hex(&obj->oid));
230 231
		if (type != obj->type)
			die(_("object %s: expected type %s, found %s"),
232
			    oid_to_hex(&obj->oid),
233
			    type_name(obj->type), type_name(type));
234
		obj->flags |= FLAG_CHECKED;
235
		return 1;
236
	}
237 238

	return 0;
239 240
}

241
static unsigned check_objects(void)
242
{
243
	unsigned i, max, foreign_nr = 0;
244 245 246

	max = get_max_object_index();
	for (i = 0; i < max; i++)
247 248
		foreign_nr += check_object(get_indexed_object(i));
	return foreign_nr;
249 250 251
}


252
/* Discard current buffer used content. */
253
static void flush(void)
254 255 256 257
{
	if (input_offset) {
		if (output_fd >= 0)
			write_or_die(output_fd, input_buffer, input_offset);
258
		the_hash_algo->update_fn(&input_ctx, input_buffer, input_offset);
259
		memmove(input_buffer, input_buffer + input_offset, input_len);
260 261 262 263
		input_offset = 0;
	}
}

264 265 266 267
/*
 * Make sure at least "min" bytes are available in the buffer, and
 * return the pointer to the buffer.
 */
268
static void *fill(int min)
S
Sergey Vlasov 已提交
269
{
270 271 272
	if (min <= input_len)
		return input_buffer + input_offset;
	if (min > sizeof(input_buffer))
273 274 275 276
		die(Q_("cannot fill %d byte",
		       "cannot fill %d bytes",
		       min),
		    min);
277
	flush();
278
	do {
279
		ssize_t ret = xread(input_fd, input_buffer + input_len,
280 281 282
				sizeof(input_buffer) - input_len);
		if (ret <= 0) {
			if (!ret)
283 284
				die(_("early EOF"));
			die_errno(_("read error on input"));
285 286
		}
		input_len += ret;
287 288
		if (from_stdin)
			display_throughput(progress, consumed_bytes + input_len);
289 290 291 292 293 294 295
	} while (input_len < min);
	return input_buffer;
}

static void use(int bytes)
{
	if (bytes > input_len)
296
		die(_("used more bytes than were available"));
297
	input_crc32 = crc32(input_crc32, input_buffer + input_offset, bytes);
298 299
	input_len -= bytes;
	input_offset += bytes;
300 301

	/* make sure off_t is sufficiently large not to wrap */
302
	if (signed_add_overflows(consumed_bytes, bytes))
303
		die(_("pack too large for current definition of off_t"));
304
	consumed_bytes += bytes;
305 306
	if (max_input_size && consumed_bytes > max_input_size)
		die(_("pack exceeds maximum allowed size"));
307
}
S
Sergey Vlasov 已提交
308

L
Linus Torvalds 已提交
309
static const char *open_pack_file(const char *pack_name)
310
{
311 312 313
	if (from_stdin) {
		input_fd = 0;
		if (!pack_name) {
314 315
			struct strbuf tmp_file = STRBUF_INIT;
			output_fd = odb_mkstemp(&tmp_file,
316
						"pack/tmp_pack_XXXXXX");
317
			pack_name = strbuf_detach(&tmp_file, NULL);
318
		} else {
319
			output_fd = open(pack_name, O_CREAT|O_EXCL|O_RDWR, 0600);
320 321 322
			if (output_fd < 0)
				die_errno(_("unable to create '%s'"), pack_name);
		}
323
		nothread_data.pack_fd = output_fd;
324 325 326
	} else {
		input_fd = open(pack_name, O_RDONLY);
		if (input_fd < 0)
327
			die_errno(_("cannot open packfile '%s'"), pack_name);
328
		output_fd = -1;
329
		nothread_data.pack_fd = input_fd;
330
	}
331
	the_hash_algo->init_fn(&input_ctx);
332
	return pack_name;
S
Sergey Vlasov 已提交
333 334 335 336
}

static void parse_pack_header(void)
{
337
	struct pack_header *hdr = fill(sizeof(struct pack_header));
S
Sergey Vlasov 已提交
338 339 340

	/* Header consistency check */
	if (hdr->hdr_signature != htonl(PACK_SIGNATURE))
341
		die(_("pack signature mismatch"));
N
Nicolas Pitre 已提交
342
	if (!pack_version_ok(hdr->hdr_version))
343
		die(_("pack version %"PRIu32" unsupported"),
344
			ntohl(hdr->hdr_version));
S
Sergey Vlasov 已提交
345 346

	nr_objects = ntohl(hdr->hdr_entries);
347
	use(sizeof(struct pack_header));
S
Sergey Vlasov 已提交
348 349
}

350
static NORETURN void bad_object(off_t offset, const char *format,
351
		       ...) __attribute__((format (printf, 2, 3)));
S
Sergey Vlasov 已提交
352

353
static NORETURN void bad_object(off_t offset, const char *format, ...)
S
Sergey Vlasov 已提交
354 355 356 357 358 359 360
{
	va_list params;
	char buf[1024];

	va_start(params, format);
	vsnprintf(buf, sizeof(buf), format, params);
	va_end(params);
361 362
	die(_("pack has bad object at offset %"PRIuMAX": %s"),
	    (uintmax_t)offset, buf);
S
Sergey Vlasov 已提交
363 364
}

365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
static inline struct thread_local *get_thread_data(void)
{
#ifndef NO_PTHREADS
	if (threads_active)
		return pthread_getspecific(key);
	assert(!threads_active &&
	       "This should only be reached when all threads are gone");
#endif
	return &nothread_data;
}

#ifndef NO_PTHREADS
static void set_thread_data(struct thread_local *data)
{
	if (threads_active)
		pthread_setspecific(key, data);
}
#endif

384 385
static struct base_data *alloc_base_data(void)
{
386
	struct base_data *base = xcalloc(1, sizeof(struct base_data));
387 388 389 390 391
	base->ref_last = -1;
	base->ofs_last = -1;
	return base;
}

392 393 394
static void free_base_data(struct base_data *c)
{
	if (c->data) {
395
		FREE_AND_NULL(c->data);
396
		get_thread_data()->base_cache_used -= c->size;
397 398 399
	}
}

400 401
static void prune_base_data(struct base_data *retain)
{
402
	struct base_data *b;
403 404 405
	struct thread_local *data = get_thread_data();
	for (b = data->base_cache;
	     data->base_cache_used > delta_base_cache_limit && b;
406
	     b = b->child) {
407 408
		if (b->data && b != retain)
			free_base_data(b);
409 410 411
	}
}

412 413 414 415 416
static void link_base_data(struct base_data *base, struct base_data *c)
{
	if (base)
		base->child = c;
	else
417
		get_thread_data()->base_cache = c;
418 419 420

	c->base = base;
	c->child = NULL;
421
	if (c->data)
422
		get_thread_data()->base_cache_used += c->size;
423
	prune_base_data(c);
424 425 426 427 428 429 430 431
}

static void unlink_base_data(struct base_data *c)
{
	struct base_data *base = c->base;
	if (base)
		base->child = NULL;
	else
432
		get_thread_data()->base_cache = NULL;
433
	free_base_data(c);
434 435
}

436 437 438 439 440
static int is_delta_type(enum object_type type)
{
	return (type == OBJ_REF_DELTA || type == OBJ_OFS_DELTA);
}

441
static void *unpack_entry_data(off_t offset, unsigned long size,
442
			       enum object_type type, struct object_id *oid)
S
Sergey Vlasov 已提交
443
{
444
	static char fixed_buf[8192];
445
	int status;
446
	git_zstream stream;
447
	void *buf;
448
	git_hash_ctx c;
449 450 451 452
	char hdr[32];
	int hdrlen;

	if (!is_delta_type(type)) {
453
		hdrlen = xsnprintf(hdr, sizeof(hdr), "%s %lu", type_name(type), size) + 1;
454 455
		the_hash_algo->init_fn(&c);
		the_hash_algo->update_fn(&c, hdr, hdrlen);
456
	} else
457
		oid = NULL;
458 459 460
	if (type == OBJ_BLOB && size > big_file_threshold)
		buf = fixed_buf;
	else
461
		buf = xmallocz(size);
S
Sergey Vlasov 已提交
462 463

	memset(&stream, 0, sizeof(stream));
464
	git_inflate_init(&stream);
S
Sergey Vlasov 已提交
465
	stream.next_out = buf;
466
	stream.avail_out = buf == fixed_buf ? sizeof(fixed_buf) : size;
S
Sergey Vlasov 已提交
467

468
	do {
469
		unsigned char *last_out = stream.next_out;
470 471
		stream.next_in = fill(1);
		stream.avail_in = input_len;
472 473
		status = git_inflate(&stream, 0);
		use(input_len - stream.avail_in);
474 475
		if (oid)
			the_hash_algo->update_fn(&c, last_out, stream.next_out - last_out);
476 477 478 479
		if (buf == fixed_buf) {
			stream.next_out = buf;
			stream.avail_out = sizeof(fixed_buf);
		}
480 481
	} while (status == Z_OK);
	if (stream.total_out != size || status != Z_STREAM_END)
482
		bad_object(offset, _("inflate returned %d"), status);
483
	git_inflate_end(&stream);
484 485
	if (oid)
		the_hash_algo->final_fn(oid->hash, &c);
486
	return buf == fixed_buf ? NULL : buf;
S
Sergey Vlasov 已提交
487 488
}

489
static void *unpack_raw_entry(struct object_entry *obj,
490
			      off_t *ofs_offset,
491 492
			      struct object_id *ref_oid,
			      struct object_id *oid)
S
Sergey Vlasov 已提交
493
{
494 495
	unsigned char *p;
	unsigned long size, c;
496
	off_t base_offset;
S
Sergey Vlasov 已提交
497
	unsigned shift;
498
	void *data;
S
Sergey Vlasov 已提交
499

G
Geert Bosch 已提交
500
	obj->idx.offset = consumed_bytes;
501
	input_crc32 = crc32(0, NULL, 0);
502 503 504 505 506

	p = fill(1);
	c = *p;
	use(1);
	obj->type = (c >> 4) & 7;
S
Sergey Vlasov 已提交
507 508 509
	size = (c & 15);
	shift = 4;
	while (c & 0x80) {
510 511 512
		p = fill(1);
		c = *p;
		use(1);
513
		size += (c & 0x7f) << shift;
S
Sergey Vlasov 已提交
514 515
		shift += 7;
	}
516
	obj->size = size;
S
Sergey Vlasov 已提交
517

518
	switch (obj->type) {
519
	case OBJ_REF_DELTA:
520 521
		hashcpy(ref_oid->hash, fill(the_hash_algo->rawsz));
		use(the_hash_algo->rawsz);
522 523
		break;
	case OBJ_OFS_DELTA:
524 525 526
		p = fill(1);
		c = *p;
		use(1);
527 528 529
		base_offset = c & 127;
		while (c & 128) {
			base_offset += 1;
530
			if (!base_offset || MSB(base_offset, 7))
531
				bad_object(obj->idx.offset, _("offset value overflow for delta base object"));
532 533 534
			p = fill(1);
			c = *p;
			use(1);
535 536
			base_offset = (base_offset << 7) + (c & 127);
		}
537 538
		*ofs_offset = obj->idx.offset - base_offset;
		if (*ofs_offset <= 0 || *ofs_offset >= obj->idx.offset)
539
			bad_object(obj->idx.offset, _("delta base offset is out of bound"));
540
		break;
S
Sergey Vlasov 已提交
541 542 543 544 545 546
	case OBJ_COMMIT:
	case OBJ_TREE:
	case OBJ_BLOB:
	case OBJ_TAG:
		break;
	default:
547
		bad_object(obj->idx.offset, _("unknown object type %d"), obj->type);
S
Sergey Vlasov 已提交
548
	}
G
Geert Bosch 已提交
549
	obj->hdr_size = consumed_bytes - obj->idx.offset;
550

551
	data = unpack_entry_data(obj->idx.offset, obj->size, obj->type, oid);
G
Geert Bosch 已提交
552
	obj->idx.crc32 = input_crc32;
553
	return data;
554 555
}

556 557 558
static void *unpack_data(struct object_entry *obj,
			 int (*consume)(const unsigned char *, unsigned long, void *),
			 void *cb_data)
559
{
560
	off_t from = obj[0].idx.offset + obj[0].hdr_size;
561
	off_t len = obj[1].idx.offset - from;
562
	unsigned char *data, *inbuf;
563
	git_zstream stream;
564
	int status;
S
Sergey Vlasov 已提交
565

566
	data = xmallocz(consume ? 64*1024 : obj->size);
567
	inbuf = xmalloc((len < 64*1024) ? (int)len : 64*1024);
568

569
	memset(&stream, 0, sizeof(stream));
570
	git_inflate_init(&stream);
571
	stream.next_out = data;
572
	stream.avail_out = consume ? 64*1024 : obj->size;
573 574

	do {
575
		ssize_t n = (len < 64*1024) ? (ssize_t)len : 64*1024;
576
		n = xpread(get_thread_data()->pack_fd, inbuf, n, from);
577
		if (n < 0)
578
			die_errno(_("cannot pread pack file"));
579
		if (!n)
580 581 582 583
			die(Q_("premature end of pack file, %"PRIuMAX" byte missing",
			       "premature end of pack file, %"PRIuMAX" bytes missing",
			       (unsigned int)len),
			    (uintmax_t)len);
584 585 586 587
		from += n;
		len -= n;
		stream.next_in = inbuf;
		stream.avail_in = n;
588 589 590 591 592 593 594 595 596 597 598 599 600
		if (!consume)
			status = git_inflate(&stream, 0);
		else {
			do {
				status = git_inflate(&stream, 0);
				if (consume(data, stream.next_out - data, cb_data)) {
					free(inbuf);
					free(data);
					return NULL;
				}
				stream.next_out = data;
				stream.avail_out = 64*1024;
			} while (status == Z_OK && stream.avail_in);
601
		}
602 603 604 605
	} while (len && status == Z_OK && !stream.avail_in);

	/* This has been inflated OK when first encountered, so... */
	if (status != Z_STREAM_END || stream.total_out != obj->size)
606
		die(_("serious inflate inconsistency"));
607 608 609

	git_inflate_end(&stream);
	free(inbuf);
610
	if (consume) {
611
		FREE_AND_NULL(data);
612
	}
S
Sergey Vlasov 已提交
613 614 615
	return data;
}

616 617 618 619 620
static void *get_data_from_pack(struct object_entry *obj)
{
	return unpack_data(obj, NULL, NULL);
}

621 622 623
static int compare_ofs_delta_bases(off_t offset1, off_t offset2,
				   enum object_type type1,
				   enum object_type type2)
624 625 626 627
{
	int cmp = type1 - type2;
	if (cmp)
		return cmp;
628 629 630
	return offset1 < offset2 ? -1 :
	       offset1 > offset2 ?  1 :
	       0;
631 632
}

633
static int find_ofs_delta(const off_t offset, enum object_type type)
S
Sergey Vlasov 已提交
634
{
635 636 637
	int first = 0, last = nr_ofs_deltas;

	while (first < last) {
638
		int next = first + (last - first) / 2;
639 640 641 642 643 644 645 646 647 648 649 650 651 652
		struct ofs_delta_entry *delta = &ofs_deltas[next];
		int cmp;

		cmp = compare_ofs_delta_bases(offset, delta->offset,
					      type, objects[delta->obj_no].type);
		if (!cmp)
			return next;
		if (cmp < 0) {
			last = next;
			continue;
		}
		first = next+1;
	}
	return -first-1;
S
Sergey Vlasov 已提交
653 654
}

655 656 657
static void find_ofs_delta_children(off_t offset,
				    int *first_index, int *last_index,
				    enum object_type type)
S
Sergey Vlasov 已提交
658
{
659
	int first = find_ofs_delta(offset, type);
S
Sergey Vlasov 已提交
660
	int last = first;
661
	int end = nr_ofs_deltas - 1;
S
Sergey Vlasov 已提交
662

663 664 665 666 667
	if (first < 0) {
		*first_index = 0;
		*last_index = -1;
		return;
	}
668
	while (first > 0 && ofs_deltas[first - 1].offset == offset)
S
Sergey Vlasov 已提交
669
		--first;
670 671 672 673 674 675
	while (last < end && ofs_deltas[last + 1].offset == offset)
		++last;
	*first_index = first;
	*last_index = last;
}

676 677
static int compare_ref_delta_bases(const struct object_id *oid1,
				   const struct object_id *oid2,
678 679 680 681 682 683
				   enum object_type type1,
				   enum object_type type2)
{
	int cmp = type1 - type2;
	if (cmp)
		return cmp;
684
	return oidcmp(oid1, oid2);
685 686
}

687
static int find_ref_delta(const struct object_id *oid, enum object_type type)
688 689 690 691
{
	int first = 0, last = nr_ref_deltas;

	while (first < last) {
692
		int next = first + (last - first) / 2;
693 694 695
		struct ref_delta_entry *delta = &ref_deltas[next];
		int cmp;

696
		cmp = compare_ref_delta_bases(oid, &delta->oid,
697 698 699 700 701 702 703 704 705 706 707 708
					      type, objects[delta->obj_no].type);
		if (!cmp)
			return next;
		if (cmp < 0) {
			last = next;
			continue;
		}
		first = next+1;
	}
	return -first-1;
}

709
static void find_ref_delta_children(const struct object_id *oid,
710 711 712
				    int *first_index, int *last_index,
				    enum object_type type)
{
713
	int first = find_ref_delta(oid, type);
714 715 716 717 718 719 720 721
	int last = first;
	int end = nr_ref_deltas - 1;

	if (first < 0) {
		*first_index = 0;
		*last_index = -1;
		return;
	}
722
	while (first > 0 && !oidcmp(&ref_deltas[first - 1].oid, oid))
723
		--first;
724
	while (last < end && !oidcmp(&ref_deltas[last + 1].oid, oid))
S
Sergey Vlasov 已提交
725 726 727 728 729
		++last;
	*first_index = first;
	*last_index = last;
}

730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751
struct compare_data {
	struct object_entry *entry;
	struct git_istream *st;
	unsigned char *buf;
	unsigned long buf_size;
};

static int compare_objects(const unsigned char *buf, unsigned long size,
			   void *cb_data)
{
	struct compare_data *data = cb_data;

	if (data->buf_size < size) {
		free(data->buf);
		data->buf = xmalloc(size);
		data->buf_size = size;
	}

	while (size) {
		ssize_t len = read_istream(data->st, data->buf, size);
		if (len == 0)
			die(_("SHA1 COLLISION FOUND WITH %s !"),
752
			    oid_to_hex(&data->entry->idx.oid));
753 754
		if (len < 0)
			die(_("unable to read %s"),
755
			    oid_to_hex(&data->entry->idx.oid));
756 757
		if (memcmp(buf, data->buf, len))
			die(_("SHA1 COLLISION FOUND WITH %s !"),
758
			    oid_to_hex(&data->entry->idx.oid));
759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775
		size -= len;
		buf += len;
	}
	return 0;
}

static int check_collison(struct object_entry *entry)
{
	struct compare_data data;
	enum object_type type;
	unsigned long size;

	if (entry->size <= big_file_threshold || entry->type != OBJ_BLOB)
		return -1;

	memset(&data, 0, sizeof(data));
	data.entry = entry;
776
	data.st = open_istream(&entry->idx.oid, &type, &size, NULL);
777 778 779 780
	if (!data.st)
		return -1;
	if (size != entry->size || type != entry->type)
		die(_("SHA1 COLLISION FOUND WITH %s !"),
781
		    oid_to_hex(&entry->idx.oid));
782 783 784 785 786 787
	unpack_data(entry, compare_objects, &data);
	close_istream(data.st);
	free(data.buf);
	return 0;
}

788 789
static void sha1_object(const void *data, struct object_entry *obj_entry,
			unsigned long size, enum object_type type,
790
			const struct object_id *oid)
S
Sergey Vlasov 已提交
791
{
792
	void *new_data = NULL;
793
	int collision_test_needed = 0;
794 795 796

	assert(data || obj_entry);

797 798
	if (startup_info->have_repository) {
		read_lock();
799 800
		collision_test_needed =
			has_sha1_file_with_flags(oid->hash, OBJECT_INFO_QUICK);
801 802
		read_unlock();
	}
803 804 805 806 807 808 809 810

	if (collision_test_needed && !data) {
		read_lock();
		if (!check_collison(obj_entry))
			collision_test_needed = 0;
		read_unlock();
	}
	if (collision_test_needed) {
811 812 813
		void *has_data;
		enum object_type has_type;
		unsigned long has_size;
814
		read_lock();
815
		has_type = oid_object_info(the_repository, oid, &has_size);
816
		if (has_type < 0)
817
			die(_("cannot read existing object info %s"), oid_to_hex(oid));
818
		if (has_type != type || has_size != size)
819
			die(_("SHA1 COLLISION FOUND WITH %s !"), oid_to_hex(oid));
820
		has_data = read_object_file(oid, &has_type, &has_size);
821
		read_unlock();
822 823
		if (!data)
			data = new_data = get_data_from_pack(obj_entry);
824
		if (!has_data)
825
			die(_("cannot read existing object %s"), oid_to_hex(oid));
826 827
		if (size != has_size || type != has_type ||
		    memcmp(data, has_data, size) != 0)
828
			die(_("SHA1 COLLISION FOUND WITH %s !"), oid_to_hex(oid));
829
		free(has_data);
830
	}
831

832
	if (strict || do_fsck_object) {
833
		read_lock();
834
		if (type == OBJ_BLOB) {
835
			struct blob *blob = lookup_blob(oid);
836 837 838
			if (blob)
				blob->object.flags |= FLAG_CHECKED;
			else
839
				die(_("invalid blob object %s"), oid_to_hex(oid));
840 841 842
			if (do_fsck_object &&
			    fsck_object(&blob->object, (void *)data, size, &fsck_options))
				die(_("fsck error in packed object"));
843 844 845 846 847
		} else {
			struct object *obj;
			int eaten;
			void *buf = (void *) data;

848
			assert(data && "data can only be NULL for large _blobs_");
849

850 851 852 853
			/*
			 * we do not need to free the memory here, as the
			 * buf is deleted by the caller.
			 */
854 855
			obj = parse_object_buffer(oid, type, size, buf,
						  &eaten);
856
			if (!obj)
857
				die(_("invalid %s"), type_name(type));
858
			if (do_fsck_object &&
859
			    fsck_object(obj, buf, size, &fsck_options))
860
				die(_("fsck error in packed object"));
861
			if (strict && fsck_walk(obj, NULL, &fsck_options))
862
				die(_("Not all child objects of %s are reachable"), oid_to_hex(&obj->oid));
863 864 865 866

			if (obj->type == OBJ_TREE) {
				struct tree *item = (struct tree *) obj;
				item->buffer = NULL;
867
				obj->parsed = 0;
868 869 870
			}
			if (obj->type == OBJ_COMMIT) {
				struct commit *commit = (struct commit *) obj;
871
				if (detach_commit_buffer(commit, NULL) != data)
872
					BUG("parse_object_buffer transmogrified our buffer");
873 874 875
			}
			obj->flags |= FLAG_CHECKED;
		}
876
		read_unlock();
877
	}
878 879

	free(new_data);
S
Sergey Vlasov 已提交
880 881
}

882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903
/*
 * This function is part of find_unresolved_deltas(). There are two
 * walkers going in the opposite ways.
 *
 * The first one in find_unresolved_deltas() traverses down from
 * parent node to children, deflating nodes along the way. However,
 * memory for deflated nodes is limited by delta_base_cache_limit, so
 * at some point parent node's deflated content may be freed.
 *
 * The second walker is this function, which goes from current node up
 * to top parent if necessary to deflate the node. In normal
 * situation, its parent node would be already deflated, so it just
 * needs to apply delta.
 *
 * In the worst case scenario, parent node is no longer deflated because
 * we're running out of delta_base_cache_limit; we need to re-deflate
 * parents, possibly up to the top base.
 *
 * All deflated objects here are subject to be freed if we exceed
 * delta_base_cache_limit, just like in find_unresolved_deltas(), we
 * just need to make sure the last node is not freed.
 */
904 905 906 907
static void *get_base_data(struct base_data *c)
{
	if (!c->data) {
		struct object_entry *obj = c->obj;
908 909
		struct base_data **delta = NULL;
		int delta_nr = 0, delta_alloc = 0;
910

911 912 913 914 915 916 917 918
		while (is_delta_type(c->obj->type) && !c->data) {
			ALLOC_GROW(delta, delta_nr + 1, delta_alloc);
			delta[delta_nr++] = c;
			c = c->base;
		}
		if (!delta_nr) {
			c->data = get_data_from_pack(obj);
			c->size = obj->size;
919
			get_thread_data()->base_cache_used += c->size;
920 921 922 923 924 925 926 927
			prune_base_data(c);
		}
		for (; delta_nr > 0; delta_nr--) {
			void *base, *raw;
			c = delta[delta_nr - 1];
			obj = c->obj;
			base = get_base_data(c->base);
			raw = get_data_from_pack(obj);
928 929 930 931 932 933
			c->data = patch_delta(
				base, c->base->size,
				raw, obj->size,
				&c->size);
			free(raw);
			if (!c->data)
934
				bad_object(obj->idx.offset, _("failed to apply delta"));
935
			get_thread_data()->base_cache_used += c->size;
936
			prune_base_data(c);
937
		}
938
		free(delta);
939 940 941 942
	}
	return c->data;
}

943
static void resolve_delta(struct object_entry *delta_obj,
944
			  struct base_data *base, struct base_data *result)
S
Sergey Vlasov 已提交
945
{
N
Nicolas Pitre 已提交
946
	void *base_data, *delta_data;
S
Sergey Vlasov 已提交
947

948
	if (show_stat) {
949 950 951
		int i = delta_obj - objects;
		int j = base->obj - objects;
		obj_stat[i].delta_depth = obj_stat[j].delta_depth + 1;
952
		deepest_delta_lock();
953 954
		if (deepest_delta < obj_stat[i].delta_depth)
			deepest_delta = obj_stat[i].delta_depth;
955
		deepest_delta_unlock();
956
		obj_stat[i].base_object_no = j;
957
	}
958
	delta_data = get_data_from_pack(delta_obj);
N
Nicolas Pitre 已提交
959
	base_data = get_base_data(base);
960
	result->obj = delta_obj;
N
Nicolas Pitre 已提交
961 962
	result->data = patch_delta(base_data, base->size,
				   delta_data, delta_obj->size, &result->size);
S
Sergey Vlasov 已提交
963
	free(delta_data);
964
	if (!result->data)
965
		bad_object(delta_obj->idx.offset, _("failed to apply delta"));
966
	hash_object_file(result->data, result->size,
J
Junio C Hamano 已提交
967
			 type_name(delta_obj->real_type), &delta_obj->idx.oid);
968
	sha1_object(result->data, NULL, result->size, delta_obj->real_type,
969
		    &delta_obj->idx.oid);
970
	counter_lock();
971
	nr_resolved_deltas++;
972
	counter_unlock();
973 974
}

975 976 977 978 979
/*
 * Standard boolean compare-and-swap: atomically check whether "*type" is
 * "want"; if so, swap in "set" and return true. Otherwise, leave it untouched
 * and return false.
 */
980
static int compare_and_swap_type(signed char *type,
981 982 983 984 985 986 987 988 989 990 991 992 993 994
				 enum object_type want,
				 enum object_type set)
{
	enum object_type old;

	type_cas_lock();
	old = *type;
	if (old == want)
		*type = set;
	type_cas_unlock();

	return old == want;
}

995 996
static struct base_data *find_unresolved_deltas_1(struct base_data *base,
						  struct base_data *prev_base)
997
{
998
	if (base->ref_last == -1 && base->ofs_last == -1) {
999
		find_ref_delta_children(&base->obj->idx.oid,
1000 1001
					&base->ref_first, &base->ref_last,
					OBJ_REF_DELTA);
1002

1003 1004 1005
		find_ofs_delta_children(base->obj->idx.offset,
					&base->ofs_first, &base->ofs_last,
					OBJ_OFS_DELTA);
1006

1007 1008 1009 1010
		if (base->ref_last == -1 && base->ofs_last == -1) {
			free(base->data);
			return NULL;
		}
1011

1012 1013
		link_base_data(prev_base, base);
	}
1014

1015
	if (base->ref_first <= base->ref_last) {
1016
		struct object_entry *child = objects + ref_deltas[base->ref_first].obj_no;
1017
		struct base_data *result = alloc_base_data();
1018

1019 1020
		if (!compare_and_swap_type(&child->real_type, OBJ_REF_DELTA,
					   base->obj->real_type))
1021
			BUG("child->real_type != OBJ_REF_DELTA");
1022

1023 1024
		resolve_delta(child, base, result);
		if (base->ref_first == base->ref_last && base->ofs_last == -1)
1025
			free_base_data(base);
1026 1027 1028

		base->ref_first++;
		return result;
1029 1030
	}

1031
	if (base->ofs_first <= base->ofs_last) {
1032
		struct object_entry *child = objects + ofs_deltas[base->ofs_first].obj_no;
1033
		struct base_data *result = alloc_base_data();
1034 1035

		assert(child->real_type == OBJ_OFS_DELTA);
1036
		child->real_type = base->obj->real_type;
1037 1038
		resolve_delta(child, base, result);
		if (base->ofs_first == base->ofs_last)
1039
			free_base_data(base);
1040 1041 1042

		base->ofs_first++;
		return result;
S
Sergey Vlasov 已提交
1043
	}
1044

1045
	unlink_base_data(base);
1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065
	return NULL;
}

static void find_unresolved_deltas(struct base_data *base)
{
	struct base_data *new_base, *prev_base = NULL;
	for (;;) {
		new_base = find_unresolved_deltas_1(base, prev_base);

		if (new_base) {
			prev_base = base;
			base = new_base;
		} else {
			free(base);
			base = prev_base;
			if (!base)
				return;
			prev_base = base->base;
		}
	}
S
Sergey Vlasov 已提交
1066 1067
}

1068
static int compare_ofs_delta_entry(const void *a, const void *b)
S
Sergey Vlasov 已提交
1069
{
1070 1071
	const struct ofs_delta_entry *delta_a = a;
	const struct ofs_delta_entry *delta_b = b;
1072

1073 1074 1075
	return delta_a->offset < delta_b->offset ? -1 :
	       delta_a->offset > delta_b->offset ?  1 :
	       0;
1076 1077 1078
}

static int compare_ref_delta_entry(const void *a, const void *b)
S
Sergey Vlasov 已提交
1079
{
1080 1081
	const struct ref_delta_entry *delta_a = a;
	const struct ref_delta_entry *delta_b = b;
1082

1083
	return oidcmp(&delta_a->oid, &delta_b->oid);
S
Sergey Vlasov 已提交
1084 1085
}

1086 1087 1088 1089 1090 1091 1092 1093
static void resolve_base(struct object_entry *obj)
{
	struct base_data *base_obj = alloc_base_data();
	base_obj->obj = obj;
	base_obj->data = NULL;
	find_unresolved_deltas(base_obj);
}

1094 1095 1096 1097 1098 1099
#ifndef NO_PTHREADS
static void *threaded_second_pass(void *data)
{
	set_thread_data(data);
	for (;;) {
		int i;
1100
		counter_lock();
1101
		display_progress(progress, nr_resolved_deltas);
1102 1103
		counter_unlock();
		work_lock();
1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119
		while (nr_dispatched < nr_objects &&
		       is_delta_type(objects[nr_dispatched].type))
			nr_dispatched++;
		if (nr_dispatched >= nr_objects) {
			work_unlock();
			break;
		}
		i = nr_dispatched++;
		work_unlock();

		resolve_base(&objects[i]);
	}
	return NULL;
}
#endif

1120 1121 1122 1123 1124 1125
/*
 * First pass:
 * - find locations of all objects;
 * - calculate SHA1 of all non-delta objects;
 * - remember base (SHA1 or offset) for all deltas.
 */
1126
static void parse_pack_objects(unsigned char *hash)
S
Sergey Vlasov 已提交
1127
{
1128
	int i, nr_delays = 0;
1129
	struct ofs_delta_entry *ofs_delta = ofs_deltas;
1130
	struct object_id ref_delta_oid;
1131
	struct stat st;
S
Sergey Vlasov 已提交
1132

1133
	if (verbose)
1134
		progress = start_progress(
1135
				from_stdin ? _("Receiving objects") : _("Indexing objects"),
1136
				nr_objects);
S
Sergey Vlasov 已提交
1137 1138
	for (i = 0; i < nr_objects; i++) {
		struct object_entry *obj = &objects[i];
1139
		void *data = unpack_raw_entry(obj, &ofs_delta->offset,
1140 1141
					      &ref_delta_oid,
					      &obj->idx.oid);
S
Sergey Vlasov 已提交
1142
		obj->real_type = obj->type;
1143 1144 1145 1146 1147 1148
		if (obj->type == OBJ_OFS_DELTA) {
			nr_ofs_deltas++;
			ofs_delta->obj_no = i;
			ofs_delta++;
		} else if (obj->type == OBJ_REF_DELTA) {
			ALLOC_GROW(ref_deltas, nr_ref_deltas + 1, ref_deltas_alloc);
1149
			oidcpy(&ref_deltas[nr_ref_deltas].oid, &ref_delta_oid);
1150 1151
			ref_deltas[nr_ref_deltas].obj_no = i;
			nr_ref_deltas++;
1152 1153 1154 1155
		} else if (!data) {
			/* large blobs, check later */
			obj->real_type = OBJ_BAD;
			nr_delays++;
S
Sergey Vlasov 已提交
1156
		} else
1157
			sha1_object(data, NULL, obj->size, obj->type,
1158
				    &obj->idx.oid);
S
Sergey Vlasov 已提交
1159
		free(data);
N
Nicolas Pitre 已提交
1160
		display_progress(progress, i+1);
S
Sergey Vlasov 已提交
1161
	}
G
Geert Bosch 已提交
1162
	objects[i].idx.offset = consumed_bytes;
N
Nicolas Pitre 已提交
1163
	stop_progress(&progress);
1164 1165

	/* Check pack integrity */
1166
	flush();
1167 1168
	the_hash_algo->final_fn(hash, &input_ctx);
	if (hashcmp(fill(the_hash_algo->rawsz), hash))
1169
		die(_("pack is corrupted (SHA1 mismatch)"));
1170
	use(the_hash_algo->rawsz);
1171 1172 1173

	/* If input_fd is a file, we should have reached its end now. */
	if (fstat(input_fd, &st))
1174
		die_errno(_("cannot fstat packfile"));
J
Johannes Schindelin 已提交
1175 1176
	if (S_ISREG(st.st_mode) &&
			lseek(input_fd, 0, SEEK_CUR) - input_len != st.st_size)
1177
		die(_("pack has junk at the end"));
1178 1179 1180 1181 1182 1183

	for (i = 0; i < nr_objects; i++) {
		struct object_entry *obj = &objects[i];
		if (obj->real_type != OBJ_BAD)
			continue;
		obj->real_type = obj->type;
1184
		sha1_object(NULL, obj, obj->size, obj->type,
1185
			    &obj->idx.oid);
1186 1187 1188 1189
		nr_delays--;
	}
	if (nr_delays)
		die(_("confusion beyond insanity in parse_pack_objects()"));
1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202
}

/*
 * Second pass:
 * - for all non-delta objects, look if it is used as a base for
 *   deltas;
 * - if used as a base, uncompress the object and apply all deltas,
 *   recursively checking if the resulting object is used as a base
 *   for some more deltas.
 */
static void resolve_deltas(void)
{
	int i;
S
Sergey Vlasov 已提交
1203

1204
	if (!nr_ofs_deltas && !nr_ref_deltas)
N
Nicolas Pitre 已提交
1205 1206
		return;

1207
	/* Sort deltas by base SHA1/offset for fast searching */
R
René Scharfe 已提交
1208 1209
	QSORT(ofs_deltas, nr_ofs_deltas, compare_ofs_delta_entry);
	QSORT(ref_deltas, nr_ref_deltas, compare_ref_delta_entry);
S
Sergey Vlasov 已提交
1210

1211
	if (verbose || show_resolving_progress)
1212 1213
		progress = start_progress(_("Resolving deltas"),
					  nr_ref_deltas + nr_ofs_deltas);
1214 1215 1216 1217 1218 1219 1220 1221 1222

#ifndef NO_PTHREADS
	nr_dispatched = 0;
	if (nr_threads > 1 || getenv("GIT_FORCE_THREADS")) {
		init_thread();
		for (i = 0; i < nr_threads; i++) {
			int ret = pthread_create(&thread_data[i].thread, NULL,
						 threaded_second_pass, thread_data + i);
			if (ret)
1223 1224
				die(_("unable to create thread: %s"),
				    strerror(ret));
1225 1226 1227 1228 1229 1230 1231 1232
		}
		for (i = 0; i < nr_threads; i++)
			pthread_join(thread_data[i].thread, NULL);
		cleanup_thread();
		return;
	}
#endif

S
Sergey Vlasov 已提交
1233 1234 1235
	for (i = 0; i < nr_objects; i++) {
		struct object_entry *obj = &objects[i];

1236
		if (is_delta_type(obj->type))
S
Sergey Vlasov 已提交
1237
			continue;
1238
		resolve_base(obj);
N
Nicolas Pitre 已提交
1239
		display_progress(progress, nr_resolved_deltas);
S
Sergey Vlasov 已提交
1240
	}
1241 1242
}

1243 1244 1245
/*
 * Third pass:
 * - append objects to convert thin pack to full pack if required
1246
 * - write the final pack hash
1247
 */
1248
static void fix_unresolved_deltas(struct hashfile *f);
1249
static void conclude_pack(int fix_thin_pack, const char *curr_pack, unsigned char *pack_hash)
1250
{
1251
	if (nr_ref_deltas + nr_ofs_deltas == nr_resolved_deltas) {
1252
		stop_progress(&progress);
1253
		/* Flush remaining pack final hash. */
1254 1255 1256 1257 1258
		flush();
		return;
	}

	if (fix_thin_pack) {
1259
		struct hashfile *f;
1260
		unsigned char read_hash[GIT_MAX_RAWSZ], tail_hash[GIT_MAX_RAWSZ];
1261
		struct strbuf msg = STRBUF_INIT;
1262
		int nr_unresolved = nr_ofs_deltas + nr_ref_deltas - nr_resolved_deltas;
1263 1264
		int nr_objects_initial = nr_objects;
		if (nr_unresolved <= 0)
1265
			die(_("confusion beyond insanity"));
1266
		REALLOC_ARRAY(objects, nr_objects + nr_unresolved + 1);
1267 1268
		memset(objects + nr_objects + 1, 0,
		       nr_unresolved * sizeof(*objects));
1269
		f = hashfd(output_fd, curr_pack);
1270
		fix_unresolved_deltas(f);
1271 1272 1273
		strbuf_addf(&msg, Q_("completed with %d local object",
				     "completed with %d local objects",
				     nr_objects - nr_objects_initial),
1274 1275 1276
			    nr_objects - nr_objects_initial);
		stop_progress_msg(&progress, msg.buf);
		strbuf_release(&msg);
1277
		finalize_hashfile(f, tail_hash, 0);
1278 1279
		hashcpy(read_hash, pack_hash);
		fixup_pack_header_footer(output_fd, pack_hash,
1280
					 curr_pack, nr_objects,
1281 1282
					 read_hash, consumed_bytes-the_hash_algo->rawsz);
		if (hashcmp(read_hash, tail_hash) != 0)
1283 1284
			die(_("Unexpected tail checksum for %s "
			      "(disk corruption?)"), curr_pack);
1285
	}
1286
	if (nr_ofs_deltas + nr_ref_deltas != nr_resolved_deltas)
1287 1288
		die(Q_("pack has %d unresolved delta",
		       "pack has %d unresolved deltas",
1289 1290
		       nr_ofs_deltas + nr_ref_deltas - nr_resolved_deltas),
		    nr_ofs_deltas + nr_ref_deltas - nr_resolved_deltas);
1291 1292
}

1293
static int write_compressed(struct hashfile *f, void *in, unsigned int size)
1294
{
1295
	git_zstream stream;
1296 1297
	int status;
	unsigned char outbuf[4096];
1298

1299
	git_deflate_init(&stream, zlib_compression_level);
1300 1301 1302
	stream.next_in = in;
	stream.avail_in = size;

1303 1304 1305
	do {
		stream.next_out = outbuf;
		stream.avail_out = sizeof(outbuf);
1306
		status = git_deflate(&stream, Z_FINISH);
1307
		hashwrite(f, outbuf, sizeof(outbuf) - stream.avail_out);
1308 1309 1310
	} while (status == Z_OK);

	if (status != Z_STREAM_END)
1311
		die(_("unable to deflate appended object (%d)"), status);
1312
	size = stream.total_out;
1313
	git_deflate_end(&stream);
1314 1315 1316
	return size;
}

1317
static struct object_entry *append_obj_to_pack(struct hashfile *f,
1318
			       const unsigned char *sha1, void *buf,
1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332
			       unsigned long size, enum object_type type)
{
	struct object_entry *obj = &objects[nr_objects++];
	unsigned char header[10];
	unsigned long s = size;
	int n = 0;
	unsigned char c = (type << 4) | (s & 15);
	s >>= 4;
	while (s) {
		header[n++] = c | 0x80;
		c = s & 0x7f;
		s >>= 7;
	}
	header[n++] = c;
1333
	crc32_begin(f);
1334
	hashwrite(f, header, n);
1335 1336 1337 1338
	obj[0].size = size;
	obj[0].hdr_size = n;
	obj[0].type = type;
	obj[0].real_type = type;
G
Geert Bosch 已提交
1339
	obj[1].idx.offset = obj[0].idx.offset + n;
1340 1341
	obj[1].idx.offset += write_compressed(f, buf, size);
	obj[0].idx.crc32 = crc32_end(f);
1342
	hashflush(f);
1343
	hashcpy(obj->idx.oid.hash, sha1);
1344
	return obj;
1345 1346 1347 1348
}

static int delta_pos_compare(const void *_a, const void *_b)
{
1349 1350
	struct ref_delta_entry *a = *(struct ref_delta_entry **)_a;
	struct ref_delta_entry *b = *(struct ref_delta_entry **)_b;
1351 1352
	return a->obj_no - b->obj_no;
}
S
Sergey Vlasov 已提交
1353

1354
static void fix_unresolved_deltas(struct hashfile *f)
1355
{
1356
	struct ref_delta_entry **sorted_by_pos;
1357
	int i;
1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368

	/*
	 * Since many unresolved deltas may well be themselves base objects
	 * for more unresolved deltas, we really want to include the
	 * smallest number of base objects that would cover as much delta
	 * as possible by picking the
	 * trunc deltas first, allowing for other deltas to resolve without
	 * additional base objects.  Since most base objects are to be found
	 * before deltas depending on them, a good heuristic is to start
	 * resolving deltas in the same order as their position in the pack.
	 */
J
Jeff King 已提交
1369
	ALLOC_ARRAY(sorted_by_pos, nr_ref_deltas);
1370
	for (i = 0; i < nr_ref_deltas; i++)
1371
		sorted_by_pos[i] = &ref_deltas[i];
R
René Scharfe 已提交
1372
	QSORT(sorted_by_pos, nr_ref_deltas, delta_pos_compare);
1373

1374
	for (i = 0; i < nr_ref_deltas; i++) {
1375
		struct ref_delta_entry *d = sorted_by_pos[i];
1376
		enum object_type type;
1377
		struct base_data *base_obj = alloc_base_data();
1378 1379 1380

		if (objects[d->obj_no].real_type != OBJ_REF_DELTA)
			continue;
1381 1382
		base_obj->data = read_object_file(&d->oid, &type,
						  &base_obj->size);
1383
		if (!base_obj->data)
1384 1385
			continue;

1386
		if (check_object_signature(&d->oid, base_obj->data,
1387
				base_obj->size, type_name(type)))
1388 1389
			die(_("local object %s is corrupt"), oid_to_hex(&d->oid));
		base_obj->obj = append_obj_to_pack(f, d->oid.hash,
1390 1391
					base_obj->data, base_obj->size, type);
		find_unresolved_deltas(base_obj);
N
Nicolas Pitre 已提交
1392
		display_progress(progress, nr_resolved_deltas);
1393 1394 1395 1396
	}
	free(sorted_by_pos);
}

1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410
static const char *derive_filename(const char *pack_name, const char *suffix,
				   struct strbuf *buf)
{
	size_t len;
	if (!strip_suffix(pack_name, ".pack", &len))
		die(_("packfile name '%s' does not end with '.pack'"),
		    pack_name);
	strbuf_add(buf, pack_name, len);
	strbuf_addch(buf, '.');
	strbuf_addstr(buf, suffix);
	return buf->buf;
}

static void write_special_file(const char *suffix, const char *msg,
J
Junio C Hamano 已提交
1411
			       const char *pack_name, const unsigned char *hash,
1412 1413 1414 1415 1416 1417 1418 1419 1420 1421
			       const char **report)
{
	struct strbuf name_buf = STRBUF_INIT;
	const char *filename;
	int fd;
	int msg_len = strlen(msg);

	if (pack_name)
		filename = derive_filename(pack_name, suffix, &name_buf);
	else
J
Junio C Hamano 已提交
1422
		filename = odb_pack_name(&name_buf, hash, suffix);
1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436

	fd = odb_pack_keep(filename);
	if (fd < 0) {
		if (errno != EEXIST)
			die_errno(_("cannot write %s file '%s'"),
				  suffix, filename);
	} else {
		if (msg_len > 0) {
			write_or_die(fd, msg, msg_len);
			write_or_die(fd, "\n", 1);
		}
		if (close(fd) != 0)
			die_errno(_("cannot close written %s file '%s'"),
				  suffix, filename);
1437 1438
		if (report)
			*report = suffix;
1439 1440 1441 1442
	}
	strbuf_release(&name_buf);
}

1443 1444
static void final(const char *final_pack_name, const char *curr_pack_name,
		  const char *final_index_name, const char *curr_index_name,
1445
		  const char *keep_msg, const char *promisor_msg,
1446
		  unsigned char *hash)
1447
{
1448
	const char *report = "pack";
1449 1450
	struct strbuf pack_name = STRBUF_INIT;
	struct strbuf index_name = STRBUF_INIT;
1451 1452 1453 1454 1455
	int err;

	if (!from_stdin) {
		close(input_fd);
	} else {
1456
		fsync_or_die(output_fd, curr_pack_name);
1457 1458
		err = close(output_fd);
		if (err)
1459
			die_errno(_("error while closing pack file"));
1460 1461
	}

1462
	if (keep_msg)
J
Junio C Hamano 已提交
1463
		write_special_file("keep", keep_msg, final_pack_name, hash,
1464
				   &report);
1465 1466
	if (promisor_msg)
		write_special_file("promisor", promisor_msg, final_pack_name,
J
Junio C Hamano 已提交
1467
				   hash, NULL);
1468

1469
	if (final_pack_name != curr_pack_name) {
1470
		if (!final_pack_name)
1471
			final_pack_name = odb_pack_name(&pack_name, hash, "pack");
1472
		if (finalize_object_file(curr_pack_name, final_pack_name))
1473
			die(_("cannot store pack file"));
1474
	} else if (from_stdin)
1475
		chmod(final_pack_name, 0444);
1476 1477

	if (final_index_name != curr_index_name) {
1478
		if (!final_index_name)
1479
			final_index_name = odb_pack_name(&index_name, hash, "idx");
1480
		if (finalize_object_file(curr_index_name, final_index_name))
1481
			die(_("cannot store index file"));
1482 1483
	} else
		chmod(final_index_name, 0444);
1484

1485 1486 1487
	if (do_fsck_object)
		add_packed_git(final_index_name, strlen(final_index_name), 0);

1488
	if (!from_stdin) {
1489
		printf("%s\n", sha1_to_hex(hash));
1490
	} else {
1491 1492
		struct strbuf buf = STRBUF_INIT;

1493
		strbuf_addf(&buf, "%s\t%s\n", report, sha1_to_hex(hash));
1494 1495
		write_or_die(1, buf.buf, buf.len);
		strbuf_release(&buf);
1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508

		/*
		 * Let's just mimic git-unpack-objects here and write
		 * the last part of the input buffer to stdout.
		 */
		while (input_len) {
			err = xwrite(1, input_buffer + input_offset, input_len);
			if (err <= 0)
				break;
			input_len -= err;
			input_offset += err;
		}
	}
1509

1510 1511
	strbuf_release(&index_name);
	strbuf_release(&pack_name);
S
Sergey Vlasov 已提交
1512 1513
}

1514
static int git_index_pack_config(const char *k, const char *v, void *cb)
1515
{
1516 1517
	struct pack_idx_option *opts = cb;

1518
	if (!strcmp(k, "pack.indexversion")) {
1519 1520
		opts->version = git_config_int(k, v);
		if (opts->version > 2)
1521
			die(_("bad pack.indexversion=%"PRIu32), opts->version);
1522 1523
		return 0;
	}
1524 1525 1526
	if (!strcmp(k, "pack.threads")) {
		nr_threads = git_config_int(k, v);
		if (nr_threads < 0)
1527
			die(_("invalid number of threads specified (%d)"),
1528 1529 1530
			    nr_threads);
#ifdef NO_PTHREADS
		if (nr_threads != 1)
1531
			warning(_("no threads support, ignoring %s"), k);
1532 1533 1534 1535
		nr_threads = 1;
#endif
		return 0;
	}
1536
	return git_default_config(k, v, cb);
1537 1538
}

1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551
static int cmp_uint32(const void *a_, const void *b_)
{
	uint32_t a = *((uint32_t *)a_);
	uint32_t b = *((uint32_t *)b_);

	return (a < b) ? -1 : (a != b);
}

static void read_v2_anomalous_offsets(struct packed_git *p,
				      struct pack_idx_option *opts)
{
	const uint32_t *idx1, *idx2;
	uint32_t i;
1552
	const uint32_t hashwords = the_hash_algo->rawsz / sizeof(uint32_t);
1553 1554 1555 1556 1557

	/* The address of the 4-byte offset table */
	idx1 = (((const uint32_t *)p->index_data)
		+ 2 /* 8-byte header */
		+ 256 /* fan out */
1558
		+ hashwords * p->num_objects /* object ID table */
1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569
		+ p->num_objects /* CRC32 table */
		);

	/* The address of the 8-byte offset table */
	idx2 = idx1 + p->num_objects;

	for (i = 0; i < p->num_objects; i++) {
		uint32_t off = ntohl(idx1[i]);
		if (!(off & 0x80000000))
			continue;
		off = off & 0x7fffffff;
1570
		check_pack_index_ptr(p, &idx2[off * 2]);
1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581
		if (idx2[off * 2])
			continue;
		/*
		 * The real offset is ntohl(idx2[off * 2]) in high 4
		 * octets, and ntohl(idx2[off * 2 + 1]) in low 4
		 * octets.  But idx2[off * 2] is Zero!!!
		 */
		ALLOC_GROW(opts->anomaly, opts->anomaly_nr + 1, opts->anomaly_alloc);
		opts->anomaly[opts->anomaly_nr++] = ntohl(idx2[off * 2 + 1]);
	}

R
René Scharfe 已提交
1582
	QSORT(opts->anomaly, opts->anomaly_nr, cmp_uint32);
1583 1584
}

J
Junio C Hamano 已提交
1585 1586 1587 1588 1589
static void read_idx_option(struct pack_idx_option *opts, const char *pack_name)
{
	struct packed_git *p = add_packed_git(pack_name, strlen(pack_name), 1);

	if (!p)
1590
		die(_("Cannot open existing pack file '%s'"), pack_name);
J
Junio C Hamano 已提交
1591
	if (open_pack_index(p))
1592
		die(_("Cannot open existing pack idx file for '%s'"), pack_name);
J
Junio C Hamano 已提交
1593 1594 1595 1596

	/* Read the attributes from the existing idx file */
	opts->version = p->index_version;

1597 1598 1599
	if (opts->version == 2)
		read_v2_anomalous_offsets(p, opts);

J
Junio C Hamano 已提交
1600 1601 1602
	/*
	 * Get rid of the idx file as we do not need it anymore.
	 * NEEDSWORK: extract this bit from free_pack_by_name() in
1603
	 * sha1-file.c, perhaps?  It shouldn't matter very much as we
J
Junio C Hamano 已提交
1604 1605 1606 1607 1608 1609 1610
	 * know we haven't installed this pack (hence we never have
	 * read anything from it).
	 */
	close_pack_index(p);
	free(p);
}

1611 1612
static void show_pack_info(int stat_only)
{
1613
	int i, baseobjects = nr_objects - nr_ref_deltas - nr_ofs_deltas;
1614 1615 1616 1617 1618
	unsigned long *chain_histogram = NULL;

	if (deepest_delta)
		chain_histogram = xcalloc(deepest_delta, sizeof(unsigned long));

1619 1620 1621
	for (i = 0; i < nr_objects; i++) {
		struct object_entry *obj = &objects[i];

1622
		if (is_delta_type(obj->type))
1623
			chain_histogram[obj_stat[i].delta_depth - 1]++;
1624 1625 1626
		if (stat_only)
			continue;
		printf("%s %-6s %lu %lu %"PRIuMAX,
1627
		       oid_to_hex(&obj->idx.oid),
1628
		       type_name(obj->real_type), obj->size,
1629 1630 1631
		       (unsigned long)(obj[1].idx.offset - obj->idx.offset),
		       (uintmax_t)obj->idx.offset);
		if (is_delta_type(obj->type)) {
1632
			struct object_entry *bobj = &objects[obj_stat[i].base_object_no];
1633 1634
			printf(" %u %s", obj_stat[i].delta_depth,
			       oid_to_hex(&bobj->idx.oid));
1635 1636 1637
		}
		putchar('\n');
	}
1638 1639

	if (baseobjects)
1640 1641 1642 1643
		printf_ln(Q_("non delta: %d object",
			     "non delta: %d objects",
			     baseobjects),
			  baseobjects);
1644 1645 1646
	for (i = 0; i < deepest_delta; i++) {
		if (!chain_histogram[i])
			continue;
1647 1648 1649 1650 1651
		printf_ln(Q_("chain length = %d: %lu object",
			     "chain length = %d: %lu objects",
			     chain_histogram[i]),
			  i + 1,
			  chain_histogram[i]);
1652
	}
1653 1654
}

L
Linus Torvalds 已提交
1655
int cmd_index_pack(int argc, const char **argv, const char *prefix)
S
Sergey Vlasov 已提交
1656
{
1657
	int i, fix_thin_pack = 0, verify = 0, stat_only = 0;
1658
	const char *curr_index;
L
Linus Torvalds 已提交
1659
	const char *index_name = NULL, *pack_name = NULL;
1660
	const char *keep_msg = NULL;
1661
	const char *promisor_msg = NULL;
1662
	struct strbuf index_name_buf = STRBUF_INIT;
G
Geert Bosch 已提交
1663
	struct pack_idx_entry **idx_objects;
1664
	struct pack_idx_option opts;
1665
	unsigned char pack_hash[GIT_MAX_RAWSZ];
1666
	unsigned foreign_nr = 1;	/* zero is a "good" value, assume bad */
1667
	int report_end_of_input = 0;
S
Sergey Vlasov 已提交
1668

1669 1670 1671 1672 1673 1674
	/*
	 * index-pack never needs to fetch missing objects, since it only
	 * accesses the repo to do hash collision checks
	 */
	fetch_if_missing = 0;

1675 1676 1677
	if (argc == 2 && !strcmp(argv[1], "-h"))
		usage(index_pack_usage);

1678
	check_replace_refs = 0;
1679
	fsck_options.walk = mark_link;
1680

1681 1682
	reset_pack_idx_option(&opts);
	git_config(git_index_pack_config, &opts);
1683
	if (prefix && chdir(prefix))
1684
		die(_("Cannot come back to cwd"));
1685

S
Sergey Vlasov 已提交
1686
	for (i = 1; i < argc; i++) {
L
Linus Torvalds 已提交
1687
		const char *arg = argv[i];
S
Sergey Vlasov 已提交
1688 1689

		if (*arg == '-') {
1690 1691
			if (!strcmp(arg, "--stdin")) {
				from_stdin = 1;
1692 1693
			} else if (!strcmp(arg, "--fix-thin")) {
				fix_thin_pack = 1;
1694
			} else if (skip_to_optional_arg(arg, "--strict", &arg)) {
1695 1696 1697
				strict = 1;
				do_fsck_object = 1;
				fsck_set_msg_types(&fsck_options, arg);
1698 1699 1700
			} else if (!strcmp(arg, "--check-self-contained-and-connected")) {
				strict = 1;
				check_self_contained_and_connected = 1;
1701 1702
			} else if (!strcmp(arg, "--fsck-objects")) {
				do_fsck_object = 1;
J
Junio C Hamano 已提交
1703 1704
			} else if (!strcmp(arg, "--verify")) {
				verify = 1;
1705 1706
			} else if (!strcmp(arg, "--verify-stat")) {
				verify = 1;
1707
				show_stat = 1;
1708 1709
			} else if (!strcmp(arg, "--verify-stat-only")) {
				verify = 1;
1710
				show_stat = 1;
1711
				stat_only = 1;
1712 1713
			} else if (skip_to_optional_arg(arg, "--keep", &keep_msg)) {
				; /* nothing to do */
1714 1715
			} else if (skip_to_optional_arg(arg, "--promisor", &promisor_msg)) {
				; /* already parsed */
1716
			} else if (starts_with(arg, "--threads=")) {
1717 1718 1719 1720 1721 1722
				char *end;
				nr_threads = strtoul(arg+10, &end, 0);
				if (!arg[10] || *end || nr_threads < 0)
					usage(index_pack_usage);
#ifdef NO_PTHREADS
				if (nr_threads != 1)
1723 1724
					warning(_("no threads support, "
						  "ignoring %s"), arg);
1725 1726
				nr_threads = 1;
#endif
1727
			} else if (starts_with(arg, "--pack_header=")) {
1728 1729 1730 1731 1732 1733 1734
				struct pack_header *hdr;
				char *c;

				hdr = (struct pack_header *)input_buffer;
				hdr->hdr_signature = htonl(PACK_SIGNATURE);
				hdr->hdr_version = htonl(strtoul(arg + 14, &c, 10));
				if (*c != ',')
1735
					die(_("bad %s"), arg);
1736 1737
				hdr->hdr_entries = htonl(strtoul(c + 1, &c, 10));
				if (*c)
1738
					die(_("bad %s"), arg);
1739
				input_len = sizeof(*hdr);
N
Nicolas Pitre 已提交
1740 1741
			} else if (!strcmp(arg, "-v")) {
				verbose = 1;
1742 1743
			} else if (!strcmp(arg, "--show-resolving-progress")) {
				show_resolving_progress = 1;
1744 1745
			} else if (!strcmp(arg, "--report-end-of-input")) {
				report_end_of_input = 1;
1746
			} else if (!strcmp(arg, "-o")) {
S
Sergey Vlasov 已提交
1747 1748 1749
				if (index_name || (i+1) >= argc)
					usage(index_pack_usage);
				index_name = argv[++i];
1750
			} else if (starts_with(arg, "--index-version=")) {
1751
				char *c;
1752 1753
				opts.version = strtoul(arg + 16, &c, 10);
				if (opts.version > 2)
1754
					die(_("bad %s"), arg);
1755
				if (*c == ',')
1756 1757
					opts.off32_limit = strtoul(c+1, &c, 0);
				if (*c || opts.off32_limit & 0x80000000)
1758
					die(_("bad %s"), arg);
1759 1760
			} else if (skip_prefix(arg, "--max-input-size=", &arg)) {
				max_input_size = strtoumax(arg, NULL, 10);
S
Sergey Vlasov 已提交
1761 1762 1763 1764 1765 1766 1767 1768 1769 1770
			} else
				usage(index_pack_usage);
			continue;
		}

		if (pack_name)
			usage(index_pack_usage);
		pack_name = arg;
	}

1771
	if (!pack_name && !from_stdin)
S
Sergey Vlasov 已提交
1772
		usage(index_pack_usage);
1773
	if (fix_thin_pack && !from_stdin)
1774
		die(_("--fix-thin cannot be used without --stdin"));
1775 1776
	if (from_stdin && !startup_info->have_repository)
		die(_("--stdin requires a git repository"));
1777
	if (!index_name && pack_name)
1778
		index_name = derive_filename(pack_name, "idx", &index_name_buf);
1779

J
Junio C Hamano 已提交
1780 1781
	if (verify) {
		if (!index_name)
1782
			die(_("--verify with no packfile name given"));
J
Junio C Hamano 已提交
1783
		read_idx_option(&opts, index_name);
1784
		opts.flags |= WRITE_IDX_VERIFY | WRITE_IDX_STRICT;
J
Junio C Hamano 已提交
1785
	}
1786 1787
	if (strict)
		opts.flags |= WRITE_IDX_STRICT;
S
Sergey Vlasov 已提交
1788

1789 1790 1791 1792 1793 1794 1795 1796 1797
#ifndef NO_PTHREADS
	if (!nr_threads) {
		nr_threads = online_cpus();
		/* An experiment showed that more threads does not mean faster */
		if (nr_threads > 3)
			nr_threads = 3;
	}
#endif

1798
	curr_pack = open_pack_file(pack_name);
S
Sergey Vlasov 已提交
1799
	parse_pack_header();
1800
	objects = xcalloc(st_add(nr_objects, 1), sizeof(struct object_entry));
1801
	if (show_stat)
1802
		obj_stat = xcalloc(st_add(nr_objects, 1), sizeof(struct object_stat));
1803
	ofs_deltas = xcalloc(nr_objects, sizeof(struct ofs_delta_entry));
1804
	parse_pack_objects(pack_hash);
1805 1806
	if (report_end_of_input)
		write_in_full(2, "\0", 1);
1807
	resolve_deltas();
1808
	conclude_pack(fix_thin_pack, curr_pack, pack_hash);
1809 1810
	free(ofs_deltas);
	free(ref_deltas);
1811
	if (strict)
1812
		foreign_nr = check_objects();
G
Geert Bosch 已提交
1813

1814
	if (show_stat)
1815 1816
		show_pack_info(stat_only);

J
Jeff King 已提交
1817
	ALLOC_ARRAY(idx_objects, nr_objects);
G
Geert Bosch 已提交
1818 1819
	for (i = 0; i < nr_objects; i++)
		idx_objects[i] = &objects[i].idx;
1820
	curr_index = write_idx_file(index_name, idx_objects, nr_objects, &opts, pack_hash);
G
Geert Bosch 已提交
1821 1822
	free(idx_objects);

J
Junio C Hamano 已提交
1823 1824 1825
	if (!verify)
		final(pack_name, curr_pack,
		      index_name, curr_index,
1826
		      keep_msg, promisor_msg,
1827
		      pack_hash);
J
Junio C Hamano 已提交
1828 1829
	else
		close(input_fd);
1830 1831 1832 1833

	if (do_fsck_object && fsck_finish(&fsck_options))
		die(_("fsck error in pack objects"));

S
Sergey Vlasov 已提交
1834
	free(objects);
1835
	strbuf_release(&index_name_buf);
N
Nicolas Pitre 已提交
1836
	if (pack_name == NULL)
L
Linus Torvalds 已提交
1837
		free((void *) curr_pack);
N
Nicolas Pitre 已提交
1838
	if (index_name == NULL)
L
Linus Torvalds 已提交
1839
		free((void *) curr_index);
S
Sergey Vlasov 已提交
1840

1841 1842 1843 1844 1845 1846
	/*
	 * Let the caller know this pack is not self contained
	 */
	if (check_self_contained_and_connected && foreign_nr)
		return 1;

S
Sergey Vlasov 已提交
1847 1848
	return 0;
}