]>
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" |
daebaa78 | 6 | #include "string-list.h" |
95fc7512 | 7 | |
bc5fd6d3 | 8 | /* |
dde8a902 DT |
9 | * How to handle various characters in refnames: |
10 | * 0: An acceptable character for refs | |
5e650228 JH |
11 | * 1: End-of-component |
12 | * 2: ., look for a preceding . to reject .. in refs | |
13 | * 3: {, look for a preceding @ to reject @{ in refs | |
14 | * 4: A bad character: ASCII control characters, "~", "^", ":" or SP | |
dde8a902 DT |
15 | */ |
16 | static unsigned char refname_disposition[256] = { | |
5e650228 JH |
17 | 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, |
18 | 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, | |
19 | 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 1, | |
20 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4, | |
dde8a902 | 21 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
5e650228 JH |
22 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0, |
23 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
24 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4 | |
dde8a902 DT |
25 | }; |
26 | ||
029cdb4a RS |
27 | /* |
28 | * Used as a flag to ref_transaction_delete when a loose ref is being | |
29 | * pruned. | |
30 | */ | |
31 | #define REF_ISPRUNING 0x0100 | |
dde8a902 DT |
32 | /* |
33 | * Try to read one refname component from the front of refname. | |
34 | * Return the length of the component found, or -1 if the component is | |
35 | * not legal. It is legal if it is something reasonable to have under | |
36 | * ".git/refs/"; We do not like it if: | |
bc5fd6d3 MH |
37 | * |
38 | * - any path component of it begins with ".", or | |
39 | * - it has double dots "..", or | |
40 | * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or | |
5e650228 JH |
41 | * - it ends with a "/". |
42 | * - it ends with ".lock" | |
bc5fd6d3 MH |
43 | * - it contains a "\" (backslash) |
44 | */ | |
bc5fd6d3 MH |
45 | static int check_refname_component(const char *refname, int flags) |
46 | { | |
47 | const char *cp; | |
48 | char last = '\0'; | |
49 | ||
50 | for (cp = refname; ; cp++) { | |
dde8a902 DT |
51 | int ch = *cp & 255; |
52 | unsigned char disp = refname_disposition[ch]; | |
53 | switch (disp) { | |
5e650228 | 54 | case 1: |
dde8a902 | 55 | goto out; |
5e650228 | 56 | case 2: |
dde8a902 DT |
57 | if (last == '.') |
58 | return -1; /* Refname contains "..". */ | |
59 | break; | |
5e650228 | 60 | case 3: |
dde8a902 DT |
61 | if (last == '@') |
62 | return -1; /* Refname contains "@{". */ | |
bc5fd6d3 | 63 | break; |
5e650228 | 64 | case 4: |
dde8a902 DT |
65 | return -1; |
66 | } | |
bc5fd6d3 MH |
67 | last = ch; |
68 | } | |
dde8a902 | 69 | out: |
bc5fd6d3 | 70 | if (cp == refname) |
dac529e4 | 71 | return 0; /* Component has zero length. */ |
bc5fd6d3 MH |
72 | if (refname[0] == '.') { |
73 | if (!(flags & REFNAME_DOT_COMPONENT)) | |
74 | return -1; /* Component starts with '.'. */ | |
75 | /* | |
76 | * Even if leading dots are allowed, don't allow "." | |
77 | * as a component (".." is prevented by a rule above). | |
78 | */ | |
79 | if (refname[1] == '\0') | |
80 | return -1; /* Component equals ".". */ | |
81 | } | |
82 | if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5)) | |
83 | return -1; /* Refname ends with ".lock". */ | |
84 | return cp - refname; | |
85 | } | |
86 | ||
5e650228 | 87 | int check_refname_format(const char *refname, int flags) |
bc5fd6d3 MH |
88 | { |
89 | int component_len, component_count = 0; | |
90 | ||
9ba89f48 FC |
91 | if (!strcmp(refname, "@")) |
92 | /* Refname is a single character '@'. */ | |
93 | return -1; | |
94 | ||
bc5fd6d3 MH |
95 | while (1) { |
96 | /* We are at the start of a path component. */ | |
97 | component_len = check_refname_component(refname, flags); | |
dac529e4 | 98 | if (component_len <= 0) { |
bc5fd6d3 MH |
99 | if ((flags & REFNAME_REFSPEC_PATTERN) && |
100 | refname[0] == '*' && | |
101 | (refname[1] == '\0' || refname[1] == '/')) { | |
102 | /* Accept one wildcard as a full refname component. */ | |
103 | flags &= ~REFNAME_REFSPEC_PATTERN; | |
104 | component_len = 1; | |
105 | } else { | |
106 | return -1; | |
107 | } | |
108 | } | |
109 | component_count++; | |
110 | if (refname[component_len] == '\0') | |
111 | break; | |
112 | /* Skip to next component. */ | |
113 | refname += component_len + 1; | |
114 | } | |
115 | ||
116 | if (refname[component_len - 1] == '.') | |
117 | return -1; /* Refname ends with '.'. */ | |
118 | if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2) | |
119 | return -1; /* Refname has only one component. */ | |
120 | return 0; | |
121 | } | |
122 | ||
123 | struct ref_entry; | |
e1e22e37 | 124 | |
28e6a34e MH |
125 | /* |
126 | * Information used (along with the information in ref_entry) to | |
127 | * describe a single cached reference. This data structure only | |
128 | * occurs embedded in a union in struct ref_entry, and only when | |
129 | * (ref_entry->flag & REF_DIR) is zero. | |
130 | */ | |
593f1bb8 | 131 | struct ref_value { |
6c6f58df MH |
132 | /* |
133 | * The name of the object to which this reference resolves | |
134 | * (which may be a tag object). If REF_ISBROKEN, this is | |
135 | * null. If REF_ISSYMREF, then this is the name of the object | |
136 | * referred to by the last reference in the symlink chain. | |
137 | */ | |
593f1bb8 | 138 | unsigned char sha1[20]; |
6c6f58df MH |
139 | |
140 | /* | |
141 | * If REF_KNOWS_PEELED, then this field holds the peeled value | |
142 | * of this reference, or null if the reference is known not to | |
2312a793 MH |
143 | * be peelable. See the documentation for peel_ref() for an |
144 | * exact definition of "peelable". | |
6c6f58df | 145 | */ |
593f1bb8 MH |
146 | unsigned char peeled[20]; |
147 | }; | |
148 | ||
f006c42a MH |
149 | struct ref_cache; |
150 | ||
28e6a34e MH |
151 | /* |
152 | * Information used (along with the information in ref_entry) to | |
153 | * describe a level in the hierarchy of references. This data | |
154 | * structure only occurs embedded in a union in struct ref_entry, and | |
155 | * only when (ref_entry.flag & REF_DIR) is set. In that case, | |
156 | * (ref_entry.flag & REF_INCOMPLETE) determines whether the references | |
157 | * in the directory have already been read: | |
158 | * | |
159 | * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose | |
160 | * or packed references, already read. | |
161 | * | |
162 | * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose | |
163 | * references that hasn't been read yet (nor has any of its | |
164 | * subdirectories). | |
165 | * | |
166 | * Entries within a directory are stored within a growable array of | |
167 | * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < | |
168 | * sorted are sorted by their component name in strcmp() order and the | |
169 | * remaining entries are unsorted. | |
170 | * | |
171 | * Loose references are read lazily, one directory at a time. When a | |
172 | * directory of loose references is read, then all of the references | |
173 | * in that directory are stored, and REF_INCOMPLETE stubs are created | |
174 | * for any subdirectories, but the subdirectories themselves are not | |
175 | * read. The reading is triggered by get_ref_dir(). | |
176 | */ | |
d3177275 | 177 | struct ref_dir { |
e9c4c111 | 178 | int nr, alloc; |
e6ed3ca6 MH |
179 | |
180 | /* | |
181 | * Entries with index 0 <= i < sorted are sorted by name. New | |
182 | * entries are appended to the list unsorted, and are sorted | |
183 | * only when required; thus we avoid the need to sort the list | |
184 | * after the addition of every reference. | |
185 | */ | |
186 | int sorted; | |
187 | ||
f006c42a MH |
188 | /* A pointer to the ref_cache that contains this ref_dir. */ |
189 | struct ref_cache *ref_cache; | |
190 | ||
d3177275 | 191 | struct ref_entry **entries; |
e9c4c111 JP |
192 | }; |
193 | ||
89df9c84 MH |
194 | /* |
195 | * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, | |
196 | * REF_ISPACKED=0x02, and REF_ISBROKEN=0x04 are public values; see | |
197 | * refs.h. | |
198 | */ | |
199 | ||
200 | /* | |
201 | * The field ref_entry->u.value.peeled of this value entry contains | |
202 | * the correct peeled value for the reference, which might be | |
203 | * null_sha1 if the reference is not a tag or if it is broken. | |
204 | */ | |
432ad41e | 205 | #define REF_KNOWS_PEELED 0x08 |
28e6a34e MH |
206 | |
207 | /* ref_entry represents a directory of references */ | |
432ad41e | 208 | #define REF_DIR 0x10 |
cf0adba7 | 209 | |
28e6a34e MH |
210 | /* |
211 | * Entry has not yet been read from disk (used only for REF_DIR | |
212 | * entries representing loose references) | |
213 | */ | |
214 | #define REF_INCOMPLETE 0x20 | |
215 | ||
432ad41e MH |
216 | /* |
217 | * A ref_entry represents either a reference or a "subdirectory" of | |
28e6a34e MH |
218 | * references. |
219 | * | |
220 | * Each directory in the reference namespace is represented by a | |
221 | * ref_entry with (flags & REF_DIR) set and containing a subdir member | |
222 | * that holds the entries in that directory that have been read so | |
223 | * far. If (flags & REF_INCOMPLETE) is set, then the directory and | |
224 | * its subdirectories haven't been read yet. REF_INCOMPLETE is only | |
225 | * used for loose reference directories. | |
226 | * | |
227 | * References are represented by a ref_entry with (flags & REF_DIR) | |
228 | * unset and a value member that describes the reference's value. The | |
229 | * flag member is at the ref_entry level, but it is also needed to | |
230 | * interpret the contents of the value field (in other words, a | |
231 | * ref_value object is not very much use without the enclosing | |
232 | * ref_entry). | |
432ad41e MH |
233 | * |
234 | * Reference names cannot end with slash and directories' names are | |
235 | * always stored with a trailing slash (except for the top-level | |
236 | * directory, which is always denoted by ""). This has two nice | |
237 | * consequences: (1) when the entries in each subdir are sorted | |
238 | * lexicographically by name (as they usually are), the references in | |
239 | * a whole tree can be generated in lexicographic order by traversing | |
240 | * the tree in left-to-right, depth-first order; (2) the names of | |
241 | * references and subdirectories cannot conflict, and therefore the | |
242 | * presence of an empty subdirectory does not block the creation of a | |
243 | * similarly-named reference. (The fact that reference names with the | |
244 | * same leading components can conflict *with each other* is a | |
245 | * separate issue that is regulated by is_refname_available().) | |
246 | * | |
247 | * Please note that the name field contains the fully-qualified | |
248 | * reference (or subdirectory) name. Space could be saved by only | |
249 | * storing the relative names. But that would require the full names | |
250 | * to be generated on the fly when iterating in do_for_each_ref(), and | |
251 | * would break callback functions, who have always been able to assume | |
252 | * that the name strings that they are passed will not be freed during | |
253 | * the iteration. | |
254 | */ | |
bc5fd6d3 MH |
255 | struct ref_entry { |
256 | unsigned char flag; /* ISSYMREF? ISPACKED? */ | |
593f1bb8 | 257 | union { |
432ad41e MH |
258 | struct ref_value value; /* if not (flags&REF_DIR) */ |
259 | struct ref_dir subdir; /* if (flags&REF_DIR) */ | |
593f1bb8 | 260 | } u; |
432ad41e MH |
261 | /* |
262 | * The full name of the reference (e.g., "refs/heads/master") | |
263 | * or the full name of the directory with a trailing slash | |
264 | * (e.g., "refs/heads/"): | |
265 | */ | |
bc5fd6d3 MH |
266 | char name[FLEX_ARRAY]; |
267 | }; | |
e1e22e37 | 268 | |
28e6a34e MH |
269 | static void read_loose_refs(const char *dirname, struct ref_dir *dir); |
270 | ||
d7826d54 MH |
271 | static struct ref_dir *get_ref_dir(struct ref_entry *entry) |
272 | { | |
28e6a34e | 273 | struct ref_dir *dir; |
d7826d54 | 274 | assert(entry->flag & REF_DIR); |
28e6a34e MH |
275 | dir = &entry->u.subdir; |
276 | if (entry->flag & REF_INCOMPLETE) { | |
277 | read_loose_refs(entry->name, dir); | |
278 | entry->flag &= ~REF_INCOMPLETE; | |
279 | } | |
280 | return dir; | |
d7826d54 MH |
281 | } |
282 | ||
cddc4258 MH |
283 | static struct ref_entry *create_ref_entry(const char *refname, |
284 | const unsigned char *sha1, int flag, | |
285 | int check_name) | |
e1e22e37 LT |
286 | { |
287 | int len; | |
cddc4258 | 288 | struct ref_entry *ref; |
e1e22e37 | 289 | |
09116a1c | 290 | if (check_name && |
dfefa935 MH |
291 | check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT)) |
292 | die("Reference has invalid format: '%s'", refname); | |
cddc4258 MH |
293 | len = strlen(refname) + 1; |
294 | ref = xmalloc(sizeof(struct ref_entry) + len); | |
593f1bb8 MH |
295 | hashcpy(ref->u.value.sha1, sha1); |
296 | hashclr(ref->u.value.peeled); | |
cddc4258 MH |
297 | memcpy(ref->name, refname, len); |
298 | ref->flag = flag; | |
299 | return ref; | |
300 | } | |
301 | ||
432ad41e MH |
302 | static void clear_ref_dir(struct ref_dir *dir); |
303 | ||
732134ed MH |
304 | static void free_ref_entry(struct ref_entry *entry) |
305 | { | |
27b5587c MH |
306 | if (entry->flag & REF_DIR) { |
307 | /* | |
308 | * Do not use get_ref_dir() here, as that might | |
309 | * trigger the reading of loose refs. | |
310 | */ | |
311 | clear_ref_dir(&entry->u.subdir); | |
312 | } | |
732134ed MH |
313 | free(entry); |
314 | } | |
315 | ||
432ad41e MH |
316 | /* |
317 | * Add a ref_entry to the end of dir (unsorted). Entry is always | |
318 | * stored directly in dir; no recursion into subdirectories is | |
319 | * done. | |
320 | */ | |
321 | static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry) | |
cddc4258 | 322 | { |
432ad41e MH |
323 | ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc); |
324 | dir->entries[dir->nr++] = entry; | |
654ad400 MH |
325 | /* optimize for the case that entries are added in order */ |
326 | if (dir->nr == 1 || | |
327 | (dir->nr == dir->sorted + 1 && | |
328 | strcmp(dir->entries[dir->nr - 2]->name, | |
329 | dir->entries[dir->nr - 1]->name) < 0)) | |
330 | dir->sorted = dir->nr; | |
c774aab9 JP |
331 | } |
332 | ||
432ad41e MH |
333 | /* |
334 | * Clear and free all entries in dir, recursively. | |
335 | */ | |
d3177275 | 336 | static void clear_ref_dir(struct ref_dir *dir) |
bc5fd6d3 MH |
337 | { |
338 | int i; | |
d3177275 MH |
339 | for (i = 0; i < dir->nr; i++) |
340 | free_ref_entry(dir->entries[i]); | |
341 | free(dir->entries); | |
342 | dir->sorted = dir->nr = dir->alloc = 0; | |
343 | dir->entries = NULL; | |
bc5fd6d3 MH |
344 | } |
345 | ||
432ad41e MH |
346 | /* |
347 | * Create a struct ref_entry object for the specified dirname. | |
348 | * dirname is the name of the directory with a trailing slash (e.g., | |
349 | * "refs/heads/") or "" for the top-level directory. | |
350 | */ | |
f006c42a | 351 | static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, |
b9146f51 RS |
352 | const char *dirname, size_t len, |
353 | int incomplete) | |
432ad41e MH |
354 | { |
355 | struct ref_entry *direntry; | |
432ad41e | 356 | direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1); |
b9146f51 RS |
357 | memcpy(direntry->name, dirname, len); |
358 | direntry->name[len] = '\0'; | |
f006c42a | 359 | direntry->u.subdir.ref_cache = ref_cache; |
28e6a34e | 360 | direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0); |
432ad41e MH |
361 | return direntry; |
362 | } | |
363 | ||
e9c4c111 | 364 | static int ref_entry_cmp(const void *a, const void *b) |
c774aab9 | 365 | { |
e9c4c111 JP |
366 | struct ref_entry *one = *(struct ref_entry **)a; |
367 | struct ref_entry *two = *(struct ref_entry **)b; | |
368 | return strcmp(one->name, two->name); | |
369 | } | |
c774aab9 | 370 | |
d3177275 | 371 | static void sort_ref_dir(struct ref_dir *dir); |
bc5fd6d3 | 372 | |
e1980c9d JH |
373 | struct string_slice { |
374 | size_t len; | |
375 | const char *str; | |
376 | }; | |
377 | ||
378 | static int ref_entry_cmp_sslice(const void *key_, const void *ent_) | |
379 | { | |
c971ddfd RS |
380 | const struct string_slice *key = key_; |
381 | const struct ref_entry *ent = *(const struct ref_entry * const *)ent_; | |
382 | int cmp = strncmp(key->str, ent->name, key->len); | |
e1980c9d JH |
383 | if (cmp) |
384 | return cmp; | |
c971ddfd | 385 | return '\0' - (unsigned char)ent->name[key->len]; |
e1980c9d JH |
386 | } |
387 | ||
432ad41e | 388 | /* |
9fc0a648 MH |
389 | * Return the index of the entry with the given refname from the |
390 | * ref_dir (non-recursively), sorting dir if necessary. Return -1 if | |
391 | * no such entry is found. dir must already be complete. | |
432ad41e | 392 | */ |
9fc0a648 | 393 | static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len) |
bc5fd6d3 | 394 | { |
e1980c9d JH |
395 | struct ref_entry **r; |
396 | struct string_slice key; | |
bc5fd6d3 | 397 | |
432ad41e | 398 | if (refname == NULL || !dir->nr) |
9fc0a648 | 399 | return -1; |
bc5fd6d3 | 400 | |
d3177275 | 401 | sort_ref_dir(dir); |
e1980c9d JH |
402 | key.len = len; |
403 | key.str = refname; | |
404 | r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries), | |
405 | ref_entry_cmp_sslice); | |
bc5fd6d3 MH |
406 | |
407 | if (r == NULL) | |
9fc0a648 | 408 | return -1; |
bc5fd6d3 | 409 | |
9fc0a648 | 410 | return r - dir->entries; |
bc5fd6d3 MH |
411 | } |
412 | ||
f348ac92 MH |
413 | /* |
414 | * Search for a directory entry directly within dir (without | |
415 | * recursing). Sort dir if necessary. subdirname must be a directory | |
416 | * name (i.e., end in '/'). If mkdir is set, then create the | |
417 | * directory if it is missing; otherwise, return NULL if the desired | |
28e6a34e | 418 | * directory cannot be found. dir must already be complete. |
f348ac92 | 419 | */ |
3f3aa1bc | 420 | static struct ref_dir *search_for_subdir(struct ref_dir *dir, |
dd02e728 RS |
421 | const char *subdirname, size_t len, |
422 | int mkdir) | |
f348ac92 | 423 | { |
9fc0a648 MH |
424 | int entry_index = search_ref_dir(dir, subdirname, len); |
425 | struct ref_entry *entry; | |
426 | if (entry_index == -1) { | |
f348ac92 MH |
427 | if (!mkdir) |
428 | return NULL; | |
28e6a34e MH |
429 | /* |
430 | * Since dir is complete, the absence of a subdir | |
431 | * means that the subdir really doesn't exist; | |
432 | * therefore, create an empty record for it but mark | |
433 | * the record complete. | |
434 | */ | |
b9146f51 | 435 | entry = create_dir_entry(dir->ref_cache, subdirname, len, 0); |
f348ac92 | 436 | add_entry_to_dir(dir, entry); |
9fc0a648 MH |
437 | } else { |
438 | entry = dir->entries[entry_index]; | |
f348ac92 | 439 | } |
3f3aa1bc | 440 | return get_ref_dir(entry); |
f348ac92 MH |
441 | } |
442 | ||
432ad41e MH |
443 | /* |
444 | * If refname is a reference name, find the ref_dir within the dir | |
445 | * tree that should hold refname. If refname is a directory name | |
446 | * (i.e., ends in '/'), then return that ref_dir itself. dir must | |
28e6a34e MH |
447 | * represent the top-level directory and must already be complete. |
448 | * Sort ref_dirs and recurse into subdirectories as necessary. If | |
449 | * mkdir is set, then create any missing directories; otherwise, | |
450 | * return NULL if the desired directory cannot be found. | |
432ad41e MH |
451 | */ |
452 | static struct ref_dir *find_containing_dir(struct ref_dir *dir, | |
453 | const char *refname, int mkdir) | |
454 | { | |
5fa04418 | 455 | const char *slash; |
5fa04418 | 456 | for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { |
dd02e728 | 457 | size_t dirnamelen = slash - refname + 1; |
3f3aa1bc | 458 | struct ref_dir *subdir; |
dd02e728 | 459 | subdir = search_for_subdir(dir, refname, dirnamelen, mkdir); |
663c1295 JH |
460 | if (!subdir) { |
461 | dir = NULL; | |
f348ac92 | 462 | break; |
432ad41e | 463 | } |
3f3aa1bc | 464 | dir = subdir; |
432ad41e MH |
465 | } |
466 | ||
432ad41e MH |
467 | return dir; |
468 | } | |
469 | ||
470 | /* | |
471 | * Find the value entry with the given name in dir, sorting ref_dirs | |
472 | * and recursing into subdirectories as necessary. If the name is not | |
473 | * found or it corresponds to a directory entry, return NULL. | |
474 | */ | |
475 | static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname) | |
476 | { | |
9fc0a648 | 477 | int entry_index; |
432ad41e MH |
478 | struct ref_entry *entry; |
479 | dir = find_containing_dir(dir, refname, 0); | |
480 | if (!dir) | |
481 | return NULL; | |
9fc0a648 MH |
482 | entry_index = search_ref_dir(dir, refname, strlen(refname)); |
483 | if (entry_index == -1) | |
484 | return NULL; | |
485 | entry = dir->entries[entry_index]; | |
486 | return (entry->flag & REF_DIR) ? NULL : entry; | |
432ad41e MH |
487 | } |
488 | ||
506a760d MH |
489 | /* |
490 | * Remove the entry with the given name from dir, recursing into | |
491 | * subdirectories as necessary. If refname is the name of a directory | |
492 | * (i.e., ends with '/'), then remove the directory and its contents. | |
493 | * If the removal was successful, return the number of entries | |
494 | * remaining in the directory entry that contained the deleted entry. | |
495 | * If the name was not found, return -1. Please note that this | |
496 | * function only deletes the entry from the cache; it does not delete | |
497 | * it from the filesystem or ensure that other cache entries (which | |
498 | * might be symbolic references to the removed entry) are updated. | |
499 | * Nor does it remove any containing dir entries that might be made | |
500 | * empty by the removal. dir must represent the top-level directory | |
501 | * and must already be complete. | |
502 | */ | |
503 | static int remove_entry(struct ref_dir *dir, const char *refname) | |
504 | { | |
505 | int refname_len = strlen(refname); | |
506 | int entry_index; | |
507 | struct ref_entry *entry; | |
508 | int is_dir = refname[refname_len - 1] == '/'; | |
509 | if (is_dir) { | |
510 | /* | |
511 | * refname represents a reference directory. Remove | |
512 | * the trailing slash; otherwise we will get the | |
513 | * directory *representing* refname rather than the | |
514 | * one *containing* it. | |
515 | */ | |
516 | char *dirname = xmemdupz(refname, refname_len - 1); | |
517 | dir = find_containing_dir(dir, dirname, 0); | |
518 | free(dirname); | |
519 | } else { | |
520 | dir = find_containing_dir(dir, refname, 0); | |
521 | } | |
522 | if (!dir) | |
523 | return -1; | |
524 | entry_index = search_ref_dir(dir, refname, refname_len); | |
525 | if (entry_index == -1) | |
526 | return -1; | |
527 | entry = dir->entries[entry_index]; | |
528 | ||
529 | memmove(&dir->entries[entry_index], | |
530 | &dir->entries[entry_index + 1], | |
531 | (dir->nr - entry_index - 1) * sizeof(*dir->entries) | |
532 | ); | |
533 | dir->nr--; | |
534 | if (dir->sorted > entry_index) | |
535 | dir->sorted--; | |
536 | free_ref_entry(entry); | |
537 | return dir->nr; | |
432ad41e MH |
538 | } |
539 | ||
540 | /* | |
541 | * Add a ref_entry to the ref_dir (unsorted), recursing into | |
542 | * subdirectories as necessary. dir must represent the top-level | |
543 | * directory. Return 0 on success. | |
544 | */ | |
545 | static int add_ref(struct ref_dir *dir, struct ref_entry *ref) | |
546 | { | |
547 | dir = find_containing_dir(dir, ref->name, 1); | |
548 | if (!dir) | |
549 | return -1; | |
550 | add_entry_to_dir(dir, ref); | |
551 | return 0; | |
552 | } | |
553 | ||
202a56a9 MH |
554 | /* |
555 | * Emit a warning and return true iff ref1 and ref2 have the same name | |
556 | * and the same sha1. Die if they have the same name but different | |
557 | * sha1s. | |
558 | */ | |
559 | static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) | |
560 | { | |
432ad41e | 561 | if (strcmp(ref1->name, ref2->name)) |
202a56a9 | 562 | return 0; |
432ad41e MH |
563 | |
564 | /* Duplicate name; make sure that they don't conflict: */ | |
565 | ||
566 | if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) | |
567 | /* This is impossible by construction */ | |
568 | die("Reference directory conflict: %s", ref1->name); | |
569 | ||
570 | if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1)) | |
571 | die("Duplicated ref, and SHA1s don't match: %s", ref1->name); | |
572 | ||
573 | warning("Duplicated ref: %s", ref1->name); | |
574 | return 1; | |
202a56a9 MH |
575 | } |
576 | ||
e6ed3ca6 | 577 | /* |
432ad41e MH |
578 | * Sort the entries in dir non-recursively (if they are not already |
579 | * sorted) and remove any duplicate entries. | |
e6ed3ca6 | 580 | */ |
d3177275 | 581 | static void sort_ref_dir(struct ref_dir *dir) |
e9c4c111 | 582 | { |
202a56a9 | 583 | int i, j; |
81a79d8e | 584 | struct ref_entry *last = NULL; |
c774aab9 | 585 | |
e6ed3ca6 MH |
586 | /* |
587 | * This check also prevents passing a zero-length array to qsort(), | |
588 | * which is a problem on some platforms. | |
589 | */ | |
d3177275 | 590 | if (dir->sorted == dir->nr) |
e9c4c111 | 591 | return; |
c774aab9 | 592 | |
d3177275 | 593 | qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); |
c774aab9 | 594 | |
81a79d8e MH |
595 | /* Remove any duplicates: */ |
596 | for (i = 0, j = 0; j < dir->nr; j++) { | |
597 | struct ref_entry *entry = dir->entries[j]; | |
598 | if (last && is_dup_ref(last, entry)) | |
599 | free_ref_entry(entry); | |
600 | else | |
601 | last = dir->entries[i++] = entry; | |
e9c4c111 | 602 | } |
81a79d8e | 603 | dir->sorted = dir->nr = i; |
e9c4c111 | 604 | } |
c774aab9 | 605 | |
fcce1703 MH |
606 | /* Include broken references in a do_for_each_ref*() iteration: */ |
607 | #define DO_FOR_EACH_INCLUDE_BROKEN 0x01 | |
c774aab9 | 608 | |
662428f4 MH |
609 | /* |
610 | * Return true iff the reference described by entry can be resolved to | |
611 | * an object in the database. Emit a warning if the referred-to | |
612 | * object does not exist. | |
613 | */ | |
614 | static int ref_resolves_to_object(struct ref_entry *entry) | |
615 | { | |
616 | if (entry->flag & REF_ISBROKEN) | |
617 | return 0; | |
618 | if (!has_sha1_file(entry->u.value.sha1)) { | |
619 | error("%s does not point to a valid object!", entry->name); | |
620 | return 0; | |
621 | } | |
622 | return 1; | |
623 | } | |
c774aab9 | 624 | |
7d76fdc8 MH |
625 | /* |
626 | * current_ref is a performance hack: when iterating over references | |
627 | * using the for_each_ref*() functions, current_ref is set to the | |
628 | * current reference's entry before calling the callback function. If | |
629 | * the callback function calls peel_ref(), then peel_ref() first | |
630 | * checks whether the reference to be peeled is the current reference | |
631 | * (it usually is) and if so, returns that reference's peeled version | |
632 | * if it is available. This avoids a refname lookup in a common case. | |
633 | */ | |
bc5fd6d3 | 634 | static struct ref_entry *current_ref; |
c774aab9 | 635 | |
624cac35 MH |
636 | typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data); |
637 | ||
638 | struct ref_entry_cb { | |
639 | const char *base; | |
640 | int trim; | |
641 | int flags; | |
642 | each_ref_fn *fn; | |
643 | void *cb_data; | |
644 | }; | |
645 | ||
fcce1703 | 646 | /* |
624cac35 MH |
647 | * Handle one reference in a do_for_each_ref*()-style iteration, |
648 | * calling an each_ref_fn for each entry. | |
fcce1703 | 649 | */ |
624cac35 | 650 | static int do_one_ref(struct ref_entry *entry, void *cb_data) |
bc5fd6d3 | 651 | { |
624cac35 | 652 | struct ref_entry_cb *data = cb_data; |
d0cf51e9 | 653 | struct ref_entry *old_current_ref; |
429213e4 | 654 | int retval; |
d0cf51e9 | 655 | |
59556548 | 656 | if (!starts_with(entry->name, data->base)) |
bc5fd6d3 | 657 | return 0; |
c774aab9 | 658 | |
624cac35 | 659 | if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && |
662428f4 | 660 | !ref_resolves_to_object(entry)) |
bc5fd6d3 | 661 | return 0; |
c774aab9 | 662 | |
d0cf51e9 MH |
663 | /* Store the old value, in case this is a recursive call: */ |
664 | old_current_ref = current_ref; | |
bc5fd6d3 | 665 | current_ref = entry; |
624cac35 MH |
666 | retval = data->fn(entry->name + data->trim, entry->u.value.sha1, |
667 | entry->flag, data->cb_data); | |
d0cf51e9 | 668 | current_ref = old_current_ref; |
429213e4 | 669 | return retval; |
bc5fd6d3 | 670 | } |
c774aab9 | 671 | |
c36b5bc2 | 672 | /* |
d3177275 | 673 | * Call fn for each reference in dir that has index in the range |
432ad41e MH |
674 | * offset <= index < dir->nr. Recurse into subdirectories that are in |
675 | * that index range, sorting them before iterating. This function | |
624cac35 MH |
676 | * does not sort dir itself; it should be sorted beforehand. fn is |
677 | * called for all references, including broken ones. | |
c36b5bc2 | 678 | */ |
624cac35 MH |
679 | static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset, |
680 | each_ref_entry_fn fn, void *cb_data) | |
c36b5bc2 MH |
681 | { |
682 | int i; | |
d3177275 MH |
683 | assert(dir->sorted == dir->nr); |
684 | for (i = offset; i < dir->nr; i++) { | |
432ad41e MH |
685 | struct ref_entry *entry = dir->entries[i]; |
686 | int retval; | |
687 | if (entry->flag & REF_DIR) { | |
d7826d54 MH |
688 | struct ref_dir *subdir = get_ref_dir(entry); |
689 | sort_ref_dir(subdir); | |
624cac35 | 690 | retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data); |
432ad41e | 691 | } else { |
624cac35 | 692 | retval = fn(entry, cb_data); |
432ad41e | 693 | } |
c36b5bc2 MH |
694 | if (retval) |
695 | return retval; | |
696 | } | |
697 | return 0; | |
698 | } | |
699 | ||
b3fd060f | 700 | /* |
d3177275 | 701 | * Call fn for each reference in the union of dir1 and dir2, in order |
432ad41e MH |
702 | * by refname. Recurse into subdirectories. If a value entry appears |
703 | * in both dir1 and dir2, then only process the version that is in | |
704 | * dir2. The input dirs must already be sorted, but subdirs will be | |
624cac35 MH |
705 | * sorted as needed. fn is called for all references, including |
706 | * broken ones. | |
b3fd060f | 707 | */ |
624cac35 MH |
708 | static int do_for_each_entry_in_dirs(struct ref_dir *dir1, |
709 | struct ref_dir *dir2, | |
710 | each_ref_entry_fn fn, void *cb_data) | |
b3fd060f MH |
711 | { |
712 | int retval; | |
713 | int i1 = 0, i2 = 0; | |
714 | ||
d3177275 MH |
715 | assert(dir1->sorted == dir1->nr); |
716 | assert(dir2->sorted == dir2->nr); | |
432ad41e MH |
717 | while (1) { |
718 | struct ref_entry *e1, *e2; | |
719 | int cmp; | |
720 | if (i1 == dir1->nr) { | |
624cac35 | 721 | return do_for_each_entry_in_dir(dir2, i2, fn, cb_data); |
432ad41e MH |
722 | } |
723 | if (i2 == dir2->nr) { | |
624cac35 | 724 | return do_for_each_entry_in_dir(dir1, i1, fn, cb_data); |
432ad41e MH |
725 | } |
726 | e1 = dir1->entries[i1]; | |
727 | e2 = dir2->entries[i2]; | |
728 | cmp = strcmp(e1->name, e2->name); | |
729 | if (cmp == 0) { | |
730 | if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { | |
731 | /* Both are directories; descend them in parallel. */ | |
d7826d54 MH |
732 | struct ref_dir *subdir1 = get_ref_dir(e1); |
733 | struct ref_dir *subdir2 = get_ref_dir(e2); | |
734 | sort_ref_dir(subdir1); | |
735 | sort_ref_dir(subdir2); | |
624cac35 MH |
736 | retval = do_for_each_entry_in_dirs( |
737 | subdir1, subdir2, fn, cb_data); | |
432ad41e MH |
738 | i1++; |
739 | i2++; | |
740 | } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { | |
741 | /* Both are references; ignore the one from dir1. */ | |
624cac35 | 742 | retval = fn(e2, cb_data); |
432ad41e MH |
743 | i1++; |
744 | i2++; | |
745 | } else { | |
746 | die("conflict between reference and directory: %s", | |
747 | e1->name); | |
748 | } | |
b3fd060f | 749 | } else { |
432ad41e MH |
750 | struct ref_entry *e; |
751 | if (cmp < 0) { | |
752 | e = e1; | |
b3fd060f | 753 | i1++; |
432ad41e MH |
754 | } else { |
755 | e = e2; | |
756 | i2++; | |
757 | } | |
758 | if (e->flag & REF_DIR) { | |
d7826d54 MH |
759 | struct ref_dir *subdir = get_ref_dir(e); |
760 | sort_ref_dir(subdir); | |
624cac35 MH |
761 | retval = do_for_each_entry_in_dir( |
762 | subdir, 0, fn, cb_data); | |
432ad41e | 763 | } else { |
624cac35 | 764 | retval = fn(e, cb_data); |
b3fd060f MH |
765 | } |
766 | } | |
767 | if (retval) | |
768 | return retval; | |
769 | } | |
b3fd060f MH |
770 | } |
771 | ||
98eeb09e JK |
772 | /* |
773 | * Load all of the refs from the dir into our in-memory cache. The hard work | |
774 | * of loading loose refs is done by get_ref_dir(), so we just need to recurse | |
775 | * through all of the sub-directories. We do not even need to care about | |
776 | * sorting, as traversal order does not matter to us. | |
777 | */ | |
778 | static void prime_ref_dir(struct ref_dir *dir) | |
779 | { | |
780 | int i; | |
781 | for (i = 0; i < dir->nr; i++) { | |
782 | struct ref_entry *entry = dir->entries[i]; | |
783 | if (entry->flag & REF_DIR) | |
784 | prime_ref_dir(get_ref_dir(entry)); | |
785 | } | |
786 | } | |
d66da478 MH |
787 | /* |
788 | * Return true iff refname1 and refname2 conflict with each other. | |
789 | * Two reference names conflict if one of them exactly matches the | |
790 | * leading components of the other; e.g., "foo/bar" conflicts with | |
791 | * both "foo" and with "foo/bar/baz" but not with "foo/bar" or | |
792 | * "foo/barbados". | |
793 | */ | |
794 | static int names_conflict(const char *refname1, const char *refname2) | |
795 | { | |
5a4d4947 MH |
796 | for (; *refname1 && *refname1 == *refname2; refname1++, refname2++) |
797 | ; | |
798 | return (*refname1 == '\0' && *refname2 == '/') | |
799 | || (*refname1 == '/' && *refname2 == '\0'); | |
800 | } | |
801 | ||
802 | struct name_conflict_cb { | |
803 | const char *refname; | |
804 | const char *oldrefname; | |
805 | const char *conflicting_refname; | |
806 | }; | |
807 | ||
624cac35 | 808 | static int name_conflict_fn(struct ref_entry *entry, void *cb_data) |
5a4d4947 MH |
809 | { |
810 | struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data; | |
624cac35 | 811 | if (data->oldrefname && !strcmp(data->oldrefname, entry->name)) |
5a4d4947 | 812 | return 0; |
624cac35 MH |
813 | if (names_conflict(data->refname, entry->name)) { |
814 | data->conflicting_refname = entry->name; | |
5a4d4947 | 815 | return 1; |
d66da478 | 816 | } |
5a4d4947 | 817 | return 0; |
d66da478 MH |
818 | } |
819 | ||
bc5fd6d3 MH |
820 | /* |
821 | * Return true iff a reference named refname could be created without | |
624cac35 | 822 | * conflicting with the name of an existing reference in dir. If |
5a4d4947 MH |
823 | * oldrefname is non-NULL, ignore potential conflicts with oldrefname |
824 | * (e.g., because oldrefname is scheduled for deletion in the same | |
bc5fd6d3 MH |
825 | * operation). |
826 | */ | |
827 | static int is_refname_available(const char *refname, const char *oldrefname, | |
d3177275 | 828 | struct ref_dir *dir) |
bc5fd6d3 | 829 | { |
5a4d4947 MH |
830 | struct name_conflict_cb data; |
831 | data.refname = refname; | |
832 | data.oldrefname = oldrefname; | |
833 | data.conflicting_refname = NULL; | |
834 | ||
d3177275 | 835 | sort_ref_dir(dir); |
624cac35 | 836 | if (do_for_each_entry_in_dir(dir, 0, name_conflict_fn, &data)) { |
5a4d4947 MH |
837 | error("'%s' exists; cannot create '%s'", |
838 | data.conflicting_refname, refname); | |
839 | return 0; | |
bc5fd6d3 MH |
840 | } |
841 | return 1; | |
e1e22e37 LT |
842 | } |
843 | ||
2fff7812 MH |
844 | struct packed_ref_cache { |
845 | struct ref_entry *root; | |
9f69d297 | 846 | |
5f5e2a88 MH |
847 | /* |
848 | * Count of references to the data structure in this instance, | |
849 | * including the pointer from ref_cache::packed if any. The | |
850 | * data will not be freed as long as the reference count is | |
851 | * nonzero. | |
852 | */ | |
853 | unsigned int referrers; | |
854 | ||
9f69d297 MH |
855 | /* |
856 | * Iff the packed-refs file associated with this instance is | |
857 | * currently locked for writing, this points at the associated | |
4f6b83e3 MH |
858 | * lock (which is owned by somebody else). The referrer count |
859 | * is also incremented when the file is locked and decremented | |
860 | * when it is unlocked. | |
9f69d297 MH |
861 | */ |
862 | struct lock_file *lock; | |
ca919930 JK |
863 | |
864 | /* The metadata from when this packed-refs cache was read */ | |
865 | struct stat_validity validity; | |
2fff7812 MH |
866 | }; |
867 | ||
5e290ff7 JH |
868 | /* |
869 | * Future: need to be in "struct repository" | |
870 | * when doing a full libification. | |
871 | */ | |
79c7ca54 MH |
872 | static struct ref_cache { |
873 | struct ref_cache *next; | |
d12229f5 | 874 | struct ref_entry *loose; |
2fff7812 | 875 | struct packed_ref_cache *packed; |
9da31cb0 MH |
876 | /* |
877 | * The submodule name, or "" for the main repo. We allocate | |
878 | * length 1 rather than FLEX_ARRAY so that the main ref_cache | |
879 | * is initialized correctly. | |
880 | */ | |
881 | char name[1]; | |
882 | } ref_cache, *submodule_ref_caches; | |
0e88c130 | 883 | |
9f69d297 MH |
884 | /* Lock used for the main packed-refs file: */ |
885 | static struct lock_file packlock; | |
886 | ||
5f5e2a88 MH |
887 | /* |
888 | * Increment the reference count of *packed_refs. | |
889 | */ | |
890 | static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs) | |
891 | { | |
892 | packed_refs->referrers++; | |
893 | } | |
894 | ||
895 | /* | |
896 | * Decrease the reference count of *packed_refs. If it goes to zero, | |
897 | * free *packed_refs and return true; otherwise return false. | |
898 | */ | |
899 | static int release_packed_ref_cache(struct packed_ref_cache *packed_refs) | |
900 | { | |
901 | if (!--packed_refs->referrers) { | |
902 | free_ref_entry(packed_refs->root); | |
ca919930 | 903 | stat_validity_clear(&packed_refs->validity); |
5f5e2a88 MH |
904 | free(packed_refs); |
905 | return 1; | |
906 | } else { | |
907 | return 0; | |
908 | } | |
909 | } | |
910 | ||
760c4512 | 911 | static void clear_packed_ref_cache(struct ref_cache *refs) |
e1e22e37 | 912 | { |
d12229f5 | 913 | if (refs->packed) { |
5f5e2a88 MH |
914 | struct packed_ref_cache *packed_refs = refs->packed; |
915 | ||
916 | if (packed_refs->lock) | |
9f69d297 | 917 | die("internal error: packed-ref cache cleared while locked"); |
d12229f5 | 918 | refs->packed = NULL; |
5f5e2a88 | 919 | release_packed_ref_cache(packed_refs); |
d12229f5 | 920 | } |
5e290ff7 | 921 | } |
e1e22e37 | 922 | |
760c4512 MH |
923 | static void clear_loose_ref_cache(struct ref_cache *refs) |
924 | { | |
d12229f5 MH |
925 | if (refs->loose) { |
926 | free_ref_entry(refs->loose); | |
927 | refs->loose = NULL; | |
928 | } | |
760c4512 MH |
929 | } |
930 | ||
79c7ca54 | 931 | static struct ref_cache *create_ref_cache(const char *submodule) |
e5dbf605 | 932 | { |
ce40979c | 933 | int len; |
79c7ca54 | 934 | struct ref_cache *refs; |
ce40979c MH |
935 | if (!submodule) |
936 | submodule = ""; | |
937 | len = strlen(submodule) + 1; | |
79c7ca54 | 938 | refs = xcalloc(1, sizeof(struct ref_cache) + len); |
ce40979c | 939 | memcpy(refs->name, submodule, len); |
e5dbf605 MH |
940 | return refs; |
941 | } | |
942 | ||
4349a668 | 943 | /* |
79c7ca54 | 944 | * Return a pointer to a ref_cache for the specified submodule. For |
4349a668 MH |
945 | * the main repository, use submodule==NULL. The returned structure |
946 | * will be allocated and initialized but not necessarily populated; it | |
947 | * should not be freed. | |
948 | */ | |
79c7ca54 | 949 | static struct ref_cache *get_ref_cache(const char *submodule) |
4349a668 | 950 | { |
9da31cb0 MH |
951 | struct ref_cache *refs; |
952 | ||
953 | if (!submodule || !*submodule) | |
954 | return &ref_cache; | |
955 | ||
956 | for (refs = submodule_ref_caches; refs; refs = refs->next) | |
0e88c130 MH |
957 | if (!strcmp(submodule, refs->name)) |
958 | return refs; | |
0e88c130 | 959 | |
79c7ca54 | 960 | refs = create_ref_cache(submodule); |
9da31cb0 MH |
961 | refs->next = submodule_ref_caches; |
962 | submodule_ref_caches = refs; | |
0e88c130 | 963 | return refs; |
4349a668 MH |
964 | } |
965 | ||
3feb4f0c MH |
966 | /* The length of a peeled reference line in packed-refs, including EOL: */ |
967 | #define PEELED_LINE_LENGTH 42 | |
968 | ||
694b7a19 MH |
969 | /* |
970 | * The packed-refs header line that we write out. Perhaps other | |
971 | * traits will be added later. The trailing space is required. | |
972 | */ | |
973 | static const char PACKED_REFS_HEADER[] = | |
974 | "# pack-refs with: peeled fully-peeled \n"; | |
975 | ||
bc5fd6d3 MH |
976 | /* |
977 | * Parse one line from a packed-refs file. Write the SHA1 to sha1. | |
978 | * Return a pointer to the refname within the line (null-terminated), | |
979 | * or NULL if there was a problem. | |
980 | */ | |
981 | static const char *parse_ref_line(char *line, unsigned char *sha1) | |
982 | { | |
983 | /* | |
984 | * 42: the answer to everything. | |
985 | * | |
986 | * In this case, it happens to be the answer to | |
987 | * 40 (length of sha1 hex representation) | |
988 | * +1 (space in between hex and name) | |
989 | * +1 (newline at the end of the line) | |
990 | */ | |
991 | int len = strlen(line) - 42; | |
992 | ||
993 | if (len <= 0) | |
994 | return NULL; | |
995 | if (get_sha1_hex(line, sha1) < 0) | |
996 | return NULL; | |
997 | if (!isspace(line[40])) | |
998 | return NULL; | |
999 | line += 41; | |
1000 | if (isspace(*line)) | |
1001 | return NULL; | |
1002 | if (line[len] != '\n') | |
1003 | return NULL; | |
1004 | line[len] = 0; | |
1005 | ||
1006 | return line; | |
1007 | } | |
1008 | ||
c29c46fa MH |
1009 | /* |
1010 | * Read f, which is a packed-refs file, into dir. | |
1011 | * | |
1012 | * A comment line of the form "# pack-refs with: " may contain zero or | |
1013 | * more traits. We interpret the traits as follows: | |
1014 | * | |
1015 | * No traits: | |
1016 | * | |
1017 | * Probably no references are peeled. But if the file contains a | |
1018 | * peeled value for a reference, we will use it. | |
1019 | * | |
1020 | * peeled: | |
1021 | * | |
1022 | * References under "refs/tags/", if they *can* be peeled, *are* | |
1023 | * peeled in this file. References outside of "refs/tags/" are | |
1024 | * probably not peeled even if they could have been, but if we find | |
1025 | * a peeled value for such a reference we will use it. | |
1026 | * | |
1027 | * fully-peeled: | |
1028 | * | |
1029 | * All references in the file that can be peeled are peeled. | |
1030 | * Inversely (and this is more important), any references in the | |
1031 | * file for which no peeled value is recorded is not peelable. This | |
1032 | * trait should typically be written alongside "peeled" for | |
1033 | * compatibility with older clients, but we do not require it | |
1034 | * (i.e., "peeled" is a no-op if "fully-peeled" is set). | |
1035 | */ | |
d3177275 | 1036 | static void read_packed_refs(FILE *f, struct ref_dir *dir) |
f4204ab9 | 1037 | { |
e9c4c111 | 1038 | struct ref_entry *last = NULL; |
f4204ab9 | 1039 | char refline[PATH_MAX]; |
c29c46fa | 1040 | enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE; |
f4204ab9 JH |
1041 | |
1042 | while (fgets(refline, sizeof(refline), f)) { | |
1043 | unsigned char sha1[20]; | |
dfefa935 | 1044 | const char *refname; |
f4204ab9 JH |
1045 | static const char header[] = "# pack-refs with:"; |
1046 | ||
1047 | if (!strncmp(refline, header, sizeof(header)-1)) { | |
1048 | const char *traits = refline + sizeof(header) - 1; | |
c29c46fa MH |
1049 | if (strstr(traits, " fully-peeled ")) |
1050 | peeled = PEELED_FULLY; | |
1051 | else if (strstr(traits, " peeled ")) | |
1052 | peeled = PEELED_TAGS; | |
f4204ab9 JH |
1053 | /* perhaps other traits later as well */ |
1054 | continue; | |
1055 | } | |
1056 | ||
dfefa935 MH |
1057 | refname = parse_ref_line(refline, sha1); |
1058 | if (refname) { | |
c29c46fa MH |
1059 | last = create_ref_entry(refname, sha1, REF_ISPACKED, 1); |
1060 | if (peeled == PEELED_FULLY || | |
59556548 | 1061 | (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/"))) |
c29c46fa | 1062 | last->flag |= REF_KNOWS_PEELED; |
d3177275 | 1063 | add_ref(dir, last); |
f4204ab9 JH |
1064 | continue; |
1065 | } | |
1066 | if (last && | |
1067 | refline[0] == '^' && | |
3feb4f0c MH |
1068 | strlen(refline) == PEELED_LINE_LENGTH && |
1069 | refline[PEELED_LINE_LENGTH - 1] == '\n' && | |
c29c46fa | 1070 | !get_sha1_hex(refline + 1, sha1)) { |
593f1bb8 | 1071 | hashcpy(last->u.value.peeled, sha1); |
c29c46fa MH |
1072 | /* |
1073 | * Regardless of what the file header said, | |
1074 | * we definitely know the value of *this* | |
1075 | * reference: | |
1076 | */ | |
1077 | last->flag |= REF_KNOWS_PEELED; | |
1078 | } | |
f4204ab9 | 1079 | } |
f4204ab9 JH |
1080 | } |
1081 | ||
2fff7812 MH |
1082 | /* |
1083 | * Get the packed_ref_cache for the specified ref_cache, creating it | |
1084 | * if necessary. | |
1085 | */ | |
1086 | static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs) | |
5e290ff7 | 1087 | { |
ca919930 JK |
1088 | const char *packed_refs_file; |
1089 | ||
1090 | if (*refs->name) | |
1091 | packed_refs_file = git_path_submodule(refs->name, "packed-refs"); | |
1092 | else | |
1093 | packed_refs_file = git_path("packed-refs"); | |
1094 | ||
1095 | if (refs->packed && | |
1096 | !stat_validity_check(&refs->packed->validity, packed_refs_file)) | |
1097 | clear_packed_ref_cache(refs); | |
1098 | ||
d12229f5 | 1099 | if (!refs->packed) { |
4349a668 | 1100 | FILE *f; |
0bad611b | 1101 | |
2fff7812 | 1102 | refs->packed = xcalloc(1, sizeof(*refs->packed)); |
5f5e2a88 | 1103 | acquire_packed_ref_cache(refs->packed); |
2fff7812 | 1104 | refs->packed->root = create_dir_entry(refs, "", 0, 0); |
4349a668 | 1105 | f = fopen(packed_refs_file, "r"); |
e1e22e37 | 1106 | if (f) { |
ca919930 | 1107 | stat_validity_update(&refs->packed->validity, fileno(f)); |
2fff7812 | 1108 | read_packed_refs(f, get_ref_dir(refs->packed->root)); |
e1e22e37 | 1109 | fclose(f); |
e1e22e37 | 1110 | } |
e1e22e37 | 1111 | } |
2fff7812 MH |
1112 | return refs->packed; |
1113 | } | |
1114 | ||
1115 | static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache) | |
1116 | { | |
1117 | return get_ref_dir(packed_ref_cache->root); | |
1118 | } | |
1119 | ||
1120 | static struct ref_dir *get_packed_refs(struct ref_cache *refs) | |
1121 | { | |
1122 | return get_packed_ref_dir(get_packed_ref_cache(refs)); | |
e1e22e37 LT |
1123 | } |
1124 | ||
30249ee6 MH |
1125 | void add_packed_ref(const char *refname, const unsigned char *sha1) |
1126 | { | |
9f69d297 MH |
1127 | struct packed_ref_cache *packed_ref_cache = |
1128 | get_packed_ref_cache(&ref_cache); | |
1129 | ||
1130 | if (!packed_ref_cache->lock) | |
1131 | die("internal error: packed refs not locked"); | |
1132 | add_ref(get_packed_ref_dir(packed_ref_cache), | |
9da31cb0 | 1133 | create_ref_entry(refname, sha1, REF_ISPACKED, 1)); |
30249ee6 MH |
1134 | } |
1135 | ||
abc39098 | 1136 | /* |
28e6a34e MH |
1137 | * Read the loose references from the namespace dirname into dir |
1138 | * (without recursing). dirname must end with '/'. dir must be the | |
1139 | * directory entry corresponding to dirname. | |
abc39098 | 1140 | */ |
423a1afc | 1141 | static void read_loose_refs(const char *dirname, struct ref_dir *dir) |
e1e22e37 | 1142 | { |
423a1afc | 1143 | struct ref_cache *refs = dir->ref_cache; |
d3177275 | 1144 | DIR *d; |
0bad611b | 1145 | const char *path; |
d5fdae67 | 1146 | struct dirent *de; |
abc39098 | 1147 | int dirnamelen = strlen(dirname); |
72b64b44 | 1148 | struct strbuf refname; |
0bad611b | 1149 | |
3b124823 | 1150 | if (*refs->name) |
66a3d20b | 1151 | path = git_path_submodule(refs->name, "%s", dirname); |
0bad611b | 1152 | else |
66a3d20b | 1153 | path = git_path("%s", dirname); |
0bad611b | 1154 | |
d3177275 | 1155 | d = opendir(path); |
d5fdae67 MH |
1156 | if (!d) |
1157 | return; | |
1158 | ||
66a3d20b MH |
1159 | strbuf_init(&refname, dirnamelen + 257); |
1160 | strbuf_add(&refname, dirname, dirnamelen); | |
d5fdae67 MH |
1161 | |
1162 | while ((de = readdir(d)) != NULL) { | |
1163 | unsigned char sha1[20]; | |
1164 | struct stat st; | |
1165 | int flag; | |
d5fdae67 MH |
1166 | const char *refdir; |
1167 | ||
1168 | if (de->d_name[0] == '.') | |
1169 | continue; | |
2975c770 | 1170 | if (ends_with(de->d_name, ".lock")) |
d5fdae67 | 1171 | continue; |
72b64b44 | 1172 | strbuf_addstr(&refname, de->d_name); |
d5fdae67 | 1173 | refdir = *refs->name |
72b64b44 MH |
1174 | ? git_path_submodule(refs->name, "%s", refname.buf) |
1175 | : git_path("%s", refname.buf); | |
1176 | if (stat(refdir, &st) < 0) { | |
1177 | ; /* silently ignore */ | |
1178 | } else if (S_ISDIR(st.st_mode)) { | |
abc39098 | 1179 | strbuf_addch(&refname, '/'); |
28e6a34e | 1180 | add_entry_to_dir(dir, |
b9146f51 RS |
1181 | create_dir_entry(refs, refname.buf, |
1182 | refname.len, 1)); | |
72b64b44 | 1183 | } else { |
3b124823 | 1184 | if (*refs->name) { |
f8948e2f | 1185 | hashclr(sha1); |
0bad611b | 1186 | flag = 0; |
72b64b44 | 1187 | if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) { |
0bad611b | 1188 | hashclr(sha1); |
98ac34b2 | 1189 | flag |= REF_ISBROKEN; |
0bad611b | 1190 | } |
72b64b44 | 1191 | } else if (read_ref_full(refname.buf, sha1, 1, &flag)) { |
09116a1c JH |
1192 | hashclr(sha1); |
1193 | flag |= REF_ISBROKEN; | |
1194 | } | |
9f2fb4a3 MH |
1195 | add_entry_to_dir(dir, |
1196 | create_ref_entry(refname.buf, sha1, flag, 1)); | |
e1e22e37 | 1197 | } |
66a3d20b | 1198 | strbuf_setlen(&refname, dirnamelen); |
e1e22e37 | 1199 | } |
72b64b44 | 1200 | strbuf_release(&refname); |
d5fdae67 | 1201 | closedir(d); |
e1e22e37 LT |
1202 | } |
1203 | ||
d3177275 | 1204 | static struct ref_dir *get_loose_refs(struct ref_cache *refs) |
e1e22e37 | 1205 | { |
d12229f5 | 1206 | if (!refs->loose) { |
28e6a34e MH |
1207 | /* |
1208 | * Mark the top-level directory complete because we | |
1209 | * are about to read the only subdirectory that can | |
1210 | * hold references: | |
1211 | */ | |
b9146f51 | 1212 | refs->loose = create_dir_entry(refs, "", 0, 0); |
28e6a34e MH |
1213 | /* |
1214 | * Create an incomplete entry for "refs/": | |
1215 | */ | |
1216 | add_entry_to_dir(get_ref_dir(refs->loose), | |
b9146f51 | 1217 | create_dir_entry(refs, "refs/", 5, 1)); |
e1e22e37 | 1218 | } |
d7826d54 | 1219 | return get_ref_dir(refs->loose); |
e1e22e37 LT |
1220 | } |
1221 | ||
ca8db142 LT |
1222 | /* We allow "recursive" symbolic refs. Only within reason, though */ |
1223 | #define MAXDEPTH 5 | |
0ebde32c LT |
1224 | #define MAXREFLEN (1024) |
1225 | ||
e5fa45c1 JH |
1226 | /* |
1227 | * Called by resolve_gitlink_ref_recursive() after it failed to read | |
b0626608 MH |
1228 | * from the loose refs in ref_cache refs. Find <refname> in the |
1229 | * packed-refs file for the submodule. | |
e5fa45c1 | 1230 | */ |
b0626608 | 1231 | static int resolve_gitlink_packed_ref(struct ref_cache *refs, |
85be1fe3 | 1232 | const char *refname, unsigned char *sha1) |
0ebde32c | 1233 | { |
2c5c66be | 1234 | struct ref_entry *ref; |
d3177275 | 1235 | struct ref_dir *dir = get_packed_refs(refs); |
0ebde32c | 1236 | |
432ad41e | 1237 | ref = find_ref(dir, refname); |
b0626608 MH |
1238 | if (ref == NULL) |
1239 | return -1; | |
1240 | ||
50546b15 | 1241 | hashcpy(sha1, ref->u.value.sha1); |
b0626608 | 1242 | return 0; |
0ebde32c LT |
1243 | } |
1244 | ||
b0626608 | 1245 | static int resolve_gitlink_ref_recursive(struct ref_cache *refs, |
85be1fe3 | 1246 | const char *refname, unsigned char *sha1, |
dfefa935 | 1247 | int recursion) |
0ebde32c | 1248 | { |
064d51dc | 1249 | int fd, len; |
0ebde32c | 1250 | char buffer[128], *p; |
064d51dc | 1251 | char *path; |
0ebde32c | 1252 | |
064d51dc | 1253 | if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN) |
0ebde32c | 1254 | return -1; |
064d51dc MH |
1255 | path = *refs->name |
1256 | ? git_path_submodule(refs->name, "%s", refname) | |
1257 | : git_path("%s", refname); | |
1258 | fd = open(path, O_RDONLY); | |
0ebde32c | 1259 | if (fd < 0) |
b0626608 | 1260 | return resolve_gitlink_packed_ref(refs, refname, sha1); |
0ebde32c LT |
1261 | |
1262 | len = read(fd, buffer, sizeof(buffer)-1); | |
1263 | close(fd); | |
1264 | if (len < 0) | |
1265 | return -1; | |
1266 | while (len && isspace(buffer[len-1])) | |
1267 | len--; | |
1268 | buffer[len] = 0; | |
1269 | ||
1270 | /* Was it a detached head or an old-fashioned symlink? */ | |
85be1fe3 | 1271 | if (!get_sha1_hex(buffer, sha1)) |
0ebde32c LT |
1272 | return 0; |
1273 | ||
1274 | /* Symref? */ | |
1275 | if (strncmp(buffer, "ref:", 4)) | |
1276 | return -1; | |
1277 | p = buffer + 4; | |
1278 | while (isspace(*p)) | |
1279 | p++; | |
1280 | ||
064d51dc | 1281 | return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1); |
0ebde32c LT |
1282 | } |
1283 | ||
85be1fe3 | 1284 | int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1) |
0ebde32c LT |
1285 | { |
1286 | int len = strlen(path), retval; | |
064d51dc | 1287 | char *submodule; |
b0626608 | 1288 | struct ref_cache *refs; |
0ebde32c LT |
1289 | |
1290 | while (len && path[len-1] == '/') | |
1291 | len--; | |
1292 | if (!len) | |
1293 | return -1; | |
b0626608 MH |
1294 | submodule = xstrndup(path, len); |
1295 | refs = get_ref_cache(submodule); | |
1296 | free(submodule); | |
1297 | ||
064d51dc | 1298 | retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0); |
0ebde32c LT |
1299 | return retval; |
1300 | } | |
ca8db142 | 1301 | |
4886b89f | 1302 | /* |
63331581 MH |
1303 | * Return the ref_entry for the given refname from the packed |
1304 | * references. If it does not exist, return NULL. | |
4886b89f | 1305 | */ |
63331581 | 1306 | static struct ref_entry *get_packed_ref(const char *refname) |
c224ca7f | 1307 | { |
9da31cb0 | 1308 | return find_ref(get_packed_refs(&ref_cache), refname); |
c224ca7f MH |
1309 | } |
1310 | ||
47f534bf MH |
1311 | /* |
1312 | * A loose ref file doesn't exist; check for a packed ref. The | |
1313 | * options are forwarded from resolve_safe_unsafe(). | |
1314 | */ | |
1315 | static const char *handle_missing_loose_ref(const char *refname, | |
1316 | unsigned char *sha1, | |
1317 | int reading, | |
1318 | int *flag) | |
1319 | { | |
1320 | struct ref_entry *entry; | |
1321 | ||
1322 | /* | |
1323 | * The loose reference file does not exist; check for a packed | |
1324 | * reference. | |
1325 | */ | |
1326 | entry = get_packed_ref(refname); | |
1327 | if (entry) { | |
1328 | hashcpy(sha1, entry->u.value.sha1); | |
1329 | if (flag) | |
1330 | *flag |= REF_ISPACKED; | |
1331 | return refname; | |
1332 | } | |
1333 | /* The reference is not a packed reference, either. */ | |
1334 | if (reading) { | |
1335 | return NULL; | |
1336 | } else { | |
1337 | hashclr(sha1); | |
1338 | return refname; | |
1339 | } | |
1340 | } | |
1341 | ||
76d70dc0 | 1342 | /* This function needs to return a meaningful errno on failure */ |
8d68493f | 1343 | const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag) |
8a65ff76 | 1344 | { |
0104ca09 HO |
1345 | int depth = MAXDEPTH; |
1346 | ssize_t len; | |
a876ed83 | 1347 | char buffer[256]; |
dfefa935 | 1348 | static char refname_buffer[256]; |
ca8db142 | 1349 | |
8da19775 JH |
1350 | if (flag) |
1351 | *flag = 0; | |
1352 | ||
76d70dc0 RS |
1353 | if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) { |
1354 | errno = EINVAL; | |
8384d788 | 1355 | return NULL; |
76d70dc0 | 1356 | } |
8384d788 | 1357 | |
a876ed83 | 1358 | for (;;) { |
55956350 | 1359 | char path[PATH_MAX]; |
a876ed83 JH |
1360 | struct stat st; |
1361 | char *buf; | |
1362 | int fd; | |
8a65ff76 | 1363 | |
76d70dc0 RS |
1364 | if (--depth < 0) { |
1365 | errno = ELOOP; | |
a876ed83 | 1366 | return NULL; |
76d70dc0 | 1367 | } |
ca8db142 | 1368 | |
dfefa935 | 1369 | git_snpath(path, sizeof(path), "%s", refname); |
c224ca7f | 1370 | |
fcb7c762 MH |
1371 | /* |
1372 | * We might have to loop back here to avoid a race | |
1373 | * condition: first we lstat() the file, then we try | |
1374 | * to read it as a link or as a file. But if somebody | |
1375 | * changes the type of the file (file <-> directory | |
1376 | * <-> symlink) between the lstat() and reading, then | |
1377 | * we don't want to report that as an error but rather | |
1378 | * try again starting with the lstat(). | |
1379 | */ | |
1380 | stat_ref: | |
a876ed83 | 1381 | if (lstat(path, &st) < 0) { |
47f534bf MH |
1382 | if (errno == ENOENT) |
1383 | return handle_missing_loose_ref(refname, sha1, | |
1384 | reading, flag); | |
1385 | else | |
a876ed83 | 1386 | return NULL; |
a876ed83 | 1387 | } |
ca8db142 | 1388 | |
a876ed83 JH |
1389 | /* Follow "normalized" - ie "refs/.." symlinks by hand */ |
1390 | if (S_ISLNK(st.st_mode)) { | |
1391 | len = readlink(path, buffer, sizeof(buffer)-1); | |
fcb7c762 MH |
1392 | if (len < 0) { |
1393 | if (errno == ENOENT || errno == EINVAL) | |
1394 | /* inconsistent with lstat; retry */ | |
1395 | goto stat_ref; | |
1396 | else | |
1397 | return NULL; | |
1398 | } | |
b54cb795 | 1399 | buffer[len] = 0; |
59556548 | 1400 | if (starts_with(buffer, "refs/") && |
1f58a038 | 1401 | !check_refname_format(buffer, 0)) { |
dfefa935 MH |
1402 | strcpy(refname_buffer, buffer); |
1403 | refname = refname_buffer; | |
8da19775 JH |
1404 | if (flag) |
1405 | *flag |= REF_ISSYMREF; | |
a876ed83 JH |
1406 | continue; |
1407 | } | |
ca8db142 | 1408 | } |
a876ed83 | 1409 | |
7a21632f DS |
1410 | /* Is it a directory? */ |
1411 | if (S_ISDIR(st.st_mode)) { | |
1412 | errno = EISDIR; | |
1413 | return NULL; | |
1414 | } | |
1415 | ||
a876ed83 JH |
1416 | /* |
1417 | * Anything else, just open it and try to use it as | |
1418 | * a ref | |
1419 | */ | |
1420 | fd = open(path, O_RDONLY); | |
fcb7c762 MH |
1421 | if (fd < 0) { |
1422 | if (errno == ENOENT) | |
1423 | /* inconsistent with lstat; retry */ | |
1424 | goto stat_ref; | |
1425 | else | |
1426 | return NULL; | |
1427 | } | |
93d26e4c | 1428 | len = read_in_full(fd, buffer, sizeof(buffer)-1); |
76d70dc0 RS |
1429 | if (len < 0) { |
1430 | int save_errno = errno; | |
1431 | close(fd); | |
1432 | errno = save_errno; | |
28775050 | 1433 | return NULL; |
76d70dc0 RS |
1434 | } |
1435 | close(fd); | |
28775050 MH |
1436 | while (len && isspace(buffer[len-1])) |
1437 | len--; | |
1438 | buffer[len] = '\0'; | |
a876ed83 JH |
1439 | |
1440 | /* | |
1441 | * Is it a symbolic ref? | |
1442 | */ | |
59556548 | 1443 | if (!starts_with(buffer, "ref:")) { |
2884c06a MH |
1444 | /* |
1445 | * Please note that FETCH_HEAD has a second | |
1446 | * line containing other data. | |
1447 | */ | |
1448 | if (get_sha1_hex(buffer, sha1) || | |
1449 | (buffer[40] != '\0' && !isspace(buffer[40]))) { | |
1450 | if (flag) | |
1451 | *flag |= REF_ISBROKEN; | |
76d70dc0 | 1452 | errno = EINVAL; |
2884c06a MH |
1453 | return NULL; |
1454 | } | |
1455 | return refname; | |
1456 | } | |
55956350 JH |
1457 | if (flag) |
1458 | *flag |= REF_ISSYMREF; | |
a876ed83 | 1459 | buf = buffer + 4; |
28775050 MH |
1460 | while (isspace(*buf)) |
1461 | buf++; | |
313fb010 | 1462 | if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) { |
55956350 JH |
1463 | if (flag) |
1464 | *flag |= REF_ISBROKEN; | |
76d70dc0 | 1465 | errno = EINVAL; |
313fb010 MH |
1466 | return NULL; |
1467 | } | |
dfefa935 | 1468 | refname = strcpy(refname_buffer, buf); |
8a65ff76 | 1469 | } |
a876ed83 JH |
1470 | } |
1471 | ||
96ec7b1e NTND |
1472 | char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag) |
1473 | { | |
8cad4744 | 1474 | const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag); |
96ec7b1e NTND |
1475 | return ret ? xstrdup(ret) : NULL; |
1476 | } | |
1477 | ||
d08bae7e IL |
1478 | /* The argument to filter_refs */ |
1479 | struct ref_filter { | |
1480 | const char *pattern; | |
1481 | each_ref_fn *fn; | |
1482 | void *cb_data; | |
1483 | }; | |
1484 | ||
dfefa935 | 1485 | int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags) |
a876ed83 | 1486 | { |
8d68493f | 1487 | if (resolve_ref_unsafe(refname, sha1, reading, flags)) |
a876ed83 JH |
1488 | return 0; |
1489 | return -1; | |
8a65ff76 LT |
1490 | } |
1491 | ||
dfefa935 | 1492 | int read_ref(const char *refname, unsigned char *sha1) |
c6893323 | 1493 | { |
dfefa935 | 1494 | return read_ref_full(refname, sha1, 1, NULL); |
c6893323 NTND |
1495 | } |
1496 | ||
bc5fd6d3 | 1497 | int ref_exists(const char *refname) |
ef06b918 | 1498 | { |
bc5fd6d3 MH |
1499 | unsigned char sha1[20]; |
1500 | return !!resolve_ref_unsafe(refname, sha1, 1, NULL); | |
ef06b918 JH |
1501 | } |
1502 | ||
85be1fe3 | 1503 | static int filter_refs(const char *refname, const unsigned char *sha1, int flags, |
dfefa935 | 1504 | void *data) |
d08bae7e IL |
1505 | { |
1506 | struct ref_filter *filter = (struct ref_filter *)data; | |
eb07894f | 1507 | if (wildmatch(filter->pattern, refname, 0, NULL)) |
d08bae7e | 1508 | return 0; |
85be1fe3 | 1509 | return filter->fn(refname, sha1, flags, filter->cb_data); |
d08bae7e IL |
1510 | } |
1511 | ||
68cf8703 MH |
1512 | enum peel_status { |
1513 | /* object was peeled successfully: */ | |
1514 | PEEL_PEELED = 0, | |
1515 | ||
1516 | /* | |
1517 | * object cannot be peeled because the named object (or an | |
1518 | * object referred to by a tag in the peel chain), does not | |
1519 | * exist. | |
1520 | */ | |
1521 | PEEL_INVALID = -1, | |
1522 | ||
1523 | /* object cannot be peeled because it is not a tag: */ | |
9a489f3c MH |
1524 | PEEL_NON_TAG = -2, |
1525 | ||
1526 | /* ref_entry contains no peeled value because it is a symref: */ | |
1527 | PEEL_IS_SYMREF = -3, | |
1528 | ||
1529 | /* | |
1530 | * ref_entry cannot be peeled because it is broken (i.e., the | |
1531 | * symbolic reference cannot even be resolved to an object | |
1532 | * name): | |
1533 | */ | |
1534 | PEEL_BROKEN = -4 | |
68cf8703 MH |
1535 | }; |
1536 | ||
cb2ae1c4 MH |
1537 | /* |
1538 | * Peel the named object; i.e., if the object is a tag, resolve the | |
68cf8703 MH |
1539 | * tag recursively until a non-tag is found. If successful, store the |
1540 | * result to sha1 and return PEEL_PEELED. If the object is not a tag | |
1541 | * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively, | |
1542 | * and leave sha1 unchanged. | |
cb2ae1c4 | 1543 | */ |
68cf8703 | 1544 | static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1) |
cb2ae1c4 MH |
1545 | { |
1546 | struct object *o = lookup_unknown_object(name); | |
1547 | ||
1548 | if (o->type == OBJ_NONE) { | |
1549 | int type = sha1_object_info(name, NULL); | |
8ff226a9 | 1550 | if (type < 0 || !object_as_type(o, type, 0)) |
68cf8703 | 1551 | return PEEL_INVALID; |
cb2ae1c4 MH |
1552 | } |
1553 | ||
1554 | if (o->type != OBJ_TAG) | |
68cf8703 | 1555 | return PEEL_NON_TAG; |
cb2ae1c4 MH |
1556 | |
1557 | o = deref_tag_noverify(o); | |
1558 | if (!o) | |
68cf8703 | 1559 | return PEEL_INVALID; |
cb2ae1c4 MH |
1560 | |
1561 | hashcpy(sha1, o->sha1); | |
68cf8703 | 1562 | return PEEL_PEELED; |
cb2ae1c4 MH |
1563 | } |
1564 | ||
9a489f3c | 1565 | /* |
f85354b5 MH |
1566 | * Peel the entry (if possible) and return its new peel_status. If |
1567 | * repeel is true, re-peel the entry even if there is an old peeled | |
1568 | * value that is already stored in it. | |
694b7a19 MH |
1569 | * |
1570 | * It is OK to call this function with a packed reference entry that | |
1571 | * might be stale and might even refer to an object that has since | |
1572 | * been garbage-collected. In such a case, if the entry has | |
1573 | * REF_KNOWS_PEELED then leave the status unchanged and return | |
1574 | * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID. | |
9a489f3c | 1575 | */ |
f85354b5 | 1576 | static enum peel_status peel_entry(struct ref_entry *entry, int repeel) |
9a489f3c MH |
1577 | { |
1578 | enum peel_status status; | |
1579 | ||
f85354b5 MH |
1580 | if (entry->flag & REF_KNOWS_PEELED) { |
1581 | if (repeel) { | |
1582 | entry->flag &= ~REF_KNOWS_PEELED; | |
1583 | hashclr(entry->u.value.peeled); | |
1584 | } else { | |
1585 | return is_null_sha1(entry->u.value.peeled) ? | |
1586 | PEEL_NON_TAG : PEEL_PEELED; | |
1587 | } | |
1588 | } | |
9a489f3c MH |
1589 | if (entry->flag & REF_ISBROKEN) |
1590 | return PEEL_BROKEN; | |
1591 | if (entry->flag & REF_ISSYMREF) | |
1592 | return PEEL_IS_SYMREF; | |
1593 | ||
1594 | status = peel_object(entry->u.value.sha1, entry->u.value.peeled); | |
1595 | if (status == PEEL_PEELED || status == PEEL_NON_TAG) | |
1596 | entry->flag |= REF_KNOWS_PEELED; | |
1597 | return status; | |
1598 | } | |
1599 | ||
dfefa935 | 1600 | int peel_ref(const char *refname, unsigned char *sha1) |
cf0adba7 JH |
1601 | { |
1602 | int flag; | |
1603 | unsigned char base[20]; | |
cf0adba7 | 1604 | |
dfefa935 | 1605 | if (current_ref && (current_ref->name == refname |
9a489f3c | 1606 | || !strcmp(current_ref->name, refname))) { |
f85354b5 | 1607 | if (peel_entry(current_ref, 0)) |
9a489f3c MH |
1608 | return -1; |
1609 | hashcpy(sha1, current_ref->u.value.peeled); | |
1610 | return 0; | |
0ae91be0 SP |
1611 | } |
1612 | ||
dfefa935 | 1613 | if (read_ref_full(refname, base, 1, &flag)) |
cf0adba7 JH |
1614 | return -1; |
1615 | ||
9a489f3c MH |
1616 | /* |
1617 | * If the reference is packed, read its ref_entry from the | |
1618 | * cache in the hope that we already know its peeled value. | |
1619 | * We only try this optimization on packed references because | |
1620 | * (a) forcing the filling of the loose reference cache could | |
1621 | * be expensive and (b) loose references anyway usually do not | |
1622 | * have REF_KNOWS_PEELED. | |
1623 | */ | |
1624 | if (flag & REF_ISPACKED) { | |
f361baeb | 1625 | struct ref_entry *r = get_packed_ref(refname); |
9a489f3c | 1626 | if (r) { |
f85354b5 | 1627 | if (peel_entry(r, 0)) |
9a489f3c | 1628 | return -1; |
593f1bb8 | 1629 | hashcpy(sha1, r->u.value.peeled); |
e9c4c111 | 1630 | return 0; |
cf0adba7 | 1631 | } |
cf0adba7 JH |
1632 | } |
1633 | ||
cb2ae1c4 | 1634 | return peel_object(base, sha1); |
cf0adba7 JH |
1635 | } |
1636 | ||
bc5fd6d3 MH |
1637 | struct warn_if_dangling_data { |
1638 | FILE *fp; | |
1639 | const char *refname; | |
e6bea66d | 1640 | const struct string_list *refnames; |
bc5fd6d3 MH |
1641 | const char *msg_fmt; |
1642 | }; | |
1643 | ||
1644 | static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1, | |
1645 | int flags, void *cb_data) | |
1646 | { | |
1647 | struct warn_if_dangling_data *d = cb_data; | |
1648 | const char *resolves_to; | |
1649 | unsigned char junk[20]; | |
1650 | ||
1651 | if (!(flags & REF_ISSYMREF)) | |
1652 | return 0; | |
1653 | ||
1654 | resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL); | |
e6bea66d JL |
1655 | if (!resolves_to |
1656 | || (d->refname | |
1657 | ? strcmp(resolves_to, d->refname) | |
1658 | : !string_list_has_string(d->refnames, resolves_to))) { | |
bc5fd6d3 | 1659 | return 0; |
e6bea66d | 1660 | } |
bc5fd6d3 MH |
1661 | |
1662 | fprintf(d->fp, d->msg_fmt, refname); | |
1be65eda | 1663 | fputc('\n', d->fp); |
bc5fd6d3 MH |
1664 | return 0; |
1665 | } | |
1666 | ||
1667 | void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname) | |
1668 | { | |
1669 | struct warn_if_dangling_data data; | |
1670 | ||
1671 | data.fp = fp; | |
1672 | data.refname = refname; | |
e6bea66d JL |
1673 | data.refnames = NULL; |
1674 | data.msg_fmt = msg_fmt; | |
1675 | for_each_rawref(warn_if_dangling_symref, &data); | |
1676 | } | |
1677 | ||
1678 | void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames) | |
1679 | { | |
1680 | struct warn_if_dangling_data data; | |
1681 | ||
1682 | data.fp = fp; | |
1683 | data.refname = NULL; | |
1684 | data.refnames = refnames; | |
bc5fd6d3 MH |
1685 | data.msg_fmt = msg_fmt; |
1686 | for_each_rawref(warn_if_dangling_symref, &data); | |
1687 | } | |
1688 | ||
fcce1703 | 1689 | /* |
65cf102b | 1690 | * Call fn for each reference in the specified ref_cache, omitting |
624cac35 MH |
1691 | * references not in the containing_dir of base. fn is called for all |
1692 | * references, including broken ones. If fn ever returns a non-zero | |
fcce1703 MH |
1693 | * value, stop the iteration and return that value; otherwise, return |
1694 | * 0. | |
1695 | */ | |
65cf102b | 1696 | static int do_for_each_entry(struct ref_cache *refs, const char *base, |
624cac35 | 1697 | each_ref_entry_fn fn, void *cb_data) |
8a65ff76 | 1698 | { |
98eeb09e JK |
1699 | struct packed_ref_cache *packed_ref_cache; |
1700 | struct ref_dir *loose_dir; | |
1701 | struct ref_dir *packed_dir; | |
933ac036 MH |
1702 | int retval = 0; |
1703 | ||
98eeb09e JK |
1704 | /* |
1705 | * We must make sure that all loose refs are read before accessing the | |
1706 | * packed-refs file; this avoids a race condition in which loose refs | |
1707 | * are migrated to the packed-refs file by a simultaneous process, but | |
1708 | * our in-memory view is from before the migration. get_packed_ref_cache() | |
1709 | * takes care of making sure our view is up to date with what is on | |
1710 | * disk. | |
1711 | */ | |
1712 | loose_dir = get_loose_refs(refs); | |
933ac036 | 1713 | if (base && *base) { |
933ac036 MH |
1714 | loose_dir = find_containing_dir(loose_dir, base, 0); |
1715 | } | |
98eeb09e JK |
1716 | if (loose_dir) |
1717 | prime_ref_dir(loose_dir); | |
1718 | ||
1719 | packed_ref_cache = get_packed_ref_cache(refs); | |
8baf2bb9 | 1720 | acquire_packed_ref_cache(packed_ref_cache); |
98eeb09e | 1721 | packed_dir = get_packed_ref_dir(packed_ref_cache); |
933ac036 MH |
1722 | if (base && *base) { |
1723 | packed_dir = find_containing_dir(packed_dir, base, 0); | |
933ac036 MH |
1724 | } |
1725 | ||
1726 | if (packed_dir && loose_dir) { | |
1727 | sort_ref_dir(packed_dir); | |
1728 | sort_ref_dir(loose_dir); | |
624cac35 MH |
1729 | retval = do_for_each_entry_in_dirs( |
1730 | packed_dir, loose_dir, fn, cb_data); | |
933ac036 MH |
1731 | } else if (packed_dir) { |
1732 | sort_ref_dir(packed_dir); | |
624cac35 MH |
1733 | retval = do_for_each_entry_in_dir( |
1734 | packed_dir, 0, fn, cb_data); | |
933ac036 MH |
1735 | } else if (loose_dir) { |
1736 | sort_ref_dir(loose_dir); | |
624cac35 MH |
1737 | retval = do_for_each_entry_in_dir( |
1738 | loose_dir, 0, fn, cb_data); | |
933ac036 MH |
1739 | } |
1740 | ||
8baf2bb9 | 1741 | release_packed_ref_cache(packed_ref_cache); |
933ac036 | 1742 | return retval; |
8a65ff76 LT |
1743 | } |
1744 | ||
624cac35 | 1745 | /* |
65cf102b | 1746 | * Call fn for each reference in the specified ref_cache for which the |
624cac35 MH |
1747 | * refname begins with base. If trim is non-zero, then trim that many |
1748 | * characters off the beginning of each refname before passing the | |
1749 | * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include | |
1750 | * broken references in the iteration. If fn ever returns a non-zero | |
1751 | * value, stop the iteration and return that value; otherwise, return | |
1752 | * 0. | |
1753 | */ | |
65cf102b MH |
1754 | static int do_for_each_ref(struct ref_cache *refs, const char *base, |
1755 | each_ref_fn fn, int trim, int flags, void *cb_data) | |
624cac35 MH |
1756 | { |
1757 | struct ref_entry_cb data; | |
1758 | data.base = base; | |
1759 | data.trim = trim; | |
1760 | data.flags = flags; | |
1761 | data.fn = fn; | |
1762 | data.cb_data = cb_data; | |
1763 | ||
65cf102b | 1764 | return do_for_each_entry(refs, base, do_one_ref, &data); |
624cac35 MH |
1765 | } |
1766 | ||
0bad611b | 1767 | static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data) |
723c31fe LT |
1768 | { |
1769 | unsigned char sha1[20]; | |
8da19775 JH |
1770 | int flag; |
1771 | ||
0bad611b HV |
1772 | if (submodule) { |
1773 | if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0) | |
1774 | return fn("HEAD", sha1, 0, cb_data); | |
1775 | ||
1776 | return 0; | |
1777 | } | |
1778 | ||
c6893323 | 1779 | if (!read_ref_full("HEAD", sha1, 1, &flag)) |
8da19775 | 1780 | return fn("HEAD", sha1, flag, cb_data); |
0bad611b | 1781 | |
2f34ba32 | 1782 | return 0; |
723c31fe LT |
1783 | } |
1784 | ||
0bad611b HV |
1785 | int head_ref(each_ref_fn fn, void *cb_data) |
1786 | { | |
1787 | return do_head_ref(NULL, fn, cb_data); | |
1788 | } | |
1789 | ||
9ef6aeb0 HV |
1790 | int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1791 | { | |
1792 | return do_head_ref(submodule, fn, cb_data); | |
1793 | } | |
1794 | ||
cb5d709f | 1795 | int for_each_ref(each_ref_fn fn, void *cb_data) |
8a65ff76 | 1796 | { |
9da31cb0 | 1797 | return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data); |
a62be77f SE |
1798 | } |
1799 | ||
9ef6aeb0 HV |
1800 | int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1801 | { | |
65cf102b | 1802 | return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data); |
a62be77f SE |
1803 | } |
1804 | ||
2a8177b6 CC |
1805 | int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data) |
1806 | { | |
9da31cb0 | 1807 | return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data); |
2a8177b6 CC |
1808 | } |
1809 | ||
9ef6aeb0 HV |
1810 | int for_each_ref_in_submodule(const char *submodule, const char *prefix, |
1811 | each_ref_fn fn, void *cb_data) | |
1812 | { | |
65cf102b | 1813 | return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data); |
2a8177b6 CC |
1814 | } |
1815 | ||
cb5d709f | 1816 | int for_each_tag_ref(each_ref_fn fn, void *cb_data) |
a62be77f | 1817 | { |
2a8177b6 | 1818 | return for_each_ref_in("refs/tags/", fn, cb_data); |
a62be77f SE |
1819 | } |
1820 | ||
9ef6aeb0 HV |
1821 | int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1822 | { | |
1823 | return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data); | |
1824 | } | |
1825 | ||
cb5d709f | 1826 | int for_each_branch_ref(each_ref_fn fn, void *cb_data) |
a62be77f | 1827 | { |
2a8177b6 | 1828 | return for_each_ref_in("refs/heads/", fn, cb_data); |
a62be77f SE |
1829 | } |
1830 | ||
9ef6aeb0 HV |
1831 | int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1832 | { | |
1833 | return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data); | |
1834 | } | |
1835 | ||
cb5d709f | 1836 | int for_each_remote_ref(each_ref_fn fn, void *cb_data) |
a62be77f | 1837 | { |
2a8177b6 | 1838 | return for_each_ref_in("refs/remotes/", fn, cb_data); |
f8948e2f JH |
1839 | } |
1840 | ||
9ef6aeb0 HV |
1841 | int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data) |
1842 | { | |
1843 | return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data); | |
1844 | } | |
1845 | ||
29268700 CC |
1846 | int for_each_replace_ref(each_ref_fn fn, void *cb_data) |
1847 | { | |
9da31cb0 | 1848 | return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data); |
29268700 CC |
1849 | } |
1850 | ||
a1bea2c1 JT |
1851 | int head_ref_namespaced(each_ref_fn fn, void *cb_data) |
1852 | { | |
1853 | struct strbuf buf = STRBUF_INIT; | |
1854 | int ret = 0; | |
1855 | unsigned char sha1[20]; | |
1856 | int flag; | |
1857 | ||
1858 | strbuf_addf(&buf, "%sHEAD", get_git_namespace()); | |
c6893323 | 1859 | if (!read_ref_full(buf.buf, sha1, 1, &flag)) |
a1bea2c1 JT |
1860 | ret = fn(buf.buf, sha1, flag, cb_data); |
1861 | strbuf_release(&buf); | |
1862 | ||
1863 | return ret; | |
1864 | } | |
1865 | ||
1866 | int for_each_namespaced_ref(each_ref_fn fn, void *cb_data) | |
1867 | { | |
1868 | struct strbuf buf = STRBUF_INIT; | |
1869 | int ret; | |
1870 | strbuf_addf(&buf, "%srefs/", get_git_namespace()); | |
9da31cb0 | 1871 | ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data); |
a1bea2c1 JT |
1872 | strbuf_release(&buf); |
1873 | return ret; | |
1874 | } | |
1875 | ||
b09fe971 IL |
1876 | int for_each_glob_ref_in(each_ref_fn fn, const char *pattern, |
1877 | const char *prefix, void *cb_data) | |
d08bae7e IL |
1878 | { |
1879 | struct strbuf real_pattern = STRBUF_INIT; | |
1880 | struct ref_filter filter; | |
d08bae7e IL |
1881 | int ret; |
1882 | ||
59556548 | 1883 | if (!prefix && !starts_with(pattern, "refs/")) |
d08bae7e | 1884 | strbuf_addstr(&real_pattern, "refs/"); |
b09fe971 IL |
1885 | else if (prefix) |
1886 | strbuf_addstr(&real_pattern, prefix); | |
d08bae7e IL |
1887 | strbuf_addstr(&real_pattern, pattern); |
1888 | ||
894a9d33 | 1889 | if (!has_glob_specials(pattern)) { |
9517e6b8 | 1890 | /* Append implied '/' '*' if not present. */ |
d08bae7e IL |
1891 | if (real_pattern.buf[real_pattern.len - 1] != '/') |
1892 | strbuf_addch(&real_pattern, '/'); | |
1893 | /* No need to check for '*', there is none. */ | |
1894 | strbuf_addch(&real_pattern, '*'); | |
1895 | } | |
1896 | ||
1897 | filter.pattern = real_pattern.buf; | |
1898 | filter.fn = fn; | |
1899 | filter.cb_data = cb_data; | |
1900 | ret = for_each_ref(filter_refs, &filter); | |
1901 | ||
1902 | strbuf_release(&real_pattern); | |
1903 | return ret; | |
1904 | } | |
1905 | ||
b09fe971 IL |
1906 | int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data) |
1907 | { | |
1908 | return for_each_glob_ref_in(fn, pattern, NULL, cb_data); | |
1909 | } | |
1910 | ||
f8948e2f JH |
1911 | int for_each_rawref(each_ref_fn fn, void *cb_data) |
1912 | { | |
9da31cb0 | 1913 | return do_for_each_ref(&ref_cache, "", fn, 0, |
f8948e2f | 1914 | DO_FOR_EACH_INCLUDE_BROKEN, cb_data); |
8a65ff76 LT |
1915 | } |
1916 | ||
4577e483 | 1917 | const char *prettify_refname(const char *name) |
a9c37a72 | 1918 | { |
a9c37a72 | 1919 | return name + ( |
59556548 CC |
1920 | starts_with(name, "refs/heads/") ? 11 : |
1921 | starts_with(name, "refs/tags/") ? 10 : | |
1922 | starts_with(name, "refs/remotes/") ? 13 : | |
a9c37a72 DB |
1923 | 0); |
1924 | } | |
1925 | ||
54457fe5 | 1926 | static const char *ref_rev_parse_rules[] = { |
79803322 SP |
1927 | "%.*s", |
1928 | "refs/%.*s", | |
1929 | "refs/tags/%.*s", | |
1930 | "refs/heads/%.*s", | |
1931 | "refs/remotes/%.*s", | |
1932 | "refs/remotes/%.*s/HEAD", | |
1933 | NULL | |
1934 | }; | |
1935 | ||
54457fe5 | 1936 | int refname_match(const char *abbrev_name, const char *full_name) |
79803322 SP |
1937 | { |
1938 | const char **p; | |
1939 | const int abbrev_name_len = strlen(abbrev_name); | |
1940 | ||
54457fe5 | 1941 | for (p = ref_rev_parse_rules; *p; p++) { |
79803322 SP |
1942 | if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) { |
1943 | return 1; | |
1944 | } | |
1945 | } | |
1946 | ||
1947 | return 0; | |
1948 | } | |
1949 | ||
835e3c99 | 1950 | /* This function should make sure errno is meaningful on error */ |
e5f38ec3 | 1951 | static struct ref_lock *verify_lock(struct ref_lock *lock, |
4bd18c43 SP |
1952 | const unsigned char *old_sha1, int mustexist) |
1953 | { | |
c6893323 | 1954 | if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) { |
835e3c99 | 1955 | int save_errno = errno; |
434cd0cd | 1956 | error("Can't verify ref %s", lock->ref_name); |
4bd18c43 | 1957 | unlock_ref(lock); |
835e3c99 | 1958 | errno = save_errno; |
4bd18c43 SP |
1959 | return NULL; |
1960 | } | |
a89fccd2 | 1961 | if (hashcmp(lock->old_sha1, old_sha1)) { |
434cd0cd | 1962 | error("Ref %s is at %s but expected %s", lock->ref_name, |
4bd18c43 SP |
1963 | sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1)); |
1964 | unlock_ref(lock); | |
835e3c99 | 1965 | errno = EBUSY; |
4bd18c43 SP |
1966 | return NULL; |
1967 | } | |
1968 | return lock; | |
1969 | } | |
1970 | ||
7155b727 | 1971 | static int remove_empty_directories(const char *file) |
bc7127ef JH |
1972 | { |
1973 | /* we want to create a file but there is a directory there; | |
1974 | * if that is an empty directory (or a directory that contains | |
1975 | * only empty directories), remove them. | |
1976 | */ | |
7155b727 | 1977 | struct strbuf path; |
470a91ef | 1978 | int result, save_errno; |
bc7127ef | 1979 | |
7155b727 JS |
1980 | strbuf_init(&path, 20); |
1981 | strbuf_addstr(&path, file); | |
1982 | ||
a0f4afbe | 1983 | result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY); |
470a91ef | 1984 | save_errno = errno; |
7155b727 JS |
1985 | |
1986 | strbuf_release(&path); | |
470a91ef | 1987 | errno = save_errno; |
7155b727 JS |
1988 | |
1989 | return result; | |
bc7127ef JH |
1990 | } |
1991 | ||
ff74f7f1 JH |
1992 | /* |
1993 | * *string and *len will only be substituted, and *string returned (for | |
1994 | * later free()ing) if the string passed in is a magic short-hand form | |
1995 | * to name a branch. | |
1996 | */ | |
1997 | static char *substitute_branch_name(const char **string, int *len) | |
1998 | { | |
1999 | struct strbuf buf = STRBUF_INIT; | |
cf99a761 | 2000 | int ret = interpret_branch_name(*string, *len, &buf); |
ff74f7f1 JH |
2001 | |
2002 | if (ret == *len) { | |
2003 | size_t size; | |
2004 | *string = strbuf_detach(&buf, &size); | |
2005 | *len = size; | |
2006 | return (char *)*string; | |
2007 | } | |
2008 | ||
2009 | return NULL; | |
2010 | } | |
2011 | ||
2012 | int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref) | |
2013 | { | |
2014 | char *last_branch = substitute_branch_name(&str, &len); | |
2015 | const char **p, *r; | |
2016 | int refs_found = 0; | |
2017 | ||
2018 | *ref = NULL; | |
2019 | for (p = ref_rev_parse_rules; *p; p++) { | |
2020 | char fullref[PATH_MAX]; | |
2021 | unsigned char sha1_from_ref[20]; | |
2022 | unsigned char *this_result; | |
2023 | int flag; | |
2024 | ||
2025 | this_result = refs_found ? sha1_from_ref : sha1; | |
2026 | mksnpath(fullref, sizeof(fullref), *p, len, str); | |
8cad4744 | 2027 | r = resolve_ref_unsafe(fullref, this_result, 1, &flag); |
ff74f7f1 JH |
2028 | if (r) { |
2029 | if (!refs_found++) | |
2030 | *ref = xstrdup(r); | |
2031 | if (!warn_ambiguous_refs) | |
2032 | break; | |
55956350 | 2033 | } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) { |
ff74f7f1 | 2034 | warning("ignoring dangling symref %s.", fullref); |
55956350 JH |
2035 | } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) { |
2036 | warning("ignoring broken ref %s.", fullref); | |
2037 | } | |
ff74f7f1 JH |
2038 | } |
2039 | free(last_branch); | |
2040 | return refs_found; | |
2041 | } | |
2042 | ||
2043 | int dwim_log(const char *str, int len, unsigned char *sha1, char **log) | |
2044 | { | |
2045 | char *last_branch = substitute_branch_name(&str, &len); | |
2046 | const char **p; | |
2047 | int logs_found = 0; | |
2048 | ||
2049 | *log = NULL; | |
2050 | for (p = ref_rev_parse_rules; *p; p++) { | |
ff74f7f1 JH |
2051 | unsigned char hash[20]; |
2052 | char path[PATH_MAX]; | |
2053 | const char *ref, *it; | |
2054 | ||
2055 | mksnpath(path, sizeof(path), *p, len, str); | |
8cad4744 | 2056 | ref = resolve_ref_unsafe(path, hash, 1, NULL); |
ff74f7f1 JH |
2057 | if (!ref) |
2058 | continue; | |
4da58835 | 2059 | if (reflog_exists(path)) |
ff74f7f1 | 2060 | it = path; |
4da58835 | 2061 | else if (strcmp(ref, path) && reflog_exists(ref)) |
ff74f7f1 JH |
2062 | it = ref; |
2063 | else | |
2064 | continue; | |
2065 | if (!logs_found++) { | |
2066 | *log = xstrdup(it); | |
2067 | hashcpy(sha1, hash); | |
2068 | } | |
2069 | if (!warn_ambiguous_refs) | |
2070 | break; | |
2071 | } | |
2072 | free(last_branch); | |
2073 | return logs_found; | |
2074 | } | |
2075 | ||
88b680ae RS |
2076 | /* |
2077 | * Locks a "refs/" ref returning the lock on success and NULL on failure. | |
2078 | * On failure errno is set to something meaningful. | |
2079 | */ | |
dfefa935 MH |
2080 | static struct ref_lock *lock_ref_sha1_basic(const char *refname, |
2081 | const unsigned char *old_sha1, | |
2082 | int flags, int *type_p) | |
4bd18c43 | 2083 | { |
434cd0cd | 2084 | char *ref_file; |
dfefa935 | 2085 | const char *orig_refname = refname; |
4bd18c43 | 2086 | struct ref_lock *lock; |
5cc3cef9 | 2087 | int last_errno = 0; |
acd3b9ec | 2088 | int type, lflags; |
4431fcc4 | 2089 | int mustexist = (old_sha1 && !is_null_sha1(old_sha1)); |
5bdd8d4a | 2090 | int missing = 0; |
c4c61c76 | 2091 | int attempts_remaining = 3; |
4bd18c43 SP |
2092 | |
2093 | lock = xcalloc(1, sizeof(struct ref_lock)); | |
2094 | lock->lock_fd = -1; | |
2095 | ||
8d68493f | 2096 | refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type); |
dfefa935 | 2097 | if (!refname && errno == EISDIR) { |
bc7127ef JH |
2098 | /* we are trying to lock foo but we used to |
2099 | * have foo/bar which now does not exist; | |
2100 | * it is normal for the empty directory 'foo' | |
2101 | * to remain. | |
2102 | */ | |
dfefa935 | 2103 | ref_file = git_path("%s", orig_refname); |
5cc3cef9 JH |
2104 | if (remove_empty_directories(ref_file)) { |
2105 | last_errno = errno; | |
dfefa935 | 2106 | error("there are still refs under '%s'", orig_refname); |
5cc3cef9 JH |
2107 | goto error_return; |
2108 | } | |
8d68493f | 2109 | refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type); |
bc7127ef | 2110 | } |
68db31cc SV |
2111 | if (type_p) |
2112 | *type_p = type; | |
dfefa935 | 2113 | if (!refname) { |
5cc3cef9 | 2114 | last_errno = errno; |
818f477c | 2115 | error("unable to resolve reference %s: %s", |
dfefa935 | 2116 | orig_refname, strerror(errno)); |
5cc3cef9 | 2117 | goto error_return; |
4bd18c43 | 2118 | } |
5bdd8d4a | 2119 | missing = is_null_sha1(lock->old_sha1); |
c976d415 LH |
2120 | /* When the ref did not exist and we are creating it, |
2121 | * make sure there is no existing ref that is packed | |
2122 | * whose name begins with our refname, nor a ref whose | |
2123 | * name is a proper prefix of our refname. | |
2124 | */ | |
5bdd8d4a | 2125 | if (missing && |
9da31cb0 | 2126 | !is_refname_available(refname, NULL, get_packed_refs(&ref_cache))) { |
f475e08e | 2127 | last_errno = ENOTDIR; |
c976d415 | 2128 | goto error_return; |
f475e08e | 2129 | } |
22a3844e | 2130 | |
c33d5174 | 2131 | lock->lk = xcalloc(1, sizeof(struct lock_file)); |
4bd18c43 | 2132 | |
e5c223e9 | 2133 | lflags = 0; |
acd3b9ec | 2134 | if (flags & REF_NODEREF) { |
dfefa935 | 2135 | refname = orig_refname; |
acd3b9ec JH |
2136 | lflags |= LOCK_NODEREF; |
2137 | } | |
dfefa935 MH |
2138 | lock->ref_name = xstrdup(refname); |
2139 | lock->orig_ref_name = xstrdup(orig_refname); | |
2140 | ref_file = git_path("%s", refname); | |
5bdd8d4a | 2141 | if (missing) |
68db31cc SV |
2142 | lock->force_write = 1; |
2143 | if ((flags & REF_NODEREF) && (type & REF_ISSYMREF)) | |
2144 | lock->force_write = 1; | |
4bd18c43 | 2145 | |
c4c61c76 MH |
2146 | retry: |
2147 | switch (safe_create_leading_directories(ref_file)) { | |
2148 | case SCLD_OK: | |
2149 | break; /* success */ | |
2150 | case SCLD_VANISHED: | |
2151 | if (--attempts_remaining > 0) | |
2152 | goto retry; | |
2153 | /* fall through */ | |
2154 | default: | |
5cc3cef9 JH |
2155 | last_errno = errno; |
2156 | error("unable to create directory for %s", ref_file); | |
2157 | goto error_return; | |
2158 | } | |
4bd18c43 | 2159 | |
acd3b9ec | 2160 | lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags); |
e5c223e9 MH |
2161 | if (lock->lock_fd < 0) { |
2162 | if (errno == ENOENT && --attempts_remaining > 0) | |
2163 | /* | |
2164 | * Maybe somebody just deleted one of the | |
2165 | * directories leading to ref_file. Try | |
2166 | * again: | |
2167 | */ | |
2168 | goto retry; | |
2169 | else | |
2170 | unable_to_lock_index_die(ref_file, errno); | |
2171 | } | |
4bd18c43 | 2172 | return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock; |
5cc3cef9 JH |
2173 | |
2174 | error_return: | |
2175 | unlock_ref(lock); | |
2176 | errno = last_errno; | |
2177 | return NULL; | |
4bd18c43 SP |
2178 | } |
2179 | ||
dfefa935 | 2180 | struct ref_lock *lock_any_ref_for_update(const char *refname, |
9bbb0fa1 BK |
2181 | const unsigned char *old_sha1, |
2182 | int flags, int *type_p) | |
4bd18c43 | 2183 | { |
dfefa935 | 2184 | if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) |
257f3020 | 2185 | return NULL; |
9bbb0fa1 | 2186 | return lock_ref_sha1_basic(refname, old_sha1, flags, type_p); |
c0277d15 JH |
2187 | } |
2188 | ||
fec3137f MH |
2189 | /* |
2190 | * Write an entry to the packed-refs file for the specified refname. | |
2191 | * If peeled is non-NULL, write it as the entry's peeled value. | |
2192 | */ | |
2193 | static void write_packed_entry(int fd, char *refname, unsigned char *sha1, | |
2194 | unsigned char *peeled) | |
d66da478 | 2195 | { |
d66da478 MH |
2196 | char line[PATH_MAX + 100]; |
2197 | int len; | |
2198 | ||
d66da478 MH |
2199 | len = snprintf(line, sizeof(line), "%s %s\n", |
2200 | sha1_to_hex(sha1), refname); | |
2201 | /* this should not happen but just being defensive */ | |
2202 | if (len > sizeof(line)) | |
2203 | die("too long a refname '%s'", refname); | |
fec3137f MH |
2204 | write_or_die(fd, line, len); |
2205 | ||
2206 | if (peeled) { | |
2207 | if (snprintf(line, sizeof(line), "^%s\n", | |
2208 | sha1_to_hex(peeled)) != PEELED_LINE_LENGTH) | |
2209 | die("internal error"); | |
2210 | write_or_die(fd, line, PEELED_LINE_LENGTH); | |
2211 | } | |
2212 | } | |
2213 | ||
7b40d396 MH |
2214 | /* |
2215 | * An each_ref_entry_fn that writes the entry to a packed-refs file. | |
2216 | */ | |
2217 | static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data) | |
2218 | { | |
2219 | int *fd = cb_data; | |
2220 | enum peel_status peel_status = peel_entry(entry, 0); | |
2221 | ||
2222 | if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG) | |
2223 | error("internal error: %s is not a valid packed reference!", | |
2224 | entry->name); | |
2225 | write_packed_entry(*fd, entry->name, entry->u.value.sha1, | |
2226 | peel_status == PEEL_PEELED ? | |
2227 | entry->u.value.peeled : NULL); | |
2228 | return 0; | |
2229 | } | |
2230 | ||
447ff1bf | 2231 | /* This should return a meaningful errno on failure */ |
9f69d297 MH |
2232 | int lock_packed_refs(int flags) |
2233 | { | |
2234 | struct packed_ref_cache *packed_ref_cache; | |
2235 | ||
9f69d297 MH |
2236 | if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0) |
2237 | return -1; | |
5d478f5c MH |
2238 | /* |
2239 | * Get the current packed-refs while holding the lock. If the | |
2240 | * packed-refs file has been modified since we last read it, | |
2241 | * this will automatically invalidate the cache and re-read | |
2242 | * the packed-refs file. | |
2243 | */ | |
9f69d297 MH |
2244 | packed_ref_cache = get_packed_ref_cache(&ref_cache); |
2245 | packed_ref_cache->lock = &packlock; | |
4f6b83e3 MH |
2246 | /* Increment the reference count to prevent it from being freed: */ |
2247 | acquire_packed_ref_cache(packed_ref_cache); | |
9f69d297 MH |
2248 | return 0; |
2249 | } | |
2250 | ||
d3f66555 RS |
2251 | /* |
2252 | * Commit the packed refs changes. | |
2253 | * On error we must make sure that errno contains a meaningful value. | |
2254 | */ | |
9f69d297 MH |
2255 | int commit_packed_refs(void) |
2256 | { | |
2257 | struct packed_ref_cache *packed_ref_cache = | |
2258 | get_packed_ref_cache(&ref_cache); | |
2259 | int error = 0; | |
d3f66555 | 2260 | int save_errno = 0; |
9f69d297 MH |
2261 | |
2262 | if (!packed_ref_cache->lock) | |
2263 | die("internal error: packed-refs not locked"); | |
2264 | write_or_die(packed_ref_cache->lock->fd, | |
2265 | PACKED_REFS_HEADER, strlen(PACKED_REFS_HEADER)); | |
2266 | ||
2267 | do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache), | |
2268 | 0, write_packed_entry_fn, | |
2269 | &packed_ref_cache->lock->fd); | |
d3f66555 RS |
2270 | if (commit_lock_file(packed_ref_cache->lock)) { |
2271 | save_errno = errno; | |
9f69d297 | 2272 | error = -1; |
d3f66555 | 2273 | } |
9f69d297 | 2274 | packed_ref_cache->lock = NULL; |
4f6b83e3 | 2275 | release_packed_ref_cache(packed_ref_cache); |
d3f66555 | 2276 | errno = save_errno; |
9f69d297 MH |
2277 | return error; |
2278 | } | |
2279 | ||
2280 | void rollback_packed_refs(void) | |
2281 | { | |
2282 | struct packed_ref_cache *packed_ref_cache = | |
2283 | get_packed_ref_cache(&ref_cache); | |
2284 | ||
2285 | if (!packed_ref_cache->lock) | |
2286 | die("internal error: packed-refs not locked"); | |
2287 | rollback_lock_file(packed_ref_cache->lock); | |
2288 | packed_ref_cache->lock = NULL; | |
4f6b83e3 | 2289 | release_packed_ref_cache(packed_ref_cache); |
9f69d297 MH |
2290 | clear_packed_ref_cache(&ref_cache); |
2291 | } | |
2292 | ||
32d462ce MH |
2293 | struct ref_to_prune { |
2294 | struct ref_to_prune *next; | |
2295 | unsigned char sha1[20]; | |
2296 | char name[FLEX_ARRAY]; | |
2297 | }; | |
2298 | ||
2299 | struct pack_refs_cb_data { | |
2300 | unsigned int flags; | |
267f9a8c | 2301 | struct ref_dir *packed_refs; |
32d462ce | 2302 | struct ref_to_prune *ref_to_prune; |
32d462ce MH |
2303 | }; |
2304 | ||
267f9a8c MH |
2305 | /* |
2306 | * An each_ref_entry_fn that is run over loose references only. If | |
2307 | * the loose reference can be packed, add an entry in the packed ref | |
2308 | * cache. If the reference should be pruned, also add it to | |
2309 | * ref_to_prune in the pack_refs_cb_data. | |
2310 | */ | |
2311 | static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data) | |
32d462ce MH |
2312 | { |
2313 | struct pack_refs_cb_data *cb = cb_data; | |
f85354b5 | 2314 | enum peel_status peel_status; |
267f9a8c | 2315 | struct ref_entry *packed_entry; |
59556548 | 2316 | int is_tag_ref = starts_with(entry->name, "refs/tags/"); |
32d462ce | 2317 | |
267f9a8c MH |
2318 | /* ALWAYS pack tags */ |
2319 | if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref) | |
32d462ce MH |
2320 | return 0; |
2321 | ||
b2a8226d MH |
2322 | /* Do not pack symbolic or broken refs: */ |
2323 | if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry)) | |
2324 | return 0; | |
2325 | ||
267f9a8c | 2326 | /* Add a packed ref cache entry equivalent to the loose entry. */ |
f85354b5 | 2327 | peel_status = peel_entry(entry, 1); |
0f29920f | 2328 | if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG) |
f85354b5 MH |
2329 | die("internal error peeling reference %s (%s)", |
2330 | entry->name, sha1_to_hex(entry->u.value.sha1)); | |
267f9a8c MH |
2331 | packed_entry = find_ref(cb->packed_refs, entry->name); |
2332 | if (packed_entry) { | |
2333 | /* Overwrite existing packed entry with info from loose entry */ | |
2334 | packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED; | |
2335 | hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1); | |
2336 | } else { | |
2337 | packed_entry = create_ref_entry(entry->name, entry->u.value.sha1, | |
2338 | REF_ISPACKED | REF_KNOWS_PEELED, 0); | |
2339 | add_ref(cb->packed_refs, packed_entry); | |
2340 | } | |
2341 | hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled); | |
32d462ce | 2342 | |
267f9a8c MH |
2343 | /* Schedule the loose reference for pruning if requested. */ |
2344 | if ((cb->flags & PACK_REFS_PRUNE)) { | |
12e77559 | 2345 | int namelen = strlen(entry->name) + 1; |
32d462ce | 2346 | struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen); |
12e77559 MH |
2347 | hashcpy(n->sha1, entry->u.value.sha1); |
2348 | strcpy(n->name, entry->name); | |
32d462ce MH |
2349 | n->next = cb->ref_to_prune; |
2350 | cb->ref_to_prune = n; | |
2351 | } | |
d66da478 MH |
2352 | return 0; |
2353 | } | |
2354 | ||
32d462ce MH |
2355 | /* |
2356 | * Remove empty parents, but spare refs/ and immediate subdirs. | |
2357 | * Note: munges *name. | |
2358 | */ | |
2359 | static void try_remove_empty_parents(char *name) | |
2360 | { | |
2361 | char *p, *q; | |
2362 | int i; | |
2363 | p = name; | |
2364 | for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */ | |
2365 | while (*p && *p != '/') | |
2366 | p++; | |
2367 | /* tolerate duplicate slashes; see check_refname_format() */ | |
2368 | while (*p == '/') | |
2369 | p++; | |
2370 | } | |
2371 | for (q = p; *q; q++) | |
2372 | ; | |
2373 | while (1) { | |
2374 | while (q > p && *q != '/') | |
2375 | q--; | |
2376 | while (q > p && *(q-1) == '/') | |
2377 | q--; | |
2378 | if (q == p) | |
2379 | break; | |
2380 | *q = '\0'; | |
2381 | if (rmdir(git_path("%s", name))) | |
2382 | break; | |
2383 | } | |
2384 | } | |
2385 | ||
2386 | /* make sure nobody touched the ref, and unlink */ | |
2387 | static void prune_ref(struct ref_to_prune *r) | |
2388 | { | |
029cdb4a RS |
2389 | struct ref_transaction *transaction; |
2390 | struct strbuf err = STRBUF_INIT; | |
32d462ce | 2391 | |
88e7dff9 | 2392 | if (check_refname_format(r->name, 0)) |
cba12021 | 2393 | return; |
32d462ce | 2394 | |
029cdb4a RS |
2395 | transaction = ref_transaction_begin(&err); |
2396 | if (!transaction || | |
2397 | ref_transaction_delete(transaction, r->name, r->sha1, | |
2398 | REF_ISPRUNING, 1, &err) || | |
2399 | ref_transaction_commit(transaction, NULL, &err)) { | |
2400 | ref_transaction_free(transaction); | |
2401 | error("%s", err.buf); | |
2402 | strbuf_release(&err); | |
2403 | return; | |
32d462ce | 2404 | } |
029cdb4a RS |
2405 | ref_transaction_free(transaction); |
2406 | strbuf_release(&err); | |
2407 | try_remove_empty_parents(r->name); | |
32d462ce MH |
2408 | } |
2409 | ||
2410 | static void prune_refs(struct ref_to_prune *r) | |
2411 | { | |
2412 | while (r) { | |
2413 | prune_ref(r); | |
2414 | r = r->next; | |
2415 | } | |
2416 | } | |
2417 | ||
32d462ce MH |
2418 | int pack_refs(unsigned int flags) |
2419 | { | |
32d462ce MH |
2420 | struct pack_refs_cb_data cbdata; |
2421 | ||
2422 | memset(&cbdata, 0, sizeof(cbdata)); | |
2423 | cbdata.flags = flags; | |
2424 | ||
9f69d297 | 2425 | lock_packed_refs(LOCK_DIE_ON_ERROR); |
267f9a8c | 2426 | cbdata.packed_refs = get_packed_refs(&ref_cache); |
32d462ce | 2427 | |
267f9a8c MH |
2428 | do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0, |
2429 | pack_if_possible_fn, &cbdata); | |
32d462ce | 2430 | |
9f69d297 | 2431 | if (commit_packed_refs()) |
32d462ce | 2432 | die_errno("unable to overwrite old ref-pack file"); |
9f69d297 | 2433 | |
32d462ce MH |
2434 | prune_refs(cbdata.ref_to_prune); |
2435 | return 0; | |
2436 | } | |
2437 | ||
7b40d396 MH |
2438 | /* |
2439 | * If entry is no longer needed in packed-refs, add it to the string | |
2440 | * list pointed to by cb_data. Reasons for deleting entries: | |
2441 | * | |
2442 | * - Entry is broken. | |
2443 | * - Entry is overridden by a loose ref. | |
2444 | * - Entry does not point at a valid object. | |
2445 | * | |
2446 | * In the first and third cases, also emit an error message because these | |
2447 | * are indications of repository corruption. | |
2448 | */ | |
2449 | static int curate_packed_ref_fn(struct ref_entry *entry, void *cb_data) | |
c0277d15 | 2450 | { |
7b40d396 | 2451 | struct string_list *refs_to_delete = cb_data; |
fec3137f | 2452 | |
ab292bc4 MH |
2453 | if (entry->flag & REF_ISBROKEN) { |
2454 | /* This shouldn't happen to packed refs. */ | |
2455 | error("%s is broken!", entry->name); | |
7b40d396 | 2456 | string_list_append(refs_to_delete, entry->name); |
c0277d15 | 2457 | return 0; |
ab292bc4 MH |
2458 | } |
2459 | if (!has_sha1_file(entry->u.value.sha1)) { | |
2460 | unsigned char sha1[20]; | |
2461 | int flags; | |
2462 | ||
2463 | if (read_ref_full(entry->name, sha1, 0, &flags)) | |
2464 | /* We should at least have found the packed ref. */ | |
2465 | die("Internal error"); | |
7b40d396 | 2466 | if ((flags & REF_ISSYMREF) || !(flags & REF_ISPACKED)) { |
ab292bc4 MH |
2467 | /* |
2468 | * This packed reference is overridden by a | |
2469 | * loose reference, so it is OK that its value | |
2470 | * is no longer valid; for example, it might | |
2471 | * refer to an object that has been garbage | |
2472 | * collected. For this purpose we don't even | |
2473 | * care whether the loose reference itself is | |
2474 | * invalid, broken, symbolic, etc. Silently | |
7b40d396 | 2475 | * remove the packed reference. |
ab292bc4 | 2476 | */ |
7b40d396 | 2477 | string_list_append(refs_to_delete, entry->name); |
ab292bc4 | 2478 | return 0; |
7b40d396 | 2479 | } |
ab292bc4 MH |
2480 | /* |
2481 | * There is no overriding loose reference, so the fact | |
2482 | * that this reference doesn't refer to a valid object | |
2483 | * indicates some kind of repository corruption. | |
2484 | * Report the problem, then omit the reference from | |
2485 | * the output. | |
2486 | */ | |
2487 | error("%s does not point to a valid object!", entry->name); | |
7b40d396 | 2488 | string_list_append(refs_to_delete, entry->name); |
ab292bc4 MH |
2489 | return 0; |
2490 | } | |
2491 | ||
d66da478 MH |
2492 | return 0; |
2493 | } | |
2494 | ||
60bca085 | 2495 | int repack_without_refs(const char **refnames, int n, struct strbuf *err) |
c0277d15 | 2496 | { |
7618fd80 | 2497 | struct ref_dir *packed; |
7b40d396 MH |
2498 | struct string_list refs_to_delete = STRING_LIST_INIT_DUP; |
2499 | struct string_list_item *ref_to_delete; | |
60bca085 | 2500 | int i, ret, removed = 0; |
61cee0db BK |
2501 | |
2502 | /* Look for a packed ref */ | |
2503 | for (i = 0; i < n; i++) | |
2504 | if (get_packed_ref(refnames[i])) | |
2505 | break; | |
7618fd80 | 2506 | |
61cee0db BK |
2507 | /* Avoid locking if we have nothing to do */ |
2508 | if (i == n) | |
2509 | return 0; /* no refname exists in packed refs */ | |
7618fd80 | 2510 | |
9f69d297 | 2511 | if (lock_packed_refs(0)) { |
60bca085 RS |
2512 | if (err) { |
2513 | unable_to_lock_message(git_path("packed-refs"), errno, | |
2514 | err); | |
2515 | return -1; | |
2516 | } | |
1b018fd9 | 2517 | unable_to_lock_error(git_path("packed-refs"), errno); |
61cee0db | 2518 | return error("cannot delete '%s' from packed refs", refnames[i]); |
1b018fd9 | 2519 | } |
9da31cb0 | 2520 | packed = get_packed_refs(&ref_cache); |
7b40d396 | 2521 | |
61cee0db BK |
2522 | /* Remove refnames from the cache */ |
2523 | for (i = 0; i < n; i++) | |
2524 | if (remove_entry(packed, refnames[i]) != -1) | |
2525 | removed = 1; | |
2526 | if (!removed) { | |
506a760d | 2527 | /* |
61cee0db | 2528 | * All packed entries disappeared while we were |
506a760d MH |
2529 | * acquiring the lock. |
2530 | */ | |
9f69d297 | 2531 | rollback_packed_refs(); |
506a760d MH |
2532 | return 0; |
2533 | } | |
7b40d396 | 2534 | |
61cee0db | 2535 | /* Remove any other accumulated cruft */ |
7b40d396 MH |
2536 | do_for_each_entry_in_dir(packed, 0, curate_packed_ref_fn, &refs_to_delete); |
2537 | for_each_string_list_item(ref_to_delete, &refs_to_delete) { | |
2538 | if (remove_entry(packed, ref_to_delete->string) == -1) | |
2539 | die("internal error"); | |
2540 | } | |
2541 | ||
61cee0db | 2542 | /* Write what remains */ |
60bca085 RS |
2543 | ret = commit_packed_refs(); |
2544 | if (ret && err) | |
2545 | strbuf_addf(err, "unable to overwrite old ref-pack file: %s", | |
2546 | strerror(errno)); | |
2547 | return ret; | |
c0277d15 JH |
2548 | } |
2549 | ||
2ddb5d17 BK |
2550 | static int delete_ref_loose(struct ref_lock *lock, int flag) |
2551 | { | |
045a476f | 2552 | if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) { |
c0277d15 | 2553 | /* loose */ |
2ddb5d17 BK |
2554 | int err, i = strlen(lock->lk->filename) - 5; /* .lock */ |
2555 | ||
547d058f RS |
2556 | lock->lk->filename[i] = 0; |
2557 | err = unlink_or_warn(lock->lk->filename); | |
547d058f | 2558 | lock->lk->filename[i] = '.'; |
2ddb5d17 BK |
2559 | if (err && errno != ENOENT) |
2560 | return 1; | |
c0277d15 | 2561 | } |
2ddb5d17 BK |
2562 | return 0; |
2563 | } | |
2564 | ||
eca35a25 | 2565 | int delete_ref(const char *refname, const unsigned char *sha1, int delopt) |
c0277d15 | 2566 | { |
7521cc46 RS |
2567 | struct ref_transaction *transaction; |
2568 | struct strbuf err = STRBUF_INIT; | |
c0277d15 | 2569 | |
7521cc46 RS |
2570 | transaction = ref_transaction_begin(&err); |
2571 | if (!transaction || | |
2572 | ref_transaction_delete(transaction, refname, sha1, delopt, | |
2573 | sha1 && !is_null_sha1(sha1), &err) || | |
2574 | ref_transaction_commit(transaction, NULL, &err)) { | |
2575 | error("%s", err.buf); | |
2576 | ref_transaction_free(transaction); | |
2577 | strbuf_release(&err); | |
c0277d15 | 2578 | return 1; |
7521cc46 RS |
2579 | } |
2580 | ref_transaction_free(transaction); | |
2581 | strbuf_release(&err); | |
2582 | return 0; | |
4bd18c43 SP |
2583 | } |
2584 | ||
765c2258 PH |
2585 | /* |
2586 | * People using contrib's git-new-workdir have .git/logs/refs -> | |
2587 | * /some/other/path/.git/logs/refs, and that may live on another device. | |
2588 | * | |
2589 | * IOW, to avoid cross device rename errors, the temporary renamed log must | |
2590 | * live into logs/refs. | |
2591 | */ | |
2592 | #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log" | |
2593 | ||
fa59ae79 MH |
2594 | static int rename_tmp_log(const char *newrefname) |
2595 | { | |
f1e9e9a4 | 2596 | int attempts_remaining = 4; |
ae4a283e MH |
2597 | |
2598 | retry: | |
08f555cb MH |
2599 | switch (safe_create_leading_directories(git_path("logs/%s", newrefname))) { |
2600 | case SCLD_OK: | |
2601 | break; /* success */ | |
2602 | case SCLD_VANISHED: | |
2603 | if (--attempts_remaining > 0) | |
2604 | goto retry; | |
2605 | /* fall through */ | |
2606 | default: | |
fa59ae79 MH |
2607 | error("unable to create directory for %s", newrefname); |
2608 | return -1; | |
2609 | } | |
2610 | ||
fa59ae79 | 2611 | if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) { |
f1e9e9a4 | 2612 | if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) { |
fa59ae79 MH |
2613 | /* |
2614 | * rename(a, b) when b is an existing | |
2615 | * directory ought to result in ISDIR, but | |
2616 | * Solaris 5.8 gives ENOTDIR. Sheesh. | |
2617 | */ | |
2618 | if (remove_empty_directories(git_path("logs/%s", newrefname))) { | |
2619 | error("Directory not empty: logs/%s", newrefname); | |
2620 | return -1; | |
2621 | } | |
2622 | goto retry; | |
ae4a283e MH |
2623 | } else if (errno == ENOENT && --attempts_remaining > 0) { |
2624 | /* | |
2625 | * Maybe another process just deleted one of | |
2626 | * the directories in the path to newrefname. | |
2627 | * Try again from the beginning. | |
2628 | */ | |
2629 | goto retry; | |
fa59ae79 MH |
2630 | } else { |
2631 | error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s", | |
2632 | newrefname, strerror(errno)); | |
2633 | return -1; | |
2634 | } | |
2635 | } | |
2636 | return 0; | |
2637 | } | |
2638 | ||
dfefa935 | 2639 | int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg) |
c976d415 | 2640 | { |
c976d415 LH |
2641 | unsigned char sha1[20], orig_sha1[20]; |
2642 | int flag = 0, logmoved = 0; | |
2643 | struct ref_lock *lock; | |
c976d415 | 2644 | struct stat loginfo; |
dfefa935 | 2645 | int log = !lstat(git_path("logs/%s", oldrefname), &loginfo); |
eca35a25 | 2646 | const char *symref = NULL; |
c976d415 | 2647 | |
450d4c0f | 2648 | if (log && S_ISLNK(loginfo.st_mode)) |
dfefa935 | 2649 | return error("reflog for %s is a symlink", oldrefname); |
c976d415 | 2650 | |
8d68493f | 2651 | symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag); |
eca35a25 | 2652 | if (flag & REF_ISSYMREF) |
fa58186c | 2653 | return error("refname %s is a symbolic ref, renaming it is not supported", |
dfefa935 | 2654 | oldrefname); |
eca35a25 | 2655 | if (!symref) |
dfefa935 | 2656 | return error("refname %s not found", oldrefname); |
c976d415 | 2657 | |
9da31cb0 | 2658 | if (!is_refname_available(newrefname, oldrefname, get_packed_refs(&ref_cache))) |
c976d415 LH |
2659 | return 1; |
2660 | ||
9da31cb0 | 2661 | if (!is_refname_available(newrefname, oldrefname, get_loose_refs(&ref_cache))) |
c976d415 LH |
2662 | return 1; |
2663 | ||
dfefa935 | 2664 | if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG))) |
765c2258 | 2665 | return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s", |
dfefa935 | 2666 | oldrefname, strerror(errno)); |
c976d415 | 2667 | |
dfefa935 MH |
2668 | if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) { |
2669 | error("unable to delete old %s", oldrefname); | |
c976d415 LH |
2670 | goto rollback; |
2671 | } | |
2672 | ||
dfefa935 MH |
2673 | if (!read_ref_full(newrefname, sha1, 1, &flag) && |
2674 | delete_ref(newrefname, sha1, REF_NODEREF)) { | |
c976d415 | 2675 | if (errno==EISDIR) { |
dfefa935 MH |
2676 | if (remove_empty_directories(git_path("%s", newrefname))) { |
2677 | error("Directory not empty: %s", newrefname); | |
c976d415 LH |
2678 | goto rollback; |
2679 | } | |
2680 | } else { | |
dfefa935 | 2681 | error("unable to delete existing %s", newrefname); |
c976d415 LH |
2682 | goto rollback; |
2683 | } | |
2684 | } | |
2685 | ||
fa59ae79 | 2686 | if (log && rename_tmp_log(newrefname)) |
c976d415 | 2687 | goto rollback; |
c976d415 | 2688 | |
c976d415 LH |
2689 | logmoved = log; |
2690 | ||
dfefa935 | 2691 | lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL); |
c976d415 | 2692 | if (!lock) { |
dfefa935 | 2693 | error("unable to lock %s for update", newrefname); |
c976d415 LH |
2694 | goto rollback; |
2695 | } | |
c976d415 LH |
2696 | lock->force_write = 1; |
2697 | hashcpy(lock->old_sha1, orig_sha1); | |
678d0f4c | 2698 | if (write_ref_sha1(lock, orig_sha1, logmsg)) { |
dfefa935 | 2699 | error("unable to write current sha1 into %s", newrefname); |
c976d415 LH |
2700 | goto rollback; |
2701 | } | |
2702 | ||
2703 | return 0; | |
2704 | ||
2705 | rollback: | |
dfefa935 | 2706 | lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL); |
c976d415 | 2707 | if (!lock) { |
dfefa935 | 2708 | error("unable to lock %s for rollback", oldrefname); |
c976d415 LH |
2709 | goto rollbacklog; |
2710 | } | |
2711 | ||
2712 | lock->force_write = 1; | |
2713 | flag = log_all_ref_updates; | |
2714 | log_all_ref_updates = 0; | |
2715 | if (write_ref_sha1(lock, orig_sha1, NULL)) | |
dfefa935 | 2716 | error("unable to write current sha1 into %s", oldrefname); |
c976d415 LH |
2717 | log_all_ref_updates = flag; |
2718 | ||
2719 | rollbacklog: | |
dfefa935 | 2720 | if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname))) |
c976d415 | 2721 | error("unable to restore logfile %s from %s: %s", |
dfefa935 | 2722 | oldrefname, newrefname, strerror(errno)); |
c976d415 | 2723 | if (!logmoved && log && |
dfefa935 | 2724 | rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname))) |
765c2258 | 2725 | error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s", |
dfefa935 | 2726 | oldrefname, strerror(errno)); |
c976d415 LH |
2727 | |
2728 | return 1; | |
2729 | } | |
2730 | ||
435fc852 | 2731 | int close_ref(struct ref_lock *lock) |
b531394d BC |
2732 | { |
2733 | if (close_lock_file(lock->lk)) | |
2734 | return -1; | |
2735 | lock->lock_fd = -1; | |
2736 | return 0; | |
2737 | } | |
2738 | ||
435fc852 | 2739 | int commit_ref(struct ref_lock *lock) |
b531394d BC |
2740 | { |
2741 | if (commit_lock_file(lock->lk)) | |
2742 | return -1; | |
2743 | lock->lock_fd = -1; | |
2744 | return 0; | |
2745 | } | |
2746 | ||
e5f38ec3 | 2747 | void unlock_ref(struct ref_lock *lock) |
4bd18c43 | 2748 | { |
4ed7cd3a BC |
2749 | /* Do not free lock->lk -- atexit() still looks at them */ |
2750 | if (lock->lk) | |
2751 | rollback_lock_file(lock->lk); | |
434cd0cd | 2752 | free(lock->ref_name); |
1655707c | 2753 | free(lock->orig_ref_name); |
4bd18c43 SP |
2754 | free(lock); |
2755 | } | |
2756 | ||
0ec29a47 JH |
2757 | /* |
2758 | * copy the reflog message msg to buf, which has been allocated sufficiently | |
2759 | * large, while cleaning up the whitespaces. Especially, convert LF to space, | |
2760 | * because reflog file is one line per entry. | |
2761 | */ | |
2762 | static int copy_msg(char *buf, const char *msg) | |
2763 | { | |
2764 | char *cp = buf; | |
2765 | char c; | |
2766 | int wasspace = 1; | |
2767 | ||
2768 | *cp++ = '\t'; | |
2769 | while ((c = *msg++)) { | |
2770 | if (wasspace && isspace(c)) | |
2771 | continue; | |
2772 | wasspace = isspace(c); | |
2773 | if (wasspace) | |
2774 | c = ' '; | |
2775 | *cp++ = c; | |
2776 | } | |
2777 | while (buf < cp && isspace(cp[-1])) | |
2778 | cp--; | |
2779 | *cp++ = '\n'; | |
2780 | return cp - buf; | |
2781 | } | |
2782 | ||
bd3b02da | 2783 | /* This function must set a meaningful errno on failure */ |
dfefa935 | 2784 | int log_ref_setup(const char *refname, char *logfile, int bufsize) |
6de08ae6 | 2785 | { |
859c3017 | 2786 | int logfd, oflags = O_APPEND | O_WRONLY; |
9a13f0b7 | 2787 | |
dfefa935 | 2788 | git_snpath(logfile, bufsize, "logs/%s", refname); |
4057deb5 | 2789 | if (log_all_ref_updates && |
59556548 CC |
2790 | (starts_with(refname, "refs/heads/") || |
2791 | starts_with(refname, "refs/remotes/") || | |
2792 | starts_with(refname, "refs/notes/") || | |
dfefa935 | 2793 | !strcmp(refname, "HEAD"))) { |
bd3b02da RS |
2794 | if (safe_create_leading_directories(logfile) < 0) { |
2795 | int save_errno = errno; | |
2796 | error("unable to create directory for %s", logfile); | |
2797 | errno = save_errno; | |
2798 | return -1; | |
2799 | } | |
6de08ae6 SP |
2800 | oflags |= O_CREAT; |
2801 | } | |
2802 | ||
157aaea5 | 2803 | logfd = open(logfile, oflags, 0666); |
6de08ae6 | 2804 | if (logfd < 0) { |
1974bf62 | 2805 | if (!(oflags & O_CREAT) && errno == ENOENT) |
6de08ae6 | 2806 | return 0; |
3b463c3f JH |
2807 | |
2808 | if ((oflags & O_CREAT) && errno == EISDIR) { | |
157aaea5 | 2809 | if (remove_empty_directories(logfile)) { |
bd3b02da RS |
2810 | int save_errno = errno; |
2811 | error("There are still logs under '%s'", | |
2812 | logfile); | |
2813 | errno = save_errno; | |
2814 | return -1; | |
3b463c3f | 2815 | } |
157aaea5 | 2816 | logfd = open(logfile, oflags, 0666); |
3b463c3f JH |
2817 | } |
2818 | ||
bd3b02da RS |
2819 | if (logfd < 0) { |
2820 | int save_errno = errno; | |
2821 | error("Unable to append to %s: %s", logfile, | |
2822 | strerror(errno)); | |
2823 | errno = save_errno; | |
2824 | return -1; | |
2825 | } | |
6de08ae6 SP |
2826 | } |
2827 | ||
157aaea5 | 2828 | adjust_shared_perm(logfile); |
859c3017 EM |
2829 | close(logfd); |
2830 | return 0; | |
2831 | } | |
443b92b6 | 2832 | |
dfefa935 | 2833 | static int log_ref_write(const char *refname, const unsigned char *old_sha1, |
859c3017 EM |
2834 | const unsigned char *new_sha1, const char *msg) |
2835 | { | |
2836 | int logfd, result, written, oflags = O_APPEND | O_WRONLY; | |
2837 | unsigned maxlen, len; | |
2838 | int msglen; | |
157aaea5 | 2839 | char log_file[PATH_MAX]; |
859c3017 EM |
2840 | char *logrec; |
2841 | const char *committer; | |
2842 | ||
2843 | if (log_all_ref_updates < 0) | |
2844 | log_all_ref_updates = !is_bare_repository(); | |
2845 | ||
dfefa935 | 2846 | result = log_ref_setup(refname, log_file, sizeof(log_file)); |
859c3017 EM |
2847 | if (result) |
2848 | return result; | |
2849 | ||
2850 | logfd = open(log_file, oflags); | |
2851 | if (logfd < 0) | |
2852 | return 0; | |
0ec29a47 | 2853 | msglen = msg ? strlen(msg) : 0; |
774751a8 | 2854 | committer = git_committer_info(0); |
8ac65937 JH |
2855 | maxlen = strlen(committer) + msglen + 100; |
2856 | logrec = xmalloc(maxlen); | |
2857 | len = sprintf(logrec, "%s %s %s\n", | |
9a13f0b7 NP |
2858 | sha1_to_hex(old_sha1), |
2859 | sha1_to_hex(new_sha1), | |
8ac65937 JH |
2860 | committer); |
2861 | if (msglen) | |
0ec29a47 | 2862 | len += copy_msg(logrec + len - 1, msg) - 1; |
93822c22 | 2863 | written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1; |
6de08ae6 | 2864 | free(logrec); |
dc615de8 RS |
2865 | if (written != len) { |
2866 | int save_errno = errno; | |
2867 | close(logfd); | |
2868 | error("Unable to append to %s", log_file); | |
2869 | errno = save_errno; | |
2870 | return -1; | |
2871 | } | |
2872 | if (close(logfd)) { | |
2873 | int save_errno = errno; | |
2874 | error("Unable to append to %s", log_file); | |
2875 | errno = save_errno; | |
2876 | return -1; | |
2877 | } | |
6de08ae6 SP |
2878 | return 0; |
2879 | } | |
2880 | ||
e7e0f26e | 2881 | int is_branch(const char *refname) |
c3b0dec5 | 2882 | { |
59556548 | 2883 | return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/"); |
c3b0dec5 LT |
2884 | } |
2885 | ||
dc615de8 | 2886 | /* This function must return a meaningful errno */ |
4bd18c43 SP |
2887 | int write_ref_sha1(struct ref_lock *lock, |
2888 | const unsigned char *sha1, const char *logmsg) | |
2889 | { | |
2890 | static char term = '\n'; | |
c3b0dec5 | 2891 | struct object *o; |
4bd18c43 | 2892 | |
dc615de8 RS |
2893 | if (!lock) { |
2894 | errno = EINVAL; | |
95fc7512 | 2895 | return -1; |
dc615de8 | 2896 | } |
a89fccd2 | 2897 | if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) { |
4bd18c43 SP |
2898 | unlock_ref(lock); |
2899 | return 0; | |
95fc7512 | 2900 | } |
c3b0dec5 LT |
2901 | o = parse_object(sha1); |
2902 | if (!o) { | |
7be8b3ba | 2903 | error("Trying to write ref %s with nonexistent object %s", |
c3b0dec5 LT |
2904 | lock->ref_name, sha1_to_hex(sha1)); |
2905 | unlock_ref(lock); | |
dc615de8 | 2906 | errno = EINVAL; |
c3b0dec5 LT |
2907 | return -1; |
2908 | } | |
2909 | if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) { | |
2910 | error("Trying to write non-commit object %s to branch %s", | |
2911 | sha1_to_hex(sha1), lock->ref_name); | |
2912 | unlock_ref(lock); | |
dc615de8 | 2913 | errno = EINVAL; |
c3b0dec5 LT |
2914 | return -1; |
2915 | } | |
93822c22 | 2916 | if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 || |
dc615de8 RS |
2917 | write_in_full(lock->lock_fd, &term, 1) != 1 || |
2918 | close_ref(lock) < 0) { | |
2919 | int save_errno = errno; | |
c33d5174 | 2920 | error("Couldn't write %s", lock->lk->filename); |
4bd18c43 | 2921 | unlock_ref(lock); |
dc615de8 | 2922 | errno = save_errno; |
4bd18c43 SP |
2923 | return -1; |
2924 | } | |
9da31cb0 | 2925 | clear_loose_ref_cache(&ref_cache); |
bd104db1 NP |
2926 | if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 || |
2927 | (strcmp(lock->ref_name, lock->orig_ref_name) && | |
2928 | log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) { | |
6de08ae6 SP |
2929 | unlock_ref(lock); |
2930 | return -1; | |
2931 | } | |
605fac8b NP |
2932 | if (strcmp(lock->orig_ref_name, "HEAD") != 0) { |
2933 | /* | |
2934 | * Special hack: If a branch is updated directly and HEAD | |
2935 | * points to it (may happen on the remote side of a push | |
2936 | * for example) then logically the HEAD reflog should be | |
2937 | * updated too. | |
2938 | * A generic solution implies reverse symref information, | |
2939 | * but finding all symrefs pointing to the given branch | |
2940 | * would be rather costly for this rare event (the direct | |
2941 | * update of a branch) to be worth it. So let's cheat and | |
2942 | * check with HEAD only which should cover 99% of all usage | |
2943 | * scenarios (even 100% of the default ones). | |
2944 | */ | |
2945 | unsigned char head_sha1[20]; | |
2946 | int head_flag; | |
2947 | const char *head_ref; | |
8cad4744 | 2948 | head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag); |
605fac8b NP |
2949 | if (head_ref && (head_flag & REF_ISSYMREF) && |
2950 | !strcmp(head_ref, lock->ref_name)) | |
2951 | log_ref_write("HEAD", lock->old_sha1, sha1, logmsg); | |
2952 | } | |
b531394d | 2953 | if (commit_ref(lock)) { |
434cd0cd | 2954 | error("Couldn't set %s", lock->ref_name); |
4bd18c43 SP |
2955 | unlock_ref(lock); |
2956 | return -1; | |
2957 | } | |
4bd18c43 SP |
2958 | unlock_ref(lock); |
2959 | return 0; | |
95fc7512 | 2960 | } |
d556fae2 | 2961 | |
8b5157e4 NP |
2962 | int create_symref(const char *ref_target, const char *refs_heads_master, |
2963 | const char *logmsg) | |
41b625b0 NP |
2964 | { |
2965 | const char *lockpath; | |
2966 | char ref[1000]; | |
2967 | int fd, len, written; | |
a4f34cbb | 2968 | char *git_HEAD = git_pathdup("%s", ref_target); |
8b5157e4 NP |
2969 | unsigned char old_sha1[20], new_sha1[20]; |
2970 | ||
2971 | if (logmsg && read_ref(ref_target, old_sha1)) | |
2972 | hashclr(old_sha1); | |
41b625b0 | 2973 | |
d48744d1 JH |
2974 | if (safe_create_leading_directories(git_HEAD) < 0) |
2975 | return error("unable to create directory for %s", git_HEAD); | |
2976 | ||
41b625b0 NP |
2977 | #ifndef NO_SYMLINK_HEAD |
2978 | if (prefer_symlink_refs) { | |
2979 | unlink(git_HEAD); | |
2980 | if (!symlink(refs_heads_master, git_HEAD)) | |
8b5157e4 | 2981 | goto done; |
41b625b0 NP |
2982 | fprintf(stderr, "no symlink - falling back to symbolic ref\n"); |
2983 | } | |
2984 | #endif | |
2985 | ||
2986 | len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master); | |
2987 | if (sizeof(ref) <= len) { | |
2988 | error("refname too long: %s", refs_heads_master); | |
47fc52e2 | 2989 | goto error_free_return; |
41b625b0 NP |
2990 | } |
2991 | lockpath = mkpath("%s.lock", git_HEAD); | |
2992 | fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666); | |
2993 | if (fd < 0) { | |
2994 | error("Unable to open %s for writing", lockpath); | |
47fc52e2 | 2995 | goto error_free_return; |
41b625b0 NP |
2996 | } |
2997 | written = write_in_full(fd, ref, len); | |
91c8d590 | 2998 | if (close(fd) != 0 || written != len) { |
41b625b0 | 2999 | error("Unable to write to %s", lockpath); |
47fc52e2 | 3000 | goto error_unlink_return; |
41b625b0 NP |
3001 | } |
3002 | if (rename(lockpath, git_HEAD) < 0) { | |
41b625b0 | 3003 | error("Unable to create %s", git_HEAD); |
47fc52e2 | 3004 | goto error_unlink_return; |
41b625b0 NP |
3005 | } |
3006 | if (adjust_shared_perm(git_HEAD)) { | |
41b625b0 | 3007 | error("Unable to fix permissions on %s", lockpath); |
47fc52e2 | 3008 | error_unlink_return: |
691f1a28 | 3009 | unlink_or_warn(lockpath); |
47fc52e2 JH |
3010 | error_free_return: |
3011 | free(git_HEAD); | |
3012 | return -1; | |
41b625b0 | 3013 | } |
8b5157e4 | 3014 | |
ee96d11b | 3015 | #ifndef NO_SYMLINK_HEAD |
8b5157e4 | 3016 | done: |
ee96d11b | 3017 | #endif |
8b5157e4 NP |
3018 | if (logmsg && !read_ref(refs_heads_master, new_sha1)) |
3019 | log_ref_write(ref_target, old_sha1, new_sha1, logmsg); | |
3020 | ||
47fc52e2 | 3021 | free(git_HEAD); |
41b625b0 NP |
3022 | return 0; |
3023 | } | |
3024 | ||
4207ed28 RS |
3025 | struct read_ref_at_cb { |
3026 | const char *refname; | |
3027 | unsigned long at_time; | |
3028 | int cnt; | |
3029 | int reccnt; | |
3030 | unsigned char *sha1; | |
3031 | int found_it; | |
3032 | ||
3033 | unsigned char osha1[20]; | |
3034 | unsigned char nsha1[20]; | |
3035 | int tz; | |
3036 | unsigned long date; | |
3037 | char **msg; | |
3038 | unsigned long *cutoff_time; | |
3039 | int *cutoff_tz; | |
3040 | int *cutoff_cnt; | |
3041 | }; | |
3042 | ||
3043 | static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1, | |
3044 | const char *email, unsigned long timestamp, int tz, | |
3045 | const char *message, void *cb_data) | |
3046 | { | |
3047 | struct read_ref_at_cb *cb = cb_data; | |
3048 | ||
3049 | cb->reccnt++; | |
3050 | cb->tz = tz; | |
3051 | cb->date = timestamp; | |
3052 | ||
3053 | if (timestamp <= cb->at_time || cb->cnt == 0) { | |
3054 | if (cb->msg) | |
3055 | *cb->msg = xstrdup(message); | |
3056 | if (cb->cutoff_time) | |
3057 | *cb->cutoff_time = timestamp; | |
3058 | if (cb->cutoff_tz) | |
3059 | *cb->cutoff_tz = tz; | |
3060 | if (cb->cutoff_cnt) | |
3061 | *cb->cutoff_cnt = cb->reccnt - 1; | |
3062 | /* | |
3063 | * we have not yet updated cb->[n|o]sha1 so they still | |
3064 | * hold the values for the previous record. | |
3065 | */ | |
3066 | if (!is_null_sha1(cb->osha1)) { | |
3067 | hashcpy(cb->sha1, nsha1); | |
3068 | if (hashcmp(cb->osha1, nsha1)) | |
3069 | warning("Log for ref %s has gap after %s.", | |
3070 | cb->refname, show_date(cb->date, cb->tz, DATE_RFC2822)); | |
3071 | } | |
3072 | else if (cb->date == cb->at_time) | |
3073 | hashcpy(cb->sha1, nsha1); | |
3074 | else if (hashcmp(nsha1, cb->sha1)) | |
3075 | warning("Log for ref %s unexpectedly ended on %s.", | |
3076 | cb->refname, show_date(cb->date, cb->tz, | |
3077 | DATE_RFC2822)); | |
3078 | hashcpy(cb->osha1, osha1); | |
3079 | hashcpy(cb->nsha1, nsha1); | |
3080 | cb->found_it = 1; | |
3081 | return 1; | |
3082 | } | |
3083 | hashcpy(cb->osha1, osha1); | |
3084 | hashcpy(cb->nsha1, nsha1); | |
3085 | if (cb->cnt > 0) | |
3086 | cb->cnt--; | |
3087 | return 0; | |
3088 | } | |
3089 | ||
3090 | static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1, | |
3091 | const char *email, unsigned long timestamp, | |
3092 | int tz, const char *message, void *cb_data) | |
3093 | { | |
3094 | struct read_ref_at_cb *cb = cb_data; | |
3095 | ||
3096 | if (cb->msg) | |
3097 | *cb->msg = xstrdup(message); | |
3098 | if (cb->cutoff_time) | |
3099 | *cb->cutoff_time = timestamp; | |
3100 | if (cb->cutoff_tz) | |
3101 | *cb->cutoff_tz = tz; | |
3102 | if (cb->cutoff_cnt) | |
3103 | *cb->cutoff_cnt = cb->reccnt; | |
3104 | hashcpy(cb->sha1, osha1); | |
3105 | if (is_null_sha1(cb->sha1)) | |
3106 | hashcpy(cb->sha1, nsha1); | |
3107 | /* We just want the first entry */ | |
3108 | return 1; | |
16d7cc90 JH |
3109 | } |
3110 | ||
dfefa935 MH |
3111 | int read_ref_at(const char *refname, unsigned long at_time, int cnt, |
3112 | unsigned char *sha1, char **msg, | |
3113 | unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt) | |
d556fae2 | 3114 | { |
4207ed28 | 3115 | struct read_ref_at_cb cb; |
d556fae2 | 3116 | |
4207ed28 RS |
3117 | memset(&cb, 0, sizeof(cb)); |
3118 | cb.refname = refname; | |
3119 | cb.at_time = at_time; | |
3120 | cb.cnt = cnt; | |
3121 | cb.msg = msg; | |
3122 | cb.cutoff_time = cutoff_time; | |
3123 | cb.cutoff_tz = cutoff_tz; | |
3124 | cb.cutoff_cnt = cutoff_cnt; | |
3125 | cb.sha1 = sha1; | |
3126 | ||
3127 | for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb); | |
3128 | ||
3129 | if (!cb.reccnt) | |
3130 | die("Log for %s is empty.", refname); | |
3131 | if (cb.found_it) | |
3132 | return 0; | |
3133 | ||
3134 | for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb); | |
d556fae2 | 3135 | |
16d7cc90 | 3136 | return 1; |
d556fae2 | 3137 | } |
2ff81662 | 3138 | |
4da58835 RS |
3139 | int reflog_exists(const char *refname) |
3140 | { | |
3141 | struct stat st; | |
3142 | ||
3143 | return !lstat(git_path("logs/%s", refname), &st) && | |
3144 | S_ISREG(st.st_mode); | |
3145 | } | |
3146 | ||
3147 | int delete_reflog(const char *refname) | |
3148 | { | |
3149 | return remove_path(git_path("logs/%s", refname)); | |
3150 | } | |
3151 | ||
9a7a183b JH |
3152 | static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data) |
3153 | { | |
3154 | unsigned char osha1[20], nsha1[20]; | |
3155 | char *email_end, *message; | |
3156 | unsigned long timestamp; | |
3157 | int tz; | |
3158 | ||
3159 | /* old SP new SP name <email> SP time TAB msg LF */ | |
3160 | if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' || | |
3161 | get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' || | |
3162 | get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' || | |
3163 | !(email_end = strchr(sb->buf + 82, '>')) || | |
3164 | email_end[1] != ' ' || | |
3165 | !(timestamp = strtoul(email_end + 2, &message, 10)) || | |
3166 | !message || message[0] != ' ' || | |
3167 | (message[1] != '+' && message[1] != '-') || | |
3168 | !isdigit(message[2]) || !isdigit(message[3]) || | |
3169 | !isdigit(message[4]) || !isdigit(message[5])) | |
3170 | return 0; /* corrupt? */ | |
3171 | email_end[1] = '\0'; | |
3172 | tz = strtol(message + 1, NULL, 10); | |
3173 | if (message[6] != '\t') | |
3174 | message += 6; | |
3175 | else | |
3176 | message += 7; | |
3177 | return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data); | |
3178 | } | |
3179 | ||
98f85ff4 JH |
3180 | static char *find_beginning_of_line(char *bob, char *scan) |
3181 | { | |
3182 | while (bob < scan && *(--scan) != '\n') | |
3183 | ; /* keep scanning backwards */ | |
3184 | /* | |
3185 | * Return either beginning of the buffer, or LF at the end of | |
3186 | * the previous line. | |
3187 | */ | |
3188 | return scan; | |
3189 | } | |
3190 | ||
3191 | int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data) | |
2ff81662 | 3192 | { |
8ca78803 | 3193 | struct strbuf sb = STRBUF_INIT; |
98f85ff4 JH |
3194 | FILE *logfp; |
3195 | long pos; | |
3196 | int ret = 0, at_tail = 1; | |
2ff81662 | 3197 | |
7ae07c1b | 3198 | logfp = fopen(git_path("logs/%s", refname), "r"); |
2ff81662 | 3199 | if (!logfp) |
883d60fa | 3200 | return -1; |
101d15e0 | 3201 | |
98f85ff4 JH |
3202 | /* Jump to the end */ |
3203 | if (fseek(logfp, 0, SEEK_END) < 0) | |
3204 | return error("cannot seek back reflog for %s: %s", | |
3205 | refname, strerror(errno)); | |
3206 | pos = ftell(logfp); | |
3207 | while (!ret && 0 < pos) { | |
3208 | int cnt; | |
3209 | size_t nread; | |
3210 | char buf[BUFSIZ]; | |
3211 | char *endp, *scanp; | |
3212 | ||
3213 | /* Fill next block from the end */ | |
3214 | cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos; | |
3215 | if (fseek(logfp, pos - cnt, SEEK_SET)) | |
3216 | return error("cannot seek back reflog for %s: %s", | |
3217 | refname, strerror(errno)); | |
3218 | nread = fread(buf, cnt, 1, logfp); | |
e4ca819a | 3219 | if (nread != 1) |
98f85ff4 JH |
3220 | return error("cannot read %d bytes from reflog for %s: %s", |
3221 | cnt, refname, strerror(errno)); | |
3222 | pos -= cnt; | |
3223 | ||
3224 | scanp = endp = buf + cnt; | |
3225 | if (at_tail && scanp[-1] == '\n') | |
3226 | /* Looking at the final LF at the end of the file */ | |
3227 | scanp--; | |
3228 | at_tail = 0; | |
3229 | ||
3230 | while (buf < scanp) { | |
3231 | /* | |
3232 | * terminating LF of the previous line, or the beginning | |
3233 | * of the buffer. | |
3234 | */ | |
3235 | char *bp; | |
3236 | ||
3237 | bp = find_beginning_of_line(buf, scanp); | |
3238 | ||
3239 | if (*bp != '\n') { | |
3240 | strbuf_splice(&sb, 0, 0, buf, endp - buf); | |
3241 | if (pos) | |
3242 | break; /* need to fill another block */ | |
3243 | scanp = buf - 1; /* leave loop */ | |
3244 | } else { | |
3245 | /* | |
3246 | * (bp + 1) thru endp is the beginning of the | |
3247 | * current line we have in sb | |
3248 | */ | |
3249 | strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1)); | |
3250 | scanp = bp; | |
3251 | endp = bp + 1; | |
3252 | } | |
3253 | ret = show_one_reflog_ent(&sb, fn, cb_data); | |
3254 | strbuf_reset(&sb); | |
3255 | if (ret) | |
3256 | break; | |
9d33f7c2 | 3257 | } |
101d15e0 | 3258 | |
2ff81662 | 3259 | } |
98f85ff4 | 3260 | if (!ret && sb.len) |
9a7a183b | 3261 | ret = show_one_reflog_ent(&sb, fn, cb_data); |
98f85ff4 | 3262 | |
2ff81662 | 3263 | fclose(logfp); |
8ca78803 | 3264 | strbuf_release(&sb); |
2266bf27 | 3265 | return ret; |
2ff81662 | 3266 | } |
e29cb53a | 3267 | |
dfefa935 | 3268 | int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data) |
101d15e0 | 3269 | { |
98f85ff4 JH |
3270 | FILE *logfp; |
3271 | struct strbuf sb = STRBUF_INIT; | |
3272 | int ret = 0; | |
3273 | ||
3274 | logfp = fopen(git_path("logs/%s", refname), "r"); | |
3275 | if (!logfp) | |
3276 | return -1; | |
101d15e0 | 3277 | |
98f85ff4 JH |
3278 | while (!ret && !strbuf_getwholeline(&sb, logfp, '\n')) |
3279 | ret = show_one_reflog_ent(&sb, fn, cb_data); | |
3280 | fclose(logfp); | |
3281 | strbuf_release(&sb); | |
3282 | return ret; | |
3283 | } | |
989c0e5d MH |
3284 | /* |
3285 | * Call fn for each reflog in the namespace indicated by name. name | |
3286 | * must be empty or end with '/'. Name will be used as a scratch | |
3287 | * space, but its contents will be restored before return. | |
3288 | */ | |
3289 | static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data) | |
eb8381c8 | 3290 | { |
989c0e5d | 3291 | DIR *d = opendir(git_path("logs/%s", name->buf)); |
fcee5a14 | 3292 | int retval = 0; |
93c603fc | 3293 | struct dirent *de; |
989c0e5d | 3294 | int oldlen = name->len; |
eb8381c8 | 3295 | |
93c603fc | 3296 | if (!d) |
989c0e5d | 3297 | return name->len ? errno : 0; |
eb8381c8 | 3298 | |
93c603fc MH |
3299 | while ((de = readdir(d)) != NULL) { |
3300 | struct stat st; | |
eb8381c8 | 3301 | |
93c603fc MH |
3302 | if (de->d_name[0] == '.') |
3303 | continue; | |
2975c770 | 3304 | if (ends_with(de->d_name, ".lock")) |
93c603fc | 3305 | continue; |
989c0e5d MH |
3306 | strbuf_addstr(name, de->d_name); |
3307 | if (stat(git_path("logs/%s", name->buf), &st) < 0) { | |
3308 | ; /* silently ignore */ | |
93c603fc | 3309 | } else { |
eb8381c8 | 3310 | if (S_ISDIR(st.st_mode)) { |
989c0e5d MH |
3311 | strbuf_addch(name, '/'); |
3312 | retval = do_for_each_reflog(name, fn, cb_data); | |
eb8381c8 NP |
3313 | } else { |
3314 | unsigned char sha1[20]; | |
989c0e5d MH |
3315 | if (read_ref_full(name->buf, sha1, 0, NULL)) |
3316 | retval = error("bad ref for %s", name->buf); | |
eb8381c8 | 3317 | else |
989c0e5d | 3318 | retval = fn(name->buf, sha1, 0, cb_data); |
eb8381c8 NP |
3319 | } |
3320 | if (retval) | |
3321 | break; | |
3322 | } | |
989c0e5d | 3323 | strbuf_setlen(name, oldlen); |
eb8381c8 | 3324 | } |
93c603fc | 3325 | closedir(d); |
eb8381c8 NP |
3326 | return retval; |
3327 | } | |
3328 | ||
3329 | int for_each_reflog(each_ref_fn fn, void *cb_data) | |
3330 | { | |
989c0e5d MH |
3331 | int retval; |
3332 | struct strbuf name; | |
3333 | strbuf_init(&name, PATH_MAX); | |
3334 | retval = do_for_each_reflog(&name, fn, cb_data); | |
3335 | strbuf_release(&name); | |
3336 | return retval; | |
eb8381c8 | 3337 | } |
3d9f037c | 3338 | |
b5c8ea2a MH |
3339 | /** |
3340 | * Information needed for a single ref update. Set new_sha1 to the | |
3341 | * new value or to zero to delete the ref. To check the old value | |
3342 | * while locking the ref, set have_old to 1 and set old_sha1 to the | |
3343 | * value or to zero to ensure the ref does not exist before update. | |
3344 | */ | |
3345 | struct ref_update { | |
b5c8ea2a MH |
3346 | unsigned char new_sha1[20]; |
3347 | unsigned char old_sha1[20]; | |
3348 | int flags; /* REF_NODEREF? */ | |
3349 | int have_old; /* 1 if old_sha1 is valid, 0 otherwise */ | |
81c960e4 | 3350 | struct ref_lock *lock; |
84178db7 | 3351 | int type; |
88615910 | 3352 | const char refname[FLEX_ARRAY]; |
b5c8ea2a MH |
3353 | }; |
3354 | ||
2bdc785f RS |
3355 | /* |
3356 | * Transaction states. | |
3357 | * OPEN: The transaction is in a valid state and can accept new updates. | |
3358 | * An OPEN transaction can be committed. | |
3359 | * CLOSED: A closed transaction is no longer active and no other operations | |
3360 | * than free can be used on it in this state. | |
3361 | * A transaction can either become closed by successfully committing | |
3362 | * an active transaction or if there is a failure while building | |
3363 | * the transaction thus rendering it failed/inactive. | |
3364 | */ | |
3365 | enum ref_transaction_state { | |
3366 | REF_TRANSACTION_OPEN = 0, | |
3367 | REF_TRANSACTION_CLOSED = 1 | |
3368 | }; | |
3369 | ||
caa4046c MH |
3370 | /* |
3371 | * Data structure for holding a reference transaction, which can | |
3372 | * consist of checks and updates to multiple references, carried out | |
3373 | * as atomically as possible. This structure is opaque to callers. | |
3374 | */ | |
3375 | struct ref_transaction { | |
3376 | struct ref_update **updates; | |
3377 | size_t alloc; | |
3378 | size_t nr; | |
2bdc785f | 3379 | enum ref_transaction_state state; |
caa4046c MH |
3380 | }; |
3381 | ||
93a644ea | 3382 | struct ref_transaction *ref_transaction_begin(struct strbuf *err) |
caa4046c MH |
3383 | { |
3384 | return xcalloc(1, sizeof(struct ref_transaction)); | |
3385 | } | |
3386 | ||
026bd1d3 | 3387 | void ref_transaction_free(struct ref_transaction *transaction) |
caa4046c MH |
3388 | { |
3389 | int i; | |
3390 | ||
1b07255c RS |
3391 | if (!transaction) |
3392 | return; | |
3393 | ||
88615910 MH |
3394 | for (i = 0; i < transaction->nr; i++) |
3395 | free(transaction->updates[i]); | |
caa4046c MH |
3396 | |
3397 | free(transaction->updates); | |
3398 | free(transaction); | |
3399 | } | |
3400 | ||
caa4046c MH |
3401 | static struct ref_update *add_update(struct ref_transaction *transaction, |
3402 | const char *refname) | |
3403 | { | |
88615910 MH |
3404 | size_t len = strlen(refname); |
3405 | struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1); | |
caa4046c | 3406 | |
88615910 | 3407 | strcpy((char *)update->refname, refname); |
caa4046c MH |
3408 | ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc); |
3409 | transaction->updates[transaction->nr++] = update; | |
3410 | return update; | |
3411 | } | |
3412 | ||
8e34800e RS |
3413 | int ref_transaction_update(struct ref_transaction *transaction, |
3414 | const char *refname, | |
3415 | const unsigned char *new_sha1, | |
3416 | const unsigned char *old_sha1, | |
3417 | int flags, int have_old, | |
3418 | struct strbuf *err) | |
caa4046c | 3419 | { |
8e34800e | 3420 | struct ref_update *update; |
caa4046c | 3421 | |
2bdc785f RS |
3422 | if (transaction->state != REF_TRANSACTION_OPEN) |
3423 | die("BUG: update called for transaction that is not open"); | |
3424 | ||
8e34800e RS |
3425 | if (have_old && !old_sha1) |
3426 | die("BUG: have_old is true but old_sha1 is NULL"); | |
caa4046c | 3427 | |
8e34800e | 3428 | update = add_update(transaction, refname); |
caa4046c MH |
3429 | hashcpy(update->new_sha1, new_sha1); |
3430 | update->flags = flags; | |
3431 | update->have_old = have_old; | |
3432 | if (have_old) | |
3433 | hashcpy(update->old_sha1, old_sha1); | |
8e34800e | 3434 | return 0; |
caa4046c MH |
3435 | } |
3436 | ||
b416af5b RS |
3437 | int ref_transaction_create(struct ref_transaction *transaction, |
3438 | const char *refname, | |
3439 | const unsigned char *new_sha1, | |
3440 | int flags, | |
3441 | struct strbuf *err) | |
caa4046c | 3442 | { |
b416af5b RS |
3443 | struct ref_update *update; |
3444 | ||
2bdc785f RS |
3445 | if (transaction->state != REF_TRANSACTION_OPEN) |
3446 | die("BUG: create called for transaction that is not open"); | |
3447 | ||
b416af5b RS |
3448 | if (!new_sha1 || is_null_sha1(new_sha1)) |
3449 | die("BUG: create ref with null new_sha1"); | |
3450 | ||
3451 | update = add_update(transaction, refname); | |
caa4046c | 3452 | |
caa4046c MH |
3453 | hashcpy(update->new_sha1, new_sha1); |
3454 | hashclr(update->old_sha1); | |
3455 | update->flags = flags; | |
3456 | update->have_old = 1; | |
b416af5b | 3457 | return 0; |
caa4046c MH |
3458 | } |
3459 | ||
8c8bdc0d RS |
3460 | int ref_transaction_delete(struct ref_transaction *transaction, |
3461 | const char *refname, | |
3462 | const unsigned char *old_sha1, | |
3463 | int flags, int have_old, | |
3464 | struct strbuf *err) | |
caa4046c | 3465 | { |
8c8bdc0d | 3466 | struct ref_update *update; |
caa4046c | 3467 | |
2bdc785f RS |
3468 | if (transaction->state != REF_TRANSACTION_OPEN) |
3469 | die("BUG: delete called for transaction that is not open"); | |
3470 | ||
8c8bdc0d RS |
3471 | if (have_old && !old_sha1) |
3472 | die("BUG: have_old is true but old_sha1 is NULL"); | |
3473 | ||
3474 | update = add_update(transaction, refname); | |
caa4046c MH |
3475 | update->flags = flags; |
3476 | update->have_old = have_old; | |
3477 | if (have_old) { | |
3478 | assert(!is_null_sha1(old_sha1)); | |
3479 | hashcpy(update->old_sha1, old_sha1); | |
3480 | } | |
8c8bdc0d | 3481 | return 0; |
caa4046c MH |
3482 | } |
3483 | ||
4738a333 BK |
3484 | int update_ref(const char *action, const char *refname, |
3485 | const unsigned char *sha1, const unsigned char *oldval, | |
3486 | int flags, enum action_on_err onerr) | |
3487 | { | |
b4d75ac1 RS |
3488 | struct ref_transaction *t; |
3489 | struct strbuf err = STRBUF_INIT; | |
3490 | ||
3491 | t = ref_transaction_begin(&err); | |
3492 | if (!t || | |
3493 | ref_transaction_update(t, refname, sha1, oldval, flags, | |
3494 | !!oldval, &err) || | |
3495 | ref_transaction_commit(t, action, &err)) { | |
3496 | const char *str = "update_ref failed for ref '%s': %s"; | |
3497 | ||
3498 | ref_transaction_free(t); | |
3499 | switch (onerr) { | |
3500 | case UPDATE_REFS_MSG_ON_ERR: | |
3501 | error(str, refname, err.buf); | |
3502 | break; | |
3503 | case UPDATE_REFS_DIE_ON_ERR: | |
3504 | die(str, refname, err.buf); | |
3505 | break; | |
3506 | case UPDATE_REFS_QUIET_ON_ERR: | |
3507 | break; | |
3508 | } | |
3509 | strbuf_release(&err); | |
4738a333 | 3510 | return 1; |
b4d75ac1 RS |
3511 | } |
3512 | strbuf_release(&err); | |
3513 | ref_transaction_free(t); | |
3514 | return 0; | |
4738a333 BK |
3515 | } |
3516 | ||
98aee92d BK |
3517 | static int ref_update_compare(const void *r1, const void *r2) |
3518 | { | |
3519 | const struct ref_update * const *u1 = r1; | |
3520 | const struct ref_update * const *u2 = r2; | |
5524e241 | 3521 | return strcmp((*u1)->refname, (*u2)->refname); |
98aee92d BK |
3522 | } |
3523 | ||
3524 | static int ref_update_reject_duplicates(struct ref_update **updates, int n, | |
01319837 | 3525 | struct strbuf *err) |
98aee92d BK |
3526 | { |
3527 | int i; | |
3528 | for (i = 1; i < n; i++) | |
5524e241 | 3529 | if (!strcmp(updates[i - 1]->refname, updates[i]->refname)) { |
98aee92d BK |
3530 | const char *str = |
3531 | "Multiple updates for ref '%s' not allowed."; | |
038d0051 RS |
3532 | if (err) |
3533 | strbuf_addf(err, str, updates[i]->refname); | |
3534 | ||
98aee92d BK |
3535 | return 1; |
3536 | } | |
3537 | return 0; | |
3538 | } | |
3539 | ||
b5c8ea2a | 3540 | int ref_transaction_commit(struct ref_transaction *transaction, |
01319837 | 3541 | const char *msg, struct strbuf *err) |
98aee92d BK |
3542 | { |
3543 | int ret = 0, delnum = 0, i; | |
98aee92d | 3544 | const char **delnames; |
b5c8ea2a | 3545 | int n = transaction->nr; |
6a402338 | 3546 | struct ref_update **updates = transaction->updates; |
98aee92d | 3547 | |
2bdc785f RS |
3548 | if (transaction->state != REF_TRANSACTION_OPEN) |
3549 | die("BUG: commit called for transaction that is not open"); | |
3550 | ||
3551 | if (!n) { | |
3552 | transaction->state = REF_TRANSACTION_CLOSED; | |
98aee92d | 3553 | return 0; |
2bdc785f | 3554 | } |
98aee92d BK |
3555 | |
3556 | /* Allocate work space */ | |
98aee92d BK |
3557 | delnames = xmalloc(sizeof(*delnames) * n); |
3558 | ||
3559 | /* Copy, sort, and reject duplicate refs */ | |
98aee92d | 3560 | qsort(updates, n, sizeof(*updates), ref_update_compare); |
01319837 | 3561 | ret = ref_update_reject_duplicates(updates, n, err); |
98aee92d BK |
3562 | if (ret) |
3563 | goto cleanup; | |
3564 | ||
3565 | /* Acquire all locks while verifying old values */ | |
3566 | for (i = 0; i < n; i++) { | |
cb198d21 MH |
3567 | struct ref_update *update = updates[i]; |
3568 | ||
45421e24 RS |
3569 | update->lock = lock_any_ref_for_update(update->refname, |
3570 | (update->have_old ? | |
3571 | update->old_sha1 : | |
3572 | NULL), | |
3573 | update->flags, | |
3574 | &update->type); | |
81c960e4 | 3575 | if (!update->lock) { |
995f8746 RS |
3576 | if (err) |
3577 | strbuf_addf(err, "Cannot lock the ref '%s'.", | |
3578 | update->refname); | |
98aee92d BK |
3579 | ret = 1; |
3580 | goto cleanup; | |
3581 | } | |
3582 | } | |
3583 | ||
3584 | /* Perform updates first so live commits remain referenced */ | |
cb198d21 MH |
3585 | for (i = 0; i < n; i++) { |
3586 | struct ref_update *update = updates[i]; | |
3587 | ||
3588 | if (!is_null_sha1(update->new_sha1)) { | |
04ad6223 RS |
3589 | ret = write_ref_sha1(update->lock, update->new_sha1, |
3590 | msg); | |
3591 | update->lock = NULL; /* freed by write_ref_sha1 */ | |
3592 | if (ret) { | |
3593 | if (err) | |
3594 | strbuf_addf(err, "Cannot update the ref '%s'.", | |
3595 | update->refname); | |
98aee92d | 3596 | goto cleanup; |
04ad6223 | 3597 | } |
98aee92d | 3598 | } |
cb198d21 | 3599 | } |
98aee92d BK |
3600 | |
3601 | /* Perform deletes now that updates are safely completed */ | |
81c960e4 MH |
3602 | for (i = 0; i < n; i++) { |
3603 | struct ref_update *update = updates[i]; | |
3604 | ||
3605 | if (update->lock) { | |
84178db7 | 3606 | ret |= delete_ref_loose(update->lock, update->type); |
029cdb4a RS |
3607 | if (!(update->flags & REF_ISPRUNING)) |
3608 | delnames[delnum++] = update->lock->ref_name; | |
98aee92d | 3609 | } |
81c960e4 MH |
3610 | } |
3611 | ||
60bca085 | 3612 | ret |= repack_without_refs(delnames, delnum, err); |
98aee92d BK |
3613 | for (i = 0; i < delnum; i++) |
3614 | unlink_or_warn(git_path("logs/%s", delnames[i])); | |
3615 | clear_loose_ref_cache(&ref_cache); | |
3616 | ||
3617 | cleanup: | |
2bdc785f RS |
3618 | transaction->state = REF_TRANSACTION_CLOSED; |
3619 | ||
98aee92d | 3620 | for (i = 0; i < n; i++) |
81c960e4 MH |
3621 | if (updates[i]->lock) |
3622 | unlock_ref(updates[i]->lock); | |
98aee92d | 3623 | free(delnames); |
caa4046c MH |
3624 | return ret; |
3625 | } | |
3626 | ||
dfefa935 | 3627 | char *shorten_unambiguous_ref(const char *refname, int strict) |
7c2b3029 JK |
3628 | { |
3629 | int i; | |
3630 | static char **scanf_fmts; | |
3631 | static int nr_rules; | |
3632 | char *short_name; | |
3633 | ||
7c2b3029 | 3634 | if (!nr_rules) { |
4346663a MH |
3635 | /* |
3636 | * Pre-generate scanf formats from ref_rev_parse_rules[]. | |
3637 | * Generate a format suitable for scanf from a | |
3638 | * ref_rev_parse_rules rule by interpolating "%s" at the | |
3639 | * location of the "%.*s". | |
3640 | */ | |
7c2b3029 | 3641 | size_t total_len = 0; |
84d5633f | 3642 | size_t offset = 0; |
7c2b3029 JK |
3643 | |
3644 | /* the rule list is NULL terminated, count them first */ | |
a4165851 | 3645 | for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++) |
7902fe03 MH |
3646 | /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */ |
3647 | total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1; | |
7c2b3029 JK |
3648 | |
3649 | scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len); | |
3650 | ||
84d5633f | 3651 | offset = 0; |
7c2b3029 | 3652 | for (i = 0; i < nr_rules; i++) { |
4346663a | 3653 | assert(offset < total_len); |
84d5633f | 3654 | scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset; |
4346663a MH |
3655 | offset += snprintf(scanf_fmts[i], total_len - offset, |
3656 | ref_rev_parse_rules[i], 2, "%s") + 1; | |
7c2b3029 JK |
3657 | } |
3658 | } | |
3659 | ||
3660 | /* bail out if there are no rules */ | |
3661 | if (!nr_rules) | |
dfefa935 | 3662 | return xstrdup(refname); |
7c2b3029 | 3663 | |
dfefa935 MH |
3664 | /* buffer for scanf result, at most refname must fit */ |
3665 | short_name = xstrdup(refname); | |
7c2b3029 JK |
3666 | |
3667 | /* skip first rule, it will always match */ | |
3668 | for (i = nr_rules - 1; i > 0 ; --i) { | |
3669 | int j; | |
6e7b3309 | 3670 | int rules_to_fail = i; |
7c2b3029 JK |
3671 | int short_name_len; |
3672 | ||
dfefa935 | 3673 | if (1 != sscanf(refname, scanf_fmts[i], short_name)) |
7c2b3029 JK |
3674 | continue; |
3675 | ||
3676 | short_name_len = strlen(short_name); | |
3677 | ||
6e7b3309 BW |
3678 | /* |
3679 | * in strict mode, all (except the matched one) rules | |
3680 | * must fail to resolve to a valid non-ambiguous ref | |
3681 | */ | |
3682 | if (strict) | |
3683 | rules_to_fail = nr_rules; | |
3684 | ||
7c2b3029 JK |
3685 | /* |
3686 | * check if the short name resolves to a valid ref, | |
3687 | * but use only rules prior to the matched one | |
3688 | */ | |
6e7b3309 | 3689 | for (j = 0; j < rules_to_fail; j++) { |
7c2b3029 | 3690 | const char *rule = ref_rev_parse_rules[j]; |
7c2b3029 JK |
3691 | char refname[PATH_MAX]; |
3692 | ||
6e7b3309 BW |
3693 | /* skip matched rule */ |
3694 | if (i == j) | |
3695 | continue; | |
3696 | ||
7c2b3029 JK |
3697 | /* |
3698 | * the short name is ambiguous, if it resolves | |
3699 | * (with this previous rule) to a valid ref | |
3700 | * read_ref() returns 0 on success | |
3701 | */ | |
3702 | mksnpath(refname, sizeof(refname), | |
3703 | rule, short_name_len, short_name); | |
c6893323 | 3704 | if (ref_exists(refname)) |
7c2b3029 JK |
3705 | break; |
3706 | } | |
3707 | ||
3708 | /* | |
3709 | * short name is non-ambiguous if all previous rules | |
3710 | * haven't resolved to a valid ref | |
3711 | */ | |
6e7b3309 | 3712 | if (j == rules_to_fail) |
7c2b3029 JK |
3713 | return short_name; |
3714 | } | |
3715 | ||
3716 | free(short_name); | |
dfefa935 | 3717 | return xstrdup(refname); |
7c2b3029 | 3718 | } |
daebaa78 JH |
3719 | |
3720 | static struct string_list *hide_refs; | |
3721 | ||
3722 | int parse_hide_refs_config(const char *var, const char *value, const char *section) | |
3723 | { | |
3724 | if (!strcmp("transfer.hiderefs", var) || | |
3725 | /* NEEDSWORK: use parse_config_key() once both are merged */ | |
59556548 | 3726 | (starts_with(var, section) && var[strlen(section)] == '.' && |
daebaa78 JH |
3727 | !strcmp(var + strlen(section), ".hiderefs"))) { |
3728 | char *ref; | |
3729 | int len; | |
3730 | ||
3731 | if (!value) | |
3732 | return config_error_nonbool(var); | |
3733 | ref = xstrdup(value); | |
3734 | len = strlen(ref); | |
3735 | while (len && ref[len - 1] == '/') | |
3736 | ref[--len] = '\0'; | |
3737 | if (!hide_refs) { | |
3738 | hide_refs = xcalloc(1, sizeof(*hide_refs)); | |
3739 | hide_refs->strdup_strings = 1; | |
3740 | } | |
3741 | string_list_append(hide_refs, ref); | |
3742 | } | |
3743 | return 0; | |
3744 | } | |
3745 | ||
3746 | int ref_is_hidden(const char *refname) | |
3747 | { | |
3748 | struct string_list_item *item; | |
3749 | ||
3750 | if (!hide_refs) | |
3751 | return 0; | |
3752 | for_each_string_list_item(item, hide_refs) { | |
3753 | int len; | |
59556548 | 3754 | if (!starts_with(refname, item->string)) |
daebaa78 JH |
3755 | continue; |
3756 | len = strlen(item->string); | |
3757 | if (!refname[len] || refname[len] == '/') | |
3758 | return 1; | |
3759 | } | |
3760 | return 0; | |
3761 | } |