update-cache.c 8.5 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5
/*
 * GIT - The information manager from hell
 *
 * Copyright (C) Linus Torvalds, 2005
 */
6
#include <signal.h>
7 8
#include "cache.h"

9 10 11 12 13 14 15
/*
 * Default to not allowing changes to the list of files. The
 * tool doesn't actually care, but this makes it harder to add
 * files to the revision control by mistake by doing something
 * like "update-cache *" and suddenly having all the object
 * files be revision controlled.
 */
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
static int allow_add = 0, allow_remove = 0, not_new = 0;

/* Three functions to allow overloaded pointer return; see linux/err.h */
static inline void *ERR_PTR(long error)
{
	return (void *) error;
}

static inline long PTR_ERR(const void *ptr)
{
	return (long) ptr;
}

static inline long IS_ERR(const void *ptr)
{
	return (unsigned long)ptr > (unsigned long)-1000L;
}
33

34 35 36 37 38 39 40
/*
 * This only updates the "non-critical" parts of the directory
 * cache, ie the parts that aren't tracked by GIT, and only used
 * to validate the cache.
 */
static void fill_stat_cache_info(struct cache_entry *ce, struct stat *st)
{
41 42
	ce->ce_ctime.sec = htonl(st->st_ctime);
	ce->ce_mtime.sec = htonl(st->st_mtime);
P
Petr Baudis 已提交
43
#ifdef NSEC
44 45
	ce->ce_ctime.nsec = htonl(st->st_ctim.tv_nsec);
	ce->ce_mtime.nsec = htonl(st->st_mtim.tv_nsec);
P
Petr Baudis 已提交
46
#endif
47 48 49 50 51
	ce->ce_dev = htonl(st->st_dev);
	ce->ce_ino = htonl(st->st_ino);
	ce->ce_uid = htonl(st->st_uid);
	ce->ce_gid = htonl(st->st_gid);
	ce->ce_size = htonl(st->st_size);
52 53
}

54
static int add_file_to_cache(char *path)
55 56 57 58 59
{
	int size, namelen;
	struct cache_entry *ce;
	struct stat st;
	int fd;
60
	char *target;
61

62
	if (lstat(path, &st) < 0) {
63
		if (errno == ENOENT || errno == ENOTDIR) {
64 65 66
			if (allow_remove)
				return remove_file_from_cache(path);
		}
67 68 69 70
		return -1;
	}
	namelen = strlen(path);
	size = cache_entry_size(namelen);
71
	ce = xmalloc(size);
72 73
	memset(ce, 0, size);
	memcpy(ce->name, path, namelen);
74
	fill_stat_cache_info(ce, &st);
75
	ce->ce_mode = create_ce_mode(st.st_mode);
76
	ce->ce_flags = htons(namelen);
77 78 79 80 81 82 83 84 85
	switch (st.st_mode & S_IFMT) {
	case S_IFREG:
		fd = open(path, O_RDONLY);
		if (fd < 0)
			return -1;
		if (index_fd(ce->sha1, fd, &st) < 0)
			return -1;
		break;
	case S_IFLNK:
86 87 88
		target = xmalloc(st.st_size+1);
		if (readlink(path, target, st.st_size+1) != st.st_size) {
			free(target);
89
			return -1;
90 91
		}
		if (write_sha1_file(target, st.st_size, "blob", ce->sha1))
92
			return -1;
93
		free(target);
94 95
		break;
	default:
96
		return -1;
97
	}
98 99 100
	return add_cache_entry(ce, allow_add);
}

101 102 103 104 105 106 107 108 109 110 111 112 113 114
static int match_data(int fd, void *buffer, unsigned long size)
{
	while (size) {
		char compare[1024];
		int ret = read(fd, compare, sizeof(compare));

		if (ret <= 0 || ret > size || memcmp(buffer, compare, ret))
			return -1;
		size -= ret;
		buffer += ret;
	}
	return 0;
}

