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