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