sel_subs.c revision 1.7 1 1.7 christos /* $NetBSD: sel_subs.c,v 1.7 1997/07/20 20:32:43 christos Exp $ */
2 1.5 cgd
3 1.1 jtc /*-
4 1.1 jtc * Copyright (c) 1992 Keith Muller.
5 1.1 jtc * Copyright (c) 1992, 1993
6 1.1 jtc * The Regents of the University of California. All rights reserved.
7 1.1 jtc *
8 1.1 jtc * This code is derived from software contributed to Berkeley by
9 1.1 jtc * Keith Muller of the University of California, San Diego.
10 1.1 jtc *
11 1.1 jtc * Redistribution and use in source and binary forms, with or without
12 1.1 jtc * modification, are permitted provided that the following conditions
13 1.1 jtc * are met:
14 1.1 jtc * 1. Redistributions of source code must retain the above copyright
15 1.1 jtc * notice, this list of conditions and the following disclaimer.
16 1.1 jtc * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 jtc * notice, this list of conditions and the following disclaimer in the
18 1.1 jtc * documentation and/or other materials provided with the distribution.
19 1.1 jtc * 3. All advertising materials mentioning features or use of this software
20 1.1 jtc * must display the following acknowledgement:
21 1.1 jtc * This product includes software developed by the University of
22 1.1 jtc * California, Berkeley and its contributors.
23 1.1 jtc * 4. Neither the name of the University nor the names of its contributors
24 1.1 jtc * may be used to endorse or promote products derived from this software
25 1.1 jtc * without specific prior written permission.
26 1.1 jtc *
27 1.1 jtc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 1.1 jtc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 1.1 jtc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 1.1 jtc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 1.1 jtc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 1.1 jtc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 1.1 jtc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 1.1 jtc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 1.1 jtc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 1.1 jtc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 1.1 jtc * SUCH DAMAGE.
38 1.1 jtc */
39 1.1 jtc
40 1.7 christos #include <sys/cdefs.h>
41 1.1 jtc #ifndef lint
42 1.5 cgd #if 0
43 1.5 cgd static char sccsid[] = "@(#)sel_subs.c 8.1 (Berkeley) 5/31/93";
44 1.5 cgd #else
45 1.7 christos __RCSID("$NetBSD: sel_subs.c,v 1.7 1997/07/20 20:32:43 christos Exp $");
46 1.5 cgd #endif
47 1.1 jtc #endif /* not lint */
48 1.1 jtc
49 1.1 jtc #include <sys/types.h>
50 1.1 jtc #include <sys/time.h>
51 1.1 jtc #include <sys/stat.h>
52 1.1 jtc #include <sys/param.h>
53 1.1 jtc #include <pwd.h>
54 1.1 jtc #include <grp.h>
55 1.1 jtc #include <stdio.h>
56 1.1 jtc #include <ctype.h>
57 1.1 jtc #include <string.h>
58 1.1 jtc #include <strings.h>
59 1.1 jtc #include <unistd.h>
60 1.1 jtc #include <stdlib.h>
61 1.1 jtc #include "pax.h"
62 1.1 jtc #include "sel_subs.h"
63 1.1 jtc #include "extern.h"
64 1.1 jtc
65 1.6 tls static int str_sec __P((char *, time_t *));
66 1.6 tls static int usr_match __P((ARCHD *));
67 1.6 tls static int grp_match __P((ARCHD *));
68 1.6 tls static int trng_match __P((ARCHD *));
69 1.1 jtc
70 1.1 jtc static TIME_RNG *trhead = NULL; /* time range list head */
71 1.1 jtc static TIME_RNG *trtail = NULL; /* time range list tail */
72 1.1 jtc static USRT **usrtb = NULL; /* user selection table */
73 1.1 jtc static GRPT **grptb = NULL; /* group selection table */
74 1.1 jtc
75 1.1 jtc /*
76 1.1 jtc * Routines for selection of archive members
77 1.1 jtc */
78 1.1 jtc
79 1.1 jtc /*
80 1.1 jtc * sel_chk()
81 1.1 jtc * check if this file matches a specfied uid, gid or time range
82 1.1 jtc * Return:
83 1.1 jtc * 0 if this archive member should be processed, 1 if it should be skipped
84 1.1 jtc */
85 1.1 jtc
86 1.1 jtc #if __STDC__
87 1.1 jtc int
88 1.6 tls sel_chk(ARCHD *arcn)
89 1.1 jtc #else
90 1.1 jtc int
91 1.1 jtc sel_chk(arcn)
92 1.6 tls ARCHD *arcn;
93 1.1 jtc #endif
94 1.1 jtc {
95 1.1 jtc if (((usrtb != NULL) && usr_match(arcn)) ||
96 1.1 jtc ((grptb != NULL) && grp_match(arcn)) ||
97 1.1 jtc ((trhead != NULL) && trng_match(arcn)))
98 1.1 jtc return(1);
99 1.1 jtc return(0);
100 1.1 jtc }
101 1.1 jtc
102 1.1 jtc /*
103 1.1 jtc * User/group selection routines
104 1.1 jtc *
105 1.1 jtc * Routines to handle user selection of files based on the file uid/gid. To
106 1.1 jtc * add an entry, the user supplies either then name or the uid/gid starting with
107 1.1 jtc * a # on the command line. A \# will eascape the #.
108 1.1 jtc */
109 1.1 jtc
110 1.1 jtc /*
111 1.1 jtc * usr_add()
112 1.1 jtc * add a user match to the user match hash table
113 1.1 jtc * Return:
114 1.1 jtc * 0 if added ok, -1 otherwise;
115 1.1 jtc */
116 1.1 jtc
117 1.1 jtc #if __STDC__
118 1.1 jtc int
119 1.6 tls usr_add(char *str)
120 1.1 jtc #else
121 1.1 jtc int
122 1.1 jtc usr_add(str)
123 1.6 tls char *str;
124 1.1 jtc #endif
125 1.1 jtc {
126 1.6 tls u_int indx;
127 1.6 tls USRT *pt;
128 1.6 tls struct passwd *pw;
129 1.6 tls uid_t uid;
130 1.1 jtc
131 1.1 jtc /*
132 1.1 jtc * create the table if it doesn't exist
133 1.1 jtc */
134 1.1 jtc if ((str == NULL) || (*str == '\0'))
135 1.1 jtc return(-1);
136 1.1 jtc if ((usrtb == NULL) &&
137 1.1 jtc ((usrtb = (USRT **)calloc(USR_TB_SZ, sizeof(USRT *))) == NULL)) {
138 1.7 christos tty_warn(1,
139 1.7 christos "Unable to allocate memory for user selection table");
140 1.1 jtc return(-1);
141 1.1 jtc }
142 1.1 jtc
143 1.1 jtc /*
144 1.1 jtc * figure out user spec
145 1.1 jtc */
146 1.1 jtc if (str[0] != '#') {
147 1.1 jtc /*
148 1.1 jtc * it is a user name, \# escapes # as first char in user name
149 1.1 jtc */
150 1.1 jtc if ((str[0] == '\\') && (str[1] == '#'))
151 1.1 jtc ++str;
152 1.1 jtc if ((pw = getpwnam(str)) == NULL) {
153 1.7 christos tty_warn(1, "Unable to find uid for user: %s", str);
154 1.1 jtc return(-1);
155 1.1 jtc }
156 1.1 jtc uid = (uid_t)pw->pw_uid;
157 1.1 jtc } else
158 1.1 jtc # ifdef NET2_STAT
159 1.1 jtc uid = (uid_t)atoi(str+1);
160 1.1 jtc # else
161 1.1 jtc uid = (uid_t)strtoul(str+1, (char **)NULL, 10);
162 1.1 jtc # endif
163 1.1 jtc endpwent();
164 1.1 jtc
165 1.1 jtc /*
166 1.1 jtc * hash it and go down the hash chain (if any) looking for it
167 1.1 jtc */
168 1.1 jtc indx = ((unsigned)uid) % USR_TB_SZ;
169 1.1 jtc if ((pt = usrtb[indx]) != NULL) {
170 1.1 jtc while (pt != NULL) {
171 1.1 jtc if (pt->uid == uid)
172 1.1 jtc return(0);
173 1.1 jtc pt = pt->fow;
174 1.1 jtc }
175 1.1 jtc }
176 1.1 jtc
177 1.1 jtc /*
178 1.1 jtc * uid is not yet in the table, add it to the front of the chain
179 1.1 jtc */
180 1.1 jtc if ((pt = (USRT *)malloc(sizeof(USRT))) != NULL) {
181 1.1 jtc pt->uid = uid;
182 1.1 jtc pt->fow = usrtb[indx];
183 1.1 jtc usrtb[indx] = pt;
184 1.1 jtc return(0);
185 1.1 jtc }
186 1.7 christos tty_warn(1, "User selection table out of memory");
187 1.1 jtc return(-1);
188 1.1 jtc }
189 1.1 jtc
190 1.1 jtc /*
191 1.1 jtc * usr_match()
192 1.1 jtc * check if this files uid matches a selected uid.
193 1.1 jtc * Return:
194 1.1 jtc * 0 if this archive member should be processed, 1 if it should be skipped
195 1.1 jtc */
196 1.1 jtc
197 1.1 jtc #if __STDC__
198 1.1 jtc static int
199 1.6 tls usr_match(ARCHD *arcn)
200 1.1 jtc #else
201 1.1 jtc static int
202 1.1 jtc usr_match(arcn)
203 1.6 tls ARCHD *arcn;
204 1.1 jtc #endif
205 1.1 jtc {
206 1.6 tls USRT *pt;
207 1.1 jtc
208 1.1 jtc /*
209 1.1 jtc * hash and look for it in the table
210 1.1 jtc */
211 1.1 jtc pt = usrtb[((unsigned)arcn->sb.st_uid) % USR_TB_SZ];
212 1.1 jtc while (pt != NULL) {
213 1.1 jtc if (pt->uid == arcn->sb.st_uid)
214 1.1 jtc return(0);
215 1.1 jtc pt = pt->fow;
216 1.1 jtc }
217 1.1 jtc
218 1.1 jtc /*
219 1.1 jtc * not found
220 1.1 jtc */
221 1.1 jtc return(1);
222 1.1 jtc }
223 1.1 jtc
224 1.1 jtc /*
225 1.1 jtc * grp_add()
226 1.1 jtc * add a group match to the group match hash table
227 1.1 jtc * Return:
228 1.1 jtc * 0 if added ok, -1 otherwise;
229 1.1 jtc */
230 1.1 jtc
231 1.1 jtc #if __STDC__
232 1.1 jtc int
233 1.6 tls grp_add(char *str)
234 1.1 jtc #else
235 1.1 jtc int
236 1.1 jtc grp_add(str)
237 1.6 tls char *str;
238 1.1 jtc #endif
239 1.1 jtc {
240 1.6 tls u_int indx;
241 1.6 tls GRPT *pt;
242 1.6 tls struct group *gr;
243 1.6 tls gid_t gid;
244 1.1 jtc
245 1.1 jtc /*
246 1.1 jtc * create the table if it doesn't exist
247 1.1 jtc */
248 1.1 jtc if ((str == NULL) || (*str == '\0'))
249 1.1 jtc return(-1);
250 1.1 jtc if ((grptb == NULL) &&
251 1.1 jtc ((grptb = (GRPT **)calloc(GRP_TB_SZ, sizeof(GRPT *))) == NULL)) {
252 1.7 christos tty_warn(1,
253 1.7 christos "Unable to allocate memory fo group selection table");
254 1.1 jtc return(-1);
255 1.1 jtc }
256 1.1 jtc
257 1.1 jtc /*
258 1.1 jtc * figure out user spec
259 1.1 jtc */
260 1.1 jtc if (str[0] != '#') {
261 1.1 jtc /*
262 1.1 jtc * it is a group name, \# escapes # as first char in group name
263 1.1 jtc */
264 1.1 jtc if ((str[0] == '\\') && (str[1] == '#'))
265 1.1 jtc ++str;
266 1.1 jtc if ((gr = getgrnam(str)) == NULL) {
267 1.7 christos tty_warn(1,
268 1.7 christos "Cannot determine gid for group name: %s", str);
269 1.1 jtc return(-1);
270 1.1 jtc }
271 1.1 jtc gid = (gid_t)gr->gr_gid;
272 1.1 jtc } else
273 1.1 jtc # ifdef NET2_STAT
274 1.1 jtc gid = (gid_t)atoi(str+1);
275 1.1 jtc # else
276 1.1 jtc gid = (gid_t)strtoul(str+1, (char **)NULL, 10);
277 1.1 jtc # endif
278 1.1 jtc endgrent();
279 1.1 jtc
280 1.1 jtc /*
281 1.1 jtc * hash it and go down the hash chain (if any) looking for it
282 1.1 jtc */
283 1.1 jtc indx = ((unsigned)gid) % GRP_TB_SZ;
284 1.1 jtc if ((pt = grptb[indx]) != NULL) {
285 1.1 jtc while (pt != NULL) {
286 1.1 jtc if (pt->gid == gid)
287 1.1 jtc return(0);
288 1.1 jtc pt = pt->fow;
289 1.1 jtc }
290 1.1 jtc }
291 1.1 jtc
292 1.1 jtc /*
293 1.1 jtc * gid not in the table, add it to the front of the chain
294 1.1 jtc */
295 1.1 jtc if ((pt = (GRPT *)malloc(sizeof(GRPT))) != NULL) {
296 1.1 jtc pt->gid = gid;
297 1.1 jtc pt->fow = grptb[indx];
298 1.1 jtc grptb[indx] = pt;
299 1.1 jtc return(0);
300 1.1 jtc }
301 1.7 christos tty_warn(1, "Group selection table out of memory");
302 1.1 jtc return(-1);
303 1.1 jtc }
304 1.1 jtc
305 1.1 jtc /*
306 1.1 jtc * grp_match()
307 1.1 jtc * check if this files gid matches a selected gid.
308 1.1 jtc * Return:
309 1.1 jtc * 0 if this archive member should be processed, 1 if it should be skipped
310 1.1 jtc */
311 1.1 jtc
312 1.1 jtc #if __STDC__
313 1.1 jtc static int
314 1.6 tls grp_match(ARCHD *arcn)
315 1.1 jtc #else
316 1.1 jtc static int
317 1.1 jtc grp_match(arcn)
318 1.6 tls ARCHD *arcn;
319 1.1 jtc #endif
320 1.1 jtc {
321 1.6 tls GRPT *pt;
322 1.1 jtc
323 1.1 jtc /*
324 1.1 jtc * hash and look for it in the table
325 1.1 jtc */
326 1.1 jtc pt = grptb[((unsigned)arcn->sb.st_gid) % GRP_TB_SZ];
327 1.1 jtc while (pt != NULL) {
328 1.1 jtc if (pt->gid == arcn->sb.st_gid)
329 1.1 jtc return(0);
330 1.1 jtc pt = pt->fow;
331 1.1 jtc }
332 1.1 jtc
333 1.1 jtc /*
334 1.1 jtc * not found
335 1.1 jtc */
336 1.1 jtc return(1);
337 1.1 jtc }
338 1.1 jtc
339 1.1 jtc /*
340 1.1 jtc * Time range selection routines
341 1.1 jtc *
342 1.1 jtc * Routines to handle user selection of files based on the modification and/or
343 1.1 jtc * inode change time falling within a specified time range (the non-standard
344 1.1 jtc * -T flag). The user may specify any number of different file time ranges.
345 1.1 jtc * Time ranges are checked one at a time until a match is found (if at all).
346 1.1 jtc * If the file has a mtime (and/or ctime) which lies within one of the time
347 1.1 jtc * ranges, the file is selected. Time ranges may have a lower and/or a upper
348 1.1 jtc * value. These ranges are inclusive. When no time ranges are supplied to pax
349 1.1 jtc * with the -T option, all members in the archive will be selected by the time
350 1.1 jtc * range routines. When only a lower range is supplied, only files with a
351 1.1 jtc * mtime (and/or ctime) equal to or younger are selected. When only a upper
352 1.1 jtc * range is supplied, only files with a mtime (and/or ctime) equal to or older
353 1.1 jtc * are selected. When the lower time range is equal to the upper time range,
354 1.1 jtc * only files with a mtime (or ctime) of exactly that time are selected.
355 1.1 jtc */
356 1.1 jtc
357 1.1 jtc /*
358 1.1 jtc * trng_add()
359 1.1 jtc * add a time range match to the time range list.
360 1.1 jtc * This is a non-standard pax option. Lower and upper ranges are in the
361 1.1 jtc * format: [yy[mm[dd[hh]]]]mm[.ss] and are comma separated.
362 1.1 jtc * Time ranges are based on current time, so 1234 would specify a time of
363 1.1 jtc * 12:34 today.
364 1.1 jtc * Return:
365 1.1 jtc * 0 if the time range was added to the list, -1 otherwise
366 1.1 jtc */
367 1.1 jtc
368 1.1 jtc #if __STDC__
369 1.1 jtc int
370 1.6 tls trng_add(char *str)
371 1.1 jtc #else
372 1.1 jtc int
373 1.1 jtc trng_add(str)
374 1.6 tls char *str;
375 1.1 jtc #endif
376 1.1 jtc {
377 1.6 tls TIME_RNG *pt;
378 1.6 tls char *up_pt = NULL;
379 1.6 tls char *stpt;
380 1.6 tls char *flgpt;
381 1.6 tls int dot = 0;
382 1.1 jtc
383 1.1 jtc /*
384 1.1 jtc * throw out the badly formed time ranges
385 1.1 jtc */
386 1.1 jtc if ((str == NULL) || (*str == '\0')) {
387 1.7 christos tty_warn(1, "Empty time range string");
388 1.1 jtc return(-1);
389 1.1 jtc }
390 1.1 jtc
391 1.1 jtc /*
392 1.1 jtc * locate optional flags suffix /{cm}.
393 1.1 jtc */
394 1.4 mycroft if ((flgpt = strrchr(str, '/')) != NULL)
395 1.1 jtc *flgpt++ = '\0';
396 1.1 jtc
397 1.1 jtc for (stpt = str; *stpt != '\0'; ++stpt) {
398 1.1 jtc if ((*stpt >= '0') && (*stpt <= '9'))
399 1.1 jtc continue;
400 1.1 jtc if ((*stpt == ',') && (up_pt == NULL)) {
401 1.1 jtc *stpt = '\0';
402 1.1 jtc up_pt = stpt + 1;
403 1.1 jtc dot = 0;
404 1.1 jtc continue;
405 1.1 jtc }
406 1.1 jtc
407 1.1 jtc /*
408 1.1 jtc * allow only one dot per range (secs)
409 1.1 jtc */
410 1.1 jtc if ((*stpt == '.') && (!dot)) {
411 1.1 jtc ++dot;
412 1.1 jtc continue;
413 1.1 jtc }
414 1.7 christos tty_warn(1, "Improperly specified time range: %s", str);
415 1.1 jtc goto out;
416 1.1 jtc }
417 1.1 jtc
418 1.1 jtc /*
419 1.1 jtc * allocate space for the time range and store the limits
420 1.1 jtc */
421 1.1 jtc if ((pt = (TIME_RNG *)malloc(sizeof(TIME_RNG))) == NULL) {
422 1.7 christos tty_warn(1, "Unable to allocate memory for time range");
423 1.1 jtc return(-1);
424 1.1 jtc }
425 1.1 jtc
426 1.1 jtc /*
427 1.1 jtc * by default we only will check file mtime, but usee can specify
428 1.1 jtc * mtime, ctime (inode change time) or both.
429 1.1 jtc */
430 1.1 jtc if ((flgpt == NULL) || (*flgpt == '\0'))
431 1.1 jtc pt->flgs = CMPMTME;
432 1.1 jtc else {
433 1.1 jtc pt->flgs = 0;
434 1.1 jtc while (*flgpt != '\0') {
435 1.1 jtc switch(*flgpt) {
436 1.1 jtc case 'M':
437 1.1 jtc case 'm':
438 1.1 jtc pt->flgs |= CMPMTME;
439 1.1 jtc break;
440 1.1 jtc case 'C':
441 1.1 jtc case 'c':
442 1.1 jtc pt->flgs |= CMPCTME;
443 1.1 jtc break;
444 1.1 jtc default:
445 1.7 christos tty_warn(1, "Bad option %c with time range %s",
446 1.1 jtc *flgpt, str);
447 1.1 jtc goto out;
448 1.1 jtc }
449 1.1 jtc ++flgpt;
450 1.1 jtc }
451 1.1 jtc }
452 1.1 jtc
453 1.1 jtc /*
454 1.1 jtc * start off with the current time
455 1.1 jtc */
456 1.1 jtc pt->low_time = pt->high_time = time((time_t *)NULL);
457 1.1 jtc if (*str != '\0') {
458 1.1 jtc /*
459 1.1 jtc * add lower limit
460 1.1 jtc */
461 1.1 jtc if (str_sec(str, &(pt->low_time)) < 0) {
462 1.7 christos tty_warn(1, "Illegal lower time range %s", str);
463 1.1 jtc (void)free((char *)pt);
464 1.1 jtc goto out;
465 1.1 jtc }
466 1.1 jtc pt->flgs |= HASLOW;
467 1.1 jtc }
468 1.1 jtc
469 1.1 jtc if ((up_pt != NULL) && (*up_pt != '\0')) {
470 1.1 jtc /*
471 1.1 jtc * add upper limit
472 1.1 jtc */
473 1.1 jtc if (str_sec(up_pt, &(pt->high_time)) < 0) {
474 1.7 christos tty_warn(1, "Illegal upper time range %s", up_pt);
475 1.1 jtc (void)free((char *)pt);
476 1.1 jtc goto out;
477 1.1 jtc }
478 1.1 jtc pt->flgs |= HASHIGH;
479 1.1 jtc
480 1.1 jtc /*
481 1.1 jtc * check that the upper and lower do not overlap
482 1.1 jtc */
483 1.1 jtc if (pt->flgs & HASLOW) {
484 1.1 jtc if (pt->low_time > pt->high_time) {
485 1.7 christos tty_warn(1,
486 1.7 christos "Upper %s and lower %s time overlap",
487 1.7 christos up_pt, str);
488 1.1 jtc (void)free((char *)pt);
489 1.1 jtc return(-1);
490 1.1 jtc }
491 1.1 jtc }
492 1.1 jtc }
493 1.1 jtc
494 1.1 jtc pt->fow = NULL;
495 1.1 jtc if (trhead == NULL) {
496 1.1 jtc trtail = trhead = pt;
497 1.1 jtc return(0);
498 1.1 jtc }
499 1.1 jtc trtail->fow = pt;
500 1.1 jtc trtail = pt;
501 1.1 jtc return(0);
502 1.1 jtc
503 1.1 jtc out:
504 1.7 christos tty_warn(1, "Time range format is: [yy[mm[dd[hh]]]]mm[.ss][/[c][m]]");
505 1.1 jtc return(-1);
506 1.1 jtc }
507 1.1 jtc
508 1.1 jtc /*
509 1.1 jtc * trng_match()
510 1.1 jtc * check if this files mtime/ctime falls within any supplied time range.
511 1.1 jtc * Return:
512 1.1 jtc * 0 if this archive member should be processed, 1 if it should be skipped
513 1.1 jtc */
514 1.1 jtc
515 1.1 jtc #if __STDC__
516 1.1 jtc static int
517 1.6 tls trng_match(ARCHD *arcn)
518 1.1 jtc #else
519 1.1 jtc static int
520 1.1 jtc trng_match(arcn)
521 1.6 tls ARCHD *arcn;
522 1.1 jtc #endif
523 1.1 jtc {
524 1.6 tls TIME_RNG *pt;
525 1.1 jtc
526 1.1 jtc /*
527 1.1 jtc * have to search down the list one at a time looking for a match.
528 1.1 jtc * remember time range limits are inclusive.
529 1.1 jtc */
530 1.1 jtc pt = trhead;
531 1.1 jtc while (pt != NULL) {
532 1.1 jtc switch(pt->flgs & CMPBOTH) {
533 1.1 jtc case CMPBOTH:
534 1.1 jtc /*
535 1.1 jtc * user wants both mtime and ctime checked for this
536 1.1 jtc * time range
537 1.1 jtc */
538 1.1 jtc if (((pt->flgs & HASLOW) &&
539 1.1 jtc (arcn->sb.st_mtime < pt->low_time) &&
540 1.1 jtc (arcn->sb.st_ctime < pt->low_time)) ||
541 1.1 jtc ((pt->flgs & HASHIGH) &&
542 1.1 jtc (arcn->sb.st_mtime > pt->high_time) &&
543 1.1 jtc (arcn->sb.st_ctime > pt->high_time))) {
544 1.1 jtc pt = pt->fow;
545 1.1 jtc continue;
546 1.1 jtc }
547 1.1 jtc break;
548 1.1 jtc case CMPCTME:
549 1.1 jtc /*
550 1.1 jtc * user wants only ctime checked for this time range
551 1.1 jtc */
552 1.1 jtc if (((pt->flgs & HASLOW) &&
553 1.1 jtc (arcn->sb.st_ctime < pt->low_time)) ||
554 1.1 jtc ((pt->flgs & HASHIGH) &&
555 1.1 jtc (arcn->sb.st_ctime > pt->high_time))) {
556 1.1 jtc pt = pt->fow;
557 1.1 jtc continue;
558 1.1 jtc }
559 1.1 jtc break;
560 1.1 jtc case CMPMTME:
561 1.1 jtc default:
562 1.1 jtc /*
563 1.1 jtc * user wants only mtime checked for this time range
564 1.1 jtc */
565 1.1 jtc if (((pt->flgs & HASLOW) &&
566 1.1 jtc (arcn->sb.st_mtime < pt->low_time)) ||
567 1.1 jtc ((pt->flgs & HASHIGH) &&
568 1.1 jtc (arcn->sb.st_mtime > pt->high_time))) {
569 1.1 jtc pt = pt->fow;
570 1.1 jtc continue;
571 1.1 jtc }
572 1.1 jtc break;
573 1.1 jtc }
574 1.1 jtc break;
575 1.1 jtc }
576 1.1 jtc
577 1.1 jtc if (pt == NULL)
578 1.1 jtc return(1);
579 1.1 jtc return(0);
580 1.1 jtc }
581 1.1 jtc
582 1.1 jtc /*
583 1.1 jtc * str_sec()
584 1.1 jtc * Convert a time string in the format of [yy[mm[dd[hh]]]]mm[.ss] to gmt
585 1.1 jtc * seconds. Tval already has current time loaded into it at entry.
586 1.1 jtc * Return:
587 1.1 jtc * 0 if converted ok, -1 otherwise
588 1.1 jtc */
589 1.1 jtc
590 1.1 jtc #if __STDC__
591 1.1 jtc static int
592 1.6 tls str_sec(char *str, time_t *tval)
593 1.1 jtc #else
594 1.1 jtc static int
595 1.1 jtc str_sec(str, tval)
596 1.6 tls char *str;
597 1.1 jtc time_t *tval;
598 1.1 jtc #endif
599 1.1 jtc {
600 1.6 tls struct tm *lt;
601 1.6 tls char *dot = NULL;
602 1.1 jtc
603 1.1 jtc lt = localtime(tval);
604 1.4 mycroft if ((dot = strchr(str, '.')) != NULL) {
605 1.1 jtc /*
606 1.1 jtc * seconds (.ss)
607 1.1 jtc */
608 1.1 jtc *dot++ = '\0';
609 1.1 jtc if (strlen(dot) != 2)
610 1.1 jtc return(-1);
611 1.1 jtc if ((lt->tm_sec = ATOI2(dot)) > 61)
612 1.1 jtc return(-1);
613 1.1 jtc } else
614 1.1 jtc lt->tm_sec = 0;
615 1.1 jtc
616 1.1 jtc switch (strlen(str)) {
617 1.1 jtc case 10:
618 1.1 jtc /*
619 1.1 jtc * year (yy)
620 1.1 jtc * watch out for year 2000
621 1.1 jtc */
622 1.1 jtc if ((lt->tm_year = ATOI2(str)) < 69)
623 1.1 jtc lt->tm_year += 100;
624 1.1 jtc str += 2;
625 1.1 jtc /* FALLTHROUGH */
626 1.1 jtc case 8:
627 1.1 jtc /*
628 1.1 jtc * month (mm)
629 1.1 jtc * watch out months are from 0 - 11 internally
630 1.1 jtc */
631 1.1 jtc if ((lt->tm_mon = ATOI2(str)) > 12)
632 1.1 jtc return(-1);
633 1.1 jtc --lt->tm_mon;
634 1.1 jtc str += 2;
635 1.1 jtc /* FALLTHROUGH */
636 1.1 jtc case 6:
637 1.1 jtc /*
638 1.1 jtc * day (dd)
639 1.1 jtc */
640 1.1 jtc if ((lt->tm_mday = ATOI2(str)) > 31)
641 1.1 jtc return(-1);
642 1.1 jtc str += 2;
643 1.1 jtc /* FALLTHROUGH */
644 1.1 jtc case 4:
645 1.1 jtc /*
646 1.1 jtc * hour (hh)
647 1.1 jtc */
648 1.1 jtc if ((lt->tm_hour = ATOI2(str)) > 23)
649 1.1 jtc return(-1);
650 1.1 jtc str += 2;
651 1.1 jtc /* FALLTHROUGH */
652 1.1 jtc case 2:
653 1.1 jtc /*
654 1.1 jtc * minute (mm)
655 1.1 jtc */
656 1.1 jtc if ((lt->tm_min = ATOI2(str)) > 59)
657 1.1 jtc return(-1);
658 1.1 jtc break;
659 1.1 jtc default:
660 1.1 jtc return(-1);
661 1.1 jtc }
662 1.1 jtc /*
663 1.1 jtc * convert broken-down time to GMT clock time seconds
664 1.1 jtc */
665 1.1 jtc if ((*tval = mktime(lt)) == -1)
666 1.1 jtc return(-1);
667 1.1 jtc return(0);
668 1.1 jtc }
669