]>
Commit | Line | Data |
---|---|---|
86ab7f0c MH |
1 | /* |
2 | * Handle git attributes. See gitattributes(5) for a description of | |
3a1b3415 | 3 | * the file syntax, and attr.h for a description of the API. |
86ab7f0c MH |
4 | * |
5 | * One basic design decision here is that we are not going to support | |
6 | * an insanely large number of attributes. | |
7 | */ | |
8 | ||
bc5c5ec0 | 9 | #include "git-compat-util.h" |
b2141fc1 | 10 | #include "config.h" |
32a8f510 | 11 | #include "environment.h" |
d807c4a0 | 12 | #include "exec-cmd.h" |
d0bfd026 | 13 | #include "attr.h" |
6eba6210 | 14 | #include "dir.h" |
f394e093 | 15 | #include "gettext.h" |
c339932b | 16 | #include "path.h" |
27547e5f | 17 | #include "utf8.h" |
860a74d9 | 18 | #include "quote.h" |
08c46a49 | 19 | #include "read-cache-ll.h" |
2232a88a | 20 | #include "refs.h" |
47cfc9bd | 21 | #include "revision.h" |
a034e910 | 22 | #include "object-store-ll.h" |
e38da487 | 23 | #include "setup.h" |
1a600b75 | 24 | #include "thread-utils.h" |
0e312eaa | 25 | #include "tree-walk.h" |
44451a2e | 26 | #include "object-name.h" |
d0bfd026 | 27 | |
9f9c40cf JC |
28 | const char *git_attr_tree; |
29 | ||
a5e92abd JH |
30 | const char git_attr__true[] = "(builtin)true"; |
31 | const char git_attr__false[] = "\0(builtin)false"; | |
32 | static const char git_attr__unknown[] = "(builtin)unknown"; | |
33 | #define ATTR__TRUE git_attr__true | |
34 | #define ATTR__FALSE git_attr__false | |
35 | #define ATTR__UNSET NULL | |
36 | #define ATTR__UNKNOWN git_attr__unknown | |
515106fa | 37 | |
d0bfd026 | 38 | struct git_attr { |
e1e12e97 | 39 | unsigned int attr_nr; /* unique attribute number */ |
1a600b75 | 40 | char name[FLEX_ARRAY]; /* attribute name */ |
d0bfd026 | 41 | }; |
7d42ec54 | 42 | |
ec4d77aa | 43 | const char *git_attr_name(const struct git_attr *attr) |
352404ac MH |
44 | { |
45 | return attr->name; | |
46 | } | |
47 | ||
1a600b75 BW |
48 | struct attr_hashmap { |
49 | struct hashmap map; | |
1a600b75 | 50 | pthread_mutex_t mutex; |
1a600b75 BW |
51 | }; |
52 | ||
53 | static inline void hashmap_lock(struct attr_hashmap *map) | |
54 | { | |
1a600b75 | 55 | pthread_mutex_lock(&map->mutex); |
1a600b75 BW |
56 | } |
57 | ||
58 | static inline void hashmap_unlock(struct attr_hashmap *map) | |
d0bfd026 | 59 | { |
1a600b75 | 60 | pthread_mutex_unlock(&map->mutex); |
1a600b75 | 61 | } |
d0bfd026 | 62 | |
1a600b75 BW |
63 | /* The container for objects stored in "struct attr_hashmap" */ |
64 | struct attr_hash_entry { | |
e2b5038d | 65 | struct hashmap_entry ent; |
1a600b75 BW |
66 | const char *key; /* the key; memory should be owned by value */ |
67 | size_t keylen; /* length of the key */ | |
68 | void *value; /* the stored value */ | |
69 | }; | |
70 | ||
71 | /* attr_hashmap comparison function */ | |
5cf88fd8 | 72 | static int attr_hash_entry_cmp(const void *cmp_data UNUSED, |
939af16e EW |
73 | const struct hashmap_entry *eptr, |
74 | const struct hashmap_entry *entry_or_key, | |
5cf88fd8 | 75 | const void *keydata UNUSED) |
1a600b75 | 76 | { |
939af16e EW |
77 | const struct attr_hash_entry *a, *b; |
78 | ||
79 | a = container_of(eptr, const struct attr_hash_entry, ent); | |
80 | b = container_of(entry_or_key, const struct attr_hash_entry, ent); | |
1a600b75 BW |
81 | return (a->keylen != b->keylen) || strncmp(a->key, b->key, a->keylen); |
82 | } | |
83 | ||
b19315d8 EN |
84 | /* |
85 | * The global dictionary of all interned attributes. This | |
86 | * is a singleton object which is shared between threads. | |
87 | * Access to this dictionary must be surrounded with a mutex. | |
88 | */ | |
89 | static struct attr_hashmap g_attr_hashmap = { | |
50103649 | 90 | .map = HASHMAP_INIT(attr_hash_entry_cmp, NULL), |
b19315d8 | 91 | }; |
1a600b75 BW |
92 | |
93 | /* | |
94 | * Retrieve the 'value' stored in a hashmap given the provided 'key'. | |
95 | * If there is no matching entry, return NULL. | |
96 | */ | |
97 | static void *attr_hashmap_get(struct attr_hashmap *map, | |
98 | const char *key, size_t keylen) | |
99 | { | |
100 | struct attr_hash_entry k; | |
101 | struct attr_hash_entry *e; | |
102 | ||
d22245a2 | 103 | hashmap_entry_init(&k.ent, memhash(key, keylen)); |
1a600b75 BW |
104 | k.key = key; |
105 | k.keylen = keylen; | |
404ab78e | 106 | e = hashmap_get_entry(&map->map, &k, ent, NULL); |
1a600b75 BW |
107 | |
108 | return e ? e->value : NULL; | |
109 | } | |
110 | ||
111 | /* Add 'value' to a hashmap based on the provided 'key'. */ | |
112 | static void attr_hashmap_add(struct attr_hashmap *map, | |
113 | const char *key, size_t keylen, | |
114 | void *value) | |
115 | { | |
116 | struct attr_hash_entry *e; | |
117 | ||
1a600b75 | 118 | e = xmalloc(sizeof(struct attr_hash_entry)); |
d22245a2 | 119 | hashmap_entry_init(&e->ent, memhash(key, keylen)); |
1a600b75 BW |
120 | e->key = key; |
121 | e->keylen = keylen; | |
122 | e->value = value; | |
123 | ||
b94e5c1d | 124 | hashmap_add(&map->map, &e->ent); |
d0bfd026 JH |
125 | } |
126 | ||
685b2925 BW |
127 | struct all_attrs_item { |
128 | const struct git_attr *attr; | |
129 | const char *value; | |
60a12722 BW |
130 | /* |
131 | * If 'macro' is non-NULL, indicates that 'attr' is a macro based on | |
132 | * the current attribute stack and contains a pointer to the match_attr | |
133 | * definition of the macro | |
134 | */ | |
135 | const struct match_attr *macro; | |
685b2925 BW |
136 | }; |
137 | ||
138 | /* | |
139 | * Reallocate and reinitialize the array of all attributes (which is used in | |
140 | * the attribute collection process) in 'check' based on the global dictionary | |
141 | * of attributes. | |
142 | */ | |
143 | static void all_attrs_init(struct attr_hashmap *map, struct attr_check *check) | |
144 | { | |
145 | int i; | |
8b604d19 | 146 | unsigned int size; |
685b2925 BW |
147 | |
148 | hashmap_lock(map); | |
149 | ||
8b604d19 JH |
150 | size = hashmap_get_size(&map->map); |
151 | if (size < check->all_attrs_nr) | |
033abf97 | 152 | BUG("interned attributes shouldn't be deleted"); |
685b2925 BW |
153 | |
154 | /* | |
155 | * If the number of attributes in the global dictionary has increased | |
156 | * (or this attr_check instance doesn't have an initialized all_attrs | |
157 | * field), reallocate the provided attr_check instance's all_attrs | |
158 | * field and fill each entry with its corresponding git_attr. | |
159 | */ | |
8b604d19 | 160 | if (size != check->all_attrs_nr) { |
685b2925 BW |
161 | struct attr_hash_entry *e; |
162 | struct hashmap_iter iter; | |
685b2925 | 163 | |
8b604d19 JH |
164 | REALLOC_ARRAY(check->all_attrs, size); |
165 | check->all_attrs_nr = size; | |
685b2925 | 166 | |
87571c3f | 167 | hashmap_for_each_entry(&map->map, &iter, e, |
87571c3f | 168 | ent /* member name */) { |
685b2925 BW |
169 | const struct git_attr *a = e->value; |
170 | check->all_attrs[a->attr_nr].attr = a; | |
171 | } | |
172 | } | |
173 | ||
174 | hashmap_unlock(map); | |
175 | ||
176 | /* | |
177 | * Re-initialize every entry in check->all_attrs. | |
178 | * This re-initialization can live outside of the locked region since | |
179 | * the attribute dictionary is no longer being accessed. | |
180 | */ | |
181 | for (i = 0; i < check->all_attrs_nr; i++) { | |
182 | check->all_attrs[i].value = ATTR__UNKNOWN; | |
60a12722 | 183 | check->all_attrs[i].macro = NULL; |
685b2925 BW |
184 | } |
185 | } | |
186 | ||
2232a88a JW |
187 | /* |
188 | * Atribute name cannot begin with "builtin_" which | |
189 | * is a reserved namespace for built in attributes values. | |
190 | */ | |
191 | static int attr_name_reserved(const char *name) | |
192 | { | |
193 | return starts_with(name, "builtin_"); | |
194 | } | |
195 | ||
428103c7 | 196 | static int attr_name_valid(const char *name, size_t namelen) |
e4aee10a JH |
197 | { |
198 | /* | |
d42453ab MH |
199 | * Attribute name cannot begin with '-' and must consist of |
200 | * characters from [-A-Za-z0-9_.]. | |
e4aee10a | 201 | */ |
c0b13b21 | 202 | if (namelen <= 0 || *name == '-') |
428103c7 | 203 | return 0; |
e4aee10a JH |
204 | while (namelen--) { |
205 | char ch = *name++; | |
206 | if (! (ch == '-' || ch == '.' || ch == '_' || | |
207 | ('0' <= ch && ch <= '9') || | |
208 | ('a' <= ch && ch <= 'z') || | |
209 | ('A' <= ch && ch <= 'Z')) ) | |
428103c7 | 210 | return 0; |
e4aee10a | 211 | } |
428103c7 JH |
212 | return 1; |
213 | } | |
214 | ||
215 | static void report_invalid_attr(const char *name, size_t len, | |
216 | const char *src, int lineno) | |
217 | { | |
218 | struct strbuf err = STRBUF_INIT; | |
219 | strbuf_addf(&err, _("%.*s is not a valid attribute name"), | |
220 | (int) len, name); | |
221 | fprintf(stderr, "%s: %s:%d\n", err.buf, src, lineno); | |
222 | strbuf_release(&err); | |
e4aee10a JH |
223 | } |
224 | ||
1a600b75 BW |
225 | /* |
226 | * Given a 'name', lookup and return the corresponding attribute in the global | |
227 | * dictionary. If no entry is found, create a new attribute and store it in | |
228 | * the dictionary. | |
229 | */ | |
eb22e7df | 230 | static const struct git_attr *git_attr_internal(const char *name, size_t namelen) |
d0bfd026 | 231 | { |
d0bfd026 JH |
232 | struct git_attr *a; |
233 | ||
1a600b75 | 234 | if (!attr_name_valid(name, namelen)) |
e4aee10a JH |
235 | return NULL; |
236 | ||
1a600b75 BW |
237 | hashmap_lock(&g_attr_hashmap); |
238 | ||
239 | a = attr_hashmap_get(&g_attr_hashmap, name, namelen); | |
240 | ||
241 | if (!a) { | |
242 | FLEX_ALLOC_MEM(a, name, name, namelen); | |
8b604d19 | 243 | a->attr_nr = hashmap_get_size(&g_attr_hashmap.map); |
1a600b75 BW |
244 | |
245 | attr_hashmap_add(&g_attr_hashmap, a->name, namelen, a); | |
e1e12e97 PS |
246 | if (a->attr_nr != hashmap_get_size(&g_attr_hashmap.map) - 1) |
247 | die(_("unable to add additional attribute")); | |
1a600b75 BW |
248 | } |
249 | ||
250 | hashmap_unlock(&g_attr_hashmap); | |
f48fd688 | 251 | |
d0bfd026 JH |
252 | return a; |
253 | } | |
254 | ||
e810e063 | 255 | const struct git_attr *git_attr(const char *name) |
7fb0eaa2 JH |
256 | { |
257 | return git_attr_internal(name, strlen(name)); | |
258 | } | |
259 | ||
515106fa | 260 | /* What does a matched pattern decide? */ |
d0bfd026 | 261 | struct attr_state { |
e810e063 | 262 | const struct git_attr *attr; |
a5e92abd | 263 | const char *setto; |
d0bfd026 JH |
264 | }; |
265 | ||
82dce998 NTND |
266 | struct pattern { |
267 | const char *pattern; | |
268 | int patternlen; | |
269 | int nowildcardlen; | |
4ff89ee5 | 270 | unsigned flags; /* PATTERN_FLAG_* */ |
82dce998 NTND |
271 | }; |
272 | ||
ba845b75 MH |
273 | /* |
274 | * One rule, as from a .gitattributes file. | |
275 | * | |
276 | * If is_macro is true, then u.attr is a pointer to the git_attr being | |
277 | * defined. | |
278 | * | |
4894f4ff JH |
279 | * If is_macro is false, then u.pat is the filename pattern to which the |
280 | * rule applies. | |
ba845b75 MH |
281 | * |
282 | * In either case, num_attr is the number of attributes affected by | |
283 | * this rule, and state is an array listing them. The attributes are | |
284 | * listed as they appear in the file (macros unexpanded). | |
285 | */ | |
d0bfd026 | 286 | struct match_attr { |
f48fd688 | 287 | union { |
82dce998 | 288 | struct pattern pat; |
e810e063 | 289 | const struct git_attr *attr; |
f48fd688 JH |
290 | } u; |
291 | char is_macro; | |
34ace8ba | 292 | size_t num_attr; |
d0bfd026 JH |
293 | struct attr_state state[FLEX_ARRAY]; |
294 | }; | |
295 | ||
296 | static const char blank[] = " \t\r\n"; | |
297 | ||
dbf387d5 JK |
298 | /* Flags usable in read_attr() and parse_attr_line() family of functions. */ |
299 | #define READ_ATTR_MACRO_OK (1<<0) | |
2ef579e2 | 300 | #define READ_ATTR_NOFOLLOW (1<<1) |
dbf387d5 | 301 | |
d1751298 MH |
302 | /* |
303 | * Parse a whitespace-delimited attribute state (i.e., "attr", | |
304 | * "-attr", "!attr", or "attr=value") from the string starting at src. | |
305 | * If e is not NULL, write the results to *e. Return a pointer to the | |
306 | * remainder of the string (with leading whitespace removed), or NULL | |
307 | * if there was an error. | |
308 | */ | |
515106fa | 309 | static const char *parse_attr(const char *src, int lineno, const char *cp, |
d1751298 | 310 | struct attr_state *e) |
515106fa JH |
311 | { |
312 | const char *ep, *equals; | |
24557209 | 313 | size_t len; |
515106fa JH |
314 | |
315 | ep = cp + strcspn(cp, blank); | |
316 | equals = strchr(cp, '='); | |
317 | if (equals && ep < equals) | |
318 | equals = NULL; | |
319 | if (equals) | |
320 | len = equals - cp; | |
321 | else | |
322 | len = ep - cp; | |
d1751298 | 323 | if (!e) { |
515106fa JH |
324 | if (*cp == '-' || *cp == '!') { |
325 | cp++; | |
326 | len--; | |
327 | } | |
2232a88a | 328 | if (!attr_name_valid(cp, len) || attr_name_reserved(cp)) { |
428103c7 | 329 | report_invalid_attr(cp, len, src, lineno); |
515106fa JH |
330 | return NULL; |
331 | } | |
332 | } else { | |
5a884019 JH |
333 | /* |
334 | * As this function is always called twice, once with | |
335 | * e == NULL in the first pass and then e != NULL in | |
428103c7 | 336 | * the second pass, no need for attr_name_valid() |
5a884019 JH |
337 | * check here. |
338 | */ | |
515106fa JH |
339 | if (*cp == '-' || *cp == '!') { |
340 | e->setto = (*cp == '-') ? ATTR__FALSE : ATTR__UNSET; | |
341 | cp++; | |
342 | len--; | |
343 | } | |
344 | else if (!equals) | |
345 | e->setto = ATTR__TRUE; | |
346 | else { | |
182af834 | 347 | e->setto = xmemdupz(equals + 1, ep - equals - 1); |
515106fa | 348 | } |
7fb0eaa2 | 349 | e->attr = git_attr_internal(cp, len); |
515106fa | 350 | } |
515106fa JH |
351 | return ep + strspn(ep, blank); |
352 | } | |
353 | ||
f48fd688 | 354 | static struct match_attr *parse_attr_line(const char *line, const char *src, |
dbf387d5 | 355 | int lineno, unsigned flags) |
d0bfd026 | 356 | { |
34ace8ba | 357 | size_t namelen, num_attr, i; |
85c4a0d0 | 358 | const char *cp, *name, *states; |
515106fa | 359 | struct match_attr *res = NULL; |
f48fd688 | 360 | int is_macro; |
860a74d9 | 361 | struct strbuf pattern = STRBUF_INIT; |
d0bfd026 JH |
362 | |
363 | cp = line + strspn(line, blank); | |
364 | if (!*cp || *cp == '#') | |
365 | return NULL; | |
366 | name = cp; | |
860a74d9 | 367 | |
dfa6b32b PS |
368 | if (strlen(line) >= ATTR_MAX_LINE_LENGTH) { |
369 | warning(_("ignoring overly long attributes line %d"), lineno); | |
370 | return NULL; | |
371 | } | |
372 | ||
860a74d9 NTND |
373 | if (*cp == '"' && !unquote_c_style(&pattern, name, &states)) { |
374 | name = pattern.buf; | |
375 | namelen = pattern.len; | |
376 | } else { | |
377 | namelen = strcspn(name, blank); | |
378 | states = name + namelen; | |
379 | } | |
380 | ||
f48fd688 | 381 | if (strlen(ATTRIBUTE_MACRO_PREFIX) < namelen && |
59556548 | 382 | starts_with(name, ATTRIBUTE_MACRO_PREFIX)) { |
dbf387d5 | 383 | if (!(flags & READ_ATTR_MACRO_OK)) { |
ad8f8f4a NTND |
384 | fprintf_ln(stderr, _("%s not allowed: %s:%d"), |
385 | name, src, lineno); | |
62af8969 | 386 | goto fail_return; |
f48fd688 JH |
387 | } |
388 | is_macro = 1; | |
389 | name += strlen(ATTRIBUTE_MACRO_PREFIX); | |
390 | name += strspn(name, blank); | |
391 | namelen = strcspn(name, blank); | |
2232a88a | 392 | if (!attr_name_valid(name, namelen) || attr_name_reserved(name)) { |
428103c7 | 393 | report_invalid_attr(name, namelen, src, lineno); |
62af8969 | 394 | goto fail_return; |
e4aee10a | 395 | } |
f48fd688 JH |
396 | } |
397 | else | |
398 | is_macro = 0; | |
d0bfd026 | 399 | |
85c4a0d0 MH |
400 | states += strspn(states, blank); |
401 | ||
d68e1c18 MH |
402 | /* First pass to count the attr_states */ |
403 | for (cp = states, num_attr = 0; *cp; num_attr++) { | |
404 | cp = parse_attr(src, lineno, cp, NULL); | |
405 | if (!cp) | |
62af8969 | 406 | goto fail_return; |
d0bfd026 | 407 | } |
d68e1c18 | 408 | |
a60a66e4 PS |
409 | res = xcalloc(1, st_add3(sizeof(*res), |
410 | st_mult(sizeof(struct attr_state), num_attr), | |
411 | is_macro ? 0 : namelen + 1)); | |
fad32bcd | 412 | if (is_macro) { |
d68e1c18 | 413 | res->u.attr = git_attr_internal(name, namelen); |
fad32bcd | 414 | } else { |
82dce998 NTND |
415 | char *p = (char *)&(res->state[num_attr]); |
416 | memcpy(p, name, namelen); | |
417 | res->u.pat.pattern = p; | |
65edd96a | 418 | parse_path_pattern(&res->u.pat.pattern, |
82dce998 NTND |
419 | &res->u.pat.patternlen, |
420 | &res->u.pat.flags, | |
421 | &res->u.pat.nowildcardlen); | |
4ff89ee5 | 422 | if (res->u.pat.flags & PATTERN_FLAG_NEGATIVE) { |
8b1bd024 TR |
423 | warning(_("Negative patterns are ignored in git attributes\n" |
424 | "Use '\\!' for literal leading exclamation.")); | |
62af8969 | 425 | goto fail_return; |
8b1bd024 | 426 | } |
d0bfd026 | 427 | } |
d68e1c18 MH |
428 | res->is_macro = is_macro; |
429 | res->num_attr = num_attr; | |
430 | ||
431 | /* Second pass to fill the attr_states */ | |
432 | for (cp = states, i = 0; *cp; i++) { | |
433 | cp = parse_attr(src, lineno, cp, &(res->state[i])); | |
434 | } | |
435 | ||
860a74d9 | 436 | strbuf_release(&pattern); |
d0bfd026 | 437 | return res; |
62af8969 JH |
438 | |
439 | fail_return: | |
860a74d9 | 440 | strbuf_release(&pattern); |
62af8969 JH |
441 | free(res); |
442 | return NULL; | |
d0bfd026 JH |
443 | } |
444 | ||
445 | /* | |
446 | * Like info/exclude and .gitignore, the attribute information can | |
447 | * come from many places. | |
448 | * | |
bb101aaf RD |
449 | * (1) .gitattributes file of the same directory; |
450 | * (2) .gitattributes file of the parent directory if (1) does not have | |
515106fa JH |
451 | * any match; this goes recursively upwards, just like .gitignore. |
452 | * (3) $GIT_DIR/info/attributes, which overrides both of the above. | |
d0bfd026 JH |
453 | * |
454 | * In the same file, later entries override the earlier match, so in the | |
455 | * global list, we would have entries from info/attributes the earliest | |
bb101aaf | 456 | * (reading the file from top to bottom), .gitattributes of the root |
d0bfd026 JH |
457 | * directory (again, reading the file from top to bottom) down to the |
458 | * current directory, and then scan the list backwards to find the first match. | |
6d24e7a8 | 459 | * This is exactly the same as what is_excluded() does in dir.c to deal with |
6f416cba | 460 | * .gitignore file and info/excludes file as a fallback. |
d0bfd026 JH |
461 | */ |
462 | ||
dc81cf37 | 463 | struct attr_stack { |
d0bfd026 JH |
464 | struct attr_stack *prev; |
465 | char *origin; | |
cd6a0b26 | 466 | size_t originlen; |
d0bfd026 | 467 | unsigned num_matches; |
a4413118 | 468 | unsigned alloc; |
d0bfd026 | 469 | struct match_attr **attrs; |
dc81cf37 | 470 | }; |
d0bfd026 | 471 | |
dc81cf37 | 472 | static void attr_stack_free(struct attr_stack *e) |
d0bfd026 | 473 | { |
447ac906 | 474 | unsigned i; |
d0bfd026 | 475 | free(e->origin); |
515106fa JH |
476 | for (i = 0; i < e->num_matches; i++) { |
477 | struct match_attr *a = e->attrs[i]; | |
34ace8ba PS |
478 | size_t j; |
479 | ||
515106fa | 480 | for (j = 0; j < a->num_attr; j++) { |
a5e92abd | 481 | const char *setto = a->state[j].setto; |
515106fa JH |
482 | if (setto == ATTR__TRUE || |
483 | setto == ATTR__FALSE || | |
484 | setto == ATTR__UNSET || | |
485 | setto == ATTR__UNKNOWN) | |
486 | ; | |
487 | else | |
4b25d091 | 488 | free((char *) setto); |
515106fa JH |
489 | } |
490 | free(a); | |
491 | } | |
37475f97 | 492 | free(e->attrs); |
d0bfd026 JH |
493 | free(e); |
494 | } | |
495 | ||
dc81cf37 BW |
496 | static void drop_attr_stack(struct attr_stack **stack) |
497 | { | |
498 | while (*stack) { | |
499 | struct attr_stack *elem = *stack; | |
500 | *stack = elem->prev; | |
501 | attr_stack_free(elem); | |
502 | } | |
503 | } | |
504 | ||
505 | /* List of all attr_check structs; access should be surrounded by mutex */ | |
506 | static struct check_vector { | |
507 | size_t nr; | |
508 | size_t alloc; | |
509 | struct attr_check **checks; | |
dc81cf37 | 510 | pthread_mutex_t mutex; |
dc81cf37 BW |
511 | } check_vector; |
512 | ||
513 | static inline void vector_lock(void) | |
514 | { | |
dc81cf37 | 515 | pthread_mutex_lock(&check_vector.mutex); |
dc81cf37 BW |
516 | } |
517 | ||
518 | static inline void vector_unlock(void) | |
519 | { | |
dc81cf37 | 520 | pthread_mutex_unlock(&check_vector.mutex); |
dc81cf37 BW |
521 | } |
522 | ||
523 | static void check_vector_add(struct attr_check *c) | |
524 | { | |
525 | vector_lock(); | |
526 | ||
527 | ALLOC_GROW(check_vector.checks, | |
528 | check_vector.nr + 1, | |
529 | check_vector.alloc); | |
530 | check_vector.checks[check_vector.nr++] = c; | |
531 | ||
532 | vector_unlock(); | |
533 | } | |
534 | ||
535 | static void check_vector_remove(struct attr_check *check) | |
536 | { | |
537 | int i; | |
538 | ||
539 | vector_lock(); | |
540 | ||
541 | /* Find entry */ | |
542 | for (i = 0; i < check_vector.nr; i++) | |
543 | if (check_vector.checks[i] == check) | |
544 | break; | |
545 | ||
546 | if (i >= check_vector.nr) | |
033abf97 | 547 | BUG("no entry found"); |
dc81cf37 BW |
548 | |
549 | /* shift entries over */ | |
550 | for (; i < check_vector.nr - 1; i++) | |
551 | check_vector.checks[i] = check_vector.checks[i + 1]; | |
552 | ||
553 | check_vector.nr--; | |
554 | ||
555 | vector_unlock(); | |
556 | } | |
557 | ||
558 | /* Iterate through all attr_check instances and drop their stacks */ | |
559 | static void drop_all_attr_stacks(void) | |
560 | { | |
561 | int i; | |
562 | ||
563 | vector_lock(); | |
564 | ||
565 | for (i = 0; i < check_vector.nr; i++) { | |
566 | drop_attr_stack(&check_vector.checks[i]->stack); | |
567 | } | |
568 | ||
569 | vector_unlock(); | |
570 | } | |
571 | ||
37293768 JH |
572 | struct attr_check *attr_check_alloc(void) |
573 | { | |
dc81cf37 BW |
574 | struct attr_check *c = xcalloc(1, sizeof(struct attr_check)); |
575 | ||
576 | /* save pointer to the check struct */ | |
577 | check_vector_add(c); | |
578 | ||
579 | return c; | |
37293768 JH |
580 | } |
581 | ||
582 | struct attr_check *attr_check_initl(const char *one, ...) | |
583 | { | |
584 | struct attr_check *check; | |
585 | int cnt; | |
586 | va_list params; | |
587 | const char *param; | |
588 | ||
589 | va_start(params, one); | |
590 | for (cnt = 1; (param = va_arg(params, const char *)) != NULL; cnt++) | |
591 | ; | |
592 | va_end(params); | |
593 | ||
594 | check = attr_check_alloc(); | |
595 | check->nr = cnt; | |
596 | check->alloc = cnt; | |
ca56dadb | 597 | CALLOC_ARRAY(check->items, cnt); |
37293768 JH |
598 | |
599 | check->items[0].attr = git_attr(one); | |
600 | va_start(params, one); | |
601 | for (cnt = 1; cnt < check->nr; cnt++) { | |
602 | const struct git_attr *attr; | |
603 | param = va_arg(params, const char *); | |
604 | if (!param) | |
033abf97 | 605 | BUG("counted %d != ended at %d", |
37293768 JH |
606 | check->nr, cnt); |
607 | attr = git_attr(param); | |
608 | if (!attr) | |
033abf97 | 609 | BUG("%s: not a valid attribute name", param); |
37293768 JH |
610 | check->items[cnt].attr = attr; |
611 | } | |
612 | va_end(params); | |
613 | return check; | |
614 | } | |
615 | ||
b0db7046 BW |
616 | struct attr_check *attr_check_dup(const struct attr_check *check) |
617 | { | |
618 | struct attr_check *ret; | |
619 | ||
620 | if (!check) | |
621 | return NULL; | |
622 | ||
623 | ret = attr_check_alloc(); | |
624 | ||
625 | ret->nr = check->nr; | |
626 | ret->alloc = check->alloc; | |
6e578410 | 627 | DUP_ARRAY(ret->items, check->items, ret->nr); |
b0db7046 BW |
628 | |
629 | return ret; | |
630 | } | |
631 | ||
37293768 JH |
632 | struct attr_check_item *attr_check_append(struct attr_check *check, |
633 | const struct git_attr *attr) | |
634 | { | |
635 | struct attr_check_item *item; | |
636 | ||
637 | ALLOC_GROW(check->items, check->nr + 1, check->alloc); | |
638 | item = &check->items[check->nr++]; | |
639 | item->attr = attr; | |
640 | return item; | |
641 | } | |
642 | ||
643 | void attr_check_reset(struct attr_check *check) | |
644 | { | |
645 | check->nr = 0; | |
646 | } | |
647 | ||
648 | void attr_check_clear(struct attr_check *check) | |
649 | { | |
6a83d902 | 650 | FREE_AND_NULL(check->items); |
37293768 JH |
651 | check->alloc = 0; |
652 | check->nr = 0; | |
685b2925 | 653 | |
6a83d902 | 654 | FREE_AND_NULL(check->all_attrs); |
685b2925 | 655 | check->all_attrs_nr = 0; |
dc81cf37 BW |
656 | |
657 | drop_attr_stack(&check->stack); | |
37293768 JH |
658 | } |
659 | ||
660 | void attr_check_free(struct attr_check *check) | |
661 | { | |
dc81cf37 BW |
662 | if (check) { |
663 | /* Remove check from the check vector */ | |
664 | check_vector_remove(check); | |
665 | ||
666 | attr_check_clear(check); | |
667 | free(check); | |
668 | } | |
37293768 JH |
669 | } |
670 | ||
d0bfd026 | 671 | static const char *builtin_attr[] = { |
155a4b71 | 672 | "[attr]binary -diff -merge -text", |
d0bfd026 JH |
673 | NULL, |
674 | }; | |
675 | ||
a4413118 JH |
676 | static void handle_attr_line(struct attr_stack *res, |
677 | const char *line, | |
678 | const char *src, | |
679 | int lineno, | |
dbf387d5 | 680 | unsigned flags) |
a4413118 JH |
681 | { |
682 | struct match_attr *a; | |
683 | ||
dbf387d5 | 684 | a = parse_attr_line(line, src, lineno, flags); |
a4413118 JH |
685 | if (!a) |
686 | return; | |
447ac906 PS |
687 | ALLOC_GROW_BY(res->attrs, res->num_matches, 1, res->alloc); |
688 | res->attrs[res->num_matches - 1] = a; | |
a4413118 JH |
689 | } |
690 | ||
d0bfd026 JH |
691 | static struct attr_stack *read_attr_from_array(const char **list) |
692 | { | |
693 | struct attr_stack *res; | |
694 | const char *line; | |
f48fd688 | 695 | int lineno = 0; |
d0bfd026 | 696 | |
ca56dadb | 697 | CALLOC_ARRAY(res, 1); |
a4413118 | 698 | while ((line = *(list++)) != NULL) |
dbf387d5 JK |
699 | handle_attr_line(res, line, "[builtin]", ++lineno, |
700 | READ_ATTR_MACRO_OK); | |
d0bfd026 JH |
701 | return res; |
702 | } | |
703 | ||
7d42ec54 | 704 | /* |
f0dd0421 BW |
705 | * Callers into the attribute system assume there is a single, system-wide |
706 | * global state where attributes are read from and when the state is flipped by | |
707 | * calling git_attr_set_direction(), the stack frames that have been | |
abcb66c6 | 708 | * constructed need to be discarded so that subsequent calls into the |
f0dd0421 BW |
709 | * attribute system will lazily read from the right place. Since changing |
710 | * direction causes a global paradigm shift, it should not ever be called while | |
711 | * another thread could potentially be calling into the attribute system. | |
7d42ec54 | 712 | */ |
06f33c17 | 713 | static enum git_attr_direction direction; |
06f33c17 | 714 | |
c4500e25 | 715 | void git_attr_set_direction(enum git_attr_direction new_direction) |
f0dd0421 BW |
716 | { |
717 | if (is_bare_repository() && new_direction != GIT_ATTR_INDEX) | |
033abf97 | 718 | BUG("non-INDEX attr direction in a bare repo"); |
f0dd0421 BW |
719 | |
720 | if (new_direction != direction) | |
721 | drop_all_attr_stacks(); | |
722 | ||
723 | direction = new_direction; | |
f0dd0421 BW |
724 | } |
725 | ||
dbf387d5 | 726 | static struct attr_stack *read_attr_from_file(const char *path, unsigned flags) |
d0bfd026 | 727 | { |
d74b1fd5 | 728 | struct strbuf buf = STRBUF_INIT; |
2ef579e2 JK |
729 | int fd; |
730 | FILE *fp; | |
d0bfd026 | 731 | struct attr_stack *res; |
f48fd688 | 732 | int lineno = 0; |
3c50032f | 733 | struct stat st; |
d0bfd026 | 734 | |
2ef579e2 JK |
735 | if (flags & READ_ATTR_NOFOLLOW) |
736 | fd = open_nofollow(path, O_RDONLY); | |
737 | else | |
738 | fd = open(path, O_RDONLY); | |
739 | ||
740 | if (fd < 0) { | |
741 | warn_on_fopen_errors(path); | |
a4413118 | 742 | return NULL; |
2ef579e2 JK |
743 | } |
744 | fp = xfdopen(fd, "r"); | |
3c50032f PS |
745 | if (fstat(fd, &st)) { |
746 | warning_errno(_("cannot fstat gitattributes file '%s'"), path); | |
747 | fclose(fp); | |
748 | return NULL; | |
749 | } | |
750 | if (st.st_size >= ATTR_MAX_FILE_SIZE) { | |
751 | warning(_("ignoring overly large gitattributes file '%s'"), path); | |
752 | fclose(fp); | |
753 | return NULL; | |
754 | } | |
2ef579e2 | 755 | |
ca56dadb | 756 | CALLOC_ARRAY(res, 1); |
d74b1fd5 PS |
757 | while (strbuf_getline(&buf, fp) != EOF) { |
758 | if (!lineno && starts_with(buf.buf, utf8_bom)) | |
759 | strbuf_remove(&buf, 0, strlen(utf8_bom)); | |
8a755edd | 760 | handle_attr_line(res, buf.buf, path, ++lineno, flags); |
27547e5f | 761 | } |
d74b1fd5 | 762 | |
a4413118 | 763 | fclose(fp); |
d74b1fd5 | 764 | strbuf_release(&buf); |
a4413118 JH |
765 | return res; |
766 | } | |
d0bfd026 | 767 | |
47cfc9bd KN |
768 | static struct attr_stack *read_attr_from_buf(char *buf, const char *path, |
769 | unsigned flags) | |
a4413118 JH |
770 | { |
771 | struct attr_stack *res; | |
47cfc9bd | 772 | char *sp; |
1a9d7e9b | 773 | int lineno = 0; |
f48fd688 | 774 | |
47cfc9bd KN |
775 | if (!buf) |
776 | return NULL; | |
777 | ||
778 | CALLOC_ARRAY(res, 1); | |
779 | for (sp = buf; *sp;) { | |
780 | char *ep; | |
781 | int more; | |
782 | ||
783 | ep = strchrnul(sp, '\n'); | |
784 | more = (*ep == '\n'); | |
785 | *ep = '\0'; | |
786 | handle_attr_line(res, sp, path, ++lineno, flags); | |
787 | sp = ep + more; | |
788 | } | |
789 | free(buf); | |
790 | ||
791 | return res; | |
792 | } | |
793 | ||
794 | static struct attr_stack *read_attr_from_blob(struct index_state *istate, | |
795 | const struct object_id *tree_oid, | |
796 | const char *path, unsigned flags) | |
797 | { | |
798 | struct object_id oid; | |
799 | unsigned long sz; | |
800 | enum object_type type; | |
801 | void *buf; | |
802 | unsigned short mode; | |
803 | ||
804 | if (!tree_oid) | |
805 | return NULL; | |
806 | ||
807 | if (get_tree_entry(istate->repo, tree_oid, path, &oid, &mode)) | |
808 | return NULL; | |
809 | ||
810 | buf = repo_read_object_file(istate->repo, &oid, &type, &sz); | |
811 | if (!buf || type != OBJ_BLOB) { | |
812 | free(buf); | |
813 | return NULL; | |
814 | } | |
815 | ||
816 | return read_attr_from_buf(buf, path, flags); | |
817 | } | |
818 | ||
819 | static struct attr_stack *read_attr_from_index(struct index_state *istate, | |
820 | const char *path, unsigned flags) | |
821 | { | |
4723ae10 | 822 | struct attr_stack *stack = NULL; |
47cfc9bd | 823 | char *buf; |
37537d64 | 824 | unsigned long size; |
4723ae10 | 825 | int sparse_dir_pos = -1; |
f48fd688 | 826 | |
c4500e25 | 827 | if (!istate) |
7a400a2c NTND |
828 | return NULL; |
829 | ||
77efbb36 | 830 | /* |
4723ae10 SL |
831 | * When handling sparse-checkouts, .gitattributes files |
832 | * may reside within a sparse directory. We distinguish | |
833 | * whether a path exists directly in the index or not by | |
834 | * evaluating if 'pos' is negative. | |
835 | * If 'pos' is negative, the path is not directly present | |
836 | * in the index and is likely within a sparse directory. | |
837 | * For paths not in the index, The absolute value of 'pos' | |
838 | * minus 1 gives us the position where the path would be | |
839 | * inserted in lexicographic order within the index. | |
840 | * We then subtract another 1 from this value | |
841 | * (sparse_dir_pos = -pos - 2) to find the position of the | |
842 | * last index entry which is lexicographically smaller than | |
843 | * the path. This would be the sparse directory containing | |
844 | * the path. By identifying the sparse directory containing | |
845 | * the path, we can correctly read the attributes specified | |
846 | * in the .gitattributes file from the tree object of the | |
847 | * sparse directory. | |
77efbb36 | 848 | */ |
4723ae10 SL |
849 | if (!path_in_cone_mode_sparse_checkout(path, istate)) { |
850 | int pos = index_name_pos_sparse(istate, path, strlen(path)); | |
77efbb36 | 851 | |
4723ae10 SL |
852 | if (pos < 0) |
853 | sparse_dir_pos = -pos - 2; | |
3c50032f | 854 | } |
1a9d7e9b | 855 | |
4723ae10 SL |
856 | if (sparse_dir_pos >= 0 && |
857 | S_ISSPARSEDIR(istate->cache[sparse_dir_pos]->ce_mode) && | |
858 | !strncmp(istate->cache[sparse_dir_pos]->name, path, ce_namelen(istate->cache[sparse_dir_pos]))) { | |
859 | const char *relative_path = path + ce_namelen(istate->cache[sparse_dir_pos]); | |
860 | stack = read_attr_from_blob(istate, &istate->cache[sparse_dir_pos]->oid, relative_path, flags); | |
861 | } else { | |
862 | buf = read_blob_data_from_index(istate, path, &size); | |
863 | if (!buf) | |
864 | return NULL; | |
865 | if (size >= ATTR_MAX_FILE_SIZE) { | |
866 | warning(_("ignoring overly large gitattributes blob '%s'"), path); | |
867 | return NULL; | |
868 | } | |
869 | stack = read_attr_from_buf(buf, path, flags); | |
870 | } | |
871 | return stack; | |
d0bfd026 JH |
872 | } |
873 | ||
847a9e5d | 874 | static struct attr_stack *read_attr(struct index_state *istate, |
47cfc9bd | 875 | const struct object_id *tree_oid, |
dbf387d5 | 876 | const char *path, unsigned flags) |
06f33c17 | 877 | { |
0787dafd | 878 | struct attr_stack *res = NULL; |
06f33c17 | 879 | |
0787dafd | 880 | if (direction == GIT_ATTR_INDEX) { |
dbf387d5 | 881 | res = read_attr_from_index(istate, path, flags); |
47cfc9bd KN |
882 | } else if (tree_oid) { |
883 | res = read_attr_from_blob(istate, tree_oid, path, flags); | |
0787dafd BW |
884 | } else if (!is_bare_repository()) { |
885 | if (direction == GIT_ATTR_CHECKOUT) { | |
dbf387d5 | 886 | res = read_attr_from_index(istate, path, flags); |
0787dafd | 887 | if (!res) |
dbf387d5 | 888 | res = read_attr_from_file(path, flags); |
0787dafd | 889 | } else if (direction == GIT_ATTR_CHECKIN) { |
dbf387d5 | 890 | res = read_attr_from_file(path, flags); |
0787dafd BW |
891 | if (!res) |
892 | /* | |
893 | * There is no checked out .gitattributes file | |
894 | * there, but we might have it in the index. | |
895 | * We allow operation in a sparsely checked out | |
896 | * work tree, so read from it. | |
897 | */ | |
dbf387d5 | 898 | res = read_attr_from_index(istate, path, flags); |
0787dafd | 899 | } |
06f33c17 | 900 | } |
0787dafd | 901 | |
06f33c17 | 902 | if (!res) |
ca56dadb | 903 | CALLOC_ARRAY(res, 1); |
06f33c17 JH |
904 | return res; |
905 | } | |
906 | ||
15780bb4 | 907 | const char *git_attr_system_file(void) |
6df42ab9 PO |
908 | { |
909 | static const char *system_wide; | |
910 | if (!system_wide) | |
911 | system_wide = system_path(ETC_GITATTRIBUTES); | |
912 | return system_wide; | |
913 | } | |
914 | ||
15780bb4 | 915 | const char *git_attr_global_file(void) |
dc81cf37 BW |
916 | { |
917 | if (!git_attributes_file) | |
918 | git_attributes_file = xdg_config_home("attributes"); | |
919 | ||
920 | return git_attributes_file; | |
921 | } | |
922 | ||
15780bb4 | 923 | int git_attr_system_is_enabled(void) |
6df42ab9 PO |
924 | { |
925 | return !git_env_bool("GIT_ATTR_NOSYSTEM", 0); | |
926 | } | |
927 | ||
f932729c JK |
928 | static GIT_PATH_FUNC(git_path_info_attributes, INFOATTRIBUTES_FILE) |
929 | ||
4c0ce074 JH |
930 | static void push_stack(struct attr_stack **attr_stack_p, |
931 | struct attr_stack *elem, char *origin, size_t originlen) | |
932 | { | |
933 | if (elem) { | |
934 | elem->origin = origin; | |
935 | if (origin) | |
936 | elem->originlen = originlen; | |
937 | elem->prev = *attr_stack_p; | |
938 | *attr_stack_p = elem; | |
939 | } | |
940 | } | |
941 | ||
847a9e5d | 942 | static void bootstrap_attr_stack(struct index_state *istate, |
47cfc9bd | 943 | const struct object_id *tree_oid, |
7a400a2c | 944 | struct attr_stack **stack) |
f48fd688 | 945 | { |
dc81cf37 | 946 | struct attr_stack *e; |
dbf387d5 | 947 | unsigned flags = READ_ATTR_MACRO_OK; |
f48fd688 | 948 | |
dc81cf37 | 949 | if (*stack) |
909ca7b9 | 950 | return; |
f48fd688 | 951 | |
dc81cf37 BW |
952 | /* builtin frame */ |
953 | e = read_attr_from_array(builtin_attr); | |
954 | push_stack(stack, e, NULL, 0); | |
6df42ab9 | 955 | |
dc81cf37 | 956 | /* system-wide frame */ |
15780bb4 | 957 | if (git_attr_system_is_enabled()) { |
958 | e = read_attr_from_file(git_attr_system_file(), flags); | |
dc81cf37 BW |
959 | push_stack(stack, e, NULL, 0); |
960 | } | |
f48fd688 | 961 | |
dc81cf37 | 962 | /* home directory */ |
15780bb4 | 963 | if (git_attr_global_file()) { |
964 | e = read_attr_from_file(git_attr_global_file(), flags); | |
dc81cf37 | 965 | push_stack(stack, e, NULL, 0); |
f48fd688 | 966 | } |
909ca7b9 | 967 | |
dc81cf37 | 968 | /* root directory */ |
47cfc9bd | 969 | e = read_attr(istate, tree_oid, GITATTRIBUTES_FILE, flags | READ_ATTR_NOFOLLOW); |
dc81cf37 | 970 | push_stack(stack, e, xstrdup(""), 0); |
f0056f64 | 971 | |
dc81cf37 BW |
972 | /* info frame */ |
973 | if (startup_info->have_repository) | |
dbf387d5 | 974 | e = read_attr_from_file(git_path_info_attributes(), flags); |
dc81cf37 BW |
975 | else |
976 | e = NULL; | |
977 | if (!e) | |
ca56dadb | 978 | CALLOC_ARRAY(e, 1); |
dc81cf37 | 979 | push_stack(stack, e, NULL, 0); |
f48fd688 JH |
980 | } |
981 | ||
847a9e5d | 982 | static void prepare_attr_stack(struct index_state *istate, |
47cfc9bd | 983 | const struct object_id *tree_oid, |
7a400a2c | 984 | const char *path, int dirlen, |
dc81cf37 | 985 | struct attr_stack **stack) |
d0bfd026 | 986 | { |
dc81cf37 | 987 | struct attr_stack *info; |
0787dafd | 988 | struct strbuf pathbuf = STRBUF_INIT; |
a8727017 | 989 | |
d0bfd026 JH |
990 | /* |
991 | * At the bottom of the attribute stack is the built-in | |
6df42ab9 PO |
992 | * set of attribute definitions, followed by the contents |
993 | * of $(prefix)/etc/gitattributes and a file specified by | |
994 | * core.attributesfile. Then, contents from | |
bb101aaf | 995 | * .gitattributes files from directories closer to the |
d0bfd026 JH |
996 | * root to the ones in deeper directories are pushed |
997 | * to the stack. Finally, at the very top of the stack | |
998 | * we always keep the contents of $GIT_DIR/info/attributes. | |
999 | * | |
1000 | * When checking, we use entries from near the top of the | |
1001 | * stack, preferring $GIT_DIR/info/attributes, then | |
1002 | * .gitattributes in deeper directories to shallower ones, | |
1003 | * and finally use the built-in set as the default. | |
1004 | */ | |
47cfc9bd | 1005 | bootstrap_attr_stack(istate, tree_oid, stack); |
d0bfd026 JH |
1006 | |
1007 | /* | |
1008 | * Pop the "info" one that is always at the top of the stack. | |
1009 | */ | |
dc81cf37 BW |
1010 | info = *stack; |
1011 | *stack = info->prev; | |
d0bfd026 JH |
1012 | |
1013 | /* | |
1014 | * Pop the ones from directories that are not the prefix of | |
c432ef99 JH |
1015 | * the path we are checking. Break out of the loop when we see |
1016 | * the root one (whose origin is an empty string "") or the builtin | |
1017 | * one (whose origin is NULL) without popping it. | |
d0bfd026 | 1018 | */ |
dc81cf37 BW |
1019 | while ((*stack)->origin) { |
1020 | int namelen = (*stack)->originlen; | |
1021 | struct attr_stack *elem; | |
d0bfd026 | 1022 | |
dc81cf37 | 1023 | elem = *stack; |
d0bfd026 | 1024 | if (namelen <= dirlen && |
1afca444 JK |
1025 | !strncmp(elem->origin, path, namelen) && |
1026 | (!namelen || path[namelen] == '/')) | |
d0bfd026 JH |
1027 | break; |
1028 | ||
dc81cf37 BW |
1029 | *stack = elem->prev; |
1030 | attr_stack_free(elem); | |
d0bfd026 JH |
1031 | } |
1032 | ||
1033 | /* | |
0787dafd BW |
1034 | * bootstrap_attr_stack() should have added, and the |
1035 | * above loop should have stopped before popping, the | |
1036 | * root element whose attr_stack->origin is set to an | |
1037 | * empty string. | |
d0bfd026 | 1038 | */ |
0787dafd BW |
1039 | assert((*stack)->origin); |
1040 | ||
1041 | strbuf_addstr(&pathbuf, (*stack)->origin); | |
1042 | /* Build up to the directory 'path' is in */ | |
1043 | while (pathbuf.len < dirlen) { | |
1044 | size_t len = pathbuf.len; | |
1045 | struct attr_stack *next; | |
1046 | char *origin; | |
1047 | ||
1048 | /* Skip path-separator */ | |
1049 | if (len < dirlen && is_dir_sep(path[len])) | |
1050 | len++; | |
1051 | /* Find the end of the next component */ | |
1052 | while (len < dirlen && !is_dir_sep(path[len])) | |
1053 | len++; | |
1054 | ||
1055 | if (pathbuf.len > 0) | |
1056 | strbuf_addch(&pathbuf, '/'); | |
1057 | strbuf_add(&pathbuf, path + pathbuf.len, (len - pathbuf.len)); | |
1058 | strbuf_addf(&pathbuf, "/%s", GITATTRIBUTES_FILE); | |
1059 | ||
47cfc9bd | 1060 | next = read_attr(istate, tree_oid, pathbuf.buf, READ_ATTR_NOFOLLOW); |
0787dafd BW |
1061 | |
1062 | /* reset the pathbuf to not include "/.gitattributes" */ | |
1063 | strbuf_setlen(&pathbuf, len); | |
1064 | ||
1065 | origin = xstrdup(pathbuf.buf); | |
1066 | push_stack(stack, next, origin, len); | |
97410b27 | 1067 | } |
d4c98565 | 1068 | |
d0bfd026 JH |
1069 | /* |
1070 | * Finally push the "info" one at the top of the stack. | |
1071 | */ | |
dc81cf37 | 1072 | push_stack(stack, info, NULL, 0); |
0787dafd BW |
1073 | |
1074 | strbuf_release(&pathbuf); | |
d0bfd026 JH |
1075 | } |
1076 | ||
1077 | static int path_matches(const char *pathname, int pathlen, | |
bd2f371d | 1078 | int basename_offset, |
82dce998 | 1079 | const struct pattern *pat, |
d0bfd026 JH |
1080 | const char *base, int baselen) |
1081 | { | |
82dce998 NTND |
1082 | const char *pattern = pat->pattern; |
1083 | int prefix = pat->nowildcardlen; | |
dc09e9ec | 1084 | int isdir = (pathlen && pathname[pathlen - 1] == '/'); |
82dce998 | 1085 | |
4ff89ee5 | 1086 | if ((pat->flags & PATTERN_FLAG_MUSTBEDIR) && !isdir) |
94bc671a JNA |
1087 | return 0; |
1088 | ||
4ff89ee5 | 1089 | if (pat->flags & PATTERN_FLAG_NODIR) { |
bd2f371d | 1090 | return match_basename(pathname + basename_offset, |
dc09e9ec | 1091 | pathlen - basename_offset - isdir, |
82dce998 NTND |
1092 | pattern, prefix, |
1093 | pat->patternlen, pat->flags); | |
d0bfd026 | 1094 | } |
dc09e9ec | 1095 | return match_pathname(pathname, pathlen - isdir, |
82dce998 | 1096 | base, baselen, |
77651c03 | 1097 | pattern, prefix, pat->patternlen); |
d0bfd026 JH |
1098 | } |
1099 | ||
685b2925 | 1100 | static int macroexpand_one(struct all_attrs_item *all_attrs, int nr, int rem); |
ec775c41 | 1101 | |
69c5f17f | 1102 | static int fill_one(struct all_attrs_item *all_attrs, |
60a12722 | 1103 | const struct match_attr *a, int rem) |
515106fa | 1104 | { |
34ace8ba | 1105 | size_t i; |
515106fa | 1106 | |
34ace8ba PS |
1107 | for (i = a->num_attr; rem > 0 && i > 0; i--) { |
1108 | const struct git_attr *attr = a->state[i - 1].attr; | |
685b2925 | 1109 | const char **n = &(all_attrs[attr->attr_nr].value); |
34ace8ba | 1110 | const char *v = a->state[i - 1].setto; |
515106fa JH |
1111 | |
1112 | if (*n == ATTR__UNKNOWN) { | |
515106fa JH |
1113 | *n = v; |
1114 | rem--; | |
685b2925 | 1115 | rem = macroexpand_one(all_attrs, attr->attr_nr, rem); |
515106fa JH |
1116 | } |
1117 | } | |
1118 | return rem; | |
1119 | } | |
1120 | ||
bd2f371d | 1121 | static int fill(const char *path, int pathlen, int basename_offset, |
dc81cf37 BW |
1122 | const struct attr_stack *stack, |
1123 | struct all_attrs_item *all_attrs, int rem) | |
d0bfd026 | 1124 | { |
dc81cf37 | 1125 | for (; rem > 0 && stack; stack = stack->prev) { |
447ac906 | 1126 | unsigned i; |
dc81cf37 BW |
1127 | const char *base = stack->origin ? stack->origin : ""; |
1128 | ||
447ac906 PS |
1129 | for (i = stack->num_matches; 0 < rem && 0 < i; i--) { |
1130 | const struct match_attr *a = stack->attrs[i - 1]; | |
dc81cf37 BW |
1131 | if (a->is_macro) |
1132 | continue; | |
1133 | if (path_matches(path, pathlen, basename_offset, | |
1134 | &a->u.pat, base, stack->originlen)) | |
69c5f17f | 1135 | rem = fill_one(all_attrs, a, rem); |
dc81cf37 | 1136 | } |
d0bfd026 | 1137 | } |
dc81cf37 | 1138 | |
d0bfd026 JH |
1139 | return rem; |
1140 | } | |
1141 | ||
685b2925 | 1142 | static int macroexpand_one(struct all_attrs_item *all_attrs, int nr, int rem) |
f48fd688 | 1143 | { |
60a12722 | 1144 | const struct all_attrs_item *item = &all_attrs[nr]; |
f48fd688 | 1145 | |
60a12722 | 1146 | if (item->macro && item->value == ATTR__TRUE) |
69c5f17f | 1147 | return fill_one(all_attrs, item->macro, rem); |
60a12722 | 1148 | else |
ec775c41 | 1149 | return rem; |
60a12722 | 1150 | } |
ec775c41 | 1151 | |
60a12722 BW |
1152 | /* |
1153 | * Marks the attributes which are macros based on the attribute stack. | |
1154 | * This prevents having to search through the attribute stack each time | |
1155 | * a macro needs to be expanded during the fill stage. | |
1156 | */ | |
1157 | static void determine_macros(struct all_attrs_item *all_attrs, | |
1158 | const struct attr_stack *stack) | |
1159 | { | |
1160 | for (; stack; stack = stack->prev) { | |
447ac906 PS |
1161 | unsigned i; |
1162 | for (i = stack->num_matches; i > 0; i--) { | |
1163 | const struct match_attr *ma = stack->attrs[i - 1]; | |
60a12722 | 1164 | if (ma->is_macro) { |
e1e12e97 | 1165 | unsigned int n = ma->u.attr->attr_nr; |
60a12722 BW |
1166 | if (!all_attrs[n].macro) { |
1167 | all_attrs[n].macro = ma; | |
1168 | } | |
1169 | } | |
ec775c41 | 1170 | } |
4b0c6961 | 1171 | } |
f48fd688 JH |
1172 | } |
1173 | ||
2d721744 | 1174 | /* |
685b2925 BW |
1175 | * Collect attributes for path into the array pointed to by check->all_attrs. |
1176 | * If check->check_nr is non-zero, only attributes in check[] are collected. | |
1177 | * Otherwise all attributes are collected. | |
2d721744 | 1178 | */ |
847a9e5d | 1179 | static void collect_some_attrs(struct index_state *istate, |
47cfc9bd KN |
1180 | const struct object_id *tree_oid, |
1181 | const char *path, struct attr_check *check) | |
d0bfd026 | 1182 | { |
7b95849b | 1183 | int pathlen, rem, dirlen; |
bd2f371d JH |
1184 | const char *cp, *last_slash = NULL; |
1185 | int basename_offset; | |
9db9eecf NTND |
1186 | |
1187 | for (cp = path; *cp; cp++) { | |
1188 | if (*cp == '/' && cp[1]) | |
1189 | last_slash = cp; | |
1190 | } | |
1191 | pathlen = cp - path; | |
1192 | if (last_slash) { | |
bd2f371d | 1193 | basename_offset = last_slash + 1 - path; |
9db9eecf NTND |
1194 | dirlen = last_slash - path; |
1195 | } else { | |
bd2f371d | 1196 | basename_offset = 0; |
9db9eecf NTND |
1197 | dirlen = 0; |
1198 | } | |
d0bfd026 | 1199 | |
47cfc9bd | 1200 | prepare_attr_stack(istate, tree_oid, path, dirlen, &check->stack); |
685b2925 | 1201 | all_attrs_init(&g_attr_hashmap, check); |
dc81cf37 | 1202 | determine_macros(check->all_attrs, check->stack); |
685b2925 | 1203 | |
685b2925 | 1204 | rem = check->all_attrs_nr; |
dc81cf37 | 1205 | fill(path, pathlen, basename_offset, check->stack, check->all_attrs, rem); |
2d721744 MH |
1206 | } |
1207 | ||
44451a2e | 1208 | static const char *default_attr_source_tree_object_name; |
23865355 | 1209 | static int ignore_bad_attr_tree; |
44451a2e JC |
1210 | |
1211 | void set_git_attr_source(const char *tree_object_name) | |
1212 | { | |
1213 | default_attr_source_tree_object_name = xstrdup(tree_object_name); | |
1214 | } | |
1215 | ||
1216 | static void compute_default_attr_source(struct object_id *attr_source) | |
1217 | { | |
1218 | if (!default_attr_source_tree_object_name) | |
1219 | default_attr_source_tree_object_name = getenv(GIT_ATTR_SOURCE_ENVIRONMENT); | |
1220 | ||
9f9c40cf JC |
1221 | if (!default_attr_source_tree_object_name && git_attr_tree) { |
1222 | default_attr_source_tree_object_name = git_attr_tree; | |
1223 | ignore_bad_attr_tree = 1; | |
1224 | } | |
1225 | ||
23865355 JC |
1226 | if (!default_attr_source_tree_object_name && |
1227 | startup_info->have_repository && | |
1228 | is_bare_repository()) { | |
1229 | default_attr_source_tree_object_name = "HEAD"; | |
1230 | ignore_bad_attr_tree = 1; | |
1231 | } | |
1232 | ||
44451a2e JC |
1233 | if (!default_attr_source_tree_object_name || !is_null_oid(attr_source)) |
1234 | return; | |
1235 | ||
23865355 JC |
1236 | if (repo_get_oid_treeish(the_repository, |
1237 | default_attr_source_tree_object_name, | |
1238 | attr_source) && !ignore_bad_attr_tree) | |
44451a2e JC |
1239 | die(_("bad --attr-source or GIT_ATTR_SOURCE")); |
1240 | } | |
1241 | ||
1242 | static struct object_id *default_attr_source(void) | |
1243 | { | |
1244 | static struct object_id attr_source; | |
1245 | ||
1246 | if (is_null_oid(&attr_source)) | |
1247 | compute_default_attr_source(&attr_source); | |
1248 | if (is_null_oid(&attr_source)) | |
1249 | return NULL; | |
1250 | return &attr_source; | |
1251 | } | |
1252 | ||
2232a88a JW |
1253 | static const char *interned_mode_string(unsigned int mode) |
1254 | { | |
1255 | static struct { | |
1256 | unsigned int val; | |
1257 | char str[7]; | |
1258 | } mode_string[] = { | |
1259 | { .val = 0040000 }, | |
1260 | { .val = 0100644 }, | |
1261 | { .val = 0100755 }, | |
1262 | { .val = 0120000 }, | |
1263 | { .val = 0160000 }, | |
1264 | }; | |
1265 | int i; | |
1266 | ||
1267 | for (i = 0; i < ARRAY_SIZE(mode_string); i++) { | |
1268 | if (mode_string[i].val != mode) | |
1269 | continue; | |
1270 | if (!*mode_string[i].str) | |
1271 | snprintf(mode_string[i].str, sizeof(mode_string[i].str), | |
1272 | "%06o", mode); | |
1273 | return mode_string[i].str; | |
1274 | } | |
1275 | BUG("Unsupported mode 0%o", mode); | |
1276 | } | |
1277 | ||
1278 | static const char *builtin_object_mode_attr(struct index_state *istate, const char *path) | |
1279 | { | |
1280 | unsigned int mode; | |
1281 | ||
1282 | if (direction == GIT_ATTR_CHECKIN) { | |
1283 | struct object_id oid; | |
1284 | struct stat st; | |
1285 | if (lstat(path, &st)) | |
1286 | die_errno(_("unable to stat '%s'"), path); | |
1287 | mode = canon_mode(st.st_mode); | |
1288 | if (S_ISDIR(mode)) { | |
1289 | /* | |
1290 | *`path` is either a directory or it is a submodule, | |
1291 | * in which case it is already indexed as submodule | |
1292 | * or it does not exist in the index yet and we need to | |
1293 | * check if we can resolve to a ref. | |
1294 | */ | |
1295 | int pos = index_name_pos(istate, path, strlen(path)); | |
1296 | if (pos >= 0) { | |
1297 | if (S_ISGITLINK(istate->cache[pos]->ce_mode)) | |
1298 | mode = istate->cache[pos]->ce_mode; | |
1299 | } else if (resolve_gitlink_ref(path, "HEAD", &oid) == 0) { | |
1300 | mode = S_IFGITLINK; | |
1301 | } | |
1302 | } | |
1303 | } else { | |
1304 | /* | |
1305 | * For GIT_ATTR_CHECKOUT and GIT_ATTR_INDEX we only check | |
1306 | * for mode in the index. | |
1307 | */ | |
1308 | int pos = index_name_pos(istate, path, strlen(path)); | |
1309 | if (pos >= 0) | |
1310 | mode = istate->cache[pos]->ce_mode; | |
1311 | else | |
1312 | return ATTR__UNSET; | |
1313 | } | |
1314 | ||
1315 | return interned_mode_string(mode); | |
1316 | } | |
1317 | ||
1318 | ||
1319 | static const char *compute_builtin_attr(struct index_state *istate, | |
1320 | const char *path, | |
1321 | const struct git_attr *attr) { | |
1322 | static const struct git_attr *object_mode_attr; | |
1323 | ||
1324 | if (!object_mode_attr) | |
1325 | object_mode_attr = git_attr("builtin_objectmode"); | |
1326 | ||
1327 | if (attr == object_mode_attr) | |
1328 | return builtin_object_mode_attr(istate, path); | |
1329 | return ATTR__UNSET; | |
1330 | } | |
1331 | ||
847a9e5d | 1332 | void git_check_attr(struct index_state *istate, |
44451a2e | 1333 | const char *path, |
d64324cb | 1334 | struct attr_check *check) |
2d721744 MH |
1335 | { |
1336 | int i; | |
44451a2e | 1337 | const struct object_id *tree_oid = default_attr_source(); |
2d721744 | 1338 | |
47cfc9bd | 1339 | collect_some_attrs(istate, tree_oid, path, check); |
f48fd688 | 1340 | |
6bc2e3f7 | 1341 | for (i = 0; i < check->nr; i++) { |
e1e12e97 | 1342 | unsigned int n = check->items[i].attr->attr_nr; |
685b2925 | 1343 | const char *value = check->all_attrs[n].value; |
515106fa | 1344 | if (value == ATTR__UNKNOWN) |
2232a88a | 1345 | value = compute_builtin_attr(istate, path, check->all_attrs[n].attr); |
6bc2e3f7 | 1346 | check->items[i].value = value; |
515106fa | 1347 | } |
d0bfd026 | 1348 | } |
06f33c17 | 1349 | |
44451a2e | 1350 | void git_all_attrs(struct index_state *istate, |
7a400a2c | 1351 | const char *path, struct attr_check *check) |
ee548df3 | 1352 | { |
7f864111 | 1353 | int i; |
44451a2e | 1354 | const struct object_id *tree_oid = default_attr_source(); |
ee548df3 | 1355 | |
7f864111 | 1356 | attr_check_reset(check); |
47cfc9bd | 1357 | collect_some_attrs(istate, tree_oid, path, check); |
ee548df3 | 1358 | |
685b2925 BW |
1359 | for (i = 0; i < check->all_attrs_nr; i++) { |
1360 | const char *name = check->all_attrs[i].attr->name; | |
1361 | const char *value = check->all_attrs[i].value; | |
7f864111 JH |
1362 | struct attr_check_item *item; |
1363 | if (value == ATTR__UNSET || value == ATTR__UNKNOWN) | |
1364 | continue; | |
1365 | item = attr_check_append(check, git_attr(name)); | |
1366 | item->value = value; | |
ee548df3 | 1367 | } |
ee548df3 MH |
1368 | } |
1369 | ||
1a600b75 BW |
1370 | void attr_start(void) |
1371 | { | |
1a600b75 | 1372 | pthread_mutex_init(&g_attr_hashmap.mutex, NULL); |
dc81cf37 | 1373 | pthread_mutex_init(&check_vector.mutex, NULL); |
1a600b75 | 1374 | } |