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