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