]>
Commit | Line | Data |
---|---|---|
95fc7512 | 1 | #include "cache.h" |
85023577 | 2 | #include "refs.h" |
cf0adba7 JH |
3 | #include "object.h" |
4 | #include "tag.h" | |
7155b727 | 5 | #include "dir.h" |
95fc7512 | 6 | |
bc5fd6d3 MH |
7 | /* |
8 | * Make sure "ref" is something reasonable to have under ".git/refs/"; | |
9 | * We do not like it if: | |
10 | * | |
11 | * - any path component of it begins with ".", or | |
12 | * - it has double dots "..", or | |
13 | * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or | |
14 | * - it ends with a "/". | |
15 | * - it ends with ".lock" | |
16 | * - it contains a "\" (backslash) | |
17 | */ | |
f4204ab9 | 18 | |
bc5fd6d3 MH |
19 | /* Return true iff ch is not allowed in reference names. */ |
20 | static inline int bad_ref_char(int ch) | |
21 | { | |
22 | if (((unsigned) ch) <= ' ' || ch == 0x7f || | |
23 | ch == '~' || ch == '^' || ch == ':' || ch == '\\') | |
24 | return 1; | |
25 | /* 2.13 Pattern Matching Notation */ | |
26 | if (ch == '*' || ch == '?' || ch == '[') /* Unsupported */ | |
27 | return 1; | |
28 | return 0; | |
29 | } | |
30 | ||
31 | /* | |
32 | * Try to read one refname component from the front of refname. Return | |
33 | * the length of the component found, or -1 if the component is not | |
34 | * legal. | |
35 | */ | |
36 | static int check_refname_component(const char *refname, int flags) | |
37 | { | |
38 | const char *cp; | |
39 | char last = '\0'; | |
40 | ||
41 | for (cp = refname; ; cp++) { | |
42 | char ch = *cp; | |
43 | if (ch == '\0' || ch == '/') | |
44 | break; | |
45 | if (bad_ref_char(ch)) | |
46 | return -1; /* Illegal character in refname. */ | |
47 | if (last == '.' && ch == '.') | |
48 | return -1; /* Refname contains "..". */ | |
49 | if (last == '@' && ch == '{') | |
50 | return -1; /* Refname contains "@{". */ | |
51 | last = ch; | |
52 | } | |
53 | if (cp == refname) | |
54 | return -1; /* Component has zero length. */ | |
55 | if (refname[0] == '.') { | |
56 | if (!(flags & REFNAME_DOT_COMPONENT)) | |
57 | return -1; /* Component starts with '.'. */ | |
58 | /* | |
59 | * Even if leading dots are allowed, don't allow "." | |
60 | * as a component (".." is prevented by a rule above). | |
61 | */ | |
62 | if (refname[1] == '\0') | |
63 | return -1; /* Component equals ".". */ | |
64 | } | |
65 | if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5)) | |
66 | return -1; /* Refname ends with ".lock". */ | |
67 | return cp - refname; | |
68 | } | |
69 | ||
70 | int check_refname_format(const char *refname, int flags) | |
71 | { | |
72 | int component_len, component_count = 0; | |
73 | ||
74 | while (1) { | |
75 | /* We are at the start of a path component. */ | |
76 | component_len = check_refname_component(refname, flags); | |
77 | if (component_len < 0) { | |
78 | if ((flags & REFNAME_REFSPEC_PATTERN) && | |
79 | refname[0] == '*' && | |
80 | (refname[1] == '\0' || refname[1] == '/')) { | |
81 | /* Accept one wildcard as a full refname component. */ | |
82 | flags &= ~REFNAME_REFSPEC_PATTERN; | |
83 | component_len = 1; | |
84 | } else { | |
85 | return -1; | |
86 | } | |
87 | } | |
88 | component_count++; | |
89 | if (refname[component_len] == '\0') | |
90 | break; | |
91 | /* Skip to next component. */ | |
92 | refname += component_len + 1; | |
93 | } | |
94 | ||
95 | if (refname[component_len - 1] == '.') | |
96 | return -1; /* Refname ends with '.'. */ | |
97 | if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2) | |
98 | return -1; /* Refname has only one component. */ | |
99 | return 0; | |
100 | } | |
101 | ||
102 | struct ref_entry; | |
e1e22e37 | 103 | |
e9c4c111 JP |
104 | struct ref_array { |
105 | int nr, alloc; | |
e6ed3ca6 MH |
106 | |
107 | /* | |
108 | * Entries with index 0 <= i < sorted are sorted by name. New | |
109 | * entries are appended to the list unsorted, and are sorted | |
110 | * only when required; thus we avoid the need to sort the list | |
111 | * after the addition of every reference. | |
112 | */ | |
113 | int sorted; | |
114 | ||
e9c4c111 JP |
115 | struct ref_entry **refs; |
116 | }; | |
117 | ||
bc5fd6d3 MH |
118 | /* ISSYMREF=0x01, ISPACKED=0x02 and ISBROKEN=0x04 are public interfaces */ |
119 | #define REF_KNOWS_PEELED 0x10 | |
cf0adba7 | 120 | |
bc5fd6d3 MH |
121 | struct ref_entry { |
122 | unsigned char flag; /* ISSYMREF? ISPACKED? */ | |
123 | unsigned char sha1[20]; | |
124 | unsigned char peeled[20]; | |
125 | /* The full name of the reference (e.g., "refs/heads/master"): */ | |
126 | char name[FLEX_ARRAY]; | |
127 | }; | |
e1e22e37 | 128 | |
cddc4258 MH |
129 | static struct ref_entry *create_ref_entry(const char *refname, |
130 | const unsigned char *sha1, int flag, | |
131 | int check_name) | |
e1e22e37 LT |
132 | { |
133 | int len; | |
cddc4258 | 134 | struct ref_entry *ref; |
e1e22e37 | 135 | |
09116a1c | 136 | if (check_name && |
dfefa935 MH |
137 | check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT)) |
138 | die("Reference has invalid format: '%s'", refname); | |
cddc4258 MH |
139 | len = strlen(refname) + 1; |
140 | ref = xmalloc(sizeof(struct ref_entry) + len); | |
141 | hashcpy(ref->sha1, sha1); | |
142 | hashclr(ref->peeled); | |
143 | memcpy(ref->name, refname, len); | |
144 | ref->flag = flag; | |
145 | return ref; | |
146 | } | |
147 | ||
148 | /* Add a ref_entry to the end of the ref_array (unsorted). */ | |
dd73ecd1 | 149 | static void add_ref(struct ref_array *refs, struct ref_entry *ref) |
cddc4258 | 150 | { |
e9c4c111 | 151 | ALLOC_GROW(refs->refs, refs->nr + 1, refs->alloc); |
cddc4258 | 152 | refs->refs[refs->nr++] = ref; |
c774aab9 JP |
153 | } |
154 | ||
bc5fd6d3 MH |
155 | static void clear_ref_array(struct ref_array *array) |
156 | { | |
157 | int i; | |
158 | for (i = 0; i < array->nr; i++) | |
159 | free(array->refs[i]); | |
160 | free(array->refs); | |
161 | array->sorted = array->nr = array->alloc = 0; | |
162 | array->refs = NULL; | |
163 | } | |
164 | ||
e9c4c111 | 165 | static int ref_entry_cmp(const void *a, const void *b) |
c774aab9 | 166 | { |
e9c4c111 JP |
167 | struct ref_entry *one = *(struct ref_entry **)a; |
168 | struct ref_entry *two = *(struct ref_entry **)b; | |
169 | return strcmp(one->name, two->name); | |
170 | } | |
c774aab9 | 171 | |
bc5fd6d3 MH |
172 | static void sort_ref_array(struct ref_array *array); |
173 | ||
174 | static struct ref_entry *search_ref_array(struct ref_array *array, const char *refname) | |
175 | { | |
176 | struct ref_entry *e, **r; | |
177 | int len; | |
178 | ||
179 | if (refname == NULL) | |
180 | return NULL; | |
181 | ||
182 | if (!array->nr) | |
183 | return NULL; | |
184 | sort_ref_array(array); | |
185 | len = strlen(refname) + 1; | |
186 | e = xmalloc(sizeof(struct ref_entry) + len); | |
187 | memcpy(e->name, refname, len); | |
188 | ||
189 | r = bsearch(&e, array->refs, array->nr, sizeof(*array->refs), ref_entry_cmp); | |
190 | ||
191 | free(e); | |
192 | ||
193 | if (r == NULL) | |
194 | return NULL; | |
195 | ||
196 | return *r; | |
197 | } | |
198 | ||
202a56a9 MH |
199 | /* |
200 | * Emit a warning and return true iff ref1 and ref2 have the same name | |
201 | * and the same sha1. Die if they have the same name but different | |
202 | * sha1s. | |
203 | */ | |
204 | static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) | |
205 | { | |
206 | if (!strcmp(ref1->name, ref2->name)) { | |
207 | /* Duplicate name; make sure that the SHA1s match: */ | |
208 | if (hashcmp(ref1->sha1, ref2->sha1)) | |
209 | die("Duplicated ref, and SHA1s don't match: %s", | |
210 | ref1->name); | |
211 | warning("Duplicated ref: %s", ref1->name); | |
212 | return 1; | |
213 | } else { | |
214 | return 0; | |
215 | } | |
216 | } | |
217 | ||
e6ed3ca6 MH |
218 | /* |
219 | * Sort the entries in array (if they are not already sorted). | |
220 | */ | |
e9c4c111 JP |
221 | static void sort_ref_array(struct ref_array *array) |
222 | { | |
202a56a9 | 223 | int i, j; |
c774aab9 | 224 | |
e6ed3ca6 MH |
225 | /* |
226 | * This check also prevents passing a zero-length array to qsort(), | |
227 | * which is a problem on some platforms. | |
228 | */ | |
229 | if (array->sorted == array->nr) | |
e9c4c111 | 230 | return; |
c774aab9 | 231 | |
e9c4c111 | 232 | qsort(array->refs, array->nr, sizeof(*array->refs), ref_entry_cmp); |
c774aab9 | 233 | |
e9c4c111 | 234 | /* Remove any duplicates from the ref_array */ |
202a56a9 MH |
235 | i = 0; |
236 | for (j = 1; j < array->nr; j++) { | |
237 | if (is_dup_ref(array->refs[i], array->refs[j])) { | |
238 | free(array->refs[j]); | |
e9c4c111 JP |
239 | continue; |
240 | } | |
202a56a9 | 241 | array->refs[++i] = array->refs[j]; |
e9c4c111 | 242 | } |
e6ed3ca6 | 243 | array->sorted = array->nr = i + 1; |
e9c4c111 | 244 | } |
c774aab9 | 245 | |
bc5fd6d3 | 246 | #define DO_FOR_EACH_INCLUDE_BROKEN 01 |
c774aab9 | 247 | |
bc5fd6d3 | 248 | static struct ref_entry *current_ref; |
c774aab9 | 249 | |
bc5fd6d3 MH |
250 | static int do_one_ref(const char *base, each_ref_fn fn, int trim, |
251 | int flags, void *cb_data, struct ref_entry *entry) | |
252 | { | |
429213e4 | 253 | int retval; |
bc5fd6d3 MH |
254 | if (prefixcmp(entry->name, base)) |
255 | return 0; | |
c774aab9 | 256 | |
bc5fd6d3 MH |
257 | if (!(flags & DO_FOR_EACH_INCLUDE_BROKEN)) { |
258 | if (entry->flag & REF_ISBROKEN) | |
259 | return 0; /* ignore broken refs e.g. dangling symref */ | |
260 | if (!has_sha1_file(entry->sha1)) { | |
261 | error("%s does not point to a valid object!", entry->name); | |
262 | return 0; | |
263 | } | |
264 | } | |
265 | current_ref = entry; | |
429213e4 MH |
266 | retval = fn(entry->name + trim, entry->sha1, entry->flag, cb_data); |
267 | current_ref = NULL; | |
268 | return retval; | |
bc5fd6d3 | 269 | } |
c774aab9 | 270 | |
c36b5bc2 MH |
271 | /* |
272 | * Call fn for each reference in array that has index in the range | |
273 | * offset <= index < array->nr. This function does not sort the | |
274 | * array; sorting should be done by the caller. | |
275 | */ | |
276 | static int do_for_each_ref_in_array(struct ref_array *array, int offset, | |
277 | const char *base, | |
278 | each_ref_fn fn, int trim, int flags, void *cb_data) | |
279 | { | |
280 | int i; | |
281 | assert(array->sorted == array->nr); | |
282 | for (i = offset; i < array->nr; i++) { | |
283 | int retval = do_one_ref(base, fn, trim, flags, cb_data, array->refs[i]); | |
284 | if (retval) | |
285 | return retval; | |
286 | } | |
287 | return 0; | |
288 | } | |
289 | ||
b3fd060f MH |
290 | /* |
291 | * Call fn for each reference in the union of array1 and array2, in | |
292 | * order by refname. If an entry appears in both array1 and array2, | |
293 | * then only process the version that is in array2. The input arrays | |
294 | * must already be sorted. | |
295 | */ | |
296 | static int do_for_each_ref_in_arrays(struct ref_array *array1, | |
297 | struct ref_array *array2, | |
298 | const char *base, each_ref_fn fn, int trim, | |
299 | int flags, void *cb_data) | |
300 | { | |
301 | int retval; | |
302 | int i1 = 0, i2 = 0; | |
303 | ||
304 | assert(array1->sorted == array1->nr); | |
305 | assert(array2->sorted == array2->nr); | |
306 | while (i1 < array1->nr && i2 < array2->nr) { | |
307 | struct ref_entry *e1 = array1->refs[i1]; | |
308 | struct ref_entry *e2 = array2->refs[i2]; | |
309 | int cmp = strcmp(e1->name, e2->name); | |
310 | if (cmp < 0) { | |
311 | retval = do_one_ref(base, fn, trim, flags, cb_data, e1); | |
312 | i1++; | |
313 | } else { | |
314 | retval = do_one_ref(base, fn, trim, flags, cb_data, e2); | |
315 | i2++; | |
316 | if (cmp == 0) { | |
317 | /* | |
318 | * There was a ref in array1 with the | |
319 | * same name; ignore it. | |
320 | */ | |
321 | i1++; | |
322 | } | |
323 | } | |
324 | if (retval) | |
325 | return retval; | |
326 | } | |
327 | if (i1 < array1->nr) | |
328 | return do_for_each_ref_in_array(array1, i1, | |
329 | base, fn, trim, flags, cb_data); | |
330 | if (i2 < array2->nr) | |
331 | return do_for_each_ref_in_array(array2, i2, | |
332 | base, fn, trim, flags, cb_data); | |
333 | return 0; | |
334 | } | |
335 | ||
d66da478 MH |
336 | /* |
337 | * Return true iff refname1 and refname2 conflict with each other. | |
338 | * Two reference names conflict if one of them exactly matches the | |
339 | * leading components of the other; e.g., "foo/bar" conflicts with | |
340 | * both "foo" and with "foo/bar/baz" but not with "foo/bar" or | |
341 | * "foo/barbados". | |
342 | */ | |
343 | static int names_conflict(const char *refname1, const char *refname2) | |
344 | { | |
5a4d4947 MH |
345 | for (; *refname1 && *refname1 == *refname2; refname1++, refname2++) |
346 | ; | |
347 | return (*refname1 == '\0' && *refname2 == '/') | |
348 | || (*refname1 == '/' && *refname2 == '\0'); | |
349 | } | |
350 | ||
351 | struct name_conflict_cb { | |
352 | const char *refname; | |
353 | const char *oldrefname; | |
354 | const char *conflicting_refname; | |
355 | }; | |
356 | ||
357 | static int name_conflict_fn(const char *existingrefname, const unsigned char *sha1, | |
358 | int flags, void *cb_data) | |
359 | { | |
360 | struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data; | |
361 | if (data->oldrefname && !strcmp(data->oldrefname, existingrefname)) | |
362 | return 0; | |
363 | if (names_conflict(data->refname, existingrefname)) { | |
364 | data->conflicting_refname = existingrefname; | |
365 | return 1; | |
d66da478 | 366 | } |
5a4d4947 | 367 | return 0; |
d66da478 MH |
368 | } |
369 | ||
bc5fd6d3 MH |
370 | /* |
371 | * Return true iff a reference named refname could be created without | |
5a4d4947 MH |
372 | * conflicting with the name of an existing reference in array. If |
373 | * oldrefname is non-NULL, ignore potential conflicts with oldrefname | |
374 | * (e.g., because oldrefname is scheduled for deletion in the same | |
bc5fd6d3 MH |
375 | * operation). |
376 | */ | |
377 | static int is_refname_available(const char *refname, const char *oldrefname, | |
378 | struct ref_array *array) | |
379 | { | |
5a4d4947 MH |
380 | struct name_conflict_cb data; |
381 | data.refname = refname; | |
382 | data.oldrefname = oldrefname; | |
383 | data.conflicting_refname = NULL; | |
384 | ||
385 | sort_ref_array(array); | |
386 | if (do_for_each_ref_in_array(array, 0, "", name_conflict_fn, | |
387 | 0, DO_FOR_EACH_INCLUDE_BROKEN, | |
388 | &data)) { | |
389 | error("'%s' exists; cannot create '%s'", | |
390 | data.conflicting_refname, refname); | |
391 | return 0; | |
bc5fd6d3 MH |
392 | } |
393 | return 1; | |
e1e22e37 LT |
394 | } |
395 | ||
5e290ff7 JH |
396 | /* |
397 | * Future: need to be in "struct repository" | |
398 | * when doing a full libification. | |
399 | */ | |
79c7ca54 MH |
400 | static struct ref_cache { |
401 | struct ref_cache *next; | |
5e290ff7 JH |
402 | char did_loose; |
403 | char did_packed; | |
e9c4c111 JP |
404 | struct ref_array loose; |
405 | struct ref_array packed; | |
ce40979c MH |
406 | /* The submodule name, or "" for the main repo. */ |
407 | char name[FLEX_ARRAY]; | |
79c7ca54 | 408 | } *ref_cache; |
0e88c130 | 409 | |
760c4512 | 410 | static void clear_packed_ref_cache(struct ref_cache *refs) |
e1e22e37 | 411 | { |
1b7edaf9 | 412 | if (refs->did_packed) |
7c59511e | 413 | clear_ref_array(&refs->packed); |
760c4512 | 414 | refs->did_packed = 0; |
5e290ff7 | 415 | } |
e1e22e37 | 416 | |
760c4512 MH |
417 | static void clear_loose_ref_cache(struct ref_cache *refs) |
418 | { | |
419 | if (refs->did_loose) | |
7c59511e | 420 | clear_ref_array(&refs->loose); |
760c4512 MH |
421 | refs->did_loose = 0; |
422 | } | |
423 | ||
79c7ca54 | 424 | static struct ref_cache *create_ref_cache(const char *submodule) |
e5dbf605 | 425 | { |
ce40979c | 426 | int len; |
79c7ca54 | 427 | struct ref_cache *refs; |
ce40979c MH |
428 | if (!submodule) |
429 | submodule = ""; | |
430 | len = strlen(submodule) + 1; | |
79c7ca54 | 431 | refs = xcalloc(1, sizeof(struct ref_cache) + len); |
ce40979c | 432 | memcpy(refs->name, submodule, len); |
e5dbf605 MH |
433 | return refs; |
434 | } | |
435 | ||
4349a668 | 436 | /* |
79c7ca54 | 437 | * Return a pointer to a ref_cache for the specified submodule. For |
4349a668 MH |
438 | * the main repository, use submodule==NULL. The returned structure |
439 | * will be allocated and initialized but not necessarily populated; it | |
440 | * should not be freed. | |
441 | */ | |
79c7ca54 | 442 | static struct ref_cache *get_ref_cache(const char *submodule) |
4349a668 | 443 | { |
79c7ca54 | 444 | struct ref_cache *refs = ref_cache; |
0e88c130 MH |
445 | if (!submodule) |
446 | submodule = ""; | |
447 | while (refs) { | |
448 | if (!strcmp(submodule, refs->name)) | |
449 | return refs; | |
450 | refs = refs->next; | |
4349a668 | 451 | } |
0e88c130 | 452 | |
79c7ca54 MH |
453 | refs = create_ref_cache(submodule); |
454 | refs->next = ref_cache; | |
455 | ref_cache = refs; | |
0e88c130 | 456 | return refs; |
4349a668 MH |
457 | } |
458 | ||
8be8bde7 | 459 | void invalidate_ref_cache(const char *submodule) |
f130b116 | 460 | { |
c5f29abd MH |
461 | struct ref_cache *refs = get_ref_cache(submodule); |
462 | clear_packed_ref_cache(refs); | |
463 | clear_loose_ref_cache(refs); | |
5e290ff7 | 464 | } |
e1e22e37 | 465 | |
bc5fd6d3 MH |
466 | /* |
467 | * Parse one line from a packed-refs file. Write the SHA1 to sha1. | |
468 | * Return a pointer to the refname within the line (null-terminated), | |
469 | * or NULL if there was a problem. | |
470 | */ | |
471 | static const char *parse_ref_line(char *line, unsigned char *sha1) | |
472 | { | |
473 | /* | |
474 | * 42: the answer to everything. | |
475 | * | |
476 | * In this case, it happens to be the answer to | |
477 | * 40 (length of sha1 hex representation) | |
478 | * +1 (space in between hex and name) | |
479 | * +1 (newline at the end of the line) | |
480 | */ | |
481 | int len = strlen(line) - 42; | |
482 | ||
483 | if (len <= 0) | |
484 | return NULL; | |
485 | if (get_sha1_hex(line, sha1) < 0) | |
486 | return NULL; | |
487 | if (!isspace(line[40])) | |
488 | return NULL; | |
489 | line += 41; | |
490 | if (isspace(*line)) | |
491 | return NULL; | |
492 | if (line[len] != '\n') | |
493 | return NULL; | |
494 | line[len] = 0; | |
495 | ||
496 | return line; | |
497 | } | |
498 | ||
2c5c66be | 499 | static void read_packed_refs(FILE *f, struct ref_array *array) |
f4204ab9 | 500 | { |
e9c4c111 | 501 | struct ref_entry *last = NULL; |
f4204ab9 JH |
502 | char refline[PATH_MAX]; |
503 | int flag = REF_ISPACKED; | |
504 | ||
505 | while (fgets(refline, sizeof(refline), f)) { | |
506 | unsigned char sha1[20]; | |
dfefa935 | 507 | const char *refname; |
f4204ab9 JH |
508 | static const char header[] = "# pack-refs with:"; |
509 | ||
510 | if (!strncmp(refline, header, sizeof(header)-1)) { | |
511 | const char *traits = refline + sizeof(header) - 1; | |
512 | if (strstr(traits, " peeled ")) | |
513 | flag |= REF_KNOWS_PEELED; | |
514 | /* perhaps other traits later as well */ | |
515 | continue; | |
516 | } | |
517 | ||
dfefa935 MH |
518 | refname = parse_ref_line(refline, sha1); |
519 | if (refname) { | |
dd73ecd1 MH |
520 | last = create_ref_entry(refname, sha1, flag, 1); |
521 | add_ref(array, last); | |
f4204ab9 JH |
522 | continue; |
523 | } | |
524 | if (last && | |
525 | refline[0] == '^' && | |
526 | strlen(refline) == 42 && | |
527 | refline[41] == '\n' && | |
528 | !get_sha1_hex(refline + 1, sha1)) | |
529 | hashcpy(last->peeled, sha1); | |
530 | } | |
f4204ab9 JH |
531 | } |
532 | ||
316b097a | 533 | static struct ref_array *get_packed_refs(struct ref_cache *refs) |
5e290ff7 | 534 | { |
4349a668 MH |
535 | if (!refs->did_packed) { |
536 | const char *packed_refs_file; | |
537 | FILE *f; | |
0bad611b | 538 | |
316b097a MH |
539 | if (*refs->name) |
540 | packed_refs_file = git_path_submodule(refs->name, "packed-refs"); | |
4349a668 MH |
541 | else |
542 | packed_refs_file = git_path("packed-refs"); | |
543 | f = fopen(packed_refs_file, "r"); | |
e1e22e37 | 544 | if (f) { |
2c5c66be | 545 | read_packed_refs(f, &refs->packed); |
e1e22e37 | 546 | fclose(f); |
e1e22e37 | 547 | } |
0bad611b | 548 | refs->did_packed = 1; |
e1e22e37 | 549 | } |
e9c4c111 | 550 | return &refs->packed; |
e1e22e37 LT |
551 | } |
552 | ||
30249ee6 MH |
553 | void add_packed_ref(const char *refname, const unsigned char *sha1) |
554 | { | |
555 | add_ref(get_packed_refs(get_ref_cache(NULL)), | |
556 | create_ref_entry(refname, sha1, REF_ISPACKED, 1)); | |
557 | } | |
558 | ||
3b124823 | 559 | static void get_ref_dir(struct ref_cache *refs, const char *base, |
e9c4c111 | 560 | struct ref_array *array) |
e1e22e37 | 561 | { |
0bad611b HV |
562 | DIR *dir; |
563 | const char *path; | |
564 | ||
3b124823 MH |
565 | if (*refs->name) |
566 | path = git_path_submodule(refs->name, "%s", base); | |
0bad611b HV |
567 | else |
568 | path = git_path("%s", base); | |
569 | ||
0bad611b | 570 | dir = opendir(path); |
e1e22e37 LT |
571 | |
572 | if (dir) { | |
573 | struct dirent *de; | |
574 | int baselen = strlen(base); | |
dfefa935 | 575 | char *refname = xmalloc(baselen + 257); |
e1e22e37 | 576 | |
dfefa935 | 577 | memcpy(refname, base, baselen); |
e1e22e37 | 578 | if (baselen && base[baselen-1] != '/') |
dfefa935 | 579 | refname[baselen++] = '/'; |
e1e22e37 LT |
580 | |
581 | while ((de = readdir(dir)) != NULL) { | |
582 | unsigned char sha1[20]; | |
583 | struct stat st; | |
8da19775 | 584 | int flag; |
e1e22e37 | 585 | int namelen; |
0bad611b | 586 | const char *refdir; |
e1e22e37 LT |
587 | |
588 | if (de->d_name[0] == '.') | |
589 | continue; | |
590 | namelen = strlen(de->d_name); | |
591 | if (namelen > 255) | |
592 | continue; | |
593 | if (has_extension(de->d_name, ".lock")) | |
594 | continue; | |
dfefa935 | 595 | memcpy(refname + baselen, de->d_name, namelen+1); |
3b124823 MH |
596 | refdir = *refs->name |
597 | ? git_path_submodule(refs->name, "%s", refname) | |
dfefa935 | 598 | : git_path("%s", refname); |
0bad611b | 599 | if (stat(refdir, &st) < 0) |
e1e22e37 LT |
600 | continue; |
601 | if (S_ISDIR(st.st_mode)) { | |
3b124823 | 602 | get_ref_dir(refs, refname, array); |
e1e22e37 LT |
603 | continue; |
604 | } | |
3b124823 | 605 | if (*refs->name) { |
f8948e2f | 606 | hashclr(sha1); |
0bad611b | 607 | flag = 0; |
3b124823 | 608 | if (resolve_gitlink_ref(refs->name, refname, sha1) < 0) { |
0bad611b | 609 | hashclr(sha1); |
98ac34b2 | 610 | flag |= REF_ISBROKEN; |
0bad611b | 611 | } |
dfefa935 | 612 | } else if (read_ref_full(refname, sha1, 1, &flag)) { |
09116a1c JH |
613 | hashclr(sha1); |
614 | flag |= REF_ISBROKEN; | |
615 | } | |
dd73ecd1 | 616 | add_ref(array, create_ref_entry(refname, sha1, flag, 1)); |
e1e22e37 | 617 | } |
dfefa935 | 618 | free(refname); |
e1e22e37 LT |
619 | closedir(dir); |
620 | } | |
e1e22e37 LT |
621 | } |
622 | ||
316b097a | 623 | static struct ref_array *get_loose_refs(struct ref_cache *refs) |
e1e22e37 | 624 | { |
4349a668 | 625 | if (!refs->did_loose) { |
3b124823 | 626 | get_ref_dir(refs, "refs", &refs->loose); |
4349a668 | 627 | refs->did_loose = 1; |
e1e22e37 | 628 | } |
2c5c66be | 629 | return &refs->loose; |
e1e22e37 LT |
630 | } |
631 | ||
ca8db142 LT |
632 | /* We allow "recursive" symbolic refs. Only within reason, though */ |
633 | #define MAXDEPTH 5 | |
0ebde32c LT |
634 | #define MAXREFLEN (1024) |
635 | ||
e5fa45c1 JH |
636 | /* |
637 | * Called by resolve_gitlink_ref_recursive() after it failed to read | |
b0626608 MH |
638 | * from the loose refs in ref_cache refs. Find <refname> in the |
639 | * packed-refs file for the submodule. | |
e5fa45c1 | 640 | */ |
b0626608 | 641 | static int resolve_gitlink_packed_ref(struct ref_cache *refs, |
85be1fe3 | 642 | const char *refname, unsigned char *sha1) |
0ebde32c | 643 | { |
2c5c66be | 644 | struct ref_entry *ref; |
b0626608 | 645 | struct ref_array *array = get_packed_refs(refs); |
0ebde32c | 646 | |
2c5c66be | 647 | ref = search_ref_array(array, refname); |
b0626608 MH |
648 | if (ref == NULL) |
649 | return -1; | |
650 | ||
651 | memcpy(sha1, ref->sha1, 20); | |
652 | return 0; | |
0ebde32c LT |
653 | } |
654 | ||
b0626608 | 655 | static int resolve_gitlink_ref_recursive(struct ref_cache *refs, |
85be1fe3 | 656 | const char *refname, unsigned char *sha1, |
dfefa935 | 657 | int recursion) |
0ebde32c | 658 | { |
064d51dc | 659 | int fd, len; |
0ebde32c | 660 | char buffer[128], *p; |
064d51dc | 661 | char *path; |
0ebde32c | 662 | |
064d51dc | 663 | if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN) |
0ebde32c | 664 | return -1; |
064d51dc MH |
665 | path = *refs->name |
666 | ? git_path_submodule(refs->name, "%s", refname) | |
667 | : git_path("%s", refname); | |
668 | fd = open(path, O_RDONLY); | |
0ebde32c | 669 | if (fd < 0) |
b0626608 | 670 | return resolve_gitlink_packed_ref(refs, refname, sha1); |
0ebde32c LT |
671 | |
672 | len = read(fd, buffer, sizeof(buffer)-1); | |
673 | close(fd); | |
674 | if (len < 0) | |
675 | return -1; | |
676 | while (len && isspace(buffer[len-1])) | |
677 | len--; | |
678 | buffer[len] = 0; | |
679 | ||
680 | /* Was it a detached head or an old-fashioned symlink? */ | |
85be1fe3 | 681 | if (!get_sha1_hex(buffer, sha1)) |
0ebde32c LT |
682 | return 0; |
683 | ||
684 | /* Symref? */ | |
685 | if (strncmp(buffer, "ref:", 4)) | |
686 | return -1; | |
687 | p = buffer + 4; | |
688 | while (isspace(*p)) | |
689 | p++; | |
690 | ||
064d51dc | 691 | return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1); |
0ebde32c LT |
692 | } |
693 | ||
85be1fe3 | 694 | int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1) |
0ebde32c LT |
695 | { |
696 | int len = strlen(path), retval; | |
064d51dc | 697 | char *submodule; |
b0626608 | 698 | struct ref_cache *refs; |
0ebde32c LT |
699 | |
700 | while (len && path[len-1] == '/') | |
701 | len--; | |
702 | if (!len) | |
703 | return -1; | |
b0626608 MH |
704 | submodule = xstrndup(path, len); |
705 | refs = get_ref_cache(submodule); | |
706 | free(submodule); | |
707 | ||
064d51dc | 708 | retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0); |
0ebde32c LT |
709 | return retval; |
710 | } | |
ca8db142 | 711 | |
4886b89f | 712 | /* |
c224ca7f MH |
713 | * Try to read ref from the packed references. On success, set sha1 |
714 | * and return 0; otherwise, return -1. | |
4886b89f | 715 | */ |
dfefa935 | 716 | static int get_packed_ref(const char *refname, unsigned char *sha1) |
c224ca7f | 717 | { |
316b097a | 718 | struct ref_array *packed = get_packed_refs(get_ref_cache(NULL)); |
dfefa935 | 719 | struct ref_entry *entry = search_ref_array(packed, refname); |
2c5c66be JH |
720 | if (entry) { |
721 | hashcpy(sha1, entry->sha1); | |
722 | return 0; | |
c224ca7f MH |
723 | } |
724 | return -1; | |
725 | } | |
726 | ||
8d68493f | 727 | const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag) |
8a65ff76 | 728 | { |
0104ca09 HO |
729 | int depth = MAXDEPTH; |
730 | ssize_t len; | |
a876ed83 | 731 | char buffer[256]; |
dfefa935 | 732 | static char refname_buffer[256]; |
ca8db142 | 733 | |
8da19775 JH |
734 | if (flag) |
735 | *flag = 0; | |
736 | ||
dfefa935 | 737 | if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) |
8384d788 MH |
738 | return NULL; |
739 | ||
a876ed83 | 740 | for (;;) { |
55956350 | 741 | char path[PATH_MAX]; |
a876ed83 JH |
742 | struct stat st; |
743 | char *buf; | |
744 | int fd; | |
8a65ff76 | 745 | |
a876ed83 JH |
746 | if (--depth < 0) |
747 | return NULL; | |
ca8db142 | 748 | |
dfefa935 | 749 | git_snpath(path, sizeof(path), "%s", refname); |
c224ca7f | 750 | |
a876ed83 | 751 | if (lstat(path, &st) < 0) { |
c224ca7f MH |
752 | if (errno != ENOENT) |
753 | return NULL; | |
754 | /* | |
755 | * The loose reference file does not exist; | |
756 | * check for a packed reference. | |
757 | */ | |
dfefa935 | 758 | if (!get_packed_ref(refname, sha1)) { |
c224ca7f MH |
759 | if (flag) |
760 | *flag |= REF_ISPACKED; | |
dfefa935 | 761 | return refname; |
434cd0cd | 762 | } |
c224ca7f MH |
763 | /* The reference is not a packed reference, either. */ |
764 | if (reading) { | |
a876ed83 | 765 | return NULL; |
c224ca7f MH |
766 | } else { |
767 | hashclr(sha1); | |
dfefa935 | 768 | return refname; |
c224ca7f | 769 | } |
a876ed83 | 770 | } |
ca8db142 | 771 | |
a876ed83 JH |
772 | /* Follow "normalized" - ie "refs/.." symlinks by hand */ |
773 | if (S_ISLNK(st.st_mode)) { | |
774 | len = readlink(path, buffer, sizeof(buffer)-1); | |
7bb2bf8e MH |
775 | if (len < 0) |
776 | return NULL; | |
b54cb795 | 777 | buffer[len] = 0; |
1f58a038 MH |
778 | if (!prefixcmp(buffer, "refs/") && |
779 | !check_refname_format(buffer, 0)) { | |
dfefa935 MH |
780 | strcpy(refname_buffer, buffer); |
781 | refname = refname_buffer; | |
8da19775 JH |
782 | if (flag) |
783 | *flag |= REF_ISSYMREF; | |
a876ed83 JH |
784 | continue; |
785 | } | |
ca8db142 | 786 | } |
a876ed83 | 787 | |
7a21632f DS |
788 | /* Is it a directory? */ |
789 | if (S_ISDIR(st.st_mode)) { | |
790 | errno = EISDIR; | |
791 | return NULL; | |
792 | } | |
793 | ||
a876ed83 JH |
794 | /* |
795 | * Anything else, just open it and try to use it as | |
796 | * a ref | |
797 | */ | |
798 | fd = open(path, O_RDONLY); | |
799 | if (fd < 0) | |
800 | return NULL; | |
93d26e4c | 801 | len = read_in_full(fd, buffer, sizeof(buffer)-1); |
a876ed83 | 802 | close(fd); |
28775050 MH |
803 | if (len < 0) |
804 | return NULL; | |
805 | while (len && isspace(buffer[len-1])) | |
806 | len--; | |
807 | buffer[len] = '\0'; | |
a876ed83 JH |
808 | |
809 | /* | |
810 | * Is it a symbolic ref? | |
811 | */ | |
28775050 | 812 | if (prefixcmp(buffer, "ref:")) |
a876ed83 | 813 | break; |
55956350 JH |
814 | if (flag) |
815 | *flag |= REF_ISSYMREF; | |
a876ed83 | 816 | buf = buffer + 4; |
28775050 MH |
817 | while (isspace(*buf)) |
818 | buf++; | |
313fb010 | 819 | if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) { |
55956350 JH |
820 | if (flag) |
821 | *flag |= REF_ISBROKEN; | |
313fb010 MH |
822 | return NULL; |
823 | } | |
dfefa935 | 824 | refname = strcpy(refname_buffer, buf); |
8a65ff76 | 825 | } |
f989fea0 MH |
826 | /* Please note that FETCH_HEAD has a second line containing other data. */ |
827 | if (get_sha1_hex(buffer, sha1) || (buffer[40] != '\0' && !isspace(buffer[40]))) { | |
55956350 JH |
828 | if (flag) |
829 | *flag |= REF_ISBROKEN; | |
a876ed83 | 830 | return NULL; |
629cd3ac | 831 | } |
dfefa935 | 832 | return refname; |
a876ed83 JH |
833 | } |
834 | ||
96ec7b1e NTND |
835 | char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag) |
836 | { | |
8cad4744 | 837 | const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag); |
96ec7b1e NTND |
838 | return ret ? xstrdup(ret) : NULL; |
839 | } | |
840 | ||
d08bae7e IL |
841 | /* The argument to filter_refs */ |
842 | struct ref_filter { | |
843 | const char *pattern; | |
844 | each_ref_fn *fn; | |
845 | void *cb_data; | |
846 | }; | |
847 | ||
dfefa935 | 848 | int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags) |
a876ed83 | 849 | { |
8d68493f | 850 | if (resolve_ref_unsafe(refname, sha1, reading, flags)) |
a876ed83 JH |
851 | return 0; |
852 | return -1; | |
8a65ff76 LT |
853 | } |
854 | ||
dfefa935 | 855 | int read_ref(const char *refname, unsigned char *sha1) |
c6893323 | 856 | { |
dfefa935 | 857 | return read_ref_full(refname, sha1, 1, NULL); |
c6893323 NTND |
858 | } |
859 | ||
bc5fd6d3 | 860 | int ref_exists(const char *refname) |
ef06b918 | 861 | { |
bc5fd6d3 MH |
862 | unsigned char sha1[20]; |
863 | return !!resolve_ref_unsafe(refname, sha1, 1, NULL); | |
ef06b918 JH |
864 | } |
865 | ||
85be1fe3 | 866 | static int filter_refs(const char *refname, const unsigned char *sha1, int flags, |
dfefa935 | 867 | void *data) |
d08bae7e IL |
868 | { |
869 | struct ref_filter *filter = (struct ref_filter *)data; | |
dfefa935 | 870 | if (fnmatch(filter->pattern, refname, 0)) |
d08bae7e | 871 | return 0; |
85be1fe3 | 872 | return filter->fn(refname, sha1, flags, filter->cb_data); |
d08bae7e IL |
873 | } |
874 | ||
dfefa935 | 875 | int peel_ref(const char *refname, unsigned char *sha1) |
cf0adba7 JH |
876 | { |
877 | int flag; | |
878 | unsigned char base[20]; | |
879 | struct object *o; | |
880 | ||
dfefa935 MH |
881 | if (current_ref && (current_ref->name == refname |
882 | || !strcmp(current_ref->name, refname))) { | |
0ae91be0 SP |
883 | if (current_ref->flag & REF_KNOWS_PEELED) { |
884 | hashcpy(sha1, current_ref->peeled); | |
885 | return 0; | |
886 | } | |
887 | hashcpy(base, current_ref->sha1); | |
888 | goto fallback; | |
889 | } | |
890 | ||
dfefa935 | 891 | if (read_ref_full(refname, base, 1, &flag)) |
cf0adba7 JH |
892 | return -1; |
893 | ||
894 | if ((flag & REF_ISPACKED)) { | |
316b097a | 895 | struct ref_array *array = get_packed_refs(get_ref_cache(NULL)); |
dfefa935 | 896 | struct ref_entry *r = search_ref_array(array, refname); |
cf0adba7 | 897 | |
e9c4c111 JP |
898 | if (r != NULL && r->flag & REF_KNOWS_PEELED) { |
899 | hashcpy(sha1, r->peeled); | |
900 | return 0; | |
cf0adba7 | 901 | } |
cf0adba7 JH |
902 | } |
903 | ||
0ae91be0 | 904 | fallback: |
cf0adba7 | 905 | o = parse_object(base); |
8c87dc77 | 906 | if (o && o->type == OBJ_TAG) { |
dfefa935 | 907 | o = deref_tag(o, refname, 0); |
cf0adba7 JH |
908 | if (o) { |
909 | hashcpy(sha1, o->sha1); | |
910 | return 0; | |
911 | } | |
912 | } | |
913 | return -1; | |
914 | } | |
915 | ||
bc5fd6d3 MH |
916 | struct warn_if_dangling_data { |
917 | FILE *fp; | |
918 | const char *refname; | |
919 | const char *msg_fmt; | |
920 | }; | |
921 | ||
922 | static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1, | |
923 | int flags, void *cb_data) | |
924 | { | |
925 | struct warn_if_dangling_data *d = cb_data; | |
926 | const char *resolves_to; | |
927 | unsigned char junk[20]; | |
928 | ||
929 | if (!(flags & REF_ISSYMREF)) | |
930 | return 0; | |
931 | ||
932 | resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL); | |
933 | if (!resolves_to || strcmp(resolves_to, d->refname)) | |
934 | return 0; | |
935 | ||
936 | fprintf(d->fp, d->msg_fmt, refname); | |
937 | return 0; | |
938 | } | |
939 | ||
940 | void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname) | |
941 | { | |
942 | struct warn_if_dangling_data data; | |
943 | ||
944 | data.fp = fp; | |
945 | data.refname = refname; | |
946 | data.msg_fmt = msg_fmt; | |
947 | for_each_rawref(warn_if_dangling_symref, &data); | |
948 | } | |
949 | ||
0bad611b HV |
950 | static int do_for_each_ref(const char *submodule, const char *base, each_ref_fn fn, |
951 | int trim, int flags, void *cb_data) | |
8a65ff76 | 952 | { |
316b097a | 953 | struct ref_cache *refs = get_ref_cache(submodule); |
b3fd060f MH |
954 | struct ref_array *packed_refs = get_packed_refs(refs); |
955 | struct ref_array *loose_refs = get_loose_refs(refs); | |
956 | sort_ref_array(packed_refs); | |
957 | sort_ref_array(loose_refs); | |
958 | return do_for_each_ref_in_arrays(packed_refs, | |
959 | loose_refs, | |
960 | base, fn, trim, flags, cb_data); | |
8a65ff76 LT |
961 | } |
962 | ||
0bad611b | 963 | static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data) |
723c31fe LT |
964 | { |
965 | unsigned char sha1[20]; | |
8da19775 JH |
966 | int flag; |
967 | ||
0bad611b HV |
968 | if (submodule) { |
969 | if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0) | |
970 | return fn("HEAD", sha1, 0, cb_data); | |
971 | ||
972 | return 0; | |
973 | } | |
974 | ||
c6893323 | 975 | if (!read_ref_full("HEAD", sha1, 1, &flag)) |
8da19775 | 976 | return fn("HEAD", sha1, flag, cb_data); |
0bad611b | 977 | |
2f34ba32 | 978 | return 0; |
723c31fe LT |
979 | } |
980 | ||
0bad611b HV |
981 | int head_ref(each_ref_fn fn, void *cb_data) |
982 | { | |
983 | return do_head_ref(NULL, fn, cb_data); | |
984 | } | |
985 | ||
9ef6aeb0 HV |
986 | int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
987 | { | |
988 | return do_head_ref(submodule, fn, cb_data); | |
989 | } | |
990 | ||
cb5d709f | 991 | int for_each_ref(each_ref_fn fn, void *cb_data) |
8a65ff76 | 992 | { |
b3cfc406 | 993 | return do_for_each_ref(NULL, "", fn, 0, 0, cb_data); |
a62be77f SE |
994 | } |
995 | ||
9ef6aeb0 HV |
996 | int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
997 | { | |
b3cfc406 | 998 | return do_for_each_ref(submodule, "", fn, 0, 0, cb_data); |
a62be77f SE |
999 | } |
1000 | ||
2a8177b6 CC |
1001 | int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data) |
1002 | { | |
0bad611b | 1003 | return do_for_each_ref(NULL, prefix, fn, strlen(prefix), 0, cb_data); |
2a8177b6 CC |
1004 | } |
1005 | ||
9ef6aeb0 HV |
1006 | int for_each_ref_in_submodule(const char *submodule, const char *prefix, |
1007 | each_ref_fn fn, void *cb_data) | |
1008 | { | |
1009 | return do_for_each_ref(submodule, prefix, fn, strlen(prefix), 0, cb_data); | |
2a8177b6 CC |
1010 | } |
1011 | ||
cb5d709f | 1012 | int for_each_tag_ref(each_ref_fn fn, void *cb_data) |
a62be77f | 1013 | { |
2a8177b6 | 1014 | return for_each_ref_in("refs/tags/", fn, cb_data); |
a62be77f SE |
1015 | } |
1016 | ||
9ef6aeb0 HV |
1017 | int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1018 | { | |
1019 | return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data); | |
1020 | } | |
1021 | ||
cb5d709f | 1022 | int for_each_branch_ref(each_ref_fn fn, void *cb_data) |
a62be77f | 1023 | { |
2a8177b6 | 1024 | return for_each_ref_in("refs/heads/", fn, cb_data); |
a62be77f SE |
1025 | } |
1026 | ||
9ef6aeb0 HV |
1027 | int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1028 | { | |
1029 | return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data); | |
1030 | } | |
1031 | ||
cb5d709f | 1032 | int for_each_remote_ref(each_ref_fn fn, void *cb_data) |
a62be77f | 1033 | { |
2a8177b6 | 1034 | return for_each_ref_in("refs/remotes/", fn, cb_data); |
f8948e2f JH |
1035 | } |
1036 | ||
9ef6aeb0 HV |
1037 | int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1038 | { | |
1039 | return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data); | |
1040 | } | |
1041 | ||
29268700 CC |
1042 | int for_each_replace_ref(each_ref_fn fn, void *cb_data) |
1043 | { | |
0bad611b | 1044 | return do_for_each_ref(NULL, "refs/replace/", fn, 13, 0, cb_data); |
29268700 CC |
1045 | } |
1046 | ||
a1bea2c1 JT |
1047 | int head_ref_namespaced(each_ref_fn fn, void *cb_data) |
1048 | { | |
1049 | struct strbuf buf = STRBUF_INIT; | |
1050 | int ret = 0; | |
1051 | unsigned char sha1[20]; | |
1052 | int flag; | |
1053 | ||
1054 | strbuf_addf(&buf, "%sHEAD", get_git_namespace()); | |
c6893323 | 1055 | if (!read_ref_full(buf.buf, sha1, 1, &flag)) |
a1bea2c1 JT |
1056 | ret = fn(buf.buf, sha1, flag, cb_data); |
1057 | strbuf_release(&buf); | |
1058 | ||
1059 | return ret; | |
1060 | } | |
1061 | ||
1062 | int for_each_namespaced_ref(each_ref_fn fn, void *cb_data) | |
1063 | { | |
1064 | struct strbuf buf = STRBUF_INIT; | |
1065 | int ret; | |
1066 | strbuf_addf(&buf, "%srefs/", get_git_namespace()); | |
1067 | ret = do_for_each_ref(NULL, buf.buf, fn, 0, 0, cb_data); | |
1068 | strbuf_release(&buf); | |
1069 | return ret; | |
1070 | } | |
1071 | ||
b09fe971 IL |
1072 | int for_each_glob_ref_in(each_ref_fn fn, const char *pattern, |
1073 | const char *prefix, void *cb_data) | |
d08bae7e IL |
1074 | { |
1075 | struct strbuf real_pattern = STRBUF_INIT; | |
1076 | struct ref_filter filter; | |
d08bae7e IL |
1077 | int ret; |
1078 | ||
b09fe971 | 1079 | if (!prefix && prefixcmp(pattern, "refs/")) |
d08bae7e | 1080 | strbuf_addstr(&real_pattern, "refs/"); |
b09fe971 IL |
1081 | else if (prefix) |
1082 | strbuf_addstr(&real_pattern, prefix); | |
d08bae7e IL |
1083 | strbuf_addstr(&real_pattern, pattern); |
1084 | ||
894a9d33 | 1085 | if (!has_glob_specials(pattern)) { |
9517e6b8 | 1086 | /* Append implied '/' '*' if not present. */ |
d08bae7e IL |
1087 | if (real_pattern.buf[real_pattern.len - 1] != '/') |
1088 | strbuf_addch(&real_pattern, '/'); | |
1089 | /* No need to check for '*', there is none. */ | |
1090 | strbuf_addch(&real_pattern, '*'); | |
1091 | } | |
1092 | ||
1093 | filter.pattern = real_pattern.buf; | |
1094 | filter.fn = fn; | |
1095 | filter.cb_data = cb_data; | |
1096 | ret = for_each_ref(filter_refs, &filter); | |
1097 | ||
1098 | strbuf_release(&real_pattern); | |
1099 | return ret; | |
1100 | } | |
1101 | ||
b09fe971 IL |
1102 | int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data) |
1103 | { | |
1104 | return for_each_glob_ref_in(fn, pattern, NULL, cb_data); | |
1105 | } | |
1106 | ||
f8948e2f JH |
1107 | int for_each_rawref(each_ref_fn fn, void *cb_data) |
1108 | { | |
b3cfc406 | 1109 | return do_for_each_ref(NULL, "", fn, 0, |
f8948e2f | 1110 | DO_FOR_EACH_INCLUDE_BROKEN, cb_data); |
8a65ff76 LT |
1111 | } |
1112 | ||
4577e483 | 1113 | const char *prettify_refname(const char *name) |
a9c37a72 | 1114 | { |
a9c37a72 DB |
1115 | return name + ( |
1116 | !prefixcmp(name, "refs/heads/") ? 11 : | |
1117 | !prefixcmp(name, "refs/tags/") ? 10 : | |
1118 | !prefixcmp(name, "refs/remotes/") ? 13 : | |
1119 | 0); | |
1120 | } | |
1121 | ||
79803322 SP |
1122 | const char *ref_rev_parse_rules[] = { |
1123 | "%.*s", | |
1124 | "refs/%.*s", | |
1125 | "refs/tags/%.*s", | |
1126 | "refs/heads/%.*s", | |
1127 | "refs/remotes/%.*s", | |
1128 | "refs/remotes/%.*s/HEAD", | |
1129 | NULL | |
1130 | }; | |
1131 | ||
1132 | int refname_match(const char *abbrev_name, const char *full_name, const char **rules) | |
1133 | { | |
1134 | const char **p; | |
1135 | const int abbrev_name_len = strlen(abbrev_name); | |
1136 | ||
1137 | for (p = rules; *p; p++) { | |
1138 | if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) { | |
1139 | return 1; | |
1140 | } | |
1141 | } | |
1142 | ||
1143 | return 0; | |
1144 | } | |
1145 | ||
e5f38ec3 | 1146 | static struct ref_lock *verify_lock(struct ref_lock *lock, |
4bd18c43 SP |
1147 | const unsigned char *old_sha1, int mustexist) |
1148 | { | |
c6893323 | 1149 | if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) { |
434cd0cd | 1150 | error("Can't verify ref %s", lock->ref_name); |
4bd18c43 SP |
1151 | unlock_ref(lock); |
1152 | return NULL; | |
1153 | } | |
a89fccd2 | 1154 | if (hashcmp(lock->old_sha1, old_sha1)) { |
434cd0cd | 1155 | error("Ref %s is at %s but expected %s", lock->ref_name, |
4bd18c43 SP |
1156 | sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1)); |
1157 | unlock_ref(lock); | |
1158 | return NULL; | |
1159 | } | |
1160 | return lock; | |
1161 | } | |
1162 | ||
7155b727 | 1163 | static int remove_empty_directories(const char *file) |
bc7127ef JH |
1164 | { |
1165 | /* we want to create a file but there is a directory there; | |
1166 | * if that is an empty directory (or a directory that contains | |
1167 | * only empty directories), remove them. | |
1168 | */ | |
7155b727 JS |
1169 | struct strbuf path; |
1170 | int result; | |
bc7127ef | 1171 | |
7155b727 JS |
1172 | strbuf_init(&path, 20); |
1173 | strbuf_addstr(&path, file); | |
1174 | ||
a0f4afbe | 1175 | result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY); |
7155b727 JS |
1176 | |
1177 | strbuf_release(&path); | |
1178 | ||
1179 | return result; | |
bc7127ef JH |
1180 | } |
1181 | ||
ff74f7f1 JH |
1182 | /* |
1183 | * *string and *len will only be substituted, and *string returned (for | |
1184 | * later free()ing) if the string passed in is a magic short-hand form | |
1185 | * to name a branch. | |
1186 | */ | |
1187 | static char *substitute_branch_name(const char **string, int *len) | |
1188 | { | |
1189 | struct strbuf buf = STRBUF_INIT; | |
1190 | int ret = interpret_branch_name(*string, &buf); | |
1191 | ||
1192 | if (ret == *len) { | |
1193 | size_t size; | |
1194 | *string = strbuf_detach(&buf, &size); | |
1195 | *len = size; | |
1196 | return (char *)*string; | |
1197 | } | |
1198 | ||
1199 | return NULL; | |
1200 | } | |
1201 | ||
1202 | int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref) | |
1203 | { | |
1204 | char *last_branch = substitute_branch_name(&str, &len); | |
1205 | const char **p, *r; | |
1206 | int refs_found = 0; | |
1207 | ||
1208 | *ref = NULL; | |
1209 | for (p = ref_rev_parse_rules; *p; p++) { | |
1210 | char fullref[PATH_MAX]; | |
1211 | unsigned char sha1_from_ref[20]; | |
1212 | unsigned char *this_result; | |
1213 | int flag; | |
1214 | ||
1215 | this_result = refs_found ? sha1_from_ref : sha1; | |
1216 | mksnpath(fullref, sizeof(fullref), *p, len, str); | |
8cad4744 | 1217 | r = resolve_ref_unsafe(fullref, this_result, 1, &flag); |
ff74f7f1 JH |
1218 | if (r) { |
1219 | if (!refs_found++) | |
1220 | *ref = xstrdup(r); | |
1221 | if (!warn_ambiguous_refs) | |
1222 | break; | |
55956350 | 1223 | } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) { |
ff74f7f1 | 1224 | warning("ignoring dangling symref %s.", fullref); |
55956350 JH |
1225 | } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) { |
1226 | warning("ignoring broken ref %s.", fullref); | |
1227 | } | |
ff74f7f1 JH |
1228 | } |
1229 | free(last_branch); | |
1230 | return refs_found; | |
1231 | } | |
1232 | ||
1233 | int dwim_log(const char *str, int len, unsigned char *sha1, char **log) | |
1234 | { | |
1235 | char *last_branch = substitute_branch_name(&str, &len); | |
1236 | const char **p; | |
1237 | int logs_found = 0; | |
1238 | ||
1239 | *log = NULL; | |
1240 | for (p = ref_rev_parse_rules; *p; p++) { | |
1241 | struct stat st; | |
1242 | unsigned char hash[20]; | |
1243 | char path[PATH_MAX]; | |
1244 | const char *ref, *it; | |
1245 | ||
1246 | mksnpath(path, sizeof(path), *p, len, str); | |
8cad4744 | 1247 | ref = resolve_ref_unsafe(path, hash, 1, NULL); |
ff74f7f1 JH |
1248 | if (!ref) |
1249 | continue; | |
1250 | if (!stat(git_path("logs/%s", path), &st) && | |
1251 | S_ISREG(st.st_mode)) | |
1252 | it = path; | |
1253 | else if (strcmp(ref, path) && | |
1254 | !stat(git_path("logs/%s", ref), &st) && | |
1255 | S_ISREG(st.st_mode)) | |
1256 | it = ref; | |
1257 | else | |
1258 | continue; | |
1259 | if (!logs_found++) { | |
1260 | *log = xstrdup(it); | |
1261 | hashcpy(sha1, hash); | |
1262 | } | |
1263 | if (!warn_ambiguous_refs) | |
1264 | break; | |
1265 | } | |
1266 | free(last_branch); | |
1267 | return logs_found; | |
1268 | } | |
1269 | ||
dfefa935 MH |
1270 | static struct ref_lock *lock_ref_sha1_basic(const char *refname, |
1271 | const unsigned char *old_sha1, | |
1272 | int flags, int *type_p) | |
4bd18c43 | 1273 | { |
434cd0cd | 1274 | char *ref_file; |
dfefa935 | 1275 | const char *orig_refname = refname; |
4bd18c43 | 1276 | struct ref_lock *lock; |
5cc3cef9 | 1277 | int last_errno = 0; |
acd3b9ec | 1278 | int type, lflags; |
4431fcc4 | 1279 | int mustexist = (old_sha1 && !is_null_sha1(old_sha1)); |
5bdd8d4a | 1280 | int missing = 0; |
4bd18c43 SP |
1281 | |
1282 | lock = xcalloc(1, sizeof(struct ref_lock)); | |
1283 | lock->lock_fd = -1; | |
1284 | ||
8d68493f | 1285 | refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type); |
dfefa935 | 1286 | if (!refname && errno == EISDIR) { |
bc7127ef JH |
1287 | /* we are trying to lock foo but we used to |
1288 | * have foo/bar which now does not exist; | |
1289 | * it is normal for the empty directory 'foo' | |
1290 | * to remain. | |
1291 | */ | |
dfefa935 | 1292 | ref_file = git_path("%s", orig_refname); |
5cc3cef9 JH |
1293 | if (remove_empty_directories(ref_file)) { |
1294 | last_errno = errno; | |
dfefa935 | 1295 | error("there are still refs under '%s'", orig_refname); |
5cc3cef9 JH |
1296 | goto error_return; |
1297 | } | |
8d68493f | 1298 | refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type); |
bc7127ef | 1299 | } |
68db31cc SV |
1300 | if (type_p) |
1301 | *type_p = type; | |
dfefa935 | 1302 | if (!refname) { |
5cc3cef9 | 1303 | last_errno = errno; |
818f477c | 1304 | error("unable to resolve reference %s: %s", |
dfefa935 | 1305 | orig_refname, strerror(errno)); |
5cc3cef9 | 1306 | goto error_return; |
4bd18c43 | 1307 | } |
5bdd8d4a | 1308 | missing = is_null_sha1(lock->old_sha1); |
c976d415 LH |
1309 | /* When the ref did not exist and we are creating it, |
1310 | * make sure there is no existing ref that is packed | |
1311 | * whose name begins with our refname, nor a ref whose | |
1312 | * name is a proper prefix of our refname. | |
1313 | */ | |
5bdd8d4a | 1314 | if (missing && |
316b097a | 1315 | !is_refname_available(refname, NULL, get_packed_refs(get_ref_cache(NULL)))) { |
f475e08e | 1316 | last_errno = ENOTDIR; |
c976d415 | 1317 | goto error_return; |
f475e08e | 1318 | } |
22a3844e | 1319 | |
c33d5174 | 1320 | lock->lk = xcalloc(1, sizeof(struct lock_file)); |
4bd18c43 | 1321 | |
acd3b9ec JH |
1322 | lflags = LOCK_DIE_ON_ERROR; |
1323 | if (flags & REF_NODEREF) { | |
dfefa935 | 1324 | refname = orig_refname; |
acd3b9ec JH |
1325 | lflags |= LOCK_NODEREF; |
1326 | } | |
dfefa935 MH |
1327 | lock->ref_name = xstrdup(refname); |
1328 | lock->orig_ref_name = xstrdup(orig_refname); | |
1329 | ref_file = git_path("%s", refname); | |
5bdd8d4a | 1330 | if (missing) |
68db31cc SV |
1331 | lock->force_write = 1; |
1332 | if ((flags & REF_NODEREF) && (type & REF_ISSYMREF)) | |
1333 | lock->force_write = 1; | |
4bd18c43 | 1334 | |
5cc3cef9 JH |
1335 | if (safe_create_leading_directories(ref_file)) { |
1336 | last_errno = errno; | |
1337 | error("unable to create directory for %s", ref_file); | |
1338 | goto error_return; | |
1339 | } | |
4bd18c43 | 1340 | |
acd3b9ec | 1341 | lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags); |
4bd18c43 | 1342 | return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock; |
5cc3cef9 JH |
1343 | |
1344 | error_return: | |
1345 | unlock_ref(lock); | |
1346 | errno = last_errno; | |
1347 | return NULL; | |
4bd18c43 SP |
1348 | } |
1349 | ||
dfefa935 | 1350 | struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1) |
95fc7512 | 1351 | { |
53cce84c | 1352 | char refpath[PATH_MAX]; |
dfefa935 | 1353 | if (check_refname_format(refname, 0)) |
4bd18c43 | 1354 | return NULL; |
dfefa935 | 1355 | strcpy(refpath, mkpath("refs/%s", refname)); |
68db31cc | 1356 | return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL); |
4bd18c43 SP |
1357 | } |
1358 | ||
dfefa935 MH |
1359 | struct ref_lock *lock_any_ref_for_update(const char *refname, |
1360 | const unsigned char *old_sha1, int flags) | |
4bd18c43 | 1361 | { |
dfefa935 | 1362 | if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) |
257f3020 | 1363 | return NULL; |
dfefa935 | 1364 | return lock_ref_sha1_basic(refname, old_sha1, flags, NULL); |
c0277d15 JH |
1365 | } |
1366 | ||
d66da478 MH |
1367 | struct repack_without_ref_sb { |
1368 | const char *refname; | |
1369 | int fd; | |
1370 | }; | |
1371 | ||
1372 | static int repack_without_ref_fn(const char *refname, const unsigned char *sha1, | |
1373 | int flags, void *cb_data) | |
1374 | { | |
1375 | struct repack_without_ref_sb *data = cb_data; | |
1376 | char line[PATH_MAX + 100]; | |
1377 | int len; | |
1378 | ||
1379 | if (!strcmp(data->refname, refname)) | |
1380 | return 0; | |
1381 | len = snprintf(line, sizeof(line), "%s %s\n", | |
1382 | sha1_to_hex(sha1), refname); | |
1383 | /* this should not happen but just being defensive */ | |
1384 | if (len > sizeof(line)) | |
1385 | die("too long a refname '%s'", refname); | |
1386 | write_or_die(data->fd, line, len); | |
1387 | return 0; | |
1388 | } | |
1389 | ||
26a063a1 JH |
1390 | static struct lock_file packlock; |
1391 | ||
c0277d15 JH |
1392 | static int repack_without_ref(const char *refname) |
1393 | { | |
d66da478 MH |
1394 | struct repack_without_ref_sb data; |
1395 | struct ref_array *packed = get_packed_refs(get_ref_cache(NULL)); | |
1396 | sort_ref_array(packed); | |
fe9c7b78 | 1397 | if (search_ref_array(packed, refname) == NULL) |
c0277d15 | 1398 | return 0; |
d66da478 MH |
1399 | data.refname = refname; |
1400 | data.fd = hold_lock_file_for_update(&packlock, git_path("packed-refs"), 0); | |
1401 | if (data.fd < 0) { | |
1b018fd9 | 1402 | unable_to_lock_error(git_path("packed-refs"), errno); |
c0277d15 | 1403 | return error("cannot delete '%s' from packed refs", refname); |
1b018fd9 | 1404 | } |
d66da478 | 1405 | do_for_each_ref_in_array(packed, 0, "", repack_without_ref_fn, 0, 0, &data); |
c0277d15 JH |
1406 | return commit_lock_file(&packlock); |
1407 | } | |
1408 | ||
eca35a25 | 1409 | int delete_ref(const char *refname, const unsigned char *sha1, int delopt) |
c0277d15 JH |
1410 | { |
1411 | struct ref_lock *lock; | |
eca35a25 | 1412 | int err, i = 0, ret = 0, flag = 0; |
c0277d15 | 1413 | |
68db31cc | 1414 | lock = lock_ref_sha1_basic(refname, sha1, 0, &flag); |
c0277d15 JH |
1415 | if (!lock) |
1416 | return 1; | |
045a476f | 1417 | if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) { |
c0277d15 | 1418 | /* loose */ |
eca35a25 MV |
1419 | const char *path; |
1420 | ||
1421 | if (!(delopt & REF_NODEREF)) { | |
1422 | i = strlen(lock->lk->filename) - 5; /* .lock */ | |
1423 | lock->lk->filename[i] = 0; | |
1424 | path = lock->lk->filename; | |
1425 | } else { | |
9db56f71 | 1426 | path = git_path("%s", refname); |
eca35a25 | 1427 | } |
691f1a28 AR |
1428 | err = unlink_or_warn(path); |
1429 | if (err && errno != ENOENT) | |
c0277d15 | 1430 | ret = 1; |
691f1a28 | 1431 | |
eca35a25 MV |
1432 | if (!(delopt & REF_NODEREF)) |
1433 | lock->lk->filename[i] = '.'; | |
c0277d15 JH |
1434 | } |
1435 | /* removing the loose one could have resurrected an earlier | |
1436 | * packed one. Also, if it was not loose we need to repack | |
1437 | * without it. | |
1438 | */ | |
1439 | ret |= repack_without_ref(refname); | |
1440 | ||
691f1a28 | 1441 | unlink_or_warn(git_path("logs/%s", lock->ref_name)); |
3870a0d1 | 1442 | invalidate_ref_cache(NULL); |
c0277d15 JH |
1443 | unlock_ref(lock); |
1444 | return ret; | |
4bd18c43 SP |
1445 | } |
1446 | ||
765c2258 PH |
1447 | /* |
1448 | * People using contrib's git-new-workdir have .git/logs/refs -> | |
1449 | * /some/other/path/.git/logs/refs, and that may live on another device. | |
1450 | * | |
1451 | * IOW, to avoid cross device rename errors, the temporary renamed log must | |
1452 | * live into logs/refs. | |
1453 | */ | |
1454 | #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log" | |
1455 | ||
dfefa935 | 1456 | int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg) |
c976d415 | 1457 | { |
c976d415 LH |
1458 | unsigned char sha1[20], orig_sha1[20]; |
1459 | int flag = 0, logmoved = 0; | |
1460 | struct ref_lock *lock; | |
c976d415 | 1461 | struct stat loginfo; |
dfefa935 | 1462 | int log = !lstat(git_path("logs/%s", oldrefname), &loginfo); |
eca35a25 | 1463 | const char *symref = NULL; |
316b097a | 1464 | struct ref_cache *refs = get_ref_cache(NULL); |
c976d415 | 1465 | |
450d4c0f | 1466 | if (log && S_ISLNK(loginfo.st_mode)) |
dfefa935 | 1467 | return error("reflog for %s is a symlink", oldrefname); |
c976d415 | 1468 | |
8d68493f | 1469 | symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag); |
eca35a25 | 1470 | if (flag & REF_ISSYMREF) |
fa58186c | 1471 | return error("refname %s is a symbolic ref, renaming it is not supported", |
dfefa935 | 1472 | oldrefname); |
eca35a25 | 1473 | if (!symref) |
dfefa935 | 1474 | return error("refname %s not found", oldrefname); |
c976d415 | 1475 | |
316b097a | 1476 | if (!is_refname_available(newrefname, oldrefname, get_packed_refs(refs))) |
c976d415 LH |
1477 | return 1; |
1478 | ||
316b097a | 1479 | if (!is_refname_available(newrefname, oldrefname, get_loose_refs(refs))) |
c976d415 LH |
1480 | return 1; |
1481 | ||
dfefa935 | 1482 | if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG))) |
765c2258 | 1483 | return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s", |
dfefa935 | 1484 | oldrefname, strerror(errno)); |
c976d415 | 1485 | |
dfefa935 MH |
1486 | if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) { |
1487 | error("unable to delete old %s", oldrefname); | |
c976d415 LH |
1488 | goto rollback; |
1489 | } | |
1490 | ||
dfefa935 MH |
1491 | if (!read_ref_full(newrefname, sha1, 1, &flag) && |
1492 | delete_ref(newrefname, sha1, REF_NODEREF)) { | |
c976d415 | 1493 | if (errno==EISDIR) { |
dfefa935 MH |
1494 | if (remove_empty_directories(git_path("%s", newrefname))) { |
1495 | error("Directory not empty: %s", newrefname); | |
c976d415 LH |
1496 | goto rollback; |
1497 | } | |
1498 | } else { | |
dfefa935 | 1499 | error("unable to delete existing %s", newrefname); |
c976d415 LH |
1500 | goto rollback; |
1501 | } | |
1502 | } | |
1503 | ||
dfefa935 MH |
1504 | if (log && safe_create_leading_directories(git_path("logs/%s", newrefname))) { |
1505 | error("unable to create directory for %s", newrefname); | |
c976d415 LH |
1506 | goto rollback; |
1507 | } | |
1508 | ||
1509 | retry: | |
dfefa935 | 1510 | if (log && rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) { |
d9e74d57 JR |
1511 | if (errno==EISDIR || errno==ENOTDIR) { |
1512 | /* | |
1513 | * rename(a, b) when b is an existing | |
1514 | * directory ought to result in ISDIR, but | |
1515 | * Solaris 5.8 gives ENOTDIR. Sheesh. | |
1516 | */ | |
dfefa935 MH |
1517 | if (remove_empty_directories(git_path("logs/%s", newrefname))) { |
1518 | error("Directory not empty: logs/%s", newrefname); | |
c976d415 LH |
1519 | goto rollback; |
1520 | } | |
1521 | goto retry; | |
1522 | } else { | |
765c2258 | 1523 | error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s", |
dfefa935 | 1524 | newrefname, strerror(errno)); |
c976d415 LH |
1525 | goto rollback; |
1526 | } | |
1527 | } | |
1528 | logmoved = log; | |
1529 | ||
dfefa935 | 1530 | lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL); |
c976d415 | 1531 | if (!lock) { |
dfefa935 | 1532 | error("unable to lock %s for update", newrefname); |
c976d415 LH |
1533 | goto rollback; |
1534 | } | |
c976d415 LH |
1535 | lock->force_write = 1; |
1536 | hashcpy(lock->old_sha1, orig_sha1); | |
678d0f4c | 1537 | if (write_ref_sha1(lock, orig_sha1, logmsg)) { |
dfefa935 | 1538 | error("unable to write current sha1 into %s", newrefname); |
c976d415 LH |
1539 | goto rollback; |
1540 | } | |
1541 | ||
1542 | return 0; | |
1543 | ||
1544 | rollback: | |
dfefa935 | 1545 | lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL); |
c976d415 | 1546 | if (!lock) { |
dfefa935 | 1547 | error("unable to lock %s for rollback", oldrefname); |
c976d415 LH |
1548 | goto rollbacklog; |
1549 | } | |
1550 | ||
1551 | lock->force_write = 1; | |
1552 | flag = log_all_ref_updates; | |
1553 | log_all_ref_updates = 0; | |
1554 | if (write_ref_sha1(lock, orig_sha1, NULL)) | |
dfefa935 | 1555 | error("unable to write current sha1 into %s", oldrefname); |
c976d415 LH |
1556 | log_all_ref_updates = flag; |
1557 | ||
1558 | rollbacklog: | |
dfefa935 | 1559 | if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname))) |
c976d415 | 1560 | error("unable to restore logfile %s from %s: %s", |
dfefa935 | 1561 | oldrefname, newrefname, strerror(errno)); |
c976d415 | 1562 | if (!logmoved && log && |
dfefa935 | 1563 | rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname))) |
765c2258 | 1564 | error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s", |
dfefa935 | 1565 | oldrefname, strerror(errno)); |
c976d415 LH |
1566 | |
1567 | return 1; | |
1568 | } | |
1569 | ||
435fc852 | 1570 | int close_ref(struct ref_lock *lock) |
b531394d BC |
1571 | { |
1572 | if (close_lock_file(lock->lk)) | |
1573 | return -1; | |
1574 | lock->lock_fd = -1; | |
1575 | return 0; | |
1576 | } | |
1577 | ||
435fc852 | 1578 | int commit_ref(struct ref_lock *lock) |
b531394d BC |
1579 | { |
1580 | if (commit_lock_file(lock->lk)) | |
1581 | return -1; | |
1582 | lock->lock_fd = -1; | |
1583 | return 0; | |
1584 | } | |
1585 | ||
e5f38ec3 | 1586 | void unlock_ref(struct ref_lock *lock) |
4bd18c43 | 1587 | { |
4ed7cd3a BC |
1588 | /* Do not free lock->lk -- atexit() still looks at them */ |
1589 | if (lock->lk) | |
1590 | rollback_lock_file(lock->lk); | |
434cd0cd | 1591 | free(lock->ref_name); |
1655707c | 1592 | free(lock->orig_ref_name); |
4bd18c43 SP |
1593 | free(lock); |
1594 | } | |
1595 | ||
0ec29a47 JH |
1596 | /* |
1597 | * copy the reflog message msg to buf, which has been allocated sufficiently | |
1598 | * large, while cleaning up the whitespaces. Especially, convert LF to space, | |
1599 | * because reflog file is one line per entry. | |
1600 | */ | |
1601 | static int copy_msg(char *buf, const char *msg) | |
1602 | { | |
1603 | char *cp = buf; | |
1604 | char c; | |
1605 | int wasspace = 1; | |
1606 | ||
1607 | *cp++ = '\t'; | |
1608 | while ((c = *msg++)) { | |
1609 | if (wasspace && isspace(c)) | |
1610 | continue; | |
1611 | wasspace = isspace(c); | |
1612 | if (wasspace) | |
1613 | c = ' '; | |
1614 | *cp++ = c; | |
1615 | } | |
1616 | while (buf < cp && isspace(cp[-1])) | |
1617 | cp--; | |
1618 | *cp++ = '\n'; | |
1619 | return cp - buf; | |
1620 | } | |
1621 | ||
dfefa935 | 1622 | int log_ref_setup(const char *refname, char *logfile, int bufsize) |
6de08ae6 | 1623 | { |
859c3017 | 1624 | int logfd, oflags = O_APPEND | O_WRONLY; |
9a13f0b7 | 1625 | |
dfefa935 | 1626 | git_snpath(logfile, bufsize, "logs/%s", refname); |
4057deb5 | 1627 | if (log_all_ref_updates && |
dfefa935 MH |
1628 | (!prefixcmp(refname, "refs/heads/") || |
1629 | !prefixcmp(refname, "refs/remotes/") || | |
1630 | !prefixcmp(refname, "refs/notes/") || | |
1631 | !strcmp(refname, "HEAD"))) { | |
157aaea5 | 1632 | if (safe_create_leading_directories(logfile) < 0) |
6de08ae6 | 1633 | return error("unable to create directory for %s", |
157aaea5 | 1634 | logfile); |
6de08ae6 SP |
1635 | oflags |= O_CREAT; |
1636 | } | |
1637 | ||
157aaea5 | 1638 | logfd = open(logfile, oflags, 0666); |
6de08ae6 | 1639 | if (logfd < 0) { |
1974bf62 | 1640 | if (!(oflags & O_CREAT) && errno == ENOENT) |
6de08ae6 | 1641 | return 0; |
3b463c3f JH |
1642 | |
1643 | if ((oflags & O_CREAT) && errno == EISDIR) { | |
157aaea5 | 1644 | if (remove_empty_directories(logfile)) { |
3b463c3f | 1645 | return error("There are still logs under '%s'", |
157aaea5 | 1646 | logfile); |
3b463c3f | 1647 | } |
157aaea5 | 1648 | logfd = open(logfile, oflags, 0666); |
3b463c3f JH |
1649 | } |
1650 | ||
1651 | if (logfd < 0) | |
1652 | return error("Unable to append to %s: %s", | |
157aaea5 | 1653 | logfile, strerror(errno)); |
6de08ae6 SP |
1654 | } |
1655 | ||
157aaea5 | 1656 | adjust_shared_perm(logfile); |
859c3017 EM |
1657 | close(logfd); |
1658 | return 0; | |
1659 | } | |
443b92b6 | 1660 | |
dfefa935 | 1661 | static int log_ref_write(const char *refname, const unsigned char *old_sha1, |
859c3017 EM |
1662 | const unsigned char *new_sha1, const char *msg) |
1663 | { | |
1664 | int logfd, result, written, oflags = O_APPEND | O_WRONLY; | |
1665 | unsigned maxlen, len; | |
1666 | int msglen; | |
157aaea5 | 1667 | char log_file[PATH_MAX]; |
859c3017 EM |
1668 | char *logrec; |
1669 | const char *committer; | |
1670 | ||
1671 | if (log_all_ref_updates < 0) | |
1672 | log_all_ref_updates = !is_bare_repository(); | |
1673 | ||
dfefa935 | 1674 | result = log_ref_setup(refname, log_file, sizeof(log_file)); |
859c3017 EM |
1675 | if (result) |
1676 | return result; | |
1677 | ||
1678 | logfd = open(log_file, oflags); | |
1679 | if (logfd < 0) | |
1680 | return 0; | |
0ec29a47 | 1681 | msglen = msg ? strlen(msg) : 0; |
774751a8 | 1682 | committer = git_committer_info(0); |
8ac65937 JH |
1683 | maxlen = strlen(committer) + msglen + 100; |
1684 | logrec = xmalloc(maxlen); | |
1685 | len = sprintf(logrec, "%s %s %s\n", | |
9a13f0b7 NP |
1686 | sha1_to_hex(old_sha1), |
1687 | sha1_to_hex(new_sha1), | |
8ac65937 JH |
1688 | committer); |
1689 | if (msglen) | |
0ec29a47 | 1690 | len += copy_msg(logrec + len - 1, msg) - 1; |
93822c22 | 1691 | written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1; |
6de08ae6 | 1692 | free(logrec); |
91c8d590 | 1693 | if (close(logfd) != 0 || written != len) |
9a13f0b7 | 1694 | return error("Unable to append to %s", log_file); |
6de08ae6 SP |
1695 | return 0; |
1696 | } | |
1697 | ||
c3b0dec5 LT |
1698 | static int is_branch(const char *refname) |
1699 | { | |
1700 | return !strcmp(refname, "HEAD") || !prefixcmp(refname, "refs/heads/"); | |
1701 | } | |
1702 | ||
4bd18c43 SP |
1703 | int write_ref_sha1(struct ref_lock *lock, |
1704 | const unsigned char *sha1, const char *logmsg) | |
1705 | { | |
1706 | static char term = '\n'; | |
c3b0dec5 | 1707 | struct object *o; |
4bd18c43 SP |
1708 | |
1709 | if (!lock) | |
95fc7512 | 1710 | return -1; |
a89fccd2 | 1711 | if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) { |
4bd18c43 SP |
1712 | unlock_ref(lock); |
1713 | return 0; | |
95fc7512 | 1714 | } |
c3b0dec5 LT |
1715 | o = parse_object(sha1); |
1716 | if (!o) { | |
7be8b3ba | 1717 | error("Trying to write ref %s with nonexistent object %s", |
c3b0dec5 LT |
1718 | lock->ref_name, sha1_to_hex(sha1)); |
1719 | unlock_ref(lock); | |
1720 | return -1; | |
1721 | } | |
1722 | if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) { | |
1723 | error("Trying to write non-commit object %s to branch %s", | |
1724 | sha1_to_hex(sha1), lock->ref_name); | |
1725 | unlock_ref(lock); | |
1726 | return -1; | |
1727 | } | |
93822c22 AW |
1728 | if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 || |
1729 | write_in_full(lock->lock_fd, &term, 1) != 1 | |
b531394d | 1730 | || close_ref(lock) < 0) { |
c33d5174 | 1731 | error("Couldn't write %s", lock->lk->filename); |
4bd18c43 SP |
1732 | unlock_ref(lock); |
1733 | return -1; | |
1734 | } | |
8bf90dc9 | 1735 | clear_loose_ref_cache(get_ref_cache(NULL)); |
bd104db1 NP |
1736 | if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 || |
1737 | (strcmp(lock->ref_name, lock->orig_ref_name) && | |
1738 | log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) { | |
6de08ae6 SP |
1739 | unlock_ref(lock); |
1740 | return -1; | |
1741 | } | |
605fac8b NP |
1742 | if (strcmp(lock->orig_ref_name, "HEAD") != 0) { |
1743 | /* | |
1744 | * Special hack: If a branch is updated directly and HEAD | |
1745 | * points to it (may happen on the remote side of a push | |
1746 | * for example) then logically the HEAD reflog should be | |
1747 | * updated too. | |
1748 | * A generic solution implies reverse symref information, | |
1749 | * but finding all symrefs pointing to the given branch | |
1750 | * would be rather costly for this rare event (the direct | |
1751 | * update of a branch) to be worth it. So let's cheat and | |
1752 | * check with HEAD only which should cover 99% of all usage | |
1753 | * scenarios (even 100% of the default ones). | |
1754 | */ | |
1755 | unsigned char head_sha1[20]; | |
1756 | int head_flag; | |
1757 | const char *head_ref; | |
8cad4744 | 1758 | head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag); |
605fac8b NP |
1759 | if (head_ref && (head_flag & REF_ISSYMREF) && |
1760 | !strcmp(head_ref, lock->ref_name)) | |
1761 | log_ref_write("HEAD", lock->old_sha1, sha1, logmsg); | |
1762 | } | |
b531394d | 1763 | if (commit_ref(lock)) { |
434cd0cd | 1764 | error("Couldn't set %s", lock->ref_name); |
4bd18c43 SP |
1765 | unlock_ref(lock); |
1766 | return -1; | |
1767 | } | |
4bd18c43 SP |
1768 | unlock_ref(lock); |
1769 | return 0; | |
95fc7512 | 1770 | } |
d556fae2 | 1771 | |
8b5157e4 NP |
1772 | int create_symref(const char *ref_target, const char *refs_heads_master, |
1773 | const char *logmsg) | |
41b625b0 NP |
1774 | { |
1775 | const char *lockpath; | |
1776 | char ref[1000]; | |
1777 | int fd, len, written; | |
a4f34cbb | 1778 | char *git_HEAD = git_pathdup("%s", ref_target); |
8b5157e4 NP |
1779 | unsigned char old_sha1[20], new_sha1[20]; |
1780 | ||
1781 | if (logmsg && read_ref(ref_target, old_sha1)) | |
1782 | hashclr(old_sha1); | |
41b625b0 | 1783 | |
d48744d1 JH |
1784 | if (safe_create_leading_directories(git_HEAD) < 0) |
1785 | return error("unable to create directory for %s", git_HEAD); | |
1786 | ||
41b625b0 NP |
1787 | #ifndef NO_SYMLINK_HEAD |
1788 | if (prefer_symlink_refs) { | |
1789 | unlink(git_HEAD); | |
1790 | if (!symlink(refs_heads_master, git_HEAD)) | |
8b5157e4 | 1791 | goto done; |
41b625b0 NP |
1792 | fprintf(stderr, "no symlink - falling back to symbolic ref\n"); |
1793 | } | |
1794 | #endif | |
1795 | ||
1796 | len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master); | |
1797 | if (sizeof(ref) <= len) { | |
1798 | error("refname too long: %s", refs_heads_master); | |
47fc52e2 | 1799 | goto error_free_return; |
41b625b0 NP |
1800 | } |
1801 | lockpath = mkpath("%s.lock", git_HEAD); | |
1802 | fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666); | |
1803 | if (fd < 0) { | |
1804 | error("Unable to open %s for writing", lockpath); | |
47fc52e2 | 1805 | goto error_free_return; |
41b625b0 NP |
1806 | } |
1807 | written = write_in_full(fd, ref, len); | |
91c8d590 | 1808 | if (close(fd) != 0 || written != len) { |
41b625b0 | 1809 | error("Unable to write to %s", lockpath); |
47fc52e2 | 1810 | goto error_unlink_return; |
41b625b0 NP |
1811 | } |
1812 | if (rename(lockpath, git_HEAD) < 0) { | |
41b625b0 | 1813 | error("Unable to create %s", git_HEAD); |
47fc52e2 | 1814 | goto error_unlink_return; |
41b625b0 NP |
1815 | } |
1816 | if (adjust_shared_perm(git_HEAD)) { | |
41b625b0 | 1817 | error("Unable to fix permissions on %s", lockpath); |
47fc52e2 | 1818 | error_unlink_return: |
691f1a28 | 1819 | unlink_or_warn(lockpath); |
47fc52e2 JH |
1820 | error_free_return: |
1821 | free(git_HEAD); | |
1822 | return -1; | |
41b625b0 | 1823 | } |
8b5157e4 | 1824 | |
ee96d11b | 1825 | #ifndef NO_SYMLINK_HEAD |
8b5157e4 | 1826 | done: |
ee96d11b | 1827 | #endif |
8b5157e4 NP |
1828 | if (logmsg && !read_ref(refs_heads_master, new_sha1)) |
1829 | log_ref_write(ref_target, old_sha1, new_sha1, logmsg); | |
1830 | ||
47fc52e2 | 1831 | free(git_HEAD); |
41b625b0 NP |
1832 | return 0; |
1833 | } | |
1834 | ||
16d7cc90 JH |
1835 | static char *ref_msg(const char *line, const char *endp) |
1836 | { | |
1837 | const char *ep; | |
16d7cc90 | 1838 | line += 82; |
182af834 PH |
1839 | ep = memchr(line, '\n', endp - line); |
1840 | if (!ep) | |
1841 | ep = endp; | |
1842 | return xmemdupz(line, ep - line); | |
16d7cc90 JH |
1843 | } |
1844 | ||
dfefa935 MH |
1845 | int read_ref_at(const char *refname, unsigned long at_time, int cnt, |
1846 | unsigned char *sha1, char **msg, | |
1847 | unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt) | |
d556fae2 | 1848 | { |
e5229042 | 1849 | const char *logfile, *logdata, *logend, *rec, *lastgt, *lastrec; |
d556fae2 | 1850 | char *tz_c; |
e29cb53a | 1851 | int logfd, tz, reccnt = 0; |
d556fae2 SP |
1852 | struct stat st; |
1853 | unsigned long date; | |
e5229042 | 1854 | unsigned char logged_sha1[20]; |
cb48cb58 | 1855 | void *log_mapped; |
dc49cd76 | 1856 | size_t mapsz; |
d556fae2 | 1857 | |
dfefa935 | 1858 | logfile = git_path("logs/%s", refname); |
d556fae2 SP |
1859 | logfd = open(logfile, O_RDONLY, 0); |
1860 | if (logfd < 0) | |
d824cbba | 1861 | die_errno("Unable to read log '%s'", logfile); |
d556fae2 SP |
1862 | fstat(logfd, &st); |
1863 | if (!st.st_size) | |
1864 | die("Log %s is empty.", logfile); | |
dc49cd76 SP |
1865 | mapsz = xsize_t(st.st_size); |
1866 | log_mapped = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, logfd, 0); | |
cb48cb58 | 1867 | logdata = log_mapped; |
d556fae2 SP |
1868 | close(logfd); |
1869 | ||
e5229042 | 1870 | lastrec = NULL; |
d556fae2 SP |
1871 | rec = logend = logdata + st.st_size; |
1872 | while (logdata < rec) { | |
e29cb53a | 1873 | reccnt++; |
d556fae2 SP |
1874 | if (logdata < rec && *(rec-1) == '\n') |
1875 | rec--; | |
e5229042 SP |
1876 | lastgt = NULL; |
1877 | while (logdata < rec && *(rec-1) != '\n') { | |
d556fae2 | 1878 | rec--; |
e5229042 SP |
1879 | if (*rec == '>') |
1880 | lastgt = rec; | |
1881 | } | |
1882 | if (!lastgt) | |
d556fae2 | 1883 | die("Log %s is corrupt.", logfile); |
e5229042 | 1884 | date = strtoul(lastgt + 1, &tz_c, 10); |
ab2a1a32 | 1885 | if (date <= at_time || cnt == 0) { |
76a44c5c | 1886 | tz = strtoul(tz_c, NULL, 10); |
16d7cc90 JH |
1887 | if (msg) |
1888 | *msg = ref_msg(rec, logend); | |
1889 | if (cutoff_time) | |
1890 | *cutoff_time = date; | |
1891 | if (cutoff_tz) | |
1892 | *cutoff_tz = tz; | |
1893 | if (cutoff_cnt) | |
76a44c5c | 1894 | *cutoff_cnt = reccnt - 1; |
e5229042 SP |
1895 | if (lastrec) { |
1896 | if (get_sha1_hex(lastrec, logged_sha1)) | |
1897 | die("Log %s is corrupt.", logfile); | |
1898 | if (get_sha1_hex(rec + 41, sha1)) | |
1899 | die("Log %s is corrupt.", logfile); | |
a89fccd2 | 1900 | if (hashcmp(logged_sha1, sha1)) { |
edbc25c5 | 1901 | warning("Log %s has gap after %s.", |
73013afd | 1902 | logfile, show_date(date, tz, DATE_RFC2822)); |
e5229042 | 1903 | } |
e5f38ec3 JH |
1904 | } |
1905 | else if (date == at_time) { | |
e5229042 SP |
1906 | if (get_sha1_hex(rec + 41, sha1)) |
1907 | die("Log %s is corrupt.", logfile); | |
e5f38ec3 JH |
1908 | } |
1909 | else { | |
e5229042 SP |
1910 | if (get_sha1_hex(rec + 41, logged_sha1)) |
1911 | die("Log %s is corrupt.", logfile); | |
a89fccd2 | 1912 | if (hashcmp(logged_sha1, sha1)) { |
edbc25c5 | 1913 | warning("Log %s unexpectedly ended on %s.", |
73013afd | 1914 | logfile, show_date(date, tz, DATE_RFC2822)); |
e5229042 SP |
1915 | } |
1916 | } | |
dc49cd76 | 1917 | munmap(log_mapped, mapsz); |
d556fae2 SP |
1918 | return 0; |
1919 | } | |
e5229042 | 1920 | lastrec = rec; |
ab2a1a32 JH |
1921 | if (cnt > 0) |
1922 | cnt--; | |
d556fae2 SP |
1923 | } |
1924 | ||
e5229042 SP |
1925 | rec = logdata; |
1926 | while (rec < logend && *rec != '>' && *rec != '\n') | |
1927 | rec++; | |
1928 | if (rec == logend || *rec == '\n') | |
d556fae2 | 1929 | die("Log %s is corrupt.", logfile); |
e5229042 | 1930 | date = strtoul(rec + 1, &tz_c, 10); |
d556fae2 SP |
1931 | tz = strtoul(tz_c, NULL, 10); |
1932 | if (get_sha1_hex(logdata, sha1)) | |
1933 | die("Log %s is corrupt.", logfile); | |
d1a4489a JK |
1934 | if (is_null_sha1(sha1)) { |
1935 | if (get_sha1_hex(logdata + 41, sha1)) | |
1936 | die("Log %s is corrupt.", logfile); | |
1937 | } | |
16d7cc90 JH |
1938 | if (msg) |
1939 | *msg = ref_msg(logdata, logend); | |
dc49cd76 | 1940 | munmap(log_mapped, mapsz); |
16d7cc90 JH |
1941 | |
1942 | if (cutoff_time) | |
1943 | *cutoff_time = date; | |
1944 | if (cutoff_tz) | |
1945 | *cutoff_tz = tz; | |
1946 | if (cutoff_cnt) | |
1947 | *cutoff_cnt = reccnt; | |
1948 | return 1; | |
d556fae2 | 1949 | } |
2ff81662 | 1950 | |
dfefa935 | 1951 | int for_each_recent_reflog_ent(const char *refname, each_reflog_ent_fn fn, long ofs, void *cb_data) |
2ff81662 JH |
1952 | { |
1953 | const char *logfile; | |
1954 | FILE *logfp; | |
8ca78803 | 1955 | struct strbuf sb = STRBUF_INIT; |
2266bf27 | 1956 | int ret = 0; |
2ff81662 | 1957 | |
dfefa935 | 1958 | logfile = git_path("logs/%s", refname); |
2ff81662 JH |
1959 | logfp = fopen(logfile, "r"); |
1960 | if (!logfp) | |
883d60fa | 1961 | return -1; |
101d15e0 JH |
1962 | |
1963 | if (ofs) { | |
1964 | struct stat statbuf; | |
1965 | if (fstat(fileno(logfp), &statbuf) || | |
1966 | statbuf.st_size < ofs || | |
1967 | fseek(logfp, -ofs, SEEK_END) || | |
8ca78803 | 1968 | strbuf_getwholeline(&sb, logfp, '\n')) { |
9d33f7c2 | 1969 | fclose(logfp); |
8ca78803 | 1970 | strbuf_release(&sb); |
101d15e0 | 1971 | return -1; |
9d33f7c2 | 1972 | } |
101d15e0 JH |
1973 | } |
1974 | ||
8ca78803 | 1975 | while (!strbuf_getwholeline(&sb, logfp, '\n')) { |
2ff81662 | 1976 | unsigned char osha1[20], nsha1[20]; |
883d60fa JS |
1977 | char *email_end, *message; |
1978 | unsigned long timestamp; | |
8ca78803 | 1979 | int tz; |
2ff81662 JH |
1980 | |
1981 | /* old SP new SP name <email> SP time TAB msg LF */ | |
8ca78803 RS |
1982 | if (sb.len < 83 || sb.buf[sb.len - 1] != '\n' || |
1983 | get_sha1_hex(sb.buf, osha1) || sb.buf[40] != ' ' || | |
1984 | get_sha1_hex(sb.buf + 41, nsha1) || sb.buf[81] != ' ' || | |
1985 | !(email_end = strchr(sb.buf + 82, '>')) || | |
883d60fa JS |
1986 | email_end[1] != ' ' || |
1987 | !(timestamp = strtoul(email_end + 2, &message, 10)) || | |
1988 | !message || message[0] != ' ' || | |
1989 | (message[1] != '+' && message[1] != '-') || | |
1990 | !isdigit(message[2]) || !isdigit(message[3]) || | |
b4dd4856 | 1991 | !isdigit(message[4]) || !isdigit(message[5])) |
2ff81662 | 1992 | continue; /* corrupt? */ |
883d60fa JS |
1993 | email_end[1] = '\0'; |
1994 | tz = strtol(message + 1, NULL, 10); | |
b4dd4856 JS |
1995 | if (message[6] != '\t') |
1996 | message += 6; | |
1997 | else | |
1998 | message += 7; | |
8ca78803 RS |
1999 | ret = fn(osha1, nsha1, sb.buf + 82, timestamp, tz, message, |
2000 | cb_data); | |
883d60fa | 2001 | if (ret) |
2266bf27 | 2002 | break; |
2ff81662 JH |
2003 | } |
2004 | fclose(logfp); | |
8ca78803 | 2005 | strbuf_release(&sb); |
2266bf27 | 2006 | return ret; |
2ff81662 | 2007 | } |
e29cb53a | 2008 | |
dfefa935 | 2009 | int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data) |
101d15e0 | 2010 | { |
dfefa935 | 2011 | return for_each_recent_reflog_ent(refname, fn, 0, cb_data); |
101d15e0 JH |
2012 | } |
2013 | ||
eb8381c8 NP |
2014 | static int do_for_each_reflog(const char *base, each_ref_fn fn, void *cb_data) |
2015 | { | |
2016 | DIR *dir = opendir(git_path("logs/%s", base)); | |
fcee5a14 | 2017 | int retval = 0; |
eb8381c8 NP |
2018 | |
2019 | if (dir) { | |
2020 | struct dirent *de; | |
2021 | int baselen = strlen(base); | |
2022 | char *log = xmalloc(baselen + 257); | |
2023 | ||
2024 | memcpy(log, base, baselen); | |
2025 | if (baselen && base[baselen-1] != '/') | |
2026 | log[baselen++] = '/'; | |
2027 | ||
2028 | while ((de = readdir(dir)) != NULL) { | |
2029 | struct stat st; | |
2030 | int namelen; | |
2031 | ||
2032 | if (de->d_name[0] == '.') | |
2033 | continue; | |
2034 | namelen = strlen(de->d_name); | |
2035 | if (namelen > 255) | |
2036 | continue; | |
2037 | if (has_extension(de->d_name, ".lock")) | |
2038 | continue; | |
2039 | memcpy(log + baselen, de->d_name, namelen+1); | |
2040 | if (stat(git_path("logs/%s", log), &st) < 0) | |
2041 | continue; | |
2042 | if (S_ISDIR(st.st_mode)) { | |
2043 | retval = do_for_each_reflog(log, fn, cb_data); | |
2044 | } else { | |
2045 | unsigned char sha1[20]; | |
c6893323 | 2046 | if (read_ref_full(log, sha1, 0, NULL)) |
eb8381c8 NP |
2047 | retval = error("bad ref for %s", log); |
2048 | else | |
2049 | retval = fn(log, sha1, 0, cb_data); | |
2050 | } | |
2051 | if (retval) | |
2052 | break; | |
2053 | } | |
2054 | free(log); | |
2055 | closedir(dir); | |
2056 | } | |
acb39f64 | 2057 | else if (*base) |
fcee5a14 | 2058 | return errno; |
eb8381c8 NP |
2059 | return retval; |
2060 | } | |
2061 | ||
2062 | int for_each_reflog(each_ref_fn fn, void *cb_data) | |
2063 | { | |
2064 | return do_for_each_reflog("", fn, cb_data); | |
2065 | } | |
3d9f037c CR |
2066 | |
2067 | int update_ref(const char *action, const char *refname, | |
2068 | const unsigned char *sha1, const unsigned char *oldval, | |
2069 | int flags, enum action_on_err onerr) | |
2070 | { | |
2071 | static struct ref_lock *lock; | |
2072 | lock = lock_any_ref_for_update(refname, oldval, flags); | |
2073 | if (!lock) { | |
2074 | const char *str = "Cannot lock the ref '%s'."; | |
2075 | switch (onerr) { | |
2076 | case MSG_ON_ERR: error(str, refname); break; | |
2077 | case DIE_ON_ERR: die(str, refname); break; | |
2078 | case QUIET_ON_ERR: break; | |
2079 | } | |
2080 | return 1; | |
2081 | } | |
2082 | if (write_ref_sha1(lock, sha1, action) < 0) { | |
2083 | const char *str = "Cannot update the ref '%s'."; | |
2084 | switch (onerr) { | |
2085 | case MSG_ON_ERR: error(str, refname); break; | |
2086 | case DIE_ON_ERR: die(str, refname); break; | |
2087 | case QUIET_ON_ERR: break; | |
2088 | } | |
2089 | return 1; | |
2090 | } | |
2091 | return 0; | |
2092 | } | |
cda69f48 | 2093 | |
5483f799 | 2094 | struct ref *find_ref_by_name(const struct ref *list, const char *name) |
cda69f48 JK |
2095 | { |
2096 | for ( ; list; list = list->next) | |
2097 | if (!strcmp(list->name, name)) | |
5483f799 | 2098 | return (struct ref *)list; |
cda69f48 JK |
2099 | return NULL; |
2100 | } | |
7c2b3029 JK |
2101 | |
2102 | /* | |
2103 | * generate a format suitable for scanf from a ref_rev_parse_rules | |
2104 | * rule, that is replace the "%.*s" spec with a "%s" spec | |
2105 | */ | |
2106 | static void gen_scanf_fmt(char *scanf_fmt, const char *rule) | |
2107 | { | |
2108 | char *spec; | |
2109 | ||
2110 | spec = strstr(rule, "%.*s"); | |
2111 | if (!spec || strstr(spec + 4, "%.*s")) | |
2112 | die("invalid rule in ref_rev_parse_rules: %s", rule); | |
2113 | ||
2114 | /* copy all until spec */ | |
2115 | strncpy(scanf_fmt, rule, spec - rule); | |
2116 | scanf_fmt[spec - rule] = '\0'; | |
2117 | /* copy new spec */ | |
2118 | strcat(scanf_fmt, "%s"); | |
2119 | /* copy remaining rule */ | |
2120 | strcat(scanf_fmt, spec + 4); | |
2121 | ||
2122 | return; | |
2123 | } | |
2124 | ||
dfefa935 | 2125 | char *shorten_unambiguous_ref(const char *refname, int strict) |
7c2b3029 JK |
2126 | { |
2127 | int i; | |
2128 | static char **scanf_fmts; | |
2129 | static int nr_rules; | |
2130 | char *short_name; | |
2131 | ||
2132 | /* pre generate scanf formats from ref_rev_parse_rules[] */ | |
2133 | if (!nr_rules) { | |
2134 | size_t total_len = 0; | |
2135 | ||
2136 | /* the rule list is NULL terminated, count them first */ | |
2137 | for (; ref_rev_parse_rules[nr_rules]; nr_rules++) | |
2138 | /* no +1 because strlen("%s") < strlen("%.*s") */ | |
2139 | total_len += strlen(ref_rev_parse_rules[nr_rules]); | |
2140 | ||
2141 | scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len); | |
2142 | ||
2143 | total_len = 0; | |
2144 | for (i = 0; i < nr_rules; i++) { | |
2145 | scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] | |
2146 | + total_len; | |
2147 | gen_scanf_fmt(scanf_fmts[i], ref_rev_parse_rules[i]); | |
2148 | total_len += strlen(ref_rev_parse_rules[i]); | |
2149 | } | |
2150 | } | |
2151 | ||
2152 | /* bail out if there are no rules */ | |
2153 | if (!nr_rules) | |
dfefa935 | 2154 | return xstrdup(refname); |
7c2b3029 | 2155 | |
dfefa935 MH |
2156 | /* buffer for scanf result, at most refname must fit */ |
2157 | short_name = xstrdup(refname); | |
7c2b3029 JK |
2158 | |
2159 | /* skip first rule, it will always match */ | |
2160 | for (i = nr_rules - 1; i > 0 ; --i) { | |
2161 | int j; | |
6e7b3309 | 2162 | int rules_to_fail = i; |
7c2b3029 JK |
2163 | int short_name_len; |
2164 | ||
dfefa935 | 2165 | if (1 != sscanf(refname, scanf_fmts[i], short_name)) |
7c2b3029 JK |
2166 | continue; |
2167 | ||
2168 | short_name_len = strlen(short_name); | |
2169 | ||
6e7b3309 BW |
2170 | /* |
2171 | * in strict mode, all (except the matched one) rules | |
2172 | * must fail to resolve to a valid non-ambiguous ref | |
2173 | */ | |
2174 | if (strict) | |
2175 | rules_to_fail = nr_rules; | |
2176 | ||
7c2b3029 JK |
2177 | /* |
2178 | * check if the short name resolves to a valid ref, | |
2179 | * but use only rules prior to the matched one | |
2180 | */ | |
6e7b3309 | 2181 | for (j = 0; j < rules_to_fail; j++) { |
7c2b3029 | 2182 | const char *rule = ref_rev_parse_rules[j]; |
7c2b3029 JK |
2183 | char refname[PATH_MAX]; |
2184 | ||
6e7b3309 BW |
2185 | /* skip matched rule */ |
2186 | if (i == j) | |
2187 | continue; | |
2188 | ||
7c2b3029 JK |
2189 | /* |
2190 | * the short name is ambiguous, if it resolves | |
2191 | * (with this previous rule) to a valid ref | |
2192 | * read_ref() returns 0 on success | |
2193 | */ | |
2194 | mksnpath(refname, sizeof(refname), | |
2195 | rule, short_name_len, short_name); | |
c6893323 | 2196 | if (ref_exists(refname)) |
7c2b3029 JK |
2197 | break; |
2198 | } | |
2199 | ||
2200 | /* | |
2201 | * short name is non-ambiguous if all previous rules | |
2202 | * haven't resolved to a valid ref | |
2203 | */ | |
6e7b3309 | 2204 | if (j == rules_to_fail) |
7c2b3029 JK |
2205 | return short_name; |
2206 | } | |
2207 | ||
2208 | free(short_name); | |
dfefa935 | 2209 | return xstrdup(refname); |
7c2b3029 | 2210 | } |