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