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