attr.c 13.2 KB
Newer Older
1 2 3
#include "cache.h"
#include "attr.h"

4 5 6 7 8 9 10
const char git_attr__true[] = "(builtin)true";
const char git_attr__false[] = "\0(builtin)false";
static const char git_attr__unknown[] = "(builtin)unknown";
#define ATTR__TRUE git_attr__true
#define ATTR__FALSE git_attr__false
#define ATTR__UNSET NULL
#define ATTR__UNKNOWN git_attr__unknown
11

12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
/*
 * The basic design decision here is that we are not going to have
 * insanely large number of attributes.
 *
 * This is a randomly chosen prime.
 */
#define HASHSIZE 257

#ifndef DEBUG_ATTR
#define DEBUG_ATTR 0
#endif

struct git_attr {
	struct git_attr *next;
	unsigned h;
J
Junio C Hamano 已提交
27
	int attr_nr;
28 29
	char name[FLEX_ARRAY];
};
J
Junio C Hamano 已提交
30
static int attr_nr;
31

J
Junio C Hamano 已提交
32
static struct git_attr_check *check_all_attr;
33 34 35 36 37 38 39 40 41 42 43 44 45 46
static struct git_attr *(git_attr_hash[HASHSIZE]);

static unsigned hash_name(const char *name, int namelen)
{
	unsigned val = 0;
	unsigned char c;

	while (namelen--) {
		c = *name++;
		val = ((val << 7) | (val >> 22)) ^ c;
	}
	return val;
}

47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
static int invalid_attr_name(const char *name, int namelen)
{
	/*
	 * Attribute name cannot begin with '-' and from
	 * [-A-Za-z0-9_.].  We'd specifically exclude '=' for now,
	 * as we might later want to allow non-binary value for
	 * attributes, e.g. "*.svg	merge=special-merge-program-for-svg"
	 */
	if (*name == '-')
		return -1;
	while (namelen--) {
		char ch = *name++;
		if (! (ch == '-' || ch == '.' || ch == '_' ||
		       ('0' <= ch && ch <= '9') ||
		       ('a' <= ch && ch <= 'z') ||
		       ('A' <= ch && ch <= 'Z')) )
			return -1;
	}
	return 0;
}

68 69 70 71 72 73 74 75 76 77 78 79
struct git_attr *git_attr(const char *name, int len)
{
	unsigned hval = hash_name(name, len);
	unsigned pos = hval % HASHSIZE;
	struct git_attr *a;

	for (a = git_attr_hash[pos]; a; a = a->next) {
		if (a->h == hval &&
		    !memcmp(a->name, name, len) && !a->name[len])
			return a;
	}

80 81 82
	if (invalid_attr_name(name, len))
		return NULL;

83 84 85 86 87
	a = xmalloc(sizeof(*a) + len + 1);
	memcpy(a->name, name, len);
	a->name[len] = 0;
	a->h = hval;
	a->next = git_attr_hash[pos];
J
Junio C Hamano 已提交
88
	a->attr_nr = attr_nr++;
89
	git_attr_hash[pos] = a;
J
Junio C Hamano 已提交
90 91 92 93

	check_all_attr = xrealloc(check_all_attr,
				  sizeof(*check_all_attr) * attr_nr);
	check_all_attr[a->attr_nr].attr = a;
94
	check_all_attr[a->attr_nr].value = ATTR__UNKNOWN;
95 96 97 98 99 100 101 102 103
	return a;
}

/*
 * .gitattributes file is one line per record, each of which is
 *
 * (1) glob pattern.
 * (2) whitespace
 * (3) whitespace separated list of attribute names, each of which
104 105
 *     could be prefixed with '-' to mean "set to false", '!' to mean
 *     "unset".
106 107
 */

108
/* What does a matched pattern decide? */
109 110
struct attr_state {
	struct git_attr *attr;
111
	const char *setto;
112 113 114
};

