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