1 /*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Cimarron D. Taylor of the University of California, Berkeley. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 */ 36 37 #ifndef lint 38 #if 0 39 static const char sccsid[] = "@(#)function.c 8.10 (Berkeley) 5/4/95"; 40 #endif 41 #endif /* not lint */ 42 43 #include <sys/cdefs.h> 44 __FBSDID("$FreeBSD$"); 45 46 #include <sys/param.h> 47 #include <sys/ucred.h> 48 #include <sys/stat.h> 49 #include <sys/types.h> 50 #include <sys/acl.h> 51 #include <sys/wait.h> 52 #include <sys/mount.h> 53 54 #include <dirent.h> 55 #include <err.h> 56 #include <errno.h> 57 #include <fnmatch.h> 58 #include <fts.h> 59 #include <grp.h> 60 #include <limits.h> 61 #include <pwd.h> 62 #include <regex.h> 63 #include <stdio.h> 64 #include <stdlib.h> 65 #include <string.h> 66 #include <unistd.h> 67 #include <ctype.h> 68 69 #include "find.h" 70 71 static PLAN *palloc(OPTION *); 72 static long long find_parsenum(PLAN *, const char *, char *, char *); 73 static long long find_parsetime(PLAN *, const char *, char *); 74 static char *nextarg(OPTION *, char ***); 75 76 extern char **environ; 77 78 static PLAN *lastexecplus = NULL; 79 80 #define COMPARE(a, b) do { \ 81 switch (plan->flags & F_ELG_MASK) { \ 82 case F_EQUAL: \ 83 return (a == b); \ 84 case F_LESSTHAN: \ 85 return (a < b); \ 86 case F_GREATER: \ 87 return (a > b); \ 88 default: \ 89 abort(); \ 90 } \ 91 } while(0) 92 93 static PLAN * 94 palloc(OPTION *option) 95 { 96 PLAN *new; 97 98 if ((new = malloc(sizeof(PLAN))) == NULL) 99 err(1, NULL); 100 new->execute = option->execute; 101 new->flags = option->flags; 102 new->next = NULL; 103 return new; 104 } 105 106 /* 107 * find_parsenum -- 108 * Parse a string of the form [+-]# and return the value. 109 */ 110 static long long 111 find_parsenum(PLAN *plan, const char *option, char *vp, char *endch) 112 { 113 long long value; 114 char *endchar, *str; /* Pointer to character ending conversion. */ 115 116 /* Determine comparison from leading + or -. */ 117 str = vp; 118 switch (*str) { 119 case '+': 120 ++str; 121 plan->flags |= F_GREATER; 122 break; 123 case '-': 124 ++str; 125 plan->flags |= F_LESSTHAN; 126 break; 127 default: 128 plan->flags |= F_EQUAL; 129 break; 130 } 131 132 /* 133 * Convert the string with strtoq(). Note, if strtoq() returns zero 134 * and endchar points to the beginning of the string we know we have 135 * a syntax error. 136 */ 137 value = strtoq(str, &endchar, 10); 138 if (value == 0 && endchar == str) 139 errx(1, "%s: %s: illegal numeric value", option, vp); 140 if (endchar[0] && endch == NULL) 141 errx(1, "%s: %s: illegal trailing character", option, vp); 142 if (endch) 143 *endch = endchar[0]; 144 return value; 145 } 146 147 /* 148 * find_parsetime -- 149 * Parse a string of the form [+-]([0-9]+[smhdw]?)+ and return the value. 150 */ 151 static long long 152 find_parsetime(PLAN *plan, const char *option, char *vp) 153 { 154 long long secs, value; 155 char *str, *unit; /* Pointer to character ending conversion. */ 156 157 /* Determine comparison from leading + or -. */ 158 str = vp; 159 switch (*str) { 160 case '+': 161 ++str; 162 plan->flags |= F_GREATER; 163 break; 164 case '-': 165 ++str; 166 plan->flags |= F_LESSTHAN; 167 break; 168 default: 169 plan->flags |= F_EQUAL; 170 break; 171 } 172 173 value = strtoq(str, &unit, 10); 174 if (value == 0 && unit == str) { 175 errx(1, "%s: %s: illegal time value", option, vp); 176 /* NOTREACHED */ 177 } 178 if (*unit == '\0') 179 return value; 180 181 /* Units syntax. */ 182 secs = 0; 183 for (;;) { 184 switch(*unit) { 185 case 's': /* seconds */ 186 secs += value; 187 break; 188 case 'm': /* minutes */ 189 secs += value * 60; 190 break; 191 case 'h': /* hours */ 192 secs += value * 3600; 193 break; 194 case 'd': /* days */ 195 secs += value * 86400; 196 break; 197 case 'w': /* weeks */ 198 secs += value * 604800; 199 break; 200 default: 201 errx(1, "%s: %s: bad unit '%c'", option, vp, *unit); 202 /* NOTREACHED */ 203 } 204 str = unit + 1; 205 if (*str == '\0') /* EOS */ 206 break; 207 value = strtoq(str, &unit, 10); 208 if (value == 0 && unit == str) { 209 errx(1, "%s: %s: illegal time value", option, vp); 210 /* NOTREACHED */ 211 } 212 if (*unit == '\0') { 213 errx(1, "%s: %s: missing trailing unit", option, vp); 214 /* NOTREACHED */ 215 } 216 } 217 plan->flags |= F_EXACTTIME; 218 return secs; 219 } 220 221 /* 222 * nextarg -- 223 * Check that another argument still exists, return a pointer to it, 224 * and increment the argument vector pointer. 225 */ 226 static char * 227 nextarg(OPTION *option, char ***argvp) 228 { 229 char *arg; 230 231 if ((arg = **argvp) == 0) 232 errx(1, "%s: requires additional arguments", option->name); 233 (*argvp)++; 234 return arg; 235 } /* nextarg() */ 236 237 /* 238 * The value of n for the inode times (atime, birthtime, ctime, mtime) is a 239 * range, i.e. n matches from (n - 1) to n 24 hour periods. This interacts 240 * with -n, such that "-mtime -1" would be less than 0 days, which isn't what 241 * the user wanted. Correct so that -1 is "less than 1". 242 */ 243 #define TIME_CORRECT(p) \ 244 if (((p)->flags & F_ELG_MASK) == F_LESSTHAN) \ 245 ++((p)->t_data); 246 247 /* 248 * -[acm]min n functions -- 249 * 250 * True if the difference between the 251 * file access time (-amin) 252 * file birth time (-Bmin) 253 * last change of file status information (-cmin) 254 * file modification time (-mmin) 255 * and the current time is n min periods. 256 */ 257 int 258 f_Xmin(PLAN *plan, FTSENT *entry) 259 { 260 if (plan->flags & F_TIME_C) { 261 COMPARE((now - entry->fts_statp->st_ctime + 262 60 - 1) / 60, plan->t_data); 263 } else if (plan->flags & F_TIME_A) { 264 COMPARE((now - entry->fts_statp->st_atime + 265 60 - 1) / 60, plan->t_data); 266 } else if (plan->flags & F_TIME_B) { 267 COMPARE((now - entry->fts_statp->st_birthtime + 268 60 - 1) / 60, plan->t_data); 269 } else { 270 COMPARE((now - entry->fts_statp->st_mtime + 271 60 - 1) / 60, plan->t_data); 272 } 273 } 274 275 PLAN * 276 c_Xmin(OPTION *option, char ***argvp) 277 { 278 char *nmins; 279 PLAN *new; 280 281 nmins = nextarg(option, argvp); 282 ftsoptions &= ~FTS_NOSTAT; 283 284 new = palloc(option); 285 new->t_data = find_parsenum(new, option->name, nmins, NULL); 286 TIME_CORRECT(new); 287 return new; 288 } 289 290 /* 291 * -[acm]time n functions -- 292 * 293 * True if the difference between the 294 * file access time (-atime) 295 * file birth time (-Btime) 296 * last change of file status information (-ctime) 297 * file modification time (-mtime) 298 * and the current time is n 24 hour periods. 299 */ 300 301 int 302 f_Xtime(PLAN *plan, FTSENT *entry) 303 { 304 time_t xtime; 305 306 if (plan->flags & F_TIME_A) 307 xtime = entry->fts_statp->st_atime; 308 else if (plan->flags & F_TIME_B) 309 xtime = entry->fts_statp->st_birthtime; 310 else if (plan->flags & F_TIME_C) 311 xtime = entry->fts_statp->st_ctime; 312 else 313 xtime = entry->fts_statp->st_mtime; 314 315 if (plan->flags & F_EXACTTIME) 316 COMPARE(now - xtime, plan->t_data); 317 else 318 COMPARE((now - xtime + 86400 - 1) / 86400, plan->t_data); 319 } 320 321 PLAN * 322 c_Xtime(OPTION *option, char ***argvp) 323 { 324 char *value; 325 PLAN *new; 326 327 value = nextarg(option, argvp); 328 ftsoptions &= ~FTS_NOSTAT; 329 330 new = palloc(option); 331 new->t_data = find_parsetime(new, option->name, value); 332 if (!(new->flags & F_EXACTTIME)) 333 TIME_CORRECT(new); 334 return new; 335 } 336 337 /* 338 * -maxdepth/-mindepth n functions -- 339 * 340 * Does the same as -prune if the level of the current file is 341 * greater/less than the specified maximum/minimum depth. 342 * 343 * Note that -maxdepth and -mindepth are handled specially in 344 * find_execute() so their f_* functions are set to f_always_true(). 345 */ 346 PLAN * 347 c_mXXdepth(OPTION *option, char ***argvp) 348 { 349 char *dstr; 350 PLAN *new; 351 352 dstr = nextarg(option, argvp); 353 if (dstr[0] == '-') 354 /* all other errors handled by find_parsenum() */ 355 errx(1, "%s: %s: value must be positive", option->name, dstr); 356 357 new = palloc(option); 358 if (option->flags & F_MAXDEPTH) 359 maxdepth = find_parsenum(new, option->name, dstr, NULL); 360 else 361 mindepth = find_parsenum(new, option->name, dstr, NULL); 362 return new; 363 } 364 365 /* 366 * -acl function -- 367 * 368 * Show files with EXTENDED ACL attributes. 369 */ 370 int 371 f_acl(PLAN *plan __unused, FTSENT *entry) 372 { 373 acl_t facl; 374 acl_type_t acl_type; 375 int acl_supported = 0, ret, trivial; 376 377 if (S_ISLNK(entry->fts_statp->st_mode)) 378 return 0; 379 ret = pathconf(entry->fts_accpath, _PC_ACL_NFS4); 380 if (ret > 0) { 381 acl_supported = 1; 382 acl_type = ACL_TYPE_NFS4; 383 } else if (ret < 0 && errno != EINVAL) { 384 warn("%s", entry->fts_accpath); 385 return (0); 386 } 387 if (acl_supported == 0) { 388 ret = pathconf(entry->fts_accpath, _PC_ACL_EXTENDED); 389 if (ret > 0) { 390 acl_supported = 1; 391 acl_type = ACL_TYPE_ACCESS; 392 } else if (ret < 0 && errno != EINVAL) { 393 warn("%s", entry->fts_accpath); 394 return (0); 395 } 396 } 397 if (acl_supported == 0) 398 return (0); 399 400 facl = acl_get_file(entry->fts_accpath, acl_type); 401 if (facl == NULL) { 402 warn("%s", entry->fts_accpath); 403 return (0); 404 } 405 ret = acl_is_trivial_np(facl, &trivial); 406 acl_free(facl); 407 if (ret) { 408 warn("%s", entry->fts_accpath); 409 acl_free(facl); 410 return (0); 411 } 412 if (trivial) 413 return (0); 414 return (1); 415 } 416 417 PLAN * 418 c_acl(OPTION *option, char ***argvp __unused) 419 { 420 ftsoptions &= ~FTS_NOSTAT; 421 return (palloc(option)); 422 } 423 424 /* 425 * -delete functions -- 426 * 427 * True always. Makes its best shot and continues on regardless. 428 */ 429 int 430 f_delete(PLAN *plan __unused, FTSENT *entry) 431 { 432 /* ignore these from fts */ 433 if (strcmp(entry->fts_accpath, ".") == 0 || 434 strcmp(entry->fts_accpath, "..") == 0) 435 return 1; 436 437 /* sanity check */ 438 if (isdepth == 0 || /* depth off */ 439 (ftsoptions & FTS_NOSTAT)) /* not stat()ing */ 440 errx(1, "-delete: insecure options got turned on"); 441 442 if (!(ftsoptions & FTS_PHYSICAL) || /* physical off */ 443 (ftsoptions & FTS_LOGICAL)) /* or finally, logical on */ 444 errx(1, "-delete: forbidden when symlinks are followed"); 445 446 /* Potentially unsafe - do not accept relative paths whatsoever */ 447 if (strchr(entry->fts_accpath, '/') != NULL) 448 errx(1, "-delete: %s: relative path potentially not safe", 449 entry->fts_accpath); 450 451 /* Turn off user immutable bits if running as root */ 452 if ((entry->fts_statp->st_flags & (UF_APPEND|UF_IMMUTABLE)) && 453 !(entry->fts_statp->st_flags & (SF_APPEND|SF_IMMUTABLE)) && 454 geteuid() == 0) 455 lchflags(entry->fts_accpath, 456 entry->fts_statp->st_flags &= ~(UF_APPEND|UF_IMMUTABLE)); 457 458 /* rmdir directories, unlink everything else */ 459 if (S_ISDIR(entry->fts_statp->st_mode)) { 460 if (rmdir(entry->fts_accpath) < 0 && errno != ENOTEMPTY) 461 warn("-delete: rmdir(%s)", entry->fts_path); 462 } else { 463 if (unlink(entry->fts_accpath) < 0) 464 warn("-delete: unlink(%s)", entry->fts_path); 465 } 466 467 /* "succeed" */ 468 return 1; 469 } 470 471 PLAN * 472 c_delete(OPTION *option, char ***argvp __unused) 473 { 474 475 ftsoptions &= ~FTS_NOSTAT; /* no optimise */ 476 isoutput = 1; /* possible output */ 477 isdepth = 1; /* -depth implied */ 478 479 return palloc(option); 480 } 481 482 483 /* 484 * always_true -- 485 * 486 * Always true, used for -maxdepth, -mindepth, -xdev, -follow, and -true 487 */ 488 int 489 f_always_true(PLAN *plan __unused, FTSENT *entry __unused) 490 { 491 return 1; 492 } 493 494 /* 495 * -depth functions -- 496 * 497 * With argument: True if the file is at level n. 498 * Without argument: Always true, causes descent of the directory hierarchy 499 * to be done so that all entries in a directory are acted on before the 500 * directory itself. 501 */ 502 int 503 f_depth(PLAN *plan, FTSENT *entry) 504 { 505 if (plan->flags & F_DEPTH) 506 COMPARE(entry->fts_level, plan->d_data); 507 else 508 return 1; 509 } 510 511 PLAN * 512 c_depth(OPTION *option, char ***argvp) 513 { 514 PLAN *new; 515 char *str; 516 517 new = palloc(option); 518 519 str = **argvp; 520 if (str && !(new->flags & F_DEPTH)) { 521 /* skip leading + or - */ 522 if (*str == '+' || *str == '-') 523 str++; 524 /* skip sign */ 525 if (*str == '+' || *str == '-') 526 str++; 527 if (isdigit(*str)) 528 new->flags |= F_DEPTH; 529 } 530 531 if (new->flags & F_DEPTH) { /* -depth n */ 532 char *ndepth; 533 534 ndepth = nextarg(option, argvp); 535 new->d_data = find_parsenum(new, option->name, ndepth, NULL); 536 } else { /* -d */ 537 isdepth = 1; 538 } 539 540 return new; 541 } 542 543 /* 544 * -empty functions -- 545 * 546 * True if the file or directory is empty 547 */ 548 int 549 f_empty(PLAN *plan __unused, FTSENT *entry) 550 { 551 if (S_ISREG(entry->fts_statp->st_mode) && 552 entry->fts_statp->st_size == 0) 553 return 1; 554 if (S_ISDIR(entry->fts_statp->st_mode)) { 555 struct dirent *dp; 556 int empty; 557 DIR *dir; 558 559 empty = 1; 560 dir = opendir(entry->fts_accpath); 561 if (dir == NULL) 562 err(1, "%s", entry->fts_accpath); 563 for (dp = readdir(dir); dp; dp = readdir(dir)) 564 if (dp->d_name[0] != '.' || 565 (dp->d_name[1] != '\0' && 566 (dp->d_name[1] != '.' || dp->d_name[2] != '\0'))) { 567 empty = 0; 568 break; 569 } 570 closedir(dir); 571 return empty; 572 } 573 return 0; 574 } 575 576 PLAN * 577 c_empty(OPTION *option, char ***argvp __unused) 578 { 579 ftsoptions &= ~FTS_NOSTAT; 580 581 return palloc(option); 582 } 583 584 /* 585 * [-exec | -execdir | -ok] utility [arg ... ] ; functions -- 586 * 587 * True if the executed utility returns a zero value as exit status. 588 * The end of the primary expression is delimited by a semicolon. If 589 * "{}" occurs anywhere, it gets replaced by the current pathname, 590 * or, in the case of -execdir, the current basename (filename 591 * without leading directory prefix). For -exec and -ok, 592 * the current directory for the execution of utility is the same as 593 * the current directory when the find utility was started, whereas 594 * for -execdir, it is the directory the file resides in. 595 * 596 * The primary -ok differs from -exec in that it requests affirmation 597 * of the user before executing the utility. 598 */ 599 int 600 f_exec(PLAN *plan, FTSENT *entry) 601 { 602 int cnt; 603 pid_t pid; 604 int status; 605 char *file; 606 607 if (entry == NULL && plan->flags & F_EXECPLUS) { 608 if (plan->e_ppos == plan->e_pbnum) 609 return (1); 610 plan->e_argv[plan->e_ppos] = NULL; 611 goto doexec; 612 } 613 614 /* XXX - if file/dir ends in '/' this will not work -- can it? */ 615 if ((plan->flags & F_EXECDIR) && \ 616 (file = strrchr(entry->fts_path, '/'))) 617 file++; 618 else 619 file = entry->fts_path; 620 621 if (plan->flags & F_EXECPLUS) { 622 if ((plan->e_argv[plan->e_ppos] = strdup(file)) == NULL) 623 err(1, NULL); 624 plan->e_len[plan->e_ppos] = strlen(file); 625 plan->e_psize += plan->e_len[plan->e_ppos]; 626 if (++plan->e_ppos < plan->e_pnummax && 627 plan->e_psize < plan->e_psizemax) 628 return (1); 629 plan->e_argv[plan->e_ppos] = NULL; 630 } else { 631 for (cnt = 0; plan->e_argv[cnt]; ++cnt) 632 if (plan->e_len[cnt]) 633 brace_subst(plan->e_orig[cnt], 634 &plan->e_argv[cnt], file, 635 plan->e_len[cnt]); 636 } 637 638 doexec: if ((plan->flags & F_NEEDOK) && !queryuser(plan->e_argv)) 639 return 0; 640 641 /* make sure find output is interspersed correctly with subprocesses */ 642 fflush(stdout); 643 fflush(stderr); 644 645 switch (pid = fork()) { 646 case -1: 647 err(1, "fork"); 648 /* NOTREACHED */ 649 case 0: 650 /* change dir back from where we started */ 651 if (!(plan->flags & F_EXECDIR) && fchdir(dotfd)) { 652 warn("chdir"); 653 _exit(1); 654 } 655 execvp(plan->e_argv[0], plan->e_argv); 656 warn("%s", plan->e_argv[0]); 657 _exit(1); 658 } 659 if (plan->flags & F_EXECPLUS) { 660 while (--plan->e_ppos >= plan->e_pbnum) 661 free(plan->e_argv[plan->e_ppos]); 662 plan->e_ppos = plan->e_pbnum; 663 plan->e_psize = plan->e_pbsize; 664 } 665 pid = waitpid(pid, &status, 0); 666 return (pid != -1 && WIFEXITED(status) && !WEXITSTATUS(status)); 667 } 668 669 /* 670 * c_exec, c_execdir, c_ok -- 671 * build three parallel arrays, one with pointers to the strings passed 672 * on the command line, one with (possibly duplicated) pointers to the 673 * argv array, and one with integer values that are lengths of the 674 * strings, but also flags meaning that the string has to be massaged. 675 */ 676 PLAN * 677 c_exec(OPTION *option, char ***argvp) 678 { 679 PLAN *new; /* node returned */ 680 long argmax; 681 int cnt, i; 682 char **argv, **ap, **ep, *p; 683 684 /* XXX - was in c_execdir, but seems unnecessary!? 685 ftsoptions &= ~FTS_NOSTAT; 686 */ 687 isoutput = 1; 688 689 /* XXX - this is a change from the previous coding */ 690 new = palloc(option); 691 692 for (ap = argv = *argvp;; ++ap) { 693 if (!*ap) 694 errx(1, 695 "%s: no terminating \";\" or \"+\"", option->name); 696 if (**ap == ';') 697 break; 698 if (**ap == '+' && ap != argv && strcmp(*(ap - 1), "{}") == 0) { 699 new->flags |= F_EXECPLUS; 700 break; 701 } 702 } 703 704 if (ap == argv) 705 errx(1, "%s: no command specified", option->name); 706 707 cnt = ap - *argvp + 1; 708 if (new->flags & F_EXECPLUS) { 709 new->e_ppos = new->e_pbnum = cnt - 2; 710 if ((argmax = sysconf(_SC_ARG_MAX)) == -1) { 711 warn("sysconf(_SC_ARG_MAX)"); 712 argmax = _POSIX_ARG_MAX; 713 } 714 argmax -= 1024; 715 for (ep = environ; *ep != NULL; ep++) 716 argmax -= strlen(*ep) + 1 + sizeof(*ep); 717 argmax -= 1 + sizeof(*ep); 718 new->e_pnummax = argmax / 16; 719 argmax -= sizeof(char *) * new->e_pnummax; 720 if (argmax <= 0) 721 errx(1, "no space for arguments"); 722 new->e_psizemax = argmax; 723 new->e_pbsize = 0; 724 cnt += new->e_pnummax + 1; 725 new->e_next = lastexecplus; 726 lastexecplus = new; 727 } 728 if ((new->e_argv = malloc(cnt * sizeof(char *))) == NULL) 729 err(1, NULL); 730 if ((new->e_orig = malloc(cnt * sizeof(char *))) == NULL) 731 err(1, NULL); 732 if ((new->e_len = malloc(cnt * sizeof(int))) == NULL) 733 err(1, NULL); 734 735 for (argv = *argvp, cnt = 0; argv < ap; ++argv, ++cnt) { 736 new->e_orig[cnt] = *argv; 737 if (new->flags & F_EXECPLUS) 738 new->e_pbsize += strlen(*argv) + 1; 739 for (p = *argv; *p; ++p) 740 if (!(new->flags & F_EXECPLUS) && p[0] == '{' && 741 p[1] == '}') { 742 if ((new->e_argv[cnt] = 743 malloc(MAXPATHLEN)) == NULL) 744 err(1, NULL); 745 new->e_len[cnt] = MAXPATHLEN; 746 break; 747 } 748 if (!*p) { 749 new->e_argv[cnt] = *argv; 750 new->e_len[cnt] = 0; 751 } 752 } 753 if (new->flags & F_EXECPLUS) { 754 new->e_psize = new->e_pbsize; 755 cnt--; 756 for (i = 0; i < new->e_pnummax; i++) { 757 new->e_argv[cnt] = NULL; 758 new->e_len[cnt] = 0; 759 cnt++; 760 } 761 argv = ap; 762 goto done; 763 } 764 new->e_argv[cnt] = new->e_orig[cnt] = NULL; 765 766 done: *argvp = argv + 1; 767 return new; 768 } 769 770 /* Finish any pending -exec ... {} + functions. */ 771 void 772 finish_execplus(void) 773 { 774 PLAN *p; 775 776 p = lastexecplus; 777 while (p != NULL) { 778 (p->execute)(p, NULL); 779 p = p->e_next; 780 } 781 } 782 783 int 784 f_flags(PLAN *plan, FTSENT *entry) 785 { 786 u_long flags; 787 788 flags = entry->fts_statp->st_flags; 789 if (plan->flags & F_ATLEAST) 790 return (flags | plan->fl_flags) == flags && 791 !(flags & plan->fl_notflags); 792 else if (plan->flags & F_ANY) 793 return (flags & plan->fl_flags) || 794 (flags | plan->fl_notflags) != flags; 795 else 796 return flags == plan->fl_flags && 797 !(plan->fl_flags & plan->fl_notflags); 798 } 799 800 PLAN * 801 c_flags(OPTION *option, char ***argvp) 802 { 803 char *flags_str; 804 PLAN *new; 805 u_long flags, notflags; 806 807 flags_str = nextarg(option, argvp); 808 ftsoptions &= ~FTS_NOSTAT; 809 810 new = palloc(option); 811 812 if (*flags_str == '-') { 813 new->flags |= F_ATLEAST; 814 flags_str++; 815 } else if (*flags_str == '+') { 816 new->flags |= F_ANY; 817 flags_str++; 818 } 819 if (strtofflags(&flags_str, &flags, ¬flags) == 1) 820 errx(1, "%s: %s: illegal flags string", option->name, flags_str); 821 822 new->fl_flags = flags; 823 new->fl_notflags = notflags; 824 return new; 825 } 826 827 /* 828 * -follow functions -- 829 * 830 * Always true, causes symbolic links to be followed on a global 831 * basis. 832 */ 833 PLAN * 834 c_follow(OPTION *option, char ***argvp __unused) 835 { 836 ftsoptions &= ~FTS_PHYSICAL; 837 ftsoptions |= FTS_LOGICAL; 838 839 return palloc(option); 840 } 841 842 /* 843 * -fstype functions -- 844 * 845 * True if the file is of a certain type. 846 */ 847 int 848 f_fstype(PLAN *plan, FTSENT *entry) 849 { 850 static dev_t curdev; /* need a guaranteed illegal dev value */ 851 static int first = 1; 852 struct statfs sb; 853 static int val_type, val_flags; 854 char *p, save[2] = {0,0}; 855 856 if ((plan->flags & F_MTMASK) == F_MTUNKNOWN) 857 return 0; 858 859 /* Only check when we cross mount point. */ 860 if (first || curdev != entry->fts_statp->st_dev) { 861 curdev = entry->fts_statp->st_dev; 862 863 /* 864 * Statfs follows symlinks; find wants the link's filesystem, 865 * not where it points. 866 */ 867 if (entry->fts_info == FTS_SL || 868 entry->fts_info == FTS_SLNONE) { 869 if ((p = strrchr(entry->fts_accpath, '/')) != NULL) 870 ++p; 871 else 872 p = entry->fts_accpath; 873 save[0] = p[0]; 874 p[0] = '.'; 875 save[1] = p[1]; 876 p[1] = '\0'; 877 } else 878 p = NULL; 879 880 if (statfs(entry->fts_accpath, &sb)) 881 err(1, "%s", entry->fts_accpath); 882 883 if (p) { 884 p[0] = save[0]; 885 p[1] = save[1]; 886 } 887 888 first = 0; 889 890 /* 891 * Further tests may need both of these values, so 892 * always copy both of them. 893 */ 894 val_flags = sb.f_flags; 895 val_type = sb.f_type; 896 } 897 switch (plan->flags & F_MTMASK) { 898 case F_MTFLAG: 899 return val_flags & plan->mt_data; 900 case F_MTTYPE: 901 return val_type == plan->mt_data; 902 default: 903 abort(); 904 } 905 } 906 907 PLAN * 908 c_fstype(OPTION *option, char ***argvp) 909 { 910 char *fsname; 911 PLAN *new; 912 struct xvfsconf vfc; 913 914 fsname = nextarg(option, argvp); 915 ftsoptions &= ~FTS_NOSTAT; 916 917 new = palloc(option); 918 919 /* 920 * Check first for a filesystem name. 921 */ 922 if (getvfsbyname(fsname, &vfc) == 0) { 923 new->flags |= F_MTTYPE; 924 new->mt_data = vfc.vfc_typenum; 925 return new; 926 } 927 928 switch (*fsname) { 929 case 'l': 930 if (!strcmp(fsname, "local")) { 931 new->flags |= F_MTFLAG; 932 new->mt_data = MNT_LOCAL; 933 return new; 934 } 935 break; 936 case 'r': 937 if (!strcmp(fsname, "rdonly")) { 938 new->flags |= F_MTFLAG; 939 new->mt_data = MNT_RDONLY; 940 return new; 941 } 942 break; 943 } 944 945 /* 946 * We need to make filesystem checks for filesystems 947 * that exists but aren't in the kernel work. 948 */ 949 fprintf(stderr, "Warning: Unknown filesystem type %s\n", fsname); 950 new->flags |= F_MTUNKNOWN; 951 return new; 952 } 953 954 /* 955 * -group gname functions -- 956 * 957 * True if the file belongs to the group gname. If gname is numeric and 958 * an equivalent of the getgrnam() function does not return a valid group 959 * name, gname is taken as a group ID. 960 */ 961 int 962 f_group(PLAN *plan, FTSENT *entry) 963 { 964 COMPARE(entry->fts_statp->st_gid, plan->g_data); 965 } 966 967 PLAN * 968 c_group(OPTION *option, char ***argvp) 969 { 970 char *gname; 971 PLAN *new; 972 struct group *g; 973 gid_t gid; 974 975 gname = nextarg(option, argvp); 976 ftsoptions &= ~FTS_NOSTAT; 977 978 new = palloc(option); 979 g = getgrnam(gname); 980 if (g == NULL) { 981 char* cp = gname; 982 if (gname[0] == '-' || gname[0] == '+') 983 gname++; 984 gid = atoi(gname); 985 if (gid == 0 && gname[0] != '0') 986 errx(1, "%s: %s: no such group", option->name, gname); 987 gid = find_parsenum(new, option->name, cp, NULL); 988 } else 989 gid = g->gr_gid; 990 991 new->g_data = gid; 992 return new; 993 } 994 995 /* 996 * -inum n functions -- 997 * 998 * True if the file has inode # n. 999 */ 1000 int 1001 f_inum(PLAN *plan, FTSENT *entry) 1002 { 1003 COMPARE(entry->fts_statp->st_ino, plan->i_data); 1004 } 1005 1006 PLAN * 1007 c_inum(OPTION *option, char ***argvp) 1008 { 1009 char *inum_str; 1010 PLAN *new; 1011 1012 inum_str = nextarg(option, argvp); 1013 ftsoptions &= ~FTS_NOSTAT; 1014 1015 new = palloc(option); 1016 new->i_data = find_parsenum(new, option->name, inum_str, NULL); 1017 return new; 1018 } 1019 1020 /* 1021 * -samefile FN 1022 * 1023 * True if the file has the same inode (eg hard link) FN 1024 */ 1025 1026 /* f_samefile is just f_inum */ 1027 PLAN * 1028 c_samefile(OPTION *option, char ***argvp) 1029 { 1030 char *fn; 1031 PLAN *new; 1032 struct stat sb; 1033 1034 fn = nextarg(option, argvp); 1035 ftsoptions &= ~FTS_NOSTAT; 1036 1037 new = palloc(option); 1038 if (stat(fn, &sb)) 1039 err(1, "%s", fn); 1040 new->i_data = sb.st_ino; 1041 return new; 1042 } 1043 1044 /* 1045 * -links n functions -- 1046 * 1047 * True if the file has n links. 1048 */ 1049 int 1050 f_links(PLAN *plan, FTSENT *entry) 1051 { 1052 COMPARE(entry->fts_statp->st_nlink, plan->l_data); 1053 } 1054 1055 PLAN * 1056 c_links(OPTION *option, char ***argvp) 1057 { 1058 char *nlinks; 1059 PLAN *new; 1060 1061 nlinks = nextarg(option, argvp); 1062 ftsoptions &= ~FTS_NOSTAT; 1063 1064 new = palloc(option); 1065 new->l_data = (nlink_t)find_parsenum(new, option->name, nlinks, NULL); 1066 return new; 1067 } 1068 1069 /* 1070 * -ls functions -- 1071 * 1072 * Always true - prints the current entry to stdout in "ls" format. 1073 */ 1074 int 1075 f_ls(PLAN *plan __unused, FTSENT *entry) 1076 { 1077 printlong(entry->fts_path, entry->fts_accpath, entry->fts_statp); 1078 return 1; 1079 } 1080 1081 PLAN * 1082 c_ls(OPTION *option, char ***argvp __unused) 1083 { 1084 ftsoptions &= ~FTS_NOSTAT; 1085 isoutput = 1; 1086 1087 return palloc(option); 1088 } 1089 1090 /* 1091 * -name functions -- 1092 * 1093 * True if the basename of the filename being examined 1094 * matches pattern using Pattern Matching Notation S3.14 1095 */ 1096 int 1097 f_name(PLAN *plan, FTSENT *entry) 1098 { 1099 char fn[PATH_MAX]; 1100 const char *name; 1101 1102 if (plan->flags & F_LINK) { 1103 name = fn; 1104 if (readlink(entry->fts_path, fn, sizeof(fn)) == -1) 1105 return 0; 1106 } else 1107 name = entry->fts_name; 1108 return !fnmatch(plan->c_data, name, 1109 plan->flags & F_IGNCASE ? FNM_CASEFOLD : 0); 1110 } 1111 1112 PLAN * 1113 c_name(OPTION *option, char ***argvp) 1114 { 1115 char *pattern; 1116 PLAN *new; 1117 1118 pattern = nextarg(option, argvp); 1119 new = palloc(option); 1120 new->c_data = pattern; 1121 return new; 1122 } 1123 1124 /* 1125 * -newer file functions -- 1126 * 1127 * True if the current file has been modified more recently 1128 * then the modification time of the file named by the pathname 1129 * file. 1130 */ 1131 int 1132 f_newer(PLAN *plan, FTSENT *entry) 1133 { 1134 if (plan->flags & F_TIME_C) 1135 return entry->fts_statp->st_ctime > plan->t_data; 1136 else if (plan->flags & F_TIME_A) 1137 return entry->fts_statp->st_atime > plan->t_data; 1138 else if (plan->flags & F_TIME_B) 1139 return entry->fts_statp->st_birthtime > plan->t_data; 1140 else 1141 return entry->fts_statp->st_mtime > plan->t_data; 1142 } 1143 1144 PLAN * 1145 c_newer(OPTION *option, char ***argvp) 1146 { 1147 char *fn_or_tspec; 1148 PLAN *new; 1149 struct stat sb; 1150 1151 fn_or_tspec = nextarg(option, argvp); 1152 ftsoptions &= ~FTS_NOSTAT; 1153 1154 new = palloc(option); 1155 /* compare against what */ 1156 if (option->flags & F_TIME2_T) { 1157 new->t_data = get_date(fn_or_tspec); 1158 if (new->t_data == (time_t) -1) 1159 errx(1, "Can't parse date/time: %s", fn_or_tspec); 1160 } else { 1161 if (stat(fn_or_tspec, &sb)) 1162 err(1, "%s", fn_or_tspec); 1163 if (option->flags & F_TIME2_C) 1164 new->t_data = sb.st_ctime; 1165 else if (option->flags & F_TIME2_A) 1166 new->t_data = sb.st_atime; 1167 else if (option->flags & F_TIME2_B) 1168 new->t_data = sb.st_birthtime; 1169 else 1170 new->t_data = sb.st_mtime; 1171 } 1172 return new; 1173 } 1174 1175 /* 1176 * -nogroup functions -- 1177 * 1178 * True if file belongs to a user ID for which the equivalent 1179 * of the getgrnam() 9.2.1 [POSIX.1] function returns NULL. 1180 */ 1181 int 1182 f_nogroup(PLAN *plan __unused, FTSENT *entry) 1183 { 1184 return group_from_gid(entry->fts_statp->st_gid, 1) == NULL; 1185 } 1186 1187 PLAN * 1188 c_nogroup(OPTION *option, char ***argvp __unused) 1189 { 1190 ftsoptions &= ~FTS_NOSTAT; 1191 1192 return palloc(option); 1193 } 1194 1195 /* 1196 * -nouser functions -- 1197 * 1198 * True if file belongs to a user ID for which the equivalent 1199 * of the getpwuid() 9.2.2 [POSIX.1] function returns NULL. 1200 */ 1201 int 1202 f_nouser(PLAN *plan __unused, FTSENT *entry) 1203 { 1204 return user_from_uid(entry->fts_statp->st_uid, 1) == NULL; 1205 } 1206 1207 PLAN * 1208 c_nouser(OPTION *option, char ***argvp __unused) 1209 { 1210 ftsoptions &= ~FTS_NOSTAT; 1211 1212 return palloc(option); 1213 } 1214 1215 /* 1216 * -path functions -- 1217 * 1218 * True if the path of the filename being examined 1219 * matches pattern using Pattern Matching Notation S3.14 1220 */ 1221 int 1222 f_path(PLAN *plan, FTSENT *entry) 1223 { 1224 return !fnmatch(plan->c_data, entry->fts_path, 1225 plan->flags & F_IGNCASE ? FNM_CASEFOLD : 0); 1226 } 1227 1228 /* c_path is the same as c_name */ 1229 1230 /* 1231 * -perm functions -- 1232 * 1233 * The mode argument is used to represent file mode bits. If it starts 1234 * with a leading digit, it's treated as an octal mode, otherwise as a 1235 * symbolic mode. 1236 */ 1237 int 1238 f_perm(PLAN *plan, FTSENT *entry) 1239 { 1240 mode_t mode; 1241 1242 mode = entry->fts_statp->st_mode & 1243 (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO); 1244 if (plan->flags & F_ATLEAST) 1245 return (plan->m_data | mode) == mode; 1246 else if (plan->flags & F_ANY) 1247 return (mode & plan->m_data); 1248 else 1249 return mode == plan->m_data; 1250 /* NOTREACHED */ 1251 } 1252 1253 PLAN * 1254 c_perm(OPTION *option, char ***argvp) 1255 { 1256 char *perm; 1257 PLAN *new; 1258 mode_t *set; 1259 1260 perm = nextarg(option, argvp); 1261 ftsoptions &= ~FTS_NOSTAT; 1262 1263 new = palloc(option); 1264 1265 if (*perm == '-') { 1266 new->flags |= F_ATLEAST; 1267 ++perm; 1268 } else if (*perm == '+') { 1269 new->flags |= F_ANY; 1270 ++perm; 1271 } 1272 1273 if ((set = setmode(perm)) == NULL) 1274 errx(1, "%s: %s: illegal mode string", option->name, perm); 1275 1276 new->m_data = getmode(set, 0); 1277 free(set); 1278 return new; 1279 } 1280 1281 /* 1282 * -print functions -- 1283 * 1284 * Always true, causes the current pathname to be written to 1285 * standard output. 1286 */ 1287 int 1288 f_print(PLAN *plan __unused, FTSENT *entry) 1289 { 1290 (void)puts(entry->fts_path); 1291 return 1; 1292 } 1293 1294 PLAN * 1295 c_print(OPTION *option, char ***argvp __unused) 1296 { 1297 isoutput = 1; 1298 1299 return palloc(option); 1300 } 1301 1302 /* 1303 * -print0 functions -- 1304 * 1305 * Always true, causes the current pathname to be written to 1306 * standard output followed by a NUL character 1307 */ 1308 int 1309 f_print0(PLAN *plan __unused, FTSENT *entry) 1310 { 1311 fputs(entry->fts_path, stdout); 1312 fputc('\0', stdout); 1313 return 1; 1314 } 1315 1316 /* c_print0 is the same as c_print */ 1317 1318 /* 1319 * -prune functions -- 1320 * 1321 * Prune a portion of the hierarchy. 1322 */ 1323 int 1324 f_prune(PLAN *plan __unused, FTSENT *entry) 1325 { 1326 if (fts_set(tree, entry, FTS_SKIP)) 1327 err(1, "%s", entry->fts_path); 1328 return 1; 1329 } 1330 1331 /* c_prune == c_simple */ 1332 1333 /* 1334 * -regex functions -- 1335 * 1336 * True if the whole path of the file matches pattern using 1337 * regular expression. 1338 */ 1339 int 1340 f_regex(PLAN *plan, FTSENT *entry) 1341 { 1342 char *str; 1343 int len; 1344 regex_t *pre; 1345 regmatch_t pmatch; 1346 int errcode; 1347 char errbuf[LINE_MAX]; 1348 int matched; 1349 1350 pre = plan->re_data; 1351 str = entry->fts_path; 1352 len = strlen(str); 1353 matched = 0; 1354 1355 pmatch.rm_so = 0; 1356 pmatch.rm_eo = len; 1357 1358 errcode = regexec(pre, str, 1, &pmatch, REG_STARTEND); 1359 1360 if (errcode != 0 && errcode != REG_NOMATCH) { 1361 regerror(errcode, pre, errbuf, sizeof errbuf); 1362 errx(1, "%s: %s", 1363 plan->flags & F_IGNCASE ? "-iregex" : "-regex", errbuf); 1364 } 1365 1366 if (errcode == 0 && pmatch.rm_so == 0 && pmatch.rm_eo == len) 1367 matched = 1; 1368 1369 return matched; 1370 } 1371 1372 PLAN * 1373 c_regex(OPTION *option, char ***argvp) 1374 { 1375 PLAN *new; 1376 char *pattern; 1377 regex_t *pre; 1378 int errcode; 1379 char errbuf[LINE_MAX]; 1380 1381 if ((pre = malloc(sizeof(regex_t))) == NULL) 1382 err(1, NULL); 1383 1384 pattern = nextarg(option, argvp); 1385 1386 if ((errcode = regcomp(pre, pattern, 1387 regexp_flags | (option->flags & F_IGNCASE ? REG_ICASE : 0))) != 0) { 1388 regerror(errcode, pre, errbuf, sizeof errbuf); 1389 errx(1, "%s: %s: %s", 1390 option->flags & F_IGNCASE ? "-iregex" : "-regex", 1391 pattern, errbuf); 1392 } 1393 1394 new = palloc(option); 1395 new->re_data = pre; 1396 1397 return new; 1398 } 1399 1400 /* c_simple covers c_prune, c_openparen, c_closeparen, c_not, c_or, c_true, c_false */ 1401 1402 PLAN * 1403 c_simple(OPTION *option, char ***argvp __unused) 1404 { 1405 return palloc(option); 1406 } 1407 1408 /* 1409 * -size n[c] functions -- 1410 * 1411 * True if the file size in bytes, divided by an implementation defined 1412 * value and rounded up to the next integer, is n. If n is followed by 1413 * one of c k M G T P, the size is in bytes, kilobytes, 1414 * megabytes, gigabytes, terabytes or petabytes respectively. 1415 */ 1416 #define FIND_SIZE 512 1417 static int divsize = 1; 1418 1419 int 1420 f_size(PLAN *plan, FTSENT *entry) 1421 { 1422 off_t size; 1423 1424 size = divsize ? (entry->fts_statp->st_size + FIND_SIZE - 1) / 1425 FIND_SIZE : entry->fts_statp->st_size; 1426 COMPARE(size, plan->o_data); 1427 } 1428 1429 PLAN * 1430 c_size(OPTION *option, char ***argvp) 1431 { 1432 char *size_str; 1433 PLAN *new; 1434 char endch; 1435 off_t scale; 1436 1437 size_str = nextarg(option, argvp); 1438 ftsoptions &= ~FTS_NOSTAT; 1439 1440 new = palloc(option); 1441 endch = 'c'; 1442 new->o_data = find_parsenum(new, option->name, size_str, &endch); 1443 if (endch != '\0') { 1444 divsize = 0; 1445 1446 switch (endch) { 1447 case 'c': /* characters */ 1448 scale = 0x1LL; 1449 break; 1450 case 'k': /* kilobytes 1<<10 */ 1451 scale = 0x400LL; 1452 break; 1453 case 'M': /* megabytes 1<<20 */ 1454 scale = 0x100000LL; 1455 break; 1456 case 'G': /* gigabytes 1<<30 */ 1457 scale = 0x40000000LL; 1458 break; 1459 case 'T': /* terabytes 1<<40 */ 1460 scale = 0x1000000000LL; 1461 break; 1462 case 'P': /* petabytes 1<<50 */ 1463 scale = 0x4000000000000LL; 1464 break; 1465 default: 1466 errx(1, "%s: %s: illegal trailing character", 1467 option->name, size_str); 1468 break; 1469 } 1470 if (new->o_data > QUAD_MAX / scale) 1471 errx(1, "%s: %s: value too large", 1472 option->name, size_str); 1473 new->o_data *= scale; 1474 } 1475 return new; 1476 } 1477 1478 /* 1479 * -type c functions -- 1480 * 1481 * True if the type of the file is c, where c is b, c, d, p, f or w 1482 * for block special file, character special file, directory, FIFO, 1483 * regular file or whiteout respectively. 1484 */ 1485 int 1486 f_type(PLAN *plan, FTSENT *entry) 1487 { 1488 return (entry->fts_statp->st_mode & S_IFMT) == plan->m_data; 1489 } 1490 1491 PLAN * 1492 c_type(OPTION *option, char ***argvp) 1493 { 1494 char *typestring; 1495 PLAN *new; 1496 mode_t mask; 1497 1498 typestring = nextarg(option, argvp); 1499 ftsoptions &= ~FTS_NOSTAT; 1500 1501 switch (typestring[0]) { 1502 case 'b': 1503 mask = S_IFBLK; 1504 break; 1505 case 'c': 1506 mask = S_IFCHR; 1507 break; 1508 case 'd': 1509 mask = S_IFDIR; 1510 break; 1511 case 'f': 1512 mask = S_IFREG; 1513 break; 1514 case 'l': 1515 mask = S_IFLNK; 1516 break; 1517 case 'p': 1518 mask = S_IFIFO; 1519 break; 1520 case 's': 1521 mask = S_IFSOCK; 1522 break; 1523 #ifdef FTS_WHITEOUT 1524 case 'w': 1525 mask = S_IFWHT; 1526 ftsoptions |= FTS_WHITEOUT; 1527 break; 1528 #endif /* FTS_WHITEOUT */ 1529 default: 1530 errx(1, "%s: %s: unknown type", option->name, typestring); 1531 } 1532 1533 new = palloc(option); 1534 new->m_data = mask; 1535 return new; 1536 } 1537 1538 /* 1539 * -user uname functions -- 1540 * 1541 * True if the file belongs to the user uname. If uname is numeric and 1542 * an equivalent of the getpwnam() S9.2.2 [POSIX.1] function does not 1543 * return a valid user name, uname is taken as a user ID. 1544 */ 1545 int 1546 f_user(PLAN *plan, FTSENT *entry) 1547 { 1548 COMPARE(entry->fts_statp->st_uid, plan->u_data); 1549 } 1550 1551 PLAN * 1552 c_user(OPTION *option, char ***argvp) 1553 { 1554 char *username; 1555 PLAN *new; 1556 struct passwd *p; 1557 uid_t uid; 1558 1559 username = nextarg(option, argvp); 1560 ftsoptions &= ~FTS_NOSTAT; 1561 1562 new = palloc(option); 1563 p = getpwnam(username); 1564 if (p == NULL) { 1565 char* cp = username; 1566 if( username[0] == '-' || username[0] == '+' ) 1567 username++; 1568 uid = atoi(username); 1569 if (uid == 0 && username[0] != '0') 1570 errx(1, "%s: %s: no such user", option->name, username); 1571 uid = find_parsenum(new, option->name, cp, NULL); 1572 } else 1573 uid = p->pw_uid; 1574 1575 new->u_data = uid; 1576 return new; 1577 } 1578 1579 /* 1580 * -xdev functions -- 1581 * 1582 * Always true, causes find not to descend past directories that have a 1583 * different device ID (st_dev, see stat() S5.6.2 [POSIX.1]) 1584 */ 1585 PLAN * 1586 c_xdev(OPTION *option, char ***argvp __unused) 1587 { 1588 ftsoptions |= FTS_XDEV; 1589 1590 return palloc(option); 1591 } 1592 1593 /* 1594 * ( expression ) functions -- 1595 * 1596 * True if expression is true. 1597 */ 1598 int 1599 f_expr(PLAN *plan, FTSENT *entry) 1600 { 1601 PLAN *p; 1602 int state = 0; 1603 1604 for (p = plan->p_data[0]; 1605 p && (state = (p->execute)(p, entry)); p = p->next); 1606 return state; 1607 } 1608 1609 /* 1610 * f_openparen and f_closeparen nodes are temporary place markers. They are 1611 * eliminated during phase 2 of find_formplan() --- the '(' node is converted 1612 * to a f_expr node containing the expression and the ')' node is discarded. 1613 * The functions themselves are only used as constants. 1614 */ 1615 1616 int 1617 f_openparen(PLAN *plan __unused, FTSENT *entry __unused) 1618 { 1619 abort(); 1620 } 1621 1622 int 1623 f_closeparen(PLAN *plan __unused, FTSENT *entry __unused) 1624 { 1625 abort(); 1626 } 1627 1628 /* c_openparen == c_simple */ 1629 /* c_closeparen == c_simple */ 1630 1631 /* 1632 * AND operator. Since AND is implicit, no node is allocated. 1633 */ 1634 PLAN * 1635 c_and(OPTION *option __unused, char ***argvp __unused) 1636 { 1637 return NULL; 1638 } 1639 1640 /* 1641 * ! expression functions -- 1642 * 1643 * Negation of a primary; the unary NOT operator. 1644 */ 1645 int 1646 f_not(PLAN *plan, FTSENT *entry) 1647 { 1648 PLAN *p; 1649 int state = 0; 1650 1651 for (p = plan->p_data[0]; 1652 p && (state = (p->execute)(p, entry)); p = p->next); 1653 return !state; 1654 } 1655 1656 /* c_not == c_simple */ 1657 1658 /* 1659 * expression -o expression functions -- 1660 * 1661 * Alternation of primaries; the OR operator. The second expression is 1662 * not evaluated if the first expression is true. 1663 */ 1664 int 1665 f_or(PLAN *plan, FTSENT *entry) 1666 { 1667 PLAN *p; 1668 int state = 0; 1669 1670 for (p = plan->p_data[0]; 1671 p && (state = (p->execute)(p, entry)); p = p->next); 1672 1673 if (state) 1674 return 1; 1675 1676 for (p = plan->p_data[1]; 1677 p && (state = (p->execute)(p, entry)); p = p->next); 1678 return state; 1679 } 1680 1681 /* c_or == c_simple */ 1682 1683 /* 1684 * -false 1685 * 1686 * Always false. 1687 */ 1688 int 1689 f_false(PLAN *plan __unused, FTSENT *entry __unused) 1690 { 1691 return 0; 1692 } 1693 1694 /* c_false == c_simple */ 1695 1696 /* 1697 * -quit 1698 * 1699 * Exits the program 1700 */ 1701 int 1702 f_quit(PLAN *plan __unused, FTSENT *entry __unused) 1703 { 1704 exit(0); 1705 } 1706 1707 /* c_quit == c_simple */ 1708