struct match_attr {
J
Junio C Hamano 已提交
115 116 117 118 119
	union {
		char *pattern;
		struct git_attr *attr;
	} u;
	char is_macro;
120 121 122 123 124 125
	unsigned num_attr;
	struct attr_state state[FLEX_ARRAY];
};

static const char blank[] = " \t\r\n";

126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175
static const char *parse_attr(const char *src, int lineno, const char *cp,
			      int *num_attr, struct match_attr *res)
{
	const char *ep, *equals;
	int len;

	ep = cp + strcspn(cp, blank);
	equals = strchr(cp, '=');
	if (equals && ep < equals)
		equals = NULL;
	if (equals)
		len = equals - cp;
	else
		len = ep - cp;
	if (!res) {
		if (*cp == '-' || *cp == '!') {
			cp++;
			len--;
		}
		if (invalid_attr_name(cp, len)) {
			fprintf(stderr,
				"%.*s is not a valid attribute name: %s:%d\n",
				len, cp, src, lineno);
			return NULL;
		}
	} else {
		struct attr_state *e;

		e = &(res->state[*num_attr]);
		if (*cp == '-' || *cp == '!') {
			e->setto = (*cp == '-') ? ATTR__FALSE : ATTR__UNSET;
			cp++;
			len--;
		}
		else if (!equals)
			e->setto = ATTR__TRUE;
		else {
			char *value;
			int vallen = ep - equals;
			value = xmalloc(vallen);
			memcpy(value, equals+1, vallen-1);
			value[vallen-1] = 0;
			e->setto = value;
		}
		e->attr = git_attr(cp, len);
	}
	(*num_attr)++;
	return ep + strspn(ep, blank);
}

J
Junio C Hamano 已提交
176 177
static struct match_attr *parse_attr_line(const char *line, const char *src,
					  int lineno, int macro_ok)
178 179 180 181
{
	int namelen;
	int num_attr;
	const char *cp, *name;
182
	struct match_attr *res = NULL;
183
	int pass;
J
Junio C Hamano 已提交
184
	int is_macro;
185 186 187 188 189 190

	cp = line + strspn(line, blank);
	if (!*cp || *cp == '#')
		return NULL;
	name = cp;
	namelen = strcspn(name, blank);
J
Junio C Hamano 已提交
191 192 193 194 195 196 197 198 199 200 201
	if (strlen(ATTRIBUTE_MACRO_PREFIX) < namelen &&
	    !prefixcmp(name, ATTRIBUTE_MACRO_PREFIX)) {
		if (!macro_ok) {
			fprintf(stderr, "%s not allowed: %s:%d\n",
				name, src, lineno);
			return NULL;
		}
		is_macro = 1;
		name += strlen(ATTRIBUTE_MACRO_PREFIX);
		name += strspn(name, blank);
		namelen = strcspn(name, blank);
202 203 204 205 206 207
		if (invalid_attr_name(name, namelen)) {
			fprintf(stderr,
				"%.*s is not a valid attribute name: %s:%d\n",
				namelen, name, src, lineno);
			return NULL;
		}
J
Junio C Hamano 已提交
208 209 210
	}
	else
		is_macro = 0;
211 212 213 214 215 216

	for (pass = 0; pass < 2; pass++) {
		/* pass 0 counts and allocates, pass 1 fills */
		num_attr = 0;
		cp = name + namelen;
		cp = cp + strspn(cp, blank);
217 218
		while (*cp)
			cp = parse_attr(src, lineno, cp, &num_attr, res);
219 220 221 222 223
		if (pass)
			break;
		res = xcalloc(1,
			      sizeof(*res) +
			      sizeof(struct attr_state) * num_attr +
J
Junio C Hamano 已提交
224
			      (is_macro ? 0 : namelen + 1));
225
		if (is_macro)
J
Junio C Hamano 已提交
226 227 228 229 230 231 232
			res->u.attr = git_attr(name, namelen);
		else {
			res->u.pattern = (char*)&(res->state[num_attr]);
			memcpy(res->u.pattern, name, namelen);
			res->u.pattern[namelen] = 0;
		}
		res->is_macro = is_macro;
233 234 235 236 237 238 239 240 241 242
		res->num_attr = num_attr;
	}
	return res;
}

