Contents of /tags/mkinitrd-6_1_8/busybox/findutils/find.c
Parent Directory | Revision Log
Revision 916 -
(show annotations)
(download)
Wed Oct 28 00:17:50 2009 UTC (14 years, 11 months ago) by niro
File MIME type: text/plain
File size: 24391 byte(s)
Wed Oct 28 00:17:50 2009 UTC (14 years, 11 months ago) by niro
File MIME type: text/plain
File size: 24391 byte(s)
tagged 'mkinitrd-6_1_8'
1 | /* vi: set sw=4 ts=4: */ |
2 | /* |
3 | * Mini find implementation for busybox |
4 | * |
5 | * Copyright (C) 1999-2004 by Erik Andersen <andersen@codepoet.org> |
6 | * |
7 | * Reworked by David Douthitt <n9ubh@callsign.net> and |
8 | * Matt Kraai <kraai@alumni.carnegiemellon.edu>. |
9 | * |
10 | * Licensed under the GPL version 2, see the file LICENSE in this tarball. |
11 | */ |
12 | |
13 | /* findutils-4.1.20: |
14 | * |
15 | * # find file.txt -exec 'echo {}' '{} {}' ';' |
16 | * find: echo file.txt: No such file or directory |
17 | * # find file.txt -exec 'echo' '{} {}' '; ' |
18 | * find: missing argument to `-exec' |
19 | * # find file.txt -exec 'echo {}' '{} {}' ';' junk |
20 | * find: paths must precede expression |
21 | * # find file.txt -exec 'echo {}' '{} {}' ';' junk ';' |
22 | * find: paths must precede expression |
23 | * # find file.txt -exec 'echo' '{} {}' ';' |
24 | * file.txt file.txt |
25 | * (strace: execve("/bin/echo", ["echo", "file.txt file.txt"], [ 30 vars ])) |
26 | * # find file.txt -exec 'echo' '{} {}' ';' -print -exec pwd ';' |
27 | * file.txt file.txt |
28 | * file.txt |
29 | * /tmp |
30 | * # find -name '*.c' -o -name '*.h' |
31 | * [shows files, *.c and *.h intermixed] |
32 | * # find file.txt -name '*f*' -o -name '*t*' |
33 | * file.txt |
34 | * # find file.txt -name '*z*' -o -name '*t*' |
35 | * file.txt |
36 | * # find file.txt -name '*f*' -o -name '*z*' |
37 | * file.txt |
38 | * |
39 | * # find t z -name '*t*' -print -o -name '*z*' |
40 | * t |
41 | * # find t z t z -name '*t*' -o -name '*z*' -print |
42 | * z |
43 | * z |
44 | * # find t z t z '(' -name '*t*' -o -name '*z*' ')' -o -print |
45 | * (no output) |
46 | */ |
47 | |
48 | /* Testing script |
49 | * ./busybox find "$@" | tee /tmp/bb_find |
50 | * echo ================== |
51 | * /path/to/gnu/find "$@" | tee /tmp/std_find |
52 | * echo ================== |
53 | * diff -u /tmp/std_find /tmp/bb_find && echo Identical |
54 | */ |
55 | |
56 | #include <fnmatch.h> |
57 | #include "libbb.h" |
58 | #if ENABLE_FEATURE_FIND_REGEX |
59 | #include "xregex.h" |
60 | #endif |
61 | |
62 | /* This is a NOEXEC applet. Be very careful! */ |
63 | |
64 | |
65 | USE_FEATURE_FIND_XDEV(static dev_t *xdev_dev;) |
66 | USE_FEATURE_FIND_XDEV(static int xdev_count;) |
67 | |
68 | typedef int (*action_fp)(const char *fileName, struct stat *statbuf, void *); |
69 | |
70 | typedef struct { |
71 | action_fp f; |
72 | #if ENABLE_FEATURE_FIND_NOT |
73 | bool invert; |
74 | #endif |
75 | } action; |
76 | #define ACTS(name, arg...) typedef struct { action a; arg; } action_##name; |
77 | #define ACTF(name) static int func_##name(const char *fileName UNUSED_PARAM, \ |
78 | struct stat *statbuf UNUSED_PARAM, \ |
79 | action_##name* ap UNUSED_PARAM) |
80 | ACTS(print) |
81 | ACTS(name, const char *pattern; bool iname;) |
82 | USE_FEATURE_FIND_PATH( ACTS(path, const char *pattern;)) |
83 | USE_FEATURE_FIND_REGEX( ACTS(regex, regex_t compiled_pattern;)) |
84 | USE_FEATURE_FIND_PRINT0( ACTS(print0)) |
85 | USE_FEATURE_FIND_TYPE( ACTS(type, int type_mask;)) |
86 | USE_FEATURE_FIND_PERM( ACTS(perm, char perm_char; mode_t perm_mask;)) |
87 | USE_FEATURE_FIND_MTIME( ACTS(mtime, char mtime_char; unsigned mtime_days;)) |
88 | USE_FEATURE_FIND_MMIN( ACTS(mmin, char mmin_char; unsigned mmin_mins;)) |
89 | USE_FEATURE_FIND_NEWER( ACTS(newer, time_t newer_mtime;)) |
90 | USE_FEATURE_FIND_INUM( ACTS(inum, ino_t inode_num;)) |
91 | USE_FEATURE_FIND_USER( ACTS(user, uid_t uid;)) |
92 | USE_FEATURE_FIND_SIZE( ACTS(size, char size_char; off_t size;)) |
93 | USE_FEATURE_FIND_CONTEXT(ACTS(context, security_context_t context;)) |
94 | USE_FEATURE_FIND_PAREN( ACTS(paren, action ***subexpr;)) |
95 | USE_FEATURE_FIND_PRUNE( ACTS(prune)) |
96 | USE_FEATURE_FIND_DELETE( ACTS(delete)) |
97 | USE_FEATURE_FIND_EXEC( ACTS(exec, char **exec_argv; unsigned *subst_count; int exec_argc;)) |
98 | USE_FEATURE_FIND_GROUP( ACTS(group, gid_t gid;)) |
99 | |
100 | static action ***actions; |
101 | static bool need_print = 1; |
102 | static int recurse_flags = ACTION_RECURSE; |
103 | |
104 | #if ENABLE_FEATURE_FIND_EXEC |
105 | static unsigned count_subst(const char *str) |
106 | { |
107 | unsigned count = 0; |
108 | while ((str = strstr(str, "{}")) != NULL) { |
109 | count++; |
110 | str++; |
111 | } |
112 | return count; |
113 | } |
114 | |
115 | |
116 | static char* subst(const char *src, unsigned count, const char* filename) |
117 | { |
118 | char *buf, *dst, *end; |
119 | size_t flen = strlen(filename); |
120 | /* we replace each '{}' with filename: growth by strlen-2 */ |
121 | buf = dst = xmalloc(strlen(src) + count*(flen-2) + 1); |
122 | while ((end = strstr(src, "{}"))) { |
123 | memcpy(dst, src, end - src); |
124 | dst += end - src; |
125 | src = end + 2; |
126 | memcpy(dst, filename, flen); |
127 | dst += flen; |
128 | } |
129 | strcpy(dst, src); |
130 | return buf; |
131 | } |
132 | #endif |
133 | |
134 | /* Return values of ACTFs ('action functions') are a bit mask: |
135 | * bit 1=1: prune (use SKIP constant for setting it) |
136 | * bit 0=1: matched successfully (TRUE) |
137 | */ |
138 | |
139 | static int exec_actions(action ***appp, const char *fileName, struct stat *statbuf) |
140 | { |
141 | int cur_group; |
142 | int cur_action; |
143 | int rc = 0; |
144 | action **app, *ap; |
145 | |
146 | /* "action group" is a set of actions ANDed together. |
147 | * groups are ORed together. |
148 | * We simply evaluate each group until we find one in which all actions |
149 | * succeed. */ |
150 | |
151 | /* -prune is special: if it is encountered, then we won't |
152 | * descend into current directory. It doesn't matter whether |
153 | * action group (in which -prune sits) will succeed or not: |
154 | * find * -prune -name 'f*' -o -name 'm*' -- prunes every dir |
155 | * find * -name 'f*' -o -prune -name 'm*' -- prunes all dirs |
156 | * not starting with 'f' */ |
157 | |
158 | /* We invert TRUE bit (bit 0). Now 1 there means 'failure'. |
159 | * and bitwise OR in "rc |= TRUE ^ ap->f()" will: |
160 | * (1) make SKIP (-prune) bit stick; and (2) detect 'failure'. |
161 | * On return, bit is restored. */ |
162 | |
163 | cur_group = -1; |
164 | while ((app = appp[++cur_group])) { |
165 | rc &= ~TRUE; /* 'success' so far, clear TRUE bit */ |
166 | cur_action = -1; |
167 | while (1) { |
168 | ap = app[++cur_action]; |
169 | if (!ap) /* all actions in group were successful */ |
170 | return rc ^ TRUE; /* restore TRUE bit */ |
171 | rc |= TRUE ^ ap->f(fileName, statbuf, ap); |
172 | #if ENABLE_FEATURE_FIND_NOT |
173 | if (ap->invert) rc ^= TRUE; |
174 | #endif |
175 | if (rc & TRUE) /* current group failed, try next */ |
176 | break; |
177 | } |
178 | } |
179 | return rc ^ TRUE; /* restore TRUE bit */ |
180 | } |
181 | |
182 | |
183 | ACTF(name) |
184 | { |
185 | const char *tmp = bb_basename(fileName); |
186 | if (tmp != fileName && !*tmp) { /* "foo/bar/". Oh no... go back to 'b' */ |
187 | tmp--; |
188 | while (tmp != fileName && *--tmp != '/') |
189 | continue; |
190 | if (*tmp == '/') |
191 | tmp++; |
192 | } |
193 | return fnmatch(ap->pattern, tmp, FNM_PERIOD | (ap->iname ? FNM_CASEFOLD : 0)) == 0; |
194 | } |
195 | |
196 | #if ENABLE_FEATURE_FIND_PATH |
197 | ACTF(path) |
198 | { |
199 | return fnmatch(ap->pattern, fileName, 0) == 0; |
200 | } |
201 | #endif |
202 | #if ENABLE_FEATURE_FIND_REGEX |
203 | ACTF(regex) |
204 | { |
205 | regmatch_t match; |
206 | if (regexec(&ap->compiled_pattern, fileName, 1, &match, 0 /*eflags*/)) |
207 | return 0; /* no match */ |
208 | if (match.rm_so) |
209 | return 0; /* match doesn't start at pos 0 */ |
210 | if (fileName[match.rm_eo]) |
211 | return 0; /* match doesn't end exactly at end of pathname */ |
212 | return 1; |
213 | } |
214 | #endif |
215 | #if ENABLE_FEATURE_FIND_TYPE |
216 | ACTF(type) |
217 | { |
218 | return ((statbuf->st_mode & S_IFMT) == ap->type_mask); |
219 | } |
220 | #endif |
221 | #if ENABLE_FEATURE_FIND_PERM |
222 | ACTF(perm) |
223 | { |
224 | /* -perm +mode: at least one of perm_mask bits are set */ |
225 | if (ap->perm_char == '+') |
226 | return (statbuf->st_mode & ap->perm_mask) != 0; |
227 | /* -perm -mode: all of perm_mask are set */ |
228 | if (ap->perm_char == '-') |
229 | return (statbuf->st_mode & ap->perm_mask) == ap->perm_mask; |
230 | /* -perm mode: file mode must match perm_mask */ |
231 | return (statbuf->st_mode & 07777) == ap->perm_mask; |
232 | } |
233 | #endif |
234 | #if ENABLE_FEATURE_FIND_MTIME |
235 | ACTF(mtime) |
236 | { |
237 | time_t file_age = time(NULL) - statbuf->st_mtime; |
238 | time_t mtime_secs = ap->mtime_days * 24*60*60; |
239 | if (ap->mtime_char == '+') |
240 | return file_age >= mtime_secs + 24*60*60; |
241 | if (ap->mtime_char == '-') |
242 | return file_age < mtime_secs; |
243 | /* just numeric mtime */ |
244 | return file_age >= mtime_secs && file_age < (mtime_secs + 24*60*60); |
245 | } |
246 | #endif |
247 | #if ENABLE_FEATURE_FIND_MMIN |
248 | ACTF(mmin) |
249 | { |
250 | time_t file_age = time(NULL) - statbuf->st_mtime; |
251 | time_t mmin_secs = ap->mmin_mins * 60; |
252 | if (ap->mmin_char == '+') |
253 | return file_age >= mmin_secs + 60; |
254 | if (ap->mmin_char == '-') |
255 | return file_age < mmin_secs; |
256 | /* just numeric mmin */ |
257 | return file_age >= mmin_secs && file_age < (mmin_secs + 60); |
258 | } |
259 | #endif |
260 | #if ENABLE_FEATURE_FIND_NEWER |
261 | ACTF(newer) |
262 | { |
263 | return (ap->newer_mtime < statbuf->st_mtime); |
264 | } |
265 | #endif |
266 | #if ENABLE_FEATURE_FIND_INUM |
267 | ACTF(inum) |
268 | { |
269 | return (statbuf->st_ino == ap->inode_num); |
270 | } |
271 | #endif |
272 | #if ENABLE_FEATURE_FIND_EXEC |
273 | ACTF(exec) |
274 | { |
275 | int i, rc; |
276 | char *argv[ap->exec_argc + 1]; |
277 | for (i = 0; i < ap->exec_argc; i++) |
278 | argv[i] = subst(ap->exec_argv[i], ap->subst_count[i], fileName); |
279 | argv[i] = NULL; /* terminate the list */ |
280 | |
281 | rc = spawn_and_wait(argv); |
282 | if (rc < 0) |
283 | bb_simple_perror_msg(argv[0]); |
284 | |
285 | i = 0; |
286 | while (argv[i]) |
287 | free(argv[i++]); |
288 | return rc == 0; /* return 1 if exitcode 0 */ |
289 | } |
290 | #endif |
291 | #if ENABLE_FEATURE_FIND_USER |
292 | ACTF(user) |
293 | { |
294 | return (statbuf->st_uid == ap->uid); |
295 | } |
296 | #endif |
297 | #if ENABLE_FEATURE_FIND_GROUP |
298 | ACTF(group) |
299 | { |
300 | return (statbuf->st_gid == ap->gid); |
301 | } |
302 | #endif |
303 | #if ENABLE_FEATURE_FIND_PRINT0 |
304 | ACTF(print0) |
305 | { |
306 | printf("%s%c", fileName, '\0'); |
307 | return TRUE; |
308 | } |
309 | #endif |
310 | ACTF(print) |
311 | { |
312 | puts(fileName); |
313 | return TRUE; |
314 | } |
315 | #if ENABLE_FEATURE_FIND_PAREN |
316 | ACTF(paren) |
317 | { |
318 | return exec_actions(ap->subexpr, fileName, statbuf); |
319 | } |
320 | #endif |
321 | #if ENABLE_FEATURE_FIND_SIZE |
322 | ACTF(size) |
323 | { |
324 | if (ap->size_char == '+') |
325 | return statbuf->st_size > ap->size; |
326 | if (ap->size_char == '-') |
327 | return statbuf->st_size < ap->size; |
328 | return statbuf->st_size == ap->size; |
329 | } |
330 | #endif |
331 | #if ENABLE_FEATURE_FIND_PRUNE |
332 | /* |
333 | * -prune: if -depth is not given, return true and do not descend |
334 | * current dir; if -depth is given, return false with no effect. |
335 | * Example: |
336 | * find dir -name 'asm-*' -prune -o -name '*.[chS]' -print |
337 | */ |
338 | ACTF(prune) |
339 | { |
340 | return SKIP + TRUE; |
341 | } |
342 | #endif |
343 | #if ENABLE_FEATURE_FIND_DELETE |
344 | ACTF(delete) |
345 | { |
346 | int rc; |
347 | if (S_ISDIR(statbuf->st_mode)) { |
348 | rc = rmdir(fileName); |
349 | } else { |
350 | rc = unlink(fileName); |
351 | } |
352 | if (rc < 0) |
353 | bb_simple_perror_msg(fileName); |
354 | return TRUE; |
355 | } |
356 | #endif |
357 | #if ENABLE_FEATURE_FIND_CONTEXT |
358 | ACTF(context) |
359 | { |
360 | security_context_t con; |
361 | int rc; |
362 | |
363 | if (recurse_flags & ACTION_FOLLOWLINKS) { |
364 | rc = getfilecon(fileName, &con); |
365 | } else { |
366 | rc = lgetfilecon(fileName, &con); |
367 | } |
368 | if (rc < 0) |
369 | return FALSE; |
370 | rc = strcmp(ap->context, con); |
371 | freecon(con); |
372 | return rc == 0; |
373 | } |
374 | #endif |
375 | |
376 | |
377 | static int FAST_FUNC fileAction(const char *fileName, |
378 | struct stat *statbuf, |
379 | void *userData SKIP_FEATURE_FIND_MAXDEPTH(UNUSED_PARAM), |
380 | int depth SKIP_FEATURE_FIND_MAXDEPTH(UNUSED_PARAM)) |
381 | { |
382 | int i; |
383 | #if ENABLE_FEATURE_FIND_MAXDEPTH |
384 | int maxdepth = (int)(ptrdiff_t)userData; |
385 | |
386 | if (depth > maxdepth) return SKIP; |
387 | #endif |
388 | |
389 | #if ENABLE_FEATURE_FIND_XDEV |
390 | if (S_ISDIR(statbuf->st_mode) && xdev_count) { |
391 | for (i = 0; i < xdev_count; i++) { |
392 | if (xdev_dev[i] == statbuf->st_dev) |
393 | break; |
394 | } |
395 | if (i == xdev_count) |
396 | return SKIP; |
397 | } |
398 | #endif |
399 | i = exec_actions(actions, fileName, statbuf); |
400 | /* Had no explicit -print[0] or -exec? then print */ |
401 | if ((i & TRUE) && need_print) |
402 | puts(fileName); |
403 | /* Cannot return 0: our caller, recursive_action(), |
404 | * will perror() and skip dirs (if called on dir) */ |
405 | return (i & SKIP) ? SKIP : TRUE; |
406 | } |
407 | |
408 | |
409 | #if ENABLE_FEATURE_FIND_TYPE |
410 | static int find_type(const char *type) |
411 | { |
412 | int mask = 0; |
413 | |
414 | if (*type == 'b') |
415 | mask = S_IFBLK; |
416 | else if (*type == 'c') |
417 | mask = S_IFCHR; |
418 | else if (*type == 'd') |
419 | mask = S_IFDIR; |
420 | else if (*type == 'p') |
421 | mask = S_IFIFO; |
422 | else if (*type == 'f') |
423 | mask = S_IFREG; |
424 | else if (*type == 'l') |
425 | mask = S_IFLNK; |
426 | else if (*type == 's') |
427 | mask = S_IFSOCK; |
428 | |
429 | if (mask == 0 || *(type + 1) != '\0') |
430 | bb_error_msg_and_die(bb_msg_invalid_arg, type, "-type"); |
431 | |
432 | return mask; |
433 | } |
434 | #endif |
435 | |
436 | #if ENABLE_FEATURE_FIND_PERM \ |
437 | || ENABLE_FEATURE_FIND_MTIME || ENABLE_FEATURE_FIND_MMIN \ |
438 | || ENABLE_FEATURE_FIND_SIZE |
439 | static const char* plus_minus_num(const char* str) |
440 | { |
441 | if (*str == '-' || *str == '+') |
442 | str++; |
443 | return str; |
444 | } |
445 | #endif |
446 | |
447 | static action*** parse_params(char **argv) |
448 | { |
449 | enum { |
450 | PARM_a , |
451 | PARM_o , |
452 | USE_FEATURE_FIND_NOT( PARM_char_not ,) |
453 | #if ENABLE_DESKTOP |
454 | PARM_and , |
455 | PARM_or , |
456 | USE_FEATURE_FIND_NOT( PARM_not ,) |
457 | #endif |
458 | PARM_print , |
459 | USE_FEATURE_FIND_PRINT0( PARM_print0 ,) |
460 | USE_FEATURE_FIND_DEPTH( PARM_depth ,) |
461 | USE_FEATURE_FIND_PRUNE( PARM_prune ,) |
462 | USE_FEATURE_FIND_DELETE( PARM_delete ,) |
463 | USE_FEATURE_FIND_EXEC( PARM_exec ,) |
464 | USE_FEATURE_FIND_PAREN( PARM_char_brace,) |
465 | /* All options starting from here require argument */ |
466 | PARM_name , |
467 | PARM_iname , |
468 | USE_FEATURE_FIND_PATH( PARM_path ,) |
469 | USE_FEATURE_FIND_REGEX( PARM_regex ,) |
470 | USE_FEATURE_FIND_TYPE( PARM_type ,) |
471 | USE_FEATURE_FIND_PERM( PARM_perm ,) |
472 | USE_FEATURE_FIND_MTIME( PARM_mtime ,) |
473 | USE_FEATURE_FIND_MMIN( PARM_mmin ,) |
474 | USE_FEATURE_FIND_NEWER( PARM_newer ,) |
475 | USE_FEATURE_FIND_INUM( PARM_inum ,) |
476 | USE_FEATURE_FIND_USER( PARM_user ,) |
477 | USE_FEATURE_FIND_GROUP( PARM_group ,) |
478 | USE_FEATURE_FIND_SIZE( PARM_size ,) |
479 | USE_FEATURE_FIND_CONTEXT(PARM_context ,) |
480 | }; |
481 | |
482 | static const char params[] ALIGN1 = |
483 | "-a\0" |
484 | "-o\0" |
485 | USE_FEATURE_FIND_NOT( "!\0" ) |
486 | #if ENABLE_DESKTOP |
487 | "-and\0" |
488 | "-or\0" |
489 | USE_FEATURE_FIND_NOT( "-not\0" ) |
490 | #endif |
491 | "-print\0" |
492 | USE_FEATURE_FIND_PRINT0( "-print0\0" ) |
493 | USE_FEATURE_FIND_DEPTH( "-depth\0" ) |
494 | USE_FEATURE_FIND_PRUNE( "-prune\0" ) |
495 | USE_FEATURE_FIND_DELETE( "-delete\0" ) |
496 | USE_FEATURE_FIND_EXEC( "-exec\0" ) |
497 | USE_FEATURE_FIND_PAREN( "(\0" ) |
498 | /* All options starting from here require argument */ |
499 | "-name\0" |
500 | "-iname\0" |
501 | USE_FEATURE_FIND_PATH( "-path\0" ) |
502 | USE_FEATURE_FIND_REGEX( "-regex\0" ) |
503 | USE_FEATURE_FIND_TYPE( "-type\0" ) |
504 | USE_FEATURE_FIND_PERM( "-perm\0" ) |
505 | USE_FEATURE_FIND_MTIME( "-mtime\0" ) |
506 | USE_FEATURE_FIND_MMIN( "-mmin\0" ) |
507 | USE_FEATURE_FIND_NEWER( "-newer\0" ) |
508 | USE_FEATURE_FIND_INUM( "-inum\0" ) |
509 | USE_FEATURE_FIND_USER( "-user\0" ) |
510 | USE_FEATURE_FIND_GROUP( "-group\0" ) |
511 | USE_FEATURE_FIND_SIZE( "-size\0" ) |
512 | USE_FEATURE_FIND_CONTEXT("-context\0") |
513 | ; |
514 | |
515 | action*** appp; |
516 | unsigned cur_group = 0; |
517 | unsigned cur_action = 0; |
518 | USE_FEATURE_FIND_NOT( bool invert_flag = 0; ) |
519 | |
520 | /* This is the only place in busybox where we use nested function. |
521 | * So far more standard alternatives were bigger. */ |
522 | /* Suppress a warning "func without a prototype" */ |
523 | auto action* alloc_action(int sizeof_struct, action_fp f); |
524 | action* alloc_action(int sizeof_struct, action_fp f) |
525 | { |
526 | action *ap; |
527 | appp[cur_group] = xrealloc(appp[cur_group], (cur_action+2) * sizeof(*appp)); |
528 | appp[cur_group][cur_action++] = ap = xmalloc(sizeof_struct); |
529 | appp[cur_group][cur_action] = NULL; |
530 | ap->f = f; |
531 | USE_FEATURE_FIND_NOT( ap->invert = invert_flag; ) |
532 | USE_FEATURE_FIND_NOT( invert_flag = 0; ) |
533 | return ap; |
534 | } |
535 | |
536 | #define ALLOC_ACTION(name) (action_##name*)alloc_action(sizeof(action_##name), (action_fp) func_##name) |
537 | |
538 | appp = xzalloc(2 * sizeof(appp[0])); /* appp[0],[1] == NULL */ |
539 | |
540 | /* Actions have side effects and return a true or false value |
541 | * We implement: -print, -print0, -exec |
542 | * |
543 | * The rest are tests. |
544 | * |
545 | * Tests and actions are grouped by operators |
546 | * ( expr ) Force precedence |
547 | * ! expr True if expr is false |
548 | * -not expr Same as ! expr |
549 | * expr1 [-a[nd]] expr2 And; expr2 is not evaluated if expr1 is false |
550 | * expr1 -o[r] expr2 Or; expr2 is not evaluated if expr1 is true |
551 | * expr1 , expr2 List; both expr1 and expr2 are always evaluated |
552 | * We implement: (), -a, -o |
553 | */ |
554 | while (*argv) { |
555 | const char *arg = argv[0]; |
556 | int parm = index_in_strings(params, arg); |
557 | const char *arg1 = argv[1]; |
558 | |
559 | if (parm >= PARM_name) { |
560 | /* All options starting from -name require argument */ |
561 | if (!arg1) |
562 | bb_error_msg_and_die(bb_msg_requires_arg, arg); |
563 | argv++; |
564 | } |
565 | |
566 | /* We can use big switch() here, but on i386 |
567 | * it doesn't give smaller code. Other arches? */ |
568 | |
569 | /* --- Operators --- */ |
570 | if (parm == PARM_a USE_DESKTOP(|| parm == PARM_and)) { |
571 | /* no further special handling required */ |
572 | } |
573 | else if (parm == PARM_o USE_DESKTOP(|| parm == PARM_or)) { |
574 | /* start new OR group */ |
575 | cur_group++; |
576 | appp = xrealloc(appp, (cur_group+2) * sizeof(*appp)); |
577 | /*appp[cur_group] = NULL; - already NULL */ |
578 | appp[cur_group+1] = NULL; |
579 | cur_action = 0; |
580 | } |
581 | #if ENABLE_FEATURE_FIND_NOT |
582 | else if (parm == PARM_char_not USE_DESKTOP(|| parm == PARM_not)) { |
583 | /* also handles "find ! ! -name 'foo*'" */ |
584 | invert_flag ^= 1; |
585 | } |
586 | #endif |
587 | |
588 | /* --- Tests and actions --- */ |
589 | else if (parm == PARM_print) { |
590 | need_print = 0; |
591 | /* GNU find ignores '!' here: "find ! -print" */ |
592 | USE_FEATURE_FIND_NOT( invert_flag = 0; ) |
593 | (void) ALLOC_ACTION(print); |
594 | } |
595 | #if ENABLE_FEATURE_FIND_PRINT0 |
596 | else if (parm == PARM_print0) { |
597 | need_print = 0; |
598 | USE_FEATURE_FIND_NOT( invert_flag = 0; ) |
599 | (void) ALLOC_ACTION(print0); |
600 | } |
601 | #endif |
602 | #if ENABLE_FEATURE_FIND_DEPTH |
603 | else if (parm == PARM_depth) { |
604 | recurse_flags |= ACTION_DEPTHFIRST; |
605 | } |
606 | #endif |
607 | #if ENABLE_FEATURE_FIND_PRUNE |
608 | else if (parm == PARM_prune) { |
609 | USE_FEATURE_FIND_NOT( invert_flag = 0; ) |
610 | (void) ALLOC_ACTION(prune); |
611 | } |
612 | #endif |
613 | #if ENABLE_FEATURE_FIND_DELETE |
614 | else if (parm == PARM_delete) { |
615 | need_print = 0; |
616 | recurse_flags |= ACTION_DEPTHFIRST; |
617 | (void) ALLOC_ACTION(delete); |
618 | } |
619 | #endif |
620 | #if ENABLE_FEATURE_FIND_EXEC |
621 | else if (parm == PARM_exec) { |
622 | int i; |
623 | action_exec *ap; |
624 | need_print = 0; |
625 | USE_FEATURE_FIND_NOT( invert_flag = 0; ) |
626 | ap = ALLOC_ACTION(exec); |
627 | ap->exec_argv = ++argv; /* first arg after -exec */ |
628 | ap->exec_argc = 0; |
629 | while (1) { |
630 | if (!*argv) /* did not see ';' until end */ |
631 | bb_error_msg_and_die("-exec CMD must end by ';'"); |
632 | if (LONE_CHAR(argv[0], ';')) |
633 | break; |
634 | argv++; |
635 | ap->exec_argc++; |
636 | } |
637 | if (ap->exec_argc == 0) |
638 | bb_error_msg_and_die(bb_msg_requires_arg, arg); |
639 | ap->subst_count = xmalloc(ap->exec_argc * sizeof(int)); |
640 | i = ap->exec_argc; |
641 | while (i--) |
642 | ap->subst_count[i] = count_subst(ap->exec_argv[i]); |
643 | } |
644 | #endif |
645 | #if ENABLE_FEATURE_FIND_PAREN |
646 | else if (parm == PARM_char_brace) { |
647 | action_paren *ap; |
648 | char **endarg; |
649 | unsigned nested = 1; |
650 | |
651 | endarg = argv; |
652 | while (1) { |
653 | if (!*++endarg) |
654 | bb_error_msg_and_die("unpaired '('"); |
655 | if (LONE_CHAR(*endarg, '(')) |
656 | nested++; |
657 | else if (LONE_CHAR(*endarg, ')') && !--nested) { |
658 | *endarg = NULL; |
659 | break; |
660 | } |
661 | } |
662 | ap = ALLOC_ACTION(paren); |
663 | ap->subexpr = parse_params(argv + 1); |
664 | *endarg = (char*) ")"; /* restore NULLed parameter */ |
665 | argv = endarg; |
666 | } |
667 | #endif |
668 | else if (parm == PARM_name || parm == PARM_iname) { |
669 | action_name *ap; |
670 | ap = ALLOC_ACTION(name); |
671 | ap->pattern = arg1; |
672 | ap->iname = (parm == PARM_iname); |
673 | } |
674 | #if ENABLE_FEATURE_FIND_PATH |
675 | else if (parm == PARM_path) { |
676 | action_path *ap; |
677 | ap = ALLOC_ACTION(path); |
678 | ap->pattern = arg1; |
679 | } |
680 | #endif |
681 | #if ENABLE_FEATURE_FIND_REGEX |
682 | else if (parm == PARM_regex) { |
683 | action_regex *ap; |
684 | ap = ALLOC_ACTION(regex); |
685 | xregcomp(&ap->compiled_pattern, arg1, 0 /*cflags*/); |
686 | } |
687 | #endif |
688 | #if ENABLE_FEATURE_FIND_TYPE |
689 | else if (parm == PARM_type) { |
690 | action_type *ap; |
691 | ap = ALLOC_ACTION(type); |
692 | ap->type_mask = find_type(arg1); |
693 | } |
694 | #endif |
695 | #if ENABLE_FEATURE_FIND_PERM |
696 | /* -perm mode File's permission bits are exactly mode (octal or symbolic). |
697 | * Symbolic modes use mode 0 as a point of departure. |
698 | * -perm -mode All of the permission bits mode are set for the file. |
699 | * -perm +mode Any of the permission bits mode are set for the file. |
700 | */ |
701 | else if (parm == PARM_perm) { |
702 | action_perm *ap; |
703 | ap = ALLOC_ACTION(perm); |
704 | ap->perm_char = arg1[0]; |
705 | arg1 = plus_minus_num(arg1); |
706 | ap->perm_mask = 0; |
707 | if (!bb_parse_mode(arg1, &ap->perm_mask)) |
708 | bb_error_msg_and_die("invalid mode: %s", arg1); |
709 | } |
710 | #endif |
711 | #if ENABLE_FEATURE_FIND_MTIME |
712 | else if (parm == PARM_mtime) { |
713 | action_mtime *ap; |
714 | ap = ALLOC_ACTION(mtime); |
715 | ap->mtime_char = arg1[0]; |
716 | ap->mtime_days = xatoul(plus_minus_num(arg1)); |
717 | } |
718 | #endif |
719 | #if ENABLE_FEATURE_FIND_MMIN |
720 | else if (parm == PARM_mmin) { |
721 | action_mmin *ap; |
722 | ap = ALLOC_ACTION(mmin); |
723 | ap->mmin_char = arg1[0]; |
724 | ap->mmin_mins = xatoul(plus_minus_num(arg1)); |
725 | } |
726 | #endif |
727 | #if ENABLE_FEATURE_FIND_NEWER |
728 | else if (parm == PARM_newer) { |
729 | struct stat stat_newer; |
730 | action_newer *ap; |
731 | ap = ALLOC_ACTION(newer); |
732 | xstat(arg1, &stat_newer); |
733 | ap->newer_mtime = stat_newer.st_mtime; |
734 | } |
735 | #endif |
736 | #if ENABLE_FEATURE_FIND_INUM |
737 | else if (parm == PARM_inum) { |
738 | action_inum *ap; |
739 | ap = ALLOC_ACTION(inum); |
740 | ap->inode_num = xatoul(arg1); |
741 | } |
742 | #endif |
743 | #if ENABLE_FEATURE_FIND_USER |
744 | else if (parm == PARM_user) { |
745 | action_user *ap; |
746 | ap = ALLOC_ACTION(user); |
747 | ap->uid = bb_strtou(arg1, NULL, 10); |
748 | if (errno) |
749 | ap->uid = xuname2uid(arg1); |
750 | } |
751 | #endif |
752 | #if ENABLE_FEATURE_FIND_GROUP |
753 | else if (parm == PARM_group) { |
754 | action_group *ap; |
755 | ap = ALLOC_ACTION(group); |
756 | ap->gid = bb_strtou(arg1, NULL, 10); |
757 | if (errno) |
758 | ap->gid = xgroup2gid(arg1); |
759 | } |
760 | #endif |
761 | #if ENABLE_FEATURE_FIND_SIZE |
762 | else if (parm == PARM_size) { |
763 | /* -size n[bckw]: file uses n units of space |
764 | * b (default): units are 512-byte blocks |
765 | * c: 1 byte |
766 | * k: kilobytes |
767 | * w: 2-byte words |
768 | */ |
769 | #if ENABLE_LFS |
770 | #define XATOU_SFX xatoull_sfx |
771 | #else |
772 | #define XATOU_SFX xatoul_sfx |
773 | #endif |
774 | static const struct suffix_mult find_suffixes[] = { |
775 | { "c", 1 }, |
776 | { "w", 2 }, |
777 | { "", 512 }, |
778 | { "b", 512 }, |
779 | { "k", 1024 }, |
780 | { } |
781 | }; |
782 | action_size *ap; |
783 | ap = ALLOC_ACTION(size); |
784 | ap->size_char = arg1[0]; |
785 | ap->size = XATOU_SFX(plus_minus_num(arg1), find_suffixes); |
786 | } |
787 | #endif |
788 | #if ENABLE_FEATURE_FIND_CONTEXT |
789 | else if (parm == PARM_context) { |
790 | action_context *ap; |
791 | ap = ALLOC_ACTION(context); |
792 | ap->context = NULL; |
793 | /* SELinux headers erroneously declare non-const parameter */ |
794 | if (selinux_raw_to_trans_context((char*)arg1, &ap->context)) |
795 | bb_simple_perror_msg(arg1); |
796 | } |
797 | #endif |
798 | else { |
799 | bb_error_msg("unrecognized: %s", arg); |
800 | bb_show_usage(); |
801 | } |
802 | argv++; |
803 | } |
804 | return appp; |
805 | #undef ALLOC_ACTION |
806 | } |
807 | |
808 | |
809 | int find_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE; |
810 | int find_main(int argc, char **argv) |
811 | { |
812 | static const char options[] ALIGN1 = |
813 | "-follow\0" |
814 | USE_FEATURE_FIND_XDEV( "-xdev\0" ) |
815 | USE_FEATURE_FIND_MAXDEPTH("-maxdepth\0") |
816 | ; |
817 | enum { |
818 | OPT_FOLLOW, |
819 | USE_FEATURE_FIND_XDEV( OPT_XDEV ,) |
820 | USE_FEATURE_FIND_MAXDEPTH(OPT_MAXDEPTH,) |
821 | }; |
822 | |
823 | char *arg; |
824 | char **argp; |
825 | int i, firstopt, status = EXIT_SUCCESS; |
826 | #if ENABLE_FEATURE_FIND_MAXDEPTH |
827 | int maxdepth = INT_MAX; |
828 | #endif |
829 | |
830 | for (firstopt = 1; firstopt < argc; firstopt++) { |
831 | if (argv[firstopt][0] == '-') |
832 | break; |
833 | if (ENABLE_FEATURE_FIND_NOT && LONE_CHAR(argv[firstopt], '!')) |
834 | break; |
835 | #if ENABLE_FEATURE_FIND_PAREN |
836 | if (LONE_CHAR(argv[firstopt], '(')) |
837 | break; |
838 | #endif |
839 | } |
840 | if (firstopt == 1) { |
841 | argv[0] = (char*)"."; |
842 | argv--; |
843 | firstopt++; |
844 | } |
845 | |
846 | /* All options always return true. They always take effect |
847 | * rather than being processed only when their place in the |
848 | * expression is reached. |
849 | * We implement: -follow, -xdev, -maxdepth |
850 | */ |
851 | /* Process options, and replace then with -a */ |
852 | /* (-a will be ignored by recursive parser later) */ |
853 | argp = &argv[firstopt]; |
854 | while ((arg = argp[0])) { |
855 | int opt = index_in_strings(options, arg); |
856 | if (opt == OPT_FOLLOW) { |
857 | recurse_flags |= ACTION_FOLLOWLINKS; |
858 | argp[0] = (char*)"-a"; |
859 | } |
860 | #if ENABLE_FEATURE_FIND_XDEV |
861 | if (opt == OPT_XDEV) { |
862 | struct stat stbuf; |
863 | if (!xdev_count) { |
864 | xdev_count = firstopt - 1; |
865 | xdev_dev = xmalloc(xdev_count * sizeof(dev_t)); |
866 | for (i = 1; i < firstopt; i++) { |
867 | /* not xstat(): shouldn't bomb out on |
868 | * "find not_exist exist -xdev" */ |
869 | if (stat(argv[i], &stbuf)) |
870 | stbuf.st_dev = -1L; |
871 | xdev_dev[i-1] = stbuf.st_dev; |
872 | } |
873 | } |
874 | argp[0] = (char*)"-a"; |
875 | } |
876 | #endif |
877 | #if ENABLE_FEATURE_FIND_MAXDEPTH |
878 | if (opt == OPT_MAXDEPTH) { |
879 | if (!argp[1]) |
880 | bb_show_usage(); |
881 | maxdepth = xatoi_u(argp[1]); |
882 | argp[0] = (char*)"-a"; |
883 | argp[1] = (char*)"-a"; |
884 | argp++; |
885 | } |
886 | #endif |
887 | argp++; |
888 | } |
889 | |
890 | actions = parse_params(&argv[firstopt]); |
891 | |
892 | for (i = 1; i < firstopt; i++) { |
893 | if (!recursive_action(argv[i], |
894 | recurse_flags, /* flags */ |
895 | fileAction, /* file action */ |
896 | fileAction, /* dir action */ |
897 | #if ENABLE_FEATURE_FIND_MAXDEPTH |
898 | /* double cast suppresses |
899 | * "cast to ptr from int of different size" */ |
900 | (void*)(ptrdiff_t)maxdepth,/* user data */ |
901 | #else |
902 | NULL, /* user data */ |
903 | #endif |
904 | 0)) /* depth */ |
905 | status = EXIT_FAILURE; |
906 | } |
907 | return status; |
908 | } |