fetch-pack.c 10.1 KB
Newer Older
1
#include "cache.h"
2
#include "refs.h"
3
#include "pkt-line.h"
4 5 6
#include "commit.h"
#include "tag.h"
#include <time.h>
7
#include <sys/wait.h>
8

9
static int quiet;
10 11 12
static int verbose;
static const char fetch_pack_usage[] =
"git-fetch-pack [-q] [-v] [--exec=upload-pack] [host:]directory <refs>...";
13 14
static const char *exec = "git-upload-pack";

15
#define COMPLETE	(1U << 0)
16 17 18 19 20 21
#define COMMON		(1U << 1)
#define COMMON_REF	(1U << 2)
#define SEEN		(1U << 3)
#define POPPED		(1U << 4)

static struct commit_list *rev_list = NULL;
22
static int non_common_revs = 0, multi_ack = 0;
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

static void rev_list_push(struct commit *commit, int mark)
{
	if (!(commit->object.flags & mark)) {
		commit->object.flags |= mark;

		if (!(commit->object.parsed))
			parse_commit(commit);

		insert_by_date(commit, &rev_list);

		if (!(commit->object.flags & COMMON))
			non_common_revs++;
	}
}

static int rev_list_insert_ref(const char *path, const unsigned char *sha1)
{
41
	struct object *o = deref_tag(parse_object(sha1), path, 0);
42

43
	if (o && o->type == commit_type)
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 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
		rev_list_push((struct commit *)o, SEEN);

	return 0;
}

/*
   This function marks a rev and its ancestors as common.
   In some cases, it is desirable to mark only the ancestors (for example
   when only the server does not yet know that they are common).
*/

static void mark_common(struct commit *commit,
		int ancestors_only, int dont_parse)
{
	if (commit != NULL && !(commit->object.flags & COMMON)) {
		struct object *o = (struct object *)commit;

		if (!ancestors_only)
			o->flags |= COMMON;

		if (!(o->flags & SEEN))
			rev_list_push(commit, SEEN);
		else {
			struct commit_list *parents;

			if (!ancestors_only && !(o->flags & POPPED))
				non_common_revs--;
			if (!o->parsed && !dont_parse)
				parse_commit(commit);

			for (parents = commit->parents;
					parents;
					parents = parents->next)
				mark_common(parents->item, 0, dont_parse);
		}
	}
}

/*
  Get the next rev to send, ignoring the common.
*/

static const unsigned char* get_rev()
{
	struct commit *commit = NULL;

	while (commit == NULL) {
		unsigned int mark;
		struct commit_list* parents;

		if (rev_list == NULL || non_common_revs == 0)
			return NULL;

		commit = rev_list->item;
		if (!(commit->object.parsed))
			parse_commit(commit);
		commit->object.flags |= POPPED;
		if (!(commit->object.flags & COMMON))
			non_common_revs--;
	
		parents = commit->parents;

		if (commit->object.flags & COMMON) {
			/* do not send "have", and ignore ancestors */
			commit = NULL;
			mark = COMMON | SEEN;
		} else if (commit->object.flags & COMMON_REF)
			/* send "have", and ignore ancestors */
			mark = COMMON | SEEN;
		else
			/* send "have", also for its ancestors */
			mark = SEEN;

		while (parents) {
			if (!(parents->item->object.flags & SEEN))
				rev_list_push(parents->item, mark);
			if (mark & COMMON)
				mark_common(parents->item, 1, 0);
			parents = parents->next;
		}

		rev_list = rev_list->next;
	}

	return commit->object.sha1;
}
130

131 132
static int find_common(int fd[2], unsigned char *result_sha1,
		       struct ref *refs)
