split-index: do not invalidate cache-tree at read time
We are sure that after merge_base_index() is done. cache-tree can still be used with the final index. So don't destroy cache tree. Signed-off-by: Nguyễn Thái Ngọc Duy <pclouds@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
parent
76b07b37a3
commit
ce7c614bce
1
cache.h
1
cache.h
@ -488,6 +488,7 @@ extern int index_name_pos(const struct index_state *, const char *name, int name
|
|||||||
#define ADD_CACHE_SKIP_DFCHECK 4 /* Ok to skip DF conflict checks */
|
#define ADD_CACHE_SKIP_DFCHECK 4 /* Ok to skip DF conflict checks */
|
||||||
#define ADD_CACHE_JUST_APPEND 8 /* Append only; tree.c::read_tree() */
|
#define ADD_CACHE_JUST_APPEND 8 /* Append only; tree.c::read_tree() */
|
||||||
#define ADD_CACHE_NEW_ONLY 16 /* Do not replace existing ones */
|
#define ADD_CACHE_NEW_ONLY 16 /* Do not replace existing ones */
|
||||||
|
#define ADD_CACHE_KEEP_CACHE_TREE 32 /* Do not invalidate cache-tree */
|
||||||
extern int add_index_entry(struct index_state *, struct cache_entry *ce, int option);
|
extern int add_index_entry(struct index_state *, struct cache_entry *ce, int option);
|
||||||
extern void rename_index_entry_at(struct index_state *, int pos, const char *new_name);
|
extern void rename_index_entry_at(struct index_state *, int pos, const char *new_name);
|
||||||
extern int remove_index_entry_at(struct index_state *, int pos);
|
extern int remove_index_entry_at(struct index_state *, int pos);
|
||||||
|
@ -950,6 +950,7 @@ static int add_index_entry_with_check(struct index_state *istate, struct cache_e
|
|||||||
int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK;
|
int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK;
|
||||||
int new_only = option & ADD_CACHE_NEW_ONLY;
|
int new_only = option & ADD_CACHE_NEW_ONLY;
|
||||||
|
|
||||||
|
if (!(option & ADD_CACHE_KEEP_CACHE_TREE))
|
||||||
cache_tree_invalidate_path(istate, ce->name);
|
cache_tree_invalidate_path(istate, ce->name);
|
||||||
pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce));
|
pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce));
|
||||||
|
|
||||||
|
@ -133,6 +133,7 @@ void merge_base_index(struct index_state *istate)
|
|||||||
for (i = si->nr_replacements; i < si->saved_cache_nr; i++) {
|
for (i = si->nr_replacements; i < si->saved_cache_nr; i++) {
|
||||||
add_index_entry(istate, si->saved_cache[i],
|
add_index_entry(istate, si->saved_cache[i],
|
||||||
ADD_CACHE_OK_TO_ADD |
|
ADD_CACHE_OK_TO_ADD |
|
||||||
|
ADD_CACHE_KEEP_CACHE_TREE |
|
||||||
/*
|
/*
|
||||||
* we may have to replay what
|
* we may have to replay what
|
||||||
* merge-recursive.c:update_stages()
|
* merge-recursive.c:update_stages()
|
||||||
|
Loading…
Reference in New Issue
Block a user