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
|
/* $OpenBSD: gen_subs.c,v 1.29 2016/08/14 04:47:52 guenther Exp $ */
/* $NetBSD: gen_subs.c,v 1.5 1995/03/21 09:07:26 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. 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.
*/
#include <sys/types.h>
#include <sys/time.h>
#include <sys/stat.h>
#include <stdio.h>
#include <utmp.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <vis.h>
#include "pax.h"
#include "extern.h"
/*
* a collection of general purpose subroutines used by pax
*/
/*
* constants used by ls_list() when printing out archive members
*/
#define MODELEN 20
#define DATELEN 64
#define SECSPERDAY (24 * 60 * 60)
#define SIXMONTHS (SECSPERDAY * 365 / 2)
#define CURFRMT "%b %e %H:%M"
#define OLDFRMT "%b %e %Y"
#define NAME_WIDTH 8
#define TIMEFMT(t, now) \
(((t) + SIXMONTHS <= (now) || (t) > (now)) ? OLDFRMT : CURFRMT)
/*
* ls_list()
* list the members of an archive in ls format
*/
void
ls_list(ARCHD *arcn, time_t now, FILE *fp)
{
struct stat *sbp;
char f_mode[MODELEN];
char f_date[DATELEN];
int term;
term = zeroflag ? '\0' : '\n'; /* path termination character */
/*
* if not verbose, just print the file name
*/
if (!vflag) {
if (zeroflag)
(void)fputs(arcn->name, fp);
else
safe_print(arcn->name, fp);
(void)putc(term, fp);
(void)fflush(fp);
return;
}
/*
* user wants long mode
*/
sbp = &(arcn->sb);
strmode(sbp->st_mode, f_mode);
/*
* print file mode, link count, uid, gid and time
*/
if (strftime(f_date, sizeof(f_date), TIMEFMT(sbp->st_mtime, now),
localtime(&(sbp->st_mtime))) == 0)
f_date[0] = '\0';
(void)fprintf(fp, "%s%2u %-*.*s %-*.*s ", f_mode, sbp->st_nlink,
NAME_WIDTH, UT_NAMESIZE, name_uid(sbp->st_uid, 1),
NAME_WIDTH, UT_NAMESIZE, name_gid(sbp->st_gid, 1));
/*
* print device id's for devices, or sizes for other nodes
*/
if ((arcn->type == PAX_CHR) || (arcn->type == PAX_BLK))
(void)fprintf(fp, "%4lu, %4lu ",
(unsigned long)MAJOR(sbp->st_rdev),
(unsigned long)MINOR(sbp->st_rdev));
else {
(void)fprintf(fp, "%9llu ", sbp->st_size);
}
/*
* print name and link info for hard and soft links
*/
(void)fputs(f_date, fp);
(void)putc(' ', fp);
safe_print(arcn->name, fp);
if (PAX_IS_HARDLINK(arcn->type)) {
fputs(" == ", fp);
safe_print(arcn->ln_name, fp);
} else if (arcn->type == PAX_SLK) {
fputs(" -> ", fp);
safe_print(arcn->ln_name, fp);
}
(void)putc(term, fp);
(void)fflush(fp);
}
/*
* tty_ls()
* print a short summary of file to tty.
*/
void
ls_tty(ARCHD *arcn)
{
char f_date[DATELEN];
char f_mode[MODELEN];
time_t now = time(NULL);
/*
* convert time to string, and print
*/
if (strftime(f_date, DATELEN, TIMEFMT(arcn->sb.st_mtime, now),
localtime(&(arcn->sb.st_mtime))) == 0)
f_date[0] = '\0';
strmode(arcn->sb.st_mode, f_mode);
tty_prnt("%s%s %s\n", f_mode, f_date, arcn->name);
}
void
safe_print(const char *str, FILE *fp)
{
char visbuf[5];
const char *cp;
/*
* if printing to a tty, use vis(3) to print special characters.
*/
if (isatty(fileno(fp))) {
for (cp = str; *cp; cp++) {
(void)vis(visbuf, cp[0], VIS_CSTYLE, cp[1]);
(void)fputs(visbuf, fp);
}
} else {
(void)fputs(str, fp);
}
}
/*
* asc_ul()
* convert hex/octal character string into a u_long. We do not have to
* check for overflow! (the headers in all supported formats are not large
* enough to create an overflow).
* NOTE: strings passed to us are NOT TERMINATED.
* Return:
* unsigned long value
*/
u_long
asc_ul(char *str, int len, int base)
{
char *stop;
u_long tval = 0;
stop = str + len;
/*
* skip over leading blanks and zeros
*/
while ((str < stop) && ((*str == ' ') || (*str == '0')))
++str;
/*
* for each valid digit, shift running value (tval) over to next digit
* and add next digit
*/
if (base == HEX) {
while (str < stop) {
if ((*str >= '0') && (*str <= '9'))
tval = (tval << 4) + (*str++ - '0');
else if ((*str >= 'A') && (*str <= 'F'))
tval = (tval << 4) + 10 + (*str++ - 'A');
else if ((*str >= 'a') && (*str <= 'f'))
tval = (tval << 4) + 10 + (*str++ - 'a');
else
break;
}
} else {
while ((str < stop) && (*str >= '0') && (*str <= '7'))
tval = (tval << 3) + (*str++ - '0');
}
return(tval);
}
/*
* ul_asc()
* convert an unsigned long into an hex/oct ascii string. pads with LEADING
* ascii 0's to fill string completely
* NOTE: the string created is NOT TERMINATED.
*/
int
ul_asc(u_long val, char *str, int len, int base)
{
char *pt;
u_long digit;
/*
* WARNING str is not '\0' terminated by this routine
*/
pt = str + len - 1;
/*
* do a tailwise conversion (start at right most end of string to place
* least significant digit). Keep shifting until conversion value goes
* to zero (all digits were converted)
*/
if (base == HEX) {
while (pt >= str) {
if ((digit = (val & 0xf)) < 10)
*pt-- = '0' + (char)digit;
else
*pt-- = 'a' + (char)(digit - 10);
val >>= 4;
if (val == 0)
break;
}
} else {
while (pt >= str) {
*pt-- = '0' + (char)(val & 0x7);
val >>= 3;
if (val == 0)
break;
}
}
/*
* pad with leading ascii ZEROS. We return -1 if we ran out of space.
*/
while (pt >= str)
*pt-- = '0';
if (val != 0)
return(-1);
return(0);
}
/*
* asc_ull()
* Convert hex/octal character string into a unsigned long long.
* We do not have to check for overflow! (The headers in all
* supported formats are not large enough to create an overflow).
* NOTE: strings passed to us are NOT TERMINATED.
* Return:
* unsigned long long value
*/
unsigned long long
asc_ull(char *str, int len, int base)
{
char *stop;
unsigned long long tval = 0;
stop = str + len;
/*
* skip over leading blanks and zeros
*/
while ((str < stop) && ((*str == ' ') || (*str == '0')))
++str;
/*
* for each valid digit, shift running value (tval) over to next digit
* and add next digit
*/
if (base == HEX) {
while (str < stop) {
if ((*str >= '0') && (*str <= '9'))
tval = (tval << 4) + (*str++ - '0');
else if ((*str >= 'A') && (*str <= 'F'))
tval = (tval << 4) + 10 + (*str++ - 'A');
else if ((*str >= 'a') && (*str <= 'f'))
tval = (tval << 4) + 10 + (*str++ - 'a');
else
break;
}
} else {
while ((str < stop) && (*str >= '0') && (*str <= '7'))
tval = (tval << 3) + (*str++ - '0');
}
return(tval);
}
/*
* ull_asc()
* Convert an unsigned long long into a hex/oct ascii string.
* Pads with LEADING ascii 0's to fill string completely
* NOTE: the string created is NOT TERMINATED.
*/
int
ull_asc(unsigned long long val, char *str, int len, int base)
{
char *pt;
unsigned long long digit;
/*
* WARNING str is not '\0' terminated by this routine
*/
pt = str + len - 1;
/*
* do a tailwise conversion (start at right most end of string to place
* least significant digit). Keep shifting until conversion value goes
* to zero (all digits were converted)
*/
if (base == HEX) {
while (pt >= str) {
if ((digit = (val & 0xf)) < 10)
*pt-- = '0' + (char)digit;
else
*pt-- = 'a' + (char)(digit - 10);
val >>= 4;
if (val == 0)
break;
}
} else {
while (pt >= str) {
*pt-- = '0' + (char)(val & 0x7);
val >>= 3;
if (val == 0)
break;
}
}
/*
* pad with leading ascii ZEROS. We return -1 if we ran out of space.
*/
while (pt >= str)
*pt-- = '0';
if (val != 0)
return(-1);
return(0);
}
/*
* Copy at max min(bufz, fieldsz) chars from field to buf, stopping
* at the first NUL char. NUL terminate buf if there is room left.
*/
size_t
fieldcpy(char *buf, size_t bufsz, const char *field, size_t fieldsz)
{
char *p = buf;
const char *q = field;
size_t i = 0;
if (fieldsz > bufsz)
fieldsz = bufsz;
while (i < fieldsz && *q != '\0') {
*p++ = *q++;
i++;
}
if (i < bufsz)
*p = '\0';
return(i);
}
|