29 lines
517 B
C
29 lines
517 B
C
|
#include "cache.h"
|
||
|
|
||
|
int main(int ac, char **av)
|
||
|
{
|
||
|
int i;
|
||
|
int dirty, clean, racy;
|
||
|
|
||
|
dirty = clean = racy = 0;
|
||
|
read_cache();
|
||
|
for (i = 0; i < active_nr; i++) {
|
||
|
struct cache_entry *ce = active_cache[i];
|
||
|
struct stat st;
|
||
|
|
||
|
if (lstat(ce->name, &st)) {
|
||
|
error("lstat(%s): %s", ce->name, strerror(errno));
|
||
|
continue;
|
||
|
}
|
||
|
|
||
|
if (ce_match_stat(ce, &st, 0))
|
||
|
dirty++;
|
||
|
else if (ce_match_stat(ce, &st, 2))
|
||
|
racy++;
|
||
|
else
|
||
|
clean++;
|
||
|
}
|
||
|
printf("dirty %d, clean %d, racy %d\n", dirty, clean, racy);
|
||
|
return 0;
|
||
|
}
|