133
{
134
	int fetching;
135 136 137 138
	int count = 0, flushes = 0, retval;
	const unsigned char *sha1;

	for_each_ref(rev_list_insert_ref);
139

140 141
	fetching = 0;
	for ( ; refs ; refs = refs->next) {
142
		unsigned char *remote = refs->old_sha1;
143
		struct object *o;
144

145
		/*
146 147 148 149
		 * If that object is complete (i.e. it is an ancestor of a
		 * local ref), we tell them we have it but do not have to
		 * tell them about its ancestors, which they already know
		 * about.
150 151 152 153
		 *
		 * We use lookup_object here because we are only
		 * interested in the case we *know* the object is
		 * reachable and we have already scanned it.
154
		 */
155
		if (((o = lookup_object(remote)) != NULL) &&
156
				(o->flags & COMPLETE)) {
157
			continue;
158
		}
159

160 161
		packet_write(fd[1], "want %s%s\n", sha1_to_hex(remote),
			multi_ack ? " multi_ack" : "");
162
		fetching++;
163
	}
164
	packet_flush(fd[1]);
165 166
	if (!fetching)
		return 1;
167

168
	flushes = 0;
169
	retval = -1;
170
	while ((sha1 = get_rev())) {
171
		packet_write(fd[1], "have %s\n", sha1_to_hex(sha1));
172 173
		if (verbose)
			fprintf(stderr, "have %s\n", sha1_to_hex(sha1));
174
		if (!(31 & ++count)) {
175 176
			int ack;

177 178 179 180 181 182 183 184 185
			packet_flush(fd[1]);
			flushes++;

			/*
			 * We keep one window "ahead" of the other side, and
			 * will wait for an ACK only on the next one
			 */
			if (count == 32)
				continue;
186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203

			do {
				ack = get_ack(fd[0], result_sha1);
				if (verbose && ack)
					fprintf(stderr, "got ack %d %s\n", ack,
							sha1_to_hex(result_sha1));
				if (ack == 1) {
					flushes = 0;
					multi_ack = 0;
					retval = 0;
					goto done;
				} else if (ack == 2) {
					struct commit *commit =
						lookup_commit(result_sha1);
					mark_common(commit, 0, 1);
					retval = 0;
				}
			} while (ack);
204 205 206
			flushes--;
		}
	}
207
done:
208
	packet_write(fd[1], "done\n");
209 210
	if (verbose)
		fprintf(stderr, "done\n");
211 212
	if (retval != 0) {
		multi_ack = 0;
213
		flushes++;
214 215 216 217
	}
	while (flushes || multi_ack) {
		int ack = get_ack(fd[0], result_sha1);
		if (ack) {
218
			if (verbose)
219 220 221 222 223 224
				fprintf(stderr, "got ack (%d) %s\n", ack,
					sha1_to_hex(result_sha1));
			if (ack == 1)
				return 0;
			multi_ack = 1;
			continue;
225
		}
226
		flushes--;
227
	}
228
	return retval;
229 230
}

231 232 233 234 235 236 237
static struct commit_list *complete = NULL;

static int mark_complete(const char *path, const unsigned char *sha1)
{
	struct object *o = parse_object(sha1);

	while (o && o->type == tag_type) {
238 239 240
		struct tag *t = (struct tag *) o;
		if (!t->tagged)
			break; /* broken repository */
241
		o->flags |= COMPLETE;
242
		o = parse_object(t->tagged->sha1);
243
	}
244
	if (o && o->type == commit_type) {
245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261
		struct commit *commit = (struct commit *)o;
		commit->object.flags |= COMPLETE;
		insert_by_date(commit, &complete);
	}
	return 0;
}

static void mark_recent_complete_commits(unsigned long cutoff)
{
	while (complete && cutoff <= complete->item->date) {
		if (verbose)
			fprintf(stderr, "Marking %s as complete\n",
				sha1_to_hex(complete->item->object.sha1));
		pop_most_recent_commit(&complete, COMPLETE);
	}
}

262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
static void filter_refs(struct ref **refs, int nr_match, char **match)
{
	struct ref *prev, *current, *next;

	if (!nr_match)
		return;

	for (prev = NULL, current = *refs; current; current = next) {
		next = current->next;
		if ((!memcmp(current->name, "refs/", 5) &&
					check_ref_format(current->name + 5)) ||
				!path_match(current->name, nr_match, match)) {
			if (prev == NULL)
				*refs = next;
			else
				prev->next = next;
			free(current);
		} else
			prev = current;
	}
}

