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