@@ -490,11 +490,11 @@ int get_tree_entry(const unsigned char *tree_sha1, const char *name, unsigned ch
490
490
491
491
static int match_entry (const struct name_entry * entry , int pathlen ,
492
492
const char * match , int matchlen ,
493
- int * never_interesting )
493
+ enum interesting * never_interesting )
494
494
{
495
495
int m = -1 ; /* signals that we haven't called strncmp() */
496
496
497
- if (* never_interesting ) {
497
+ if (* never_interesting != entry_not_interesting ) {
498
498
/*
499
499
* We have not seen any match that sorts later
500
500
* than the current path.
@@ -522,7 +522,7 @@ static int match_entry(const struct name_entry *entry, int pathlen,
522
522
* the variable to -1 and that is what will be
523
523
* returned, allowing the caller to terminate early.
524
524
*/
525
- * never_interesting = 0 ;
525
+ * never_interesting = entry_not_interesting ;
526
526
}
527
527
528
528
if (pathlen > matchlen )
@@ -584,7 +584,7 @@ enum interesting tree_entry_interesting(const struct name_entry *entry,
584
584
{
585
585
int i ;
586
586
int pathlen , baselen = base -> len - base_offset ;
587
- int never_interesting = ps -> has_wildcard ?
587
+ enum interesting never_interesting = ps -> has_wildcard ?
588
588
entry_not_interesting : all_entries_not_interesting ;
589
589
590
590
if (!ps -> nr ) {
0 commit comments