blob: c68d6e0140d8c3828c6e2b56375f95e38d219d99 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
#include <u.h>
#include <base.h>
static char buf[4*1024], *c = buf; /* should be greater or equal to PATH_MAX */
static
void
flush(void)
{
*c = 0;
puts(buf);
c = buf;
}
static
int
print(void *data, char *rel, char *abs, io·Stat *info)
{
copy:
while (*abs && c < (arrend(buf)-2))
*c++ = *abs++;
if (*abs) {
flush();
goto copy;
}
*c++ = '\n';
return 0;
}
static
void
usage(void)
{
fprintf(stderr, "usage: walk [-dlpv] file ...\n");
exit(1);
}
int
main(int argc, char *argv[])
{
int i, f = fs·nolinks, err, max = 0;
char *p;
static fs·Walker walker;
ARGBEGIN{
case 'd':
max = atoi(ARGF());
break;
case 'l':
f ^= fs·nolinks;
break;
case 'p':
f |= fs·preorder;
break;
case 'v':
f |= fs·verbose;
break;
default:
usage();
}ARGEND;
walker.flags = f;
walker.func = print;
walker.data = nil;
walker.max = max;
if (argc == 0) {
fs·init(&walker, "");
fs·walk(&walker);
return(err = walker.err);
} else {
err = 0;
for (i=0; i<argc; i++) {
fs·init(&walker, argv[i]);
fs·walk(&walker);
err += walker.err;
}
}
fs·fini(&walker);
flush();
exit(err);
}
|