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