]>
Commit | Line | Data |
---|---|---|
5751f490 DB |
1 | #include "cache.h" |
2 | #include "remote.h" | |
3 | #include "refs.h" | |
4 | ||
5 | static struct remote **remotes; | |
6 | static int allocated_remotes; | |
7 | ||
cf818348 DB |
8 | static struct branch **branches; |
9 | static int allocated_branches; | |
10 | ||
11 | static struct branch *current_branch; | |
12 | static const char *default_remote_name; | |
13 | ||
5751f490 DB |
14 | #define BUF_SIZE (2048) |
15 | static char buffer[BUF_SIZE]; | |
16 | ||
17 | static void add_push_refspec(struct remote *remote, const char *ref) | |
18 | { | |
19 | int nr = remote->push_refspec_nr + 1; | |
20 | remote->push_refspec = | |
21 | xrealloc(remote->push_refspec, nr * sizeof(char *)); | |
22 | remote->push_refspec[nr-1] = ref; | |
23 | remote->push_refspec_nr = nr; | |
24 | } | |
25 | ||
5d46c9d4 DB |
26 | static void add_fetch_refspec(struct remote *remote, const char *ref) |
27 | { | |
28 | int nr = remote->fetch_refspec_nr + 1; | |
29 | remote->fetch_refspec = | |
30 | xrealloc(remote->fetch_refspec, nr * sizeof(char *)); | |
31 | remote->fetch_refspec[nr-1] = ref; | |
32 | remote->fetch_refspec_nr = nr; | |
33 | } | |
34 | ||
28b91f8a | 35 | static void add_url(struct remote *remote, const char *url) |
5751f490 | 36 | { |
28b91f8a SP |
37 | int nr = remote->url_nr + 1; |
38 | remote->url = | |
39 | xrealloc(remote->url, nr * sizeof(char *)); | |
40 | remote->url[nr-1] = url; | |
41 | remote->url_nr = nr; | |
5751f490 DB |
42 | } |
43 | ||
44 | static struct remote *make_remote(const char *name, int len) | |
45 | { | |
46 | int i, empty = -1; | |
47 | ||
48 | for (i = 0; i < allocated_remotes; i++) { | |
49 | if (!remotes[i]) { | |
50 | if (empty < 0) | |
51 | empty = i; | |
52 | } else { | |
53 | if (len ? (!strncmp(name, remotes[i]->name, len) && | |
54 | !remotes[i]->name[len]) : | |
55 | !strcmp(name, remotes[i]->name)) | |
56 | return remotes[i]; | |
57 | } | |
58 | } | |
59 | ||
60 | if (empty < 0) { | |
61 | empty = allocated_remotes; | |
62 | allocated_remotes += allocated_remotes ? allocated_remotes : 1; | |
63 | remotes = xrealloc(remotes, | |
64 | sizeof(*remotes) * allocated_remotes); | |
65 | memset(remotes + empty, 0, | |
66 | (allocated_remotes - empty) * sizeof(*remotes)); | |
67 | } | |
68 | remotes[empty] = xcalloc(1, sizeof(struct remote)); | |
69 | if (len) | |
70 | remotes[empty]->name = xstrndup(name, len); | |
71 | else | |
72 | remotes[empty]->name = xstrdup(name); | |
73 | return remotes[empty]; | |
74 | } | |
75 | ||
cf818348 DB |
76 | static void add_merge(struct branch *branch, const char *name) |
77 | { | |
78 | int nr = branch->merge_nr + 1; | |
79 | branch->merge_name = | |
80 | xrealloc(branch->merge_name, nr * sizeof(char *)); | |
81 | branch->merge_name[nr-1] = name; | |
82 | branch->merge_nr = nr; | |
83 | } | |
84 | ||
85 | static struct branch *make_branch(const char *name, int len) | |
86 | { | |
87 | int i, empty = -1; | |
88 | char *refname; | |
89 | ||
90 | for (i = 0; i < allocated_branches; i++) { | |
91 | if (!branches[i]) { | |
92 | if (empty < 0) | |
93 | empty = i; | |
94 | } else { | |
95 | if (len ? (!strncmp(name, branches[i]->name, len) && | |
96 | !branches[i]->name[len]) : | |
97 | !strcmp(name, branches[i]->name)) | |
98 | return branches[i]; | |
99 | } | |
100 | } | |
101 | ||
102 | if (empty < 0) { | |
103 | empty = allocated_branches; | |
104 | allocated_branches += allocated_branches ? allocated_branches : 1; | |
105 | branches = xrealloc(branches, | |
106 | sizeof(*branches) * allocated_branches); | |
107 | memset(branches + empty, 0, | |
108 | (allocated_branches - empty) * sizeof(*branches)); | |
109 | } | |
110 | branches[empty] = xcalloc(1, sizeof(struct branch)); | |
111 | if (len) | |
112 | branches[empty]->name = xstrndup(name, len); | |
113 | else | |
114 | branches[empty]->name = xstrdup(name); | |
115 | refname = malloc(strlen(name) + strlen("refs/heads/") + 1); | |
116 | strcpy(refname, "refs/heads/"); | |
117 | strcpy(refname + strlen("refs/heads/"), | |
118 | branches[empty]->name); | |
119 | branches[empty]->refname = refname; | |
120 | ||
121 | return branches[empty]; | |
122 | } | |
123 | ||
5751f490 DB |
124 | static void read_remotes_file(struct remote *remote) |
125 | { | |
126 | FILE *f = fopen(git_path("remotes/%s", remote->name), "r"); | |
127 | ||
128 | if (!f) | |
129 | return; | |
130 | while (fgets(buffer, BUF_SIZE, f)) { | |
131 | int value_list; | |
132 | char *s, *p; | |
133 | ||
134 | if (!prefixcmp(buffer, "URL:")) { | |
135 | value_list = 0; | |
136 | s = buffer + 4; | |
137 | } else if (!prefixcmp(buffer, "Push:")) { | |
138 | value_list = 1; | |
139 | s = buffer + 5; | |
5d46c9d4 DB |
140 | } else if (!prefixcmp(buffer, "Pull:")) { |
141 | value_list = 2; | |
142 | s = buffer + 5; | |
5751f490 DB |
143 | } else |
144 | continue; | |
145 | ||
146 | while (isspace(*s)) | |
147 | s++; | |
148 | if (!*s) | |
149 | continue; | |
150 | ||
151 | p = s + strlen(s); | |
152 | while (isspace(p[-1])) | |
153 | *--p = 0; | |
154 | ||
155 | switch (value_list) { | |
156 | case 0: | |
28b91f8a | 157 | add_url(remote, xstrdup(s)); |
5751f490 DB |
158 | break; |
159 | case 1: | |
160 | add_push_refspec(remote, xstrdup(s)); | |
161 | break; | |
5d46c9d4 DB |
162 | case 2: |
163 | add_fetch_refspec(remote, xstrdup(s)); | |
164 | break; | |
5751f490 DB |
165 | } |
166 | } | |
167 | fclose(f); | |
168 | } | |
169 | ||
170 | static void read_branches_file(struct remote *remote) | |
171 | { | |
172 | const char *slash = strchr(remote->name, '/'); | |
cf818348 DB |
173 | char *frag; |
174 | char *branch; | |
5751f490 DB |
175 | int n = slash ? slash - remote->name : 1000; |
176 | FILE *f = fopen(git_path("branches/%.*s", n, remote->name), "r"); | |
177 | char *s, *p; | |
178 | int len; | |
179 | ||
180 | if (!f) | |
181 | return; | |
182 | s = fgets(buffer, BUF_SIZE, f); | |
183 | fclose(f); | |
184 | if (!s) | |
185 | return; | |
186 | while (isspace(*s)) | |
187 | s++; | |
188 | if (!*s) | |
189 | return; | |
190 | p = s + strlen(s); | |
191 | while (isspace(p[-1])) | |
192 | *--p = 0; | |
193 | len = p - s; | |
194 | if (slash) | |
195 | len += strlen(slash); | |
196 | p = xmalloc(len + 1); | |
197 | strcpy(p, s); | |
198 | if (slash) | |
199 | strcat(p, slash); | |
cf818348 DB |
200 | frag = strchr(p, '#'); |
201 | if (frag) { | |
202 | *(frag++) = '\0'; | |
203 | branch = xmalloc(strlen(frag) + 12); | |
204 | strcpy(branch, "refs/heads/"); | |
205 | strcat(branch, frag); | |
206 | } else { | |
207 | branch = "refs/heads/master"; | |
208 | } | |
28b91f8a | 209 | add_url(remote, p); |
cf818348 | 210 | add_fetch_refspec(remote, branch); |
d71ab174 | 211 | remote->fetch_tags = 1; /* always auto-follow */ |
5751f490 DB |
212 | } |
213 | ||
5751f490 DB |
214 | static int handle_config(const char *key, const char *value) |
215 | { | |
216 | const char *name; | |
217 | const char *subkey; | |
218 | struct remote *remote; | |
cf818348 DB |
219 | struct branch *branch; |
220 | if (!prefixcmp(key, "branch.")) { | |
221 | name = key + 7; | |
222 | subkey = strrchr(name, '.'); | |
223 | branch = make_branch(name, subkey - name); | |
224 | if (!subkey) | |
225 | return 0; | |
226 | if (!value) | |
227 | return 0; | |
228 | if (!strcmp(subkey, ".remote")) { | |
229 | branch->remote_name = xstrdup(value); | |
230 | if (branch == current_branch) | |
231 | default_remote_name = branch->remote_name; | |
232 | } else if (!strcmp(subkey, ".merge")) | |
233 | add_merge(branch, xstrdup(value)); | |
234 | return 0; | |
5751f490 DB |
235 | } |
236 | if (prefixcmp(key, "remote.")) | |
237 | return 0; | |
238 | name = key + 7; | |
239 | subkey = strrchr(name, '.'); | |
240 | if (!subkey) | |
241 | return error("Config with no key for remote %s", name); | |
242 | if (*subkey == '/') { | |
243 | warning("Config remote shorthand cannot begin with '/': %s", name); | |
244 | return 0; | |
245 | } | |
246 | remote = make_remote(name, subkey - name); | |
247 | if (!value) { | |
248 | /* if we ever have a boolean variable, e.g. "remote.*.disabled" | |
249 | * [remote "frotz"] | |
250 | * disabled | |
251 | * is a valid way to set it to true; we get NULL in value so | |
252 | * we need to handle it here. | |
253 | * | |
254 | * if (!strcmp(subkey, ".disabled")) { | |
255 | * val = git_config_bool(key, value); | |
256 | * return 0; | |
257 | * } else | |
258 | * | |
259 | */ | |
260 | return 0; /* ignore unknown booleans */ | |
261 | } | |
262 | if (!strcmp(subkey, ".url")) { | |
28b91f8a | 263 | add_url(remote, xstrdup(value)); |
5751f490 DB |
264 | } else if (!strcmp(subkey, ".push")) { |
265 | add_push_refspec(remote, xstrdup(value)); | |
5d46c9d4 DB |
266 | } else if (!strcmp(subkey, ".fetch")) { |
267 | add_fetch_refspec(remote, xstrdup(value)); | |
5751f490 DB |
268 | } else if (!strcmp(subkey, ".receivepack")) { |
269 | if (!remote->receivepack) | |
270 | remote->receivepack = xstrdup(value); | |
271 | else | |
272 | error("more than one receivepack given, using the first"); | |
0012ba21 DB |
273 | } else if (!strcmp(subkey, ".uploadpack")) { |
274 | if (!remote->uploadpack) | |
275 | remote->uploadpack = xstrdup(value); | |
276 | else | |
277 | error("more than one uploadpack given, using the first"); | |
d71ab174 DB |
278 | } else if (!strcmp(subkey, ".tagopt")) { |
279 | if (!strcmp(value, "--no-tags")) | |
280 | remote->fetch_tags = -1; | |
5751f490 DB |
281 | } |
282 | return 0; | |
283 | } | |
284 | ||
285 | static void read_config(void) | |
286 | { | |
287 | unsigned char sha1[20]; | |
288 | const char *head_ref; | |
289 | int flag; | |
290 | if (default_remote_name) // did this already | |
291 | return; | |
292 | default_remote_name = xstrdup("origin"); | |
293 | current_branch = NULL; | |
294 | head_ref = resolve_ref("HEAD", sha1, 0, &flag); | |
295 | if (head_ref && (flag & REF_ISSYMREF) && | |
296 | !prefixcmp(head_ref, "refs/heads/")) { | |
cf818348 DB |
297 | current_branch = |
298 | make_branch(head_ref + strlen("refs/heads/"), 0); | |
5751f490 DB |
299 | } |
300 | git_config(handle_config); | |
301 | } | |
302 | ||
d71ab174 | 303 | struct refspec *parse_ref_spec(int nr_refspec, const char **refspec) |
6b62816c DB |
304 | { |
305 | int i; | |
306 | struct refspec *rs = xcalloc(sizeof(*rs), nr_refspec); | |
307 | for (i = 0; i < nr_refspec; i++) { | |
308 | const char *sp, *ep, *gp; | |
309 | sp = refspec[i]; | |
310 | if (*sp == '+') { | |
311 | rs[i].force = 1; | |
312 | sp++; | |
313 | } | |
314 | gp = strchr(sp, '*'); | |
315 | ep = strchr(sp, ':'); | |
316 | if (gp && ep && gp > ep) | |
317 | gp = NULL; | |
318 | if (ep) { | |
319 | if (ep[1]) { | |
320 | const char *glob = strchr(ep + 1, '*'); | |
321 | if (!glob) | |
322 | gp = NULL; | |
323 | if (gp) | |
324 | rs[i].dst = xstrndup(ep + 1, | |
325 | glob - ep - 1); | |
326 | else | |
327 | rs[i].dst = xstrdup(ep + 1); | |
328 | } | |
329 | } else { | |
330 | ep = sp + strlen(sp); | |
331 | } | |
332 | if (gp) { | |
333 | rs[i].pattern = 1; | |
334 | ep = gp; | |
335 | } | |
336 | rs[i].src = xstrndup(sp, ep - sp); | |
337 | } | |
338 | return rs; | |
339 | } | |
340 | ||
5751f490 DB |
341 | struct remote *remote_get(const char *name) |
342 | { | |
343 | struct remote *ret; | |
344 | ||
345 | read_config(); | |
346 | if (!name) | |
347 | name = default_remote_name; | |
348 | ret = make_remote(name, 0); | |
349 | if (name[0] != '/') { | |
28b91f8a | 350 | if (!ret->url) |
5751f490 | 351 | read_remotes_file(ret); |
28b91f8a | 352 | if (!ret->url) |
5751f490 DB |
353 | read_branches_file(ret); |
354 | } | |
28b91f8a SP |
355 | if (!ret->url) |
356 | add_url(ret, name); | |
357 | if (!ret->url) | |
5751f490 | 358 | return NULL; |
5d46c9d4 | 359 | ret->fetch = parse_ref_spec(ret->fetch_refspec_nr, ret->fetch_refspec); |
6b62816c | 360 | ret->push = parse_ref_spec(ret->push_refspec_nr, ret->push_refspec); |
5751f490 DB |
361 | return ret; |
362 | } | |
6b62816c | 363 | |
b42f6927 JS |
364 | int for_each_remote(each_remote_fn fn, void *priv) |
365 | { | |
366 | int i, result = 0; | |
367 | read_config(); | |
368 | for (i = 0; i < allocated_remotes && !result; i++) { | |
369 | struct remote *r = remotes[i]; | |
370 | if (!r) | |
371 | continue; | |
372 | if (!r->fetch) | |
373 | r->fetch = parse_ref_spec(r->fetch_refspec_nr, | |
374 | r->fetch_refspec); | |
375 | if (!r->push) | |
376 | r->push = parse_ref_spec(r->push_refspec_nr, | |
377 | r->push_refspec); | |
378 | result = fn(r, priv); | |
379 | } | |
380 | return result; | |
381 | } | |
382 | ||
2467a4fa DB |
383 | void ref_remove_duplicates(struct ref *ref_map) |
384 | { | |
385 | struct ref **posn; | |
386 | struct ref *next; | |
387 | for (; ref_map; ref_map = ref_map->next) { | |
388 | if (!ref_map->peer_ref) | |
389 | continue; | |
390 | posn = &ref_map->next; | |
391 | while (*posn) { | |
392 | if ((*posn)->peer_ref && | |
393 | !strcmp((*posn)->peer_ref->name, | |
394 | ref_map->peer_ref->name)) { | |
395 | if (strcmp((*posn)->name, ref_map->name)) | |
396 | die("%s tracks both %s and %s", | |
397 | ref_map->peer_ref->name, | |
398 | (*posn)->name, ref_map->name); | |
399 | next = (*posn)->next; | |
400 | free((*posn)->peer_ref); | |
401 | free(*posn); | |
402 | *posn = next; | |
403 | } else { | |
404 | posn = &(*posn)->next; | |
405 | } | |
406 | } | |
407 | } | |
408 | } | |
409 | ||
28b91f8a | 410 | int remote_has_url(struct remote *remote, const char *url) |
5d46c9d4 DB |
411 | { |
412 | int i; | |
28b91f8a SP |
413 | for (i = 0; i < remote->url_nr; i++) { |
414 | if (!strcmp(remote->url[i], url)) | |
5d46c9d4 DB |
415 | return 1; |
416 | } | |
417 | return 0; | |
418 | } | |
419 | ||
cf818348 DB |
420 | /* |
421 | * Returns true if, under the matching rules for fetching, name is the | |
422 | * same as the given full name. | |
423 | */ | |
424 | static int ref_matches_abbrev(const char *name, const char *full) | |
425 | { | |
426 | if (!prefixcmp(name, "refs/") || !strcmp(name, "HEAD")) | |
427 | return !strcmp(name, full); | |
428 | if (prefixcmp(full, "refs/")) | |
429 | return 0; | |
430 | if (!prefixcmp(name, "heads/") || | |
431 | !prefixcmp(name, "tags/") || | |
432 | !prefixcmp(name, "remotes/")) | |
433 | return !strcmp(name, full + 5); | |
434 | if (prefixcmp(full + 5, "heads/")) | |
435 | return 0; | |
436 | return !strcmp(full + 11, name); | |
437 | } | |
438 | ||
5d46c9d4 DB |
439 | int remote_find_tracking(struct remote *remote, struct refspec *refspec) |
440 | { | |
b42f6927 JS |
441 | int find_src = refspec->src == NULL; |
442 | char *needle, **result; | |
5d46c9d4 | 443 | int i; |
b42f6927 JS |
444 | |
445 | if (find_src) { | |
009c5bcd | 446 | if (!refspec->dst) |
b42f6927 JS |
447 | return error("find_tracking: need either src or dst"); |
448 | needle = refspec->dst; | |
449 | result = &refspec->src; | |
450 | } else { | |
451 | needle = refspec->src; | |
452 | result = &refspec->dst; | |
453 | } | |
454 | ||
5d46c9d4 DB |
455 | for (i = 0; i < remote->fetch_refspec_nr; i++) { |
456 | struct refspec *fetch = &remote->fetch[i]; | |
b42f6927 JS |
457 | const char *key = find_src ? fetch->dst : fetch->src; |
458 | const char *value = find_src ? fetch->src : fetch->dst; | |
5d46c9d4 DB |
459 | if (!fetch->dst) |
460 | continue; | |
461 | if (fetch->pattern) { | |
b42f6927 JS |
462 | if (!prefixcmp(needle, key)) { |
463 | *result = xmalloc(strlen(value) + | |
464 | strlen(needle) - | |
465 | strlen(key) + 1); | |
466 | strcpy(*result, value); | |
467 | strcpy(*result + strlen(value), | |
468 | needle + strlen(key)); | |
5d46c9d4 DB |
469 | refspec->force = fetch->force; |
470 | return 0; | |
471 | } | |
b42f6927 JS |
472 | } else if (!strcmp(needle, key)) { |
473 | *result = xstrdup(value); | |
474 | refspec->force = fetch->force; | |
475 | return 0; | |
5d46c9d4 DB |
476 | } |
477 | } | |
5d46c9d4 DB |
478 | return -1; |
479 | } | |
480 | ||
dfd255dd DB |
481 | struct ref *alloc_ref(unsigned namelen) |
482 | { | |
483 | struct ref *ret = xmalloc(sizeof(struct ref) + namelen); | |
484 | memset(ret, 0, sizeof(struct ref) + namelen); | |
485 | return ret; | |
486 | } | |
487 | ||
d71ab174 DB |
488 | static struct ref *copy_ref(struct ref *ref) |
489 | { | |
490 | struct ref *ret = xmalloc(sizeof(struct ref) + strlen(ref->name) + 1); | |
491 | memcpy(ret, ref, sizeof(struct ref) + strlen(ref->name) + 1); | |
492 | ret->next = NULL; | |
493 | return ret; | |
494 | } | |
495 | ||
dfd255dd DB |
496 | void free_refs(struct ref *ref) |
497 | { | |
498 | struct ref *next; | |
499 | while (ref) { | |
500 | next = ref->next; | |
501 | if (ref->peer_ref) | |
502 | free(ref->peer_ref); | |
503 | free(ref); | |
504 | ref = next; | |
505 | } | |
506 | } | |
507 | ||
6b62816c DB |
508 | static int count_refspec_match(const char *pattern, |
509 | struct ref *refs, | |
510 | struct ref **matched_ref) | |
511 | { | |
512 | int patlen = strlen(pattern); | |
513 | struct ref *matched_weak = NULL; | |
514 | struct ref *matched = NULL; | |
515 | int weak_match = 0; | |
516 | int match = 0; | |
517 | ||
518 | for (weak_match = match = 0; refs; refs = refs->next) { | |
519 | char *name = refs->name; | |
520 | int namelen = strlen(name); | |
6b62816c DB |
521 | |
522 | if (namelen < patlen || | |
523 | memcmp(name + namelen - patlen, pattern, patlen)) | |
524 | continue; | |
525 | if (namelen != patlen && name[namelen - patlen - 1] != '/') | |
526 | continue; | |
527 | ||
528 | /* A match is "weak" if it is with refs outside | |
529 | * heads or tags, and did not specify the pattern | |
530 | * in full (e.g. "refs/remotes/origin/master") or at | |
531 | * least from the toplevel (e.g. "remotes/origin/master"); | |
532 | * otherwise "git push $URL master" would result in | |
533 | * ambiguity between remotes/origin/master and heads/master | |
534 | * at the remote site. | |
535 | */ | |
536 | if (namelen != patlen && | |
537 | patlen != namelen - 5 && | |
538 | prefixcmp(name, "refs/heads/") && | |
539 | prefixcmp(name, "refs/tags/")) { | |
540 | /* We want to catch the case where only weak | |
541 | * matches are found and there are multiple | |
542 | * matches, and where more than one strong | |
543 | * matches are found, as ambiguous. One | |
544 | * strong match with zero or more weak matches | |
545 | * are acceptable as a unique match. | |
546 | */ | |
547 | matched_weak = refs; | |
548 | weak_match++; | |
549 | } | |
550 | else { | |
551 | matched = refs; | |
552 | match++; | |
553 | } | |
554 | } | |
555 | if (!matched) { | |
556 | *matched_ref = matched_weak; | |
557 | return weak_match; | |
558 | } | |
559 | else { | |
560 | *matched_ref = matched; | |
561 | return match; | |
562 | } | |
563 | } | |
564 | ||
1d735267 | 565 | static void tail_link_ref(struct ref *ref, struct ref ***tail) |
6b62816c DB |
566 | { |
567 | **tail = ref; | |
1d735267 DB |
568 | while (ref->next) |
569 | ref = ref->next; | |
6b62816c | 570 | *tail = &ref->next; |
6b62816c DB |
571 | } |
572 | ||
573 | static struct ref *try_explicit_object_name(const char *name) | |
574 | { | |
575 | unsigned char sha1[20]; | |
576 | struct ref *ref; | |
577 | int len; | |
578 | ||
579 | if (!*name) { | |
dfd255dd | 580 | ref = alloc_ref(20); |
6b62816c DB |
581 | strcpy(ref->name, "(delete)"); |
582 | hashclr(ref->new_sha1); | |
583 | return ref; | |
584 | } | |
585 | if (get_sha1(name, sha1)) | |
586 | return NULL; | |
587 | len = strlen(name) + 1; | |
dfd255dd | 588 | ref = alloc_ref(len); |
6b62816c DB |
589 | memcpy(ref->name, name, len); |
590 | hashcpy(ref->new_sha1, sha1); | |
591 | return ref; | |
592 | } | |
593 | ||
1d735267 | 594 | static struct ref *make_linked_ref(const char *name, struct ref ***tail) |
6b62816c | 595 | { |
1d735267 | 596 | struct ref *ret; |
163f0ee5 | 597 | size_t len; |
6b62816c | 598 | |
163f0ee5 | 599 | len = strlen(name) + 1; |
1d735267 DB |
600 | ret = alloc_ref(len); |
601 | memcpy(ret->name, name, len); | |
602 | tail_link_ref(ret, tail); | |
603 | return ret; | |
163f0ee5 | 604 | } |
8558fd9e | 605 | |
54a8ad92 JH |
606 | static int match_explicit(struct ref *src, struct ref *dst, |
607 | struct ref ***dst_tail, | |
608 | struct refspec *rs, | |
609 | int errs) | |
6b62816c | 610 | { |
54a8ad92 | 611 | struct ref *matched_src, *matched_dst; |
8558fd9e | 612 | |
54a8ad92 | 613 | const char *dst_value = rs->dst; |
6b62816c | 614 | |
54a8ad92 JH |
615 | if (rs->pattern) |
616 | return errs; | |
8558fd9e | 617 | |
54a8ad92 JH |
618 | matched_src = matched_dst = NULL; |
619 | switch (count_refspec_match(rs->src, src, &matched_src)) { | |
620 | case 1: | |
621 | break; | |
622 | case 0: | |
623 | /* The source could be in the get_sha1() format | |
624 | * not a reference name. :refs/other is a | |
625 | * way to delete 'other' ref at the remote end. | |
626 | */ | |
627 | matched_src = try_explicit_object_name(rs->src); | |
7dfee372 SP |
628 | if (!matched_src) |
629 | error("src refspec %s does not match any.", rs->src); | |
54a8ad92 JH |
630 | break; |
631 | default: | |
3c8b7df1 | 632 | matched_src = NULL; |
7dfee372 | 633 | error("src refspec %s matches more than one.", rs->src); |
54a8ad92 JH |
634 | break; |
635 | } | |
3c8b7df1 JH |
636 | |
637 | if (!matched_src) | |
638 | errs = 1; | |
639 | ||
4491e62a SP |
640 | if (!dst_value) { |
641 | if (!matched_src) | |
642 | return errs; | |
1ed10b88 | 643 | dst_value = matched_src->name; |
4491e62a | 644 | } |
3c8b7df1 | 645 | |
54a8ad92 JH |
646 | switch (count_refspec_match(dst_value, dst, &matched_dst)) { |
647 | case 1: | |
648 | break; | |
649 | case 0: | |
163f0ee5 | 650 | if (!memcmp(dst_value, "refs/", 5)) |
1d735267 | 651 | matched_dst = make_linked_ref(dst_value, dst_tail); |
3c8b7df1 | 652 | else |
54a8ad92 JH |
653 | error("dst refspec %s does not match any " |
654 | "existing ref on the remote and does " | |
655 | "not start with refs/.", dst_value); | |
54a8ad92 JH |
656 | break; |
657 | default: | |
3c8b7df1 | 658 | matched_dst = NULL; |
54a8ad92 JH |
659 | error("dst refspec %s matches more than one.", |
660 | dst_value); | |
661 | break; | |
662 | } | |
009c5bcd | 663 | if (errs || !matched_dst) |
3c8b7df1 | 664 | return 1; |
54a8ad92 JH |
665 | if (matched_dst->peer_ref) { |
666 | errs = 1; | |
667 | error("dst ref %s receives from more than one src.", | |
668 | matched_dst->name); | |
6b62816c | 669 | } |
54a8ad92 JH |
670 | else { |
671 | matched_dst->peer_ref = matched_src; | |
672 | matched_dst->force = rs->force; | |
6b62816c | 673 | } |
54a8ad92 JH |
674 | return errs; |
675 | } | |
676 | ||
677 | static int match_explicit_refs(struct ref *src, struct ref *dst, | |
678 | struct ref ***dst_tail, struct refspec *rs, | |
679 | int rs_nr) | |
680 | { | |
681 | int i, errs; | |
682 | for (i = errs = 0; i < rs_nr; i++) | |
683 | errs |= match_explicit(src, dst, dst_tail, &rs[i], errs); | |
6b62816c DB |
684 | return -errs; |
685 | } | |
686 | ||
687 | static struct ref *find_ref_by_name(struct ref *list, const char *name) | |
688 | { | |
689 | for ( ; list; list = list->next) | |
690 | if (!strcmp(list->name, name)) | |
691 | return list; | |
692 | return NULL; | |
693 | } | |
694 | ||
6e66bf3c AR |
695 | static const struct refspec *check_pattern_match(const struct refspec *rs, |
696 | int rs_nr, | |
697 | const struct ref *src) | |
8558fd9e DB |
698 | { |
699 | int i; | |
8558fd9e DB |
700 | for (i = 0; i < rs_nr; i++) { |
701 | if (rs[i].pattern && !prefixcmp(src->name, rs[i].src)) | |
6e66bf3c | 702 | return rs + i; |
8558fd9e | 703 | } |
6e66bf3c | 704 | return NULL; |
8558fd9e DB |
705 | } |
706 | ||
54a8ad92 JH |
707 | /* |
708 | * Note. This is used only by "push"; refspec matching rules for | |
709 | * push and fetch are subtly different, so do not try to reuse it | |
710 | * without thinking. | |
711 | */ | |
6b62816c DB |
712 | int match_refs(struct ref *src, struct ref *dst, struct ref ***dst_tail, |
713 | int nr_refspec, char **refspec, int all) | |
714 | { | |
715 | struct refspec *rs = | |
716 | parse_ref_spec(nr_refspec, (const char **) refspec); | |
717 | ||
8558fd9e DB |
718 | if (match_explicit_refs(src, dst, dst_tail, rs, nr_refspec)) |
719 | return -1; | |
6b62816c DB |
720 | |
721 | /* pick the remainder */ | |
722 | for ( ; src; src = src->next) { | |
723 | struct ref *dst_peer; | |
6e66bf3c AR |
724 | const struct refspec *pat = NULL; |
725 | char *dst_name; | |
6b62816c DB |
726 | if (src->peer_ref) |
727 | continue; | |
6e66bf3c AR |
728 | if (nr_refspec) { |
729 | pat = check_pattern_match(rs, nr_refspec, src); | |
730 | if (!pat) | |
731 | continue; | |
732 | } | |
098e711e JH |
733 | else if (prefixcmp(src->name, "refs/heads/")) |
734 | /* | |
735 | * "matching refs"; traditionally we pushed everything | |
736 | * including refs outside refs/heads/ hierarchy, but | |
737 | * that does not make much sense these days. | |
738 | */ | |
739 | continue; | |
8558fd9e | 740 | |
6e66bf3c | 741 | if (pat) { |
efd8f793 DB |
742 | const char *dst_side = pat->dst ? pat->dst : pat->src; |
743 | dst_name = xmalloc(strlen(dst_side) + | |
6e66bf3c AR |
744 | strlen(src->name) - |
745 | strlen(pat->src) + 2); | |
efd8f793 | 746 | strcpy(dst_name, dst_side); |
6e66bf3c AR |
747 | strcat(dst_name, src->name + strlen(pat->src)); |
748 | } else | |
aa32eedc | 749 | dst_name = xstrdup(src->name); |
6e66bf3c | 750 | dst_peer = find_ref_by_name(dst, dst_name); |
8558fd9e DB |
751 | if (dst_peer && dst_peer->peer_ref) |
752 | /* We're already sending something to this ref. */ | |
6e66bf3c | 753 | goto free_name; |
8558fd9e DB |
754 | if (!dst_peer && !nr_refspec && !all) |
755 | /* Remote doesn't have it, and we have no | |
756 | * explicit pattern, and we don't have | |
757 | * --all. */ | |
6e66bf3c | 758 | goto free_name; |
6b62816c DB |
759 | if (!dst_peer) { |
760 | /* Create a new one and link it */ | |
1d735267 | 761 | dst_peer = make_linked_ref(dst_name, dst_tail); |
6b62816c | 762 | hashcpy(dst_peer->new_sha1, src->new_sha1); |
6b62816c DB |
763 | } |
764 | dst_peer->peer_ref = src; | |
5eb73581 JK |
765 | if (pat) |
766 | dst_peer->force = pat->force; | |
6e66bf3c AR |
767 | free_name: |
768 | free(dst_name); | |
6b62816c DB |
769 | } |
770 | return 0; | |
771 | } | |
cf818348 DB |
772 | |
773 | struct branch *branch_get(const char *name) | |
774 | { | |
775 | struct branch *ret; | |
776 | ||
777 | read_config(); | |
778 | if (!name || !*name || !strcmp(name, "HEAD")) | |
779 | ret = current_branch; | |
780 | else | |
781 | ret = make_branch(name, 0); | |
782 | if (ret && ret->remote_name) { | |
783 | ret->remote = remote_get(ret->remote_name); | |
784 | if (ret->merge_nr) { | |
785 | int i; | |
786 | ret->merge = xcalloc(sizeof(*ret->merge), | |
787 | ret->merge_nr); | |
788 | for (i = 0; i < ret->merge_nr; i++) { | |
789 | ret->merge[i] = xcalloc(1, sizeof(**ret->merge)); | |
790 | ret->merge[i]->src = xstrdup(ret->merge_name[i]); | |
791 | remote_find_tracking(ret->remote, | |
792 | ret->merge[i]); | |
793 | } | |
794 | } | |
795 | } | |
796 | return ret; | |
797 | } | |
798 | ||
799 | int branch_has_merge_config(struct branch *branch) | |
800 | { | |
801 | return branch && !!branch->merge; | |
802 | } | |
803 | ||
85682c19 SP |
804 | int branch_merge_matches(struct branch *branch, |
805 | int i, | |
806 | const char *refname) | |
cf818348 | 807 | { |
85682c19 | 808 | if (!branch || i < 0 || i >= branch->merge_nr) |
cf818348 | 809 | return 0; |
85682c19 | 810 | return ref_matches_abbrev(branch->merge[i]->src, refname); |
cf818348 | 811 | } |
d71ab174 DB |
812 | |
813 | static struct ref *get_expanded_map(struct ref *remote_refs, | |
814 | const struct refspec *refspec) | |
815 | { | |
816 | struct ref *ref; | |
817 | struct ref *ret = NULL; | |
818 | struct ref **tail = &ret; | |
819 | ||
820 | int remote_prefix_len = strlen(refspec->src); | |
821 | int local_prefix_len = strlen(refspec->dst); | |
822 | ||
823 | for (ref = remote_refs; ref; ref = ref->next) { | |
824 | if (strchr(ref->name, '^')) | |
825 | continue; /* a dereference item */ | |
826 | if (!prefixcmp(ref->name, refspec->src)) { | |
827 | char *match; | |
828 | struct ref *cpy = copy_ref(ref); | |
829 | match = ref->name + remote_prefix_len; | |
830 | ||
831 | cpy->peer_ref = alloc_ref(local_prefix_len + | |
832 | strlen(match) + 1); | |
833 | sprintf(cpy->peer_ref->name, "%s%s", | |
834 | refspec->dst, match); | |
835 | if (refspec->force) | |
836 | cpy->peer_ref->force = 1; | |
837 | *tail = cpy; | |
838 | tail = &cpy->next; | |
839 | } | |
840 | } | |
841 | ||
842 | return ret; | |
843 | } | |
844 | ||
845 | static struct ref *find_ref_by_name_abbrev(struct ref *refs, const char *name) | |
846 | { | |
847 | struct ref *ref; | |
848 | for (ref = refs; ref; ref = ref->next) { | |
849 | if (ref_matches_abbrev(name, ref->name)) | |
850 | return ref; | |
851 | } | |
852 | return NULL; | |
853 | } | |
854 | ||
855 | struct ref *get_remote_ref(struct ref *remote_refs, const char *name) | |
856 | { | |
857 | struct ref *ref = find_ref_by_name_abbrev(remote_refs, name); | |
858 | ||
859 | if (!ref) | |
860 | die("Couldn't find remote ref %s\n", name); | |
861 | ||
862 | return copy_ref(ref); | |
863 | } | |
864 | ||
865 | static struct ref *get_local_ref(const char *name) | |
866 | { | |
867 | struct ref *ret; | |
868 | if (!name) | |
869 | return NULL; | |
870 | ||
871 | if (!prefixcmp(name, "refs/")) { | |
872 | ret = alloc_ref(strlen(name) + 1); | |
873 | strcpy(ret->name, name); | |
874 | return ret; | |
875 | } | |
876 | ||
877 | if (!prefixcmp(name, "heads/") || | |
878 | !prefixcmp(name, "tags/") || | |
879 | !prefixcmp(name, "remotes/")) { | |
880 | ret = alloc_ref(strlen(name) + 6); | |
881 | sprintf(ret->name, "refs/%s", name); | |
882 | return ret; | |
883 | } | |
884 | ||
885 | ret = alloc_ref(strlen(name) + 12); | |
886 | sprintf(ret->name, "refs/heads/%s", name); | |
887 | return ret; | |
888 | } | |
889 | ||
890 | int get_fetch_map(struct ref *remote_refs, | |
891 | const struct refspec *refspec, | |
892 | struct ref ***tail) | |
893 | { | |
894 | struct ref *ref_map, *rm; | |
895 | ||
896 | if (refspec->pattern) { | |
897 | ref_map = get_expanded_map(remote_refs, refspec); | |
898 | } else { | |
899 | ref_map = get_remote_ref(remote_refs, | |
900 | refspec->src[0] ? | |
901 | refspec->src : "HEAD"); | |
902 | ||
903 | ref_map->peer_ref = get_local_ref(refspec->dst); | |
27e13374 | 904 | if (ref_map->peer_ref && refspec->force) |
d71ab174 DB |
905 | ref_map->peer_ref->force = 1; |
906 | } | |
907 | ||
908 | for (rm = ref_map; rm; rm = rm->next) { | |
909 | if (rm->peer_ref && check_ref_format(rm->peer_ref->name + 5)) | |
910 | die("* refusing to create funny ref '%s' locally", | |
911 | rm->peer_ref->name); | |
912 | } | |
913 | ||
8f70a765 AR |
914 | if (ref_map) |
915 | tail_link_ref(ref_map, tail); | |
d71ab174 DB |
916 | |
917 | return 0; | |
918 | } |