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

struct cache_entry **active_cache = NULL;
10
unsigned int active_nr = 0, active_alloc = 0, active_cache_changed = 0;
11

12
int ce_match_stat(struct cache_entry *ce, struct stat *st)
13 14 15
{
	unsigned int changed = 0;

16 17 18
	switch (ntohl(ce->ce_mode) & S_IFMT) {
	case S_IFREG:
		changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED : 0;
19 20 21
		/* We consider only the owner x bit to be relevant for "mode changes" */
		if (0100 & (ntohl(ce->ce_mode) ^ st->st_mode))
			changed |= MODE_CHANGED;
22 23 24 25 26 27 28
		break;
	case S_IFLNK:
		changed |= !S_ISLNK(st->st_mode) ? TYPE_CHANGED : 0;
		break;
	default:
		die("internal error: ce_mode is %o", ntohl(ce->ce_mode));
	}
29
	if (ce->ce_mtime.sec != htonl(st->st_mtime))
30
		changed |= MTIME_CHANGED;
31 32 33
	if (ce->ce_ctime.sec != htonl(st->st_ctime))
		changed |= CTIME_CHANGED;

34
#ifdef NSEC
35 36 37 38 39
	/*
	 * nsec seems unreliable - not all filesystems support it, so
	 * as long as it is in the inode cache you get right nsec
	 * but after it gets flushed, you get zero nsec.
	 */
40
	if (ce->ce_mtime.nsec != htonl(st->st_mtim.tv_nsec))
41
		changed |= MTIME_CHANGED;
42
	if (ce->ce_ctime.nsec != htonl(st->st_ctim.tv_nsec))
43
		changed |= CTIME_CHANGED;
44 45 46 47
#endif	

	if (ce->ce_uid != htonl(st->st_uid) ||
	    ce->ce_gid != htonl(st->st_gid))
48
		changed |= OWNER_CHANGED;
49 50
	if (ce->ce_dev != htonl(st->st_dev) ||
	    ce->ce_ino != htonl(st->st_ino))
51
		changed |= INODE_CHANGED;
52
	if (ce->ce_size != htonl(st->st_size))
53 54 55 56
		changed |= DATA_CHANGED;
	return changed;
}

57
int cache_name_compare(const char *name1, int flags1, const char *name2, int flags2)
58
{
59 60
	int len1 = flags1 & CE_NAMEMASK;
	int len2 = flags2 & CE_NAMEMASK;
61 62 63 64 65 66 67 68 69 70
	int len = len1 < len2 ? len1 : len2;
	int cmp;

	cmp = memcmp(name1, name2, len);
	if (cmp)
		return cmp;
	if (len1 < len2)
		return -1;
	if (len1 > len2)
		return 1;
71 72 73 74
	if (flags1 < flags2)
		return -1;
	if (flags1 > flags2)
		return 1;
75 76 77 78 79 80 81 82 83 84 85 86
	return 0;
}

int cache_name_pos(const char *name, int namelen)
{
	int first, last;

	first = 0;
	last = active_nr;
	while (last > first) {
		int next = (last + first) >> 1;
		struct cache_entry *ce = active_cache[next];
87
		int cmp = cache_name_compare(name, namelen, ce->name, htons(ce->ce_flags));
88
		if (!cmp)
89
			return next;
90 91 92 93 94 95
		if (cmp < 0) {
			last = next;
			continue;
		}
		first = next+1;
	}
96
	return -first-1;
97 98
}

99
/* Remove entry, return true if there are more entries to go.. */
100
int remove_entry_at(int pos)
101
{
102
	active_cache_changed = 1;
103 104 105 106 107 108 109
	active_nr--;
	if (pos >= active_nr)
		return 0;
	memmove(active_cache + pos, active_cache + pos + 1, (active_nr - pos) * sizeof(struct cache_entry *));
	return 1;
}

110 111 112
int remove_file_from_cache(char *path)
{
	int pos = cache_name_pos(path, strlen(path));
113 114 115
	if (pos < 0)
		pos = -pos-1;
	while (pos < active_nr && !strcmp(active_cache[pos]->name, path))
116
		remove_entry_at(pos);
117 118 119
	return 0;
}

120
int same_name(struct cache_entry *a, struct cache_entry *b)
121 122 123 124 125
{
	int len = ce_namelen(a);
	return ce_namelen(b) == len && !memcmp(a->name, b->name, len);
}

126 127 128 129
/* We may be in a situation where we already have path/file and path
 * is being added, or we already have path and path/file is being
 * added.  Either one would result in a nonsense tree that has path
 * twice when git-write-tree tries to write it out.  Prevent it.
130 131 132 133
 * 
 * If ok-to-replace is specified, we remove the conflicting entries
 * from the cache so the caller should recompute the insert position.
 * When this happens, we return non-zero.
134
 */
