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
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
|
/****************************************************************************
* bfs *
* Copyright (C) 2016-2020 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 "util.h"
#include "bftw.h"
#include "dstring.h"
#include <errno.h>
#include <fcntl.h>
#include <langinfo.h>
#include <regex.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#if BFS_HAS_SYS_PARAM
# include <sys/param.h>
#endif
#if BFS_HAS_SYS_SYSMACROS
# include <sys/sysmacros.h>
#elif BFS_HAS_SYS_MKDEV
# include <sys/mkdev.h>
#endif
int xreaddir(DIR *dir, struct dirent **de) {
while (true) {
errno = 0;
*de = readdir(dir);
if (*de) {
const char *name = (*de)->d_name;
if (name[0] != '.' || (name[1] != '\0' && (name[1] != '.' || name[2] != '\0'))) {
return 0;
}
} else if (errno != 0) {
return -1;
} else {
return 0;
}
}
}
char *xreadlinkat(int fd, const char *path, size_t size) {
++size; // NUL-terminator
ssize_t len;
char *name = NULL;
while (true) {
char *new_name = realloc(name, size);
if (!new_name) {
goto error;
}
name = new_name;
len = readlinkat(fd, path, name, size);
if (len < 0) {
goto error;
} else if (len >= size) {
size *= 2;
} else {
break;
}
}
name[len] = '\0';
return name;
error:
free(name);
return NULL;
}
bool isopen(int fd) {
return fcntl(fd, F_GETFD) >= 0 || errno != EBADF;
}
int redirect(int fd, const char *path, int flags, ...) {
mode_t mode = 0;
if (flags & O_CREAT) {
va_list args;
va_start(args, flags);
// Use int rather than mode_t, because va_arg must receive a
// fully-promoted type
mode = va_arg(args, int);
va_end(args);
}
int ret = open(path, flags, mode);
if (ret >= 0 && ret != fd) {
int orig = ret;
ret = dup2(orig, fd);
close(orig);
}
return ret;
}
int dup_cloexec(int fd) {
#ifdef F_DUPFD_CLOEXEC
return fcntl(fd, F_DUPFD_CLOEXEC, 0);
#else
int ret = dup(fd);
if (ret < 0) {
return -1;
}
if (fcntl(ret, F_SETFD, FD_CLOEXEC) == -1) {
close(ret);
return -1;
}
return ret;
#endif
}
int pipe_cloexec(int pipefd[2]) {
#if __linux__ || (BSD && !__APPLE__)
return pipe2(pipefd, O_CLOEXEC);
#else
if (pipe(pipefd) != 0) {
return -1;
}
if (fcntl(pipefd[0], F_SETFD, FD_CLOEXEC) == -1 || fcntl(pipefd[1], F_SETFD, FD_CLOEXEC) == -1) {
int error = errno;
close(pipefd[1]);
close(pipefd[0]);
errno = error;
return -1;
}
return 0;
#endif
}
char *xregerror(int err, const regex_t *regex) {
size_t len = regerror(err, regex, NULL, 0);
char *str = malloc(len);
if (str) {
regerror(err, regex, str, len);
}
return str;
}
int xlocaltime(const time_t *timep, struct tm *result) {
// Should be called before localtime_r() according to POSIX.1-2004
tzset();
if (localtime_r(timep, result)) {
return 0;
} else {
return -1;
}
}
void format_mode(mode_t mode, char str[11]) {
strcpy(str, "----------");
switch (bftw_mode_typeflag(mode)) {
case BFTW_REG:
break;
case BFTW_BLK:
str[0] = 'b';
break;
case BFTW_CHR:
str[0] = 'c';
break;
case BFTW_DIR:
str[0] = 'd';
break;
case BFTW_DOOR:
str[0] = 'D';
break;
case BFTW_LNK:
str[0] = 'l';
break;
case BFTW_FIFO:
str[0] = 'p';
break;
case BFTW_PORT:
str[0] = 'P';
break;
case BFTW_SOCK:
str[0] = 's';
break;
case BFTW_WHT:
str[0] = 'w';
break;
case BFTW_UNKNOWN:
case BFTW_ERROR:
str[0] = '?';
break;
}
if (mode & 00400) {
str[1] = 'r';
}
if (mode & 00200) {
str[2] = 'w';
}
if ((mode & 04100) == 04000) {
str[3] = 'S';
} else if (mode & 04000) {
str[3] = 's';
} else if (mode & 00100) {
str[3] = 'x';
}
if (mode & 00040) {
str[4] = 'r';
}
if (mode & 00020) {
str[5] = 'w';
}
if ((mode & 02010) == 02000) {
str[6] = 'S';
} else if (mode & 02000) {
str[6] = 's';
} else if (mode & 00010) {
str[6] = 'x';
}
if (mode & 00004) {
str[7] = 'r';
}
if (mode & 00002) {
str[8] = 'w';
}
if ((mode & 01001) == 01000) {
str[9] = 'T';
} else if (mode & 01000) {
str[9] = 't';
} else if (mode & 00001) {
str[9] = 'x';
}
}
const char *xbasename(const char *path) {
const char *i;
// Skip trailing slashes
for (i = path + strlen(path); i > path && i[-1] == '/'; --i);
// Find the beginning of the name
for (; i > path && i[-1] != '/'; --i);
// Skip leading slashes
for (; i[0] == '/' && i[1]; ++i);
return i;
}
int xfaccessat(int fd, const char *path, int amode) {
int ret = faccessat(fd, path, amode, 0);
#ifdef AT_EACCESS
// Some platforms, like Hurd, only support AT_EACCESS. Other platforms,
// like Android, don't support AT_EACCESS at all.
if (ret != 0 && (errno == EINVAL || errno == ENOTSUP)) {
ret = faccessat(fd, path, amode, AT_EACCESS);
}
#endif
return ret;
}
bool is_nonexistence_error(int error) {
return error == ENOENT || errno == ENOTDIR;
}
/** Read a line from standard input. */
static char *xgetline(void) {
char *line = dstralloc(0);
if (!line) {
return NULL;
}
while (true) {
int c = getchar();
if (c == '\n' || c == EOF) {
break;
}
if (dstrapp(&line, c) != 0) {
goto error;
}
}
return line;
error:
dstrfree(line);
return NULL;
}
/** Compile and execute a regular expression for xrpmatch(). */
static int xrpregex(nl_item item, const char *response) {
const char *pattern = nl_langinfo(item);
if (!pattern) {
return REG_BADPAT;
}
regex_t regex;
int ret = regcomp(®ex, pattern, REG_EXTENDED);
if (ret != 0) {
return ret;
}
ret = regexec(®ex, response, 0, NULL, 0);
regfree(®ex);
return ret;
}
/** Check if a response is affirmative or negative. */
static int xrpmatch(const char *response) {
int ret = xrpregex(NOEXPR, response);
if (ret == 0) {
return 0;
} else if (ret != REG_NOMATCH) {
return -1;
}
ret = xrpregex(YESEXPR, response);
if (ret == 0) {
return 1;
} else if (ret != REG_NOMATCH) {
return -1;
}
// Failsafe: always handle y/n
char c = response[0];
if (c == 'n' || c == 'N') {
return 0;
} else if (c == 'y' || c == 'Y') {
return 1;
} else {
return -1;
}
}
int ynprompt() {
fflush(stderr);
char *line = xgetline();
int ret = line ? xrpmatch(line) : -1;
dstrfree(line);
return ret;
}
dev_t bfs_makedev(int ma, int mi) {
#ifdef makedev
return makedev(ma, mi);
#else
return (ma << 8) | mi;
#endif
}
int bfs_major(dev_t dev) {
#ifdef major
return major(dev);
#else
return dev >> 8;
#endif
}
int bfs_minor(dev_t dev) {
#ifdef minor
return minor(dev);
#else
return dev & 0xFF;
#endif
}
|