10 static const char fetch_pack_usage[] =
11 "git-fetch-pack [-q] [-v] [-k] [--thin] [--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, use_thin_pack = 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(void)
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%s\n", sha1_to_hex(remote),
160 (multi_ack ? " multi_ack" : ""),
161 (use_thin_pack ? " thin-pack" : ""));
170 while ((sha1 = get_rev())) {
171 packet_write(fd[1], "have %s\n", sha1_to_hex(sha1));
173 fprintf(stderr, "have %s\n", sha1_to_hex(sha1));
174 if (!(31 & ++count)) {
181 * We keep one window "ahead" of the other side, and
182 * will wait for an ACK only on the next one
188 ack = get_ack(fd[0], result_sha1);
190 fprintf(stderr, "got ack %d %s\n", ack,
191 sha1_to_hex(result_sha1));
197 } else if (ack == 2) {
198 struct commit *commit =
199 lookup_commit(result_sha1);
200 mark_common(commit, 0, 1);
208 packet_write(fd[1], "done\n");
210 fprintf(stderr, "done\n");
215 while (flushes || multi_ack) {
216 int ack = get_ack(fd[0], result_sha1);
219 fprintf(stderr, "got ack (%d) %s\n", ack,
220 sha1_to_hex(result_sha1));
231 static struct commit_list *complete = NULL;
233 static int mark_complete(const char *path, const unsigned char *sha1)
235 struct object *o = parse_object(sha1);
237 while (o && o->type == tag_type) {
238 struct tag *t = (struct tag *) o;
240 break; /* broken repository */
241 o->flags |= COMPLETE;
242 o = parse_object(t->tagged->sha1);
244 if (o && o->type == commit_type) {
245 struct commit *commit = (struct commit *)o;
246 commit->object.flags |= COMPLETE;
247 insert_by_date(commit, &complete);
252 static void mark_recent_complete_commits(unsigned long cutoff)
254 while (complete && cutoff <= complete->item->date) {
256 fprintf(stderr, "Marking %s as complete\n",
257 sha1_to_hex(complete->item->object.sha1));
258 pop_most_recent_commit(&complete, COMPLETE);
262 static void filter_refs(struct ref **refs, int nr_match, char **match)
264 struct ref *prev, *current, *next;
266 for (prev = NULL, current = *refs; current; current = next) {
267 next = current->next;
268 if ((!memcmp(current->name, "refs/", 5) &&
269 check_ref_format(current->name + 5)) ||
270 !path_match(current->name, nr_match, match)) {
281 static int everything_local(struct ref **refs, int nr_match, char **match)
285 unsigned long cutoff = 0;
287 track_object_refs = 0;
288 save_commit_buffer = 0;
290 for (ref = *refs; ref; ref = ref->next) {
293 o = parse_object(ref->old_sha1);
297 /* We already have it -- which may mean that we were
298 * in sync with the other side at some time after
299 * that (it is OK if we guess wrong here).
301 if (o->type == commit_type) {
302 struct commit *commit = (struct commit *)o;
303 if (!cutoff || cutoff < commit->date)
304 cutoff = commit->date;
308 for_each_ref(mark_complete);
310 mark_recent_complete_commits(cutoff);
313 * Mark all complete remote refs as common refs.
314 * Don't mark them common yet; the server has to be told so first.
316 for (ref = *refs; ref; ref = ref->next) {
317 struct object *o = deref_tag(lookup_object(ref->old_sha1),
320 if (!o || o->type != commit_type || !(o->flags & COMPLETE))
323 if (!(o->flags & SEEN)) {
324 rev_list_push((struct commit *)o, COMMON_REF | SEEN);
326 mark_common((struct commit *)o, 1, 1);
330 filter_refs(refs, nr_match, match);
332 for (retval = 1, ref = *refs; ref ; ref = ref->next) {
333 const unsigned char *remote = ref->old_sha1;
334 unsigned char local[20];
337 o = lookup_object(remote);
338 if (!o || !(o->flags & COMPLETE)) {
343 "want %s (%s)\n", sha1_to_hex(remote),
348 memcpy(ref->new_sha1, local, 20);
352 "already have %s (%s)\n", sha1_to_hex(remote),
358 static int fetch_pack(int fd[2], int nr_match, char **match)
361 unsigned char sha1[20];
364 get_remote_heads(fd[0], &ref, 0, NULL, 0);
365 if (server_supports("multi_ack")) {
367 fprintf(stderr, "Server supports multi_ack\n");
372 die("no matching remote head");
374 if (everything_local(&ref, nr_match, match)) {
378 if (find_common(fd, sha1, ref) < 0)
379 fprintf(stderr, "warning: no common commits\n");
382 status = receive_keep_pack(fd, "git-fetch-pack", quiet);
384 status = receive_unpack_pack(fd, "git-fetch-pack", quiet);
387 die("git-fetch-pack: fetch failed.");
392 sha1_to_hex(ref->old_sha1), ref->name);
398 int main(int argc, char **argv)
400 int i, ret, nr_heads;
401 char *dest = NULL, **heads;
405 setup_git_directory();
409 for (i = 1; i < argc; i++) {
413 if (!strncmp("--exec=", arg, 7)) {
417 if (!strcmp("--quiet", arg) || !strcmp("-q", arg)) {
421 if (!strcmp("--keep", arg) || !strcmp("-k", arg)) {
425 if (!strcmp("--thin", arg)) {
429 if (!strcmp("-v", arg)) {
433 usage(fetch_pack_usage);
436 heads = argv + i + 1;
437 nr_heads = argc - i - 1;
441 usage(fetch_pack_usage);
444 pid = git_connect(fd, dest, exec);
447 ret = fetch_pack(fd, nr_heads, heads);
452 if (!ret && nr_heads) {
453 /* If the heads to pull were given, we should have
454 * consumed all of them by matching the remote.
455 * Otherwise, 'git-fetch remote no-such-ref' would
456 * silently succeed without issuing an error.
458 for (i = 0; i < nr_heads; i++)
459 if (heads[i] && heads[i][0]) {
460 error("no such remote ref %s", heads[i]);