diff options
author | Linus Torvalds <torvalds@ppc970.osdl.org> | 2005-04-22 17:15:28 -0700 |
---|---|---|
committer | Linus Torvalds <torvalds@ppc970.osdl.org> | 2005-04-22 17:15:28 -0700 |
commit | b5af9107270171b79d46b099ee0b198e653f3a24 (patch) | |
tree | 8284e5e732d110051beb6281e423488b74ee7593 /cache.h | |
parent | 94537c78a82619b2625cb827ec0094703579bfed (diff) | |
download | git-b5af9107270171b79d46b099ee0b198e653f3a24.tar.gz |
New "diff-cache" implementation.
This one is about a million times simpler, and much more likely to be
correct too.
Instead of trying to match up a tree object against the index, we just
read in the tree object side-by-side into the index, and just walk the
resulting index file. This was what all the read-tree cleanups were
all getting to.
Diffstat (limited to 'cache.h')
-rw-r--r-- | cache.h | 2 |
1 files changed, 2 insertions, 0 deletions
@@ -99,7 +99,9 @@ extern int read_cache(void); extern int write_cache(int newfd, struct cache_entry **cache, int entries); extern int cache_name_pos(const char *name, int namelen); extern int add_cache_entry(struct cache_entry *ce, int ok_to_add); +extern int remove_entry_at(int pos); extern int remove_file_from_cache(char *path); +extern int same_name(struct cache_entry *a, struct cache_entry *b); extern int cache_match_stat(struct cache_entry *ce, struct stat *st); #define MTIME_CHANGED 0x0001 |