mirror of
https://github.com/git/git.git
synced 2024-11-17 22:44:49 +01:00
Merge branch 'jc/cache-tree' into next
* jc/cache-tree: cache-tree: a bit more debugging support. read-tree: invalidate cache-tree entry when a new index entry is added. Fix test-dump-cache-tree in one-tree disappeared case.
This commit is contained in:
commit
7873d984cf
3 changed files with 11 additions and 6 deletions
|
@ -110,6 +110,10 @@ void cache_tree_invalidate_path(struct cache_tree *it, const char *path)
|
|||
int namelen;
|
||||
struct cache_tree_sub *down;
|
||||
|
||||
#if DEBUG
|
||||
fprintf(stderr, "cache-tree invalidate <%s>\n", path);
|
||||
#endif
|
||||
|
||||
if (!it)
|
||||
return;
|
||||
slash = strchr(path, '/');
|
||||
|
@ -335,7 +339,7 @@ static int update_one(struct cache_tree *it,
|
|||
offset += 20;
|
||||
|
||||
#if DEBUG
|
||||
fprintf(stderr, "cache-tree %o %.*s\n",
|
||||
fprintf(stderr, "cache-tree update-one %o %.*s\n",
|
||||
mode, entlen, path + baselen);
|
||||
#endif
|
||||
}
|
||||
|
@ -351,7 +355,7 @@ static int update_one(struct cache_tree *it,
|
|||
free(buffer);
|
||||
it->entry_count = i;
|
||||
#if DEBUG
|
||||
fprintf(stderr, "cache-tree (%d ent, %d subtree) %s\n",
|
||||
fprintf(stderr, "cache-tree update-one (%d ent, %d subtree) %s\n",
|
||||
it->entry_count, it->subtree_nr,
|
||||
sha1_to_hex(it->sha1));
|
||||
#endif
|
||||
|
|
|
@ -21,10 +21,9 @@ static int dump_cache_tree(struct cache_tree *it,
|
|||
int i;
|
||||
int errs = 0;
|
||||
|
||||
if (!it)
|
||||
return;
|
||||
if (!ref)
|
||||
die("internal error");
|
||||
if (!it || !ref)
|
||||
/* missing in either */
|
||||
return 0;
|
||||
|
||||
if (it->entry_count < 0) {
|
||||
dump_one(it, pfx, "");
|
||||
|
|
|
@ -446,6 +446,8 @@ static int merged_entry(struct cache_entry *merge, struct cache_entry *old)
|
|||
invalidate_ce_path(old);
|
||||
}
|
||||
}
|
||||
else
|
||||
invalidate_ce_path(merge);
|
||||
merge->ce_flags &= ~htons(CE_STAGEMASK);
|
||||
add_cache_entry(merge, ADD_CACHE_OK_TO_ADD);
|
||||
return 1;
|
||||
|
|
Loading…
Reference in a new issue