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