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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
|
/****************************************************************************
* bfs *
* Copyright (C) 2015-2022 Tavian Barnes <tavianator@tavianator.com> *
* *
* Permission to use, copy, modify, and/or distribute this software for any *
* purpose with or without fee is hereby granted. *
* *
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES *
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF *
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR *
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES *
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN *
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF *
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *
****************************************************************************/
#include "ctx.h"
#include "color.h"
#include "darray.h"
#include "diag.h"
#include "expr.h"
#include "mtab.h"
#include "pwcache.h"
#include "stat.h"
#include "trie.h"
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
const char *debug_flag_name(enum debug_flags flag) {
switch (flag) {
case DEBUG_COST:
return "cost";
case DEBUG_EXEC:
return "exec";
case DEBUG_OPT:
return "opt";
case DEBUG_RATES:
return "rates";
case DEBUG_SEARCH:
return "search";
case DEBUG_STAT:
return "stat";
case DEBUG_TREE:
return "tree";
case DEBUG_ALL:
break;
}
assert(!"Unrecognized debug flag");
return "???";
}
struct bfs_ctx *bfs_ctx_new(void) {
struct bfs_ctx *ctx = malloc(sizeof(*ctx));
if (!ctx) {
return NULL;
}
ctx->argv = NULL;
ctx->paths = NULL;
ctx->expr = NULL;
ctx->exclude = NULL;
ctx->mindepth = 0;
ctx->maxdepth = INT_MAX;
ctx->flags = BFTW_RECOVER;
ctx->strategy = BFTW_BFS;
ctx->optlevel = 3;
ctx->debug = 0;
ctx->ignore_races = false;
ctx->posixly_correct = false;
ctx->status = false;
ctx->unique = false;
ctx->warn = false;
ctx->xargs_safe = false;
ctx->colors = NULL;
ctx->colors_error = 0;
ctx->cout = NULL;
ctx->cerr = NULL;
ctx->users = NULL;
ctx->users_error = 0;
ctx->groups = NULL;
ctx->groups_error = 0;
ctx->mtab = NULL;
ctx->mtab_error = 0;
trie_init(&ctx->files);
ctx->nfiles = 0;
struct rlimit rl;
if (getrlimit(RLIMIT_NOFILE, &rl) == 0) {
ctx->nofile_soft = rl.rlim_cur;
ctx->nofile_hard = rl.rlim_max;
} else {
ctx->nofile_soft = 1024;
ctx->nofile_hard = RLIM_INFINITY;
}
return ctx;
}
const struct bfs_users *bfs_ctx_users(const struct bfs_ctx *ctx) {
struct bfs_ctx *mut = (struct bfs_ctx *)ctx;
if (mut->users_error) {
errno = mut->users_error;
} else if (!mut->users) {
mut->users = bfs_users_parse();
if (!mut->users) {
mut->users_error = errno;
}
}
return mut->users;
}
const struct bfs_groups *bfs_ctx_groups(const struct bfs_ctx *ctx) {
struct bfs_ctx *mut = (struct bfs_ctx *)ctx;
if (mut->groups_error) {
errno = mut->groups_error;
} else if (!mut->groups) {
mut->groups = bfs_groups_parse();
if (!mut->groups) {
mut->groups_error = errno;
}
}
return mut->groups;
}
const struct bfs_mtab *bfs_ctx_mtab(const struct bfs_ctx *ctx) {
struct bfs_ctx *mut = (struct bfs_ctx *)ctx;
if (mut->mtab_error) {
errno = mut->mtab_error;
} else if (!mut->mtab) {
mut->mtab = bfs_mtab_parse();
if (!mut->mtab) {
mut->mtab_error = errno;
}
}
return mut->mtab;
}
/**
* An open file tracked by the bfs context.
*/
struct bfs_ctx_file {
/** The file itself. */
CFILE *cfile;
/** The path to the file (for diagnostics). */
const char *path;
};
CFILE *bfs_ctx_dedup(struct bfs_ctx *ctx, CFILE *cfile, const char *path) {
struct bfs_stat sb;
if (bfs_stat(fileno(cfile->file), NULL, 0, &sb) != 0) {
return NULL;
}
bfs_file_id id;
bfs_stat_id(&sb, &id);
struct trie_leaf *leaf = trie_insert_mem(&ctx->files, id, sizeof(id));
if (!leaf) {
return NULL;
}
struct bfs_ctx_file *ctx_file = leaf->value;
if (ctx_file) {
ctx_file->path = path;
return ctx_file->cfile;
}
leaf->value = ctx_file = malloc(sizeof(*ctx_file));
if (!ctx_file) {
trie_remove(&ctx->files, leaf);
return NULL;
}
ctx_file->cfile = cfile;
ctx_file->path = path;
if (cfile != ctx->cout && cfile != ctx->cerr) {
++ctx->nfiles;
}
return cfile;
}
void bfs_ctx_flush(const struct bfs_ctx *ctx) {
// Before executing anything, flush all open streams. This ensures that
// - the user sees everything relevant before an -ok[dir] prompt
// - output from commands is interleaved consistently with bfs
// - executed commands can rely on I/O from other bfs actions
//
// We do not check errors here, but they will be caught at cleanup time
// with ferror().
fflush(NULL);
}
/** Flush a file and report any errors. */
static int bfs_ctx_fflush(CFILE *cfile) {
int ret = 0, error = 0;
if (ferror(cfile->file)) {
ret = -1;
error = EIO;
}
if (fflush(cfile->file) != 0) {
ret = -1;
error = errno;
}
errno = error;
return ret;
}
/** Close a file tracked by the bfs context. */
static int bfs_ctx_fclose(struct bfs_ctx *ctx, struct bfs_ctx_file *ctx_file) {
CFILE *cfile = ctx_file->cfile;
if (cfile == ctx->cout) {
// Will be checked later
return 0;
} else if (cfile == ctx->cerr) {
// Writes to stderr are allowed to fail silently, unless the same file was used by
// -fprint, -fls, etc.
if (ctx_file->path) {
return bfs_ctx_fflush(cfile);
} else {
return 0;
}
}
int ret = 0, error = 0;
if (ferror(cfile->file)) {
ret = -1;
error = EIO;
}
if (cfclose(cfile) != 0) {
ret = -1;
error = errno;
}
errno = error;
return ret;
}
int bfs_ctx_free(struct bfs_ctx *ctx) {
int ret = 0;
if (ctx) {
CFILE *cout = ctx->cout;
CFILE *cerr = ctx->cerr;
bfs_expr_free(ctx->exclude);
bfs_expr_free(ctx->expr);
bfs_mtab_free(ctx->mtab);
bfs_groups_free(ctx->groups);
bfs_users_free(ctx->users);
struct trie_leaf *leaf;
while ((leaf = trie_first_leaf(&ctx->files))) {
struct bfs_ctx_file *ctx_file = leaf->value;
if (bfs_ctx_fclose(ctx, ctx_file) != 0) {
if (cerr) {
bfs_error(ctx, "'%s': %m.\n", ctx_file->path);
}
ret = -1;
}
free
|