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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2009 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.opensource.org/licenses/cpl1.0.txt *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* Glenn Fowler
* AT&T Research
*
* ftwalk on top of fts
*/
#include <ast.h>
#include <ftwalk.h>
static struct
{
int (*comparf)(Ftw_t*, Ftw_t*);
} state;
/*
* why does fts take FTSENT** instead of FTSENT*
*/
static int
ftscompare(Ftw_t* const* pf1, Ftw_t* const* pf2)
{
return (*state.comparf)(*pf1, *pf2);
}
/*
* the real thing -- well it used to be
*/
int
ftwalk(const char* path, int (*userf)(Ftw_t*), int flags, int (*comparf)(Ftw_t*, Ftw_t*))
{
register FTS* f;
register FTSENT* e;
register int children;
register int rv;
int oi;
int ns;
int os;
int nd;
FTSENT* x;
FTSENT* dd[2];
flags ^= FTS_ONEPATH;
if (flags & FTW_TWICE)
flags &= ~(FTS_NOPREORDER|FTS_NOPOSTORDER);
else if (flags & FTW_POST)
flags |= FTS_NOPREORDER;
else
flags |= FTS_NOPOSTORDER;
if (children = flags & FTW_CHILDREN)
flags |= FTS_SEEDOT;
state.comparf = comparf;
if (!(f = fts_open((char* const*)path, flags, comparf ? ftscompare : 0)))
{
if (!path || !(flags & FTS_ONEPATH) && !(path = (const char*)(*((char**)path))))
return -1;
ns = strlen(path) + 1;
if (!(e = newof(0, FTSENT, 1, ns)))
return -1;
e->fts_accpath = e->fts_name = e->fts_path = strcpy((char*)(e + 1), path);
e->fts_namelen = e->fts_pathlen = ns;
e->fts_info = FTS_NS;
e->parent = e;
e->parent->link = e;
rv = (*userf)((Ftw_t*)e);
free(e);
return rv;
}
rv = 0;
if (children && (e = fts_children(f, 0)))
{
nd = 0;
for (x = e; x; x = x->link)
if (x->info & FTS_DD)
{
x->statb = *x->fts_statp;
x->info &= ~FTS_DD;
dd[nd++] = x;
if (nd >= elementsof(dd))
break;
}
e->parent->link = e;
rv = (*userf)((Ftw_t*)e->parent);
e->parent->link = 0;
while (nd > 0)
dd[--nd]->info |= FTS_DD;
for (x = e; x; x = x->link)
if (!(x->info & FTS_D))
x->status = FTS_SKIP;
}
while (!rv && (e = fts_read(f)))
{
oi = e->info;
os = e->status;
ns = e->status = e->path == e->fts_accpath ? FTW_PATH : FTW_NAME;
nd = 0;
switch (e->info)
{
case FTS_D:
case FTS_DNX:
if (children)
for (x = fts_children(f, 0); x; x = x->link)
if (x->info & FTS_DD)
{
x->statb = *x->fts_statp;
x->info &= ~FTS_DD;
dd[nd++] = x;
if (nd >= elementsof(dd))
break;
}
break;
case FTS_DOT:
continue;
case FTS_ERR:
case FTS_SLNONE:
e->info = FTS_NS;
break;
case FTS_NSOK:
e->info = FTS_NSOK;
break;
}
rv = (*userf)((Ftw_t*)e);
e->info = oi;
if (e->status == ns)
e->status = os;
while (nd > 0)
dd[--nd]->info |= FTS_DD;
}
fts_close(f);
return rv;
}
|