115
static int compare_data(struct cache_entry *ce, unsigned long expected_size)
116
{
117 118 119 120 121 122 123 124 125 126
	int match = -1;
	int fd = open(ce->name, O_RDONLY);

	if (fd >= 0) {
		void *buffer;
		unsigned long size;
		char type[10];

		buffer = read_sha1_file(ce->sha1, type, &size);
		if (buffer) {
127
			if (size == expected_size && !strcmp(type, "blob"))
128 129 130 131 132 133 134 135
				match = match_data(fd, buffer, size);
			free(buffer);
		}
		close(fd);
	}
	return match;
}

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
static int compare_link(struct cache_entry *ce, unsigned long expected_size)
{
	int match = -1;
	char *target;
	void *buffer;
	unsigned long size;
	char type[10];
	int len;

	target = xmalloc(expected_size);
	len = readlink(ce->name, target, expected_size);
	if (len != expected_size) {
		free(target);
		return -1;
	}
	buffer = read_sha1_file(ce->sha1, type, &size);
	if (!buffer) {
		free(target);
		return -1;
	}
	if (size == expected_size)
		match = memcmp(buffer, target, size);
	free(buffer);
	free(target);
	return match;
}

163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179
/*
 * "refresh" does not calculate a new sha1 file or bring the
 * cache up-to-date for mode/content changes. But what it
 * _does_ do is to "re-match" the stat information of a file
 * with the cache, so that you can refresh the cache for a
 * file that hasn't been changed but where the stat entry is
 * out of date.
 *
 * For example, you'd want to do this after doing a "read-tree",
 * to link up the stat cache details with the proper files.
 */
static struct cache_entry *refresh_entry(struct cache_entry *ce)
{
	struct stat st;
	struct cache_entry *updated;
	int changed, size;

180
	if (lstat(ce->name, &st) < 0)
181
		return ERR_PTR(-errno);
182 183 184 185 186

	changed = cache_match_stat(ce, &st);
	if (!changed)
		return ce;

187
	/*
188
	 * If the mode or type has changed, there's no point in trying
189
	 * to refresh the entry - it's not going to match
190
	 */
191
	if (changed & (MODE_CHANGED | TYPE_CHANGED))
192
		return ERR_PTR(-EINVAL);
193

194 195 196 197 198 199 200 201 202 203
	switch (st.st_mode & S_IFMT) {
	case S_IFREG:
		if (compare_data(ce, st.st_size))
			return ERR_PTR(-EINVAL);
		break;
	case S_IFLNK:
		if (compare_link(ce, st.st_size))
			return ERR_PTR(-EINVAL);
		break;
	default:
204
		return ERR_PTR(-EINVAL);
205
	}
206 207

	size = ce_size(ce);
208
	updated = xmalloc(size);
209 210 211
	memcpy(updated, ce, size);
	fill_stat_cache_info(updated, &st);
	return updated;
212 213
}

214
static int refresh_cache(void)
215 216
{
	int i;
217
	int has_errors = 0;
218

219
	for (i = 0; i < active_nr; i++) {
220 221 222 223
		struct cache_entry *ce, *new;
		ce = active_cache[i];
		if (ce_stage(ce)) {
			printf("%s: needs merge\n", ce->name);
224
			has_errors = 1;
225 226 227 228 229 230
			while ((i < active_nr) &&
			       ! strcmp(active_cache[i]->name, ce->name))
				i++;
			i--;
			continue;
		}
231

232
		new = refresh_entry(ce);
233
		if (IS_ERR(new)) {
234
			if (!(not_new && PTR_ERR(new) == -ENOENT)) {
235
				printf("%s: needs update\n", ce->name);
236 237
				has_errors = 1;
			}
238 239
			continue;
		}
240
		active_cache_changed = 1;
241 242
		active_cache[i] = new;
	}
243
	return has_errors;
244 245 246 247 248
}

/*
 * We fundamentally don't like some paths: we don't want
 * dot or dot-dot anywhere, and in fact, we don't even want
249
 * any other dot-files (.git or anything else). They
250 251 252
 * are hidden, for chist sake.
 *
 * Also, we don't want double slashes or slashes at the
I
Ingo Molnar 已提交
253
 * end that can make pathnames ambiguous.
254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
 */
