diff options
| author | Nguyễn Thái Ngọc Duy <pclouds@gmail.com> | 2018-11-10 05:49:02 (GMT) |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2018-11-12 05:50:06 (GMT) |
| commit | c207e9e1f6dd1802f0deadae51af5615d855edc4 (patch) | |
| tree | 4142d6b30b54e65a692a3240341400b09437e40f /cache-tree.h | |
| parent | 74ae4b638d0acf6ab155422152d7ad98fdbe6f6b (diff) | |
| download | git-c207e9e1f6dd1802f0deadae51af5615d855edc4.zip git-c207e9e1f6dd1802f0deadae51af5615d855edc4.tar.gz git-c207e9e1f6dd1802f0deadae51af5615d855edc4.tar.bz2 | |
cache-tree.c: remove the_repository references
This case is more interesting than other boring "remove the_repo"
commits because while we need access to the object database, we cannot
simply use r->index because unpack-trees.c can operate on a temporary
index, not $GIT_DIR/index. Ideally we should be able to pass an object
database to lookup_tree() but that ship has sailed.
Signed-off-by: Nguyễn Thái Ngọc Duy <pclouds@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'cache-tree.h')
| -rw-r--r-- | cache-tree.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/cache-tree.h b/cache-tree.h index 0ab6784..3262091 100644 --- a/cache-tree.h +++ b/cache-tree.h @@ -32,7 +32,7 @@ struct cache_tree *cache_tree_read(const char *buffer, unsigned long size); int cache_tree_fully_valid(struct cache_tree *); int cache_tree_update(struct index_state *, int); -void cache_tree_verify(struct index_state *); +void cache_tree_verify(struct repository *, struct index_state *); /* bitmasks to write_cache_as_tree flags */ #define WRITE_TREE_MISSING_OK 1 @@ -47,7 +47,7 @@ void cache_tree_verify(struct index_state *); #define WRITE_TREE_PREFIX_ERROR (-3) int write_index_as_tree(struct object_id *oid, struct index_state *index_state, const char *index_path, int flags, const char *prefix); -void prime_cache_tree(struct index_state *, struct tree *); +void prime_cache_tree(struct repository *, struct index_state *, struct tree *); int cache_tree_matches_traversal(struct cache_tree *, struct name_entry *ent, struct traverse_info *info); |