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