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