/*
 * Like info/exclude and .gitignore, the attribute information can
 * come from many places.
 *
 * (1) .gitattribute file of the same directory;
243 244 245
 * (2) .gitattribute file of the parent directory if (1) does not have
 *      any match; this goes recursively upwards, just like .gitignore.
 * (3) $GIT_DIR/info/attributes, which overrides both of the above.
246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
 *
 * In the same file, later entries override the earlier match, so in the
 * global list, we would have entries from info/attributes the earliest
 * (reading the file from top to bottom), .gitattribute of the root
 * directory (again, reading the file from top to bottom) down to the
 * current directory, and then scan the list backwards to find the first match.
 * This is exactly the same as what excluded() does in dir.c to deal with
 * .gitignore
 */

static struct attr_stack {
	struct attr_stack *prev;
	char *origin;
	unsigned num_matches;
	struct match_attr **attrs;
} *attr_stack;

static void free_attr_elem(struct attr_stack *e)
{
	int i;
	free(e->origin);
267 268 269 270
	for (i = 0; i < e->num_matches; i++) {
		struct match_attr *a = e->attrs[i];
		int j;
		for (j = 0; j < a->num_attr; j++) {
271
			const char *setto = a->state[j].setto;
272 273 274 275 276 277
			if (setto == ATTR__TRUE ||
			    setto == ATTR__FALSE ||
			    setto == ATTR__UNSET ||
			    setto == ATTR__UNKNOWN)
				;
			else
278
				free((char*) setto);
279 280 281
		}
		free(a);
	}
282 283 284 285
	free(e);
}

static const char *builtin_attr[] = {
286
	"[attr]binary -diff -crlf",
287 288 289 290 291 292 293
	NULL,
};

static struct attr_stack *read_attr_from_array(const char **list)
{
	struct attr_stack *res;
	const char *line;
J
Junio C Hamano 已提交
294
	int lineno = 0;
295 296 297

	res = xcalloc(1, sizeof(*res));
	while ((line = *(list++)) != NULL) {
J
Junio C Hamano 已提交
298 299 300
		struct match_attr *a;

		a = parse_attr_line(line, "[builtin]", ++lineno, 1);
301 302
		if (!a)
			continue;
303 304
		res->attrs = xrealloc(res->attrs,
			sizeof(struct match_attr *) * (res->num_matches + 1));
305 306 307 308 309
		res->attrs[res->num_matches++] = a;
	}
	return res;
}

J
Junio C Hamano 已提交
310
static struct attr_stack *read_attr_from_file(const char *path, int macro_ok)
311 312 313 314
{
	FILE *fp;
	struct attr_stack *res;
	char buf[2048];
J
Junio C Hamano 已提交
315
	int lineno = 0;
316 317 318 319 320 321 322

	res = xcalloc(1, sizeof(*res));
	fp = fopen(path, "r");
	if (!fp)
		return res;

	while (fgets(buf, sizeof(buf), fp)) {
J
Junio C Hamano 已提交
323 324 325
		struct match_attr *a;

		a = parse_attr_line(buf, path, ++lineno, macro_ok);
326 327
		if (!a)
			continue;
328 329
		res->attrs = xrealloc(res->attrs,
			sizeof(struct match_attr *) * (res->num_matches + 1));
330 331 332 333 334 335 336 337 338 339 340
		res->attrs[res->num_matches++] = a;
	}
	fclose(fp);
	return res;
}

