]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Handle git attributes. See gitattributes(5) for a description of | |
3 | * the file syntax, and attr.h for a description of the API. | |
4 | * | |
5 | * One basic design decision here is that we are not going to support | |
6 | * an insanely large number of attributes. | |
7 | */ | |
8 | ||
9 | #include "git-compat-util.h" | |
10 | #include "config.h" | |
11 | #include "environment.h" | |
12 | #include "exec-cmd.h" | |
13 | #include "attr.h" | |
14 | #include "dir.h" | |
15 | #include "gettext.h" | |
16 | #include "path.h" | |
17 | #include "utf8.h" | |
18 | #include "quote.h" | |
19 | #include "read-cache-ll.h" | |
20 | #include "refs.h" | |
21 | #include "revision.h" | |
22 | #include "object-store-ll.h" | |
23 | #include "setup.h" | |
24 | #include "thread-utils.h" | |
25 | #include "tree-walk.h" | |
26 | #include "object-name.h" | |
27 | ||
28 | const char *git_attr_tree; | |
29 | ||
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 | |
37 | ||
38 | struct git_attr { | |
39 | unsigned int attr_nr; /* unique attribute number */ | |
40 | char name[FLEX_ARRAY]; /* attribute name */ | |
41 | }; | |
42 | ||
43 | const char *git_attr_name(const struct git_attr *attr) | |
44 | { | |
45 | return attr->name; | |
46 | } | |
47 | ||
48 | struct attr_hashmap { | |
49 | struct hashmap map; | |
50 | pthread_mutex_t mutex; | |
51 | }; | |
52 | ||
53 | static inline void hashmap_lock(struct attr_hashmap *map) | |
54 | { | |
55 | pthread_mutex_lock(&map->mutex); | |
56 | } | |
57 | ||
58 | static inline void hashmap_unlock(struct attr_hashmap *map) | |
59 | { | |
60 | pthread_mutex_unlock(&map->mutex); | |
61 | } | |
62 | ||
63 | /* The container for objects stored in "struct attr_hashmap" */ | |
64 | struct attr_hash_entry { | |
65 | struct hashmap_entry ent; | |
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 */ | |
72 | static int attr_hash_entry_cmp(const void *cmp_data UNUSED, | |
73 | const struct hashmap_entry *eptr, | |
74 | const struct hashmap_entry *entry_or_key, | |
75 | const void *keydata UNUSED) | |
76 | { | |
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); | |
81 | return (a->keylen != b->keylen) || strncmp(a->key, b->key, a->keylen); | |
82 | } | |
83 | ||
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 = { | |
90 | .map = HASHMAP_INIT(attr_hash_entry_cmp, NULL), | |
91 | }; | |
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 | ||
103 | hashmap_entry_init(&k.ent, memhash(key, keylen)); | |
104 | k.key = key; | |
105 | k.keylen = keylen; | |
106 | e = hashmap_get_entry(&map->map, &k, ent, NULL); | |
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 | ||
118 | e = xmalloc(sizeof(struct attr_hash_entry)); | |
119 | hashmap_entry_init(&e->ent, memhash(key, keylen)); | |
120 | e->key = key; | |
121 | e->keylen = keylen; | |
122 | e->value = value; | |
123 | ||
124 | hashmap_add(&map->map, &e->ent); | |
125 | } | |
126 | ||
127 | struct all_attrs_item { | |
128 | const struct git_attr *attr; | |
129 | const char *value; | |
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; | |
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; | |
146 | unsigned int size; | |
147 | ||
148 | hashmap_lock(map); | |
149 | ||
150 | size = hashmap_get_size(&map->map); | |
151 | if (size < check->all_attrs_nr) | |
152 | BUG("interned attributes shouldn't be deleted"); | |
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 | */ | |
160 | if (size != check->all_attrs_nr) { | |
161 | struct attr_hash_entry *e; | |
162 | struct hashmap_iter iter; | |
163 | ||
164 | REALLOC_ARRAY(check->all_attrs, size); | |
165 | check->all_attrs_nr = size; | |
166 | ||
167 | hashmap_for_each_entry(&map->map, &iter, e, | |
168 | ent /* member name */) { | |
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; | |
183 | check->all_attrs[i].macro = NULL; | |
184 | } | |
185 | } | |
186 | ||
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 | ||
196 | static int attr_name_valid(const char *name, size_t namelen) | |
197 | { | |
198 | /* | |
199 | * Attribute name cannot begin with '-' and must consist of | |
200 | * characters from [-A-Za-z0-9_.]. | |
201 | */ | |
202 | if (namelen <= 0 || *name == '-') | |
203 | return 0; | |
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')) ) | |
210 | return 0; | |
211 | } | |
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); | |
223 | } | |
224 | ||
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 | */ | |
230 | static const struct git_attr *git_attr_internal(const char *name, size_t namelen) | |
231 | { | |
232 | struct git_attr *a; | |
233 | ||
234 | if (!attr_name_valid(name, namelen)) | |
235 | return NULL; | |
236 | ||
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); | |
243 | a->attr_nr = hashmap_get_size(&g_attr_hashmap.map); | |
244 | ||
245 | attr_hashmap_add(&g_attr_hashmap, a->name, namelen, a); | |
246 | if (a->attr_nr != hashmap_get_size(&g_attr_hashmap.map) - 1) | |
247 | die(_("unable to add additional attribute")); | |
248 | } | |
249 | ||
250 | hashmap_unlock(&g_attr_hashmap); | |
251 | ||
252 | return a; | |
253 | } | |
254 | ||
255 | const struct git_attr *git_attr(const char *name) | |
256 | { | |
257 | return git_attr_internal(name, strlen(name)); | |
258 | } | |
259 | ||
260 | /* What does a matched pattern decide? */ | |
261 | struct attr_state { | |
262 | const struct git_attr *attr; | |
263 | const char *setto; | |
264 | }; | |
265 | ||
266 | struct pattern { | |
267 | const char *pattern; | |
268 | int patternlen; | |
269 | int nowildcardlen; | |
270 | unsigned flags; /* PATTERN_FLAG_* */ | |
271 | }; | |
272 | ||
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 | * | |
279 | * If is_macro is false, then u.pat is the filename pattern to which the | |
280 | * rule applies. | |
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 | */ | |
286 | struct match_attr { | |
287 | union { | |
288 | struct pattern pat; | |
289 | const struct git_attr *attr; | |
290 | } u; | |
291 | char is_macro; | |
292 | size_t num_attr; | |
293 | struct attr_state state[FLEX_ARRAY]; | |
294 | }; | |
295 | ||
296 | static const char blank[] = " \t\r\n"; | |
297 | ||
298 | /* Flags usable in read_attr() and parse_attr_line() family of functions. */ | |
299 | #define READ_ATTR_MACRO_OK (1<<0) | |
300 | #define READ_ATTR_NOFOLLOW (1<<1) | |
301 | ||
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 | */ | |
309 | static const char *parse_attr(const char *src, int lineno, const char *cp, | |
310 | struct attr_state *e) | |
311 | { | |
312 | const char *ep, *equals; | |
313 | size_t len; | |
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; | |
323 | if (!e) { | |
324 | if (*cp == '-' || *cp == '!') { | |
325 | cp++; | |
326 | len--; | |
327 | } | |
328 | if (!attr_name_valid(cp, len) || attr_name_reserved(cp)) { | |
329 | report_invalid_attr(cp, len, src, lineno); | |
330 | return NULL; | |
331 | } | |
332 | } else { | |
333 | /* | |
334 | * As this function is always called twice, once with | |
335 | * e == NULL in the first pass and then e != NULL in | |
336 | * the second pass, no need for attr_name_valid() | |
337 | * check here. | |
338 | */ | |
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 { | |
347 | e->setto = xmemdupz(equals + 1, ep - equals - 1); | |
348 | } | |
349 | e->attr = git_attr_internal(cp, len); | |
350 | } | |
351 | return ep + strspn(ep, blank); | |
352 | } | |
353 | ||
354 | static struct match_attr *parse_attr_line(const char *line, const char *src, | |
355 | int lineno, unsigned flags) | |
356 | { | |
357 | size_t namelen, num_attr, i; | |
358 | const char *cp, *name, *states; | |
359 | struct match_attr *res = NULL; | |
360 | int is_macro; | |
361 | struct strbuf pattern = STRBUF_INIT; | |
362 | ||
363 | cp = line + strspn(line, blank); | |
364 | if (!*cp || *cp == '#') | |
365 | return NULL; | |
366 | name = cp; | |
367 | ||
368 | if (strlen(line) >= ATTR_MAX_LINE_LENGTH) { | |
369 | warning(_("ignoring overly long attributes line %d"), lineno); | |
370 | return NULL; | |
371 | } | |
372 | ||
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 | ||
381 | if (strlen(ATTRIBUTE_MACRO_PREFIX) < namelen && | |
382 | starts_with(name, ATTRIBUTE_MACRO_PREFIX)) { | |
383 | if (!(flags & READ_ATTR_MACRO_OK)) { | |
384 | fprintf_ln(stderr, _("%s not allowed: %s:%d"), | |
385 | name, src, lineno); | |
386 | goto fail_return; | |
387 | } | |
388 | is_macro = 1; | |
389 | name += strlen(ATTRIBUTE_MACRO_PREFIX); | |
390 | name += strspn(name, blank); | |
391 | namelen = strcspn(name, blank); | |
392 | if (!attr_name_valid(name, namelen) || attr_name_reserved(name)) { | |
393 | report_invalid_attr(name, namelen, src, lineno); | |
394 | goto fail_return; | |
395 | } | |
396 | } | |
397 | else | |
398 | is_macro = 0; | |
399 | ||
400 | states += strspn(states, blank); | |
401 | ||
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) | |
406 | goto fail_return; | |
407 | } | |
408 | ||
409 | res = xcalloc(1, st_add3(sizeof(*res), | |
410 | st_mult(sizeof(struct attr_state), num_attr), | |
411 | is_macro ? 0 : namelen + 1)); | |
412 | if (is_macro) { | |
413 | res->u.attr = git_attr_internal(name, namelen); | |
414 | } else { | |
415 | char *p = (char *)&(res->state[num_attr]); | |
416 | memcpy(p, name, namelen); | |
417 | res->u.pat.pattern = p; | |
418 | parse_path_pattern(&res->u.pat.pattern, | |
419 | &res->u.pat.patternlen, | |
420 | &res->u.pat.flags, | |
421 | &res->u.pat.nowildcardlen); | |
422 | if (res->u.pat.flags & PATTERN_FLAG_NEGATIVE) { | |
423 | warning(_("Negative patterns are ignored in git attributes\n" | |
424 | "Use '\\!' for literal leading exclamation.")); | |
425 | goto fail_return; | |
426 | } | |
427 | } | |
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 | ||
436 | strbuf_release(&pattern); | |
437 | return res; | |
438 | ||
439 | fail_return: | |
440 | strbuf_release(&pattern); | |
441 | free(res); | |
442 | return NULL; | |
443 | } | |
444 | ||
445 | /* | |
446 | * Like info/exclude and .gitignore, the attribute information can | |
447 | * come from many places. | |
448 | * | |
449 | * (1) .gitattributes file of the same directory; | |
450 | * (2) .gitattributes file of the parent directory if (1) does not have | |
451 | * any match; this goes recursively upwards, just like .gitignore. | |
452 | * (3) $GIT_DIR/info/attributes, which overrides both of the above. | |
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 | |
456 | * (reading the file from top to bottom), .gitattributes of the root | |
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. | |
459 | * This is exactly the same as what is_excluded() does in dir.c to deal with | |
460 | * .gitignore file and info/excludes file as a fallback. | |
461 | */ | |
462 | ||
463 | struct attr_stack { | |
464 | struct attr_stack *prev; | |
465 | char *origin; | |
466 | size_t originlen; | |
467 | unsigned num_matches; | |
468 | unsigned alloc; | |
469 | struct match_attr **attrs; | |
470 | }; | |
471 | ||
472 | static void attr_stack_free(struct attr_stack *e) | |
473 | { | |
474 | unsigned i; | |
475 | free(e->origin); | |
476 | for (i = 0; i < e->num_matches; i++) { | |
477 | struct match_attr *a = e->attrs[i]; | |
478 | size_t j; | |
479 | ||
480 | for (j = 0; j < a->num_attr; j++) { | |
481 | const char *setto = a->state[j].setto; | |
482 | if (setto == ATTR__TRUE || | |
483 | setto == ATTR__FALSE || | |
484 | setto == ATTR__UNSET || | |
485 | setto == ATTR__UNKNOWN) | |
486 | ; | |
487 | else | |
488 | free((char *) setto); | |
489 | } | |
490 | free(a); | |
491 | } | |
492 | free(e->attrs); | |
493 | free(e); | |
494 | } | |
495 | ||
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; | |
510 | pthread_mutex_t mutex; | |
511 | } check_vector; | |
512 | ||
513 | static inline void vector_lock(void) | |
514 | { | |
515 | pthread_mutex_lock(&check_vector.mutex); | |
516 | } | |
517 | ||
518 | static inline void vector_unlock(void) | |
519 | { | |
520 | pthread_mutex_unlock(&check_vector.mutex); | |
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) | |
547 | BUG("no entry found"); | |
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 | ||
572 | struct attr_check *attr_check_alloc(void) | |
573 | { | |
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; | |
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; | |
597 | CALLOC_ARRAY(check->items, cnt); | |
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) | |
605 | BUG("counted %d != ended at %d", | |
606 | check->nr, cnt); | |
607 | attr = git_attr(param); | |
608 | if (!attr) | |
609 | BUG("%s: not a valid attribute name", param); | |
610 | check->items[cnt].attr = attr; | |
611 | } | |
612 | va_end(params); | |
613 | return check; | |
614 | } | |
615 | ||
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; | |
627 | DUP_ARRAY(ret->items, check->items, ret->nr); | |
628 | ||
629 | return ret; | |
630 | } | |
631 | ||
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 | { | |
650 | FREE_AND_NULL(check->items); | |
651 | check->alloc = 0; | |
652 | check->nr = 0; | |
653 | ||
654 | FREE_AND_NULL(check->all_attrs); | |
655 | check->all_attrs_nr = 0; | |
656 | ||
657 | drop_attr_stack(&check->stack); | |
658 | } | |
659 | ||
660 | void attr_check_free(struct attr_check *check) | |
661 | { | |
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 | } | |
669 | } | |
670 | ||
671 | static const char *builtin_attr[] = { | |
672 | "[attr]binary -diff -merge -text", | |
673 | NULL, | |
674 | }; | |
675 | ||
676 | static void handle_attr_line(struct attr_stack *res, | |
677 | const char *line, | |
678 | const char *src, | |
679 | int lineno, | |
680 | unsigned flags) | |
681 | { | |
682 | struct match_attr *a; | |
683 | ||
684 | a = parse_attr_line(line, src, lineno, flags); | |
685 | if (!a) | |
686 | return; | |
687 | ALLOC_GROW_BY(res->attrs, res->num_matches, 1, res->alloc); | |
688 | res->attrs[res->num_matches - 1] = a; | |
689 | } | |
690 | ||
691 | static struct attr_stack *read_attr_from_array(const char **list) | |
692 | { | |
693 | struct attr_stack *res; | |
694 | const char *line; | |
695 | int lineno = 0; | |
696 | ||
697 | CALLOC_ARRAY(res, 1); | |
698 | while ((line = *(list++)) != NULL) | |
699 | handle_attr_line(res, line, "[builtin]", ++lineno, | |
700 | READ_ATTR_MACRO_OK); | |
701 | return res; | |
702 | } | |
703 | ||
704 | /* | |
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 | |
708 | * constructed need to be discarded so that subsequent calls into the | |
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. | |
712 | */ | |
713 | static enum git_attr_direction direction; | |
714 | ||
715 | void git_attr_set_direction(enum git_attr_direction new_direction) | |
716 | { | |
717 | if (is_bare_repository() && new_direction != GIT_ATTR_INDEX) | |
718 | BUG("non-INDEX attr direction in a bare repo"); | |
719 | ||
720 | if (new_direction != direction) | |
721 | drop_all_attr_stacks(); | |
722 | ||
723 | direction = new_direction; | |
724 | } | |
725 | ||
726 | static struct attr_stack *read_attr_from_file(const char *path, unsigned flags) | |
727 | { | |
728 | struct strbuf buf = STRBUF_INIT; | |
729 | int fd; | |
730 | FILE *fp; | |
731 | struct attr_stack *res; | |
732 | int lineno = 0; | |
733 | struct stat st; | |
734 | ||
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); | |
742 | return NULL; | |
743 | } | |
744 | fp = xfdopen(fd, "r"); | |
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 | } | |
755 | ||
756 | CALLOC_ARRAY(res, 1); | |
757 | while (strbuf_getline(&buf, fp) != EOF) { | |
758 | if (!lineno && starts_with(buf.buf, utf8_bom)) | |
759 | strbuf_remove(&buf, 0, strlen(utf8_bom)); | |
760 | handle_attr_line(res, buf.buf, path, ++lineno, flags); | |
761 | } | |
762 | ||
763 | fclose(fp); | |
764 | strbuf_release(&buf); | |
765 | return res; | |
766 | } | |
767 | ||
768 | static struct attr_stack *read_attr_from_buf(char *buf, size_t length, | |
769 | const char *path, unsigned flags) | |
770 | { | |
771 | struct attr_stack *res; | |
772 | char *sp; | |
773 | int lineno = 0; | |
774 | ||
775 | if (!buf) | |
776 | return NULL; | |
777 | if (length >= ATTR_MAX_FILE_SIZE) { | |
778 | warning(_("ignoring overly large gitattributes blob '%s'"), path); | |
779 | free(buf); | |
780 | return NULL; | |
781 | } | |
782 | ||
783 | CALLOC_ARRAY(res, 1); | |
784 | for (sp = buf; *sp;) { | |
785 | char *ep; | |
786 | int more; | |
787 | ||
788 | ep = strchrnul(sp, '\n'); | |
789 | more = (*ep == '\n'); | |
790 | *ep = '\0'; | |
791 | handle_attr_line(res, sp, path, ++lineno, flags); | |
792 | sp = ep + more; | |
793 | } | |
794 | free(buf); | |
795 | ||
796 | return res; | |
797 | } | |
798 | ||
799 | static struct attr_stack *read_attr_from_blob(struct index_state *istate, | |
800 | const struct object_id *tree_oid, | |
801 | const char *path, unsigned flags) | |
802 | { | |
803 | struct object_id oid; | |
804 | unsigned long sz; | |
805 | enum object_type type; | |
806 | void *buf; | |
807 | unsigned short mode; | |
808 | ||
809 | if (!tree_oid) | |
810 | return NULL; | |
811 | ||
812 | if (get_tree_entry(istate->repo, tree_oid, path, &oid, &mode)) | |
813 | return NULL; | |
814 | ||
815 | buf = repo_read_object_file(istate->repo, &oid, &type, &sz); | |
816 | if (!buf || type != OBJ_BLOB) { | |
817 | free(buf); | |
818 | return NULL; | |
819 | } | |
820 | ||
821 | return read_attr_from_buf(buf, sz, path, flags); | |
822 | } | |
823 | ||
824 | static struct attr_stack *read_attr_from_index(struct index_state *istate, | |
825 | const char *path, unsigned flags) | |
826 | { | |
827 | struct attr_stack *stack = NULL; | |
828 | char *buf; | |
829 | unsigned long size; | |
830 | int sparse_dir_pos = -1; | |
831 | ||
832 | if (!istate) | |
833 | return NULL; | |
834 | ||
835 | /* | |
836 | * When handling sparse-checkouts, .gitattributes files | |
837 | * may reside within a sparse directory. We distinguish | |
838 | * whether a path exists directly in the index or not by | |
839 | * evaluating if 'pos' is negative. | |
840 | * If 'pos' is negative, the path is not directly present | |
841 | * in the index and is likely within a sparse directory. | |
842 | * For paths not in the index, The absolute value of 'pos' | |
843 | * minus 1 gives us the position where the path would be | |
844 | * inserted in lexicographic order within the index. | |
845 | * We then subtract another 1 from this value | |
846 | * (sparse_dir_pos = -pos - 2) to find the position of the | |
847 | * last index entry which is lexicographically smaller than | |
848 | * the path. This would be the sparse directory containing | |
849 | * the path. By identifying the sparse directory containing | |
850 | * the path, we can correctly read the attributes specified | |
851 | * in the .gitattributes file from the tree object of the | |
852 | * sparse directory. | |
853 | */ | |
854 | if (!path_in_cone_mode_sparse_checkout(path, istate)) { | |
855 | int pos = index_name_pos_sparse(istate, path, strlen(path)); | |
856 | ||
857 | if (pos < 0) | |
858 | sparse_dir_pos = -pos - 2; | |
859 | } | |
860 | ||
861 | if (sparse_dir_pos >= 0 && | |
862 | S_ISSPARSEDIR(istate->cache[sparse_dir_pos]->ce_mode) && | |
863 | !strncmp(istate->cache[sparse_dir_pos]->name, path, ce_namelen(istate->cache[sparse_dir_pos]))) { | |
864 | const char *relative_path = path + ce_namelen(istate->cache[sparse_dir_pos]); | |
865 | stack = read_attr_from_blob(istate, &istate->cache[sparse_dir_pos]->oid, relative_path, flags); | |
866 | } else { | |
867 | buf = read_blob_data_from_index(istate, path, &size); | |
868 | stack = read_attr_from_buf(buf, size, path, flags); | |
869 | } | |
870 | return stack; | |
871 | } | |
872 | ||
873 | static struct attr_stack *read_attr(struct index_state *istate, | |
874 | const struct object_id *tree_oid, | |
875 | const char *path, unsigned flags) | |
876 | { | |
877 | struct attr_stack *res = NULL; | |
878 | ||
879 | if (direction == GIT_ATTR_INDEX) { | |
880 | res = read_attr_from_index(istate, path, flags); | |
881 | } else if (tree_oid) { | |
882 | res = read_attr_from_blob(istate, tree_oid, path, flags); | |
883 | } else if (!is_bare_repository()) { | |
884 | if (direction == GIT_ATTR_CHECKOUT) { | |
885 | res = read_attr_from_index(istate, path, flags); | |
886 | if (!res) | |
887 | res = read_attr_from_file(path, flags); | |
888 | } else if (direction == GIT_ATTR_CHECKIN) { | |
889 | res = read_attr_from_file(path, flags); | |
890 | if (!res) | |
891 | /* | |
892 | * There is no checked out .gitattributes file | |
893 | * there, but we might have it in the index. | |
894 | * We allow operation in a sparsely checked out | |
895 | * work tree, so read from it. | |
896 | */ | |
897 | res = read_attr_from_index(istate, path, flags); | |
898 | } | |
899 | } | |
900 | ||
901 | if (!res) | |
902 | CALLOC_ARRAY(res, 1); | |
903 | return res; | |
904 | } | |
905 | ||
906 | const char *git_attr_system_file(void) | |
907 | { | |
908 | static const char *system_wide; | |
909 | if (!system_wide) | |
910 | system_wide = system_path(ETC_GITATTRIBUTES); | |
911 | return system_wide; | |
912 | } | |
913 | ||
914 | const char *git_attr_global_file(void) | |
915 | { | |
916 | if (!git_attributes_file) | |
917 | git_attributes_file = xdg_config_home("attributes"); | |
918 | ||
919 | return git_attributes_file; | |
920 | } | |
921 | ||
922 | int git_attr_system_is_enabled(void) | |
923 | { | |
924 | return !git_env_bool("GIT_ATTR_NOSYSTEM", 0); | |
925 | } | |
926 | ||
927 | static GIT_PATH_FUNC(git_path_info_attributes, INFOATTRIBUTES_FILE) | |
928 | ||
929 | static void push_stack(struct attr_stack **attr_stack_p, | |
930 | struct attr_stack *elem, char *origin, size_t originlen) | |
931 | { | |
932 | if (elem) { | |
933 | elem->origin = origin; | |
934 | if (origin) | |
935 | elem->originlen = originlen; | |
936 | elem->prev = *attr_stack_p; | |
937 | *attr_stack_p = elem; | |
938 | } | |
939 | } | |
940 | ||
941 | static void bootstrap_attr_stack(struct index_state *istate, | |
942 | const struct object_id *tree_oid, | |
943 | struct attr_stack **stack) | |
944 | { | |
945 | struct attr_stack *e; | |
946 | unsigned flags = READ_ATTR_MACRO_OK; | |
947 | ||
948 | if (*stack) | |
949 | return; | |
950 | ||
951 | /* builtin frame */ | |
952 | e = read_attr_from_array(builtin_attr); | |
953 | push_stack(stack, e, NULL, 0); | |
954 | ||
955 | /* system-wide frame */ | |
956 | if (git_attr_system_is_enabled()) { | |
957 | e = read_attr_from_file(git_attr_system_file(), flags); | |
958 | push_stack(stack, e, NULL, 0); | |
959 | } | |
960 | ||
961 | /* home directory */ | |
962 | if (git_attr_global_file()) { | |
963 | e = read_attr_from_file(git_attr_global_file(), flags); | |
964 | push_stack(stack, e, NULL, 0); | |
965 | } | |
966 | ||
967 | /* root directory */ | |
968 | e = read_attr(istate, tree_oid, GITATTRIBUTES_FILE, flags | READ_ATTR_NOFOLLOW); | |
969 | push_stack(stack, e, xstrdup(""), 0); | |
970 | ||
971 | /* info frame */ | |
972 | if (startup_info->have_repository) | |
973 | e = read_attr_from_file(git_path_info_attributes(), flags); | |
974 | else | |
975 | e = NULL; | |
976 | if (!e) | |
977 | CALLOC_ARRAY(e, 1); | |
978 | push_stack(stack, e, NULL, 0); | |
979 | } | |
980 | ||
981 | static void prepare_attr_stack(struct index_state *istate, | |
982 | const struct object_id *tree_oid, | |
983 | const char *path, int dirlen, | |
984 | struct attr_stack **stack) | |
985 | { | |
986 | struct attr_stack *info; | |
987 | struct strbuf pathbuf = STRBUF_INIT; | |
988 | ||
989 | /* | |
990 | * At the bottom of the attribute stack is the built-in | |
991 | * set of attribute definitions, followed by the contents | |
992 | * of $(prefix)/etc/gitattributes and a file specified by | |
993 | * core.attributesfile. Then, contents from | |
994 | * .gitattributes files from directories closer to the | |
995 | * root to the ones in deeper directories are pushed | |
996 | * to the stack. Finally, at the very top of the stack | |
997 | * we always keep the contents of $GIT_DIR/info/attributes. | |
998 | * | |
999 | * When checking, we use entries from near the top of the | |
1000 | * stack, preferring $GIT_DIR/info/attributes, then | |
1001 | * .gitattributes in deeper directories to shallower ones, | |
1002 | * and finally use the built-in set as the default. | |
1003 | */ | |
1004 | bootstrap_attr_stack(istate, tree_oid, stack); | |
1005 | ||
1006 | /* | |
1007 | * Pop the "info" one that is always at the top of the stack. | |
1008 | */ | |
1009 | info = *stack; | |
1010 | *stack = info->prev; | |
1011 | ||
1012 | /* | |
1013 | * Pop the ones from directories that are not the prefix of | |
1014 | * the path we are checking. Break out of the loop when we see | |
1015 | * the root one (whose origin is an empty string "") or the builtin | |
1016 | * one (whose origin is NULL) without popping it. | |
1017 | */ | |
1018 | while ((*stack)->origin) { | |
1019 | int namelen = (*stack)->originlen; | |
1020 | struct attr_stack *elem; | |
1021 | ||
1022 | elem = *stack; | |
1023 | if (namelen <= dirlen && | |
1024 | !strncmp(elem->origin, path, namelen) && | |
1025 | (!namelen || path[namelen] == '/')) | |
1026 | break; | |
1027 | ||
1028 | *stack = elem->prev; | |
1029 | attr_stack_free(elem); | |
1030 | } | |
1031 | ||
1032 | /* | |
1033 | * bootstrap_attr_stack() should have added, and the | |
1034 | * above loop should have stopped before popping, the | |
1035 | * root element whose attr_stack->origin is set to an | |
1036 | * empty string. | |
1037 | */ | |
1038 | assert((*stack)->origin); | |
1039 | ||
1040 | strbuf_addstr(&pathbuf, (*stack)->origin); | |
1041 | /* Build up to the directory 'path' is in */ | |
1042 | while (pathbuf.len < dirlen) { | |
1043 | size_t len = pathbuf.len; | |
1044 | struct attr_stack *next; | |
1045 | char *origin; | |
1046 | ||
1047 | /* Skip path-separator */ | |
1048 | if (len < dirlen && is_dir_sep(path[len])) | |
1049 | len++; | |
1050 | /* Find the end of the next component */ | |
1051 | while (len < dirlen && !is_dir_sep(path[len])) | |
1052 | len++; | |
1053 | ||
1054 | if (pathbuf.len > 0) | |
1055 | strbuf_addch(&pathbuf, '/'); | |
1056 | strbuf_add(&pathbuf, path + pathbuf.len, (len - pathbuf.len)); | |
1057 | strbuf_addf(&pathbuf, "/%s", GITATTRIBUTES_FILE); | |
1058 | ||
1059 | next = read_attr(istate, tree_oid, pathbuf.buf, READ_ATTR_NOFOLLOW); | |
1060 | ||
1061 | /* reset the pathbuf to not include "/.gitattributes" */ | |
1062 | strbuf_setlen(&pathbuf, len); | |
1063 | ||
1064 | origin = xstrdup(pathbuf.buf); | |
1065 | push_stack(stack, next, origin, len); | |
1066 | } | |
1067 | ||
1068 | /* | |
1069 | * Finally push the "info" one at the top of the stack. | |
1070 | */ | |
1071 | push_stack(stack, info, NULL, 0); | |
1072 | ||
1073 | strbuf_release(&pathbuf); | |
1074 | } | |
1075 | ||
1076 | static int path_matches(const char *pathname, int pathlen, | |
1077 | int basename_offset, | |
1078 | const struct pattern *pat, | |
1079 | const char *base, int baselen) | |
1080 | { | |
1081 | const char *pattern = pat->pattern; | |
1082 | int prefix = pat->nowildcardlen; | |
1083 | int isdir = (pathlen && pathname[pathlen - 1] == '/'); | |
1084 | ||
1085 | if ((pat->flags & PATTERN_FLAG_MUSTBEDIR) && !isdir) | |
1086 | return 0; | |
1087 | ||
1088 | if (pat->flags & PATTERN_FLAG_NODIR) { | |
1089 | return match_basename(pathname + basename_offset, | |
1090 | pathlen - basename_offset - isdir, | |
1091 | pattern, prefix, | |
1092 | pat->patternlen, pat->flags); | |
1093 | } | |
1094 | return match_pathname(pathname, pathlen - isdir, | |
1095 | base, baselen, | |
1096 | pattern, prefix, pat->patternlen); | |
1097 | } | |
1098 | ||
1099 | static int macroexpand_one(struct all_attrs_item *all_attrs, int nr, int rem); | |
1100 | ||
1101 | static int fill_one(struct all_attrs_item *all_attrs, | |
1102 | const struct match_attr *a, int rem) | |
1103 | { | |
1104 | size_t i; | |
1105 | ||
1106 | for (i = a->num_attr; rem > 0 && i > 0; i--) { | |
1107 | const struct git_attr *attr = a->state[i - 1].attr; | |
1108 | const char **n = &(all_attrs[attr->attr_nr].value); | |
1109 | const char *v = a->state[i - 1].setto; | |
1110 | ||
1111 | if (*n == ATTR__UNKNOWN) { | |
1112 | *n = v; | |
1113 | rem--; | |
1114 | rem = macroexpand_one(all_attrs, attr->attr_nr, rem); | |
1115 | } | |
1116 | } | |
1117 | return rem; | |
1118 | } | |
1119 | ||
1120 | static int fill(const char *path, int pathlen, int basename_offset, | |
1121 | const struct attr_stack *stack, | |
1122 | struct all_attrs_item *all_attrs, int rem) | |
1123 | { | |
1124 | for (; rem > 0 && stack; stack = stack->prev) { | |
1125 | unsigned i; | |
1126 | const char *base = stack->origin ? stack->origin : ""; | |
1127 | ||
1128 | for (i = stack->num_matches; 0 < rem && 0 < i; i--) { | |
1129 | const struct match_attr *a = stack->attrs[i - 1]; | |
1130 | if (a->is_macro) | |
1131 | continue; | |
1132 | if (path_matches(path, pathlen, basename_offset, | |
1133 | &a->u.pat, base, stack->originlen)) | |
1134 | rem = fill_one(all_attrs, a, rem); | |
1135 | } | |
1136 | } | |
1137 | ||
1138 | return rem; | |
1139 | } | |
1140 | ||
1141 | static int macroexpand_one(struct all_attrs_item *all_attrs, int nr, int rem) | |
1142 | { | |
1143 | const struct all_attrs_item *item = &all_attrs[nr]; | |
1144 | ||
1145 | if (item->macro && item->value == ATTR__TRUE) | |
1146 | return fill_one(all_attrs, item->macro, rem); | |
1147 | else | |
1148 | return rem; | |
1149 | } | |
1150 | ||
1151 | /* | |
1152 | * Marks the attributes which are macros based on the attribute stack. | |
1153 | * This prevents having to search through the attribute stack each time | |
1154 | * a macro needs to be expanded during the fill stage. | |
1155 | */ | |
1156 | static void determine_macros(struct all_attrs_item *all_attrs, | |
1157 | const struct attr_stack *stack) | |
1158 | { | |
1159 | for (; stack; stack = stack->prev) { | |
1160 | unsigned i; | |
1161 | for (i = stack->num_matches; i > 0; i--) { | |
1162 | const struct match_attr *ma = stack->attrs[i - 1]; | |
1163 | if (ma->is_macro) { | |
1164 | unsigned int n = ma->u.attr->attr_nr; | |
1165 | if (!all_attrs[n].macro) { | |
1166 | all_attrs[n].macro = ma; | |
1167 | } | |
1168 | } | |
1169 | } | |
1170 | } | |
1171 | } | |
1172 | ||
1173 | /* | |
1174 | * Collect attributes for path into the array pointed to by check->all_attrs. | |
1175 | * If check->check_nr is non-zero, only attributes in check[] are collected. | |
1176 | * Otherwise all attributes are collected. | |
1177 | */ | |
1178 | static void collect_some_attrs(struct index_state *istate, | |
1179 | const struct object_id *tree_oid, | |
1180 | const char *path, struct attr_check *check) | |
1181 | { | |
1182 | int pathlen, rem, dirlen; | |
1183 | const char *cp, *last_slash = NULL; | |
1184 | int basename_offset; | |
1185 | ||
1186 | for (cp = path; *cp; cp++) { | |
1187 | if (*cp == '/' && cp[1]) | |
1188 | last_slash = cp; | |
1189 | } | |
1190 | pathlen = cp - path; | |
1191 | if (last_slash) { | |
1192 | basename_offset = last_slash + 1 - path; | |
1193 | dirlen = last_slash - path; | |
1194 | } else { | |
1195 | basename_offset = 0; | |
1196 | dirlen = 0; | |
1197 | } | |
1198 | ||
1199 | prepare_attr_stack(istate, tree_oid, path, dirlen, &check->stack); | |
1200 | all_attrs_init(&g_attr_hashmap, check); | |
1201 | determine_macros(check->all_attrs, check->stack); | |
1202 | ||
1203 | rem = check->all_attrs_nr; | |
1204 | fill(path, pathlen, basename_offset, check->stack, check->all_attrs, rem); | |
1205 | } | |
1206 | ||
1207 | static const char *default_attr_source_tree_object_name; | |
1208 | static int ignore_bad_attr_tree; | |
1209 | ||
1210 | void set_git_attr_source(const char *tree_object_name) | |
1211 | { | |
1212 | default_attr_source_tree_object_name = xstrdup(tree_object_name); | |
1213 | } | |
1214 | ||
1215 | static void compute_default_attr_source(struct object_id *attr_source) | |
1216 | { | |
1217 | if (!default_attr_source_tree_object_name) | |
1218 | default_attr_source_tree_object_name = getenv(GIT_ATTR_SOURCE_ENVIRONMENT); | |
1219 | ||
1220 | if (!default_attr_source_tree_object_name && git_attr_tree) { | |
1221 | default_attr_source_tree_object_name = git_attr_tree; | |
1222 | ignore_bad_attr_tree = 1; | |
1223 | } | |
1224 | ||
1225 | if (!default_attr_source_tree_object_name || !is_null_oid(attr_source)) | |
1226 | return; | |
1227 | ||
1228 | if (repo_get_oid_treeish(the_repository, | |
1229 | default_attr_source_tree_object_name, | |
1230 | attr_source) && !ignore_bad_attr_tree) | |
1231 | die(_("bad --attr-source or GIT_ATTR_SOURCE")); | |
1232 | } | |
1233 | ||
1234 | static struct object_id *default_attr_source(void) | |
1235 | { | |
1236 | static struct object_id attr_source; | |
1237 | ||
1238 | if (is_null_oid(&attr_source)) | |
1239 | compute_default_attr_source(&attr_source); | |
1240 | if (is_null_oid(&attr_source)) | |
1241 | return NULL; | |
1242 | return &attr_source; | |
1243 | } | |
1244 | ||
1245 | static const char *interned_mode_string(unsigned int mode) | |
1246 | { | |
1247 | static struct { | |
1248 | unsigned int val; | |
1249 | char str[7]; | |
1250 | } mode_string[] = { | |
1251 | { .val = 0040000 }, | |
1252 | { .val = 0100644 }, | |
1253 | { .val = 0100755 }, | |
1254 | { .val = 0120000 }, | |
1255 | { .val = 0160000 }, | |
1256 | }; | |
1257 | int i; | |
1258 | ||
1259 | for (i = 0; i < ARRAY_SIZE(mode_string); i++) { | |
1260 | if (mode_string[i].val != mode) | |
1261 | continue; | |
1262 | if (!*mode_string[i].str) | |
1263 | snprintf(mode_string[i].str, sizeof(mode_string[i].str), | |
1264 | "%06o", mode); | |
1265 | return mode_string[i].str; | |
1266 | } | |
1267 | BUG("Unsupported mode 0%o", mode); | |
1268 | } | |
1269 | ||
1270 | static const char *builtin_object_mode_attr(struct index_state *istate, const char *path) | |
1271 | { | |
1272 | unsigned int mode; | |
1273 | ||
1274 | if (direction == GIT_ATTR_CHECKIN) { | |
1275 | struct object_id oid; | |
1276 | struct stat st; | |
1277 | if (lstat(path, &st)) | |
1278 | die_errno(_("unable to stat '%s'"), path); | |
1279 | mode = canon_mode(st.st_mode); | |
1280 | if (S_ISDIR(mode)) { | |
1281 | /* | |
1282 | *`path` is either a directory or it is a submodule, | |
1283 | * in which case it is already indexed as submodule | |
1284 | * or it does not exist in the index yet and we need to | |
1285 | * check if we can resolve to a ref. | |
1286 | */ | |
1287 | int pos = index_name_pos(istate, path, strlen(path)); | |
1288 | if (pos >= 0) { | |
1289 | if (S_ISGITLINK(istate->cache[pos]->ce_mode)) | |
1290 | mode = istate->cache[pos]->ce_mode; | |
1291 | } else if (resolve_gitlink_ref(path, "HEAD", &oid) == 0) { | |
1292 | mode = S_IFGITLINK; | |
1293 | } | |
1294 | } | |
1295 | } else { | |
1296 | /* | |
1297 | * For GIT_ATTR_CHECKOUT and GIT_ATTR_INDEX we only check | |
1298 | * for mode in the index. | |
1299 | */ | |
1300 | int pos = index_name_pos(istate, path, strlen(path)); | |
1301 | if (pos >= 0) | |
1302 | mode = istate->cache[pos]->ce_mode; | |
1303 | else | |
1304 | return ATTR__UNSET; | |
1305 | } | |
1306 | ||
1307 | return interned_mode_string(mode); | |
1308 | } | |
1309 | ||
1310 | ||
1311 | static const char *compute_builtin_attr(struct index_state *istate, | |
1312 | const char *path, | |
1313 | const struct git_attr *attr) { | |
1314 | static const struct git_attr *object_mode_attr; | |
1315 | ||
1316 | if (!object_mode_attr) | |
1317 | object_mode_attr = git_attr("builtin_objectmode"); | |
1318 | ||
1319 | if (attr == object_mode_attr) | |
1320 | return builtin_object_mode_attr(istate, path); | |
1321 | return ATTR__UNSET; | |
1322 | } | |
1323 | ||
1324 | void git_check_attr(struct index_state *istate, | |
1325 | const char *path, | |
1326 | struct attr_check *check) | |
1327 | { | |
1328 | int i; | |
1329 | const struct object_id *tree_oid = default_attr_source(); | |
1330 | ||
1331 | collect_some_attrs(istate, tree_oid, path, check); | |
1332 | ||
1333 | for (i = 0; i < check->nr; i++) { | |
1334 | unsigned int n = check->items[i].attr->attr_nr; | |
1335 | const char *value = check->all_attrs[n].value; | |
1336 | if (value == ATTR__UNKNOWN) | |
1337 | value = compute_builtin_attr(istate, path, check->all_attrs[n].attr); | |
1338 | check->items[i].value = value; | |
1339 | } | |
1340 | } | |
1341 | ||
1342 | void git_all_attrs(struct index_state *istate, | |
1343 | const char *path, struct attr_check *check) | |
1344 | { | |
1345 | int i; | |
1346 | const struct object_id *tree_oid = default_attr_source(); | |
1347 | ||
1348 | attr_check_reset(check); | |
1349 | collect_some_attrs(istate, tree_oid, path, check); | |
1350 | ||
1351 | for (i = 0; i < check->all_attrs_nr; i++) { | |
1352 | const char *name = check->all_attrs[i].attr->name; | |
1353 | const char *value = check->all_attrs[i].value; | |
1354 | struct attr_check_item *item; | |
1355 | if (value == ATTR__UNSET || value == ATTR__UNKNOWN) | |
1356 | continue; | |
1357 | item = attr_check_append(check, git_attr(name)); | |
1358 | item->value = value; | |
1359 | } | |
1360 | } | |
1361 | ||
1362 | void attr_start(void) | |
1363 | { | |
1364 | pthread_mutex_init(&g_attr_hashmap.mutex, NULL); | |
1365 | pthread_mutex_init(&check_vector.mutex, NULL); | |
1366 | } |