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