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