#if DEBUG_ATTR
static void debug_info(const char *what, struct attr_stack *elem)
{
	fprintf(stderr, "%s: %s\n", what, elem->origin ? elem->origin : "()");
}
341
static void debug_set(const char *what, const char *match, struct git_attr *attr, void *v)
J
Junio C Hamano 已提交
342
{
343 344 345 346 347 348 349 350 351 352 353
	const char *value = v;

	if (ATTR_TRUE(value))
		value = "set";
	else if (ATTR_FALSE(value))
		value = "unset";
	else if (ATTR_UNSET(value))
		value = "unspecified";

	fprintf(stderr, "%s: %s => %s (%s)\n",
		what, attr->name, (char *) value, match);
J
Junio C Hamano 已提交
354
}
355 356 357 358 359
#define debug_push(a) debug_info("push", (a))
#define debug_pop(a) debug_info("pop", (a))
#else
#define debug_push(a) do { ; } while (0)
#define debug_pop(a) do { ; } while (0)
J
Junio C Hamano 已提交
360
#define debug_set(a,b,c,d) do { ; } while (0)
361 362
#endif

J
Junio C Hamano 已提交
363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385
static void bootstrap_attr_stack(void)
{
	if (!attr_stack) {
		struct attr_stack *elem;

		elem = read_attr_from_array(builtin_attr);
		elem->origin = NULL;
		elem->prev = attr_stack;
		attr_stack = elem;

		elem = read_attr_from_file(GITATTRIBUTES_FILE, 1);
		elem->origin = strdup("");
		elem->prev = attr_stack;
		attr_stack = elem;
		debug_push(elem);

		elem = read_attr_from_file(git_path(INFOATTRIBUTES_FILE), 1);
		elem->origin = NULL;
		elem->prev = attr_stack;
		attr_stack = elem;
	}
}

386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404
static void prepare_attr_stack(const char *path, int dirlen)
{
	struct attr_stack *elem, *info;
	int len;
	char pathbuf[PATH_MAX];

	/*
	 * At the bottom of the attribute stack is the built-in
	 * set of attribute definitions.  Then, contents from
	 * .gitattribute files from directories closer to the
	 * root to the ones in deeper directories are pushed
	 * to the stack.  Finally, at the very top of the stack
	 * we always keep the contents of $GIT_DIR/info/attributes.
	 *
	 * When checking, we use entries from near the top of the
	 * stack, preferring $GIT_DIR/info/attributes, then
	 * .gitattributes in deeper directories to shallower ones,
	 * and finally use the built-in set as the default.
	 */
J
Junio C Hamano 已提交
405 406
	if (!attr_stack)
		bootstrap_attr_stack();
407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443

	/*
	 * Pop the "info" one that is always at the top of the stack.
	 */
	info = attr_stack;
	attr_stack = info->prev;

	/*
	 * Pop the ones from directories that are not the prefix of
	 * the path we are checking.
	 */
	while (attr_stack && attr_stack->origin) {
		int namelen = strlen(attr_stack->origin);

		elem = attr_stack;
		if (namelen <= dirlen &&
		    !strncmp(elem->origin, path, namelen))
			break;

		debug_pop(elem);
		attr_stack = elem->prev;
		free_attr_elem(elem);
	}

	/*
	 * Read from parent directories and push them down
	 */
	while (1) {
		char *cp;

		len = strlen(attr_stack->origin);
		if (dirlen <= len)
			break;
		memcpy(pathbuf, path, dirlen);
		memcpy(pathbuf + dirlen, "/", 2);
		cp = strchr(pathbuf + len + 1, '/');
		strcpy(cp + 1, GITATTRIBUTES_FILE);
J
Junio C Hamano 已提交
444
		elem = read_attr_from_file(pathbuf, 0);
445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481
		*cp = '\0';
		elem->origin = strdup(pathbuf);
		elem->prev = attr_stack;
		attr_stack = elem;
		debug_push(elem);
	}

	/*
	 * Finally push the "info" one at the top of the stack.
	 */
	info->prev = attr_stack;
	attr_stack = info;
}