135 136
static int check_file_directory_conflict(const struct cache_entry *ce,
					 int ok_to_replace)
137
{
138
	int pos, replaced = 0;
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154
	const char *path = ce->name;
	int namelen = strlen(path);
	int stage = ce_stage(ce);
	char *pathbuf = xmalloc(namelen + 1);
	char *cp;

	memcpy(pathbuf, path, namelen + 1);

	/*
	 * We are inserting path/file.  Do they have path registered at
	 * the same stage?  We need to do this for all the levels of our
	 * subpath.
	 */
	cp = pathbuf;
	while (1) {
		char *ep = strchr(cp, '/');
J
Junio C Hamano 已提交
155
		if (!ep)
156 157 158 159 160 161 162 163 164
			break;
		*ep = 0;    /* first cut it at slash */
		pos = cache_name_pos(pathbuf,
				     htons(create_ce_flags(ep-cp, stage)));
		if (0 <= pos) {
			/* Our leading path component is registered as a file,
			 * and we are trying to make it a directory.  This is
			 * bad.
			 */
165 166 167 168 169 170 171
			if (!ok_to_replace) {
				free(pathbuf);
				return -1;
			}
			fprintf(stderr, "removing file '%s' to replace it with a directory to create '%s'.\n", pathbuf, path);
			remove_entry_at(pos);
			replaced = 1;
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
		}
		*ep = '/';  /* then restore it and go downwards */
		cp = ep + 1;
	}
	free(pathbuf);

	/* Do we have an entry in the cache that makes our path a prefix
	 * of it?  That is, are we creating a file where they already expect
	 * a directory there?
	 */
	pos = cache_name_pos(path,
			     htons(create_ce_flags(namelen, stage)));

	/* (0 <= pos) cannot happen because add_cache_entry()
	 * should have taken care of that case.
	 */
	pos = -pos-1;

	/* pos would point at an existing entry that would come immediately
	 * after our path.  It could be the same as our path in higher stage,
	 * or different path but in a lower stage.
	 *
	 * E.g. when we are inserting path at stage 2,
	 *
	 *        1 path
	 * pos->  3 path
198 199 200 201
	 *        2 path/file1
	 *        3 path/file1
	 *        2 path/file2
	 *        2 patho
202 203 204
	 *
	 * We need to examine pos, ignore it because it is at different
	 * stage, examine next to find the path/file at stage 2, and
205 206
	 * complain.  We need to do this until we are not the leading
	 * path of an existing entry anymore.
207 208 209 210 211 212
	 */

	while (pos < active_nr) {
		struct cache_entry *other = active_cache[pos];
		if (strncmp(other->name, path, namelen))
			break; /* it is not our "subdirectory" anymore */
213 214 215 216 217 218 219 220 221
		if ((ce_stage(other) == stage) &&
		    other->name[namelen] == '/') {
			if (!ok_to_replace)
				return -1;
			fprintf(stderr, "removing file '%s' under '%s' to be replaced with a file\n", other->name, path);
			remove_entry_at(pos);
			replaced = 1;
			continue; /* cycle without updating pos */
		}
222 223
		pos++;
	}
224
	return replaced;
225 226
}

227
int add_cache_entry(struct cache_entry *ce, int option)
228 229
{
	int pos;
230 231
	int ok_to_add = option & ADD_CACHE_OK_TO_ADD;
	int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE;
232
	pos = cache_name_pos(ce->name, htons(ce->ce_flags));
233 234

	/* existing match? Just replace it */
235
	if (pos >= 0) {
236
		active_cache_changed = 1;
237
		active_cache[pos] = ce;
238 239
		return 0;
	}
240
	pos = -pos-1;
241

242 243 244 245 246 247 248 249 250 251 252 253
	/*
	 * Inserting a merged entry ("stage 0") into the index
	 * will always replace all non-merged entries..
	 */
	if (pos < active_nr && ce_stage(ce) == 0) {
		while (same_name(active_cache[pos], ce)) {
			ok_to_add = 1;
			if (!remove_entry_at(pos))
				break;
		}
	}

254 255 256
	if (!ok_to_add)
		return -1;

257 258 259 260 261 262
	if (check_file_directory_conflict(ce, ok_to_replace)) {
		if (!ok_to_replace)
			return -1;
		pos = cache_name_pos(ce->name, htons(ce->ce_flags));
		pos = -pos-1;
	}
263

264 265 266
	/* Make sure the array is big enough .. */
	if (active_nr == active_alloc) {
		active_alloc = alloc_nr(active_alloc);
267
		active_cache = xrealloc(active_cache, active_alloc * sizeof(struct cache_entry *));
268 269 270 271 272 273 274
	}

	/* Add it in.. */
	active_nr++;
	if (active_nr > pos)
		memmove(active_cache + pos + 1, active_cache + pos, (active_nr - pos - 1) * sizeof(ce));
	active_cache[pos] = ce;
275
	active_cache_changed = 1;
276 277 278
	return 0;
}

