function.c revision 1.66 1 1.66 jmcneill /* $NetBSD: function.c,v 1.66 2011/02/24 02:55:18 jmcneill Exp $ */
2 1.18 tls
3 1.1 cgd /*-
4 1.10 jtc * Copyright (c) 1990, 1993
5 1.10 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Cimarron D. Taylor of the University of California, Berkeley.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.46 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.21 lukem #include <sys/cdefs.h>
36 1.1 cgd #ifndef lint
37 1.21 lukem #if 0
38 1.22 mrg static char sccsid[] = "from: @(#)function.c 8.10 (Berkeley) 5/4/95";
39 1.21 lukem #else
40 1.66 jmcneill __RCSID("$NetBSD: function.c,v 1.66 2011/02/24 02:55:18 jmcneill Exp $");
41 1.21 lukem #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd #include <sys/param.h>
45 1.1 cgd #include <sys/stat.h>
46 1.1 cgd #include <sys/wait.h>
47 1.1 cgd #include <sys/mount.h>
48 1.10 jtc
49 1.41 provos #include <dirent.h>
50 1.10 jtc #include <err.h>
51 1.1 cgd #include <errno.h>
52 1.10 jtc #include <fnmatch.h>
53 1.10 jtc #include <fts.h>
54 1.1 cgd #include <grp.h>
55 1.30 kleink #include <inttypes.h>
56 1.56 apb #include <limits.h>
57 1.1 cgd #include <pwd.h>
58 1.64 daniel #include <stdbool.h>
59 1.1 cgd #include <stdio.h>
60 1.1 cgd #include <stdlib.h>
61 1.1 cgd #include <string.h>
62 1.10 jtc #include <tzfile.h>
63 1.10 jtc #include <unistd.h>
64 1.55 christos #include <util.h>
65 1.10 jtc
66 1.1 cgd #include "find.h"
67 1.1 cgd
68 1.10 jtc #define COMPARE(a, b) { \
69 1.10 jtc switch (plan->flags) { \
70 1.10 jtc case F_EQUAL: \
71 1.10 jtc return (a == b); \
72 1.10 jtc case F_LESSTHAN: \
73 1.10 jtc return (a < b); \
74 1.10 jtc case F_GREATER: \
75 1.10 jtc return (a > b); \
76 1.10 jtc default: \
77 1.10 jtc abort(); \
78 1.10 jtc } \
79 1.1 cgd }
80 1.1 cgd
81 1.57 apb static int64_t find_parsenum(PLAN *, const char *, const char *, char *);
82 1.57 apb static void run_f_exec(PLAN *);
83 1.57 apb int f_always_true(PLAN *, FTSENT *);
84 1.57 apb int f_amin(PLAN *, FTSENT *);
85 1.57 apb int f_anewer(PLAN *, FTSENT *);
86 1.57 apb int f_atime(PLAN *, FTSENT *);
87 1.57 apb int f_cmin(PLAN *, FTSENT *);
88 1.57 apb int f_cnewer(PLAN *, FTSENT *);
89 1.57 apb int f_ctime(PLAN *, FTSENT *);
90 1.62 elad int f_delete(PLAN *, FTSENT *);
91 1.57 apb int f_empty(PLAN *, FTSENT *);
92 1.57 apb int f_exec(PLAN *, FTSENT *);
93 1.57 apb int f_execdir(PLAN *, FTSENT *);
94 1.57 apb int f_false(PLAN *, FTSENT *);
95 1.57 apb int f_flags(PLAN *, FTSENT *);
96 1.57 apb int f_fprint(PLAN *, FTSENT *);
97 1.57 apb int f_fstype(PLAN *, FTSENT *);
98 1.57 apb int f_group(PLAN *, FTSENT *);
99 1.57 apb int f_iname(PLAN *, FTSENT *);
100 1.57 apb int f_inum(PLAN *, FTSENT *);
101 1.57 apb int f_links(PLAN *, FTSENT *);
102 1.57 apb int f_ls(PLAN *, FTSENT *);
103 1.57 apb int f_mindepth(PLAN *, FTSENT *);
104 1.57 apb int f_maxdepth(PLAN *, FTSENT *);
105 1.57 apb int f_mmin(PLAN *, FTSENT *);
106 1.57 apb int f_mtime(PLAN *, FTSENT *);
107 1.57 apb int f_name(PLAN *, FTSENT *);
108 1.57 apb int f_newer(PLAN *, FTSENT *);
109 1.57 apb int f_nogroup(PLAN *, FTSENT *);
110 1.57 apb int f_nouser(PLAN *, FTSENT *);
111 1.57 apb int f_path(PLAN *, FTSENT *);
112 1.57 apb int f_perm(PLAN *, FTSENT *);
113 1.57 apb int f_print(PLAN *, FTSENT *);
114 1.57 apb int f_print0(PLAN *, FTSENT *);
115 1.57 apb int f_printx(PLAN *, FTSENT *);
116 1.57 apb int f_prune(PLAN *, FTSENT *);
117 1.57 apb int f_regex(PLAN *, FTSENT *);
118 1.57 apb int f_size(PLAN *, FTSENT *);
119 1.57 apb int f_type(PLAN *, FTSENT *);
120 1.57 apb int f_user(PLAN *, FTSENT *);
121 1.57 apb int f_not(PLAN *, FTSENT *);
122 1.57 apb int f_or(PLAN *, FTSENT *);
123 1.64 daniel static PLAN *c_regex_common(char ***, int, enum ntype, bool);
124 1.57 apb static PLAN *palloc(enum ntype, int (*)(PLAN *, FTSENT *));
125 1.1 cgd
126 1.35 christos extern int dotfd;
127 1.35 christos extern FTS *tree;
128 1.35 christos extern time_t now;
129 1.35 christos
130 1.1 cgd /*
131 1.1 cgd * find_parsenum --
132 1.1 cgd * Parse a string of the form [+-]# and return the value.
133 1.1 cgd */
134 1.30 kleink static int64_t
135 1.57 apb find_parsenum(PLAN *plan, const char *option, const char *vp, char *endch)
136 1.1 cgd {
137 1.30 kleink int64_t value;
138 1.57 apb const char *str;
139 1.57 apb char *endchar; /* Pointer to character ending conversion. */
140 1.57 apb
141 1.10 jtc /* Determine comparison from leading + or -. */
142 1.10 jtc str = vp;
143 1.10 jtc switch (*str) {
144 1.1 cgd case '+':
145 1.1 cgd ++str;
146 1.10 jtc plan->flags = F_GREATER;
147 1.1 cgd break;
148 1.1 cgd case '-':
149 1.1 cgd ++str;
150 1.10 jtc plan->flags = F_LESSTHAN;
151 1.1 cgd break;
152 1.1 cgd default:
153 1.10 jtc plan->flags = F_EQUAL;
154 1.1 cgd break;
155 1.1 cgd }
156 1.57 apb
157 1.1 cgd /*
158 1.10 jtc * Convert the string with strtol(). Note, if strtol() returns zero
159 1.1 cgd * and endchar points to the beginning of the string we know we have
160 1.1 cgd * a syntax error.
161 1.1 cgd */
162 1.30 kleink value = strtoq(str, &endchar, 10);
163 1.10 jtc if (value == 0 && endchar == str)
164 1.10 jtc errx(1, "%s: %s: illegal numeric value", option, vp);
165 1.10 jtc if (endchar[0] && (endch == NULL || endchar[0] != *endch))
166 1.10 jtc errx(1, "%s: %s: illegal trailing character", option, vp);
167 1.1 cgd if (endch)
168 1.1 cgd *endch = endchar[0];
169 1.10 jtc return (value);
170 1.1 cgd }
171 1.1 cgd
172 1.1 cgd /*
173 1.10 jtc * The value of n for the inode times (atime, ctime, and mtime) is a range,
174 1.10 jtc * i.e. n matches from (n - 1) to n 24 hour periods. This interacts with
175 1.10 jtc * -n, such that "-mtime -1" would be less than 0 days, which isn't what the
176 1.10 jtc * user wanted. Correct so that -1 is "less than 1".
177 1.10 jtc */
178 1.10 jtc #define TIME_CORRECT(p, ttype) \
179 1.10 jtc if ((p)->type == ttype && (p)->flags == F_LESSTHAN) \
180 1.10 jtc ++((p)->t_data);
181 1.10 jtc
182 1.10 jtc /*
183 1.29 simonb * -amin n functions --
184 1.29 simonb *
185 1.29 simonb * True if the difference between the file access time and the
186 1.29 simonb * current time is n 1 minute periods.
187 1.29 simonb */
188 1.29 simonb int
189 1.57 apb f_amin(PLAN *plan, FTSENT *entry)
190 1.29 simonb {
191 1.29 simonb COMPARE((now - entry->fts_statp->st_atime +
192 1.29 simonb SECSPERMIN - 1) / SECSPERMIN, plan->t_data);
193 1.29 simonb }
194 1.57 apb
195 1.29 simonb PLAN *
196 1.57 apb c_amin(char ***argvp, int isok)
197 1.29 simonb {
198 1.29 simonb char *arg = **argvp;
199 1.29 simonb PLAN *new;
200 1.29 simonb
201 1.29 simonb (*argvp)++;
202 1.29 simonb ftsoptions &= ~FTS_NOSTAT;
203 1.29 simonb
204 1.29 simonb new = palloc(N_AMIN, f_amin);
205 1.29 simonb new->t_data = find_parsenum(new, "-amin", arg, NULL);
206 1.29 simonb TIME_CORRECT(new, N_AMIN);
207 1.29 simonb return (new);
208 1.29 simonb }
209 1.40 kleink
210 1.40 kleink /*
211 1.40 kleink * -anewer file functions --
212 1.40 kleink *
213 1.40 kleink * True if the current file has been accessed more recently
214 1.40 kleink * than the access time of the file named by the pathname
215 1.40 kleink * file.
216 1.40 kleink */
217 1.40 kleink int
218 1.40 kleink f_anewer(plan, entry)
219 1.40 kleink PLAN *plan;
220 1.40 kleink FTSENT *entry;
221 1.40 kleink {
222 1.40 kleink
223 1.40 kleink return (entry->fts_statp->st_atime > plan->t_data);
224 1.40 kleink }
225 1.57 apb
226 1.40 kleink PLAN *
227 1.57 apb c_anewer(char ***argvp, int isok)
228 1.40 kleink {
229 1.40 kleink char *filename = **argvp;
230 1.40 kleink PLAN *new;
231 1.40 kleink struct stat sb;
232 1.57 apb
233 1.40 kleink (*argvp)++;
234 1.40 kleink ftsoptions &= ~FTS_NOSTAT;
235 1.40 kleink
236 1.40 kleink if (stat(filename, &sb))
237 1.40 kleink err(1, "%s", filename);
238 1.40 kleink new = palloc(N_ANEWER, f_anewer);
239 1.40 kleink new->t_data = sb.st_atime;
240 1.40 kleink return (new);
241 1.40 kleink }
242 1.57 apb
243 1.29 simonb /*
244 1.1 cgd * -atime n functions --
245 1.1 cgd *
246 1.1 cgd * True if the difference between the file access time and the
247 1.1 cgd * current time is n 24 hour periods.
248 1.1 cgd */
249 1.10 jtc int
250 1.57 apb f_atime(PLAN *plan, FTSENT *entry)
251 1.1 cgd {
252 1.7 deraadt COMPARE((now - entry->fts_statp->st_atime +
253 1.1 cgd SECSPERDAY - 1) / SECSPERDAY, plan->t_data);
254 1.1 cgd }
255 1.57 apb
256 1.1 cgd PLAN *
257 1.57 apb c_atime(char ***argvp, int isok)
258 1.1 cgd {
259 1.24 christos char *arg = **argvp;
260 1.1 cgd PLAN *new;
261 1.1 cgd
262 1.24 christos (*argvp)++;
263 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
264 1.1 cgd
265 1.1 cgd new = palloc(N_ATIME, f_atime);
266 1.1 cgd new->t_data = find_parsenum(new, "-atime", arg, NULL);
267 1.10 jtc TIME_CORRECT(new, N_ATIME);
268 1.10 jtc return (new);
269 1.1 cgd }
270 1.1 cgd /*
271 1.29 simonb * -cmin n functions --
272 1.29 simonb *
273 1.29 simonb * True if the difference between the last change of file
274 1.29 simonb * status information and the current time is n 24 hour periods.
275 1.29 simonb */
276 1.29 simonb int
277 1.57 apb f_cmin(PLAN *plan, FTSENT *entry)
278 1.29 simonb {
279 1.29 simonb COMPARE((now - entry->fts_statp->st_ctime +
280 1.29 simonb SECSPERMIN - 1) / SECSPERMIN, plan->t_data);
281 1.29 simonb }
282 1.57 apb
283 1.29 simonb PLAN *
284 1.57 apb c_cmin(char ***argvp, int isok)
285 1.29 simonb {
286 1.29 simonb char *arg = **argvp;
287 1.29 simonb PLAN *new;
288 1.29 simonb
289 1.29 simonb (*argvp)++;
290 1.29 simonb ftsoptions &= ~FTS_NOSTAT;
291 1.29 simonb
292 1.29 simonb new = palloc(N_CMIN, f_cmin);
293 1.29 simonb new->t_data = find_parsenum(new, "-cmin", arg, NULL);
294 1.29 simonb TIME_CORRECT(new, N_CMIN);
295 1.29 simonb return (new);
296 1.29 simonb }
297 1.39 kleink
298 1.39 kleink /*
299 1.39 kleink * -cnewer file functions --
300 1.39 kleink *
301 1.39 kleink * True if the current file has been changed more recently
302 1.40 kleink * than the changed time of the file named by the pathname
303 1.39 kleink * file.
304 1.39 kleink */
305 1.39 kleink int
306 1.57 apb f_cnewer(PLAN *plan, FTSENT *entry)
307 1.39 kleink {
308 1.39 kleink
309 1.39 kleink return (entry->fts_statp->st_ctime > plan->t_data);
310 1.39 kleink }
311 1.57 apb
312 1.39 kleink PLAN *
313 1.57 apb c_cnewer(char ***argvp, int isok)
314 1.39 kleink {
315 1.39 kleink char *filename = **argvp;
316 1.39 kleink PLAN *new;
317 1.39 kleink struct stat sb;
318 1.57 apb
319 1.39 kleink (*argvp)++;
320 1.39 kleink ftsoptions &= ~FTS_NOSTAT;
321 1.39 kleink
322 1.39 kleink if (stat(filename, &sb))
323 1.39 kleink err(1, "%s", filename);
324 1.39 kleink new = palloc(N_CNEWER, f_cnewer);
325 1.39 kleink new->t_data = sb.st_ctime;
326 1.39 kleink return (new);
327 1.39 kleink }
328 1.57 apb
329 1.29 simonb /*
330 1.1 cgd * -ctime n functions --
331 1.1 cgd *
332 1.1 cgd * True if the difference between the last change of file
333 1.1 cgd * status information and the current time is n 24 hour periods.
334 1.1 cgd */
335 1.10 jtc int
336 1.57 apb f_ctime(PLAN *plan, FTSENT *entry)
337 1.1 cgd {
338 1.7 deraadt COMPARE((now - entry->fts_statp->st_ctime +
339 1.1 cgd SECSPERDAY - 1) / SECSPERDAY, plan->t_data);
340 1.1 cgd }
341 1.57 apb
342 1.1 cgd PLAN *
343 1.57 apb c_ctime(char ***argvp, int isok)
344 1.1 cgd {
345 1.24 christos char *arg = **argvp;
346 1.1 cgd PLAN *new;
347 1.1 cgd
348 1.24 christos (*argvp)++;
349 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
350 1.1 cgd
351 1.1 cgd new = palloc(N_CTIME, f_ctime);
352 1.10 jtc new->t_data = find_parsenum(new, "-ctime", arg, NULL);
353 1.10 jtc TIME_CORRECT(new, N_CTIME);
354 1.10 jtc return (new);
355 1.1 cgd }
356 1.1 cgd
357 1.1 cgd /*
358 1.62 elad * -delete functions --
359 1.62 elad *
360 1.62 elad * True always. Makes its best shot and continues on regardless.
361 1.62 elad */
362 1.62 elad int
363 1.62 elad f_delete(PLAN *plan __unused, FTSENT *entry)
364 1.62 elad {
365 1.62 elad /* ignore these from fts */
366 1.62 elad if (strcmp(entry->fts_accpath, ".") == 0 ||
367 1.62 elad strcmp(entry->fts_accpath, "..") == 0)
368 1.62 elad return 1;
369 1.62 elad
370 1.62 elad /* sanity check */
371 1.62 elad if (isdepth == 0 || /* depth off */
372 1.62 elad (ftsoptions & FTS_NOSTAT) || /* not stat()ing */
373 1.62 elad !(ftsoptions & FTS_PHYSICAL) || /* physical off */
374 1.62 elad (ftsoptions & FTS_LOGICAL)) /* or finally, logical on */
375 1.62 elad errx(1, "-delete: insecure options got turned on");
376 1.62 elad
377 1.62 elad /* Potentially unsafe - do not accept relative paths whatsoever */
378 1.62 elad if (strchr(entry->fts_accpath, '/') != NULL)
379 1.62 elad errx(1, "-delete: %s: relative path potentially not safe",
380 1.62 elad entry->fts_accpath);
381 1.62 elad
382 1.62 elad /* Turn off user immutable bits if running as root */
383 1.62 elad if ((entry->fts_statp->st_flags & (UF_APPEND|UF_IMMUTABLE)) &&
384 1.62 elad !(entry->fts_statp->st_flags & (SF_APPEND|SF_IMMUTABLE)) &&
385 1.62 elad geteuid() == 0)
386 1.62 elad chflags(entry->fts_accpath,
387 1.62 elad entry->fts_statp->st_flags &= ~(UF_APPEND|UF_IMMUTABLE));
388 1.62 elad
389 1.62 elad /* rmdir directories, unlink everything else */
390 1.62 elad if (S_ISDIR(entry->fts_statp->st_mode)) {
391 1.62 elad if (rmdir(entry->fts_accpath) < 0 && errno != ENOTEMPTY)
392 1.62 elad warn("-delete: rmdir(%s)", entry->fts_path);
393 1.62 elad } else {
394 1.62 elad if (unlink(entry->fts_accpath) < 0)
395 1.62 elad warn("-delete: unlink(%s)", entry->fts_path);
396 1.62 elad }
397 1.62 elad
398 1.62 elad /* "succeed" */
399 1.62 elad return 1;
400 1.62 elad }
401 1.62 elad
402 1.62 elad PLAN *
403 1.62 elad c_delete(char ***argvp __unused, int isok)
404 1.62 elad {
405 1.62 elad
406 1.62 elad ftsoptions &= ~FTS_NOSTAT; /* no optimize */
407 1.62 elad ftsoptions |= FTS_PHYSICAL; /* disable -follow */
408 1.62 elad ftsoptions &= ~FTS_LOGICAL; /* disable -follow */
409 1.62 elad isoutput = 1; /* possible output */
410 1.62 elad isdepth = 1; /* -depth implied */
411 1.62 elad
412 1.62 elad return palloc(N_DELETE, f_delete);
413 1.62 elad }
414 1.62 elad
415 1.62 elad /*
416 1.1 cgd * -depth functions --
417 1.1 cgd *
418 1.1 cgd * Always true, causes descent of the directory hierarchy to be done
419 1.1 cgd * so that all entries in a directory are acted on before the directory
420 1.1 cgd * itself.
421 1.1 cgd */
422 1.10 jtc int
423 1.57 apb f_always_true(PLAN *plan, FTSENT *entry)
424 1.1 cgd {
425 1.33 enami
426 1.10 jtc return (1);
427 1.1 cgd }
428 1.57 apb
429 1.1 cgd PLAN *
430 1.57 apb c_depth(char ***argvp, int isok)
431 1.1 cgd {
432 1.1 cgd isdepth = 1;
433 1.1 cgd
434 1.10 jtc return (palloc(N_DEPTH, f_always_true));
435 1.1 cgd }
436 1.57 apb
437 1.1 cgd /*
438 1.41 provos * -empty functions --
439 1.41 provos *
440 1.41 provos * True if the file or directory is empty
441 1.41 provos */
442 1.41 provos int
443 1.57 apb f_empty(PLAN *plan, FTSENT *entry)
444 1.41 provos {
445 1.41 provos if (S_ISREG(entry->fts_statp->st_mode) &&
446 1.41 provos entry->fts_statp->st_size == 0)
447 1.41 provos return (1);
448 1.41 provos if (S_ISDIR(entry->fts_statp->st_mode)) {
449 1.41 provos struct dirent *dp;
450 1.41 provos int empty;
451 1.41 provos DIR *dir;
452 1.41 provos
453 1.41 provos empty = 1;
454 1.41 provos dir = opendir(entry->fts_accpath);
455 1.41 provos if (dir == NULL)
456 1.66 jmcneill return (0);
457 1.41 provos for (dp = readdir(dir); dp; dp = readdir(dir))
458 1.41 provos if (dp->d_name[0] != '.' ||
459 1.41 provos (dp->d_name[1] != '\0' &&
460 1.41 provos (dp->d_name[1] != '.' || dp->d_name[2] != '\0'))) {
461 1.41 provos empty = 0;
462 1.41 provos break;
463 1.41 provos }
464 1.41 provos closedir(dir);
465 1.41 provos return (empty);
466 1.41 provos }
467 1.41 provos return (0);
468 1.41 provos }
469 1.41 provos
470 1.41 provos PLAN *
471 1.57 apb c_empty(char ***argvp, int isok)
472 1.41 provos {
473 1.41 provos ftsoptions &= ~FTS_NOSTAT;
474 1.41 provos
475 1.41 provos return (palloc(N_EMPTY, f_empty));
476 1.41 provos }
477 1.41 provos
478 1.41 provos /*
479 1.1 cgd * [-exec | -ok] utility [arg ... ] ; functions --
480 1.56 apb * [-exec | -ok] utility [arg ... ] {} + functions --
481 1.1 cgd *
482 1.56 apb * If the end of the primary expression is delimited by a
483 1.56 apb * semicolon: true if the executed utility returns a zero value
484 1.56 apb * as exit status. If "{}" occurs anywhere, it gets replaced by
485 1.56 apb * the current pathname.
486 1.56 apb *
487 1.56 apb * If the end of the primary expression is delimited by a plus
488 1.56 apb * sign: always true. Pathnames for which the primary is
489 1.56 apb * evaluated shall be aggregated into sets. The utility will be
490 1.56 apb * executed once per set, with "{}" replaced by the entire set of
491 1.56 apb * pathnames (as if xargs). "{}" must appear last.
492 1.56 apb *
493 1.56 apb * The current directory for the execution of utility is the same
494 1.56 apb * as the current directory when the find utility was started.
495 1.1 cgd *
496 1.56 apb * The primary -ok is different in that it requests affirmation
497 1.56 apb * of the user before executing the utility.
498 1.1 cgd */
499 1.10 jtc int
500 1.57 apb f_exec(PLAN *plan, FTSENT *entry)
501 1.1 cgd {
502 1.56 apb int cnt, l;
503 1.1 cgd pid_t pid;
504 1.1 cgd int status;
505 1.1 cgd
506 1.56 apb if (plan->flags & F_PLUSSET) {
507 1.56 apb /*
508 1.56 apb * Confirm sufficient buffer space, then copy the path
509 1.56 apb * to the buffer.
510 1.56 apb */
511 1.56 apb l = strlen(entry->fts_path);
512 1.56 apb if (plan->ep_p + l < plan->ep_ebp) {
513 1.56 apb plan->ep_bxp[plan->ep_narg++] =
514 1.56 apb strcpy(plan->ep_p, entry->fts_path);
515 1.56 apb plan->ep_p += l + 1;
516 1.56 apb
517 1.56 apb if (plan->ep_narg == plan->ep_maxargs)
518 1.56 apb run_f_exec(plan);
519 1.56 apb } else {
520 1.56 apb /*
521 1.56 apb * Without sufficient space to copy in the next
522 1.56 apb * argument, run the command to empty out the
523 1.56 apb * buffer before re-attepting the copy.
524 1.56 apb */
525 1.56 apb run_f_exec(plan);
526 1.56 apb if ((plan->ep_p + l < plan->ep_ebp)) {
527 1.56 apb plan->ep_bxp[plan->ep_narg++]
528 1.56 apb = strcpy(plan->ep_p, entry->fts_path);
529 1.56 apb plan->ep_p += l + 1;
530 1.56 apb } else
531 1.56 apb errx(1, "insufficient space for argument");
532 1.56 apb }
533 1.56 apb return (1);
534 1.56 apb } else {
535 1.56 apb for (cnt = 0; plan->e_argv[cnt]; ++cnt)
536 1.56 apb if (plan->e_len[cnt])
537 1.56 apb brace_subst(plan->e_orig[cnt],
538 1.56 apb &plan->e_argv[cnt],
539 1.56 apb entry->fts_path,
540 1.56 apb &plan->e_len[cnt]);
541 1.56 apb if (plan->flags & F_NEEDOK && !queryuser(plan->e_argv))
542 1.56 apb return (0);
543 1.56 apb
544 1.56 apb /* Don't mix output of command with find output. */
545 1.56 apb fflush(stdout);
546 1.56 apb fflush(stderr);
547 1.56 apb
548 1.56 apb switch (pid = vfork()) {
549 1.56 apb case -1:
550 1.56 apb err(1, "vfork");
551 1.56 apb /* NOTREACHED */
552 1.56 apb case 0:
553 1.56 apb if (fchdir(dotfd)) {
554 1.56 apb warn("chdir");
555 1.56 apb _exit(1);
556 1.56 apb }
557 1.56 apb execvp(plan->e_argv[0], plan->e_argv);
558 1.56 apb warn("%s", plan->e_argv[0]);
559 1.56 apb _exit(1);
560 1.56 apb }
561 1.56 apb pid = waitpid(pid, &status, 0);
562 1.56 apb return (pid != -1 && WIFEXITED(status)
563 1.56 apb && !WEXITSTATUS(status));
564 1.56 apb }
565 1.56 apb }
566 1.56 apb
567 1.56 apb static void
568 1.57 apb run_f_exec(PLAN *plan)
569 1.56 apb {
570 1.56 apb pid_t pid;
571 1.56 apb int rval, status;
572 1.1 cgd
573 1.56 apb /* Ensure arg list is null terminated. */
574 1.56 apb plan->ep_bxp[plan->ep_narg] = NULL;
575 1.11 jtc
576 1.56 apb /* Don't mix output of command with find output. */
577 1.11 jtc fflush(stdout);
578 1.11 jtc fflush(stderr);
579 1.1 cgd
580 1.37 simonb switch (pid = vfork()) {
581 1.1 cgd case -1:
582 1.37 simonb err(1, "vfork");
583 1.1 cgd /* NOTREACHED */
584 1.1 cgd case 0:
585 1.1 cgd if (fchdir(dotfd)) {
586 1.10 jtc warn("chdir");
587 1.1 cgd _exit(1);
588 1.1 cgd }
589 1.1 cgd execvp(plan->e_argv[0], plan->e_argv);
590 1.10 jtc warn("%s", plan->e_argv[0]);
591 1.1 cgd _exit(1);
592 1.1 cgd }
593 1.56 apb
594 1.56 apb /* Clear out the argument list. */
595 1.56 apb plan->ep_narg = 0;
596 1.56 apb plan->ep_bxp[plan->ep_narg] = NULL;
597 1.56 apb /* As well as the argument buffer. */
598 1.56 apb plan->ep_p = plan->ep_bbp;
599 1.56 apb *plan->ep_p = '\0';
600 1.56 apb
601 1.1 cgd pid = waitpid(pid, &status, 0);
602 1.56 apb if (WIFEXITED(status))
603 1.56 apb rval = WEXITSTATUS(status);
604 1.56 apb else
605 1.56 apb rval = -1;
606 1.56 apb
607 1.56 apb /*
608 1.56 apb * If we have a non-zero exit status, preserve it so find(1) can
609 1.56 apb * later exit with it.
610 1.56 apb */
611 1.56 apb if (rval)
612 1.56 apb plan->ep_rval = rval;
613 1.1 cgd }
614 1.56 apb
615 1.1 cgd /*
616 1.1 cgd * c_exec --
617 1.1 cgd * build three parallel arrays, one with pointers to the strings passed
618 1.1 cgd * on the command line, one with (possibly duplicated) pointers to the
619 1.1 cgd * argv array, and one with integer values that are lengths of the
620 1.1 cgd * strings, but also flags meaning that the string has to be massaged.
621 1.56 apb *
622 1.56 apb * If -exec ... {} +, use only the first array, but make it large
623 1.56 apb * enough to hold 5000 args (cf. src/usr.bin/xargs/xargs.c for a
624 1.56 apb * discussion), and then allocate ARG_MAX - 4K of space for args.
625 1.1 cgd */
626 1.1 cgd PLAN *
627 1.57 apb c_exec(char ***argvp, int isok)
628 1.1 cgd {
629 1.1 cgd PLAN *new; /* node returned */
630 1.56 apb int cnt, brace, lastbrace;
631 1.21 lukem char **argv, **ap, *p;
632 1.1 cgd
633 1.1 cgd isoutput = 1;
634 1.57 apb
635 1.1 cgd new = palloc(N_EXEC, f_exec);
636 1.10 jtc if (isok)
637 1.56 apb new->flags |= F_NEEDOK;
638 1.1 cgd
639 1.56 apb /*
640 1.56 apb * Terminate if we encounter an arg exacty equal to ";", or an
641 1.56 apb * arg exacty equal to "+" following an arg exacty equal to
642 1.56 apb * "{}".
643 1.56 apb */
644 1.56 apb for (ap = argv = *argvp, brace = 0;; ++ap) {
645 1.1 cgd if (!*ap)
646 1.56 apb errx(1, "%s: no terminating \";\" or \"+\"",
647 1.56 apb isok ? "-ok" : "-exec");
648 1.56 apb lastbrace = brace;
649 1.65 dholland brace = 0;
650 1.56 apb if (strcmp(*ap, "{}") == 0)
651 1.56 apb brace = 1;
652 1.56 apb if (strcmp(*ap, ";") == 0)
653 1.56 apb break;
654 1.56 apb if (strcmp(*ap, "+") == 0 && lastbrace) {
655 1.56 apb new->flags |= F_PLUSSET;
656 1.1 cgd break;
657 1.56 apb }
658 1.1 cgd }
659 1.1 cgd
660 1.56 apb /*
661 1.56 apb * POSIX says -ok ... {} + "need not be supported," and it does
662 1.56 apb * not make much sense anyway.
663 1.56 apb */
664 1.56 apb if (new->flags & F_NEEDOK && new->flags & F_PLUSSET)
665 1.56 apb errx(1, "-ok: terminating \"+\" not permitted.");
666 1.56 apb
667 1.56 apb if (new->flags & F_PLUSSET) {
668 1.56 apb u_int c, bufsize;
669 1.56 apb
670 1.56 apb cnt = ap - *argvp - 1; /* units are words */
671 1.56 apb new->ep_maxargs = 5000;
672 1.56 apb new->e_argv = (char **)emalloc((u_int)(cnt + new->ep_maxargs)
673 1.56 apb * sizeof(char **));
674 1.56 apb
675 1.56 apb /* We start stuffing arguments after the user's last one. */
676 1.56 apb new->ep_bxp = &new->e_argv[cnt];
677 1.56 apb new->ep_narg = 0;
678 1.56 apb
679 1.56 apb /*
680 1.56 apb * Count up the space of the user's arguments, and
681 1.56 apb * subtract that from what we allocate.
682 1.56 apb */
683 1.56 apb for (argv = *argvp, c = 0, cnt = 0;
684 1.56 apb argv < ap;
685 1.56 apb ++argv, ++cnt) {
686 1.56 apb c += strlen(*argv) + 1;
687 1.56 apb new->e_argv[cnt] = *argv;
688 1.56 apb }
689 1.56 apb bufsize = ARG_MAX - 4 * 1024 - c;
690 1.56 apb
691 1.1 cgd
692 1.56 apb /*
693 1.56 apb * Allocate, and then initialize current, base, and
694 1.56 apb * end pointers.
695 1.56 apb */
696 1.56 apb new->ep_p = new->ep_bbp = malloc(bufsize + 1);
697 1.56 apb new->ep_ebp = new->ep_bbp + bufsize - 1;
698 1.56 apb new->ep_rval = 0;
699 1.56 apb } else { /* !F_PLUSSET */
700 1.56 apb cnt = ap - *argvp + 1;
701 1.56 apb new->e_argv = (char **)emalloc((u_int)cnt * sizeof(char *));
702 1.56 apb new->e_orig = (char **)emalloc((u_int)cnt * sizeof(char *));
703 1.56 apb new->e_len = (int *)emalloc((u_int)cnt * sizeof(int));
704 1.56 apb
705 1.56 apb for (argv = *argvp, cnt = 0; argv < ap; ++argv, ++cnt) {
706 1.56 apb new->e_orig[cnt] = *argv;
707 1.56 apb for (p = *argv; *p; ++p)
708 1.56 apb if (p[0] == '{' && p[1] == '}') {
709 1.56 apb new->e_argv[cnt] =
710 1.56 apb emalloc((u_int)MAXPATHLEN);
711 1.56 apb new->e_len[cnt] = MAXPATHLEN;
712 1.56 apb break;
713 1.56 apb }
714 1.56 apb if (!*p) {
715 1.56 apb new->e_argv[cnt] = *argv;
716 1.56 apb new->e_len[cnt] = 0;
717 1.1 cgd }
718 1.1 cgd }
719 1.56 apb new->e_orig[cnt] = NULL;
720 1.1 cgd }
721 1.1 cgd
722 1.56 apb new->e_argv[cnt] = NULL;
723 1.1 cgd *argvp = argv + 1;
724 1.10 jtc return (new);
725 1.1 cgd }
726 1.41 provos
727 1.41 provos /*
728 1.41 provos * -execdir utility [arg ... ] ; functions --
729 1.41 provos *
730 1.41 provos * True if the executed utility returns a zero value as exit status.
731 1.41 provos * The end of the primary expression is delimited by a semicolon. If
732 1.41 provos * "{}" occurs anywhere, it gets replaced by the unqualified pathname.
733 1.41 provos * The current directory for the execution of utility is the same as
734 1.41 provos * the directory where the file lives.
735 1.41 provos */
736 1.41 provos int
737 1.57 apb f_execdir(PLAN *plan, FTSENT *entry)
738 1.41 provos {
739 1.41 provos int cnt;
740 1.41 provos pid_t pid;
741 1.41 provos int status;
742 1.41 provos char *file;
743 1.41 provos
744 1.41 provos /* XXX - if file/dir ends in '/' this will not work -- can it? */
745 1.41 provos if ((file = strrchr(entry->fts_path, '/')))
746 1.41 provos file++;
747 1.41 provos else
748 1.41 provos file = entry->fts_path;
749 1.41 provos
750 1.41 provos for (cnt = 0; plan->e_argv[cnt]; ++cnt)
751 1.41 provos if (plan->e_len[cnt])
752 1.41 provos brace_subst(plan->e_orig[cnt], &plan->e_argv[cnt],
753 1.41 provos file, &plan->e_len[cnt]);
754 1.41 provos
755 1.41 provos /* don't mix output of command with find output */
756 1.41 provos fflush(stdout);
757 1.41 provos fflush(stderr);
758 1.41 provos
759 1.41 provos switch (pid = vfork()) {
760 1.41 provos case -1:
761 1.41 provos err(1, "fork");
762 1.41 provos /* NOTREACHED */
763 1.41 provos case 0:
764 1.41 provos execvp(plan->e_argv[0], plan->e_argv);
765 1.41 provos warn("%s", plan->e_argv[0]);
766 1.41 provos _exit(1);
767 1.41 provos }
768 1.41 provos pid = waitpid(pid, &status, 0);
769 1.41 provos return (pid != -1 && WIFEXITED(status) && !WEXITSTATUS(status));
770 1.41 provos }
771 1.57 apb
772 1.41 provos /*
773 1.41 provos * c_execdir --
774 1.41 provos * build three parallel arrays, one with pointers to the strings passed
775 1.41 provos * on the command line, one with (possibly duplicated) pointers to the
776 1.41 provos * argv array, and one with integer values that are lengths of the
777 1.41 provos * strings, but also flags meaning that the string has to be massaged.
778 1.41 provos */
779 1.41 provos PLAN *
780 1.57 apb c_execdir(char ***argvp, int isok)
781 1.41 provos {
782 1.41 provos PLAN *new; /* node returned */
783 1.41 provos int cnt;
784 1.41 provos char **argv, **ap, *p;
785 1.41 provos
786 1.41 provos ftsoptions &= ~FTS_NOSTAT;
787 1.41 provos isoutput = 1;
788 1.57 apb
789 1.41 provos new = palloc(N_EXECDIR, f_execdir);
790 1.41 provos
791 1.41 provos for (ap = argv = *argvp;; ++ap) {
792 1.41 provos if (!*ap)
793 1.41 provos errx(1,
794 1.41 provos "-execdir: no terminating \";\"");
795 1.41 provos if (**ap == ';')
796 1.41 provos break;
797 1.41 provos }
798 1.41 provos
799 1.41 provos cnt = ap - *argvp + 1;
800 1.41 provos new->e_argv = (char **)emalloc((u_int)cnt * sizeof(char *));
801 1.41 provos new->e_orig = (char **)emalloc((u_int)cnt * sizeof(char *));
802 1.41 provos new->e_len = (int *)emalloc((u_int)cnt * sizeof(int));
803 1.41 provos
804 1.41 provos for (argv = *argvp, cnt = 0; argv < ap; ++argv, ++cnt) {
805 1.41 provos new->e_orig[cnt] = *argv;
806 1.41 provos for (p = *argv; *p; ++p)
807 1.41 provos if (p[0] == '{' && p[1] == '}') {
808 1.41 provos new->e_argv[cnt] = emalloc((u_int)MAXPATHLEN);
809 1.41 provos new->e_len[cnt] = MAXPATHLEN;
810 1.41 provos break;
811 1.41 provos }
812 1.41 provos if (!*p) {
813 1.41 provos new->e_argv[cnt] = *argv;
814 1.41 provos new->e_len[cnt] = 0;
815 1.41 provos }
816 1.41 provos }
817 1.41 provos new->e_argv[cnt] = new->e_orig[cnt] = NULL;
818 1.41 provos
819 1.41 provos *argvp = argv + 1;
820 1.41 provos return (new);
821 1.41 provos }
822 1.52 reed
823 1.53 jschauma PLAN *
824 1.57 apb c_exit(char ***argvp, int isok)
825 1.53 jschauma {
826 1.53 jschauma char *arg = **argvp;
827 1.53 jschauma PLAN *new;
828 1.53 jschauma
829 1.53 jschauma /* not technically true, but otherwise '-print' is implied */
830 1.53 jschauma isoutput = 1;
831 1.53 jschauma
832 1.53 jschauma new = palloc(N_EXIT, f_always_true);
833 1.53 jschauma
834 1.53 jschauma if (arg) {
835 1.53 jschauma (*argvp)++;
836 1.53 jschauma new->exit_val = find_parsenum(new, "-exit", arg, NULL);
837 1.53 jschauma } else
838 1.53 jschauma new->exit_val = 0;
839 1.53 jschauma
840 1.53 jschauma return (new);
841 1.53 jschauma }
842 1.53 jschauma
843 1.53 jschauma
844 1.52 reed /*
845 1.52 reed * -false function
846 1.52 reed */
847 1.52 reed int
848 1.57 apb f_false(PLAN *plan, FTSENT *entry)
849 1.52 reed {
850 1.52 reed
851 1.52 reed return (0);
852 1.52 reed }
853 1.57 apb
854 1.52 reed PLAN *
855 1.57 apb c_false(char ***argvp, int isok)
856 1.52 reed {
857 1.52 reed return (palloc(N_FALSE, f_false));
858 1.52 reed }
859 1.52 reed
860 1.57 apb
861 1.27 lukem /*
862 1.27 lukem * -flags [-]flags functions --
863 1.27 lukem */
864 1.27 lukem int
865 1.57 apb f_flags(PLAN *plan, FTSENT *entry)
866 1.27 lukem {
867 1.27 lukem u_int32_t flags;
868 1.27 lukem
869 1.27 lukem flags = entry->fts_statp->st_flags;
870 1.27 lukem if (plan->flags == F_ATLEAST)
871 1.27 lukem return ((plan->f_data | flags) == flags);
872 1.27 lukem else
873 1.27 lukem return (flags == plan->f_data);
874 1.27 lukem /* NOTREACHED */
875 1.27 lukem }
876 1.57 apb
877 1.27 lukem PLAN *
878 1.57 apb c_flags(char ***argvp, int isok)
879 1.27 lukem {
880 1.27 lukem char *flags = **argvp;
881 1.27 lukem PLAN *new;
882 1.27 lukem u_long flagset;
883 1.27 lukem
884 1.27 lukem (*argvp)++;
885 1.27 lukem ftsoptions &= ~FTS_NOSTAT;
886 1.27 lukem
887 1.27 lukem new = palloc(N_FLAGS, f_flags);
888 1.27 lukem
889 1.27 lukem if (*flags == '-') {
890 1.27 lukem new->flags = F_ATLEAST;
891 1.27 lukem ++flags;
892 1.27 lukem }
893 1.27 lukem
894 1.27 lukem flagset = 0;
895 1.27 lukem if ((strcmp(flags, "none") != 0) &&
896 1.27 lukem (string_to_flags(&flags, &flagset, NULL) != 0))
897 1.27 lukem errx(1, "-flags: %s: illegal flags string", flags);
898 1.27 lukem new->f_data = flagset;
899 1.27 lukem return (new);
900 1.27 lukem }
901 1.57 apb
902 1.1 cgd /*
903 1.1 cgd * -follow functions --
904 1.1 cgd *
905 1.1 cgd * Always true, causes symbolic links to be followed on a global
906 1.1 cgd * basis.
907 1.1 cgd */
908 1.1 cgd PLAN *
909 1.57 apb c_follow(char ***argvp, int isok)
910 1.1 cgd {
911 1.1 cgd ftsoptions &= ~FTS_PHYSICAL;
912 1.1 cgd ftsoptions |= FTS_LOGICAL;
913 1.1 cgd
914 1.10 jtc return (palloc(N_FOLLOW, f_always_true));
915 1.1 cgd }
916 1.57 apb
917 1.51 reed /* -fprint functions --
918 1.51 reed *
919 1.51 reed * Causes the current pathame to be written to the defined output file.
920 1.51 reed */
921 1.51 reed int
922 1.57 apb f_fprint(PLAN *plan, FTSENT *entry)
923 1.51 reed {
924 1.51 reed
925 1.51 reed if (-1 == fprintf(plan->fprint_file, "%s\n", entry->fts_path))
926 1.51 reed warn("fprintf");
927 1.51 reed
928 1.51 reed return(1);
929 1.51 reed
930 1.51 reed /* no descriptors are closed; they will be closed by
931 1.51 reed operating system when this find command exits. */
932 1.51 reed }
933 1.57 apb
934 1.51 reed PLAN *
935 1.57 apb c_fprint(char ***argvp, int isok)
936 1.51 reed {
937 1.51 reed PLAN *new;
938 1.51 reed
939 1.51 reed isoutput = 1; /* do not assume -print */
940 1.51 reed
941 1.51 reed new = palloc(N_FPRINT, f_fprint);
942 1.51 reed
943 1.51 reed if (NULL == (new->fprint_file = fopen(**argvp, "w")))
944 1.51 reed err(1, "-fprint: %s: cannot create file", **argvp);
945 1.51 reed
946 1.51 reed (*argvp)++;
947 1.51 reed return (new);
948 1.51 reed }
949 1.51 reed
950 1.1 cgd /*
951 1.1 cgd * -fstype functions --
952 1.1 cgd *
953 1.1 cgd * True if the file is of a certain type.
954 1.1 cgd */
955 1.10 jtc int
956 1.57 apb f_fstype(PLAN *plan, FTSENT *entry)
957 1.1 cgd {
958 1.1 cgd static dev_t curdev; /* need a guaranteed illegal dev value */
959 1.1 cgd static int first = 1;
960 1.48 christos struct statvfs sb;
961 1.10 jtc static short val;
962 1.63 christos static char fstype[sizeof(sb.f_fstypename)];
963 1.1 cgd char *p, save[2];
964 1.1 cgd
965 1.54 mrg memset(&save, 0, sizeof save); /* XXX gcc */
966 1.54 mrg
967 1.10 jtc /* Only check when we cross mount point. */
968 1.7 deraadt if (first || curdev != entry->fts_statp->st_dev) {
969 1.7 deraadt curdev = entry->fts_statp->st_dev;
970 1.1 cgd
971 1.1 cgd /*
972 1.1 cgd * Statfs follows symlinks; find wants the link's file system,
973 1.1 cgd * not where it points.
974 1.1 cgd */
975 1.1 cgd if (entry->fts_info == FTS_SL ||
976 1.1 cgd entry->fts_info == FTS_SLNONE) {
977 1.21 lukem if ((p = strrchr(entry->fts_accpath, '/')) != NULL)
978 1.1 cgd ++p;
979 1.1 cgd else
980 1.1 cgd p = entry->fts_accpath;
981 1.1 cgd save[0] = p[0];
982 1.1 cgd p[0] = '.';
983 1.1 cgd save[1] = p[1];
984 1.1 cgd p[1] = '\0';
985 1.57 apb
986 1.57 apb } else
987 1.1 cgd p = NULL;
988 1.1 cgd
989 1.48 christos if (statvfs(entry->fts_accpath, &sb))
990 1.10 jtc err(1, "%s", entry->fts_accpath);
991 1.1 cgd
992 1.1 cgd if (p) {
993 1.1 cgd p[0] = save[0];
994 1.1 cgd p[1] = save[1];
995 1.1 cgd }
996 1.1 cgd
997 1.1 cgd first = 0;
998 1.15 mycroft
999 1.15 mycroft /*
1000 1.15 mycroft * Further tests may need both of these values, so
1001 1.15 mycroft * always copy both of them.
1002 1.15 mycroft */
1003 1.48 christos val = sb.f_flag;
1004 1.44 itojun strlcpy(fstype, sb.f_fstypename, sizeof(fstype));
1005 1.10 jtc }
1006 1.14 mycroft switch (plan->flags) {
1007 1.10 jtc case F_MTFLAG:
1008 1.57 apb return (val & plan->mt_data);
1009 1.10 jtc case F_MTTYPE:
1010 1.63 christos return (strncmp(fstype, plan->c_data, sizeof(fstype)) == 0);
1011 1.10 jtc default:
1012 1.10 jtc abort();
1013 1.1 cgd }
1014 1.1 cgd }
1015 1.57 apb
1016 1.1 cgd PLAN *
1017 1.57 apb c_fstype(char ***argvp, int isok)
1018 1.1 cgd {
1019 1.24 christos char *arg = **argvp;
1020 1.21 lukem PLAN *new;
1021 1.57 apb
1022 1.24 christos (*argvp)++;
1023 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1024 1.57 apb
1025 1.1 cgd new = palloc(N_FSTYPE, f_fstype);
1026 1.22 mrg
1027 1.10 jtc switch (*arg) {
1028 1.1 cgd case 'l':
1029 1.1 cgd if (!strcmp(arg, "local")) {
1030 1.10 jtc new->flags = F_MTFLAG;
1031 1.10 jtc new->mt_data = MNT_LOCAL;
1032 1.10 jtc return (new);
1033 1.1 cgd }
1034 1.1 cgd break;
1035 1.2 cgd case 'r':
1036 1.2 cgd if (!strcmp(arg, "rdonly")) {
1037 1.10 jtc new->flags = F_MTFLAG;
1038 1.10 jtc new->mt_data = MNT_RDONLY;
1039 1.10 jtc return (new);
1040 1.1 cgd }
1041 1.1 cgd break;
1042 1.1 cgd }
1043 1.13 cgd
1044 1.13 cgd new->flags = F_MTTYPE;
1045 1.13 cgd new->c_data = arg;
1046 1.13 cgd return (new);
1047 1.1 cgd }
1048 1.57 apb
1049 1.1 cgd /*
1050 1.1 cgd * -group gname functions --
1051 1.1 cgd *
1052 1.1 cgd * True if the file belongs to the group gname. If gname is numeric and
1053 1.1 cgd * an equivalent of the getgrnam() function does not return a valid group
1054 1.1 cgd * name, gname is taken as a group ID.
1055 1.1 cgd */
1056 1.10 jtc int
1057 1.57 apb f_group(PLAN *plan, FTSENT *entry)
1058 1.1 cgd {
1059 1.33 enami
1060 1.10 jtc return (entry->fts_statp->st_gid == plan->g_data);
1061 1.1 cgd }
1062 1.57 apb
1063 1.1 cgd PLAN *
1064 1.57 apb c_group(char ***argvp, int isok)
1065 1.1 cgd {
1066 1.24 christos char *gname = **argvp;
1067 1.1 cgd PLAN *new;
1068 1.1 cgd struct group *g;
1069 1.1 cgd gid_t gid;
1070 1.57 apb
1071 1.24 christos (*argvp)++;
1072 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1073 1.1 cgd
1074 1.1 cgd g = getgrnam(gname);
1075 1.1 cgd if (g == NULL) {
1076 1.1 cgd gid = atoi(gname);
1077 1.1 cgd if (gid == 0 && gname[0] != '0')
1078 1.10 jtc errx(1, "-group: %s: no such group", gname);
1079 1.1 cgd } else
1080 1.1 cgd gid = g->gr_gid;
1081 1.57 apb
1082 1.1 cgd new = palloc(N_GROUP, f_group);
1083 1.1 cgd new->g_data = gid;
1084 1.10 jtc return (new);
1085 1.1 cgd }
1086 1.1 cgd
1087 1.1 cgd /*
1088 1.1 cgd * -inum n functions --
1089 1.1 cgd *
1090 1.1 cgd * True if the file has inode # n.
1091 1.1 cgd */
1092 1.10 jtc int
1093 1.57 apb f_inum(PLAN *plan, FTSENT *entry)
1094 1.1 cgd {
1095 1.33 enami
1096 1.7 deraadt COMPARE(entry->fts_statp->st_ino, plan->i_data);
1097 1.1 cgd }
1098 1.57 apb
1099 1.1 cgd PLAN *
1100 1.57 apb c_inum(char ***argvp, int isok)
1101 1.1 cgd {
1102 1.24 christos char *arg = **argvp;
1103 1.1 cgd PLAN *new;
1104 1.57 apb
1105 1.24 christos (*argvp)++;
1106 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1107 1.57 apb
1108 1.1 cgd new = palloc(N_INUM, f_inum);
1109 1.10 jtc new->i_data = find_parsenum(new, "-inum", arg, NULL);
1110 1.10 jtc return (new);
1111 1.1 cgd }
1112 1.57 apb
1113 1.1 cgd /*
1114 1.1 cgd * -links n functions --
1115 1.1 cgd *
1116 1.1 cgd * True if the file has n links.
1117 1.1 cgd */
1118 1.10 jtc int
1119 1.57 apb f_links(PLAN *plan, FTSENT *entry)
1120 1.1 cgd {
1121 1.33 enami
1122 1.7 deraadt COMPARE(entry->fts_statp->st_nlink, plan->l_data);
1123 1.1 cgd }
1124 1.57 apb
1125 1.1 cgd PLAN *
1126 1.57 apb c_links(char ***argvp, int isok)
1127 1.1 cgd {
1128 1.24 christos char *arg = **argvp;
1129 1.1 cgd PLAN *new;
1130 1.57 apb
1131 1.24 christos (*argvp)++;
1132 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1133 1.57 apb
1134 1.1 cgd new = palloc(N_LINKS, f_links);
1135 1.10 jtc new->l_data = (nlink_t)find_parsenum(new, "-links", arg, NULL);
1136 1.10 jtc return (new);
1137 1.1 cgd }
1138 1.57 apb
1139 1.1 cgd /*
1140 1.1 cgd * -ls functions --
1141 1.1 cgd *
1142 1.1 cgd * Always true - prints the current entry to stdout in "ls" format.
1143 1.1 cgd */
1144 1.10 jtc int
1145 1.57 apb f_ls(PLAN *plan, FTSENT *entry)
1146 1.1 cgd {
1147 1.33 enami
1148 1.7 deraadt printlong(entry->fts_path, entry->fts_accpath, entry->fts_statp);
1149 1.10 jtc return (1);
1150 1.1 cgd }
1151 1.57 apb
1152 1.1 cgd PLAN *
1153 1.57 apb c_ls(char ***argvp, int isok)
1154 1.1 cgd {
1155 1.33 enami
1156 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1157 1.1 cgd isoutput = 1;
1158 1.57 apb
1159 1.10 jtc return (palloc(N_LS, f_ls));
1160 1.10 jtc }
1161 1.10 jtc
1162 1.41 provos /*
1163 1.41 provos * - maxdepth n functions --
1164 1.41 provos *
1165 1.41 provos * True if the current search depth is less than or equal to the
1166 1.41 provos * maximum depth specified
1167 1.41 provos */
1168 1.41 provos int
1169 1.57 apb f_maxdepth(PLAN *plan, FTSENT *entry)
1170 1.41 provos {
1171 1.41 provos extern FTS *tree;
1172 1.41 provos
1173 1.41 provos if (entry->fts_level >= plan->max_data)
1174 1.41 provos fts_set(tree, entry, FTS_SKIP);
1175 1.41 provos return (entry->fts_level <= plan->max_data);
1176 1.41 provos }
1177 1.41 provos
1178 1.41 provos PLAN *
1179 1.57 apb c_maxdepth(char ***argvp, int isok)
1180 1.41 provos {
1181 1.41 provos char *arg = **argvp;
1182 1.41 provos PLAN *new;
1183 1.41 provos
1184 1.41 provos (*argvp)++;
1185 1.41 provos new = palloc(N_MAXDEPTH, f_maxdepth);
1186 1.41 provos new->max_data = atoi(arg);
1187 1.41 provos return (new);
1188 1.41 provos }
1189 1.41 provos
1190 1.41 provos /*
1191 1.41 provos * - mindepth n functions --
1192 1.41 provos *
1193 1.41 provos * True if the current search depth is greater than or equal to the
1194 1.41 provos * minimum depth specified
1195 1.41 provos */
1196 1.41 provos int
1197 1.57 apb f_mindepth(PLAN *plan, FTSENT *entry)
1198 1.41 provos {
1199 1.41 provos return (entry->fts_level >= plan->min_data);
1200 1.41 provos }
1201 1.41 provos
1202 1.41 provos PLAN *
1203 1.57 apb c_mindepth(char ***argvp, int isok)
1204 1.41 provos {
1205 1.41 provos char *arg = **argvp;
1206 1.41 provos PLAN *new;
1207 1.41 provos
1208 1.41 provos (*argvp)++;
1209 1.41 provos new = palloc(N_MINDEPTH, f_mindepth);
1210 1.41 provos new->min_data = atoi(arg);
1211 1.41 provos return (new);
1212 1.41 provos }
1213 1.29 simonb /*
1214 1.29 simonb * -mmin n functions --
1215 1.29 simonb *
1216 1.29 simonb * True if the difference between the file modification time and the
1217 1.29 simonb * current time is n 24 hour periods.
1218 1.29 simonb */
1219 1.29 simonb int
1220 1.57 apb f_mmin(PLAN *plan, FTSENT *entry)
1221 1.29 simonb {
1222 1.29 simonb COMPARE((now - entry->fts_statp->st_mtime + SECSPERMIN - 1) /
1223 1.29 simonb SECSPERMIN, plan->t_data);
1224 1.29 simonb }
1225 1.57 apb
1226 1.29 simonb PLAN *
1227 1.57 apb c_mmin(char ***argvp, int isok)
1228 1.29 simonb {
1229 1.29 simonb char *arg = **argvp;
1230 1.29 simonb PLAN *new;
1231 1.29 simonb
1232 1.29 simonb (*argvp)++;
1233 1.29 simonb ftsoptions &= ~FTS_NOSTAT;
1234 1.29 simonb
1235 1.29 simonb new = palloc(N_MMIN, f_mmin);
1236 1.29 simonb new->t_data = find_parsenum(new, "-mmin", arg, NULL);
1237 1.29 simonb TIME_CORRECT(new, N_MMIN);
1238 1.29 simonb return (new);
1239 1.29 simonb }
1240 1.10 jtc /*
1241 1.10 jtc * -mtime n functions --
1242 1.10 jtc *
1243 1.10 jtc * True if the difference between the file modification time and the
1244 1.10 jtc * current time is n 24 hour periods.
1245 1.10 jtc */
1246 1.10 jtc int
1247 1.57 apb f_mtime(PLAN *plan, FTSENT *entry)
1248 1.10 jtc {
1249 1.10 jtc COMPARE((now - entry->fts_statp->st_mtime + SECSPERDAY - 1) /
1250 1.10 jtc SECSPERDAY, plan->t_data);
1251 1.10 jtc }
1252 1.57 apb
1253 1.10 jtc PLAN *
1254 1.57 apb c_mtime(char ***argvp, int isok)
1255 1.10 jtc {
1256 1.24 christos char *arg = **argvp;
1257 1.10 jtc PLAN *new;
1258 1.10 jtc
1259 1.24 christos (*argvp)++;
1260 1.10 jtc ftsoptions &= ~FTS_NOSTAT;
1261 1.10 jtc
1262 1.10 jtc new = palloc(N_MTIME, f_mtime);
1263 1.10 jtc new->t_data = find_parsenum(new, "-mtime", arg, NULL);
1264 1.10 jtc TIME_CORRECT(new, N_MTIME);
1265 1.10 jtc return (new);
1266 1.1 cgd }
1267 1.1 cgd
1268 1.1 cgd /*
1269 1.1 cgd * -name functions --
1270 1.1 cgd *
1271 1.1 cgd * True if the basename of the filename being examined
1272 1.1 cgd * matches pattern using Pattern Matching Notation S3.14
1273 1.1 cgd */
1274 1.10 jtc int
1275 1.57 apb f_name(PLAN *plan, FTSENT *entry)
1276 1.1 cgd {
1277 1.33 enami
1278 1.10 jtc return (!fnmatch(plan->c_data, entry->fts_name, 0));
1279 1.1 cgd }
1280 1.57 apb
1281 1.1 cgd PLAN *
1282 1.57 apb c_name(char ***argvp, int isok)
1283 1.1 cgd {
1284 1.24 christos char *pattern = **argvp;
1285 1.1 cgd PLAN *new;
1286 1.1 cgd
1287 1.24 christos (*argvp)++;
1288 1.1 cgd new = palloc(N_NAME, f_name);
1289 1.45 provos new->c_data = pattern;
1290 1.45 provos return (new);
1291 1.45 provos }
1292 1.57 apb
1293 1.45 provos /*
1294 1.45 provos * -iname functions --
1295 1.45 provos *
1296 1.45 provos * Similar to -name, but does case insensitive matching
1297 1.57 apb *
1298 1.45 provos */
1299 1.45 provos int
1300 1.57 apb f_iname(PLAN *plan, FTSENT *entry)
1301 1.45 provos {
1302 1.45 provos return (!fnmatch(plan->c_data, entry->fts_name, FNM_CASEFOLD));
1303 1.45 provos }
1304 1.57 apb
1305 1.45 provos PLAN *
1306 1.57 apb c_iname(char ***argvp, int isok)
1307 1.45 provos {
1308 1.45 provos char *pattern = **argvp;
1309 1.45 provos PLAN *new;
1310 1.45 provos
1311 1.45 provos (*argvp)++;
1312 1.45 provos new = palloc(N_INAME, f_iname);
1313 1.1 cgd new->c_data = pattern;
1314 1.10 jtc return (new);
1315 1.1 cgd }
1316 1.57 apb
1317 1.1 cgd /*
1318 1.1 cgd * -newer file functions --
1319 1.1 cgd *
1320 1.1 cgd * True if the current file has been modified more recently
1321 1.40 kleink * than the modification time of the file named by the pathname
1322 1.1 cgd * file.
1323 1.1 cgd */
1324 1.10 jtc int
1325 1.57 apb f_newer(PLAN *plan, FTSENT *entry)
1326 1.1 cgd {
1327 1.33 enami
1328 1.10 jtc return (entry->fts_statp->st_mtime > plan->t_data);
1329 1.1 cgd }
1330 1.57 apb
1331 1.1 cgd PLAN *
1332 1.57 apb c_newer(char ***argvp, int isok)
1333 1.1 cgd {
1334 1.24 christos char *filename = **argvp;
1335 1.1 cgd PLAN *new;
1336 1.1 cgd struct stat sb;
1337 1.57 apb
1338 1.24 christos (*argvp)++;
1339 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1340 1.1 cgd
1341 1.1 cgd if (stat(filename, &sb))
1342 1.10 jtc err(1, "%s", filename);
1343 1.1 cgd new = palloc(N_NEWER, f_newer);
1344 1.1 cgd new->t_data = sb.st_mtime;
1345 1.10 jtc return (new);
1346 1.1 cgd }
1347 1.57 apb
1348 1.1 cgd /*
1349 1.1 cgd * -nogroup functions --
1350 1.1 cgd *
1351 1.1 cgd * True if file belongs to a user ID for which the equivalent
1352 1.1 cgd * of the getgrnam() 9.2.1 [POSIX.1] function returns NULL.
1353 1.1 cgd */
1354 1.10 jtc int
1355 1.57 apb f_nogroup(PLAN *plan, FTSENT *entry)
1356 1.1 cgd {
1357 1.22 mrg
1358 1.12 andrew return (group_from_gid(entry->fts_statp->st_gid, 1) ? 0 : 1);
1359 1.1 cgd }
1360 1.57 apb
1361 1.1 cgd PLAN *
1362 1.57 apb c_nogroup(char ***argvp, int isok)
1363 1.1 cgd {
1364 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1365 1.1 cgd
1366 1.10 jtc return (palloc(N_NOGROUP, f_nogroup));
1367 1.1 cgd }
1368 1.57 apb
1369 1.1 cgd /*
1370 1.1 cgd * -nouser functions --
1371 1.1 cgd *
1372 1.1 cgd * True if file belongs to a user ID for which the equivalent
1373 1.1 cgd * of the getpwuid() 9.2.2 [POSIX.1] function returns NULL.
1374 1.1 cgd */
1375 1.10 jtc int
1376 1.57 apb f_nouser(PLAN *plan, FTSENT *entry)
1377 1.1 cgd {
1378 1.22 mrg
1379 1.12 andrew return (user_from_uid(entry->fts_statp->st_uid, 1) ? 0 : 1);
1380 1.1 cgd }
1381 1.57 apb
1382 1.1 cgd PLAN *
1383 1.57 apb c_nouser(char ***argvp, int isok)
1384 1.1 cgd {
1385 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1386 1.1 cgd
1387 1.10 jtc return (palloc(N_NOUSER, f_nouser));
1388 1.10 jtc }
1389 1.57 apb
1390 1.10 jtc /*
1391 1.10 jtc * -path functions --
1392 1.10 jtc *
1393 1.10 jtc * True if the path of the filename being examined
1394 1.10 jtc * matches pattern using Pattern Matching Notation S3.14
1395 1.10 jtc */
1396 1.10 jtc int
1397 1.57 apb f_path(PLAN *plan, FTSENT *entry)
1398 1.10 jtc {
1399 1.33 enami
1400 1.10 jtc return (!fnmatch(plan->c_data, entry->fts_path, 0));
1401 1.10 jtc }
1402 1.57 apb
1403 1.10 jtc PLAN *
1404 1.57 apb c_path(char ***argvp, int isok)
1405 1.10 jtc {
1406 1.24 christos char *pattern = **argvp;
1407 1.10 jtc PLAN *new;
1408 1.10 jtc
1409 1.24 christos (*argvp)++;
1410 1.10 jtc new = palloc(N_NAME, f_path);
1411 1.10 jtc new->c_data = pattern;
1412 1.10 jtc return (new);
1413 1.1 cgd }
1414 1.57 apb
1415 1.1 cgd /*
1416 1.1 cgd * -perm functions --
1417 1.1 cgd *
1418 1.1 cgd * The mode argument is used to represent file mode bits. If it starts
1419 1.1 cgd * with a leading digit, it's treated as an octal mode, otherwise as a
1420 1.1 cgd * symbolic mode.
1421 1.1 cgd */
1422 1.10 jtc int
1423 1.57 apb f_perm(PLAN *plan, FTSENT *entry)
1424 1.1 cgd {
1425 1.1 cgd mode_t mode;
1426 1.1 cgd
1427 1.7 deraadt mode = entry->fts_statp->st_mode &
1428 1.1 cgd (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO);
1429 1.10 jtc if (plan->flags == F_ATLEAST)
1430 1.10 jtc return ((plan->m_data | mode) == mode);
1431 1.1 cgd else
1432 1.10 jtc return (mode == plan->m_data);
1433 1.1 cgd /* NOTREACHED */
1434 1.1 cgd }
1435 1.57 apb
1436 1.1 cgd PLAN *
1437 1.57 apb c_perm(char ***argvp, int isok)
1438 1.1 cgd {
1439 1.24 christos char *perm = **argvp;
1440 1.1 cgd PLAN *new;
1441 1.1 cgd mode_t *set;
1442 1.1 cgd
1443 1.24 christos (*argvp)++;
1444 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1445 1.1 cgd
1446 1.1 cgd new = palloc(N_PERM, f_perm);
1447 1.1 cgd
1448 1.1 cgd if (*perm == '-') {
1449 1.10 jtc new->flags = F_ATLEAST;
1450 1.1 cgd ++perm;
1451 1.1 cgd }
1452 1.1 cgd
1453 1.1 cgd if ((set = setmode(perm)) == NULL)
1454 1.50 christos err(1, "-perm: Cannot set file mode `%s'", perm);
1455 1.1 cgd
1456 1.1 cgd new->m_data = getmode(set, 0);
1457 1.34 enami free(set);
1458 1.10 jtc return (new);
1459 1.1 cgd }
1460 1.57 apb
1461 1.1 cgd /*
1462 1.1 cgd * -print functions --
1463 1.1 cgd *
1464 1.1 cgd * Always true, causes the current pathame to be written to
1465 1.1 cgd * standard output.
1466 1.1 cgd */
1467 1.10 jtc int
1468 1.57 apb f_print(PLAN *plan, FTSENT *entry)
1469 1.1 cgd {
1470 1.33 enami
1471 1.1 cgd (void)printf("%s\n", entry->fts_path);
1472 1.22 mrg return (1);
1473 1.1 cgd }
1474 1.9 jtc
1475 1.21 lukem int
1476 1.57 apb f_print0(PLAN *plan, FTSENT *entry)
1477 1.9 jtc {
1478 1.33 enami
1479 1.9 jtc (void)fputs(entry->fts_path, stdout);
1480 1.9 jtc (void)fputc('\0', stdout);
1481 1.22 mrg return (1);
1482 1.9 jtc }
1483 1.28 lukem
1484 1.28 lukem int
1485 1.57 apb f_printx(PLAN *plan, FTSENT *entry)
1486 1.28 lukem {
1487 1.28 lukem char *cp;
1488 1.28 lukem
1489 1.28 lukem for (cp = entry->fts_path; *cp; cp++) {
1490 1.28 lukem if (*cp == '\'' || *cp == '\"' || *cp == ' ' ||
1491 1.42 matt *cp == '$' || *cp == '`' ||
1492 1.28 lukem *cp == '\t' || *cp == '\n' || *cp == '\\')
1493 1.28 lukem fputc('\\', stdout);
1494 1.28 lukem
1495 1.28 lukem fputc(*cp, stdout);
1496 1.28 lukem }
1497 1.28 lukem
1498 1.28 lukem fputc('\n', stdout);
1499 1.33 enami return (1);
1500 1.28 lukem }
1501 1.57 apb
1502 1.1 cgd PLAN *
1503 1.57 apb c_print(char ***argvp, int isok)
1504 1.1 cgd {
1505 1.33 enami
1506 1.1 cgd isoutput = 1;
1507 1.1 cgd
1508 1.22 mrg return (palloc(N_PRINT, f_print));
1509 1.9 jtc }
1510 1.9 jtc
1511 1.9 jtc PLAN *
1512 1.57 apb c_print0(char ***argvp, int isok)
1513 1.9 jtc {
1514 1.33 enami
1515 1.9 jtc isoutput = 1;
1516 1.9 jtc
1517 1.22 mrg return (palloc(N_PRINT0, f_print0));
1518 1.28 lukem }
1519 1.28 lukem
1520 1.28 lukem PLAN *
1521 1.57 apb c_printx(char ***argvp, int isok)
1522 1.28 lukem {
1523 1.33 enami
1524 1.28 lukem isoutput = 1;
1525 1.28 lukem
1526 1.33 enami return (palloc(N_PRINTX, f_printx));
1527 1.1 cgd }
1528 1.57 apb
1529 1.1 cgd /*
1530 1.1 cgd * -prune functions --
1531 1.1 cgd *
1532 1.1 cgd * Prune a portion of the hierarchy.
1533 1.1 cgd */
1534 1.10 jtc int
1535 1.57 apb f_prune(PLAN *plan, FTSENT *entry)
1536 1.1 cgd {
1537 1.1 cgd if (fts_set(tree, entry, FTS_SKIP))
1538 1.10 jtc err(1, "%s", entry->fts_path);
1539 1.10 jtc return (1);
1540 1.1 cgd }
1541 1.57 apb
1542 1.1 cgd PLAN *
1543 1.57 apb c_prune(char ***argvp, int isok)
1544 1.1 cgd {
1545 1.33 enami
1546 1.10 jtc return (palloc(N_PRUNE, f_prune));
1547 1.1 cgd }
1548 1.31 cgd
1549 1.31 cgd /*
1550 1.31 cgd * -regex regexp (and related) functions --
1551 1.31 cgd *
1552 1.31 cgd * True if the complete file path matches the regular expression regexp.
1553 1.31 cgd * For -regex, regexp is a case-sensitive (basic) regular expression.
1554 1.31 cgd * For -iregex, regexp is a case-insensitive (basic) regular expression.
1555 1.31 cgd */
1556 1.31 cgd int
1557 1.57 apb f_regex(PLAN *plan, FTSENT *entry)
1558 1.31 cgd {
1559 1.31 cgd
1560 1.31 cgd return (regexec(&plan->regexp_data, entry->fts_path, 0, NULL, 0) == 0);
1561 1.31 cgd }
1562 1.57 apb
1563 1.31 cgd static PLAN *
1564 1.64 daniel c_regex_common(char ***argvp, int isok, enum ntype type, bool icase)
1565 1.31 cgd {
1566 1.31 cgd char errbuf[LINE_MAX];
1567 1.31 cgd regex_t reg;
1568 1.31 cgd char *regexp = **argvp;
1569 1.31 cgd char *lineregexp;
1570 1.31 cgd PLAN *new;
1571 1.31 cgd int rv;
1572 1.59 christos size_t len;
1573 1.31 cgd
1574 1.31 cgd (*argvp)++;
1575 1.31 cgd
1576 1.59 christos len = strlen(regexp) + 1 + 6;
1577 1.59 christos lineregexp = malloc(len); /* max needed */
1578 1.59 christos if (lineregexp == NULL)
1579 1.59 christos err(1, NULL);
1580 1.59 christos snprintf(lineregexp, len, "^%s(%s%s)$",
1581 1.31 cgd (regcomp_flags & REG_EXTENDED) ? "" : "\\", regexp,
1582 1.31 cgd (regcomp_flags & REG_EXTENDED) ? "" : "\\");
1583 1.64 daniel rv = regcomp(®, lineregexp, REG_NOSUB|regcomp_flags|
1584 1.64 daniel (icase ? REG_ICASE : 0));
1585 1.59 christos free(lineregexp);
1586 1.31 cgd if (rv != 0) {
1587 1.31 cgd regerror(rv, ®, errbuf, sizeof errbuf);
1588 1.31 cgd errx(1, "regexp %s: %s", regexp, errbuf);
1589 1.31 cgd }
1590 1.57 apb
1591 1.31 cgd new = palloc(type, f_regex);
1592 1.31 cgd new->regexp_data = reg;
1593 1.31 cgd return (new);
1594 1.31 cgd }
1595 1.31 cgd
1596 1.31 cgd PLAN *
1597 1.57 apb c_regex(char ***argvp, int isok)
1598 1.31 cgd {
1599 1.31 cgd
1600 1.64 daniel return (c_regex_common(argvp, isok, N_REGEX, false));
1601 1.31 cgd }
1602 1.31 cgd
1603 1.31 cgd PLAN *
1604 1.57 apb c_iregex(char ***argvp, int isok)
1605 1.31 cgd {
1606 1.31 cgd
1607 1.64 daniel return (c_regex_common(argvp, isok, N_IREGEX, true));
1608 1.31 cgd }
1609 1.31 cgd
1610 1.1 cgd /*
1611 1.1 cgd * -size n[c] functions --
1612 1.1 cgd *
1613 1.1 cgd * True if the file size in bytes, divided by an implementation defined
1614 1.1 cgd * value and rounded up to the next integer, is n. If n is followed by
1615 1.1 cgd * a c, the size is in bytes.
1616 1.1 cgd */
1617 1.1 cgd #define FIND_SIZE 512
1618 1.1 cgd static int divsize = 1;
1619 1.1 cgd
1620 1.10 jtc int
1621 1.57 apb f_size(PLAN *plan, FTSENT *entry)
1622 1.1 cgd {
1623 1.1 cgd off_t size;
1624 1.1 cgd
1625 1.7 deraadt size = divsize ? (entry->fts_statp->st_size + FIND_SIZE - 1) /
1626 1.7 deraadt FIND_SIZE : entry->fts_statp->st_size;
1627 1.1 cgd COMPARE(size, plan->o_data);
1628 1.1 cgd }
1629 1.57 apb
1630 1.1 cgd PLAN *
1631 1.57 apb c_size(char ***argvp, int isok)
1632 1.1 cgd {
1633 1.24 christos char *arg = **argvp;
1634 1.1 cgd PLAN *new;
1635 1.1 cgd char endch;
1636 1.57 apb
1637 1.24 christos (*argvp)++;
1638 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1639 1.1 cgd
1640 1.1 cgd new = palloc(N_SIZE, f_size);
1641 1.8 cgd endch = 'c';
1642 1.1 cgd new->o_data = find_parsenum(new, "-size", arg, &endch);
1643 1.1 cgd if (endch == 'c')
1644 1.1 cgd divsize = 0;
1645 1.10 jtc return (new);
1646 1.1 cgd }
1647 1.57 apb
1648 1.1 cgd /*
1649 1.1 cgd * -type c functions --
1650 1.1 cgd *
1651 1.22 mrg * True if the type of the file is c, where c is b, c, d, p, f or w
1652 1.22 mrg * for block special file, character special file, directory, FIFO,
1653 1.22 mrg * regular file or whiteout respectively.
1654 1.1 cgd */
1655 1.10 jtc int
1656 1.57 apb f_type(PLAN *plan, FTSENT *entry)
1657 1.1 cgd {
1658 1.33 enami
1659 1.10 jtc return ((entry->fts_statp->st_mode & S_IFMT) == plan->m_data);
1660 1.1 cgd }
1661 1.57 apb
1662 1.1 cgd PLAN *
1663 1.57 apb c_type(char ***argvp, int isok)
1664 1.1 cgd {
1665 1.24 christos char *typestring = **argvp;
1666 1.1 cgd PLAN *new;
1667 1.25 wsanchez mode_t mask = (mode_t)0;
1668 1.57 apb
1669 1.24 christos (*argvp)++;
1670 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1671 1.1 cgd
1672 1.1 cgd switch (typestring[0]) {
1673 1.1 cgd case 'b':
1674 1.1 cgd mask = S_IFBLK;
1675 1.1 cgd break;
1676 1.1 cgd case 'c':
1677 1.1 cgd mask = S_IFCHR;
1678 1.1 cgd break;
1679 1.1 cgd case 'd':
1680 1.1 cgd mask = S_IFDIR;
1681 1.1 cgd break;
1682 1.1 cgd case 'f':
1683 1.1 cgd mask = S_IFREG;
1684 1.1 cgd break;
1685 1.1 cgd case 'l':
1686 1.1 cgd mask = S_IFLNK;
1687 1.1 cgd break;
1688 1.1 cgd case 'p':
1689 1.1 cgd mask = S_IFIFO;
1690 1.1 cgd break;
1691 1.1 cgd case 's':
1692 1.1 cgd mask = S_IFSOCK;
1693 1.1 cgd break;
1694 1.49 atatat #ifdef S_IFWHT
1695 1.49 atatat case 'W':
1696 1.22 mrg case 'w':
1697 1.22 mrg mask = S_IFWHT;
1698 1.49 atatat #ifdef FTS_WHITEOUT
1699 1.22 mrg ftsoptions |= FTS_WHITEOUT;
1700 1.49 atatat #endif
1701 1.22 mrg break;
1702 1.49 atatat #endif /* S_IFWHT */
1703 1.1 cgd default:
1704 1.10 jtc errx(1, "-type: %s: unknown type", typestring);
1705 1.1 cgd }
1706 1.57 apb
1707 1.1 cgd new = palloc(N_TYPE, f_type);
1708 1.1 cgd new->m_data = mask;
1709 1.10 jtc return (new);
1710 1.1 cgd }
1711 1.57 apb
1712 1.1 cgd /*
1713 1.1 cgd * -user uname functions --
1714 1.1 cgd *
1715 1.1 cgd * True if the file belongs to the user uname. If uname is numeric and
1716 1.1 cgd * an equivalent of the getpwnam() S9.2.2 [POSIX.1] function does not
1717 1.1 cgd * return a valid user name, uname is taken as a user ID.
1718 1.1 cgd */
1719 1.10 jtc int
1720 1.57 apb f_user(PLAN *plan, FTSENT *entry)
1721 1.1 cgd {
1722 1.33 enami
1723 1.43 jhawk COMPARE(entry->fts_statp->st_uid, plan->u_data);
1724 1.1 cgd }
1725 1.57 apb
1726 1.1 cgd PLAN *
1727 1.57 apb c_user(char ***argvp, int isok)
1728 1.1 cgd {
1729 1.24 christos char *username = **argvp;
1730 1.1 cgd PLAN *new;
1731 1.1 cgd struct passwd *p;
1732 1.1 cgd uid_t uid;
1733 1.57 apb
1734 1.24 christos (*argvp)++;
1735 1.1 cgd ftsoptions &= ~FTS_NOSTAT;
1736 1.1 cgd
1737 1.43 jhawk new = palloc(N_USER, f_user);
1738 1.1 cgd p = getpwnam(username);
1739 1.1 cgd if (p == NULL) {
1740 1.43 jhawk if (atoi(username) == 0 && username[0] != '0' &&
1741 1.43 jhawk strcmp(username, "+0") && strcmp(username, "-0"))
1742 1.10 jtc errx(1, "-user: %s: no such user", username);
1743 1.43 jhawk uid = find_parsenum(new, "-user", username, NULL);
1744 1.43 jhawk
1745 1.43 jhawk } else {
1746 1.56 apb new->flags = F_EQUAL;
1747 1.1 cgd uid = p->pw_uid;
1748 1.43 jhawk }
1749 1.1 cgd
1750 1.1 cgd new->u_data = uid;
1751 1.10 jtc return (new);
1752 1.1 cgd }
1753 1.57 apb
1754 1.1 cgd /*
1755 1.1 cgd * -xdev functions --
1756 1.1 cgd *
1757 1.61 christos * Always true, causes find not to descend past directories that have a
1758 1.1 cgd * different device ID (st_dev, see stat() S5.6.2 [POSIX.1])
1759 1.1 cgd */
1760 1.1 cgd PLAN *
1761 1.57 apb c_xdev(char ***argvp, int isok)
1762 1.1 cgd {
1763 1.1 cgd ftsoptions |= FTS_XDEV;
1764 1.1 cgd
1765 1.10 jtc return (palloc(N_XDEV, f_always_true));
1766 1.1 cgd }
1767 1.1 cgd
1768 1.1 cgd /*
1769 1.1 cgd * ( expression ) functions --
1770 1.1 cgd *
1771 1.1 cgd * True if expression is true.
1772 1.1 cgd */
1773 1.10 jtc int
1774 1.57 apb f_expr(PLAN *plan, FTSENT *entry)
1775 1.1 cgd {
1776 1.21 lukem PLAN *p;
1777 1.21 lukem int state;
1778 1.1 cgd
1779 1.21 lukem state = 0;
1780 1.1 cgd for (p = plan->p_data[0];
1781 1.1 cgd p && (state = (p->eval)(p, entry)); p = p->next);
1782 1.10 jtc return (state);
1783 1.1 cgd }
1784 1.57 apb
1785 1.1 cgd /*
1786 1.1 cgd * N_OPENPAREN and N_CLOSEPAREN nodes are temporary place markers. They are
1787 1.1 cgd * eliminated during phase 2 of find_formplan() --- the '(' node is converted
1788 1.1 cgd * to a N_EXPR node containing the expression and the ')' node is discarded.
1789 1.1 cgd */
1790 1.1 cgd PLAN *
1791 1.57 apb c_openparen(char ***argvp, int isok)
1792 1.1 cgd {
1793 1.33 enami
1794 1.57 apb return (palloc(N_OPENPAREN, (int (*)(PLAN *, FTSENT *))-1));
1795 1.1 cgd }
1796 1.57 apb
1797 1.1 cgd PLAN *
1798 1.57 apb c_closeparen(char ***argvp, int isok)
1799 1.1 cgd {
1800 1.33 enami
1801 1.57 apb return (palloc(N_CLOSEPAREN, (int (*)(PLAN *, FTSENT *))-1));
1802 1.1 cgd }
1803 1.57 apb
1804 1.1 cgd /*
1805 1.1 cgd * ! expression functions --
1806 1.1 cgd *
1807 1.1 cgd * Negation of a primary; the unary NOT operator.
1808 1.1 cgd */
1809 1.10 jtc int
1810 1.57 apb f_not(PLAN *plan, FTSENT *entry)
1811 1.1 cgd {
1812 1.21 lukem PLAN *p;
1813 1.21 lukem int state;
1814 1.1 cgd
1815 1.21 lukem state = 0;
1816 1.1 cgd for (p = plan->p_data[0];
1817 1.1 cgd p && (state = (p->eval)(p, entry)); p = p->next);
1818 1.10 jtc return (!state);
1819 1.1 cgd }
1820 1.57 apb
1821 1.1 cgd PLAN *
1822 1.57 apb c_not(char ***argvp, int isok)
1823 1.1 cgd {
1824 1.33 enami
1825 1.10 jtc return (palloc(N_NOT, f_not));
1826 1.1 cgd }
1827 1.57 apb
1828 1.1 cgd /*
1829 1.1 cgd * expression -o expression functions --
1830 1.1 cgd *
1831 1.1 cgd * Alternation of primaries; the OR operator. The second expression is
1832 1.1 cgd * not evaluated if the first expression is true.
1833 1.1 cgd */
1834 1.10 jtc int
1835 1.57 apb f_or(PLAN *plan, FTSENT *entry)
1836 1.1 cgd {
1837 1.21 lukem PLAN *p;
1838 1.21 lukem int state;
1839 1.1 cgd
1840 1.21 lukem state = 0;
1841 1.1 cgd for (p = plan->p_data[0];
1842 1.1 cgd p && (state = (p->eval)(p, entry)); p = p->next);
1843 1.1 cgd
1844 1.1 cgd if (state)
1845 1.10 jtc return (1);
1846 1.1 cgd
1847 1.1 cgd for (p = plan->p_data[1];
1848 1.1 cgd p && (state = (p->eval)(p, entry)); p = p->next);
1849 1.10 jtc return (state);
1850 1.1 cgd }
1851 1.1 cgd
1852 1.1 cgd PLAN *
1853 1.57 apb c_or(char ***argvp, int isok)
1854 1.1 cgd {
1855 1.33 enami
1856 1.10 jtc return (palloc(N_OR, f_or));
1857 1.1 cgd }
1858 1.1 cgd
1859 1.24 christos PLAN *
1860 1.57 apb c_null(char ***argvp, int isok)
1861 1.24 christos {
1862 1.33 enami
1863 1.33 enami return (NULL);
1864 1.24 christos }
1865 1.24 christos
1866 1.56 apb
1867 1.56 apb /*
1868 1.56 apb * plan_cleanup --
1869 1.56 apb * Check and see if the specified plan has any residual state,
1870 1.56 apb * and if so, clean it up as appropriate.
1871 1.56 apb *
1872 1.56 apb * At the moment, only N_EXEC has state. Two kinds: 1)
1873 1.56 apb * lists of files to feed to subprocesses 2) State on exit
1874 1.56 apb * statusses of past subprocesses.
1875 1.56 apb */
1876 1.56 apb /* ARGSUSED1 */
1877 1.56 apb int
1878 1.57 apb plan_cleanup(PLAN *plan, void *arg)
1879 1.56 apb {
1880 1.56 apb if (plan->type==N_EXEC && plan->ep_narg)
1881 1.56 apb run_f_exec(plan);
1882 1.56 apb
1883 1.56 apb return plan->ep_rval; /* Passed save exit-status up chain */
1884 1.56 apb }
1885 1.56 apb
1886 1.1 cgd static PLAN *
1887 1.57 apb palloc(enum ntype t, int (*f)(PLAN *, FTSENT *))
1888 1.1 cgd {
1889 1.1 cgd PLAN *new;
1890 1.1 cgd
1891 1.22 mrg if ((new = malloc(sizeof(PLAN))) == NULL)
1892 1.32 drochner err(1, NULL);
1893 1.58 tacha memset(new, 0, sizeof(PLAN));
1894 1.22 mrg new->type = t;
1895 1.22 mrg new->eval = f;
1896 1.22 mrg return (new);
1897 1.1 cgd }
1898