static int everything_local(struct ref **refs, int nr_match, char **match)
285
{
286
	struct ref *ref;
287
	int retval;
288 289 290 291 292
	unsigned long cutoff = 0;

	track_object_refs = 0;
	save_commit_buffer = 0;

293
	for (ref = *refs; ref; ref = ref->next) {
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313
		struct object *o;

		o = parse_object(ref->old_sha1);
		if (!o)
			continue;

		/* We already have it -- which may mean that we were
		 * in sync with the other side at some time after
		 * that (it is OK if we guess wrong here).
		 */
		if (o->type == commit_type) {
			struct commit *commit = (struct commit *)o;
			if (!cutoff || cutoff < commit->date)
				cutoff = commit->date;
		}
	}

	for_each_ref(mark_complete);
	if (cutoff)
		mark_recent_complete_commits(cutoff);
314

315 316 317 318 319
	/*
	 * Mark all complete remote refs as common refs.
	 * Don't mark them common yet; the server has to be told so first.
	 */
	for (ref = *refs; ref; ref = ref->next) {
320 321
		struct object *o = deref_tag(lookup_object(ref->old_sha1),
					     NULL, 0);
322 323 324 325 326 327 328 329 330 331 332 333 334 335 336

		if (!o || o->type != commit_type || !(o->flags & COMPLETE))
			continue;

		if (!(o->flags & SEEN)) {
			rev_list_push((struct commit *)o, COMMON_REF | SEEN);

			mark_common((struct commit *)o, 1, 1);
		}
	}

	filter_refs(refs, nr_match, match);

	for (retval = 1, ref = *refs; ref ; ref = ref->next) {
		const unsigned char *remote = ref->old_sha1;
337
		unsigned char local[20];
338
		struct object *o;
339

340
		o = lookup_object(remote);
341
		if (!o || !(o->flags & COMPLETE)) {
342 343 344 345 346
			retval = 0;
			if (!verbose)
				continue;
			fprintf(stderr,
				"want %s (%s)\n", sha1_to_hex(remote),
347
				ref->name);
348 349 350
			continue;
		}

351
		memcpy(ref->new_sha1, local, 20);
352 353 354 355
		if (!verbose)
			continue;
		fprintf(stderr,
			"already have %s (%s)\n", sha1_to_hex(remote),
356
			ref->name);
357 358 359 360
	}
	return retval;
}

361 362
static int fetch_pack(int fd[2], int nr_match, char **match)
{
363 364 365
	struct ref *ref;
	unsigned char sha1[20];
	int status;
366
	pid_t pid;
367

368
	get_remote_heads(fd[0], &ref, 0, NULL, 0);
369 370 371 372 373
	if (server_supports("multi_ack")) {
		if (verbose)
			fprintf(stderr, "Server supports multi_ack\n");
		multi_ack = 1;
	}
374 375 376 377
	if (!ref) {
		packet_flush(fd[1]);
		die("no matching remote head");
	}
378
	if (everything_local(&ref, nr_match, match)) {
379 380 381
		packet_flush(fd[1]);
		goto all_done;
	}
382 383
	if (find_common(fd, sha1, ref) < 0)
		fprintf(stderr, "warning: no common commits\n");
384 385 386 387 388 389
	pid = fork();
	if (pid < 0)
		die("git-fetch-pack: unable to fork off git-unpack-objects");
	if (!pid) {
		dup2(fd[0], 0);
		close(fd[0]);
390
		close(fd[1]);
391 392
		execlp("git-unpack-objects", "git-unpack-objects",
		       quiet ? "-q" : NULL, NULL);
393 394
		die("git-unpack-objects exec failed");
	}
395
	close(fd[0]);
396 397 398 399 400 401 402 403 404
	close(fd[1]);
	while (waitpid(pid, &status, 0) < 0) {
		if (errno != EINTR)
			die("waiting for git-unpack-objects: %s", strerror(errno));
	}
	if (WIFEXITED(status)) {
		int code = WEXITSTATUS(status);
		if (code)
			die("git-unpack-objects died with error code %d", code);
405
all_done:
406 407 408 409 410
		while (ref) {
			printf("%s %s\n",
			       sha1_to_hex(ref->old_sha1), ref->name);
			ref = ref->next;
		}
411 412 413 414 415 416 417
		return 0;
	}
	if (WIFSIGNALED(status)) {
		int sig = WTERMSIG(status);
		die("git-unpack-objects died of signal %d", sig);
	}
	die("Sherlock Holmes! git-unpack-objects died of unnatural causes %d!", status);
418 419 420 421 422 423 424 425 426 427 428 429 430 431 432
}

int main(int argc, char **argv)
{
	int i, ret, nr_heads;
	char *dest = NULL, **heads;
	int fd[2];
	pid_t pid;

	nr_heads = 0;
	heads = NULL;
	for (i = 1; i < argc; i++) {
		char *arg = argv[i];

		if (*arg == '-') {
433 434 435 436
			if (!strncmp("--exec=", arg, 7)) {
				exec = arg + 7;
				continue;
			}
437 438 439 440 441 442 443 444
			if (!strcmp("-q", arg)) {
				quiet = 1;
				continue;
			}
			if (!strcmp("-v", arg)) {
				verbose = 1;
				continue;
			}
445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
			usage(fetch_pack_usage);
		}
		dest = arg;
		heads = argv + i + 1;
		nr_heads = argc - i - 1;
		break;
	}
	if (!dest)
		usage(fetch_pack_usage);
	pid = git_connect(fd, dest, exec);
	if (pid < 0)
		return 1;
	ret = fetch_pack(fd, nr_heads, heads);
	close(fd[0]);
	close(fd[1]);
	finish_connect(pid);
	return ret;
}