@@ -659,7 +659,9 @@ int write_index_as_tree(struct object_id *oid, struct index_state *index_state,
659659 return ret ;
660660}
661661
662- static void prime_cache_tree_rec (struct cache_tree * it , struct tree * tree )
662+ static void prime_cache_tree_rec (struct repository * r ,
663+ struct cache_tree * it ,
664+ struct tree * tree )
663665{
664666 struct tree_desc desc ;
665667 struct name_entry entry ;
@@ -673,24 +675,25 @@ static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
673675 cnt ++ ;
674676 else {
675677 struct cache_tree_sub * sub ;
676- struct tree * subtree = lookup_tree (the_repository ,
677- entry .oid );
678+ struct tree * subtree = lookup_tree (r , entry .oid );
678679 if (!subtree -> object .parsed )
679680 parse_tree (subtree );
680681 sub = cache_tree_sub (it , entry .path );
681682 sub -> cache_tree = cache_tree ();
682- prime_cache_tree_rec (sub -> cache_tree , subtree );
683+ prime_cache_tree_rec (r , sub -> cache_tree , subtree );
683684 cnt += sub -> cache_tree -> entry_count ;
684685 }
685686 }
686687 it -> entry_count = cnt ;
687688}
688689
689- void prime_cache_tree (struct index_state * istate , struct tree * tree )
690+ void prime_cache_tree (struct repository * r ,
691+ struct index_state * istate ,
692+ struct tree * tree )
690693{
691694 cache_tree_free (& istate -> cache_tree );
692695 istate -> cache_tree = cache_tree ();
693- prime_cache_tree_rec (istate -> cache_tree , tree );
696+ prime_cache_tree_rec (r , istate -> cache_tree , tree );
694697 istate -> cache_changed |= CACHE_TREE_CHANGED ;
695698}
696699
@@ -726,7 +729,8 @@ int cache_tree_matches_traversal(struct cache_tree *root,
726729 return 0 ;
727730}
728731
729- static void verify_one (struct index_state * istate ,
732+ static void verify_one (struct repository * r ,
733+ struct index_state * istate ,
730734 struct cache_tree * it ,
731735 struct strbuf * path )
732736{
@@ -736,13 +740,13 @@ static void verify_one(struct index_state *istate,
736740
737741 for (i = 0 ; i < it -> subtree_nr ; i ++ ) {
738742 strbuf_addf (path , "%s/" , it -> down [i ]-> name );
739- verify_one (istate , it -> down [i ]-> cache_tree , path );
743+ verify_one (r , istate , it -> down [i ]-> cache_tree , path );
740744 strbuf_setlen (path , len );
741745 }
742746
743747 if (it -> entry_count < 0 ||
744748 /* no verification on tests (t7003) that replace trees */
745- lookup_replace_object (the_repository , & it -> oid ) != & it -> oid )
749+ lookup_replace_object (r , & it -> oid ) != & it -> oid )
746750 return ;
747751
748752 if (path -> len ) {
@@ -793,12 +797,12 @@ static void verify_one(struct index_state *istate,
793797 strbuf_release (& tree_buf );
794798}
795799
796- void cache_tree_verify (struct index_state * istate )
800+ void cache_tree_verify (struct repository * r , struct index_state * istate )
797801{
798802 struct strbuf path = STRBUF_INIT ;
799803
800804 if (!istate -> cache_tree )
801805 return ;
802- verify_one (istate , istate -> cache_tree , & path );
806+ verify_one (r , istate , istate -> cache_tree , & path );
803807 strbuf_release (& path );
804808}
0 commit comments