]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * The backend-independent part of the reference module. | |
3 | */ | |
4 | ||
5 | #include "cache.h" | |
6 | #include "config.h" | |
7 | #include "hashmap.h" | |
8 | #include "lockfile.h" | |
9 | #include "iterator.h" | |
10 | #include "refs.h" | |
11 | #include "refs/refs-internal.h" | |
12 | #include "object.h" | |
13 | #include "tag.h" | |
14 | #include "submodule.h" | |
15 | #include "worktree.h" | |
16 | ||
17 | /* | |
18 | * List of all available backends | |
19 | */ | |
20 | static struct ref_storage_be *refs_backends = &refs_be_files; | |
21 | ||
22 | static struct ref_storage_be *find_ref_storage_backend(const char *name) | |
23 | { | |
24 | struct ref_storage_be *be; | |
25 | for (be = refs_backends; be; be = be->next) | |
26 | if (!strcmp(be->name, name)) | |
27 | return be; | |
28 | return NULL; | |
29 | } | |
30 | ||
31 | int ref_storage_backend_exists(const char *name) | |
32 | { | |
33 | return find_ref_storage_backend(name) != NULL; | |
34 | } | |
35 | ||
36 | /* | |
37 | * How to handle various characters in refnames: | |
38 | * 0: An acceptable character for refs | |
39 | * 1: End-of-component | |
40 | * 2: ., look for a preceding . to reject .. in refs | |
41 | * 3: {, look for a preceding @ to reject @{ in refs | |
42 | * 4: A bad character: ASCII control characters, and | |
43 | * ":", "?", "[", "\", "^", "~", SP, or TAB | |
44 | * 5: *, reject unless REFNAME_REFSPEC_PATTERN is set | |
45 | */ | |
46 | static unsigned char refname_disposition[256] = { | |
47 | 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, | |
48 | 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, | |
49 | 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 2, 1, | |
50 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4, | |
51 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
52 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0, | |
53 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
54 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4 | |
55 | }; | |
56 | ||
57 | /* | |
58 | * Try to read one refname component from the front of refname. | |
59 | * Return the length of the component found, or -1 if the component is | |
60 | * not legal. It is legal if it is something reasonable to have under | |
61 | * ".git/refs/"; We do not like it if: | |
62 | * | |
63 | * - any path component of it begins with ".", or | |
64 | * - it has double dots "..", or | |
65 | * - it has ASCII control characters, or | |
66 | * - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or | |
67 | * - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or | |
68 | * - it ends with a "/", or | |
69 | * - it ends with ".lock", or | |
70 | * - it contains a "@{" portion | |
71 | */ | |
72 | static int check_refname_component(const char *refname, int *flags) | |
73 | { | |
74 | const char *cp; | |
75 | char last = '\0'; | |
76 | ||
77 | for (cp = refname; ; cp++) { | |
78 | int ch = *cp & 255; | |
79 | unsigned char disp = refname_disposition[ch]; | |
80 | switch (disp) { | |
81 | case 1: | |
82 | goto out; | |
83 | case 2: | |
84 | if (last == '.') | |
85 | return -1; /* Refname contains "..". */ | |
86 | break; | |
87 | case 3: | |
88 | if (last == '@') | |
89 | return -1; /* Refname contains "@{". */ | |
90 | break; | |
91 | case 4: | |
92 | return -1; | |
93 | case 5: | |
94 | if (!(*flags & REFNAME_REFSPEC_PATTERN)) | |
95 | return -1; /* refspec can't be a pattern */ | |
96 | ||
97 | /* | |
98 | * Unset the pattern flag so that we only accept | |
99 | * a single asterisk for one side of refspec. | |
100 | */ | |
101 | *flags &= ~ REFNAME_REFSPEC_PATTERN; | |
102 | break; | |
103 | } | |
104 | last = ch; | |
105 | } | |
106 | out: | |
107 | if (cp == refname) | |
108 | return 0; /* Component has zero length. */ | |
109 | if (refname[0] == '.') | |
110 | return -1; /* Component starts with '.'. */ | |
111 | if (cp - refname >= LOCK_SUFFIX_LEN && | |
112 | !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) | |
113 | return -1; /* Refname ends with ".lock". */ | |
114 | return cp - refname; | |
115 | } | |
116 | ||
117 | int check_refname_format(const char *refname, int flags) | |
118 | { | |
119 | int component_len, component_count = 0; | |
120 | ||
121 | if (!strcmp(refname, "@")) | |
122 | /* Refname is a single character '@'. */ | |
123 | return -1; | |
124 | ||
125 | while (1) { | |
126 | /* We are at the start of a path component. */ | |
127 | component_len = check_refname_component(refname, &flags); | |
128 | if (component_len <= 0) | |
129 | return -1; | |
130 | ||
131 | component_count++; | |
132 | if (refname[component_len] == '\0') | |
133 | break; | |
134 | /* Skip to next component. */ | |
135 | refname += component_len + 1; | |
136 | } | |
137 | ||
138 | if (refname[component_len - 1] == '.') | |
139 | return -1; /* Refname ends with '.'. */ | |
140 | if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2) | |
141 | return -1; /* Refname has only one component. */ | |
142 | return 0; | |
143 | } | |
144 | ||
145 | int refname_is_safe(const char *refname) | |
146 | { | |
147 | const char *rest; | |
148 | ||
149 | if (skip_prefix(refname, "refs/", &rest)) { | |
150 | char *buf; | |
151 | int result; | |
152 | size_t restlen = strlen(rest); | |
153 | ||
154 | /* rest must not be empty, or start or end with "/" */ | |
155 | if (!restlen || *rest == '/' || rest[restlen - 1] == '/') | |
156 | return 0; | |
157 | ||
158 | /* | |
159 | * Does the refname try to escape refs/? | |
160 | * For example: refs/foo/../bar is safe but refs/foo/../../bar | |
161 | * is not. | |
162 | */ | |
163 | buf = xmallocz(restlen); | |
164 | result = !normalize_path_copy(buf, rest) && !strcmp(buf, rest); | |
165 | free(buf); | |
166 | return result; | |
167 | } | |
168 | ||
169 | do { | |
170 | if (!isupper(*refname) && *refname != '_') | |
171 | return 0; | |
172 | refname++; | |
173 | } while (*refname); | |
174 | return 1; | |
175 | } | |
176 | ||
177 | /* | |
178 | * Return true if refname, which has the specified oid and flags, can | |
179 | * be resolved to an object in the database. If the referred-to object | |
180 | * does not exist, emit a warning and return false. | |
181 | */ | |
182 | int ref_resolves_to_object(const char *refname, | |
183 | const struct object_id *oid, | |
184 | unsigned int flags) | |
185 | { | |
186 | if (flags & REF_ISBROKEN) | |
187 | return 0; | |
188 | if (!has_sha1_file(oid->hash)) { | |
189 | error("%s does not point to a valid object!", refname); | |
190 | return 0; | |
191 | } | |
192 | return 1; | |
193 | } | |
194 | ||
195 | char *refs_resolve_refdup(struct ref_store *refs, | |
196 | const char *refname, int resolve_flags, | |
197 | struct object_id *oid, int *flags) | |
198 | { | |
199 | const char *result; | |
200 | ||
201 | result = refs_resolve_ref_unsafe(refs, refname, resolve_flags, | |
202 | oid->hash, flags); | |
203 | return xstrdup_or_null(result); | |
204 | } | |
205 | ||
206 | char *resolve_refdup(const char *refname, int resolve_flags, | |
207 | struct object_id *oid, int *flags) | |
208 | { | |
209 | return refs_resolve_refdup(get_main_ref_store(), | |
210 | refname, resolve_flags, | |
211 | oid, flags); | |
212 | } | |
213 | ||
214 | /* The argument to filter_refs */ | |
215 | struct ref_filter { | |
216 | const char *pattern; | |
217 | each_ref_fn *fn; | |
218 | void *cb_data; | |
219 | }; | |
220 | ||
221 | int refs_read_ref_full(struct ref_store *refs, const char *refname, | |
222 | int resolve_flags, struct object_id *oid, int *flags) | |
223 | { | |
224 | if (refs_resolve_ref_unsafe(refs, refname, resolve_flags, oid->hash, flags)) | |
225 | return 0; | |
226 | return -1; | |
227 | } | |
228 | ||
229 | int read_ref_full(const char *refname, int resolve_flags, struct object_id *oid, int *flags) | |
230 | { | |
231 | return refs_read_ref_full(get_main_ref_store(), refname, | |
232 | resolve_flags, oid, flags); | |
233 | } | |
234 | ||
235 | int read_ref(const char *refname, struct object_id *oid) | |
236 | { | |
237 | return read_ref_full(refname, RESOLVE_REF_READING, oid, NULL); | |
238 | } | |
239 | ||
240 | int ref_exists(const char *refname) | |
241 | { | |
242 | return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, NULL, NULL); | |
243 | } | |
244 | ||
245 | static int filter_refs(const char *refname, const struct object_id *oid, | |
246 | int flags, void *data) | |
247 | { | |
248 | struct ref_filter *filter = (struct ref_filter *)data; | |
249 | ||
250 | if (wildmatch(filter->pattern, refname, 0)) | |
251 | return 0; | |
252 | return filter->fn(refname, oid, flags, filter->cb_data); | |
253 | } | |
254 | ||
255 | enum peel_status peel_object(const unsigned char *name, unsigned char *sha1) | |
256 | { | |
257 | struct object *o = lookup_unknown_object(name); | |
258 | ||
259 | if (o->type == OBJ_NONE) { | |
260 | int type = sha1_object_info(name, NULL); | |
261 | if (type < 0 || !object_as_type(o, type, 0)) | |
262 | return PEEL_INVALID; | |
263 | } | |
264 | ||
265 | if (o->type != OBJ_TAG) | |
266 | return PEEL_NON_TAG; | |
267 | ||
268 | o = deref_tag_noverify(o); | |
269 | if (!o) | |
270 | return PEEL_INVALID; | |
271 | ||
272 | hashcpy(sha1, o->oid.hash); | |
273 | return PEEL_PEELED; | |
274 | } | |
275 | ||
276 | struct warn_if_dangling_data { | |
277 | FILE *fp; | |
278 | const char *refname; | |
279 | const struct string_list *refnames; | |
280 | const char *msg_fmt; | |
281 | }; | |
282 | ||
283 | static int warn_if_dangling_symref(const char *refname, const struct object_id *oid, | |
284 | int flags, void *cb_data) | |
285 | { | |
286 | struct warn_if_dangling_data *d = cb_data; | |
287 | const char *resolves_to; | |
288 | ||
289 | if (!(flags & REF_ISSYMREF)) | |
290 | return 0; | |
291 | ||
292 | resolves_to = resolve_ref_unsafe(refname, 0, NULL, NULL); | |
293 | if (!resolves_to | |
294 | || (d->refname | |
295 | ? strcmp(resolves_to, d->refname) | |
296 | : !string_list_has_string(d->refnames, resolves_to))) { | |
297 | return 0; | |
298 | } | |
299 | ||
300 | fprintf(d->fp, d->msg_fmt, refname); | |
301 | fputc('\n', d->fp); | |
302 | return 0; | |
303 | } | |
304 | ||
305 | void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname) | |
306 | { | |
307 | struct warn_if_dangling_data data; | |
308 | ||
309 | data.fp = fp; | |
310 | data.refname = refname; | |
311 | data.refnames = NULL; | |
312 | data.msg_fmt = msg_fmt; | |
313 | for_each_rawref(warn_if_dangling_symref, &data); | |
314 | } | |
315 | ||
316 | void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames) | |
317 | { | |
318 | struct warn_if_dangling_data data; | |
319 | ||
320 | data.fp = fp; | |
321 | data.refname = NULL; | |
322 | data.refnames = refnames; | |
323 | data.msg_fmt = msg_fmt; | |
324 | for_each_rawref(warn_if_dangling_symref, &data); | |
325 | } | |
326 | ||
327 | int refs_for_each_tag_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
328 | { | |
329 | return refs_for_each_ref_in(refs, "refs/tags/", fn, cb_data); | |
330 | } | |
331 | ||
332 | int for_each_tag_ref(each_ref_fn fn, void *cb_data) | |
333 | { | |
334 | return refs_for_each_tag_ref(get_main_ref_store(), fn, cb_data); | |
335 | } | |
336 | ||
337 | int refs_for_each_branch_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
338 | { | |
339 | return refs_for_each_ref_in(refs, "refs/heads/", fn, cb_data); | |
340 | } | |
341 | ||
342 | int for_each_branch_ref(each_ref_fn fn, void *cb_data) | |
343 | { | |
344 | return refs_for_each_branch_ref(get_main_ref_store(), fn, cb_data); | |
345 | } | |
346 | ||
347 | int refs_for_each_remote_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
348 | { | |
349 | return refs_for_each_ref_in(refs, "refs/remotes/", fn, cb_data); | |
350 | } | |
351 | ||
352 | int for_each_remote_ref(each_ref_fn fn, void *cb_data) | |
353 | { | |
354 | return refs_for_each_remote_ref(get_main_ref_store(), fn, cb_data); | |
355 | } | |
356 | ||
357 | int head_ref_namespaced(each_ref_fn fn, void *cb_data) | |
358 | { | |
359 | struct strbuf buf = STRBUF_INIT; | |
360 | int ret = 0; | |
361 | struct object_id oid; | |
362 | int flag; | |
363 | ||
364 | strbuf_addf(&buf, "%sHEAD", get_git_namespace()); | |
365 | if (!read_ref_full(buf.buf, RESOLVE_REF_READING, &oid, &flag)) | |
366 | ret = fn(buf.buf, &oid, flag, cb_data); | |
367 | strbuf_release(&buf); | |
368 | ||
369 | return ret; | |
370 | } | |
371 | ||
372 | int for_each_glob_ref_in(each_ref_fn fn, const char *pattern, | |
373 | const char *prefix, void *cb_data) | |
374 | { | |
375 | struct strbuf real_pattern = STRBUF_INIT; | |
376 | struct ref_filter filter; | |
377 | int ret; | |
378 | ||
379 | if (!prefix && !starts_with(pattern, "refs/")) | |
380 | strbuf_addstr(&real_pattern, "refs/"); | |
381 | else if (prefix) | |
382 | strbuf_addstr(&real_pattern, prefix); | |
383 | strbuf_addstr(&real_pattern, pattern); | |
384 | ||
385 | if (!has_glob_specials(pattern)) { | |
386 | /* Append implied '/' '*' if not present. */ | |
387 | strbuf_complete(&real_pattern, '/'); | |
388 | /* No need to check for '*', there is none. */ | |
389 | strbuf_addch(&real_pattern, '*'); | |
390 | } | |
391 | ||
392 | filter.pattern = real_pattern.buf; | |
393 | filter.fn = fn; | |
394 | filter.cb_data = cb_data; | |
395 | ret = for_each_ref(filter_refs, &filter); | |
396 | ||
397 | strbuf_release(&real_pattern); | |
398 | return ret; | |
399 | } | |
400 | ||
401 | int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data) | |
402 | { | |
403 | return for_each_glob_ref_in(fn, pattern, NULL, cb_data); | |
404 | } | |
405 | ||
406 | const char *prettify_refname(const char *name) | |
407 | { | |
408 | if (skip_prefix(name, "refs/heads/", &name) || | |
409 | skip_prefix(name, "refs/tags/", &name) || | |
410 | skip_prefix(name, "refs/remotes/", &name)) | |
411 | ; /* nothing */ | |
412 | return name; | |
413 | } | |
414 | ||
415 | static const char *ref_rev_parse_rules[] = { | |
416 | "%.*s", | |
417 | "refs/%.*s", | |
418 | "refs/tags/%.*s", | |
419 | "refs/heads/%.*s", | |
420 | "refs/remotes/%.*s", | |
421 | "refs/remotes/%.*s/HEAD", | |
422 | NULL | |
423 | }; | |
424 | ||
425 | int refname_match(const char *abbrev_name, const char *full_name) | |
426 | { | |
427 | const char **p; | |
428 | const int abbrev_name_len = strlen(abbrev_name); | |
429 | ||
430 | for (p = ref_rev_parse_rules; *p; p++) { | |
431 | if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) { | |
432 | return 1; | |
433 | } | |
434 | } | |
435 | ||
436 | return 0; | |
437 | } | |
438 | ||
439 | /* | |
440 | * *string and *len will only be substituted, and *string returned (for | |
441 | * later free()ing) if the string passed in is a magic short-hand form | |
442 | * to name a branch. | |
443 | */ | |
444 | static char *substitute_branch_name(const char **string, int *len) | |
445 | { | |
446 | struct strbuf buf = STRBUF_INIT; | |
447 | int ret = interpret_branch_name(*string, *len, &buf, 0); | |
448 | ||
449 | if (ret == *len) { | |
450 | size_t size; | |
451 | *string = strbuf_detach(&buf, &size); | |
452 | *len = size; | |
453 | return (char *)*string; | |
454 | } | |
455 | ||
456 | return NULL; | |
457 | } | |
458 | ||
459 | int dwim_ref(const char *str, int len, struct object_id *oid, char **ref) | |
460 | { | |
461 | char *last_branch = substitute_branch_name(&str, &len); | |
462 | int refs_found = expand_ref(str, len, oid, ref); | |
463 | free(last_branch); | |
464 | return refs_found; | |
465 | } | |
466 | ||
467 | int expand_ref(const char *str, int len, struct object_id *oid, char **ref) | |
468 | { | |
469 | const char **p, *r; | |
470 | int refs_found = 0; | |
471 | struct strbuf fullref = STRBUF_INIT; | |
472 | ||
473 | *ref = NULL; | |
474 | for (p = ref_rev_parse_rules; *p; p++) { | |
475 | struct object_id oid_from_ref; | |
476 | struct object_id *this_result; | |
477 | int flag; | |
478 | ||
479 | this_result = refs_found ? &oid_from_ref : oid; | |
480 | strbuf_reset(&fullref); | |
481 | strbuf_addf(&fullref, *p, len, str); | |
482 | r = resolve_ref_unsafe(fullref.buf, RESOLVE_REF_READING, | |
483 | this_result ? this_result->hash : NULL, | |
484 | &flag); | |
485 | if (r) { | |
486 | if (!refs_found++) | |
487 | *ref = xstrdup(r); | |
488 | if (!warn_ambiguous_refs) | |
489 | break; | |
490 | } else if ((flag & REF_ISSYMREF) && strcmp(fullref.buf, "HEAD")) { | |
491 | warning("ignoring dangling symref %s.", fullref.buf); | |
492 | } else if ((flag & REF_ISBROKEN) && strchr(fullref.buf, '/')) { | |
493 | warning("ignoring broken ref %s.", fullref.buf); | |
494 | } | |
495 | } | |
496 | strbuf_release(&fullref); | |
497 | return refs_found; | |
498 | } | |
499 | ||
500 | int dwim_log(const char *str, int len, struct object_id *oid, char **log) | |
501 | { | |
502 | char *last_branch = substitute_branch_name(&str, &len); | |
503 | const char **p; | |
504 | int logs_found = 0; | |
505 | struct strbuf path = STRBUF_INIT; | |
506 | ||
507 | *log = NULL; | |
508 | for (p = ref_rev_parse_rules; *p; p++) { | |
509 | struct object_id hash; | |
510 | const char *ref, *it; | |
511 | ||
512 | strbuf_reset(&path); | |
513 | strbuf_addf(&path, *p, len, str); | |
514 | ref = resolve_ref_unsafe(path.buf, RESOLVE_REF_READING, | |
515 | hash.hash, NULL); | |
516 | if (!ref) | |
517 | continue; | |
518 | if (reflog_exists(path.buf)) | |
519 | it = path.buf; | |
520 | else if (strcmp(ref, path.buf) && reflog_exists(ref)) | |
521 | it = ref; | |
522 | else | |
523 | continue; | |
524 | if (!logs_found++) { | |
525 | *log = xstrdup(it); | |
526 | oidcpy(oid, &hash); | |
527 | } | |
528 | if (!warn_ambiguous_refs) | |
529 | break; | |
530 | } | |
531 | strbuf_release(&path); | |
532 | free(last_branch); | |
533 | return logs_found; | |
534 | } | |
535 | ||
536 | static int is_per_worktree_ref(const char *refname) | |
537 | { | |
538 | return !strcmp(refname, "HEAD") || | |
539 | starts_with(refname, "refs/bisect/"); | |
540 | } | |
541 | ||
542 | static int is_pseudoref_syntax(const char *refname) | |
543 | { | |
544 | const char *c; | |
545 | ||
546 | for (c = refname; *c; c++) { | |
547 | if (!isupper(*c) && *c != '-' && *c != '_') | |
548 | return 0; | |
549 | } | |
550 | ||
551 | return 1; | |
552 | } | |
553 | ||
554 | enum ref_type ref_type(const char *refname) | |
555 | { | |
556 | if (is_per_worktree_ref(refname)) | |
557 | return REF_TYPE_PER_WORKTREE; | |
558 | if (is_pseudoref_syntax(refname)) | |
559 | return REF_TYPE_PSEUDOREF; | |
560 | return REF_TYPE_NORMAL; | |
561 | } | |
562 | ||
563 | long get_files_ref_lock_timeout_ms(void) | |
564 | { | |
565 | static int configured = 0; | |
566 | ||
567 | /* The default timeout is 100 ms: */ | |
568 | static int timeout_ms = 100; | |
569 | ||
570 | if (!configured) { | |
571 | git_config_get_int("core.filesreflocktimeout", &timeout_ms); | |
572 | configured = 1; | |
573 | } | |
574 | ||
575 | return timeout_ms; | |
576 | } | |
577 | ||
578 | static int write_pseudoref(const char *pseudoref, const struct object_id *oid, | |
579 | const struct object_id *old_oid, struct strbuf *err) | |
580 | { | |
581 | const char *filename; | |
582 | int fd; | |
583 | static struct lock_file lock; | |
584 | struct strbuf buf = STRBUF_INIT; | |
585 | int ret = -1; | |
586 | ||
587 | if (!oid) | |
588 | return 0; | |
589 | ||
590 | strbuf_addf(&buf, "%s\n", oid_to_hex(oid)); | |
591 | ||
592 | filename = git_path("%s", pseudoref); | |
593 | fd = hold_lock_file_for_update_timeout(&lock, filename, | |
594 | LOCK_DIE_ON_ERROR, | |
595 | get_files_ref_lock_timeout_ms()); | |
596 | if (fd < 0) { | |
597 | strbuf_addf(err, "could not open '%s' for writing: %s", | |
598 | filename, strerror(errno)); | |
599 | goto done; | |
600 | } | |
601 | ||
602 | if (old_oid) { | |
603 | struct object_id actual_old_oid; | |
604 | ||
605 | if (read_ref(pseudoref, &actual_old_oid)) | |
606 | die("could not read ref '%s'", pseudoref); | |
607 | if (oidcmp(&actual_old_oid, old_oid)) { | |
608 | strbuf_addf(err, "unexpected sha1 when writing '%s'", pseudoref); | |
609 | rollback_lock_file(&lock); | |
610 | goto done; | |
611 | } | |
612 | } | |
613 | ||
614 | if (write_in_full(fd, buf.buf, buf.len) < 0) { | |
615 | strbuf_addf(err, "could not write to '%s'", filename); | |
616 | rollback_lock_file(&lock); | |
617 | goto done; | |
618 | } | |
619 | ||
620 | commit_lock_file(&lock); | |
621 | ret = 0; | |
622 | done: | |
623 | strbuf_release(&buf); | |
624 | return ret; | |
625 | } | |
626 | ||
627 | static int delete_pseudoref(const char *pseudoref, const struct object_id *old_oid) | |
628 | { | |
629 | static struct lock_file lock; | |
630 | const char *filename; | |
631 | ||
632 | filename = git_path("%s", pseudoref); | |
633 | ||
634 | if (old_oid && !is_null_oid(old_oid)) { | |
635 | int fd; | |
636 | struct object_id actual_old_oid; | |
637 | ||
638 | fd = hold_lock_file_for_update_timeout( | |
639 | &lock, filename, LOCK_DIE_ON_ERROR, | |
640 | get_files_ref_lock_timeout_ms()); | |
641 | if (fd < 0) | |
642 | die_errno(_("Could not open '%s' for writing"), filename); | |
643 | if (read_ref(pseudoref, &actual_old_oid)) | |
644 | die("could not read ref '%s'", pseudoref); | |
645 | if (oidcmp(&actual_old_oid, old_oid)) { | |
646 | warning("Unexpected sha1 when deleting %s", pseudoref); | |
647 | rollback_lock_file(&lock); | |
648 | return -1; | |
649 | } | |
650 | ||
651 | unlink(filename); | |
652 | rollback_lock_file(&lock); | |
653 | } else { | |
654 | unlink(filename); | |
655 | } | |
656 | ||
657 | return 0; | |
658 | } | |
659 | ||
660 | int refs_delete_ref(struct ref_store *refs, const char *msg, | |
661 | const char *refname, | |
662 | const struct object_id *old_oid, | |
663 | unsigned int flags) | |
664 | { | |
665 | struct ref_transaction *transaction; | |
666 | struct strbuf err = STRBUF_INIT; | |
667 | ||
668 | if (ref_type(refname) == REF_TYPE_PSEUDOREF) { | |
669 | assert(refs == get_main_ref_store()); | |
670 | return delete_pseudoref(refname, old_oid); | |
671 | } | |
672 | ||
673 | transaction = ref_store_transaction_begin(refs, &err); | |
674 | if (!transaction || | |
675 | ref_transaction_delete(transaction, refname, old_oid, | |
676 | flags, msg, &err) || | |
677 | ref_transaction_commit(transaction, &err)) { | |
678 | error("%s", err.buf); | |
679 | ref_transaction_free(transaction); | |
680 | strbuf_release(&err); | |
681 | return 1; | |
682 | } | |
683 | ref_transaction_free(transaction); | |
684 | strbuf_release(&err); | |
685 | return 0; | |
686 | } | |
687 | ||
688 | int delete_ref(const char *msg, const char *refname, | |
689 | const struct object_id *old_oid, unsigned int flags) | |
690 | { | |
691 | return refs_delete_ref(get_main_ref_store(), msg, refname, | |
692 | old_oid, flags); | |
693 | } | |
694 | ||
695 | int copy_reflog_msg(char *buf, const char *msg) | |
696 | { | |
697 | char *cp = buf; | |
698 | char c; | |
699 | int wasspace = 1; | |
700 | ||
701 | *cp++ = '\t'; | |
702 | while ((c = *msg++)) { | |
703 | if (wasspace && isspace(c)) | |
704 | continue; | |
705 | wasspace = isspace(c); | |
706 | if (wasspace) | |
707 | c = ' '; | |
708 | *cp++ = c; | |
709 | } | |
710 | while (buf < cp && isspace(cp[-1])) | |
711 | cp--; | |
712 | *cp++ = '\n'; | |
713 | return cp - buf; | |
714 | } | |
715 | ||
716 | int should_autocreate_reflog(const char *refname) | |
717 | { | |
718 | switch (log_all_ref_updates) { | |
719 | case LOG_REFS_ALWAYS: | |
720 | return 1; | |
721 | case LOG_REFS_NORMAL: | |
722 | return starts_with(refname, "refs/heads/") || | |
723 | starts_with(refname, "refs/remotes/") || | |
724 | starts_with(refname, "refs/notes/") || | |
725 | !strcmp(refname, "HEAD"); | |
726 | default: | |
727 | return 0; | |
728 | } | |
729 | } | |
730 | ||
731 | int is_branch(const char *refname) | |
732 | { | |
733 | return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/"); | |
734 | } | |
735 | ||
736 | struct read_ref_at_cb { | |
737 | const char *refname; | |
738 | timestamp_t at_time; | |
739 | int cnt; | |
740 | int reccnt; | |
741 | struct object_id *oid; | |
742 | int found_it; | |
743 | ||
744 | struct object_id ooid; | |
745 | struct object_id noid; | |
746 | int tz; | |
747 | timestamp_t date; | |
748 | char **msg; | |
749 | timestamp_t *cutoff_time; | |
750 | int *cutoff_tz; | |
751 | int *cutoff_cnt; | |
752 | }; | |
753 | ||
754 | static int read_ref_at_ent(struct object_id *ooid, struct object_id *noid, | |
755 | const char *email, timestamp_t timestamp, int tz, | |
756 | const char *message, void *cb_data) | |
757 | { | |
758 | struct read_ref_at_cb *cb = cb_data; | |
759 | ||
760 | cb->reccnt++; | |
761 | cb->tz = tz; | |
762 | cb->date = timestamp; | |
763 | ||
764 | if (timestamp <= cb->at_time || cb->cnt == 0) { | |
765 | if (cb->msg) | |
766 | *cb->msg = xstrdup(message); | |
767 | if (cb->cutoff_time) | |
768 | *cb->cutoff_time = timestamp; | |
769 | if (cb->cutoff_tz) | |
770 | *cb->cutoff_tz = tz; | |
771 | if (cb->cutoff_cnt) | |
772 | *cb->cutoff_cnt = cb->reccnt - 1; | |
773 | /* | |
774 | * we have not yet updated cb->[n|o]sha1 so they still | |
775 | * hold the values for the previous record. | |
776 | */ | |
777 | if (!is_null_oid(&cb->ooid)) { | |
778 | oidcpy(cb->oid, noid); | |
779 | if (oidcmp(&cb->ooid, noid)) | |
780 | warning("Log for ref %s has gap after %s.", | |
781 | cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822))); | |
782 | } | |
783 | else if (cb->date == cb->at_time) | |
784 | oidcpy(cb->oid, noid); | |
785 | else if (oidcmp(noid, cb->oid)) | |
786 | warning("Log for ref %s unexpectedly ended on %s.", | |
787 | cb->refname, show_date(cb->date, cb->tz, | |
788 | DATE_MODE(RFC2822))); | |
789 | oidcpy(&cb->ooid, ooid); | |
790 | oidcpy(&cb->noid, noid); | |
791 | cb->found_it = 1; | |
792 | return 1; | |
793 | } | |
794 | oidcpy(&cb->ooid, ooid); | |
795 | oidcpy(&cb->noid, noid); | |
796 | if (cb->cnt > 0) | |
797 | cb->cnt--; | |
798 | return 0; | |
799 | } | |
800 | ||
801 | static int read_ref_at_ent_oldest(struct object_id *ooid, struct object_id *noid, | |
802 | const char *email, timestamp_t timestamp, | |
803 | int tz, const char *message, void *cb_data) | |
804 | { | |
805 | struct read_ref_at_cb *cb = cb_data; | |
806 | ||
807 | if (cb->msg) | |
808 | *cb->msg = xstrdup(message); | |
809 | if (cb->cutoff_time) | |
810 | *cb->cutoff_time = timestamp; | |
811 | if (cb->cutoff_tz) | |
812 | *cb->cutoff_tz = tz; | |
813 | if (cb->cutoff_cnt) | |
814 | *cb->cutoff_cnt = cb->reccnt; | |
815 | oidcpy(cb->oid, ooid); | |
816 | if (is_null_oid(cb->oid)) | |
817 | oidcpy(cb->oid, noid); | |
818 | /* We just want the first entry */ | |
819 | return 1; | |
820 | } | |
821 | ||
822 | int read_ref_at(const char *refname, unsigned int flags, timestamp_t at_time, int cnt, | |
823 | struct object_id *oid, char **msg, | |
824 | timestamp_t *cutoff_time, int *cutoff_tz, int *cutoff_cnt) | |
825 | { | |
826 | struct read_ref_at_cb cb; | |
827 | ||
828 | memset(&cb, 0, sizeof(cb)); | |
829 | cb.refname = refname; | |
830 | cb.at_time = at_time; | |
831 | cb.cnt = cnt; | |
832 | cb.msg = msg; | |
833 | cb.cutoff_time = cutoff_time; | |
834 | cb.cutoff_tz = cutoff_tz; | |
835 | cb.cutoff_cnt = cutoff_cnt; | |
836 | cb.oid = oid; | |
837 | ||
838 | for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb); | |
839 | ||
840 | if (!cb.reccnt) { | |
841 | if (flags & GET_OID_QUIETLY) | |
842 | exit(128); | |
843 | else | |
844 | die("Log for %s is empty.", refname); | |
845 | } | |
846 | if (cb.found_it) | |
847 | return 0; | |
848 | ||
849 | for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb); | |
850 | ||
851 | return 1; | |
852 | } | |
853 | ||
854 | struct ref_transaction *ref_store_transaction_begin(struct ref_store *refs, | |
855 | struct strbuf *err) | |
856 | { | |
857 | struct ref_transaction *tr; | |
858 | assert(err); | |
859 | ||
860 | tr = xcalloc(1, sizeof(struct ref_transaction)); | |
861 | tr->ref_store = refs; | |
862 | return tr; | |
863 | } | |
864 | ||
865 | struct ref_transaction *ref_transaction_begin(struct strbuf *err) | |
866 | { | |
867 | return ref_store_transaction_begin(get_main_ref_store(), err); | |
868 | } | |
869 | ||
870 | void ref_transaction_free(struct ref_transaction *transaction) | |
871 | { | |
872 | size_t i; | |
873 | ||
874 | if (!transaction) | |
875 | return; | |
876 | ||
877 | switch (transaction->state) { | |
878 | case REF_TRANSACTION_OPEN: | |
879 | case REF_TRANSACTION_CLOSED: | |
880 | /* OK */ | |
881 | break; | |
882 | case REF_TRANSACTION_PREPARED: | |
883 | die("BUG: free called on a prepared reference transaction"); | |
884 | break; | |
885 | default: | |
886 | die("BUG: unexpected reference transaction state"); | |
887 | break; | |
888 | } | |
889 | ||
890 | for (i = 0; i < transaction->nr; i++) { | |
891 | free(transaction->updates[i]->msg); | |
892 | free(transaction->updates[i]); | |
893 | } | |
894 | free(transaction->updates); | |
895 | free(transaction); | |
896 | } | |
897 | ||
898 | struct ref_update *ref_transaction_add_update( | |
899 | struct ref_transaction *transaction, | |
900 | const char *refname, unsigned int flags, | |
901 | const struct object_id *new_oid, | |
902 | const struct object_id *old_oid, | |
903 | const char *msg) | |
904 | { | |
905 | struct ref_update *update; | |
906 | ||
907 | if (transaction->state != REF_TRANSACTION_OPEN) | |
908 | die("BUG: update called for transaction that is not open"); | |
909 | ||
910 | if ((flags & REF_ISPRUNING) && !(flags & REF_NODEREF)) | |
911 | die("BUG: REF_ISPRUNING set without REF_NODEREF"); | |
912 | ||
913 | FLEX_ALLOC_STR(update, refname, refname); | |
914 | ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc); | |
915 | transaction->updates[transaction->nr++] = update; | |
916 | ||
917 | update->flags = flags; | |
918 | ||
919 | if (flags & REF_HAVE_NEW) | |
920 | oidcpy(&update->new_oid, new_oid); | |
921 | if (flags & REF_HAVE_OLD) | |
922 | oidcpy(&update->old_oid, old_oid); | |
923 | update->msg = xstrdup_or_null(msg); | |
924 | return update; | |
925 | } | |
926 | ||
927 | int ref_transaction_update(struct ref_transaction *transaction, | |
928 | const char *refname, | |
929 | const struct object_id *new_oid, | |
930 | const struct object_id *old_oid, | |
931 | unsigned int flags, const char *msg, | |
932 | struct strbuf *err) | |
933 | { | |
934 | assert(err); | |
935 | ||
936 | if ((new_oid && !is_null_oid(new_oid)) ? | |
937 | check_refname_format(refname, REFNAME_ALLOW_ONELEVEL) : | |
938 | !refname_is_safe(refname)) { | |
939 | strbuf_addf(err, "refusing to update ref with bad name '%s'", | |
940 | refname); | |
941 | return -1; | |
942 | } | |
943 | ||
944 | flags &= REF_TRANSACTION_UPDATE_ALLOWED_FLAGS; | |
945 | ||
946 | flags |= (new_oid ? REF_HAVE_NEW : 0) | (old_oid ? REF_HAVE_OLD : 0); | |
947 | ||
948 | ref_transaction_add_update(transaction, refname, flags, | |
949 | new_oid, old_oid, msg); | |
950 | return 0; | |
951 | } | |
952 | ||
953 | int ref_transaction_create(struct ref_transaction *transaction, | |
954 | const char *refname, | |
955 | const struct object_id *new_oid, | |
956 | unsigned int flags, const char *msg, | |
957 | struct strbuf *err) | |
958 | { | |
959 | if (!new_oid || is_null_oid(new_oid)) | |
960 | die("BUG: create called without valid new_oid"); | |
961 | return ref_transaction_update(transaction, refname, new_oid, | |
962 | &null_oid, flags, msg, err); | |
963 | } | |
964 | ||
965 | int ref_transaction_delete(struct ref_transaction *transaction, | |
966 | const char *refname, | |
967 | const struct object_id *old_oid, | |
968 | unsigned int flags, const char *msg, | |
969 | struct strbuf *err) | |
970 | { | |
971 | if (old_oid && is_null_oid(old_oid)) | |
972 | die("BUG: delete called with old_oid set to zeros"); | |
973 | return ref_transaction_update(transaction, refname, | |
974 | &null_oid, old_oid, | |
975 | flags, msg, err); | |
976 | } | |
977 | ||
978 | int ref_transaction_verify(struct ref_transaction *transaction, | |
979 | const char *refname, | |
980 | const struct object_id *old_oid, | |
981 | unsigned int flags, | |
982 | struct strbuf *err) | |
983 | { | |
984 | if (!old_oid) | |
985 | die("BUG: verify called with old_oid set to NULL"); | |
986 | return ref_transaction_update(transaction, refname, | |
987 | NULL, old_oid, | |
988 | flags, NULL, err); | |
989 | } | |
990 | ||
991 | int refs_update_ref(struct ref_store *refs, const char *msg, | |
992 | const char *refname, const struct object_id *new_oid, | |
993 | const struct object_id *old_oid, unsigned int flags, | |
994 | enum action_on_err onerr) | |
995 | { | |
996 | struct ref_transaction *t = NULL; | |
997 | struct strbuf err = STRBUF_INIT; | |
998 | int ret = 0; | |
999 | ||
1000 | if (ref_type(refname) == REF_TYPE_PSEUDOREF) { | |
1001 | assert(refs == get_main_ref_store()); | |
1002 | ret = write_pseudoref(refname, new_oid, old_oid, &err); | |
1003 | } else { | |
1004 | t = ref_store_transaction_begin(refs, &err); | |
1005 | if (!t || | |
1006 | ref_transaction_update(t, refname, new_oid, old_oid, | |
1007 | flags, msg, &err) || | |
1008 | ref_transaction_commit(t, &err)) { | |
1009 | ret = 1; | |
1010 | ref_transaction_free(t); | |
1011 | } | |
1012 | } | |
1013 | if (ret) { | |
1014 | const char *str = "update_ref failed for ref '%s': %s"; | |
1015 | ||
1016 | switch (onerr) { | |
1017 | case UPDATE_REFS_MSG_ON_ERR: | |
1018 | error(str, refname, err.buf); | |
1019 | break; | |
1020 | case UPDATE_REFS_DIE_ON_ERR: | |
1021 | die(str, refname, err.buf); | |
1022 | break; | |
1023 | case UPDATE_REFS_QUIET_ON_ERR: | |
1024 | break; | |
1025 | } | |
1026 | strbuf_release(&err); | |
1027 | return 1; | |
1028 | } | |
1029 | strbuf_release(&err); | |
1030 | if (t) | |
1031 | ref_transaction_free(t); | |
1032 | return 0; | |
1033 | } | |
1034 | ||
1035 | int update_ref(const char *msg, const char *refname, | |
1036 | const struct object_id *new_oid, | |
1037 | const struct object_id *old_oid, | |
1038 | unsigned int flags, enum action_on_err onerr) | |
1039 | { | |
1040 | return refs_update_ref(get_main_ref_store(), msg, refname, new_oid, | |
1041 | old_oid, flags, onerr); | |
1042 | } | |
1043 | ||
1044 | char *shorten_unambiguous_ref(const char *refname, int strict) | |
1045 | { | |
1046 | int i; | |
1047 | static char **scanf_fmts; | |
1048 | static int nr_rules; | |
1049 | char *short_name; | |
1050 | struct strbuf resolved_buf = STRBUF_INIT; | |
1051 | ||
1052 | if (!nr_rules) { | |
1053 | /* | |
1054 | * Pre-generate scanf formats from ref_rev_parse_rules[]. | |
1055 | * Generate a format suitable for scanf from a | |
1056 | * ref_rev_parse_rules rule by interpolating "%s" at the | |
1057 | * location of the "%.*s". | |
1058 | */ | |
1059 | size_t total_len = 0; | |
1060 | size_t offset = 0; | |
1061 | ||
1062 | /* the rule list is NULL terminated, count them first */ | |
1063 | for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++) | |
1064 | /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */ | |
1065 | total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1; | |
1066 | ||
1067 | scanf_fmts = xmalloc(st_add(st_mult(sizeof(char *), nr_rules), total_len)); | |
1068 | ||
1069 | offset = 0; | |
1070 | for (i = 0; i < nr_rules; i++) { | |
1071 | assert(offset < total_len); | |
1072 | scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset; | |
1073 | offset += snprintf(scanf_fmts[i], total_len - offset, | |
1074 | ref_rev_parse_rules[i], 2, "%s") + 1; | |
1075 | } | |
1076 | } | |
1077 | ||
1078 | /* bail out if there are no rules */ | |
1079 | if (!nr_rules) | |
1080 | return xstrdup(refname); | |
1081 | ||
1082 | /* buffer for scanf result, at most refname must fit */ | |
1083 | short_name = xstrdup(refname); | |
1084 | ||
1085 | /* skip first rule, it will always match */ | |
1086 | for (i = nr_rules - 1; i > 0 ; --i) { | |
1087 | int j; | |
1088 | int rules_to_fail = i; | |
1089 | int short_name_len; | |
1090 | ||
1091 | if (1 != sscanf(refname, scanf_fmts[i], short_name)) | |
1092 | continue; | |
1093 | ||
1094 | short_name_len = strlen(short_name); | |
1095 | ||
1096 | /* | |
1097 | * in strict mode, all (except the matched one) rules | |
1098 | * must fail to resolve to a valid non-ambiguous ref | |
1099 | */ | |
1100 | if (strict) | |
1101 | rules_to_fail = nr_rules; | |
1102 | ||
1103 | /* | |
1104 | * check if the short name resolves to a valid ref, | |
1105 | * but use only rules prior to the matched one | |
1106 | */ | |
1107 | for (j = 0; j < rules_to_fail; j++) { | |
1108 | const char *rule = ref_rev_parse_rules[j]; | |
1109 | ||
1110 | /* skip matched rule */ | |
1111 | if (i == j) | |
1112 | continue; | |
1113 | ||
1114 | /* | |
1115 | * the short name is ambiguous, if it resolves | |
1116 | * (with this previous rule) to a valid ref | |
1117 | * read_ref() returns 0 on success | |
1118 | */ | |
1119 | strbuf_reset(&resolved_buf); | |
1120 | strbuf_addf(&resolved_buf, rule, | |
1121 | short_name_len, short_name); | |
1122 | if (ref_exists(resolved_buf.buf)) | |
1123 | break; | |
1124 | } | |
1125 | ||
1126 | /* | |
1127 | * short name is non-ambiguous if all previous rules | |
1128 | * haven't resolved to a valid ref | |
1129 | */ | |
1130 | if (j == rules_to_fail) { | |
1131 | strbuf_release(&resolved_buf); | |
1132 | return short_name; | |
1133 | } | |
1134 | } | |
1135 | ||
1136 | strbuf_release(&resolved_buf); | |
1137 | free(short_name); | |
1138 | return xstrdup(refname); | |
1139 | } | |
1140 | ||
1141 | static struct string_list *hide_refs; | |
1142 | ||
1143 | int parse_hide_refs_config(const char *var, const char *value, const char *section) | |
1144 | { | |
1145 | const char *key; | |
1146 | if (!strcmp("transfer.hiderefs", var) || | |
1147 | (!parse_config_key(var, section, NULL, NULL, &key) && | |
1148 | !strcmp(key, "hiderefs"))) { | |
1149 | char *ref; | |
1150 | int len; | |
1151 | ||
1152 | if (!value) | |
1153 | return config_error_nonbool(var); | |
1154 | ref = xstrdup(value); | |
1155 | len = strlen(ref); | |
1156 | while (len && ref[len - 1] == '/') | |
1157 | ref[--len] = '\0'; | |
1158 | if (!hide_refs) { | |
1159 | hide_refs = xcalloc(1, sizeof(*hide_refs)); | |
1160 | hide_refs->strdup_strings = 1; | |
1161 | } | |
1162 | string_list_append(hide_refs, ref); | |
1163 | } | |
1164 | return 0; | |
1165 | } | |
1166 | ||
1167 | int ref_is_hidden(const char *refname, const char *refname_full) | |
1168 | { | |
1169 | int i; | |
1170 | ||
1171 | if (!hide_refs) | |
1172 | return 0; | |
1173 | for (i = hide_refs->nr - 1; i >= 0; i--) { | |
1174 | const char *match = hide_refs->items[i].string; | |
1175 | const char *subject; | |
1176 | int neg = 0; | |
1177 | const char *p; | |
1178 | ||
1179 | if (*match == '!') { | |
1180 | neg = 1; | |
1181 | match++; | |
1182 | } | |
1183 | ||
1184 | if (*match == '^') { | |
1185 | subject = refname_full; | |
1186 | match++; | |
1187 | } else { | |
1188 | subject = refname; | |
1189 | } | |
1190 | ||
1191 | /* refname can be NULL when namespaces are used. */ | |
1192 | if (subject && | |
1193 | skip_prefix(subject, match, &p) && | |
1194 | (!*p || *p == '/')) | |
1195 | return !neg; | |
1196 | } | |
1197 | return 0; | |
1198 | } | |
1199 | ||
1200 | const char *find_descendant_ref(const char *dirname, | |
1201 | const struct string_list *extras, | |
1202 | const struct string_list *skip) | |
1203 | { | |
1204 | int pos; | |
1205 | ||
1206 | if (!extras) | |
1207 | return NULL; | |
1208 | ||
1209 | /* | |
1210 | * Look at the place where dirname would be inserted into | |
1211 | * extras. If there is an entry at that position that starts | |
1212 | * with dirname (remember, dirname includes the trailing | |
1213 | * slash) and is not in skip, then we have a conflict. | |
1214 | */ | |
1215 | for (pos = string_list_find_insert_index(extras, dirname, 0); | |
1216 | pos < extras->nr; pos++) { | |
1217 | const char *extra_refname = extras->items[pos].string; | |
1218 | ||
1219 | if (!starts_with(extra_refname, dirname)) | |
1220 | break; | |
1221 | ||
1222 | if (!skip || !string_list_has_string(skip, extra_refname)) | |
1223 | return extra_refname; | |
1224 | } | |
1225 | return NULL; | |
1226 | } | |
1227 | ||
1228 | int refs_rename_ref_available(struct ref_store *refs, | |
1229 | const char *old_refname, | |
1230 | const char *new_refname) | |
1231 | { | |
1232 | struct string_list skip = STRING_LIST_INIT_NODUP; | |
1233 | struct strbuf err = STRBUF_INIT; | |
1234 | int ok; | |
1235 | ||
1236 | string_list_insert(&skip, old_refname); | |
1237 | ok = !refs_verify_refname_available(refs, new_refname, | |
1238 | NULL, &skip, &err); | |
1239 | if (!ok) | |
1240 | error("%s", err.buf); | |
1241 | ||
1242 | string_list_clear(&skip, 0); | |
1243 | strbuf_release(&err); | |
1244 | return ok; | |
1245 | } | |
1246 | ||
1247 | int refs_head_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
1248 | { | |
1249 | struct object_id oid; | |
1250 | int flag; | |
1251 | ||
1252 | if (!refs_read_ref_full(refs, "HEAD", RESOLVE_REF_READING, | |
1253 | &oid, &flag)) | |
1254 | return fn("HEAD", &oid, flag, cb_data); | |
1255 | ||
1256 | return 0; | |
1257 | } | |
1258 | ||
1259 | int head_ref(each_ref_fn fn, void *cb_data) | |
1260 | { | |
1261 | return refs_head_ref(get_main_ref_store(), fn, cb_data); | |
1262 | } | |
1263 | ||
1264 | struct ref_iterator *refs_ref_iterator_begin( | |
1265 | struct ref_store *refs, | |
1266 | const char *prefix, int trim, int flags) | |
1267 | { | |
1268 | struct ref_iterator *iter; | |
1269 | ||
1270 | if (ref_paranoia < 0) | |
1271 | ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0); | |
1272 | if (ref_paranoia) | |
1273 | flags |= DO_FOR_EACH_INCLUDE_BROKEN; | |
1274 | ||
1275 | iter = refs->be->iterator_begin(refs, prefix, flags); | |
1276 | ||
1277 | /* | |
1278 | * `iterator_begin()` already takes care of prefix, but we | |
1279 | * might need to do some trimming: | |
1280 | */ | |
1281 | if (trim) | |
1282 | iter = prefix_ref_iterator_begin(iter, "", trim); | |
1283 | ||
1284 | /* Sanity check for subclasses: */ | |
1285 | if (!iter->ordered) | |
1286 | BUG("reference iterator is not ordered"); | |
1287 | ||
1288 | return iter; | |
1289 | } | |
1290 | ||
1291 | /* | |
1292 | * Call fn for each reference in the specified submodule for which the | |
1293 | * refname begins with prefix. If trim is non-zero, then trim that | |
1294 | * many characters off the beginning of each refname before passing | |
1295 | * the refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to | |
1296 | * include broken references in the iteration. If fn ever returns a | |
1297 | * non-zero value, stop the iteration and return that value; | |
1298 | * otherwise, return 0. | |
1299 | */ | |
1300 | static int do_for_each_ref(struct ref_store *refs, const char *prefix, | |
1301 | each_ref_fn fn, int trim, int flags, void *cb_data) | |
1302 | { | |
1303 | struct ref_iterator *iter; | |
1304 | ||
1305 | if (!refs) | |
1306 | return 0; | |
1307 | ||
1308 | iter = refs_ref_iterator_begin(refs, prefix, trim, flags); | |
1309 | ||
1310 | return do_for_each_ref_iterator(iter, fn, cb_data); | |
1311 | } | |
1312 | ||
1313 | int refs_for_each_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
1314 | { | |
1315 | return do_for_each_ref(refs, "", fn, 0, 0, cb_data); | |
1316 | } | |
1317 | ||
1318 | int for_each_ref(each_ref_fn fn, void *cb_data) | |
1319 | { | |
1320 | return refs_for_each_ref(get_main_ref_store(), fn, cb_data); | |
1321 | } | |
1322 | ||
1323 | int refs_for_each_ref_in(struct ref_store *refs, const char *prefix, | |
1324 | each_ref_fn fn, void *cb_data) | |
1325 | { | |
1326 | return do_for_each_ref(refs, prefix, fn, strlen(prefix), 0, cb_data); | |
1327 | } | |
1328 | ||
1329 | int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data) | |
1330 | { | |
1331 | return refs_for_each_ref_in(get_main_ref_store(), prefix, fn, cb_data); | |
1332 | } | |
1333 | ||
1334 | int for_each_fullref_in(const char *prefix, each_ref_fn fn, void *cb_data, unsigned int broken) | |
1335 | { | |
1336 | unsigned int flag = 0; | |
1337 | ||
1338 | if (broken) | |
1339 | flag = DO_FOR_EACH_INCLUDE_BROKEN; | |
1340 | return do_for_each_ref(get_main_ref_store(), | |
1341 | prefix, fn, 0, flag, cb_data); | |
1342 | } | |
1343 | ||
1344 | int refs_for_each_fullref_in(struct ref_store *refs, const char *prefix, | |
1345 | each_ref_fn fn, void *cb_data, | |
1346 | unsigned int broken) | |
1347 | { | |
1348 | unsigned int flag = 0; | |
1349 | ||
1350 | if (broken) | |
1351 | flag = DO_FOR_EACH_INCLUDE_BROKEN; | |
1352 | return do_for_each_ref(refs, prefix, fn, 0, flag, cb_data); | |
1353 | } | |
1354 | ||
1355 | int for_each_replace_ref(each_ref_fn fn, void *cb_data) | |
1356 | { | |
1357 | return do_for_each_ref(get_main_ref_store(), | |
1358 | git_replace_ref_base, fn, | |
1359 | strlen(git_replace_ref_base), | |
1360 | DO_FOR_EACH_INCLUDE_BROKEN, cb_data); | |
1361 | } | |
1362 | ||
1363 | int for_each_namespaced_ref(each_ref_fn fn, void *cb_data) | |
1364 | { | |
1365 | struct strbuf buf = STRBUF_INIT; | |
1366 | int ret; | |
1367 | strbuf_addf(&buf, "%srefs/", get_git_namespace()); | |
1368 | ret = do_for_each_ref(get_main_ref_store(), | |
1369 | buf.buf, fn, 0, 0, cb_data); | |
1370 | strbuf_release(&buf); | |
1371 | return ret; | |
1372 | } | |
1373 | ||
1374 | int refs_for_each_rawref(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
1375 | { | |
1376 | return do_for_each_ref(refs, "", fn, 0, | |
1377 | DO_FOR_EACH_INCLUDE_BROKEN, cb_data); | |
1378 | } | |
1379 | ||
1380 | int for_each_rawref(each_ref_fn fn, void *cb_data) | |
1381 | { | |
1382 | return refs_for_each_rawref(get_main_ref_store(), fn, cb_data); | |
1383 | } | |
1384 | ||
1385 | int refs_read_raw_ref(struct ref_store *ref_store, | |
1386 | const char *refname, unsigned char *sha1, | |
1387 | struct strbuf *referent, unsigned int *type) | |
1388 | { | |
1389 | return ref_store->be->read_raw_ref(ref_store, refname, sha1, referent, type); | |
1390 | } | |
1391 | ||
1392 | /* This function needs to return a meaningful errno on failure */ | |
1393 | const char *refs_resolve_ref_unsafe(struct ref_store *refs, | |
1394 | const char *refname, | |
1395 | int resolve_flags, | |
1396 | unsigned char *sha1, int *flags) | |
1397 | { | |
1398 | static struct strbuf sb_refname = STRBUF_INIT; | |
1399 | struct object_id unused_oid; | |
1400 | int unused_flags; | |
1401 | int symref_count; | |
1402 | ||
1403 | if (!sha1) | |
1404 | sha1 = unused_oid.hash; | |
1405 | if (!flags) | |
1406 | flags = &unused_flags; | |
1407 | ||
1408 | *flags = 0; | |
1409 | ||
1410 | if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) { | |
1411 | if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) || | |
1412 | !refname_is_safe(refname)) { | |
1413 | errno = EINVAL; | |
1414 | return NULL; | |
1415 | } | |
1416 | ||
1417 | /* | |
1418 | * dwim_ref() uses REF_ISBROKEN to distinguish between | |
1419 | * missing refs and refs that were present but invalid, | |
1420 | * to complain about the latter to stderr. | |
1421 | * | |
1422 | * We don't know whether the ref exists, so don't set | |
1423 | * REF_ISBROKEN yet. | |
1424 | */ | |
1425 | *flags |= REF_BAD_NAME; | |
1426 | } | |
1427 | ||
1428 | for (symref_count = 0; symref_count < SYMREF_MAXDEPTH; symref_count++) { | |
1429 | unsigned int read_flags = 0; | |
1430 | ||
1431 | if (refs_read_raw_ref(refs, refname, | |
1432 | sha1, &sb_refname, &read_flags)) { | |
1433 | *flags |= read_flags; | |
1434 | ||
1435 | /* In reading mode, refs must eventually resolve */ | |
1436 | if (resolve_flags & RESOLVE_REF_READING) | |
1437 | return NULL; | |
1438 | ||
1439 | /* | |
1440 | * Otherwise a missing ref is OK. But the files backend | |
1441 | * may show errors besides ENOENT if there are | |
1442 | * similarly-named refs. | |
1443 | */ | |
1444 | if (errno != ENOENT && | |
1445 | errno != EISDIR && | |
1446 | errno != ENOTDIR) | |
1447 | return NULL; | |
1448 | ||
1449 | hashclr(sha1); | |
1450 | if (*flags & REF_BAD_NAME) | |
1451 | *flags |= REF_ISBROKEN; | |
1452 | return refname; | |
1453 | } | |
1454 | ||
1455 | *flags |= read_flags; | |
1456 | ||
1457 | if (!(read_flags & REF_ISSYMREF)) { | |
1458 | if (*flags & REF_BAD_NAME) { | |
1459 | hashclr(sha1); | |
1460 | *flags |= REF_ISBROKEN; | |
1461 | } | |
1462 | return refname; | |
1463 | } | |
1464 | ||
1465 | refname = sb_refname.buf; | |
1466 | if (resolve_flags & RESOLVE_REF_NO_RECURSE) { | |
1467 | hashclr(sha1); | |
1468 | return refname; | |
1469 | } | |
1470 | if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) { | |
1471 | if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) || | |
1472 | !refname_is_safe(refname)) { | |
1473 | errno = EINVAL; | |
1474 | return NULL; | |
1475 | } | |
1476 | ||
1477 | *flags |= REF_ISBROKEN | REF_BAD_NAME; | |
1478 | } | |
1479 | } | |
1480 | ||
1481 | errno = ELOOP; | |
1482 | return NULL; | |
1483 | } | |
1484 | ||
1485 | /* backend functions */ | |
1486 | int refs_init_db(struct strbuf *err) | |
1487 | { | |
1488 | struct ref_store *refs = get_main_ref_store(); | |
1489 | ||
1490 | return refs->be->init_db(refs, err); | |
1491 | } | |
1492 | ||
1493 | const char *resolve_ref_unsafe(const char *refname, int resolve_flags, | |
1494 | unsigned char *sha1, int *flags) | |
1495 | { | |
1496 | return refs_resolve_ref_unsafe(get_main_ref_store(), refname, | |
1497 | resolve_flags, sha1, flags); | |
1498 | } | |
1499 | ||
1500 | int resolve_gitlink_ref(const char *submodule, const char *refname, | |
1501 | unsigned char *sha1) | |
1502 | { | |
1503 | struct ref_store *refs; | |
1504 | int flags; | |
1505 | ||
1506 | refs = get_submodule_ref_store(submodule); | |
1507 | ||
1508 | if (!refs) | |
1509 | return -1; | |
1510 | ||
1511 | if (!refs_resolve_ref_unsafe(refs, refname, 0, sha1, &flags) || | |
1512 | is_null_sha1(sha1)) | |
1513 | return -1; | |
1514 | return 0; | |
1515 | } | |
1516 | ||
1517 | struct ref_store_hash_entry | |
1518 | { | |
1519 | struct hashmap_entry ent; /* must be the first member! */ | |
1520 | ||
1521 | struct ref_store *refs; | |
1522 | ||
1523 | /* NUL-terminated identifier of the ref store: */ | |
1524 | char name[FLEX_ARRAY]; | |
1525 | }; | |
1526 | ||
1527 | static int ref_store_hash_cmp(const void *unused_cmp_data, | |
1528 | const void *entry, const void *entry_or_key, | |
1529 | const void *keydata) | |
1530 | { | |
1531 | const struct ref_store_hash_entry *e1 = entry, *e2 = entry_or_key; | |
1532 | const char *name = keydata ? keydata : e2->name; | |
1533 | ||
1534 | return strcmp(e1->name, name); | |
1535 | } | |
1536 | ||
1537 | static struct ref_store_hash_entry *alloc_ref_store_hash_entry( | |
1538 | const char *name, struct ref_store *refs) | |
1539 | { | |
1540 | struct ref_store_hash_entry *entry; | |
1541 | ||
1542 | FLEX_ALLOC_STR(entry, name, name); | |
1543 | hashmap_entry_init(entry, strhash(name)); | |
1544 | entry->refs = refs; | |
1545 | return entry; | |
1546 | } | |
1547 | ||
1548 | /* A pointer to the ref_store for the main repository: */ | |
1549 | static struct ref_store *main_ref_store; | |
1550 | ||
1551 | /* A hashmap of ref_stores, stored by submodule name: */ | |
1552 | static struct hashmap submodule_ref_stores; | |
1553 | ||
1554 | /* A hashmap of ref_stores, stored by worktree id: */ | |
1555 | static struct hashmap worktree_ref_stores; | |
1556 | ||
1557 | /* | |
1558 | * Look up a ref store by name. If that ref_store hasn't been | |
1559 | * registered yet, return NULL. | |
1560 | */ | |
1561 | static struct ref_store *lookup_ref_store_map(struct hashmap *map, | |
1562 | const char *name) | |
1563 | { | |
1564 | struct ref_store_hash_entry *entry; | |
1565 | ||
1566 | if (!map->tablesize) | |
1567 | /* It's initialized on demand in register_ref_store(). */ | |
1568 | return NULL; | |
1569 | ||
1570 | entry = hashmap_get_from_hash(map, strhash(name), name); | |
1571 | return entry ? entry->refs : NULL; | |
1572 | } | |
1573 | ||
1574 | /* | |
1575 | * Create, record, and return a ref_store instance for the specified | |
1576 | * gitdir. | |
1577 | */ | |
1578 | static struct ref_store *ref_store_init(const char *gitdir, | |
1579 | unsigned int flags) | |
1580 | { | |
1581 | const char *be_name = "files"; | |
1582 | struct ref_storage_be *be = find_ref_storage_backend(be_name); | |
1583 | struct ref_store *refs; | |
1584 | ||
1585 | if (!be) | |
1586 | die("BUG: reference backend %s is unknown", be_name); | |
1587 | ||
1588 | refs = be->init(gitdir, flags); | |
1589 | return refs; | |
1590 | } | |
1591 | ||
1592 | struct ref_store *get_main_ref_store(void) | |
1593 | { | |
1594 | if (main_ref_store) | |
1595 | return main_ref_store; | |
1596 | ||
1597 | main_ref_store = ref_store_init(get_git_dir(), REF_STORE_ALL_CAPS); | |
1598 | return main_ref_store; | |
1599 | } | |
1600 | ||
1601 | /* | |
1602 | * Associate a ref store with a name. It is a fatal error to call this | |
1603 | * function twice for the same name. | |
1604 | */ | |
1605 | static void register_ref_store_map(struct hashmap *map, | |
1606 | const char *type, | |
1607 | struct ref_store *refs, | |
1608 | const char *name) | |
1609 | { | |
1610 | if (!map->tablesize) | |
1611 | hashmap_init(map, ref_store_hash_cmp, NULL, 0); | |
1612 | ||
1613 | if (hashmap_put(map, alloc_ref_store_hash_entry(name, refs))) | |
1614 | die("BUG: %s ref_store '%s' initialized twice", type, name); | |
1615 | } | |
1616 | ||
1617 | struct ref_store *get_submodule_ref_store(const char *submodule) | |
1618 | { | |
1619 | struct strbuf submodule_sb = STRBUF_INIT; | |
1620 | struct ref_store *refs; | |
1621 | char *to_free = NULL; | |
1622 | size_t len; | |
1623 | ||
1624 | if (!submodule) | |
1625 | return NULL; | |
1626 | ||
1627 | len = strlen(submodule); | |
1628 | while (len && is_dir_sep(submodule[len - 1])) | |
1629 | len--; | |
1630 | if (!len) | |
1631 | return NULL; | |
1632 | ||
1633 | if (submodule[len]) | |
1634 | /* We need to strip off one or more trailing slashes */ | |
1635 | submodule = to_free = xmemdupz(submodule, len); | |
1636 | ||
1637 | refs = lookup_ref_store_map(&submodule_ref_stores, submodule); | |
1638 | if (refs) | |
1639 | goto done; | |
1640 | ||
1641 | strbuf_addstr(&submodule_sb, submodule); | |
1642 | if (!is_nonbare_repository_dir(&submodule_sb)) | |
1643 | goto done; | |
1644 | ||
1645 | if (submodule_to_gitdir(&submodule_sb, submodule)) | |
1646 | goto done; | |
1647 | ||
1648 | /* assume that add_submodule_odb() has been called */ | |
1649 | refs = ref_store_init(submodule_sb.buf, | |
1650 | REF_STORE_READ | REF_STORE_ODB); | |
1651 | register_ref_store_map(&submodule_ref_stores, "submodule", | |
1652 | refs, submodule); | |
1653 | ||
1654 | done: | |
1655 | strbuf_release(&submodule_sb); | |
1656 | free(to_free); | |
1657 | ||
1658 | return refs; | |
1659 | } | |
1660 | ||
1661 | struct ref_store *get_worktree_ref_store(const struct worktree *wt) | |
1662 | { | |
1663 | struct ref_store *refs; | |
1664 | const char *id; | |
1665 | ||
1666 | if (wt->is_current) | |
1667 | return get_main_ref_store(); | |
1668 | ||
1669 | id = wt->id ? wt->id : "/"; | |
1670 | refs = lookup_ref_store_map(&worktree_ref_stores, id); | |
1671 | if (refs) | |
1672 | return refs; | |
1673 | ||
1674 | if (wt->id) | |
1675 | refs = ref_store_init(git_common_path("worktrees/%s", wt->id), | |
1676 | REF_STORE_ALL_CAPS); | |
1677 | else | |
1678 | refs = ref_store_init(get_git_common_dir(), | |
1679 | REF_STORE_ALL_CAPS); | |
1680 | ||
1681 | if (refs) | |
1682 | register_ref_store_map(&worktree_ref_stores, "worktree", | |
1683 | refs, id); | |
1684 | return refs; | |
1685 | } | |
1686 | ||
1687 | void base_ref_store_init(struct ref_store *refs, | |
1688 | const struct ref_storage_be *be) | |
1689 | { | |
1690 | refs->be = be; | |
1691 | } | |
1692 | ||
1693 | /* backend functions */ | |
1694 | int refs_pack_refs(struct ref_store *refs, unsigned int flags) | |
1695 | { | |
1696 | return refs->be->pack_refs(refs, flags); | |
1697 | } | |
1698 | ||
1699 | int refs_peel_ref(struct ref_store *refs, const char *refname, | |
1700 | struct object_id *oid) | |
1701 | { | |
1702 | int flag; | |
1703 | struct object_id base; | |
1704 | ||
1705 | if (current_ref_iter && current_ref_iter->refname == refname) { | |
1706 | struct object_id peeled; | |
1707 | ||
1708 | if (ref_iterator_peel(current_ref_iter, &peeled)) | |
1709 | return -1; | |
1710 | oidcpy(oid, &peeled); | |
1711 | return 0; | |
1712 | } | |
1713 | ||
1714 | if (refs_read_ref_full(refs, refname, | |
1715 | RESOLVE_REF_READING, &base, &flag)) | |
1716 | return -1; | |
1717 | ||
1718 | return peel_object(base.hash, oid->hash); | |
1719 | } | |
1720 | ||
1721 | int peel_ref(const char *refname, struct object_id *oid) | |
1722 | { | |
1723 | return refs_peel_ref(get_main_ref_store(), refname, oid); | |
1724 | } | |
1725 | ||
1726 | int refs_create_symref(struct ref_store *refs, | |
1727 | const char *ref_target, | |
1728 | const char *refs_heads_master, | |
1729 | const char *logmsg) | |
1730 | { | |
1731 | return refs->be->create_symref(refs, ref_target, | |
1732 | refs_heads_master, | |
1733 | logmsg); | |
1734 | } | |
1735 | ||
1736 | int create_symref(const char *ref_target, const char *refs_heads_master, | |
1737 | const char *logmsg) | |
1738 | { | |
1739 | return refs_create_symref(get_main_ref_store(), ref_target, | |
1740 | refs_heads_master, logmsg); | |
1741 | } | |
1742 | ||
1743 | int ref_update_reject_duplicates(struct string_list *refnames, | |
1744 | struct strbuf *err) | |
1745 | { | |
1746 | size_t i, n = refnames->nr; | |
1747 | ||
1748 | assert(err); | |
1749 | ||
1750 | for (i = 1; i < n; i++) { | |
1751 | int cmp = strcmp(refnames->items[i - 1].string, | |
1752 | refnames->items[i].string); | |
1753 | ||
1754 | if (!cmp) { | |
1755 | strbuf_addf(err, | |
1756 | "multiple updates for ref '%s' not allowed.", | |
1757 | refnames->items[i].string); | |
1758 | return 1; | |
1759 | } else if (cmp > 0) { | |
1760 | die("BUG: ref_update_reject_duplicates() received unsorted list"); | |
1761 | } | |
1762 | } | |
1763 | return 0; | |
1764 | } | |
1765 | ||
1766 | int ref_transaction_prepare(struct ref_transaction *transaction, | |
1767 | struct strbuf *err) | |
1768 | { | |
1769 | struct ref_store *refs = transaction->ref_store; | |
1770 | ||
1771 | switch (transaction->state) { | |
1772 | case REF_TRANSACTION_OPEN: | |
1773 | /* Good. */ | |
1774 | break; | |
1775 | case REF_TRANSACTION_PREPARED: | |
1776 | die("BUG: prepare called twice on reference transaction"); | |
1777 | break; | |
1778 | case REF_TRANSACTION_CLOSED: | |
1779 | die("BUG: prepare called on a closed reference transaction"); | |
1780 | break; | |
1781 | default: | |
1782 | die("BUG: unexpected reference transaction state"); | |
1783 | break; | |
1784 | } | |
1785 | ||
1786 | if (getenv(GIT_QUARANTINE_ENVIRONMENT)) { | |
1787 | strbuf_addstr(err, | |
1788 | _("ref updates forbidden inside quarantine environment")); | |
1789 | return -1; | |
1790 | } | |
1791 | ||
1792 | return refs->be->transaction_prepare(refs, transaction, err); | |
1793 | } | |
1794 | ||
1795 | int ref_transaction_abort(struct ref_transaction *transaction, | |
1796 | struct strbuf *err) | |
1797 | { | |
1798 | struct ref_store *refs = transaction->ref_store; | |
1799 | int ret = 0; | |
1800 | ||
1801 | switch (transaction->state) { | |
1802 | case REF_TRANSACTION_OPEN: | |
1803 | /* No need to abort explicitly. */ | |
1804 | break; | |
1805 | case REF_TRANSACTION_PREPARED: | |
1806 | ret = refs->be->transaction_abort(refs, transaction, err); | |
1807 | break; | |
1808 | case REF_TRANSACTION_CLOSED: | |
1809 | die("BUG: abort called on a closed reference transaction"); | |
1810 | break; | |
1811 | default: | |
1812 | die("BUG: unexpected reference transaction state"); | |
1813 | break; | |
1814 | } | |
1815 | ||
1816 | ref_transaction_free(transaction); | |
1817 | return ret; | |
1818 | } | |
1819 | ||
1820 | int ref_transaction_commit(struct ref_transaction *transaction, | |
1821 | struct strbuf *err) | |
1822 | { | |
1823 | struct ref_store *refs = transaction->ref_store; | |
1824 | int ret; | |
1825 | ||
1826 | switch (transaction->state) { | |
1827 | case REF_TRANSACTION_OPEN: | |
1828 | /* Need to prepare first. */ | |
1829 | ret = ref_transaction_prepare(transaction, err); | |
1830 | if (ret) | |
1831 | return ret; | |
1832 | break; | |
1833 | case REF_TRANSACTION_PREPARED: | |
1834 | /* Fall through to finish. */ | |
1835 | break; | |
1836 | case REF_TRANSACTION_CLOSED: | |
1837 | die("BUG: commit called on a closed reference transaction"); | |
1838 | break; | |
1839 | default: | |
1840 | die("BUG: unexpected reference transaction state"); | |
1841 | break; | |
1842 | } | |
1843 | ||
1844 | return refs->be->transaction_finish(refs, transaction, err); | |
1845 | } | |
1846 | ||
1847 | int refs_verify_refname_available(struct ref_store *refs, | |
1848 | const char *refname, | |
1849 | const struct string_list *extras, | |
1850 | const struct string_list *skip, | |
1851 | struct strbuf *err) | |
1852 | { | |
1853 | const char *slash; | |
1854 | const char *extra_refname; | |
1855 | struct strbuf dirname = STRBUF_INIT; | |
1856 | struct strbuf referent = STRBUF_INIT; | |
1857 | struct object_id oid; | |
1858 | unsigned int type; | |
1859 | struct ref_iterator *iter; | |
1860 | int ok; | |
1861 | int ret = -1; | |
1862 | ||
1863 | /* | |
1864 | * For the sake of comments in this function, suppose that | |
1865 | * refname is "refs/foo/bar". | |
1866 | */ | |
1867 | ||
1868 | assert(err); | |
1869 | ||
1870 | strbuf_grow(&dirname, strlen(refname) + 1); | |
1871 | for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { | |
1872 | /* Expand dirname to the new prefix, not including the trailing slash: */ | |
1873 | strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); | |
1874 | ||
1875 | /* | |
1876 | * We are still at a leading dir of the refname (e.g., | |
1877 | * "refs/foo"; if there is a reference with that name, | |
1878 | * it is a conflict, *unless* it is in skip. | |
1879 | */ | |
1880 | if (skip && string_list_has_string(skip, dirname.buf)) | |
1881 | continue; | |
1882 | ||
1883 | if (!refs_read_raw_ref(refs, dirname.buf, oid.hash, &referent, &type)) { | |
1884 | strbuf_addf(err, "'%s' exists; cannot create '%s'", | |
1885 | dirname.buf, refname); | |
1886 | goto cleanup; | |
1887 | } | |
1888 | ||
1889 | if (extras && string_list_has_string(extras, dirname.buf)) { | |
1890 | strbuf_addf(err, "cannot process '%s' and '%s' at the same time", | |
1891 | refname, dirname.buf); | |
1892 | goto cleanup; | |
1893 | } | |
1894 | } | |
1895 | ||
1896 | /* | |
1897 | * We are at the leaf of our refname (e.g., "refs/foo/bar"). | |
1898 | * There is no point in searching for a reference with that | |
1899 | * name, because a refname isn't considered to conflict with | |
1900 | * itself. But we still need to check for references whose | |
1901 | * names are in the "refs/foo/bar/" namespace, because they | |
1902 | * *do* conflict. | |
1903 | */ | |
1904 | strbuf_addstr(&dirname, refname + dirname.len); | |
1905 | strbuf_addch(&dirname, '/'); | |
1906 | ||
1907 | iter = refs_ref_iterator_begin(refs, dirname.buf, 0, | |
1908 | DO_FOR_EACH_INCLUDE_BROKEN); | |
1909 | while ((ok = ref_iterator_advance(iter)) == ITER_OK) { | |
1910 | if (skip && | |
1911 | string_list_has_string(skip, iter->refname)) | |
1912 | continue; | |
1913 | ||
1914 | strbuf_addf(err, "'%s' exists; cannot create '%s'", | |
1915 | iter->refname, refname); | |
1916 | ref_iterator_abort(iter); | |
1917 | goto cleanup; | |
1918 | } | |
1919 | ||
1920 | if (ok != ITER_DONE) | |
1921 | die("BUG: error while iterating over references"); | |
1922 | ||
1923 | extra_refname = find_descendant_ref(dirname.buf, extras, skip); | |
1924 | if (extra_refname) | |
1925 | strbuf_addf(err, "cannot process '%s' and '%s' at the same time", | |
1926 | refname, extra_refname); | |
1927 | else | |
1928 | ret = 0; | |
1929 | ||
1930 | cleanup: | |
1931 | strbuf_release(&referent); | |
1932 | strbuf_release(&dirname); | |
1933 | return ret; | |
1934 | } | |
1935 | ||
1936 | int refs_for_each_reflog(struct ref_store *refs, each_ref_fn fn, void *cb_data) | |
1937 | { | |
1938 | struct ref_iterator *iter; | |
1939 | ||
1940 | iter = refs->be->reflog_iterator_begin(refs); | |
1941 | ||
1942 | return do_for_each_ref_iterator(iter, fn, cb_data); | |
1943 | } | |
1944 | ||
1945 | int for_each_reflog(each_ref_fn fn, void *cb_data) | |
1946 | { | |
1947 | return refs_for_each_reflog(get_main_ref_store(), fn, cb_data); | |
1948 | } | |
1949 | ||
1950 | int refs_for_each_reflog_ent_reverse(struct ref_store *refs, | |
1951 | const char *refname, | |
1952 | each_reflog_ent_fn fn, | |
1953 | void *cb_data) | |
1954 | { | |
1955 | return refs->be->for_each_reflog_ent_reverse(refs, refname, | |
1956 | fn, cb_data); | |
1957 | } | |
1958 | ||
1959 | int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, | |
1960 | void *cb_data) | |
1961 | { | |
1962 | return refs_for_each_reflog_ent_reverse(get_main_ref_store(), | |
1963 | refname, fn, cb_data); | |
1964 | } | |
1965 | ||
1966 | int refs_for_each_reflog_ent(struct ref_store *refs, const char *refname, | |
1967 | each_reflog_ent_fn fn, void *cb_data) | |
1968 | { | |
1969 | return refs->be->for_each_reflog_ent(refs, refname, fn, cb_data); | |
1970 | } | |
1971 | ||
1972 | int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, | |
1973 | void *cb_data) | |
1974 | { | |
1975 | return refs_for_each_reflog_ent(get_main_ref_store(), refname, | |
1976 | fn, cb_data); | |
1977 | } | |
1978 | ||
1979 | int refs_reflog_exists(struct ref_store *refs, const char *refname) | |
1980 | { | |
1981 | return refs->be->reflog_exists(refs, refname); | |
1982 | } | |
1983 | ||
1984 | int reflog_exists(const char *refname) | |
1985 | { | |
1986 | return refs_reflog_exists(get_main_ref_store(), refname); | |
1987 | } | |
1988 | ||
1989 | int refs_create_reflog(struct ref_store *refs, const char *refname, | |
1990 | int force_create, struct strbuf *err) | |
1991 | { | |
1992 | return refs->be->create_reflog(refs, refname, force_create, err); | |
1993 | } | |
1994 | ||
1995 | int safe_create_reflog(const char *refname, int force_create, | |
1996 | struct strbuf *err) | |
1997 | { | |
1998 | return refs_create_reflog(get_main_ref_store(), refname, | |
1999 | force_create, err); | |
2000 | } | |
2001 | ||
2002 | int refs_delete_reflog(struct ref_store *refs, const char *refname) | |
2003 | { | |
2004 | return refs->be->delete_reflog(refs, refname); | |
2005 | } | |
2006 | ||
2007 | int delete_reflog(const char *refname) | |
2008 | { | |
2009 | return refs_delete_reflog(get_main_ref_store(), refname); | |
2010 | } | |
2011 | ||
2012 | int refs_reflog_expire(struct ref_store *refs, | |
2013 | const char *refname, const struct object_id *oid, | |
2014 | unsigned int flags, | |
2015 | reflog_expiry_prepare_fn prepare_fn, | |
2016 | reflog_expiry_should_prune_fn should_prune_fn, | |
2017 | reflog_expiry_cleanup_fn cleanup_fn, | |
2018 | void *policy_cb_data) | |
2019 | { | |
2020 | return refs->be->reflog_expire(refs, refname, oid, flags, | |
2021 | prepare_fn, should_prune_fn, | |
2022 | cleanup_fn, policy_cb_data); | |
2023 | } | |
2024 | ||
2025 | int reflog_expire(const char *refname, const struct object_id *oid, | |
2026 | unsigned int flags, | |
2027 | reflog_expiry_prepare_fn prepare_fn, | |
2028 | reflog_expiry_should_prune_fn should_prune_fn, | |
2029 | reflog_expiry_cleanup_fn cleanup_fn, | |
2030 | void *policy_cb_data) | |
2031 | { | |
2032 | return refs_reflog_expire(get_main_ref_store(), | |
2033 | refname, oid, flags, | |
2034 | prepare_fn, should_prune_fn, | |
2035 | cleanup_fn, policy_cb_data); | |
2036 | } | |
2037 | ||
2038 | int initial_ref_transaction_commit(struct ref_transaction *transaction, | |
2039 | struct strbuf *err) | |
2040 | { | |
2041 | struct ref_store *refs = transaction->ref_store; | |
2042 | ||
2043 | return refs->be->initial_transaction_commit(refs, transaction, err); | |
2044 | } | |
2045 | ||
2046 | int refs_delete_refs(struct ref_store *refs, const char *msg, | |
2047 | struct string_list *refnames, unsigned int flags) | |
2048 | { | |
2049 | return refs->be->delete_refs(refs, msg, refnames, flags); | |
2050 | } | |
2051 | ||
2052 | int delete_refs(const char *msg, struct string_list *refnames, | |
2053 | unsigned int flags) | |
2054 | { | |
2055 | return refs_delete_refs(get_main_ref_store(), msg, refnames, flags); | |
2056 | } | |
2057 | ||
2058 | int refs_rename_ref(struct ref_store *refs, const char *oldref, | |
2059 | const char *newref, const char *logmsg) | |
2060 | { | |
2061 | return refs->be->rename_ref(refs, oldref, newref, logmsg); | |
2062 | } | |
2063 | ||
2064 | int rename_ref(const char *oldref, const char *newref, const char *logmsg) | |
2065 | { | |
2066 | return refs_rename_ref(get_main_ref_store(), oldref, newref, logmsg); | |
2067 | } | |
2068 | ||
2069 | int refs_copy_existing_ref(struct ref_store *refs, const char *oldref, | |
2070 | const char *newref, const char *logmsg) | |
2071 | { | |
2072 | return refs->be->copy_ref(refs, oldref, newref, logmsg); | |
2073 | } | |
2074 | ||
2075 | int copy_existing_ref(const char *oldref, const char *newref, const char *logmsg) | |
2076 | { | |
2077 | return refs_copy_existing_ref(get_main_ref_store(), oldref, newref, logmsg); | |
2078 | } |