1#include "cache.h" 2#include "dir.h" 3#include "pathspec.h" 4 5/* 6 * Finds which of the given pathspecs match items in the index. 7 * 8 * For each pathspec, sets the corresponding entry in the seen[] array 9 * (which should be specs items long, i.e. the same size as pathspec) 10 * to the nature of the "closest" (i.e. most specific) match found for 11 * that pathspec in the index, if it was a closer type of match than 12 * the existing entry. As an optimization, matching is skipped 13 * altogether if seen[] already only contains non-zero entries. 14 * 15 * If seen[] has not already been written to, it may make sense 16 * to use find_pathspecs_matching_against_index() instead. 17 */ 18void add_pathspec_matches_against_index(const char **pathspec, 19 char *seen, int specs) 20{ 21 int num_unmatched = 0, i; 22 23 /* 24 * Since we are walking the index as if we were walking the directory, 25 * we have to mark the matched pathspec as seen; otherwise we will 26 * mistakenly think that the user gave a pathspec that did not match 27 * anything. 28 */ 29 for (i = 0; i < specs; i++) 30 if (!seen[i]) 31 num_unmatched++; 32 if (!num_unmatched) 33 return; 34 for (i = 0; i < active_nr; i++) { 35 struct cache_entry *ce = active_cache[i]; 36 match_pathspec(pathspec, ce->name, ce_namelen(ce), 0, seen); 37 } 38} 39 40/* 41 * Finds which of the given pathspecs match items in the index. 42 * 43 * This is a one-shot wrapper around add_pathspec_matches_against_index() 44 * which allocates, populates, and returns a seen[] array indicating the 45 * nature of the "closest" (i.e. most specific) matches which each of the 46 * given pathspecs achieves against all items in the index. 47 */ 48char *find_pathspecs_matching_against_index(const char **pathspec) 49{ 50 char *seen; 51 int i; 52 53 for (i = 0; pathspec[i]; i++) 54 ; /* just counting */ 55 seen = xcalloc(i, 1); 56 add_pathspec_matches_against_index(pathspec, seen, i); 57 return seen; 58}