static int verify_path(char *path)
{
	char c;

	goto inside;
	for (;;) {
		if (!c)
			return 1;
		if (c == '/') {
inside:
			c = *path++;
			if (c != '/' && c != '.' && c != '\0')
				continue;
			return 0;
		}
		c = *path++;
	}
}

274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289
static int add_cacheinfo(char *arg1, char *arg2, char *arg3)
{
	int size, len;
	unsigned int mode;
	unsigned char sha1[20];
	struct cache_entry *ce;

	if (sscanf(arg1, "%o", &mode) != 1)
		return -1;
	if (get_sha1_hex(arg2, sha1))
		return -1;
	if (!verify_path(arg3))
		return -1;

	len = strlen(arg3);
	size = cache_entry_size(len);
290
	ce = xmalloc(size);
291 292 293 294
	memset(ce, 0, size);

	memcpy(ce->sha1, sha1, 20);
	memcpy(ce->name, arg3, len);
295
	ce->ce_flags = htons(len);
296
	ce->ce_mode = create_ce_mode(mode);
297 298 299
	return add_cache_entry(ce, allow_add);
}

300
static const char *lockfile_name = NULL;
301 302 303

static void remove_lock_file(void)
{
304 305
	if (lockfile_name)
		unlink(lockfile_name);
306 307
}

308 309 310 311 312
static void remove_lock_file_on_signal(int signo)
{
	remove_lock_file();
}

313 314
int main(int argc, char **argv)
{
315
	int i, newfd, entries, has_errors = 0;
316
	int allow_options = 1;
317 318
	static char lockfile[MAXPATHLEN+1];
	const char *indexfile = get_index_file();
319

320 321 322
	snprintf(lockfile, sizeof(lockfile), "%s.lock", indexfile);

	newfd = open(lockfile, O_RDWR | O_CREAT | O_EXCL, 0600);
323
	if (newfd < 0)
324
		die("unable to create new cachefile");
325

326
	signal(SIGINT, remove_lock_file_on_signal);
327
	atexit(remove_lock_file);
328
	lockfile_name = lockfile;
329

330
	entries = read_cache();
331
	if (entries < 0)
332
		die("cache corrupted");
333 334 335

	for (i = 1 ; i < argc; i++) {
		char *path = argv[i];
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350

		if (allow_options && *path == '-') {
			if (!strcmp(path, "--")) {
				allow_options = 0;
				continue;
			}
			if (!strcmp(path, "--add")) {
				allow_add = 1;
				continue;
			}
			if (!strcmp(path, "--remove")) {
				allow_remove = 1;
				continue;
			}
			if (!strcmp(path, "--refresh")) {
351
				has_errors |= refresh_cache();
352 353
				continue;
			}
354 355 356 357 358 359
			if (!strcmp(path, "--cacheinfo")) {
				if (i+3 >= argc || add_cacheinfo(argv[i+1], argv[i+2], argv[i+3]))
					die("update-cache: --cacheinfo <mode> <sha1> <path>");
				i += 3;
				continue;
			}
360 361 362 363 364 365 366 367 368
			if (!strcmp(path, "--force-remove")) {
				if (argc <= i + 1)
					die("update-cache: --force-remove <path>");
				if (remove_file_from_cache(argv[i+1]))
					die("update-cache: --force-remove cannot remove %s", argv[i+1]);
				i++;
				continue;
			}

369 370 371 372
			if (!strcmp(path, "--ignore-missing")) {
				not_new = 1;
				continue;
			}
373
			die("unknown option %s", path);
374
		}
375 376 377 378
		if (!verify_path(path)) {
			fprintf(stderr, "Ignoring path %s\n", argv[i]);
			continue;
		}
379
		if (add_file_to_cache(path))
380
			die("Unable to add %s to database", path);
381
	}
382
	if (write_cache(newfd, active_cache, active_nr) || rename(lockfile, indexfile))
383
		die("Unable to write new cachefile");
384

385
	lockfile_name = NULL;
386
	return has_errors ? 1 : 0;
387
}