static int path_matches(const char *pathname, int pathlen,
			const char *pattern,
			const char *base, int baselen)
{
	if (!strchr(pattern, '/')) {
		/* match basename */
		const char *basename = strrchr(pathname, '/');
		basename = basename ? basename + 1 : pathname;
		return (fnmatch(pattern, basename, 0) == 0);
	}
	/*
	 * match with FNM_PATHNAME; the pattern has base implicitly
	 * in front of it.
	 */
	if (*pattern == '/')
		pattern++;
	if (pathlen < baselen ||
	    (baselen && pathname[baselen - 1] != '/') ||
	    strncmp(pathname, base, baselen))
		return 0;
	return fnmatch(pattern, pathname + baselen, FNM_PATHNAME) == 0;
}

482 483 484 485 486 487 488
static int fill_one(const char *what, struct match_attr *a, int rem)
{
	struct git_attr_check *check = check_all_attr;
	int i;

	for (i = 0; 0 < rem && i < a->num_attr; i++) {
		struct git_attr *attr = a->state[i].attr;
489 490
		const char **n = &(check[attr->attr_nr].value);
		const char *v = a->state[i].setto;
491 492 493 494 495 496 497 498 499 500

		if (*n == ATTR__UNKNOWN) {
			debug_set(what, a->u.pattern, attr, v);
			*n = v;
			rem--;
		}
	}
	return rem;
}

J
Junio C Hamano 已提交
501
static int fill(const char *path, int pathlen, struct attr_stack *stk, int rem)
502
{
503
	int i;
504 505 506 507
	const char *base = stk->origin ? stk->origin : "";

	for (i = stk->num_matches - 1; 0 < rem && 0 <= i; i--) {
		struct match_attr *a = stk->attrs[i];
J
Junio C Hamano 已提交
508 509
		if (a->is_macro)
			continue;
510
		if (path_matches(path, pathlen,
511 512
				 a->u.pattern, base, strlen(base)))
			rem = fill_one("fill", a, rem);
513 514 515 516
	}
	return rem;
}

J
Junio C Hamano 已提交
517 518
static int macroexpand(struct attr_stack *stk, int rem)
{
519
	int i;
J
Junio C Hamano 已提交
520 521 522 523 524 525
	struct git_attr_check *check = check_all_attr;

	for (i = stk->num_matches - 1; 0 < rem && 0 <= i; i--) {
		struct match_attr *a = stk->attrs[i];
		if (!a->is_macro)
			continue;
526
		if (check[a->u.attr->attr_nr].value != ATTR__TRUE)
J
Junio C Hamano 已提交
527
			continue;
528
		rem = fill_one("expand", a, rem);
J
Junio C Hamano 已提交
529 530 531 532
	}
	return rem;
}

533 534 535 536 537 538
int git_checkattr(const char *path, int num, struct git_attr_check *check)
{
	struct attr_stack *stk;
	const char *cp;
	int dirlen, pathlen, i, rem;

J
Junio C Hamano 已提交
539 540
	bootstrap_attr_stack();
	for (i = 0; i < attr_nr; i++)
541
		check_all_attr[i].value = ATTR__UNKNOWN;
542 543 544 545 546 547 548 549

	pathlen = strlen(path);
	cp = strrchr(path, '/');
	if (!cp)
		dirlen = 0;
	else
		dirlen = cp - path;
	prepare_attr_stack(path, dirlen);
J
Junio C Hamano 已提交
550 551 552 553
	rem = attr_nr;
	for (stk = attr_stack; 0 < rem && stk; stk = stk->prev)
		rem = fill(path, pathlen, stk, rem);

554
	for (stk = attr_stack; 0 < rem && stk; stk = stk->prev)
J
Junio C Hamano 已提交
555 556
		rem = macroexpand(stk, rem);

557
	for (i = 0; i < num; i++) {
558
		const char *value = check_all_attr[check[i].attr->attr_nr].value;
559 560 561 562
		if (value == ATTR__UNKNOWN)
			value = ATTR__UNSET;
		check[i].value = value;
	}
J
Junio C Hamano 已提交
563

564 565
	return 0;
}