b6586c089ff7d44321a08ec04e18d169fbe425cc
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"
11enum map_direction { FROM_SRC, FROM_DST };
13static struct refspec s_tag_refspec = {
15 0,
16 1,
17 0,
18 0,
19 "refs/tags/*",
20 "refs/tags/*"
21};
22const struct refspec *tag_refspec = &s_tag_refspec;
24struct counted_string {
26 size_t len;
27 const char *s;
28};
29struct 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};
36struct rewrites {
37 struct rewrite **rewrite;
38 int rewrite_alloc;
39 int rewrite_nr;
40};
41static struct remote **remotes;
43static int remotes_alloc;
44static int remotes_nr;
45static struct branch **branches;
47static int branches_alloc;
48static int branches_nr;
49static struct branch *current_branch;
51static const char *default_remote_name;
52static const char *pushremote_name;
53static int explicit_default_remote_name;
54static struct rewrites rewrites;
56static struct rewrites rewrites_push;
57#define BUF_SIZE (2048)
59static char buffer[BUF_SIZE];
60static int valid_remote(const struct remote *remote)
62{
63 return (!!remote->url) || (!!remote->foreign_vcs);
64}
65static 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 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 (starts_with(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 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}
96static 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}
104static 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}
112static 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}
118static 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}
124static 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}
131static 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}
137static struct remote *make_remote(const char *name, int len)
139{
140 struct remote *ret;
141 int i;
142 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 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}
160static 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}
167static struct branch *make_branch(const char *name, int len)
169{
170 struct branch *ret;
171 int i;
172 char *refname;
173 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 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 return ret;
194}
195static struct rewrite *make_rewrite(struct rewrites *r, const char *base, int len)
197{
198 struct rewrite *ret;
199 int i;
200 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 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}
222static 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}
230static void read_remotes_file(struct remote *remote)
232{
233 FILE *f = fopen(git_path("remotes/%s", remote->name), "r");
234 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 if (starts_with(buffer, "URL:")) {
243 value_list = 0;
244 s = buffer + 4;
245 } else if (starts_with(buffer, "Push:")) {
246 value_list = 1;
247 s = buffer + 5;
248 } else if (starts_with(buffer, "Pull:")) {
249 value_list = 2;
250 s = buffer + 5;
251 } else
252 continue;
253 while (isspace(*s))
255 s++;
256 if (!*s)
257 continue;
258 p = s + strlen(s);
260 while (isspace(p[-1]))
261 *--p = 0;
262 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}
277static 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 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 /*
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 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}
333static 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 (starts_with(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 (starts_with(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 if (!starts_with(key, "remote."))
384 return 0;
385 name = key + 7;
386 /* Handle remote.* variables */
388 if (!strcmp(name, "pushdefault"))
389 return git_config_string(&pushremote_name, key, value);
390 /* 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}
459static 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}
478static 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 starts_with(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/*
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 */
504static void free_refspecs(struct refspec *refspec, int nr_refspec)
505{
506 int i;
507 if (!refspec)
509 return;
510 for (i = 0; i < nr_refspec; i++) {
512 free(refspec[i].src);
513 free(refspec[i].dst);
514 }
515 free(refspec);
516}
517static 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 for (i = 0; i < nr_refspec; i++) {
524 size_t llen;
525 int is_glob;
526 const char *lhs, *rhs;
527 int flags;
528 is_glob = 0;
530 lhs = refspec[i];
532 if (*lhs == '+') {
533 rs[i].force = 1;
534 lhs++;
535 }
536 rhs = strrchr(lhs, ':');
538 /*
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 if (rhs) {
549 size_t rlen = strlen(++rhs);
550 is_glob = (1 <= rlen && strchr(rhs, '*'));
551 rs[i].dst = xstrndup(rhs, rlen);
552 }
553 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 rs[i].pattern = is_glob;
564 rs[i].src = xstrndup(lhs, llen);
565 flags = REFNAME_ALLOW_ONELEVEL | (is_glob ? REFNAME_REFSPEC_PATTERN : 0);
566 if (fetch) {
568 unsigned char unused[40];
569 /* 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 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}
636int valid_fetch_refspec(const char *fetch_refspec_str)
638{
639 struct refspec *refspec;
640 refspec = parse_refspec_internal(1, &fetch_refspec_str, 1, 1);
642 free_refspecs(refspec, 1);
643 return !!refspec;
644}
645struct refspec *parse_fetch_refspec(int nr_refspec, const char **refspec)
647{
648 return parse_refspec_internal(nr_refspec, refspec, 1, 0);
649}
650static struct refspec *parse_push_refspec(int nr_refspec, const char **refspec)
652{
653 return parse_refspec_internal(nr_refspec, refspec, 0, 0);
654}
655void 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}
665static 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}
672static struct remote *remote_get_1(const char *name, const char *pushremote_name)
674{
675 struct remote *ret;
676 int name_given = 0;
677 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 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}
705struct remote *remote_get(const char *name)
707{
708 read_config();
709 return remote_get_1(name, NULL);
710}
711struct remote *pushremote_get(const char *name)
713{
714 read_config();
715 return remote_get_1(name, pushremote_name);
716}
717int remote_is_configured(const char *name)
719{
720 int i;
721 read_config();
722 for (i = 0; i < remotes_nr; i++)
724 if (!strcmp(name, remotes[i]->name))
725 return 1;
726 return 0;
727}
728int 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}
747static void handle_duplicate(struct ref *ref1, struct ref *ref2)
749{
750 if (strcmp(ref1->name, ref2->name)) {
751 if (ref1->fetch_head_status != FETCH_HEAD_IGNORE &&
752 ref2->fetch_head_status != FETCH_HEAD_IGNORE) {
753 die(_("Cannot fetch both %s and %s to %s"),
754 ref1->name, ref2->name, ref2->peer_ref->name);
755 } else if (ref1->fetch_head_status != FETCH_HEAD_IGNORE &&
756 ref2->fetch_head_status == FETCH_HEAD_IGNORE) {
757 warning(_("%s usually tracks %s, not %s"),
758 ref2->peer_ref->name, ref2->name, ref1->name);
759 } else if (ref1->fetch_head_status == FETCH_HEAD_IGNORE &&
760 ref2->fetch_head_status == FETCH_HEAD_IGNORE) {
761 die(_("%s tracks both %s and %s"),
762 ref2->peer_ref->name, ref1->name, ref2->name);
763 } else {
764 /*
765 * This last possibility doesn't occur because
766 * FETCH_HEAD_IGNORE entries always appear at
767 * the end of the list.
768 */
769 die(_("Internal error"));
770 }
771 }
772 free(ref2->peer_ref);
773 free(ref2);
774}
775struct ref *ref_remove_duplicates(struct ref *ref_map)
777{
778 struct string_list refs = STRING_LIST_INIT_NODUP;
779 struct ref *retval = NULL;
780 struct ref **p = &retval;
781 while (ref_map) {
783 struct ref *ref = ref_map;
784 ref_map = ref_map->next;
786 ref->next = NULL;
787 if (!ref->peer_ref) {
789 *p = ref;
790 p = &ref->next;
791 } else {
792 struct string_list_item *item =
793 string_list_insert(&refs, ref->peer_ref->name);
794 if (item->util) {
796 /* Entry already existed */
797 handle_duplicate((struct ref *)item->util, ref);
798 } else {
799 *p = ref;
800 p = &ref->next;
801 item->util = ref;
802 }
803 }
804 }
805 string_list_clear(&refs, 0);
807 return retval;
808}
809int remote_has_url(struct remote *remote, const char *url)
811{
812 int i;
813 for (i = 0; i < remote->url_nr; i++) {
814 if (!strcmp(remote->url[i], url))
815 return 1;
816 }
817 return 0;
818}
819static int match_name_with_pattern(const char *key, const char *name,
821 const char *value, char **result)
822{
823 const char *kstar = strchr(key, '*');
824 size_t klen;
825 size_t ksuffixlen;
826 size_t namelen;
827 int ret;
828 if (!kstar)
829 die("Key '%s' of pattern had no '*'", key);
830 klen = kstar - key;
831 ksuffixlen = strlen(kstar + 1);
832 namelen = strlen(name);
833 ret = !strncmp(name, key, klen) && namelen >= klen + ksuffixlen &&
834 !memcmp(name + namelen - ksuffixlen, kstar + 1, ksuffixlen);
835 if (ret && value) {
836 const char *vstar = strchr(value, '*');
837 size_t vlen;
838 size_t vsuffixlen;
839 if (!vstar)
840 die("Value '%s' of pattern has no '*'", value);
841 vlen = vstar - value;
842 vsuffixlen = strlen(vstar + 1);
843 *result = xmalloc(vlen + vsuffixlen +
844 strlen(name) -
845 klen - ksuffixlen + 1);
846 strncpy(*result, value, vlen);
847 strncpy(*result + vlen,
848 name + klen, namelen - klen - ksuffixlen);
849 strcpy(*result + vlen + namelen - klen - ksuffixlen,
850 vstar + 1);
851 }
852 return ret;
853}
854int query_refspecs(struct refspec *refs, int ref_count, struct refspec *query)
856{
857 int i;
858 int find_src = !query->src;
859 const char *needle = find_src ? query->dst : query->src;
860 char **result = find_src ? &query->src : &query->dst;
861 if (find_src && !query->dst)
863 return error("query_refspecs: need either src or dst");
864 for (i = 0; i < ref_count; i++) {
866 struct refspec *refspec = &refs[i];
867 const char *key = find_src ? refspec->dst : refspec->src;
868 const char *value = find_src ? refspec->src : refspec->dst;
869 if (!refspec->dst)
871 continue;
872 if (refspec->pattern) {
873 if (match_name_with_pattern(key, needle, value, result)) {
874 query->force = refspec->force;
875 return 0;
876 }
877 } else if (!strcmp(needle, key)) {
878 *result = xstrdup(value);
879 query->force = refspec->force;
880 return 0;
881 }
882 }
883 return -1;
884}
885char *apply_refspecs(struct refspec *refspecs, int nr_refspec,
887 const char *name)
888{
889 struct refspec query;
890 memset(&query, 0, sizeof(struct refspec));
892 query.src = (char *)name;
893 if (query_refspecs(refspecs, nr_refspec, &query))
895 return NULL;
896 return query.dst;
898}
899int remote_find_tracking(struct remote *remote, struct refspec *refspec)
901{
902 return query_refspecs(remote->fetch, remote->fetch_refspec_nr, refspec);
903}
904static struct ref *alloc_ref_with_prefix(const char *prefix, size_t prefixlen,
906 const char *name)
907{
908 size_t len = strlen(name);
909 struct ref *ref = xcalloc(1, sizeof(struct ref) + prefixlen + len + 1);
910 memcpy(ref->name, prefix, prefixlen);
911 memcpy(ref->name + prefixlen, name, len);
912 return ref;
913}
914struct ref *alloc_ref(const char *name)
916{
917 return alloc_ref_with_prefix("", 0, name);
918}
919struct ref *copy_ref(const struct ref *ref)
921{
922 struct ref *cpy;
923 size_t len;
924 if (!ref)
925 return NULL;
926 len = strlen(ref->name);
927 cpy = xmalloc(sizeof(struct ref) + len + 1);
928 memcpy(cpy, ref, sizeof(struct ref) + len + 1);
929 cpy->next = NULL;
930 cpy->symref = ref->symref ? xstrdup(ref->symref) : NULL;
931 cpy->remote_status = ref->remote_status ? xstrdup(ref->remote_status) : NULL;
932 cpy->peer_ref = copy_ref(ref->peer_ref);
933 return cpy;
934}
935struct ref *copy_ref_list(const struct ref *ref)
937{
938 struct ref *ret = NULL;
939 struct ref **tail = &ret;
940 while (ref) {
941 *tail = copy_ref(ref);
942 ref = ref->next;
943 tail = &((*tail)->next);
944 }
945 return ret;
946}
947static void free_ref(struct ref *ref)
949{
950 if (!ref)
951 return;
952 free_ref(ref->peer_ref);
953 free(ref->remote_status);
954 free(ref->symref);
955 free(ref);
956}
957void free_refs(struct ref *ref)
959{
960 struct ref *next;
961 while (ref) {
962 next = ref->next;
963 free_ref(ref);
964 ref = next;
965 }
966}
967int ref_compare_name(const void *va, const void *vb)
969{
970 const struct ref *a = va, *b = vb;
971 return strcmp(a->name, b->name);
972}
973static void *ref_list_get_next(const void *a)
975{
976 return ((const struct ref *)a)->next;
977}
978static void ref_list_set_next(void *a, void *next)
980{
981 ((struct ref *)a)->next = next;
982}
983void sort_ref_list(struct ref **l, int (*cmp)(const void *, const void *))
985{
986 *l = llist_mergesort(*l, ref_list_get_next, ref_list_set_next, cmp);
987}
988int count_refspec_match(const char *pattern,
990 struct ref *refs,
991 struct ref **matched_ref)
992{
993 int patlen = strlen(pattern);
994 struct ref *matched_weak = NULL;
995 struct ref *matched = NULL;
996 int weak_match = 0;
997 int match = 0;
998 for (weak_match = match = 0; refs; refs = refs->next) {
1000 char *name = refs->name;
1001 int namelen = strlen(name);
1002 if (!refname_match(pattern, name))
1004 continue;
1005 /* A match is "weak" if it is with refs outside
1007 * heads or tags, and did not specify the pattern
1008 * in full (e.g. "refs/remotes/origin/master") or at
1009 * least from the toplevel (e.g. "remotes/origin/master");
1010 * otherwise "git push $URL master" would result in
1011 * ambiguity between remotes/origin/master and heads/master
1012 * at the remote site.
1013 */
1014 if (namelen != patlen &&
1015 patlen != namelen - 5 &&
1016 !starts_with(name, "refs/heads/") &&
1017 !starts_with(name, "refs/tags/")) {
1018 /* We want to catch the case where only weak
1019 * matches are found and there are multiple
1020 * matches, and where more than one strong
1021 * matches are found, as ambiguous. One
1022 * strong match with zero or more weak matches
1023 * are acceptable as a unique match.
1024 */
1025 matched_weak = refs;
1026 weak_match++;
1027 }
1028 else {
1029 matched = refs;
1030 match++;
1031 }
1032 }
1033 if (!matched) {
1034 if (matched_ref)
1035 *matched_ref = matched_weak;
1036 return weak_match;
1037 }
1038 else {
1039 if (matched_ref)
1040 *matched_ref = matched;
1041 return match;
1042 }
1043}
1044static void tail_link_ref(struct ref *ref, struct ref ***tail)
1046{
1047 **tail = ref;
1048 while (ref->next)
1049 ref = ref->next;
1050 *tail = &ref->next;
1051}
1052static struct ref *alloc_delete_ref(void)
1054{
1055 struct ref *ref = alloc_ref("(delete)");
1056 hashclr(ref->new_sha1);
1057 return ref;
1058}
1059static int try_explicit_object_name(const char *name,
1061 struct ref **match)
1062{
1063 unsigned char sha1[20];
1064 if (!*name) {
1066 if (match)
1067 *match = alloc_delete_ref();
1068 return 0;
1069 }
1070 if (get_sha1(name, sha1))
1072 return -1;
1073 if (match) {
1075 *match = alloc_ref(name);
1076 hashcpy((*match)->new_sha1, sha1);
1077 }
1078 return 0;
1079}
1080static struct ref *make_linked_ref(const char *name, struct ref ***tail)
1082{
1083 struct ref *ret = alloc_ref(name);
1084 tail_link_ref(ret, tail);
1085 return ret;
1086}
1087static char *guess_ref(const char *name, struct ref *peer)
1089{
1090 struct strbuf buf = STRBUF_INIT;
1091 unsigned char sha1[20];
1092 const char *r = resolve_ref_unsafe(peer->name, sha1, 1, NULL);
1094 if (!r)
1095 return NULL;
1096 if (starts_with(r, "refs/heads/"))
1098 strbuf_addstr(&buf, "refs/heads/");
1099 else if (starts_with(r, "refs/tags/"))
1100 strbuf_addstr(&buf, "refs/tags/");
1101 else
1102 return NULL;
1103 strbuf_addstr(&buf, name);
1105 return strbuf_detach(&buf, NULL);
1106}
1107static int match_explicit_lhs(struct ref *src,
1109 struct refspec *rs,
1110 struct ref **match,
1111 int *allocated_match)
1112{
1113 switch (count_refspec_match(rs->src, src, match)) {
1114 case 1:
1115 if (allocated_match)
1116 *allocated_match = 0;
1117 return 0;
1118 case 0:
1119 /* The source could be in the get_sha1() format
1120 * not a reference name. :refs/other is a
1121 * way to delete 'other' ref at the remote end.
1122 */
1123 if (try_explicit_object_name(rs->src, match) < 0)
1124 return error("src refspec %s does not match any.", rs->src);
1125 if (allocated_match)
1126 *allocated_match = 1;
1127 return 0;
1128 default:
1129 return error("src refspec %s matches more than one.", rs->src);
1130 }
1131}
1132static int match_explicit(struct ref *src, struct ref *dst,
1134 struct ref ***dst_tail,
1135 struct refspec *rs)
1136{
1137 struct ref *matched_src, *matched_dst;
1138 int allocated_src;
1139 const char *dst_value = rs->dst;
1141 char *dst_guess;
1142 if (rs->pattern || rs->matching)
1144 return 0;
1145 matched_src = matched_dst = NULL;
1147 if (match_explicit_lhs(src, rs, &matched_src, &allocated_src) < 0)
1148 return -1;
1149 if (!dst_value) {
1151 unsigned char sha1[20];
1152 int flag;
1153 dst_value = resolve_ref_unsafe(matched_src->name, sha1, 1, &flag);
1155 if (!dst_value ||
1156 ((flag & REF_ISSYMREF) &&
1157 !starts_with(dst_value, "refs/heads/")))
1158 die("%s cannot be resolved to branch.",
1159 matched_src->name);
1160 }
1161 switch (count_refspec_match(dst_value, dst, &matched_dst)) {
1163 case 1:
1164 break;
1165 case 0:
1166 if (!memcmp(dst_value, "refs/", 5))
1167 matched_dst = make_linked_ref(dst_value, dst_tail);
1168 else if (is_null_sha1(matched_src->new_sha1))
1169 error("unable to delete '%s': remote ref does not exist",
1170 dst_value);
1171 else if ((dst_guess = guess_ref(dst_value, matched_src)))
1172 matched_dst = make_linked_ref(dst_guess, dst_tail);
1173 else
1174 error("unable to push to unqualified destination: %s\n"
1175 "The destination refspec neither matches an "
1176 "existing ref on the remote nor\n"
1177 "begins with refs/, and we are unable to "
1178 "guess a prefix based on the source ref.",
1179 dst_value);
1180 break;
1181 default:
1182 matched_dst = NULL;
1183 error("dst refspec %s matches more than one.",
1184 dst_value);
1185 break;
1186 }
1187 if (!matched_dst)
1188 return -1;
1189 if (matched_dst->peer_ref)
1190 return error("dst ref %s receives from more than one src.",
1191 matched_dst->name);
1192 else {
1193 matched_dst->peer_ref = allocated_src ?
1194 matched_src :
1195 copy_ref(matched_src);
1196 matched_dst->force = rs->force;
1197 }
1198 return 0;
1199}
1200static int match_explicit_refs(struct ref *src, struct ref *dst,
1202 struct ref ***dst_tail, struct refspec *rs,
1203 int rs_nr)
1204{
1205 int i, errs;
1206 for (i = errs = 0; i < rs_nr; i++)
1207 errs += match_explicit(src, dst, dst_tail, &rs[i]);
1208 return errs;
1209}
1210static char *get_ref_match(const struct refspec *rs, int rs_nr, const struct ref *ref,
1212 int send_mirror, int direction, const struct refspec **ret_pat)
1213{
1214 const struct refspec *pat;
1215 char *name;
1216 int i;
1217 int matching_refs = -1;
1218 for (i = 0; i < rs_nr; i++) {
1219 if (rs[i].matching &&
1220 (matching_refs == -1 || rs[i].force)) {
1221 matching_refs = i;
1222 continue;
1223 }
1224 if (rs[i].pattern) {
1226 const char *dst_side = rs[i].dst ? rs[i].dst : rs[i].src;
1227 int match;
1228 if (direction == FROM_SRC)
1229 match = match_name_with_pattern(rs[i].src, ref->name, dst_side, &name);
1230 else
1231 match = match_name_with_pattern(dst_side, ref->name, rs[i].src, &name);
1232 if (match) {
1233 matching_refs = i;
1234 break;
1235 }
1236 }
1237 }
1238 if (matching_refs == -1)
1239 return NULL;
1240 pat = rs + matching_refs;
1242 if (pat->matching) {
1243 /*
1244 * "matching refs"; traditionally we pushed everything
1245 * including refs outside refs/heads/ hierarchy, but
1246 * that does not make much sense these days.
1247 */
1248 if (!send_mirror && !starts_with(ref->name, "refs/heads/"))
1249 return NULL;
1250 name = xstrdup(ref->name);
1251 }
1252 if (ret_pat)
1253 *ret_pat = pat;
1254 return name;
1255}
1256static struct ref **tail_ref(struct ref **head)
1258{
1259 struct ref **tail = head;
1260 while (*tail)
1261 tail = &((*tail)->next);
1262 return tail;
1263}
1264struct tips {
1266 struct commit **tip;
1267 int nr, alloc;
1268};
1269static void add_to_tips(struct tips *tips, const unsigned char *sha1)
1271{
1272 struct commit *commit;
1273 if (is_null_sha1(sha1))
1275 return;
1276 commit = lookup_commit_reference_gently(sha1, 1);
1277 if (!commit || (commit->object.flags & TMP_MARK))
1278 return;
1279 commit->object.flags |= TMP_MARK;
1280 ALLOC_GROW(tips->tip, tips->nr + 1, tips->alloc);
1281 tips->tip[tips->nr++] = commit;
1282}
1283static void add_missing_tags(struct ref *src, struct ref **dst, struct ref ***dst_tail)
1285{
1286 struct string_list dst_tag = STRING_LIST_INIT_NODUP;
1287 struct string_list src_tag = STRING_LIST_INIT_NODUP;
1288 struct string_list_item *item;
1289 struct ref *ref;
1290 struct tips sent_tips;
1291 /*
1293 * Collect everything we know they would have at the end of
1294 * this push, and collect all tags they have.
1295 */
1296 memset(&sent_tips, 0, sizeof(sent_tips));
1297 for (ref = *dst; ref; ref = ref->next) {
1298 if (ref->peer_ref &&
1299 !is_null_sha1(ref->peer_ref->new_sha1))
1300 add_to_tips(&sent_tips, ref->peer_ref->new_sha1);
1301 else
1302 add_to_tips(&sent_tips, ref->old_sha1);
1303 if (starts_with(ref->name, "refs/tags/"))
1304 string_list_append(&dst_tag, ref->name);
1305 }
1306 clear_commit_marks_many(sent_tips.nr, sent_tips.tip, TMP_MARK);
1307 sort_string_list(&dst_tag);
1309 /* Collect tags they do not have. */
1311 for (ref = src; ref; ref = ref->next) {
1312 if (!starts_with(ref->name, "refs/tags/"))
1313 continue; /* not a tag */
1314 if (string_list_has_string(&dst_tag, ref->name))
1315 continue; /* they already have it */
1316 if (sha1_object_info(ref->new_sha1, NULL) != OBJ_TAG)
1317 continue; /* be conservative */
1318 item = string_list_append(&src_tag, ref->name);
1319 item->util = ref;
1320 }
1321 string_list_clear(&dst_tag, 0);
1322 /*
1324 * At this point, src_tag lists tags that are missing from
1325 * dst, and sent_tips lists the tips we are pushing or those
1326 * that we know they already have. An element in the src_tag
1327 * that is an ancestor of any of the sent_tips needs to be
1328 * sent to the other side.
1329 */
1330 if (sent_tips.nr) {
1331 for_each_string_list_item(item, &src_tag) {
1332 struct ref *ref = item->util;
1333 struct ref *dst_ref;
1334 struct commit *commit;
1335 if (is_null_sha1(ref->new_sha1))
1337 continue;
1338 commit = lookup_commit_reference_gently(ref->new_sha1, 1);
1339 if (!commit)
1340 /* not pushing a commit, which is not an error */
1341 continue;
1342 /*
1344 * Is this tag, which they do not have, reachable from
1345 * any of the commits we are sending?
1346 */
1347 if (!in_merge_bases_many(commit, sent_tips.nr, sent_tips.tip))
1348 continue;
1349 /* Add it in */
1351 dst_ref = make_linked_ref(ref->name, dst_tail);
1352 hashcpy(dst_ref->new_sha1, ref->new_sha1);
1353 dst_ref->peer_ref = copy_ref(ref);
1354 }
1355 }
1356 string_list_clear(&src_tag, 0);
1357 free(sent_tips.tip);
1358}
1359struct ref *find_ref_by_name(const struct ref *list, const char *name)
1361{
1362 for ( ; list; list = list->next)
1363 if (!strcmp(list->name, name))
1364 return (struct ref *)list;
1365 return NULL;
1366}
1367static void prepare_ref_index(struct string_list *ref_index, struct ref *ref)
1369{
1370 for ( ; ref; ref = ref->next)
1371 string_list_append_nodup(ref_index, ref->name)->util = ref;
1372 sort_string_list(ref_index);
1374}
1375/*
1377 * Given the set of refs the local repository has, the set of refs the
1378 * remote repository has, and the refspec used for push, determine
1379 * what remote refs we will update and with what value by setting
1380 * peer_ref (which object is being pushed) and force (if the push is
1381 * forced) in elements of "dst". The function may add new elements to
1382 * dst (e.g. pushing to a new branch, done in match_explicit_refs).
1383 */
1384int match_push_refs(struct ref *src, struct ref **dst,
1385 int nr_refspec, const char **refspec, int flags)
1386{
1387 struct refspec *rs;
1388 int send_all = flags & MATCH_REFS_ALL;
1389 int send_mirror = flags & MATCH_REFS_MIRROR;
1390 int send_prune = flags & MATCH_REFS_PRUNE;
1391 int errs;
1392 static const char *default_refspec[] = { ":", NULL };
1393 struct ref *ref, **dst_tail = tail_ref(dst);
1394 struct string_list dst_ref_index = STRING_LIST_INIT_NODUP;
1395 if (!nr_refspec) {
1397 nr_refspec = 1;
1398 refspec = default_refspec;
1399 }
1400 rs = parse_push_refspec(nr_refspec, (const char **) refspec);
1401 errs = match_explicit_refs(src, *dst, &dst_tail, rs, nr_refspec);
1402 /* pick the remainder */
1404 for (ref = src; ref; ref = ref->next) {
1405 struct string_list_item *dst_item;
1406 struct ref *dst_peer;
1407 const struct refspec *pat = NULL;
1408 char *dst_name;
1409 dst_name = get_ref_match(rs, nr_refspec, ref, send_mirror, FROM_SRC, &pat);
1411 if (!dst_name)
1412 continue;
1413 if (!dst_ref_index.nr)
1415 prepare_ref_index(&dst_ref_index, *dst);
1416 dst_item = string_list_lookup(&dst_ref_index, dst_name);
1418 dst_peer = dst_item ? dst_item->util : NULL;
1419 if (dst_peer) {
1420 if (dst_peer->peer_ref)
1421 /* We're already sending something to this ref. */
1422 goto free_name;
1423 } else {
1424 if (pat->matching && !(send_all || send_mirror))
1425 /*
1426 * Remote doesn't have it, and we have no
1427 * explicit pattern, and we don't have
1428 * --all nor --mirror.
1429 */
1430 goto free_name;
1431 /* Create a new one and link it */
1433 dst_peer = make_linked_ref(dst_name, &dst_tail);
1434 hashcpy(dst_peer->new_sha1, ref->new_sha1);
1435 string_list_insert(&dst_ref_index,
1436 dst_peer->name)->util = dst_peer;
1437 }
1438 dst_peer->peer_ref = copy_ref(ref);
1439 dst_peer->force = pat->force;
1440 free_name:
1441 free(dst_name);
1442 }
1443 string_list_clear(&dst_ref_index, 0);
1445 if (flags & MATCH_REFS_FOLLOW_TAGS)
1447 add_missing_tags(src, dst, &dst_tail);
1448 if (send_prune) {
1450 struct string_list src_ref_index = STRING_LIST_INIT_NODUP;
1451 /* check for missing refs on the remote */
1452 for (ref = *dst; ref; ref = ref->next) {
1453 char *src_name;
1454 if (ref->peer_ref)
1456 /* We're already sending something to this ref. */
1457 continue;
1458 src_name = get_ref_match(rs, nr_refspec, ref, send_mirror, FROM_DST, NULL);
1460 if (src_name) {
1461 if (!src_ref_index.nr)
1462 prepare_ref_index(&src_ref_index, src);
1463 if (!string_list_has_string(&src_ref_index,
1464 src_name))
1465 ref->peer_ref = alloc_delete_ref();
1466 free(src_name);
1467 }
1468 }
1469 string_list_clear(&src_ref_index, 0);
1470 }
1471 if (errs)
1472 return -1;
1473 return 0;
1474}
1475void set_ref_status_for_push(struct ref *remote_refs, int send_mirror,
1477 int force_update)
1478{
1479 struct ref *ref;
1480 for (ref = remote_refs; ref; ref = ref->next) {
1482 int force_ref_update = ref->force || force_update;
1483 int reject_reason = 0;
1484 if (ref->peer_ref)
1486 hashcpy(ref->new_sha1, ref->peer_ref->new_sha1);
1487 else if (!send_mirror)
1488 continue;
1489 ref->deletion = is_null_sha1(ref->new_sha1);
1491 if (!ref->deletion &&
1492 !hashcmp(ref->old_sha1, ref->new_sha1)) {
1493 ref->status = REF_STATUS_UPTODATE;
1494 continue;
1495 }
1496 /*
1498 * Bypass the usual "must fast-forward" check but
1499 * replace it with a weaker "the old value must be
1500 * this value we observed". If the remote ref has
1501 * moved and is now different from what we expect,
1502 * reject any push.
1503 *
1504 * It also is an error if the user told us to check
1505 * with the remote-tracking branch to find the value
1506 * to expect, but we did not have such a tracking
1507 * branch.
1508 */
1509 if (ref->expect_old_sha1) {
1510 if (ref->expect_old_no_trackback ||
1511 hashcmp(ref->old_sha1, ref->old_sha1_expect))
1512 reject_reason = REF_STATUS_REJECT_STALE;
1513 }
1514 /*
1516 * The usual "must fast-forward" rules.
1517 *
1518 * Decide whether an individual refspec A:B can be
1519 * pushed. The push will succeed if any of the
1520 * following are true:
1521 *
1522 * (1) the remote reference B does not exist
1523 *
1524 * (2) the remote reference B is being removed (i.e.,
1525 * pushing :B where no source is specified)
1526 *
1527 * (3) the destination is not under refs/tags/, and
1528 * if the old and new value is a commit, the new
1529 * is a descendant of the old.
1530 *
1531 * (4) it is forced using the +A:B notation, or by
1532 * passing the --force argument
1533 */
1534 else if (!ref->deletion && !is_null_sha1(ref->old_sha1)) {
1536 if (starts_with(ref->name, "refs/tags/"))
1537 reject_reason = REF_STATUS_REJECT_ALREADY_EXISTS;
1538 else if (!has_sha1_file(ref->old_sha1))
1539 reject_reason = REF_STATUS_REJECT_FETCH_FIRST;
1540 else if (!lookup_commit_reference_gently(ref->old_sha1, 1) ||
1541 !lookup_commit_reference_gently(ref->new_sha1, 1))
1542 reject_reason = REF_STATUS_REJECT_NEEDS_FORCE;
1543 else if (!ref_newer(ref->new_sha1, ref->old_sha1))
1544 reject_reason = REF_STATUS_REJECT_NONFASTFORWARD;
1545 }
1546 /*
1548 * "--force" will defeat any rejection implemented
1549 * by the rules above.
1550 */
1551 if (!force_ref_update)
1552 ref->status = reject_reason;
1553 else if (reject_reason)
1554 ref->forced_update = 1;
1555 }
1556}
1557struct branch *branch_get(const char *name)
1559{
1560 struct branch *ret;
1561 read_config();
1563 if (!name || !*name || !strcmp(name, "HEAD"))
1564 ret = current_branch;
1565 else
1566 ret = make_branch(name, 0);
1567 if (ret && ret->remote_name) {
1568 ret->remote = remote_get(ret->remote_name);
1569 if (ret->merge_nr) {
1570 int i;
1571 ret->merge = xcalloc(ret->merge_nr, sizeof(*ret->merge));
1572 for (i = 0; i < ret->merge_nr; i++) {
1573 ret->merge[i] = xcalloc(1, sizeof(**ret->merge));
1574 ret->merge[i]->src = xstrdup(ret->merge_name[i]);
1575 if (remote_find_tracking(ret->remote, ret->merge[i])
1576 && !strcmp(ret->remote_name, "."))
1577 ret->merge[i]->dst = xstrdup(ret->merge_name[i]);
1578 }
1579 }
1580 }
1581 return ret;
1582}
1583int branch_has_merge_config(struct branch *branch)
1585{
1586 return branch && !!branch->merge;
1587}
1588int branch_merge_matches(struct branch *branch,
1590 int i,
1591 const char *refname)
1592{
1593 if (!branch || i < 0 || i >= branch->merge_nr)
1594 return 0;
1595 return refname_match(branch->merge[i]->src, refname);
1596}
1597static int ignore_symref_update(const char *refname)
1599{
1600 unsigned char sha1[20];
1601 int flag;
1602 if (!resolve_ref_unsafe(refname, sha1, 0, &flag))
1604 return 0; /* non-existing refs are OK */
1605 return (flag & REF_ISSYMREF);
1606}
1607/*
1609 * Create and return a list of (struct ref) consisting of copies of
1610 * each remote_ref that matches refspec. refspec must be a pattern.
1611 * Fill in the copies' peer_ref to describe the local tracking refs to
1612 * which they map. Omit any references that would map to an existing
1613 * local symbolic ref.
1614 */
1615static struct ref *get_expanded_map(const struct ref *remote_refs,
1616 const struct refspec *refspec)
1617{
1618 const struct ref *ref;
1619 struct ref *ret = NULL;
1620 struct ref **tail = &ret;
1621 for (ref = remote_refs; ref; ref = ref->next) {
1623 char *expn_name = NULL;
1624 if (strchr(ref->name, '^'))
1626 continue; /* a dereference item */
1627 if (match_name_with_pattern(refspec->src, ref->name,
1628 refspec->dst, &expn_name) &&
1629 !ignore_symref_update(expn_name)) {
1630 struct ref *cpy = copy_ref(ref);
1631 cpy->peer_ref = alloc_ref(expn_name);
1633 if (refspec->force)
1634 cpy->peer_ref->force = 1;
1635 *tail = cpy;
1636 tail = &cpy->next;
1637 }
1638 free(expn_name);
1639 }
1640 return ret;
1642}
1643static const struct ref *find_ref_by_name_abbrev(const struct ref *refs, const char *name)
1645{
1646 const struct ref *ref;
1647 for (ref = refs; ref; ref = ref->next) {
1648 if (refname_match(name, ref->name))
1649 return ref;
1650 }
1651 return NULL;
1652}
1653struct ref *get_remote_ref(const struct ref *remote_refs, const char *name)
1655{
1656 const struct ref *ref = find_ref_by_name_abbrev(remote_refs, name);
1657 if (!ref)
1659 return NULL;
1660 return copy_ref(ref);
1662}
1663static struct ref *get_local_ref(const char *name)
1665{
1666 if (!name || name[0] == '\0')
1667 return NULL;
1668 if (starts_with(name, "refs/"))
1670 return alloc_ref(name);
1671 if (starts_with(name, "heads/") ||
1673 starts_with(name, "tags/") ||
1674 starts_with(name, "remotes/"))
1675 return alloc_ref_with_prefix("refs/", 5, name);
1676 return alloc_ref_with_prefix("refs/heads/", 11, name);
1678}
1679int get_fetch_map(const struct ref *remote_refs,
1681 const struct refspec *refspec,
1682 struct ref ***tail,
1683 int missing_ok)
1684{
1685 struct ref *ref_map, **rmp;
1686 if (refspec->pattern) {
1688 ref_map = get_expanded_map(remote_refs, refspec);
1689 } else {
1690 const char *name = refspec->src[0] ? refspec->src : "HEAD";
1691 if (refspec->exact_sha1) {
1693 ref_map = alloc_ref(name);
1694 get_sha1_hex(name, ref_map->old_sha1);
1695 } else {
1696 ref_map = get_remote_ref(remote_refs, name);
1697 }
1698 if (!missing_ok && !ref_map)
1699 die("Couldn't find remote ref %s", name);
1700 if (ref_map) {
1701 ref_map->peer_ref = get_local_ref(refspec->dst);
1702 if (ref_map->peer_ref && refspec->force)
1703 ref_map->peer_ref->force = 1;
1704 }
1705 }
1706 for (rmp = &ref_map; *rmp; ) {
1708 if ((*rmp)->peer_ref) {
1709 if (!starts_with((*rmp)->peer_ref->name, "refs/") ||
1710 check_refname_format((*rmp)->peer_ref->name, 0)) {
1711 struct ref *ignore = *rmp;
1712 error("* Ignoring funny ref '%s' locally",
1713 (*rmp)->peer_ref->name);
1714 *rmp = (*rmp)->next;
1715 free(ignore->peer_ref);
1716 free(ignore);
1717 continue;
1718 }
1719 }
1720 rmp = &((*rmp)->next);
1721 }
1722 if (ref_map)
1724 tail_link_ref(ref_map, tail);
1725 return 0;
1727}
1728int resolve_remote_symref(struct ref *ref, struct ref *list)
1730{
1731 if (!ref->symref)
1732 return 0;
1733 for (; list; list = list->next)
1734 if (!strcmp(ref->symref, list->name)) {
1735 hashcpy(ref->old_sha1, list->old_sha1);
1736 return 0;
1737 }
1738 return 1;
1739}
1740static void unmark_and_free(struct commit_list *list, unsigned int mark)
1742{
1743 while (list) {
1744 struct commit_list *temp = list;
1745 temp->item->object.flags &= ~mark;
1746 list = temp->next;
1747 free(temp);
1748 }
1749}
1750int ref_newer(const unsigned char *new_sha1, const unsigned char *old_sha1)
1752{
1753 struct object *o;
1754 struct commit *old, *new;
1755 struct commit_list *list, *used;
1756 int found = 0;
1757 /*
1759 * Both new and old must be commit-ish and new is descendant of
1760 * old. Otherwise we require --force.
1761 */
1762 o = deref_tag(parse_object(old_sha1), NULL, 0);
1763 if (!o || o->type != OBJ_COMMIT)
1764 return 0;
1765 old = (struct commit *) o;
1766 o = deref_tag(parse_object(new_sha1), NULL, 0);
1768 if (!o || o->type != OBJ_COMMIT)
1769 return 0;
1770 new = (struct commit *) o;
1771 if (parse_commit(new) < 0)
1773 return 0;
1774 used = list = NULL;
1776 commit_list_insert(new, &list);
1777 while (list) {
1778 new = pop_most_recent_commit(&list, TMP_MARK);
1779 commit_list_insert(new, &used);
1780 if (new == old) {
1781 found = 1;
1782 break;
1783 }
1784 }
1785 unmark_and_free(list, TMP_MARK);
1786 unmark_and_free(used, TMP_MARK);
1787 return found;
1788}
1789/*
1791 * Compare a branch with its upstream, and save their differences (number
1792 * of commits) in *num_ours and *num_theirs.
1793 *
1794 * Return 0 if branch has no upstream (no base), -1 if upstream is missing
1795 * (with "gone" base), otherwise 1 (with base).
1796 */
1797int stat_tracking_info(struct branch *branch, int *num_ours, int *num_theirs)
1798{
1799 unsigned char sha1[20];
1800 struct commit *ours, *theirs;
1801 char symmetric[84];
1802 struct rev_info revs;
1803 const char *rev_argv[10], *base;
1804 int rev_argc;
1805 /* Cannot stat unless we are marked to build on top of somebody else. */
1807 if (!branch ||
1808 !branch->merge || !branch->merge[0] || !branch->merge[0]->dst)
1809 return 0;
1810 /* Cannot stat if what we used to build on no longer exists */
1812 base = branch->merge[0]->dst;
1813 if (read_ref(base, sha1))
1814 return -1;
1815 theirs = lookup_commit_reference(sha1);
1816 if (!theirs)
1817 return -1;
1818 if (read_ref(branch->refname, sha1))
1820 return -1;
1821 ours = lookup_commit_reference(sha1);
1822 if (!ours)
1823 return -1;
1824 /* are we the same? */
1826 if (theirs == ours) {
1827 *num_theirs = *num_ours = 0;
1828 return 1;
1829 }
1830 /* Run "rev-list --left-right ours...theirs" internally... */
1832 rev_argc = 0;
1833 rev_argv[rev_argc++] = NULL;
1834 rev_argv[rev_argc++] = "--left-right";
1835 rev_argv[rev_argc++] = symmetric;
1836 rev_argv[rev_argc++] = "--";
1837 rev_argv[rev_argc] = NULL;
1838 strcpy(symmetric, sha1_to_hex(ours->object.sha1));
1840 strcpy(symmetric + 40, "...");
1841 strcpy(symmetric + 43, sha1_to_hex(theirs->object.sha1));
1842 init_revisions(&revs, NULL);
1844 setup_revisions(rev_argc, rev_argv, &revs, NULL);
1845 prepare_revision_walk(&revs);
1846 /* ... and count the commits on each side. */
1848 *num_ours = 0;
1849 *num_theirs = 0;
1850 while (1) {
1851 struct commit *c = get_revision(&revs);
1852 if (!c)
1853 break;
1854 if (c->object.flags & SYMMETRIC_LEFT)
1855 (*num_ours)++;
1856 else
1857 (*num_theirs)++;
1858 }
1859 /* clear object flags smudged by the above traversal */
1861 clear_commit_marks(ours, ALL_REV_FLAGS);
1862 clear_commit_marks(theirs, ALL_REV_FLAGS);
1863 return 1;
1864}
1865/*
1867 * Return true when there is anything to report, otherwise false.
1868 */
1869int format_tracking_info(struct branch *branch, struct strbuf *sb)
1870{
1871 int ours, theirs;
1872 const char *base;
1873 int upstream_is_gone = 0;
1874 switch (stat_tracking_info(branch, &ours, &theirs)) {
1876 case 0:
1877 /* no base */
1878 return 0;
1879 case -1:
1880 /* with "gone" base */
1881 upstream_is_gone = 1;
1882 break;
1883 default:
1884 /* with base */
1885 break;
1886 }
1887 base = branch->merge[0]->dst;
1889 base = shorten_unambiguous_ref(base, 0);
1890 if (upstream_is_gone) {
1891 strbuf_addf(sb,
1892 _("Your branch is based on '%s', but the upstream is gone.\n"),
1893 base);
1894 if (advice_status_hints)
1895 strbuf_addf(sb,
1896 _(" (use \"git branch --unset-upstream\" to fixup)\n"));
1897 } else if (!ours && !theirs) {
1898 strbuf_addf(sb,
1899 _("Your branch is up-to-date with '%s'.\n"),
1900 base);
1901 } else if (!theirs) {
1902 strbuf_addf(sb,
1903 Q_("Your branch is ahead of '%s' by %d commit.\n",
1904 "Your branch is ahead of '%s' by %d commits.\n",
1905 ours),
1906 base, ours);
1907 if (advice_status_hints)
1908 strbuf_addf(sb,
1909 _(" (use \"git push\" to publish your local commits)\n"));
1910 } else if (!ours) {
1911 strbuf_addf(sb,
1912 Q_("Your branch is behind '%s' by %d commit, "
1913 "and can be fast-forwarded.\n",
1914 "Your branch is behind '%s' by %d commits, "
1915 "and can be fast-forwarded.\n",
1916 theirs),
1917 base, theirs);
1918 if (advice_status_hints)
1919 strbuf_addf(sb,
1920 _(" (use \"git pull\" to update your local branch)\n"));
1921 } else {
1922 strbuf_addf(sb,
1923 Q_("Your branch and '%s' have diverged,\n"
1924 "and have %d and %d different commit each, "
1925 "respectively.\n",
1926 "Your branch and '%s' have diverged,\n"
1927 "and have %d and %d different commits each, "
1928 "respectively.\n",
1929 theirs),
1930 base, ours, theirs);
1931 if (advice_status_hints)
1932 strbuf_addf(sb,
1933 _(" (use \"git pull\" to merge the remote branch into yours)\n"));
1934 }
1935 return 1;
1936}
1937static int one_local_ref(const char *refname, const unsigned char *sha1, int flag, void *cb_data)
1939{
1940 struct ref ***local_tail = cb_data;
1941 struct ref *ref;
1942 int len;
1943 /* we already know it starts with refs/ to get here */
1945 if (check_refname_format(refname + 5, 0))
1946 return 0;
1947 len = strlen(refname) + 1;
1949 ref = xcalloc(1, sizeof(*ref) + len);
1950 hashcpy(ref->new_sha1, sha1);
1951 memcpy(ref->name, refname, len);
1952 **local_tail = ref;
1953 *local_tail = &ref->next;
1954 return 0;
1955}
1956struct ref *get_local_heads(void)
1958{
1959 struct ref *local_refs = NULL, **local_tail = &local_refs;
1960 for_each_ref(one_local_ref, &local_tail);
1961 return local_refs;
1962}
1963struct ref *guess_remote_head(const struct ref *head,
1965 const struct ref *refs,
1966 int all)
1967{
1968 const struct ref *r;
1969 struct ref *list = NULL;
1970 struct ref **tail = &list;
1971 if (!head)
1973 return NULL;
1974 /*
1976 * Some transports support directly peeking at
1977 * where HEAD points; if that is the case, then
1978 * we don't have to guess.
1979 */
1980 if (head->symref)
1981 return copy_ref(find_ref_by_name(refs, head->symref));
1982 /* If refs/heads/master could be right, it is. */
1984 if (!all) {
1985 r = find_ref_by_name(refs, "refs/heads/master");
1986 if (r && !hashcmp(r->old_sha1, head->old_sha1))
1987 return copy_ref(r);
1988 }
1989 /* Look for another ref that points there */
1991 for (r = refs; r; r = r->next) {
1992 if (r != head &&
1993 starts_with(r->name, "refs/heads/") &&
1994 !hashcmp(r->old_sha1, head->old_sha1)) {
1995 *tail = copy_ref(r);
1996 tail = &((*tail)->next);
1997 if (!all)
1998 break;
1999 }
2000 }
2001 return list;
2003}
2004struct stale_heads_info {
2006 struct string_list *ref_names;
2007 struct ref **stale_refs_tail;
2008 struct refspec *refs;
2009 int ref_count;
2010};
2011static int get_stale_heads_cb(const char *refname,
2013 const unsigned char *sha1, int flags, void *cb_data)
2014{
2015 struct stale_heads_info *info = cb_data;
2016 struct refspec query;
2017 memset(&query, 0, sizeof(struct refspec));
2018 query.dst = (char *)refname;
2019 if (query_refspecs(info->refs, info->ref_count, &query))
2021 return 0; /* No matches */
2022 /*
2024 * If we did find a suitable refspec and it's not a symref and
2025 * it's not in the list of refs that currently exist in that
2026 * remote we consider it to be stale.
2027 */
2028 if (!((flags & REF_ISSYMREF) ||
2029 string_list_has_string(info->ref_names, query.src))) {
2030 struct ref *ref = make_linked_ref(refname, &info->stale_refs_tail);
2031 hashcpy(ref->new_sha1, sha1);
2032 }
2033 free(query.src);
2035 return 0;
2036}
2037struct ref *get_stale_heads(struct refspec *refs, int ref_count, struct ref *fetch_map)
2039{
2040 struct ref *ref, *stale_refs = NULL;
2041 struct string_list ref_names = STRING_LIST_INIT_NODUP;
2042 struct stale_heads_info info;
2043 info.ref_names = &ref_names;
2044 info.stale_refs_tail = &stale_refs;
2045 info.refs = refs;
2046 info.ref_count = ref_count;
2047 for (ref = fetch_map; ref; ref = ref->next)
2048 string_list_append(&ref_names, ref->name);
2049 sort_string_list(&ref_names);
2050 for_each_ref(get_stale_heads_cb, &info);
2051 string_list_clear(&ref_names, 0);
2052 return stale_refs;
2053}
2054/*
2056 * Compare-and-swap
2057 */
2058void clear_cas_option(struct push_cas_option *cas)
2059{
2060 int i;
2061 for (i = 0; i < cas->nr; i++)
2063 free(cas->entry[i].refname);
2064 free(cas->entry);
2065 memset(cas, 0, sizeof(*cas));
2066}
2067static struct push_cas *add_cas_entry(struct push_cas_option *cas,
2069 const char *refname,
2070 size_t refnamelen)
2071{
2072 struct push_cas *entry;
2073 ALLOC_GROW(cas->entry, cas->nr + 1, cas->alloc);
2074 entry = &cas->entry[cas->nr++];
2075 memset(entry, 0, sizeof(*entry));
2076 entry->refname = xmemdupz(refname, refnamelen);
2077 return entry;
2078}
2079int parse_push_cas_option(struct push_cas_option *cas, const char *arg, int unset)
2081{
2082 const char *colon;
2083 struct push_cas *entry;
2084 if (unset) {
2086 /* "--no-<option>" */
2087 clear_cas_option(cas);
2088 return 0;
2089 }
2090 if (!arg) {
2092 /* just "--<option>" */
2093 cas->use_tracking_for_rest = 1;
2094 return 0;
2095 }
2096 /* "--<option>=refname" or "--<option>=refname:value" */
2098 colon = strchrnul(arg, ':');
2099 entry = add_cas_entry(cas, arg, colon - arg);
2100 if (!*colon)
2101 entry->use_tracking = 1;
2102 else if (get_sha1(colon + 1, entry->expect))
2103 return error("cannot parse expected object name '%s'", colon + 1);
2104 return 0;
2105}
2106int parseopt_push_cas_option(const struct option *opt, const char *arg, int unset)
2108{
2109 return parse_push_cas_option(opt->value, arg, unset);
2110}
2111int is_empty_cas(const struct push_cas_option *cas)
2113{
2114 return !cas->use_tracking_for_rest && !cas->nr;
2115}
2116/*
2118 * Look at remote.fetch refspec and see if we have a remote
2119 * tracking branch for the refname there. Fill its current
2120 * value in sha1[].
2121 * If we cannot do so, return negative to signal an error.
2122 */
2123static int remote_tracking(struct remote *remote, const char *refname,
2124 unsigned char sha1[20])
2125{
2126 char *dst;
2127 dst = apply_refspecs(remote->fetch, remote->fetch_refspec_nr, refname);
2129 if (!dst)
2130 return -1; /* no tracking ref for refname at remote */
2131 if (read_ref(dst, sha1))
2132 return -1; /* we know what the tracking ref is but we cannot read it */
2133 return 0;
2134}
2135static void apply_cas(struct push_cas_option *cas,
2137 struct remote *remote,
2138 struct ref *ref)
2139{
2140 int i;
2141 /* Find an explicit --<option>=<name>[:<value>] entry */
2143 for (i = 0; i < cas->nr; i++) {
2144 struct push_cas *entry = &cas->entry[i];
2145 if (!refname_match(entry->refname, ref->name))
2146 continue;
2147 ref->expect_old_sha1 = 1;
2148 if (!entry->use_tracking)
2149 hashcpy(ref->old_sha1_expect, cas->entry[i].expect);
2150 else if (remote_tracking(remote, ref->name, ref->old_sha1_expect))
2151 ref->expect_old_no_trackback = 1;
2152 return;
2153 }
2154 /* Are we using "--<option>" to cover all? */
2156 if (!cas->use_tracking_for_rest)
2157 return;
2158 ref->expect_old_sha1 = 1;
2160 if (remote_tracking(remote, ref->name, ref->old_sha1_expect))
2161 ref->expect_old_no_trackback = 1;
2162}
2163void apply_push_cas(struct push_cas_option *cas,
2165 struct remote *remote,
2166 struct ref *remote_refs)
2167{
2168 struct ref *ref;
2169 for (ref = remote_refs; ref; ref = ref->next)
2170 apply_cas(cas, remote, ref);
2171}