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