?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
fetch: handle overlaping refspecs on --prune
[git.git] / remote.c
blobfde7b52f9340fd5c2517f0f48532bb0f1f169ac8
1 #include "cache.h"
2 #include "remote.h"
3 #include "refs.h"
4 #include "commit.h"
5 #include "diff.h"
6 #include "revision.h"
7 #include "dir.h"
8 #include "tag.h"
9 #include "string-list.h"
10 #include "mergesort.h"
11
12 enum map_direction { FROM_SRC, FROM_DST };
13
14 static struct refspec s_tag_refspec = {
15 0,
16 1,
17 0,
18 0,
19 "refs/tags/*",
20 "refs/tags/*"
21 };
22
23 const struct refspec *tag_refspec = &s_tag_refspec;
24
25 struct counted_string {
26 size_t len;
27 const char *s;
28 };
29 struct rewrite {
30 const char *base;
31 size_t baselen;
32 struct counted_string *instead_of;
33 int instead_of_nr;
34 int instead_of_alloc;
35 };
36 struct rewrites {
37 struct rewrite **rewrite;
38 int rewrite_alloc;
39 int rewrite_nr;
40 };
41
42 static struct remote **remotes;
43 static int remotes_alloc;
44 static int remotes_nr;
45
46 static struct branch **branches;
47 static int branches_alloc;
48 static int branches_nr;
49
50 static struct branch *current_branch;
51 static const char *default_remote_name;
52 static const char *pushremote_name;
53 static int explicit_default_remote_name;
54
55 static struct rewrites rewrites;
56 static struct rewrites rewrites_push;
57
58 #define BUF_SIZE (2048)
59 static char buffer[BUF_SIZE];
60
61 static int valid_remote(const struct remote *remote)
62 {
63 return (!!remote->url) || (!!remote->foreign_vcs);
64 }
65
66 static const char *alias_url(const char *url, struct rewrites *r)
67 {
68 int i, j;
69 char *ret;
70 struct counted_string *longest;
71 int longest_i;
72
73 longest = NULL;
74 longest_i = -1;
75 for (i = 0; i < r->rewrite_nr; i++) {
76 if (!r->rewrite[i])
77 continue;
78 for (j = 0; j < r->rewrite[i]->instead_of_nr; j++) {
79 if (!prefixcmp(url, r->rewrite[i]->instead_of[j].s) &&
80 (!longest ||
81 longest->len < r->rewrite[i]->instead_of[j].len)) {
82 longest = &(r->rewrite[i]->instead_of[j]);
83 longest_i = i;
84 }
85 }
86 }
87 if (!longest)
88 return url;
89
90 ret = xmalloc(r->rewrite[longest_i]->baselen +
91 (strlen(url) - longest->len) + 1);
92 strcpy(ret, r->rewrite[longest_i]->base);
93 strcpy(ret + r->rewrite[longest_i]->baselen, url + longest->len);
94 return ret;
95 }
96
97 static void add_push_refspec(struct remote *remote, const char *ref)
98 {
99 ALLOC_GROW(remote->push_refspec,
100 remote->push_refspec_nr + 1,
101 remote->push_refspec_alloc);
102 remote->push_refspec[remote->push_refspec_nr++] = ref;
103 }
104
105 static void add_fetch_refspec(struct remote *remote, const char *ref)
106 {
107 ALLOC_GROW(remote->fetch_refspec,
108 remote->fetch_refspec_nr + 1,
109 remote->fetch_refspec_alloc);
110 remote->fetch_refspec[remote->fetch_refspec_nr++] = ref;
111 }
112
113 static void add_url(struct remote *remote, const char *url)
114 {
115 ALLOC_GROW(remote->url, remote->url_nr + 1, remote->url_alloc);
116 remote->url[remote->url_nr++] = url;
117 }
118
119 static void add_pushurl(struct remote *remote, const char *pushurl)
120 {
121 ALLOC_GROW(remote->pushurl, remote->pushurl_nr + 1, remote->pushurl_alloc);
122 remote->pushurl[remote->pushurl_nr++] = pushurl;
123 }
124
125 static void add_pushurl_alias(struct remote *remote, const char *url)
126 {
127 const char *pushurl = alias_url(url, &rewrites_push);
128 if (pushurl != url)
129 add_pushurl(remote, pushurl);
130 }
131
132 static void add_url_alias(struct remote *remote, const char *url)
133 {
134 add_url(remote, alias_url(url, &rewrites));
135 add_pushurl_alias(remote, url);
136 }
137
138 static struct remote *make_remote(const char *name, int len)
139 {
140 struct remote *ret;
141 int i;
142
143 for (i = 0; i < remotes_nr; i++) {
144 if (len ? (!strncmp(name, remotes[i]->name, len) &&
145 !remotes[i]->name[len]) :
146 !strcmp(name, remotes[i]->name))
147 return remotes[i];
148 }
149
150 ret = xcalloc(1, sizeof(struct remote));
151 ret->prune = -1; /* unspecified */
152 ALLOC_GROW(remotes, remotes_nr + 1, remotes_alloc);
153 remotes[remotes_nr++] = ret;
154 if (len)
155 ret->name = xstrndup(name, len);
156 else
157 ret->name = xstrdup(name);
158 return ret;
159 }
160
161 static void add_merge(struct branch *branch, const char *name)
162 {
163 ALLOC_GROW(branch->merge_name, branch->merge_nr + 1,
164 branch->merge_alloc);
165 branch->merge_name[branch->merge_nr++] = name;
166 }
167
168 static struct branch *make_branch(const char *name, int len)
169 {
170 struct branch *ret;
171 int i;
172 char *refname;
173
174 for (i = 0; i < branches_nr; i++) {
175 if (len ? (!strncmp(name, branches[i]->name, len) &&
176 !branches[i]->name[len]) :
177 !strcmp(name, branches[i]->name))
178 return branches[i];
179 }
180
181 ALLOC_GROW(branches, branches_nr + 1, branches_alloc);
182 ret = xcalloc(1, sizeof(struct branch));
183 branches[branches_nr++] = ret;
184 if (len)
185 ret->name = xstrndup(name, len);
186 else
187 ret->name = xstrdup(name);
188 refname = xmalloc(strlen(name) + strlen("refs/heads/") + 1);
189 strcpy(refname, "refs/heads/");
190 strcpy(refname + strlen("refs/heads/"), ret->name);
191 ret->refname = refname;
192
193 return ret;
194 }
195
196 static struct rewrite *make_rewrite(struct rewrites *r, const char *base, int len)
197 {
198 struct rewrite *ret;
199 int i;
200
201 for (i = 0; i < r->rewrite_nr; i++) {
202 if (len
203 ? (len == r->rewrite[i]->baselen &&
204 !strncmp(base, r->rewrite[i]->base, len))
205 : !strcmp(base, r->rewrite[i]->base))
206 return r->rewrite[i];
207 }
208
209 ALLOC_GROW(r->rewrite, r->rewrite_nr + 1, r->rewrite_alloc);
210 ret = xcalloc(1, sizeof(struct rewrite));
211 r->rewrite[r->rewrite_nr++] = ret;
212 if (len) {
213 ret->base = xstrndup(base, len);
214 ret->baselen = len;
215 }
216 else {
217 ret->base = xstrdup(base);
218 ret->baselen = strlen(base);
219 }
220 return ret;
221 }
222
223 static void add_instead_of(struct rewrite *rewrite, const char *instead_of)
224 {
225 ALLOC_GROW(rewrite->instead_of, rewrite->instead_of_nr + 1, rewrite->instead_of_alloc);
226 rewrite->instead_of[rewrite->instead_of_nr].s = instead_of;
227 rewrite->instead_of[rewrite->instead_of_nr].len = strlen(instead_of);
228 rewrite->instead_of_nr++;
229 }
230
231 static void read_remotes_file(struct remote *remote)
232 {
233 FILE *f = fopen(git_path("remotes/%s", remote->name), "r");
234
235 if (!f)
236 return;
237 remote->origin = REMOTE_REMOTES;
238 while (fgets(buffer, BUF_SIZE, f)) {
239 int value_list;
240 char *s, *p;
241
242 if (!prefixcmp(buffer, "URL:")) {
243 value_list = 0;
244 s = buffer + 4;
245 } else if (!prefixcmp(buffer, "Push:")) {
246 value_list = 1;
247 s = buffer + 5;
248 } else if (!prefixcmp(buffer, "Pull:")) {
249 value_list = 2;
250 s = buffer + 5;
251 } else
252 continue;
253
254 while (isspace(*s))
255 s++;
256 if (!*s)
257 continue;
258
259 p = s + strlen(s);
260 while (isspace(p[-1]))
261 *--p = 0;
262
263 switch (value_list) {
264 case 0:
265 add_url_alias(remote, xstrdup(s));
266 break;
267 case 1:
268 add_push_refspec(remote, xstrdup(s));
269 break;
270 case 2:
271 add_fetch_refspec(remote, xstrdup(s));
272 break;
273 }
274 }
275 fclose(f);
276 }
277
278 static void read_branches_file(struct remote *remote)
279 {
280 char *frag;
281 struct strbuf branch = STRBUF_INIT;
282 int n = 1000;
283 FILE *f = fopen(git_path("branches/%.*s", n, remote->name), "r");
284 char *s, *p;
285 int len;
286
287 if (!f)
288 return;
289 s = fgets(buffer, BUF_SIZE, f);
290 fclose(f);
291 if (!s)
292 return;
293 while (isspace(*s))
294 s++;
295 if (!*s)
296 return;
297 remote->origin = REMOTE_BRANCHES;
298 p = s + strlen(s);
299 while (isspace(p[-1]))
300 *--p = 0;
301 len = p - s;
302 p = xmalloc(len + 1);
303 strcpy(p, s);
304
305 /*
306 * The branches file would have URL and optionally
307 * #branch specified. The "master" (or specified) branch is
308 * fetched and stored in the local branch of the same name.
309 */
310 frag = strchr(p, '#');
311 if (frag) {
312 *(frag++) = '\0';
313 strbuf_addf(&branch, "refs/heads/%s", frag);
314 } else
315 strbuf_addstr(&branch, "refs/heads/master");
316
317 strbuf_addf(&branch, ":refs/heads/%s", remote->name);
318 add_url_alias(remote, p);
319 add_fetch_refspec(remote, strbuf_detach(&branch, NULL));
320 /*
321 * Cogito compatible push: push current HEAD to remote #branch
322 * (master if missing)
323 */
324 strbuf_init(&branch, 0);
325 strbuf_addstr(&branch, "HEAD");
326 if (frag)
327 strbuf_addf(&branch, ":refs/heads/%s", frag);
328 else
329 strbuf_addstr(&branch, ":refs/heads/master");
330 add_push_refspec(remote, strbuf_detach(&branch, NULL));
331 remote->fetch_tags = 1; /* always auto-follow */
332 }
333
334 static int handle_config(const char *key, const char *value, void *cb)
335 {
336 const char *name;
337 const char *subkey;
338 struct remote *remote;
339 struct branch *branch;
340 if (!prefixcmp(key, "branch.")) {
341 name = key + 7;
342 subkey = strrchr(name, '.');
343 if (!subkey)
344 return 0;
345 branch = make_branch(name, subkey - name);
346 if (!strcmp(subkey, ".remote")) {
347 if (git_config_string(&branch->remote_name, key, value))
348 return -1;
349 if (branch == current_branch) {
350 default_remote_name = branch->remote_name;
351 explicit_default_remote_name = 1;
352 }
353 } else if (!strcmp(subkey, ".pushremote")) {
354 if (branch == current_branch)
355 if (git_config_string(&pushremote_name, key, value))
356 return -1;
357 } else if (!strcmp(subkey, ".merge")) {
358 if (!value)
359 return config_error_nonbool(key);
360 add_merge(branch, xstrdup(value));
361 }
362 return 0;
363 }
364 if (!prefixcmp(key, "url.")) {
365 struct rewrite *rewrite;
366 name = key + 4;
367 subkey = strrchr(name, '.');
368 if (!subkey)
369 return 0;
370 if (!strcmp(subkey, ".insteadof")) {
371 rewrite = make_rewrite(&rewrites, name, subkey - name);
372 if (!value)
373 return config_error_nonbool(key);
374 add_instead_of(rewrite, xstrdup(value));
375 } else if (!strcmp(subkey, ".pushinsteadof")) {
376 rewrite = make_rewrite(&rewrites_push, name, subkey - name);
377 if (!value)
378 return config_error_nonbool(key);
379 add_instead_of(rewrite, xstrdup(value));
380 }
381 }
382
383 if (prefixcmp(key, "remote."))
384 return 0;
385 name = key + 7;
386
387 /* Handle remote.* variables */
388 if (!strcmp(name, "pushdefault"))
389 return git_config_string(&pushremote_name, key, value);
390
391 /* Handle remote.<name>.* variables */
392 if (*name == '/') {
393 warning("Config remote shorthand cannot begin with '/': %s",
394 name);
395 return 0;
396 }
397 subkey = strrchr(name, '.');
398 if (!subkey)
399 return 0;
400 remote = make_remote(name, subkey - name);
401 remote->origin = REMOTE_CONFIG;
402 if (!strcmp(subkey, ".mirror"))
403 remote->mirror = git_config_bool(key, value);
404 else if (!strcmp(subkey, ".skipdefaultupdate"))
405 remote->skip_default_update = git_config_bool(key, value);
406 else if (!strcmp(subkey, ".skipfetchall"))
407 remote->skip_default_update = git_config_bool(key, value);
408 else if (!strcmp(subkey, ".prune"))
409 remote->prune = git_config_bool(key, value);
410 else if (!strcmp(subkey, ".url")) {
411 const char *v;
412 if (git_config_string(&v, key, value))
413 return -1;
414 add_url(remote, v);
415 } else if (!strcmp(subkey, ".pushurl")) {
416 const char *v;
417 if (git_config_string(&v, key, value))
418 return -1;
419 add_pushurl(remote, v);
420 } else if (!strcmp(subkey, ".push")) {
421 const char *v;
422 if (git_config_string(&v, key, value))
423 return -1;
424 add_push_refspec(remote, v);
425 } else if (!strcmp(subkey, ".fetch")) {
426 const char *v;
427 if (git_config_string(&v, key, value))
428 return -1;
429 add_fetch_refspec(remote, v);
430 } else if (!strcmp(subkey, ".receivepack")) {
431 const char *v;
432 if (git_config_string(&v, key, value))
433 return -1;
434 if (!remote->receivepack)
435 remote->receivepack = v;
436 else
437 error("more than one receivepack given, using the first");
438 } else if (!strcmp(subkey, ".uploadpack")) {
439 const char *v;
440 if (git_config_string(&v, key, value))
441 return -1;
442 if (!remote->uploadpack)
443 remote->uploadpack = v;
444 else
445 error("more than one uploadpack given, using the first");
446 } else if (!strcmp(subkey, ".tagopt")) {
447 if (!strcmp(value, "--no-tags"))
448 remote->fetch_tags = -1;
449 else if (!strcmp(value, "--tags"))
450 remote->fetch_tags = 2;
451 } else if (!strcmp(subkey, ".proxy")) {
452 return git_config_string((const char **)&remote->http_proxy,
453 key, value);
454 } else if (!strcmp(subkey, ".vcs")) {
455 return git_config_string(&remote->foreign_vcs, key, value);
456 }
457 return 0;
458 }
459
460 static void alias_all_urls(void)
461 {
462 int i, j;
463 for (i = 0; i < remotes_nr; i++) {
464 int add_pushurl_aliases;
465 if (!remotes[i])
466 continue;
467 for (j = 0; j < remotes[i]->pushurl_nr; j++) {
468 remotes[i]->pushurl[j] = alias_url(remotes[i]->pushurl[j], &rewrites);
469 }
470 add_pushurl_aliases = remotes[i]->pushurl_nr == 0;
471 for (j = 0; j < remotes[i]->url_nr; j++) {
472 if (add_pushurl_aliases)
473 add_pushurl_alias(remotes[i], remotes[i]->url[j]);
474 remotes[i]->url[j] = alias_url(remotes[i]->url[j], &rewrites);
475 }
476 }
477 }
478
479 static void read_config(void)
480 {
481 unsigned char sha1[20];
482 const char *head_ref;
483 int flag;
484 if (default_remote_name) /* did this already */
485 return;
486 default_remote_name = "origin";
487 current_branch = NULL;
488 head_ref = resolve_ref_unsafe("HEAD", sha1, 0, &flag);
489 if (head_ref && (flag & REF_ISSYMREF) &&
490 !prefixcmp(head_ref, "refs/heads/")) {
491 current_branch =
492 make_branch(head_ref + strlen("refs/heads/"), 0);
493 }
494 git_config(handle_config, NULL);
495 alias_all_urls();
496 }
497
498 /*
499 * This function frees a refspec array.
500 * Warning: code paths should be checked to ensure that the src
501 * and dst pointers are always freeable pointers as well
502 * as the refspec pointer itself.
503 */
504 static void free_refspecs(struct refspec *refspec, int nr_refspec)
505 {
506 int i;
507
508 if (!refspec)
509 return;
510
511 for (i = 0; i < nr_refspec; i++) {
512 free(refspec[i].src);
513 free(refspec[i].dst);
514 }
515 free(refspec);
516 }
517
518 static struct refspec *parse_refspec_internal(int nr_refspec, const char **refspec, int fetch, int verify)
519 {
520 int i;
521 struct refspec *rs = xcalloc(sizeof(*rs), nr_refspec);
522
523 for (i = 0; i < nr_refspec; i++) {
524 size_t llen;
525 int is_glob;
526 const char *lhs, *rhs;
527 int flags;
528
529 is_glob = 0;
530
531 lhs = refspec[i];
532 if (*lhs == '+') {
533 rs[i].force = 1;
534 lhs++;
535 }
536
537 rhs = strrchr(lhs, ':');
538
539 /*
540 * Before going on, special case ":" (or "+:") as a refspec
541 * for pushing matching refs.
542 */
543 if (!fetch && rhs == lhs && rhs[1] == '\0') {
544 rs[i].matching = 1;
545 continue;
546 }
547
548 if (rhs) {
549 size_t rlen = strlen(++rhs);
550 is_glob = (1 <= rlen && strchr(rhs, '*'));
551 rs[i].dst = xstrndup(rhs, rlen);
552 }
553
554 llen = (rhs ? (rhs - lhs - 1) : strlen(lhs));
555 if (1 <= llen && memchr(lhs, '*', llen)) {
556 if ((rhs && !is_glob) || (!rhs && fetch))
557 goto invalid;
558 is_glob = 1;
559 } else if (rhs && is_glob) {
560 goto invalid;
561 }
562
563 rs[i].pattern = is_glob;
564 rs[i].src = xstrndup(lhs, llen);
565 flags = REFNAME_ALLOW_ONELEVEL | (is_glob ? REFNAME_REFSPEC_PATTERN : 0);
566
567 if (fetch) {
568 unsigned char unused[40];
569
570 /* LHS */
571 if (!*rs[i].src)
572 ; /* empty is ok; it means "HEAD" */
573 else if (llen == 40 && !get_sha1_hex(rs[i].src, unused))
574 rs[i].exact_sha1 = 1; /* ok */
575 else if (!check_refname_format(rs[i].src, flags))
576 ; /* valid looking ref is ok */
577 else
578 goto invalid;
579 /* RHS */
580 if (!rs[i].dst)
581 ; /* missing is ok; it is the same as empty */
582 else if (!*rs[i].dst)
583 ; /* empty is ok; it means "do not store" */
584 else if (!check_refname_format(rs[i].dst, flags))
585 ; /* valid looking ref is ok */
586 else
587 goto invalid;
588 } else {
589 /*
590 * LHS
591 * - empty is allowed; it means delete.
592 * - when wildcarded, it must be a valid looking ref.
593 * - otherwise, it must be an extended SHA-1, but
594 * there is no existing way to validate this.
595 */
596 if (!*rs[i].src)
597 ; /* empty is ok */
598 else if (is_glob) {
599 if (check_refname_format(rs[i].src, flags))
600 goto invalid;
601 }
602 else
603 ; /* anything goes, for now */
604 /*
605 * RHS
606 * - missing is allowed, but LHS then must be a
607 * valid looking ref.
608 * - empty is not allowed.
609 * - otherwise it must be a valid looking ref.
610 */
611 if (!rs[i].dst) {
612 if (check_refname_format(rs[i].src, flags))
613 goto invalid;
614 } else if (!*rs[i].dst) {
615 goto invalid;
616 } else {
617 if (check_refname_format(rs[i].dst, flags))
618 goto invalid;
619 }
620 }
621 }
622 return rs;
623
624 invalid:
625 if (verify) {
626 /*
627 * nr_refspec must be greater than zero and i must be valid
628 * since it is only possible to reach this point from within
629 * the for loop above.
630 */
631 free_refspecs(rs, i+1);
632 return NULL;
633 }
634 die("Invalid refspec '%s'", refspec[i]);
635 }
636
637 int valid_fetch_refspec(const char *fetch_refspec_str)
638 {
639 struct refspec *refspec;
640
641 refspec = parse_refspec_internal(1, &fetch_refspec_str, 1, 1);
642 free_refspecs(refspec, 1);
643 return !!refspec;
644 }
645
646 struct refspec *parse_fetch_refspec(int nr_refspec, const char **refspec)
647 {
648 return parse_refspec_internal(nr_refspec, refspec, 1, 0);
649 }
650
651 static struct refspec *parse_push_refspec(int nr_refspec, const char **refspec)
652 {
653 return parse_refspec_internal(nr_refspec, refspec, 0, 0);
654 }
655
656 void free_refspec(int nr_refspec, struct refspec *refspec)
657 {
658 int i;
659 for (i = 0; i < nr_refspec; i++) {
660 free(refspec[i].src);
661 free(refspec[i].dst);
662 }
663 free(refspec);
664 }
665
666 static int valid_remote_nick(const char *name)
667 {
668 if (!name[0] || is_dot_or_dotdot(name))
669 return 0;
670 return !strchr(name, '/'); /* no slash */
671 }
672
673 static struct remote *remote_get_1(const char *name, const char *pushremote_name)
674 {
675 struct remote *ret;
676 int name_given = 0;
677
678 if (name)
679 name_given = 1;
680 else {
681 if (pushremote_name) {
682 name = pushremote_name;
683 name_given = 1;
684 } else {
685 name = default_remote_name;
686 name_given = explicit_default_remote_name;
687 }
688 }
689
690 ret = make_remote(name, 0);
691 if (valid_remote_nick(name)) {
692 if (!valid_remote(ret))
693 read_remotes_file(ret);
694 if (!valid_remote(ret))
695 read_branches_file(ret);
696 }
697 if (name_given && !valid_remote(ret))
698 add_url_alias(ret, name);
699 if (!valid_remote(ret))
700 return NULL;
701 ret->fetch = parse_fetch_refspec(ret->fetch_refspec_nr, ret->fetch_refspec);
702 ret->push = parse_push_refspec(ret->push_refspec_nr, ret->push_refspec);
703 return ret;
704 }
705
706 struct remote *remote_get(const char *name)
707 {
708 read_config();
709 return remote_get_1(name, NULL);
710 }
711
712 struct remote *pushremote_get(const char *name)
713 {
714 read_config();
715 return remote_get_1(name, pushremote_name);
716 }
717
718 int remote_is_configured(const char *name)
719 {
720 int i;
721 read_config();
722
723 for (i = 0; i < remotes_nr; i++)
724 if (!strcmp(name, remotes[i]->name))
725 return 1;
726 return 0;
727 }
728
729 int for_each_remote(each_remote_fn fn, void *priv)
730 {
731 int i, result = 0;
732 read_config();
733 for (i = 0; i < remotes_nr && !result; i++) {
734 struct remote *r = remotes[i];
735 if (!r)
736 continue;
737 if (!r->fetch)
738 r->fetch = parse_fetch_refspec(r->fetch_refspec_nr,
739 r->fetch_refspec);
740 if (!r->push)
741 r->push = parse_push_refspec(r->push_refspec_nr,
742 r->push_refspec);
743 result = fn(r, priv);
744 }
745 return result;
746 }
747
748 void ref_remove_duplicates(struct ref *ref_map)
749 {
750 struct string_list refs = STRING_LIST_INIT_NODUP;
751 struct string_list_item *item = NULL;
752 struct ref *prev = NULL, *next = NULL;
753 for (; ref_map; prev = ref_map, ref_map = next) {
754 next = ref_map->next;
755 if (!ref_map->peer_ref)
756 continue;
757
758 item = string_list_lookup(&refs, ref_map->peer_ref->name);
759 if (item) {
760 if (strcmp(((struct ref *)item->util)->name,
761 ref_map->name))
762 die("%s tracks both %s and %s",
763 ref_map->peer_ref->name,
764 ((struct ref *)item->util)->name,
765 ref_map->name);
766 prev->next = ref_map->next;
767 free(ref_map->peer_ref);
768 free(ref_map);
769 ref_map = prev; /* skip this; we freed it */
770 continue;
771 }
772
773 item = string_list_insert(&refs, ref_map->peer_ref->name);
774 item->util = ref_map;
775 }
776 string_list_clear(&refs, 0);
777 }
778
779 int remote_has_url(struct remote *remote, const char *url)
780 {
781 int i;
782 for (i = 0; i < remote->url_nr; i++) {
783 if (!strcmp(remote->url[i], url))
784 return 1;
785 }
786 return 0;
787 }
788
789 static int match_name_with_pattern(const char *key, const char *name,
790 const char *value, char **result)
791 {
792 const char *kstar = strchr(key, '*');
793 size_t klen;
794 size_t ksuffixlen;
795 size_t namelen;
796 int ret;
797 if (!kstar)
798 die("Key '%s' of pattern had no '*'", key);
799 klen = kstar - key;
800 ksuffixlen = strlen(kstar + 1);
801 namelen = strlen(name);
802 ret = !strncmp(name, key, klen) && namelen >= klen + ksuffixlen &&
803 !memcmp(name + namelen - ksuffixlen, kstar + 1, ksuffixlen);
804 if (ret && value) {
805 const char *vstar = strchr(value, '*');
806 size_t vlen;
807 size_t vsuffixlen;
808 if (!vstar)
809 die("Value '%s' of pattern has no '*'", value);
810 vlen = vstar - value;
811 vsuffixlen = strlen(vstar + 1);
812 *result = xmalloc(vlen + vsuffixlen +
813 strlen(name) -
814 klen - ksuffixlen + 1);
815 strncpy(*result, value, vlen);
816 strncpy(*result + vlen,
817 name + klen, namelen - klen - ksuffixlen);
818 strcpy(*result + vlen + namelen - klen - ksuffixlen,
819 vstar + 1);
820 }
821 return ret;
822 }
823
824 static void query_refspecs_multiple(struct refspec *refs, int ref_count, struct refspec *query, struct string_list *results)
825 {
826 int i;
827 int find_src = !query->src;
828
829 if (find_src && !query->dst)
830 error("query_refspecs_multiple: need either src or dst");
831
832 for (i = 0; i < ref_count; i++) {
833 struct refspec *refspec = &refs[i];
834 const char *key = find_src ? refspec->dst : refspec->src;
835 const char *value = find_src ? refspec->src : refspec->dst;
836 const char *needle = find_src ? query->dst : query->src;
837 char **result = find_src ? &query->src : &query->dst;
838
839 if (!refspec->dst)
840 continue;
841 if (refspec->pattern) {
842 if (match_name_with_pattern(key, needle, value, result))
843 string_list_append_nodup(results, *result);
844 } else if (!strcmp(needle, key)) {
845 string_list_append(results, value);
846 }
847 }
848 }
849
850 static int query_refspecs(struct refspec *refs, int ref_count, struct refspec *query)
851 {
852 int i;
853 int find_src = !query->src;
854
855 if (find_src && !query->dst)
856 return error("query_refspecs: need either src or dst");
857
858 for (i = 0; i < ref_count; i++) {
859 struct refspec *refspec = &refs[i];
860 const char *key = find_src ? refspec->dst : refspec->src;
861 const char *value = find_src ? refspec->src : refspec->dst;
862 const char *needle = find_src ? query->dst : query->src;
863 char **result = find_src ? &query->src : &query->dst;
864
865 if (!refspec->dst)
866 continue;
867 if (refspec->pattern) {
868 if (match_name_with_pattern(key, needle, value, result)) {
869 query->force = refspec->force;
870 return 0;
871 }
872 } else if (!strcmp(needle, key)) {
873 *result = xstrdup(value);
874 query->force = refspec->force;
875 return 0;
876 }
877 }
878 return -1;
879 }
880
881 char *apply_refspecs(struct refspec *refspecs, int nr_refspec,
882 const char *name)
883 {
884 struct refspec query;
885
886 memset(&query, 0, sizeof(struct refspec));
887 query.src = (char *)name;
888
889 if (query_refspecs(refspecs, nr_refspec, &query))
890 return NULL;
891
892 return query.dst;
893 }
894
895 int remote_find_tracking(struct remote *remote, struct refspec *refspec)
896 {
897 return query_refspecs(remote->fetch, remote->fetch_refspec_nr, refspec);
898 }
899
900 static struct ref *alloc_ref_with_prefix(const char *prefix, size_t prefixlen,
901 const char *name)
902 {
903 size_t len = strlen(name);
904 struct ref *ref = xcalloc(1, sizeof(struct ref) + prefixlen + len + 1);
905 memcpy(ref->name, prefix, prefixlen);
906 memcpy(ref->name + prefixlen, name, len);
907 return ref;
908 }
909
910 struct ref *alloc_ref(const char *name)
911 {
912 return alloc_ref_with_prefix("", 0, name);
913 }
914
915 struct ref *copy_ref(const struct ref *ref)
916 {
917 struct ref *cpy;
918 size_t len;
919 if (!ref)
920 return NULL;
921 len = strlen(ref->name);
922 cpy = xmalloc(sizeof(struct ref) + len + 1);
923 memcpy(cpy, ref, sizeof(struct ref) + len + 1);
924 cpy->next = NULL;
925 cpy->symref = ref->symref ? xstrdup(ref->symref) : NULL;
926 cpy->remote_status = ref->remote_status ? xstrdup(ref->remote_status) : NULL;
927 cpy->peer_ref = copy_ref(ref->peer_ref);
928 return cpy;
929 }
930
931 struct ref *copy_ref_list(const struct ref *ref)
932 {
933 struct ref *ret = NULL;
934 struct ref **tail = &ret;
935 while (ref) {
936 *tail = copy_ref(ref);
937 ref = ref->next;
938 tail = &((*tail)->next);
939 }
940 return ret;
941 }
942
943 static void free_ref(struct ref *ref)
944 {
945 if (!ref)
946 return;
947 free_ref(ref->peer_ref);
948 free(ref->remote_status);
949 free(ref->symref);
950 free(ref);
951 }
952
953 void free_refs(struct ref *ref)
954 {
955 struct ref *next;
956 while (ref) {
957 next = ref->next;
958 free_ref(ref);
959 ref = next;
960 }
961 }
962
963 int ref_compare_name(const void *va, const void *vb)
964 {
965 const struct ref *a = va, *b = vb;
966 return strcmp(a->name, b->name);
967 }
968
969 static void *ref_list_get_next(const void *a)
970 {
971 return ((const struct ref *)a)->next;
972 }
973
974 static void ref_list_set_next(void *a, void *next)
975 {
976 ((struct ref *)a)->next = next;
977 }
978
979 void sort_ref_list(struct ref **l, int (*cmp)(const void *, const void *))
980 {
981 *l = llist_mergesort(*l, ref_list_get_next, ref_list_set_next, cmp);
982 }
983
984 static int count_refspec_match(const char *pattern,
985 struct ref *refs,
986 struct ref **matched_ref)
987 {
988 int patlen = strlen(pattern);
989 struct ref *matched_weak = NULL;
990 struct ref *matched = NULL;
991 int weak_match = 0;
992 int match = 0;
993
994 for (weak_match = match = 0; refs; refs = refs->next) {
995 char *name = refs->name;
996 int namelen = strlen(name);
997
998 if (!refname_match(pattern, name, ref_rev_parse_rules))
999 continue;
1000
1001 /* A match is "weak" if it is with refs outside
1002 * heads or tags, and did not specify the pattern
1003 * in full (e.g. "refs/remotes/origin/master") or at
1004 * least from the toplevel (e.g. "remotes/origin/master");
1005 * otherwise "git push $URL master" would result in
1006 * ambiguity between remotes/origin/master and heads/master
1007 * at the remote site.
1008 */
1009 if (namelen != patlen &&
1010 patlen != namelen - 5 &&
1011 prefixcmp(name, "refs/heads/") &&
1012 prefixcmp(name, "refs/tags/")) {
1013 /* We want to catch the case where only weak
1014 * matches are found and there are multiple
1015 * matches, and where more than one strong
1016 * matches are found, as ambiguous. One
1017 * strong match with zero or more weak matches
1018 * are acceptable as a unique match.
1019 */
1020 matched_weak = refs;
1021 weak_match++;
1022 }
1023 else {
1024 matched = refs;
1025 match++;
1026 }
1027 }
1028 if (!matched) {
1029 *matched_ref = matched_weak;
1030 return weak_match;
1031 }
1032 else {
1033 *matched_ref = matched;
1034 return match;
1035 }
1036 }
1037
1038 static void tail_link_ref(struct ref *ref, struct ref ***tail)
1039 {
1040 **tail = ref;
1041 while (ref->next)
1042 ref = ref->next;
1043 *tail = &ref->next;
1044 }
1045
1046 static struct ref *alloc_delete_ref(void)
1047 {
1048 struct ref *ref = alloc_ref("(delete)");
1049 hashclr(ref->new_sha1);
1050 return ref;
1051 }
1052
1053 static struct ref *try_explicit_object_name(const char *name)
1054 {
1055 unsigned char sha1[20];
1056 struct ref *ref;
1057
1058 if (!*name)
1059 return alloc_delete_ref();
1060 if (get_sha1(name, sha1))
1061 return NULL;
1062 ref = alloc_ref(name);
1063 hashcpy(ref->new_sha1, sha1);
1064 return ref;
1065 }
1066
1067 static struct ref *make_linked_ref(const char *name, struct ref ***tail)
1068 {
1069 struct ref *ret = alloc_ref(name);
1070 tail_link_ref(ret, tail);
1071 return ret;
1072 }
1073
1074 static char *guess_ref(const char *name, struct ref *peer)
1075 {
1076 struct strbuf buf = STRBUF_INIT;
1077 unsigned char sha1[20];
1078
1079 const char *r = resolve_ref_unsafe(peer->name, sha1, 1, NULL);
1080 if (!r)
1081 return NULL;
1082
1083 if (!prefixcmp(r, "refs/heads/"))
1084 strbuf_addstr(&buf, "refs/heads/");
1085 else if (!prefixcmp(r, "refs/tags/"))
1086 strbuf_addstr(&buf, "refs/tags/");
1087 else
1088 return NULL;
1089
1090 strbuf_addstr(&buf, name);
1091 return strbuf_detach(&buf, NULL);
1092 }
1093
1094 static int match_explicit(struct ref *src, struct ref *dst,
1095 struct ref ***dst_tail,
1096 struct refspec *rs)
1097 {
1098 struct ref *matched_src, *matched_dst;
1099 int copy_src;
1100
1101 const char *dst_value = rs->dst;
1102 char *dst_guess;
1103
1104 if (rs->pattern || rs->matching)
1105 return 0;
1106
1107 matched_src = matched_dst = NULL;
1108 switch (count_refspec_match(rs->src, src, &matched_src)) {
1109 case 1:
1110 copy_src = 1;
1111 break;
1112 case 0:
1113 /* The source could be in the get_sha1() format
1114 * not a reference name. :refs/other is a
1115 * way to delete 'other' ref at the remote end.
1116 */
1117 matched_src = try_explicit_object_name(rs->src);
1118 if (!matched_src)
1119 return error("src refspec %s does not match any.", rs->src);
1120 copy_src = 0;
1121 break;
1122 default:
1123 return error("src refspec %s matches more than one.", rs->src);
1124 }
1125
1126 if (!dst_value) {
1127 unsigned char sha1[20];
1128 int flag;
1129
1130 dst_value = resolve_ref_unsafe(matched_src->name, sha1, 1, &flag);
1131 if (!dst_value ||
1132 ((flag & REF_ISSYMREF) &&
1133 prefixcmp(dst_value, "refs/heads/")))
1134 die("%s cannot be resolved to branch.",
1135 matched_src->name);
1136 }
1137
1138 switch (count_refspec_match(dst_value, dst, &matched_dst)) {
1139 case 1:
1140 break;
1141 case 0:
1142 if (!memcmp(dst_value, "refs/", 5))
1143 matched_dst = make_linked_ref(dst_value, dst_tail);
1144 else if (is_null_sha1(matched_src->new_sha1))
1145 error("unable to delete '%s': remote ref does not exist",
1146 dst_value);
1147 else if ((dst_guess = guess_ref(dst_value, matched_src)))
1148 matched_dst = make_linked_ref(dst_guess, dst_tail);
1149 else
1150 error("unable to push to unqualified destination: %s\n"
1151 "The destination refspec neither matches an "
1152 "existing ref on the remote nor\n"
1153 "begins with refs/, and we are unable to "
1154 "guess a prefix based on the source ref.",
1155 dst_value);
1156 break;
1157 default:
1158 matched_dst = NULL;
1159 error("dst refspec %s matches more than one.",
1160 dst_value);
1161 break;
1162 }
1163 if (!matched_dst)
1164 return -1;
1165 if (matched_dst->peer_ref)
1166 return error("dst ref %s receives from more than one src.",
1167 matched_dst->name);
1168 else {
1169 matched_dst->peer_ref = copy_src ? copy_ref(matched_src) : matched_src;
1170 matched_dst->force = rs->force;
1171 }
1172 return 0;
1173 }
1174
1175 static int match_explicit_refs(struct ref *src, struct ref *dst,
1176 struct ref ***dst_tail, struct refspec *rs,
1177 int rs_nr)
1178 {
1179 int i, errs;
1180 for (i = errs = 0; i < rs_nr; i++)
1181 errs += match_explicit(src, dst, dst_tail, &rs[i]);
1182 return errs;
1183 }
1184
1185 static char *get_ref_match(const struct refspec *rs, int rs_nr, const struct ref *ref,
1186 int send_mirror, int direction, const struct refspec **ret_pat)
1187 {
1188 const struct refspec *pat;
1189 char *name;
1190 int i;
1191 int matching_refs = -1;
1192 for (i = 0; i < rs_nr; i++) {
1193 if (rs[i].matching &&
1194 (matching_refs == -1 || rs[i].force)) {
1195 matching_refs = i;
1196 continue;
1197 }
1198
1199 if (rs[i].pattern) {
1200 const char *dst_side = rs[i].dst ? rs[i].dst : rs[i].src;
1201 int match;
1202 if (direction == FROM_SRC)
1203 match = match_name_with_pattern(rs[i].src, ref->name, dst_side, &name);
1204 else
1205 match = match_name_with_pattern(dst_side, ref->name, rs[i].src, &name);
1206 if (match) {
1207 matching_refs = i;
1208 break;
1209 }
1210 }
1211 }
1212 if (matching_refs == -1)
1213 return NULL;
1214
1215 pat = rs + matching_refs;
1216 if (pat->matching) {
1217 /*
1218 * "matching refs"; traditionally we pushed everything
1219 * including refs outside refs/heads/ hierarchy, but
1220 * that does not make much sense these days.
1221 */
1222 if (!send_mirror && prefixcmp(ref->name, "refs/heads/"))
1223 return NULL;
1224 name = xstrdup(ref->name);
1225 }
1226 if (ret_pat)
1227 *ret_pat = pat;
1228 return name;
1229 }
1230
1231 static struct ref **tail_ref(struct ref **head)
1232 {
1233 struct ref **tail = head;
1234 while (*tail)
1235 tail = &((*tail)->next);
1236 return tail;
1237 }
1238
1239 struct tips {
1240 struct commit **tip;
1241 int nr, alloc;
1242 };
1243
1244 static void add_to_tips(struct tips *tips, const unsigned char *sha1)
1245 {
1246 struct commit *commit;
1247
1248 if (is_null_sha1(sha1))
1249 return;
1250 commit = lookup_commit_reference_gently(sha1, 1);
1251 if (!commit || (commit->object.flags & TMP_MARK))
1252 return;
1253 commit->object.flags |= TMP_MARK;
1254 ALLOC_GROW(tips->tip, tips->nr + 1, tips->alloc);
1255 tips->tip[tips->nr++] = commit;
1256 }
1257
1258 static void add_missing_tags(struct ref *src, struct ref **dst, struct ref ***dst_tail)
1259 {
1260 struct string_list dst_tag = STRING_LIST_INIT_NODUP;
1261 struct string_list src_tag = STRING_LIST_INIT_NODUP;
1262 struct string_list_item *item;
1263 struct ref *ref;
1264 struct tips sent_tips;
1265
1266 /*
1267 * Collect everything we know they would have at the end of
1268 * this push, and collect all tags they have.
1269 */
1270 memset(&sent_tips, 0, sizeof(sent_tips));
1271 for (ref = *dst; ref; ref = ref->next) {
1272 if (ref->peer_ref &&
1273 !is_null_sha1(ref->peer_ref->new_sha1))
1274 add_to_tips(&sent_tips, ref->peer_ref->new_sha1);
1275 else
1276 add_to_tips(&sent_tips, ref->old_sha1);
1277 if (!prefixcmp(ref->name, "refs/tags/"))
1278 string_list_append(&dst_tag, ref->name);
1279 }
1280 clear_commit_marks_many(sent_tips.nr, sent_tips.tip, TMP_MARK);
1281
1282 sort_string_list(&dst_tag);
1283
1284 /* Collect tags they do not have. */
1285 for (ref = src; ref; ref = ref->next) {
1286 if (prefixcmp(ref->name, "refs/tags/"))
1287 continue; /* not a tag */
1288 if (string_list_has_string(&dst_tag, ref->name))
1289 continue; /* they already have it */
1290 if (sha1_object_info(ref->new_sha1, NULL) != OBJ_TAG)
1291 continue; /* be conservative */
1292 item = string_list_append(&src_tag, ref->name);
1293 item->util = ref;
1294 }
1295 string_list_clear(&dst_tag, 0);
1296
1297 /*
1298 * At this point, src_tag lists tags that are missing from
1299 * dst, and sent_tips lists the tips we are pushing or those
1300 * that we know they already have. An element in the src_tag
1301 * that is an ancestor of any of the sent_tips needs to be
1302 * sent to the other side.
1303 */
1304 if (sent_tips.nr) {
1305 for_each_string_list_item(item, &src_tag) {
1306 struct ref *ref = item->util;
1307 struct ref *dst_ref;
1308 struct commit *commit;
1309
1310 if (is_null_sha1(ref->new_sha1))
1311 continue;
1312 commit = lookup_commit_reference_gently(ref->new_sha1, 1);
1313 if (!commit)
1314 /* not pushing a commit, which is not an error */
1315 continue;
1316
1317 /*
1318 * Is this tag, which they do not have, reachable from
1319 * any of the commits we are sending?
1320 */
1321 if (!in_merge_bases_many(commit, sent_tips.nr, sent_tips.tip))
1322 continue;
1323
1324 /* Add it in */
1325 dst_ref = make_linked_ref(ref->name, dst_tail);
1326 hashcpy(dst_ref->new_sha1, ref->new_sha1);
1327 dst_ref->peer_ref = copy_ref(ref);
1328 }
1329 }
1330 string_list_clear(&src_tag, 0);
1331 free(sent_tips.tip);
1332 }
1333
1334 struct ref *find_ref_by_name(const struct ref *list, const char *name)
1335 {
1336 for ( ; list; list = list->next)
1337 if (!strcmp(list->name, name))
1338 return (struct ref *)list;
1339 return NULL;
1340 }
1341
1342 static void prepare_ref_index(struct string_list *ref_index, struct ref *ref)
1343 {
1344 for ( ; ref; ref = ref->next)
1345 string_list_append_nodup(ref_index, ref->name)->util = ref;
1346
1347 sort_string_list(ref_index);
1348 }
1349
1350 /*
1351 * Given the set of refs the local repository has, the set of refs the
1352 * remote repository has, and the refspec used for push, determine
1353 * what remote refs we will update and with what value by setting
1354 * peer_ref (which object is being pushed) and force (if the push is
1355 * forced) in elements of "dst". The function may add new elements to
1356 * dst (e.g. pushing to a new branch, done in match_explicit_refs).
1357 */
1358 int match_push_refs(struct ref *src, struct ref **dst,
1359 int nr_refspec, const char **refspec, int flags)
1360 {
1361 struct refspec *rs;
1362 int send_all = flags & MATCH_REFS_ALL;
1363 int send_mirror = flags & MATCH_REFS_MIRROR;
1364 int send_prune = flags & MATCH_REFS_PRUNE;
1365 int errs;
1366 static const char *default_refspec[] = { ":", NULL };
1367 struct ref *ref, **dst_tail = tail_ref(dst);
1368 struct string_list dst_ref_index = STRING_LIST_INIT_NODUP;
1369
1370 if (!nr_refspec) {
1371 nr_refspec = 1;
1372 refspec = default_refspec;
1373 }
1374 rs = parse_push_refspec(nr_refspec, (const char **) refspec);
1375 errs = match_explicit_refs(src, *dst, &dst_tail, rs, nr_refspec);
1376
1377 /* pick the remainder */
1378 for (ref = src; ref; ref = ref->next) {
1379 struct string_list_item *dst_item;
1380 struct ref *dst_peer;
1381 const struct refspec *pat = NULL;
1382 char *dst_name;
1383
1384 dst_name = get_ref_match(rs, nr_refspec, ref, send_mirror, FROM_SRC, &pat);
1385 if (!dst_name)
1386 continue;
1387
1388 if (!dst_ref_index.nr)
1389 prepare_ref_index(&dst_ref_index, *dst);
1390
1391 dst_item = string_list_lookup(&dst_ref_index, dst_name);
1392 dst_peer = dst_item ? dst_item->util : NULL;
1393 if (dst_peer) {
1394 if (dst_peer->peer_ref)
1395 /* We're already sending something to this ref. */
1396 goto free_name;
1397 } else {
1398 if (pat->matching && !(send_all || send_mirror))
1399 /*
1400 * Remote doesn't have it, and we have no
1401 * explicit pattern, and we don't have
1402 * --all nor --mirror.
1403 */
1404 goto free_name;
1405
1406 /* Create a new one and link it */
1407 dst_peer = make_linked_ref(dst_name, &dst_tail);
1408 hashcpy(dst_peer->new_sha1, ref->new_sha1);
1409 string_list_insert(&dst_ref_index,
1410 dst_peer->name)->util = dst_peer;
1411 }
1412 dst_peer->peer_ref = copy_ref(ref);
1413 dst_peer->force = pat->force;
1414 free_name:
1415 free(dst_name);
1416 }
1417
1418 string_list_clear(&dst_ref_index, 0);
1419
1420 if (flags & MATCH_REFS_FOLLOW_TAGS)
1421 add_missing_tags(src, dst, &dst_tail);
1422
1423 if (send_prune) {
1424 struct string_list src_ref_index = STRING_LIST_INIT_NODUP;
1425 /* check for missing refs on the remote */
1426 for (ref = *dst; ref; ref = ref->next) {
1427 char *src_name;
1428
1429 if (ref->peer_ref)
1430 /* We're already sending something to this ref. */
1431 continue;
1432
1433 src_name = get_ref_match(rs, nr_refspec, ref, send_mirror, FROM_DST, NULL);
1434 if (src_name) {
1435 if (!src_ref_index.nr)
1436 prepare_ref_index(&src_ref_index, src);
1437 if (!string_list_has_string(&src_ref_index,
1438 src_name))
1439 ref->peer_ref = alloc_delete_ref();
1440 free(src_name);
1441 }
1442 }
1443 string_list_clear(&src_ref_index, 0);
1444 }
1445 if (errs)
1446 return -1;
1447 return 0;
1448 }
1449
1450 void set_ref_status_for_push(struct ref *remote_refs, int send_mirror,
1451 int force_update)
1452 {
1453 struct ref *ref;
1454
1455 for (ref = remote_refs; ref; ref = ref->next) {
1456 int force_ref_update = ref->force || force_update;
1457 int reject_reason = 0;
1458
1459 if (ref->peer_ref)
1460 hashcpy(ref->new_sha1, ref->peer_ref->new_sha1);
1461 else if (!send_mirror)
1462 continue;
1463
1464 ref->deletion = is_null_sha1(ref->new_sha1);
1465 if (!ref->deletion &&
1466 !hashcmp(ref->old_sha1, ref->new_sha1)) {
1467 ref->status = REF_STATUS_UPTODATE;
1468 continue;
1469 }
1470
1471 /*
1472 * Bypass the usual "must fast-forward" check but
1473 * replace it with a weaker "the old value must be
1474 * this value we observed". If the remote ref has
1475 * moved and is now different from what we expect,
1476 * reject any push.
1477 *
1478 * It also is an error if the user told us to check
1479 * with the remote-tracking branch to find the value
1480 * to expect, but we did not have such a tracking
1481 * branch.
1482 */
1483 if (ref->expect_old_sha1) {
1484 if (ref->expect_old_no_trackback ||
1485 hashcmp(ref->old_sha1, ref->old_sha1_expect))
1486 reject_reason = REF_STATUS_REJECT_STALE;
1487 }
1488
1489 /*
1490 * The usual "must fast-forward" rules.
1491 *
1492 * Decide whether an individual refspec A:B can be
1493 * pushed. The push will succeed if any of the
1494 * following are true:
1495 *
1496 * (1) the remote reference B does not exist
1497 *
1498 * (2) the remote reference B is being removed (i.e.,
1499 * pushing :B where no source is specified)
1500 *
1501 * (3) the destination is not under refs/tags/, and
1502 * if the old and new value is a commit, the new
1503 * is a descendant of the old.
1504 *
1505 * (4) it is forced using the +A:B notation, or by
1506 * passing the --force argument
1507 */
1508
1509 else if (!ref->deletion && !is_null_sha1(ref->old_sha1)) {
1510 if (!prefixcmp(ref->name, "refs/tags/"))
1511 reject_reason = REF_STATUS_REJECT_ALREADY_EXISTS;
1512 else if (!has_sha1_file(ref->old_sha1))
1513 reject_reason = REF_STATUS_REJECT_FETCH_FIRST;
1514 else if (!lookup_commit_reference_gently(ref->old_sha1, 1) ||
1515 !lookup_commit_reference_gently(ref->new_sha1, 1))
1516 reject_reason = REF_STATUS_REJECT_NEEDS_FORCE;
1517 else if (!ref_newer(ref->new_sha1, ref->old_sha1))
1518 reject_reason = REF_STATUS_REJECT_NONFASTFORWARD;
1519 }
1520
1521 /*
1522 * "--force" will defeat any rejection implemented
1523 * by the rules above.
1524 */
1525 if (!force_ref_update)
1526 ref->status = reject_reason;
1527 else if (reject_reason)
1528 ref->forced_update = 1;
1529 }
1530 }
1531
1532 struct branch *branch_get(const char *name)
1533 {
1534 struct branch *ret;
1535
1536 read_config();
1537 if (!name || !*name || !strcmp(name, "HEAD"))
1538 ret = current_branch;
1539 else
1540 ret = make_branch(name, 0);
1541 if (ret && ret->remote_name) {
1542 ret->remote = remote_get(ret->remote_name);
1543 if (ret->merge_nr) {
1544 int i;
1545 ret->merge = xcalloc(ret->merge_nr, sizeof(*ret->merge));
1546 for (i = 0; i < ret->merge_nr; i++) {
1547 ret->merge[i] = xcalloc(1, sizeof(**ret->merge));
1548 ret->merge[i]->src = xstrdup(ret->merge_name[i]);
1549 if (remote_find_tracking(ret->remote, ret->merge[i])
1550 && !strcmp(ret->remote_name, "."))
1551 ret->merge[i]->dst = xstrdup(ret->merge_name[i]);
1552 }
1553 }
1554 }
1555 return ret;
1556 }
1557
1558 int branch_has_merge_config(struct branch *branch)
1559 {
1560 return branch && !!branch->merge;
1561 }
1562
1563 int branch_merge_matches(struct branch *branch,
1564 int i,
1565 const char *refname)
1566 {
1567 if (!branch || i < 0 || i >= branch->merge_nr)
1568 return 0;
1569 return refname_match(branch->merge[i]->src, refname, ref_fetch_rules);
1570 }
1571
1572 static int ignore_symref_update(const char *refname)
1573 {
1574 unsigned char sha1[20];
1575 int flag;
1576
1577 if (!resolve_ref_unsafe(refname, sha1, 0, &flag))
1578 return 0; /* non-existing refs are OK */
1579 return (flag & REF_ISSYMREF);
1580 }
1581
1582 static struct ref *get_expanded_map(const struct ref *remote_refs,
1583 const struct refspec *refspec)
1584 {
1585 const struct ref *ref;
1586 struct ref *ret = NULL;
1587 struct ref **tail = &ret;
1588
1589 char *expn_name;
1590
1591 for (ref = remote_refs; ref; ref = ref->next) {
1592 if (strchr(ref->name, '^'))
1593 continue; /* a dereference item */
1594 if (match_name_with_pattern(refspec->src, ref->name,
1595 refspec->dst, &expn_name) &&
1596 !ignore_symref_update(expn_name)) {
1597 struct ref *cpy = copy_ref(ref);
1598
1599 cpy->peer_ref = alloc_ref(expn_name);
1600 free(expn_name);
1601 if (refspec->force)
1602 cpy->peer_ref->force = 1;
1603 *tail = cpy;
1604 tail = &cpy->next;
1605 }
1606 }
1607
1608 return ret;
1609 }
1610
1611 static const struct ref *find_ref_by_name_abbrev(const struct ref *refs, const char *name)
1612 {
1613 const struct ref *ref;
1614 for (ref = refs; ref; ref = ref->next) {
1615 if (refname_match(name, ref->name, ref_fetch_rules))
1616 return ref;
1617 }
1618 return NULL;
1619 }
1620
1621 struct ref *get_remote_ref(const struct ref *remote_refs, const char *name)
1622 {
1623 const struct ref *ref = find_ref_by_name_abbrev(remote_refs, name);
1624
1625 if (!ref)
1626 return NULL;
1627
1628 return copy_ref(ref);
1629 }
1630
1631 static struct ref *get_local_ref(const char *name)
1632 {
1633 if (!name || name[0] == '\0')
1634 return NULL;
1635
1636 if (!prefixcmp(name, "refs/"))
1637 return alloc_ref(name);
1638
1639 if (!prefixcmp(name, "heads/") ||
1640 !prefixcmp(name, "tags/") ||
1641 !prefixcmp(name, "remotes/"))
1642 return alloc_ref_with_prefix("refs/", 5, name);
1643
1644 return alloc_ref_with_prefix("refs/heads/", 11, name);
1645 }
1646
1647 int get_fetch_map(const struct ref *remote_refs,
1648 const struct refspec *refspec,
1649 struct ref ***tail,
1650 int missing_ok)
1651 {
1652 struct ref *ref_map, **rmp;
1653
1654 if (refspec->pattern) {
1655 ref_map = get_expanded_map(remote_refs, refspec);
1656 } else {
1657 const char *name = refspec->src[0] ? refspec->src : "HEAD";
1658
1659 if (refspec->exact_sha1) {
1660 ref_map = alloc_ref(name);
1661 get_sha1_hex(name, ref_map->old_sha1);
1662 } else {
1663 ref_map = get_remote_ref(remote_refs, name);
1664 }
1665 if (!missing_ok && !ref_map)
1666 die("Couldn't find remote ref %s", name);
1667 if (ref_map) {
1668 ref_map->peer_ref = get_local_ref(refspec->dst);
1669 if (ref_map->peer_ref && refspec->force)
1670 ref_map->peer_ref->force = 1;
1671 }
1672 }
1673
1674 for (rmp = &ref_map; *rmp; ) {
1675 if ((*rmp)->peer_ref) {
1676 if (prefixcmp((*rmp)->peer_ref->name, "refs/") ||
1677 check_refname_format((*rmp)->peer_ref->name, 0)) {
1678 struct ref *ignore = *rmp;
1679 error("* Ignoring funny ref '%s' locally",
1680 (*rmp)->peer_ref->name);
1681 *rmp = (*rmp)->next;
1682 free(ignore->peer_ref);
1683 free(ignore);
1684 continue;
1685 }
1686 }
1687 rmp = &((*rmp)->next);
1688 }
1689
1690 if (ref_map)
1691 tail_link_ref(ref_map, tail);
1692
1693 return 0;
1694 }
1695
1696 int resolve_remote_symref(struct ref *ref, struct ref *list)
1697 {
1698 if (!ref->symref)
1699 return 0;
1700 for (; list; list = list->next)
1701 if (!strcmp(ref->symref, list->name)) {
1702 hashcpy(ref->old_sha1, list->old_sha1);
1703 return 0;
1704 }
1705 return 1;
1706 }
1707
1708 static void unmark_and_free(struct commit_list *list, unsigned int mark)
1709 {
1710 while (list) {
1711 struct commit_list *temp = list;
1712 temp->item->object.flags &= ~mark;
1713 list = temp->next;
1714 free(temp);
1715 }
1716 }
1717
1718 int ref_newer(const unsigned char *new_sha1, const unsigned char *old_sha1)
1719 {
1720 struct object *o;
1721 struct commit *old, *new;
1722 struct commit_list *list, *used;
1723 int found = 0;
1724
1725 /*
1726 * Both new and old must be commit-ish and new is descendant of
1727 * old. Otherwise we require --force.
1728 */
1729 o = deref_tag(parse_object(old_sha1), NULL, 0);
1730 if (!o || o->type != OBJ_COMMIT)
1731 return 0;
1732 old = (struct commit *) o;
1733
1734 o = deref_tag(parse_object(new_sha1), NULL, 0);
1735 if (!o || o->type != OBJ_COMMIT)
1736 return 0;
1737 new = (struct commit *) o;
1738
1739 if (parse_commit(new) < 0)
1740 return 0;
1741
1742 used = list = NULL;
1743 commit_list_insert(new, &list);
1744 while (list) {
1745 new = pop_most_recent_commit(&list, TMP_MARK);
1746 commit_list_insert(new, &used);
1747 if (new == old) {
1748 found = 1;
1749 break;
1750 }
1751 }
1752 unmark_and_free(list, TMP_MARK);
1753 unmark_and_free(used, TMP_MARK);
1754 return found;
1755 }
1756
1757 /*
1758 * Compare a branch with its upstream, and save their differences (number
1759 * of commits) in *num_ours and *num_theirs.
1760 *
1761 * Return 0 if branch has no upstream (no base), -1 if upstream is missing
1762 * (with "gone" base), otherwise 1 (with base).
1763 */
1764 int stat_tracking_info(struct branch *branch, int *num_ours, int *num_theirs)
1765 {
1766 unsigned char sha1[20];
1767 struct commit *ours, *theirs;
1768 char symmetric[84];
1769 struct rev_info revs;
1770 const char *rev_argv[10], *base;
1771 int rev_argc;
1772
1773 /* Cannot stat unless we are marked to build on top of somebody else. */
1774 if (!branch ||
1775 !branch->merge || !branch->merge[0] || !branch->merge[0]->dst)
1776 return 0;
1777
1778 /* Cannot stat if what we used to build on no longer exists */
1779 base = branch->merge[0]->dst;
1780 if (read_ref(base, sha1))
1781 return -1;
1782 theirs = lookup_commit_reference(sha1);
1783 if (!theirs)
1784 return -1;
1785
1786 if (read_ref(branch->refname, sha1))
1787 return -1;
1788 ours = lookup_commit_reference(sha1);
1789 if (!ours)
1790 return -1;
1791
1792 /* are we the same? */
1793 if (theirs == ours) {
1794 *num_theirs = *num_ours = 0;
1795 return 1;
1796 }
1797
1798 /* Run "rev-list --left-right ours...theirs" internally... */
1799 rev_argc = 0;
1800 rev_argv[rev_argc++] = NULL;
1801 rev_argv[rev_argc++] = "--left-right";
1802 rev_argv[rev_argc++] = symmetric;
1803 rev_argv[rev_argc++] = "--";
1804 rev_argv[rev_argc] = NULL;
1805
1806 strcpy(symmetric, sha1_to_hex(ours->object.sha1));
1807 strcpy(symmetric + 40, "...");
1808 strcpy(symmetric + 43, sha1_to_hex(theirs->object.sha1));
1809
1810 init_revisions(&revs, NULL);
1811 setup_revisions(rev_argc, rev_argv, &revs, NULL);
1812 prepare_revision_walk(&revs);
1813
1814 /* ... and count the commits on each side. */
1815 *num_ours = 0;
1816 *num_theirs = 0;
1817 while (1) {
1818 struct commit *c = get_revision(&revs);
1819 if (!c)
1820 break;
1821 if (c->object.flags & SYMMETRIC_LEFT)
1822 (*num_ours)++;
1823 else
1824 (*num_theirs)++;
1825 }
1826
1827 /* clear object flags smudged by the above traversal */
1828 clear_commit_marks(ours, ALL_REV_FLAGS);
1829 clear_commit_marks(theirs, ALL_REV_FLAGS);
1830 return 1;
1831 }
1832
1833 /*
1834 * Return true when there is anything to report, otherwise false.
1835 */
1836 int format_tracking_info(struct branch *branch, struct strbuf *sb)
1837 {
1838 int ours, theirs;
1839 const char *base;
1840 int upstream_is_gone = 0;
1841
1842 switch (stat_tracking_info(branch, &ours, &theirs)) {
1843 case 0:
1844 /* no base */
1845 return 0;
1846 case -1:
1847 /* with "gone" base */
1848 upstream_is_gone = 1;
1849 break;
1850 default:
1851 /* with base */
1852 break;
1853 }
1854
1855 base = branch->merge[0]->dst;
1856 base = shorten_unambiguous_ref(base, 0);
1857 if (upstream_is_gone) {
1858 strbuf_addf(sb,
1859 _("Your branch is based on '%s', but the upstream is gone.\n"),
1860 base);
1861 if (advice_status_hints)
1862 strbuf_addf(sb,
1863 _(" (use \"git branch --unset-upstream\" to fixup)\n"));
1864 } else if (!ours && !theirs) {
1865 strbuf_addf(sb,
1866 _("Your branch is up-to-date with '%s'.\n"),
1867 base);
1868 } else if (!theirs) {
1869 strbuf_addf(sb,
1870 Q_("Your branch is ahead of '%s' by %d commit.\n",
1871 "Your branch is ahead of '%s' by %d commits.\n",
1872 ours),
1873 base, ours);
1874 if (advice_status_hints)
1875 strbuf_addf(sb,
1876 _(" (use \"git push\" to publish your local commits)\n"));
1877 } else if (!ours) {
1878 strbuf_addf(sb,
1879 Q_("Your branch is behind '%s' by %d commit, "
1880 "and can be fast-forwarded.\n",
1881 "Your branch is behind '%s' by %d commits, "
1882 "and can be fast-forwarded.\n",
1883 theirs),
1884 base, theirs);
1885 if (advice_status_hints)
1886 strbuf_addf(sb,
1887 _(" (use \"git pull\" to update your local branch)\n"));
1888 } else {
1889 strbuf_addf(sb,
1890 Q_("Your branch and '%s' have diverged,\n"
1891 "and have %d and %d different commit each, "
1892 "respectively.\n",
1893 "Your branch and '%s' have diverged,\n"
1894 "and have %d and %d different commits each, "
1895 "respectively.\n",
1896 theirs),
1897 base, ours, theirs);
1898 if (advice_status_hints)
1899 strbuf_addf(sb,
1900 _(" (use \"git pull\" to merge the remote branch into yours)\n"));
1901 }
1902 return 1;
1903 }
1904
1905 static int one_local_ref(const char *refname, const unsigned char *sha1, int flag, void *cb_data)
1906 {
1907 struct ref ***local_tail = cb_data;
1908 struct ref *ref;
1909 int len;
1910
1911 /* we already know it starts with refs/ to get here */
1912 if (check_refname_format(refname + 5, 0))
1913 return 0;
1914
1915 len = strlen(refname) + 1;
1916 ref = xcalloc(1, sizeof(*ref) + len);
1917 hashcpy(ref->new_sha1, sha1);
1918 memcpy(ref->name, refname, len);
1919 **local_tail = ref;
1920 *local_tail = &ref->next;
1921 return 0;
1922 }
1923
1924 struct ref *get_local_heads(void)
1925 {
1926 struct ref *local_refs = NULL, **local_tail = &local_refs;
1927 for_each_ref(one_local_ref, &local_tail);
1928 return local_refs;
1929 }
1930
1931 struct ref *guess_remote_head(const struct ref *head,
1932 const struct ref *refs,
1933 int all)
1934 {
1935 const struct ref *r;
1936 struct ref *list = NULL;
1937 struct ref **tail = &list;
1938
1939 if (!head)
1940 return NULL;
1941
1942 /*
1943 * Some transports support directly peeking at
1944 * where HEAD points; if that is the case, then
1945 * we don't have to guess.
1946 */
1947 if (head->symref)
1948 return copy_ref(find_ref_by_name(refs, head->symref));
1949
1950 /* If refs/heads/master could be right, it is. */
1951 if (!all) {
1952 r = find_ref_by_name(refs, "refs/heads/master");
1953 if (r && !hashcmp(r->old_sha1, head->old_sha1))
1954 return copy_ref(r);
1955 }
1956
1957 /* Look for another ref that points there */
1958 for (r = refs; r; r = r->next) {
1959 if (r != head &&
1960 !prefixcmp(r->name, "refs/heads/") &&
1961 !hashcmp(r->old_sha1, head->old_sha1)) {
1962 *tail = copy_ref(r);
1963 tail = &((*tail)->next);
1964 if (!all)
1965 break;
1966 }
1967 }
1968
1969 return list;
1970 }
1971
1972 struct stale_heads_info {
1973 struct string_list *ref_names;
1974 struct ref **stale_refs_tail;
1975 struct refspec *refs;
1976 int ref_count;
1977 };
1978
1979 static int get_stale_heads_cb(const char *refname,
1980 const unsigned char *sha1, int flags, void *cb_data)
1981 {
1982 struct stale_heads_info *info = cb_data;
1983 struct string_list matches = STRING_LIST_INIT_DUP;
1984 struct refspec query;
1985 int i, stale = 1;
1986 memset(&query, 0, sizeof(struct refspec));
1987 query.dst = (char *)refname;
1988
1989 query_refspecs_multiple(info->refs, info->ref_count, &query, &matches);
1990 if (matches.nr == 0)
1991 goto clean_exit; /* No matches */
1992
1993 /*
1994 * If we did find a suitable refspec and it's not a symref and
1995 * it's not in the list of refs that currently exist in that
1996 * remote, we consider it to be stale. In order to deal with
1997 * overlapping refspecs, we need to go over all of the
1998 * matching refs.
1999 */
2000 if (flags & REF_ISSYMREF)
2001 goto clean_exit;
2002
2003 for (i = 0; stale && i < matches.nr; i++)
2004 if (string_list_has_string(info->ref_names, matches.items[i].string))
2005 stale = 0;
2006
2007 if (stale) {
2008 struct ref *ref = make_linked_ref(refname, &info->stale_refs_tail);
2009 hashcpy(ref->new_sha1, sha1);
2010 }
2011
2012 clean_exit:
2013 string_list_clear(&matches, 0);
2014 return 0;
2015 }
2016
2017 struct ref *get_stale_heads(struct refspec *refs, int ref_count, struct ref *fetch_map)
2018 {
2019 struct ref *ref, *stale_refs = NULL;
2020 struct string_list ref_names = STRING_LIST_INIT_NODUP;
2021 struct stale_heads_info info;
2022 info.ref_names = &ref_names;
2023 info.stale_refs_tail = &stale_refs;
2024 info.refs = refs;
2025 info.ref_count = ref_count;
2026 for (ref = fetch_map; ref; ref = ref->next)
2027 string_list_append(&ref_names, ref->name);
2028 sort_string_list(&ref_names);
2029 for_each_ref(get_stale_heads_cb, &info);
2030 string_list_clear(&ref_names, 0);
2031 return stale_refs;
2032 }
2033
2034 /*
2035 * Compare-and-swap
2036 */
2037 void clear_cas_option(struct push_cas_option *cas)
2038 {
2039 int i;
2040
2041 for (i = 0; i < cas->nr; i++)
2042 free(cas->entry[i].refname);
2043 free(cas->entry);
2044 memset(cas, 0, sizeof(*cas));
2045 }
2046
2047 static struct push_cas *add_cas_entry(struct push_cas_option *cas,
2048 const char *refname,
2049 size_t refnamelen)
2050 {
2051 struct push_cas *entry;
2052 ALLOC_GROW(cas->entry, cas->nr + 1, cas->alloc);
2053 entry = &cas->entry[cas->nr++];
2054 memset(entry, 0, sizeof(*entry));
2055 entry->refname = xmemdupz(refname, refnamelen);
2056 return entry;
2057 }
2058
2059 int parse_push_cas_option(struct push_cas_option *cas, const char *arg, int unset)
2060 {
2061 const char *colon;
2062 struct push_cas *entry;
2063
2064 if (unset) {
2065 /* "--no-<option>" */
2066 clear_cas_option(cas);
2067 return 0;
2068 }
2069
2070 if (!arg) {
2071 /* just "--<option>" */
2072 cas->use_tracking_for_rest = 1;
2073 return 0;
2074 }
2075
2076 /* "--<option>=refname" or "--<option>=refname:value" */
2077 colon = strchrnul(arg, ':');
2078 entry = add_cas_entry(cas, arg, colon - arg);
2079 if (!*colon)
2080 entry->use_tracking = 1;
2081 else if (get_sha1(colon + 1, entry->expect))
2082 return error("cannot parse expected object name '%s'", colon + 1);
2083 return 0;
2084 }
2085
2086 int parseopt_push_cas_option(const struct option *opt, const char *arg, int unset)
2087 {
2088 return parse_push_cas_option(opt->value, arg, unset);
2089 }
2090
2091 int is_empty_cas(const struct push_cas_option *cas)
2092 {
2093 return !cas->use_tracking_for_rest && !cas->nr;
2094 }
2095
2096 /*
2097 * Look at remote.fetch refspec and see if we have a remote
2098 * tracking branch for the refname there. Fill its current
2099 * value in sha1[].
2100 * If we cannot do so, return negative to signal an error.
2101 */
2102 static int remote_tracking(struct remote *remote, const char *refname,
2103 unsigned char sha1[20])
2104 {
2105 char *dst;
2106
2107 dst = apply_refspecs(remote->fetch, remote->fetch_refspec_nr, refname);
2108 if (!dst)
2109 return -1; /* no tracking ref for refname at remote */
2110 if (read_ref(dst, sha1))
2111 return -1; /* we know what the tracking ref is but we cannot read it */
2112 return 0;
2113 }
2114
2115 static void apply_cas(struct push_cas_option *cas,
2116 struct remote *remote,
2117 struct ref *ref)
2118 {
2119 int i;
2120
2121 /* Find an explicit --<option>=<name>[:<value>] entry */
2122 for (i = 0; i < cas->nr; i++) {
2123 struct push_cas *entry = &cas->entry[i];
2124 if (!refname_match(entry->refname, ref->name, ref_rev_parse_rules))
2125 continue;
2126 ref->expect_old_sha1 = 1;
2127 if (!entry->use_tracking)
2128 hashcpy(ref->old_sha1_expect, cas->entry[i].expect);
2129 else if (remote_tracking(remote, ref->name, ref->old_sha1_expect))
2130 ref->expect_old_no_trackback = 1;
2131 return;
2132 }
2133
2134 /* Are we using "--<option>" to cover all? */
2135 if (!cas->use_tracking_for_rest)
2136 return;
2137
2138 ref->expect_old_sha1 = 1;
2139 if (remote_tracking(remote, ref->name, ref->old_sha1_expect))
2140 ref->expect_old_no_trackback = 1;
2141 }
2142
2143 void apply_push_cas(struct push_cas_option *cas,
2144 struct remote *remote,
2145 struct ref *remote_refs)
2146 {
2147 struct ref *ref;
2148 for (ref = remote_refs; ref; ref = ref->next)
2149 apply_cas(cas, remote, ref);
2150 }
The Best VCS Around