gen_subs.c revision 1.24 1 1.24 wiz /* $NetBSD: gen_subs.c,v 1.24 2002/08/01 18:41:34 wiz 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.23 tv #if defined(__RCSID) && !defined(lint)
42 1.5 cgd #if 0
43 1.5 cgd static char sccsid[] = "@(#)gen_subs.c 8.1 (Berkeley) 5/31/93";
44 1.5 cgd #else
45 1.24 wiz __RCSID("$NetBSD: gen_subs.c,v 1.24 2002/08/01 18:41:34 wiz 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.13 mycroft
54 1.13 mycroft #include <ctype.h>
55 1.13 mycroft #include <grp.h>
56 1.13 mycroft #include <pwd.h>
57 1.1 jtc #include <stdio.h>
58 1.13 mycroft #include <stdlib.h>
59 1.13 mycroft #include <string.h>
60 1.10 kleink #include <time.h>
61 1.1 jtc #include <tzfile.h>
62 1.13 mycroft #include <unistd.h>
63 1.13 mycroft
64 1.1 jtc #include "pax.h"
65 1.1 jtc #include "extern.h"
66 1.1 jtc
67 1.1 jtc /*
68 1.1 jtc * a collection of general purpose subroutines used by pax
69 1.1 jtc */
70 1.1 jtc
71 1.1 jtc /*
72 1.1 jtc * constants used by ls_list() when printing out archive members
73 1.1 jtc */
74 1.1 jtc #define MODELEN 20
75 1.1 jtc #define DATELEN 64
76 1.1 jtc #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY)
77 1.1 jtc #define CURFRMT "%b %e %H:%M"
78 1.1 jtc #define OLDFRMT "%b %e %Y"
79 1.1 jtc #ifndef UT_NAMESIZE
80 1.1 jtc #define UT_NAMESIZE 8
81 1.1 jtc #endif
82 1.1 jtc #define UT_GRPSIZE 6
83 1.1 jtc
84 1.1 jtc /*
85 1.1 jtc * ls_list()
86 1.1 jtc * list the members of an archive in ls format
87 1.1 jtc */
88 1.1 jtc
89 1.1 jtc void
90 1.6 tls ls_list(ARCHD *arcn, time_t now)
91 1.1 jtc {
92 1.6 tls struct stat *sbp;
93 1.1 jtc char f_mode[MODELEN];
94 1.1 jtc char f_date[DATELEN];
95 1.13 mycroft const char *timefrmt, *user, *group;
96 1.1 jtc
97 1.1 jtc /*
98 1.1 jtc * if not verbose, just print the file name
99 1.1 jtc */
100 1.1 jtc if (!vflag) {
101 1.1 jtc (void)printf("%s\n", arcn->name);
102 1.1 jtc (void)fflush(stdout);
103 1.1 jtc return;
104 1.1 jtc }
105 1.1 jtc
106 1.1 jtc /*
107 1.1 jtc * user wants long mode
108 1.1 jtc */
109 1.1 jtc sbp = &(arcn->sb);
110 1.1 jtc strmode(sbp->st_mode, f_mode);
111 1.1 jtc
112 1.19 kleink /*
113 1.19 kleink * time format based on age compared to the time pax was started.
114 1.19 kleink */
115 1.19 kleink if ((sbp->st_mtime + SIXMONTHS) <= now)
116 1.19 kleink timefrmt = OLDFRMT;
117 1.19 kleink else
118 1.19 kleink timefrmt = CURFRMT;
119 1.1 jtc
120 1.1 jtc /*
121 1.1 jtc * print file mode, link count, uid, gid and time
122 1.1 jtc */
123 1.1 jtc if (strftime(f_date,DATELEN,timefrmt,localtime(&(sbp->st_mtime))) == 0)
124 1.1 jtc f_date[0] = '\0';
125 1.13 mycroft user = user_from_uid(sbp->st_uid, 0);
126 1.13 mycroft group = group_from_gid(sbp->st_gid, 0);
127 1.14 christos (void)printf("%s%2lu %-*s %-*s ", f_mode, (unsigned long)sbp->st_nlink,
128 1.13 mycroft UT_NAMESIZE, user ? user : "", UT_GRPSIZE, group ? group : "");
129 1.1 jtc
130 1.1 jtc /*
131 1.1 jtc * print device id's for devices, or sizes for other nodes
132 1.1 jtc */
133 1.1 jtc if ((arcn->type == PAX_CHR) || (arcn->type == PAX_BLK))
134 1.7 christos (void)printf("%4lu,%4lu ", (long) MAJOR(sbp->st_rdev),
135 1.7 christos (long) MINOR(sbp->st_rdev));
136 1.1 jtc else {
137 1.21 lukem (void)printf(OFFT_FP("9") " ", (OFFT_T)sbp->st_size);
138 1.1 jtc }
139 1.1 jtc
140 1.1 jtc /*
141 1.1 jtc * print name and link info for hard and soft links
142 1.1 jtc */
143 1.1 jtc (void)printf("%s %s", f_date, arcn->name);
144 1.1 jtc if ((arcn->type == PAX_HLK) || (arcn->type == PAX_HRG))
145 1.1 jtc (void)printf(" == %s\n", arcn->ln_name);
146 1.1 jtc else if (arcn->type == PAX_SLK)
147 1.1 jtc (void)printf(" => %s\n", arcn->ln_name);
148 1.1 jtc else
149 1.1 jtc (void)putchar('\n');
150 1.1 jtc (void)fflush(stdout);
151 1.1 jtc return;
152 1.1 jtc }
153 1.1 jtc
154 1.1 jtc /*
155 1.1 jtc * tty_ls()
156 1.17 itohy * print a short summary of file to tty.
157 1.1 jtc */
158 1.1 jtc
159 1.1 jtc void
160 1.6 tls ls_tty(ARCHD *arcn)
161 1.1 jtc {
162 1.1 jtc char f_date[DATELEN];
163 1.1 jtc char f_mode[MODELEN];
164 1.12 mycroft const char *timefrmt;
165 1.1 jtc
166 1.19 kleink if ((arcn->sb.st_mtime + SIXMONTHS) <= time((time_t *)NULL))
167 1.19 kleink timefrmt = OLDFRMT;
168 1.19 kleink else
169 1.19 kleink timefrmt = CURFRMT;
170 1.1 jtc
171 1.1 jtc /*
172 1.1 jtc * convert time to string, and print
173 1.1 jtc */
174 1.1 jtc if (strftime(f_date, DATELEN, timefrmt,
175 1.1 jtc localtime(&(arcn->sb.st_mtime))) == 0)
176 1.1 jtc f_date[0] = '\0';
177 1.1 jtc strmode(arcn->sb.st_mode, f_mode);
178 1.1 jtc tty_prnt("%s%s %s\n", f_mode, f_date, arcn->name);
179 1.1 jtc return;
180 1.1 jtc }
181 1.1 jtc
182 1.1 jtc /*
183 1.1 jtc * zf_strncpy()
184 1.1 jtc * copy src to dest up to len chars (stopping at first '\0'), when src is
185 1.17 itohy * shorter than len, pads to len with '\0'. big performance win (and
186 1.1 jtc * a lot easier to code) over strncpy(), then a strlen() then a
187 1.4 mycroft * memset(). (or doing the memset() first).
188 1.1 jtc */
189 1.1 jtc
190 1.1 jtc void
191 1.11 mycroft zf_strncpy(char *dest, const char *src, int len)
192 1.1 jtc {
193 1.6 tls char *stop;
194 1.1 jtc
195 1.1 jtc stop = dest + len;
196 1.1 jtc while ((dest < stop) && (*src != '\0'))
197 1.1 jtc *dest++ = *src++;
198 1.1 jtc while (dest < stop)
199 1.1 jtc *dest++ = '\0';
200 1.1 jtc return;
201 1.1 jtc }
202 1.1 jtc
203 1.1 jtc /*
204 1.1 jtc * l_strncpy()
205 1.1 jtc * copy src to dest up to len chars (stopping at first '\0')
206 1.1 jtc * Return:
207 1.1 jtc * number of chars copied. (Note this is a real performance win over
208 1.1 jtc * doing a strncpy() then a strlen()
209 1.1 jtc */
210 1.1 jtc
211 1.1 jtc int
212 1.11 mycroft l_strncpy(char *dest, const char *src, int len)
213 1.1 jtc {
214 1.6 tls char *stop;
215 1.6 tls char *start;
216 1.1 jtc
217 1.1 jtc stop = dest + len;
218 1.1 jtc start = dest;
219 1.1 jtc while ((dest < stop) && (*src != '\0'))
220 1.1 jtc *dest++ = *src++;
221 1.1 jtc if (dest < stop)
222 1.1 jtc *dest = '\0';
223 1.1 jtc return(dest - start);
224 1.1 jtc }
225 1.1 jtc
226 1.1 jtc /*
227 1.1 jtc * asc_ul()
228 1.1 jtc * convert hex/octal character string into a u_long. We do not have to
229 1.1 jtc * check for overflow! (the headers in all supported formats are not large
230 1.1 jtc * enough to create an overflow).
231 1.1 jtc * NOTE: strings passed to us are NOT TERMINATED.
232 1.1 jtc * Return:
233 1.1 jtc * unsigned long value
234 1.1 jtc */
235 1.1 jtc
236 1.1 jtc u_long
237 1.6 tls asc_ul(char *str, int len, int base)
238 1.1 jtc {
239 1.6 tls char *stop;
240 1.1 jtc u_long tval = 0;
241 1.1 jtc
242 1.1 jtc stop = str + len;
243 1.1 jtc
244 1.1 jtc /*
245 1.1 jtc * skip over leading blanks and zeros
246 1.1 jtc */
247 1.1 jtc while ((str < stop) && ((*str == ' ') || (*str == '0')))
248 1.1 jtc ++str;
249 1.1 jtc
250 1.1 jtc /*
251 1.1 jtc * for each valid digit, shift running value (tval) over to next digit
252 1.1 jtc * and add next digit
253 1.1 jtc */
254 1.1 jtc if (base == HEX) {
255 1.1 jtc while (str < stop) {
256 1.1 jtc if ((*str >= '0') && (*str <= '9'))
257 1.1 jtc tval = (tval << 4) + (*str++ - '0');
258 1.1 jtc else if ((*str >= 'A') && (*str <= 'F'))
259 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'A');
260 1.1 jtc else if ((*str >= 'a') && (*str <= 'f'))
261 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'a');
262 1.1 jtc else
263 1.1 jtc break;
264 1.1 jtc }
265 1.1 jtc } else {
266 1.17 itohy while ((str < stop) && (*str >= '0') && (*str <= '7'))
267 1.1 jtc tval = (tval << 3) + (*str++ - '0');
268 1.1 jtc }
269 1.1 jtc return(tval);
270 1.1 jtc }
271 1.1 jtc
272 1.1 jtc /*
273 1.1 jtc * ul_asc()
274 1.1 jtc * convert an unsigned long into an hex/oct ascii string. pads with LEADING
275 1.1 jtc * ascii 0's to fill string completely
276 1.1 jtc * NOTE: the string created is NOT TERMINATED.
277 1.1 jtc */
278 1.1 jtc
279 1.1 jtc int
280 1.6 tls ul_asc(u_long val, char *str, int len, int base)
281 1.1 jtc {
282 1.6 tls char *pt;
283 1.1 jtc u_long digit;
284 1.17 itohy
285 1.1 jtc /*
286 1.1 jtc * WARNING str is not '\0' terminated by this routine
287 1.1 jtc */
288 1.1 jtc pt = str + len - 1;
289 1.1 jtc
290 1.1 jtc /*
291 1.1 jtc * do a tailwise conversion (start at right most end of string to place
292 1.1 jtc * least significant digit). Keep shifting until conversion value goes
293 1.1 jtc * to zero (all digits were converted)
294 1.1 jtc */
295 1.1 jtc if (base == HEX) {
296 1.1 jtc while (pt >= str) {
297 1.1 jtc if ((digit = (val & 0xf)) < 10)
298 1.1 jtc *pt-- = '0' + (char)digit;
299 1.17 itohy else
300 1.1 jtc *pt-- = 'a' + (char)(digit - 10);
301 1.1 jtc if ((val = (val >> 4)) == (u_long)0)
302 1.1 jtc break;
303 1.1 jtc }
304 1.1 jtc } else {
305 1.1 jtc while (pt >= str) {
306 1.1 jtc *pt-- = '0' + (char)(val & 0x7);
307 1.1 jtc if ((val = (val >> 3)) == (u_long)0)
308 1.1 jtc break;
309 1.1 jtc }
310 1.1 jtc }
311 1.1 jtc
312 1.1 jtc /*
313 1.1 jtc * pad with leading ascii ZEROS. We return -1 if we ran out of space.
314 1.1 jtc */
315 1.1 jtc while (pt >= str)
316 1.1 jtc *pt-- = '0';
317 1.1 jtc if (val != (u_long)0)
318 1.1 jtc return(-1);
319 1.1 jtc return(0);
320 1.1 jtc }
321 1.1 jtc
322 1.1 jtc #ifndef NET2_STAT
323 1.1 jtc /*
324 1.21 lukem * asc_ull()
325 1.22 lukem * convert hex/octal character string into a unsigned long long. We do
326 1.22 lukem * not have to to check for overflow! (the headers in all supported
327 1.22 lukem * formats are not large enough to create an overflow).
328 1.1 jtc * NOTE: strings passed to us are NOT TERMINATED.
329 1.1 jtc * Return:
330 1.22 lukem * unsigned long long value
331 1.1 jtc */
332 1.1 jtc
333 1.22 lukem unsigned long long
334 1.21 lukem asc_ull(char *str, int len, int base)
335 1.1 jtc {
336 1.6 tls char *stop;
337 1.22 lukem unsigned long long tval = 0;
338 1.1 jtc
339 1.1 jtc stop = str + len;
340 1.1 jtc
341 1.1 jtc /*
342 1.1 jtc * skip over leading blanks and zeros
343 1.1 jtc */
344 1.1 jtc while ((str < stop) && ((*str == ' ') || (*str == '0')))
345 1.1 jtc ++str;
346 1.1 jtc
347 1.1 jtc /*
348 1.1 jtc * for each valid digit, shift running value (tval) over to next digit
349 1.1 jtc * and add next digit
350 1.1 jtc */
351 1.1 jtc if (base == HEX) {
352 1.1 jtc while (str < stop) {
353 1.1 jtc if ((*str >= '0') && (*str <= '9'))
354 1.1 jtc tval = (tval << 4) + (*str++ - '0');
355 1.1 jtc else if ((*str >= 'A') && (*str <= 'F'))
356 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'A');
357 1.1 jtc else if ((*str >= 'a') && (*str <= 'f'))
358 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'a');
359 1.1 jtc else
360 1.1 jtc break;
361 1.1 jtc }
362 1.1 jtc } else {
363 1.17 itohy while ((str < stop) && (*str >= '0') && (*str <= '7'))
364 1.1 jtc tval = (tval << 3) + (*str++ - '0');
365 1.1 jtc }
366 1.1 jtc return(tval);
367 1.1 jtc }
368 1.1 jtc
369 1.1 jtc /*
370 1.21 lukem * ull_asc()
371 1.22 lukem * convert an unsigned long long into a hex/oct ascii string. pads with
372 1.22 lukem * LEADING ascii 0's to fill string completely
373 1.1 jtc * NOTE: the string created is NOT TERMINATED.
374 1.1 jtc */
375 1.1 jtc
376 1.1 jtc int
377 1.22 lukem ull_asc(unsigned long long val, char *str, int len, int base)
378 1.1 jtc {
379 1.6 tls char *pt;
380 1.22 lukem unsigned long long digit;
381 1.17 itohy
382 1.1 jtc /*
383 1.1 jtc * WARNING str is not '\0' terminated by this routine
384 1.1 jtc */
385 1.1 jtc pt = str + len - 1;
386 1.1 jtc
387 1.1 jtc /*
388 1.1 jtc * do a tailwise conversion (start at right most end of string to place
389 1.1 jtc * least significant digit). Keep shifting until conversion value goes
390 1.1 jtc * to zero (all digits were converted)
391 1.1 jtc */
392 1.1 jtc if (base == HEX) {
393 1.1 jtc while (pt >= str) {
394 1.1 jtc if ((digit = (val & 0xf)) < 10)
395 1.1 jtc *pt-- = '0' + (char)digit;
396 1.17 itohy else
397 1.1 jtc *pt-- = 'a' + (char)(digit - 10);
398 1.22 lukem if ((val = (val >> 4)) == (unsigned long long)0)
399 1.1 jtc break;
400 1.1 jtc }
401 1.1 jtc } else {
402 1.1 jtc while (pt >= str) {
403 1.1 jtc *pt-- = '0' + (char)(val & 0x7);
404 1.22 lukem if ((val = (val >> 3)) == (unsigned long long)0)
405 1.1 jtc break;
406 1.1 jtc }
407 1.1 jtc }
408 1.1 jtc
409 1.1 jtc /*
410 1.1 jtc * pad with leading ascii ZEROS. We return -1 if we ran out of space.
411 1.1 jtc */
412 1.1 jtc while (pt >= str)
413 1.1 jtc *pt-- = '0';
414 1.22 lukem if (val != (unsigned long long)0)
415 1.1 jtc return(-1);
416 1.1 jtc return(0);
417 1.1 jtc }
418 1.1 jtc #endif
419 1.15 tron
420 1.15 tron int
421 1.18 mrg check_Aflag(void)
422 1.18 mrg {
423 1.18 mrg
424 1.15 tron if (Aflag > 0)
425 1.15 tron return 1;
426 1.15 tron if (Aflag == 0) {
427 1.15 tron Aflag = -1;
428 1.21 lukem tty_warn(0,
429 1.21 lukem "Removing leading / from absolute path names in the archive");
430 1.15 tron }
431 1.15 tron return 0;
432 1.15 tron }
433