279 280 281 282 283
static int verify_hdr(struct cache_header *hdr, unsigned long size)
{
	SHA_CTX c;
	unsigned char sha1[20];

284
	if (hdr->hdr_signature != htonl(CACHE_SIGNATURE))
285
		return error("bad signature");
286 287
	if (hdr->hdr_version != htonl(2))
		return error("bad index version");
288
	SHA1_Init(&c);
289
	SHA1_Update(&c, hdr, size - 20);
290
	SHA1_Final(sha1, &c);
291 292
	if (memcmp(sha1, (void *)hdr + size - 20, 20))
		return error("bad index file sha1 signature");
293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
	return 0;
}

int read_cache(void)
{
	int fd, i;
	struct stat st;
	unsigned long size, offset;
	void *map;
	struct cache_header *hdr;

	errno = EBUSY;
	if (active_cache)
		return error("more than one cachefile");
	errno = ENOENT;
308
	fd = open(get_index_file(), O_RDONLY);
309 310 311
	if (fd < 0)
		return (errno == ENOENT) ? 0 : error("open failed");

312
	size = 0; // avoid gcc warning
313 314 315 316
	map = (void *)-1;
	if (!fstat(fd, &st)) {
		size = st.st_size;
		errno = EINVAL;
317
		if (size >= sizeof(struct cache_header) + 20)
318
			map = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
319 320 321 322 323 324 325 326 327
	}
	close(fd);
	if (-1 == (int)(long)map)
		return error("mmap failed");

	hdr = map;
	if (verify_hdr(hdr, size) < 0)
		goto unmap;

328
	active_nr = ntohl(hdr->hdr_entries);
329 330 331 332
	active_alloc = alloc_nr(active_nr);
	active_cache = calloc(active_alloc, sizeof(struct cache_entry *));

	offset = sizeof(*hdr);
333
	for (i = 0; i < active_nr; i++) {
334 335 336 337 338 339 340 341 342 343 344 345
		struct cache_entry *ce = map + offset;
		offset = offset + ce_size(ce);
		active_cache[i] = ce;
	}
	return active_nr;

unmap:
	munmap(map, size);
	errno = EINVAL;
	return error("verify header failed");
}

346 347 348 349
#define WRITE_BUFFER_SIZE 8192
static char write_buffer[WRITE_BUFFER_SIZE];
static unsigned long write_buffer_len;

350
static int ce_write(SHA_CTX *context, int fd, void *data, unsigned int len)
351 352 353 354 355 356 357 358 359
{
	while (len) {
		unsigned int buffered = write_buffer_len;
		unsigned int partial = WRITE_BUFFER_SIZE - buffered;
		if (partial > len)
			partial = len;
		memcpy(write_buffer + buffered, data, partial);
		buffered += partial;
		if (buffered == WRITE_BUFFER_SIZE) {
360
			SHA1_Update(context, write_buffer, WRITE_BUFFER_SIZE);
361 362 363 364 365 366 367 368 369 370 371
			if (write(fd, write_buffer, WRITE_BUFFER_SIZE) != WRITE_BUFFER_SIZE)
				return -1;
			buffered = 0;
		}
		write_buffer_len = buffered;
		len -= partial;
		data += partial;
 	}
 	return 0;
}

372
static int ce_flush(SHA_CTX *context, int fd)
373 374
{
	unsigned int left = write_buffer_len;
375

376 377
	if (left) {
		write_buffer_len = 0;
378
		SHA1_Update(context, write_buffer, left);
379
	}
380 381 382 383 384 385

	/* Append the SHA1 signature at the end */
	SHA1_Final(write_buffer + left, context);
	left += 20;
	if (write(fd, write_buffer, left) != left)
		return -1;
386 387 388
	return 0;
}

389 390 391 392 393 394
int write_cache(int newfd, struct cache_entry **cache, int entries)
{
	SHA_CTX c;
	struct cache_header hdr;
	int i;

395
	hdr.hdr_signature = htonl(CACHE_SIGNATURE);
396
	hdr.hdr_version = htonl(2);
397
	hdr.hdr_entries = htonl(entries);
398 399

	SHA1_Init(&c);
400
	if (ce_write(&c, newfd, &hdr, sizeof(hdr)) < 0)
401 402 403 404
		return -1;

	for (i = 0; i < entries; i++) {
		struct cache_entry *ce = cache[i];
405
		if (ce_write(&c, newfd, ce, ce_size(ce)) < 0)
406 407
			return -1;
	}
408
	return ce_flush(&c, newfd);
409
}