10 static const char fetch_pack_usage[] =
11 "git-fetch-pack [-q] [-v] [-k] [--exec=upload-pack] [host:]directory <refs>...";
12 static const char *exec = "git-upload-pack";
14 #define COMPLETE (1U << 0)
15 #define COMMON (1U << 1)
16 #define COMMON_REF (1U << 2)
17 #define SEEN (1U << 3)
18 #define POPPED (1U << 4)
20 static struct commit_list *rev_list = NULL;
21 static int non_common_revs = 0, multi_ack = 0;
23 static void rev_list_push(struct commit *commit, int mark)
25 if (!(commit->object.flags & mark)) {
26 commit->object.flags |= mark;
28 if (!(commit->object.parsed))
31 insert_by_date(commit, &rev_list);
33 if (!(commit->object.flags & COMMON))
38 static int rev_list_insert_ref(const char *path, const unsigned char *sha1)
40 struct object *o = deref_tag(parse_object(sha1), path, 0);
42 if (o && o->type == commit_type)
43 rev_list_push((struct commit *)o, SEEN);
49 This function marks a rev and its ancestors as common.
50 In some cases, it is desirable to mark only the ancestors (for example
51 when only the server does not yet know that they are common).
54 static void mark_common(struct commit *commit,
55 int ancestors_only, int dont_parse)
57 if (commit != NULL && !(commit->object.flags & COMMON)) {
58 struct object *o = (struct object *)commit;
63 if (!(o->flags & SEEN))
64 rev_list_push(commit, SEEN);
66 struct commit_list *parents;
68 if (!ancestors_only && !(o->flags & POPPED))
70 if (!o->parsed && !dont_parse)
73 for (parents = commit->parents;
75 parents = parents->next)
76 mark_common(parents->item, 0, dont_parse);
82 Get the next rev to send, ignoring the common.
85 static const unsigned char* get_rev()
87 struct commit *commit = NULL;
89 while (commit == NULL) {
91 struct commit_list* parents;
93 if (rev_list == NULL || non_common_revs == 0)
96 commit = rev_list->item;
97 if (!(commit->object.parsed))
99 commit->object.flags |= POPPED;
100 if (!(commit->object.flags & COMMON))
103 parents = commit->parents;
105 if (commit->object.flags & COMMON) {
106 /* do not send "have", and ignore ancestors */
108 mark = COMMON | SEEN;
109 } else if (commit->object.flags & COMMON_REF)
110 /* send "have", and ignore ancestors */
111 mark = COMMON | SEEN;
113 /* send "have", also for its ancestors */
117 if (!(parents->item->object.flags & SEEN))
118 rev_list_push(parents->item, mark);
120 mark_common(parents->item, 1, 0);
121 parents = parents->next;
124 rev_list = rev_list->next;
127 return commit->object.sha1;
130 static int find_common(int fd[2], unsigned char *result_sha1,
134 int count = 0, flushes = 0, retval;
135 const unsigned char *sha1;
137 for_each_ref(rev_list_insert_ref);
140 for ( ; refs ; refs = refs->next) {
141 unsigned char *remote = refs->old_sha1;
145 * If that object is complete (i.e. it is an ancestor of a
146 * local ref), we tell them we have it but do not have to
147 * tell them about its ancestors, which they already know
150 * We use lookup_object here because we are only
151 * interested in the case we *know* the object is
152 * reachable and we have already scanned it.
154 if (((o = lookup_object(remote)) != NULL) &&
155 (o->flags & COMPLETE)) {
159 packet_write(fd[1], "want %s%s\n", sha1_to_hex(remote),
160 multi_ack ? " multi_ack" : "");
169 while ((sha1 = get_rev())) {
170 packet_write(fd[1], "have %s\n", sha1_to_hex(sha1));
172 fprintf(stderr, "have %s\n", sha1_to_hex(sha1));
173 if (!(31 & ++count)) {
180 * We keep one window "ahead" of the other side, and
181 * will wait for an ACK only on the next one
187 ack = get_ack(fd[0], result_sha1);
189 fprintf(stderr, "got ack %d %s\n", ack,
190 sha1_to_hex(result_sha1));
196 } else if (ack == 2) {
197 struct commit *commit =
198 lookup_commit(result_sha1);
199 mark_common(commit, 0, 1);
207 packet_write(fd[1], "done\n");
209 fprintf(stderr, "done\n");
214 while (flushes || multi_ack) {
215 int ack = get_ack(fd[0], result_sha1);
218 fprintf(stderr, "got ack (%d) %s\n", ack,
219 sha1_to_hex(result_sha1));
230 static struct commit_list *complete = NULL;
232 static int mark_complete(const char *path, const unsigned char *sha1)
234 struct object *o = parse_object(sha1);
236 while (o && o->type == tag_type) {
237 struct tag *t = (struct tag *) o;
239 break; /* broken repository */
240 o->flags |= COMPLETE;
241 o = parse_object(t->tagged->sha1);
243 if (o && o->type == commit_type) {
244 struct commit *commit = (struct commit *)o;
245 commit->object.flags |= COMPLETE;
246 insert_by_date(commit, &complete);
251 static void mark_recent_complete_commits(unsigned long cutoff)
253 while (complete && cutoff <= complete->item->date) {
255 fprintf(stderr, "Marking %s as complete\n",
256 sha1_to_hex(complete->item->object.sha1));
257 pop_most_recent_commit(&complete, COMPLETE);
261 static void filter_refs(struct ref **refs, int nr_match, char **match)
263 struct ref *prev, *current, *next;
268 for (prev = NULL, current = *refs; current; current = next) {
269 next = current->next;
270 if ((!memcmp(current->name, "refs/", 5) &&
271 check_ref_format(current->name + 5)) ||
272 !path_match(current->name, nr_match, match)) {
283 static int everything_local(struct ref **refs, int nr_match, char **match)
287 unsigned long cutoff = 0;
289 track_object_refs = 0;
290 save_commit_buffer = 0;
292 for (ref = *refs; ref; ref = ref->next) {
295 o = parse_object(ref->old_sha1);
299 /* We already have it -- which may mean that we were
300 * in sync with the other side at some time after
301 * that (it is OK if we guess wrong here).
303 if (o->type == commit_type) {
304 struct commit *commit = (struct commit *)o;
305 if (!cutoff || cutoff < commit->date)
306 cutoff = commit->date;
310 for_each_ref(mark_complete);
312 mark_recent_complete_commits(cutoff);
315 * Mark all complete remote refs as common refs.
316 * Don't mark them common yet; the server has to be told so first.
318 for (ref = *refs; ref; ref = ref->next) {
319 struct object *o = deref_tag(lookup_object(ref->old_sha1),
322 if (!o || o->type != commit_type || !(o->flags & COMPLETE))
325 if (!(o->flags & SEEN)) {
326 rev_list_push((struct commit *)o, COMMON_REF | SEEN);
328 mark_common((struct commit *)o, 1, 1);
332 filter_refs(refs, nr_match, match);
334 for (retval = 1, ref = *refs; ref ; ref = ref->next) {
335 const unsigned char *remote = ref->old_sha1;
336 unsigned char local[20];
339 o = lookup_object(remote);
340 if (!o || !(o->flags & COMPLETE)) {
345 "want %s (%s)\n", sha1_to_hex(remote),
350 memcpy(ref->new_sha1, local, 20);
354 "already have %s (%s)\n", sha1_to_hex(remote),
360 static int fetch_pack(int fd[2], int nr_match, char **match)
363 unsigned char sha1[20];
366 get_remote_heads(fd[0], &ref, 0, NULL, 0);
367 if (server_supports("multi_ack")) {
369 fprintf(stderr, "Server supports multi_ack\n");
374 die("no matching remote head");
376 if (everything_local(&ref, nr_match, match)) {
380 if (find_common(fd, sha1, ref) < 0)
381 fprintf(stderr, "warning: no common commits\n");
384 status = receive_keep_pack(fd, "git-fetch-pack");
386 status = receive_unpack_pack(fd, "git-fetch-pack", quiet);
389 die("git-fetch-pack: fetch failed.");
394 sha1_to_hex(ref->old_sha1), ref->name);
400 int main(int argc, char **argv)
402 int i, ret, nr_heads;
403 char *dest = NULL, **heads;
407 setup_git_directory();
411 for (i = 1; i < argc; i++) {
415 if (!strncmp("--exec=", arg, 7)) {
419 if (!strcmp("-q", arg)) {
423 if (!strcmp("-k", arg)) {
427 if (!strcmp("-v", arg)) {
431 usage(fetch_pack_usage);
434 heads = argv + i + 1;
435 nr_heads = argc - i - 1;
439 usage(fetch_pack_usage);
440 pid = git_connect(fd, dest, exec);
443 ret = fetch_pack(fd, nr_heads, heads);
448 if (!ret && nr_heads) {
449 /* If the heads to pull were given, we should have
450 * consumed all of them by matching the remote.
451 * Otherwise, 'git-fetch remote no-such-ref' would
452 * silently succeed without issuing an error.
454 for (i = 0; i < nr_heads; i++)
455 if (heads[i] && heads[i][0]) {
456 error("no such remote ref %s", heads[i]);