gen_subs.c revision 1.31 1 1.31 agc /* $NetBSD: gen_subs.c,v 1.31 2003/10/13 07:41:22 agc Exp $ */
2 1.5 cgd
3 1.1 jtc /*-
4 1.31 agc * 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.30 agc * 3. Neither the name of the University nor the names of its contributors
20 1.30 agc * may be used to endorse or promote products derived from this software
21 1.30 agc * without specific prior written permission.
22 1.30 agc *
23 1.30 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.30 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.30 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.30 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.30 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.30 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.30 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.30 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.30 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.30 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.30 agc * SUCH DAMAGE.
34 1.30 agc */
35 1.30 agc
36 1.7 christos #include <sys/cdefs.h>
37 1.23 tv #if defined(__RCSID) && !defined(lint)
38 1.5 cgd #if 0
39 1.5 cgd static char sccsid[] = "@(#)gen_subs.c 8.1 (Berkeley) 5/31/93";
40 1.5 cgd #else
41 1.31 agc __RCSID("$NetBSD: gen_subs.c,v 1.31 2003/10/13 07:41:22 agc Exp $");
42 1.5 cgd #endif
43 1.1 jtc #endif /* not lint */
44 1.1 jtc
45 1.1 jtc #include <sys/types.h>
46 1.1 jtc #include <sys/time.h>
47 1.1 jtc #include <sys/stat.h>
48 1.1 jtc #include <sys/param.h>
49 1.13 mycroft
50 1.13 mycroft #include <ctype.h>
51 1.13 mycroft #include <grp.h>
52 1.13 mycroft #include <pwd.h>
53 1.25 christos #include <vis.h>
54 1.1 jtc #include <stdio.h>
55 1.13 mycroft #include <stdlib.h>
56 1.13 mycroft #include <string.h>
57 1.10 kleink #include <time.h>
58 1.1 jtc #include <tzfile.h>
59 1.13 mycroft #include <unistd.h>
60 1.13 mycroft
61 1.1 jtc #include "pax.h"
62 1.1 jtc #include "extern.h"
63 1.1 jtc
64 1.1 jtc /*
65 1.1 jtc * a collection of general purpose subroutines used by pax
66 1.1 jtc */
67 1.1 jtc
68 1.1 jtc /*
69 1.1 jtc * constants used by ls_list() when printing out archive members
70 1.1 jtc */
71 1.1 jtc #define MODELEN 20
72 1.1 jtc #define DATELEN 64
73 1.1 jtc #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY)
74 1.1 jtc #define CURFRMT "%b %e %H:%M"
75 1.1 jtc #define OLDFRMT "%b %e %Y"
76 1.1 jtc #ifndef UT_NAMESIZE
77 1.1 jtc #define UT_NAMESIZE 8
78 1.1 jtc #endif
79 1.1 jtc #define UT_GRPSIZE 6
80 1.1 jtc
81 1.1 jtc /*
82 1.1 jtc * ls_list()
83 1.1 jtc * list the members of an archive in ls format
84 1.1 jtc */
85 1.1 jtc
86 1.1 jtc void
87 1.25 christos ls_list(ARCHD *arcn, time_t now, FILE *fp)
88 1.1 jtc {
89 1.6 tls struct stat *sbp;
90 1.1 jtc char f_mode[MODELEN];
91 1.1 jtc char f_date[DATELEN];
92 1.13 mycroft const char *timefrmt, *user, *group;
93 1.1 jtc
94 1.1 jtc /*
95 1.1 jtc * if not verbose, just print the file name
96 1.1 jtc */
97 1.1 jtc if (!vflag) {
98 1.25 christos (void)fprintf(fp, "%s\n", arcn->name);
99 1.25 christos (void)fflush(fp);
100 1.1 jtc return;
101 1.1 jtc }
102 1.1 jtc
103 1.1 jtc /*
104 1.1 jtc * user wants long mode
105 1.1 jtc */
106 1.1 jtc sbp = &(arcn->sb);
107 1.1 jtc strmode(sbp->st_mode, f_mode);
108 1.1 jtc
109 1.19 kleink /*
110 1.19 kleink * time format based on age compared to the time pax was started.
111 1.19 kleink */
112 1.19 kleink if ((sbp->st_mtime + SIXMONTHS) <= now)
113 1.19 kleink timefrmt = OLDFRMT;
114 1.19 kleink else
115 1.19 kleink timefrmt = CURFRMT;
116 1.1 jtc
117 1.1 jtc /*
118 1.1 jtc * print file mode, link count, uid, gid and time
119 1.1 jtc */
120 1.1 jtc if (strftime(f_date,DATELEN,timefrmt,localtime(&(sbp->st_mtime))) == 0)
121 1.1 jtc f_date[0] = '\0';
122 1.29 grant user = user_from_uid(sbp->st_uid, 0);
123 1.29 grant group = group_from_gid(sbp->st_gid, 0);
124 1.25 christos (void)fprintf(fp, "%s%2lu %-*s %-*s ", f_mode,
125 1.25 christos (unsigned long)sbp->st_nlink,
126 1.13 mycroft UT_NAMESIZE, user ? user : "", UT_GRPSIZE, group ? group : "");
127 1.1 jtc
128 1.1 jtc /*
129 1.1 jtc * print device id's for devices, or sizes for other nodes
130 1.1 jtc */
131 1.1 jtc if ((arcn->type == PAX_CHR) || (arcn->type == PAX_BLK))
132 1.25 christos (void)fprintf(fp, "%4lu,%4lu ", (long) MAJOR(sbp->st_rdev),
133 1.7 christos (long) MINOR(sbp->st_rdev));
134 1.1 jtc else {
135 1.25 christos (void)fprintf(fp, OFFT_FP("9") " ", (OFFT_T)sbp->st_size);
136 1.1 jtc }
137 1.1 jtc
138 1.1 jtc /*
139 1.1 jtc * print name and link info for hard and soft links
140 1.1 jtc */
141 1.25 christos (void)fprintf(fp, "%s %s", f_date, arcn->name);
142 1.1 jtc if ((arcn->type == PAX_HLK) || (arcn->type == PAX_HRG))
143 1.25 christos (void)fprintf(fp, " == %s\n", arcn->ln_name);
144 1.1 jtc else if (arcn->type == PAX_SLK)
145 1.27 kleink (void)fprintf(fp, " -> %s\n", arcn->ln_name);
146 1.1 jtc else
147 1.25 christos (void)fputc('\n', fp);
148 1.25 christos (void)fflush(fp);
149 1.1 jtc }
150 1.1 jtc
151 1.1 jtc /*
152 1.1 jtc * tty_ls()
153 1.17 itohy * print a short summary of file to tty.
154 1.1 jtc */
155 1.1 jtc
156 1.1 jtc void
157 1.6 tls ls_tty(ARCHD *arcn)
158 1.1 jtc {
159 1.1 jtc char f_date[DATELEN];
160 1.1 jtc char f_mode[MODELEN];
161 1.12 mycroft const char *timefrmt;
162 1.1 jtc
163 1.19 kleink if ((arcn->sb.st_mtime + SIXMONTHS) <= time((time_t *)NULL))
164 1.19 kleink timefrmt = OLDFRMT;
165 1.19 kleink else
166 1.19 kleink timefrmt = CURFRMT;
167 1.1 jtc
168 1.1 jtc /*
169 1.1 jtc * convert time to string, and print
170 1.1 jtc */
171 1.1 jtc if (strftime(f_date, DATELEN, timefrmt,
172 1.1 jtc localtime(&(arcn->sb.st_mtime))) == 0)
173 1.1 jtc f_date[0] = '\0';
174 1.1 jtc strmode(arcn->sb.st_mode, f_mode);
175 1.1 jtc tty_prnt("%s%s %s\n", f_mode, f_date, arcn->name);
176 1.1 jtc return;
177 1.1 jtc }
178 1.1 jtc
179 1.1 jtc void
180 1.25 christos safe_print(const char *str, FILE *fp)
181 1.1 jtc {
182 1.25 christos char visbuf[5];
183 1.25 christos const char *cp;
184 1.1 jtc
185 1.25 christos /*
186 1.25 christos * if printing to a tty, use vis(3) to print special characters.
187 1.25 christos */
188 1.25 christos if (isatty(fileno(fp))) {
189 1.25 christos for (cp = str; *cp; cp++) {
190 1.25 christos (void)vis(visbuf, cp[0], VIS_CSTYLE, cp[1]);
191 1.25 christos (void)fputs(visbuf, fp);
192 1.25 christos }
193 1.25 christos } else {
194 1.25 christos (void)fputs(str, fp);
195 1.25 christos }
196 1.1 jtc }
197 1.1 jtc
198 1.1 jtc /*
199 1.1 jtc * asc_ul()
200 1.1 jtc * convert hex/octal character string into a u_long. We do not have to
201 1.1 jtc * check for overflow! (the headers in all supported formats are not large
202 1.1 jtc * enough to create an overflow).
203 1.1 jtc * NOTE: strings passed to us are NOT TERMINATED.
204 1.1 jtc * Return:
205 1.1 jtc * unsigned long value
206 1.1 jtc */
207 1.1 jtc
208 1.1 jtc u_long
209 1.6 tls asc_ul(char *str, int len, int base)
210 1.1 jtc {
211 1.6 tls char *stop;
212 1.1 jtc u_long tval = 0;
213 1.1 jtc
214 1.1 jtc stop = str + len;
215 1.1 jtc
216 1.1 jtc /*
217 1.1 jtc * skip over leading blanks and zeros
218 1.1 jtc */
219 1.1 jtc while ((str < stop) && ((*str == ' ') || (*str == '0')))
220 1.1 jtc ++str;
221 1.1 jtc
222 1.1 jtc /*
223 1.1 jtc * for each valid digit, shift running value (tval) over to next digit
224 1.1 jtc * and add next digit
225 1.1 jtc */
226 1.1 jtc if (base == HEX) {
227 1.1 jtc while (str < stop) {
228 1.1 jtc if ((*str >= '0') && (*str <= '9'))
229 1.1 jtc tval = (tval << 4) + (*str++ - '0');
230 1.1 jtc else if ((*str >= 'A') && (*str <= 'F'))
231 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'A');
232 1.1 jtc else if ((*str >= 'a') && (*str <= 'f'))
233 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'a');
234 1.1 jtc else
235 1.1 jtc break;
236 1.1 jtc }
237 1.1 jtc } else {
238 1.17 itohy while ((str < stop) && (*str >= '0') && (*str <= '7'))
239 1.1 jtc tval = (tval << 3) + (*str++ - '0');
240 1.1 jtc }
241 1.1 jtc return(tval);
242 1.1 jtc }
243 1.1 jtc
244 1.1 jtc /*
245 1.1 jtc * ul_asc()
246 1.1 jtc * convert an unsigned long into an hex/oct ascii string. pads with LEADING
247 1.1 jtc * ascii 0's to fill string completely
248 1.1 jtc * NOTE: the string created is NOT TERMINATED.
249 1.1 jtc */
250 1.1 jtc
251 1.1 jtc int
252 1.6 tls ul_asc(u_long val, char *str, int len, int base)
253 1.1 jtc {
254 1.6 tls char *pt;
255 1.1 jtc u_long digit;
256 1.17 itohy
257 1.1 jtc /*
258 1.1 jtc * WARNING str is not '\0' terminated by this routine
259 1.1 jtc */
260 1.1 jtc pt = str + len - 1;
261 1.1 jtc
262 1.1 jtc /*
263 1.1 jtc * do a tailwise conversion (start at right most end of string to place
264 1.1 jtc * least significant digit). Keep shifting until conversion value goes
265 1.1 jtc * to zero (all digits were converted)
266 1.1 jtc */
267 1.1 jtc if (base == HEX) {
268 1.1 jtc while (pt >= str) {
269 1.1 jtc if ((digit = (val & 0xf)) < 10)
270 1.1 jtc *pt-- = '0' + (char)digit;
271 1.17 itohy else
272 1.1 jtc *pt-- = 'a' + (char)(digit - 10);
273 1.1 jtc if ((val = (val >> 4)) == (u_long)0)
274 1.1 jtc break;
275 1.1 jtc }
276 1.1 jtc } else {
277 1.1 jtc while (pt >= str) {
278 1.1 jtc *pt-- = '0' + (char)(val & 0x7);
279 1.1 jtc if ((val = (val >> 3)) == (u_long)0)
280 1.1 jtc break;
281 1.1 jtc }
282 1.1 jtc }
283 1.1 jtc
284 1.1 jtc /*
285 1.1 jtc * pad with leading ascii ZEROS. We return -1 if we ran out of space.
286 1.1 jtc */
287 1.1 jtc while (pt >= str)
288 1.1 jtc *pt-- = '0';
289 1.1 jtc if (val != (u_long)0)
290 1.1 jtc return(-1);
291 1.1 jtc return(0);
292 1.1 jtc }
293 1.1 jtc
294 1.26 mrg #if !defined(NET2_STAT) && !defined(_LP64)
295 1.1 jtc /*
296 1.21 lukem * asc_ull()
297 1.22 lukem * convert hex/octal character string into a unsigned long long. We do
298 1.22 lukem * not have to to check for overflow! (the headers in all supported
299 1.22 lukem * formats are not large enough to create an overflow).
300 1.1 jtc * NOTE: strings passed to us are NOT TERMINATED.
301 1.1 jtc * Return:
302 1.22 lukem * unsigned long long value
303 1.1 jtc */
304 1.1 jtc
305 1.22 lukem unsigned long long
306 1.21 lukem asc_ull(char *str, int len, int base)
307 1.1 jtc {
308 1.6 tls char *stop;
309 1.22 lukem unsigned long long tval = 0;
310 1.1 jtc
311 1.1 jtc stop = str + len;
312 1.1 jtc
313 1.1 jtc /*
314 1.1 jtc * skip over leading blanks and zeros
315 1.1 jtc */
316 1.1 jtc while ((str < stop) && ((*str == ' ') || (*str == '0')))
317 1.1 jtc ++str;
318 1.1 jtc
319 1.1 jtc /*
320 1.1 jtc * for each valid digit, shift running value (tval) over to next digit
321 1.1 jtc * and add next digit
322 1.1 jtc */
323 1.1 jtc if (base == HEX) {
324 1.1 jtc while (str < stop) {
325 1.1 jtc if ((*str >= '0') && (*str <= '9'))
326 1.1 jtc tval = (tval << 4) + (*str++ - '0');
327 1.1 jtc else if ((*str >= 'A') && (*str <= 'F'))
328 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'A');
329 1.1 jtc else if ((*str >= 'a') && (*str <= 'f'))
330 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'a');
331 1.1 jtc else
332 1.1 jtc break;
333 1.1 jtc }
334 1.1 jtc } else {
335 1.17 itohy while ((str < stop) && (*str >= '0') && (*str <= '7'))
336 1.1 jtc tval = (tval << 3) + (*str++ - '0');
337 1.1 jtc }
338 1.1 jtc return(tval);
339 1.1 jtc }
340 1.1 jtc
341 1.1 jtc /*
342 1.21 lukem * ull_asc()
343 1.22 lukem * convert an unsigned long long into a hex/oct ascii string. pads with
344 1.22 lukem * LEADING ascii 0's to fill string completely
345 1.1 jtc * NOTE: the string created is NOT TERMINATED.
346 1.1 jtc */
347 1.1 jtc
348 1.1 jtc int
349 1.22 lukem ull_asc(unsigned long long val, char *str, int len, int base)
350 1.1 jtc {
351 1.6 tls char *pt;
352 1.22 lukem unsigned long long digit;
353 1.17 itohy
354 1.1 jtc /*
355 1.1 jtc * WARNING str is not '\0' terminated by this routine
356 1.1 jtc */
357 1.1 jtc pt = str + len - 1;
358 1.1 jtc
359 1.1 jtc /*
360 1.1 jtc * do a tailwise conversion (start at right most end of string to place
361 1.1 jtc * least significant digit). Keep shifting until conversion value goes
362 1.1 jtc * to zero (all digits were converted)
363 1.1 jtc */
364 1.1 jtc if (base == HEX) {
365 1.1 jtc while (pt >= str) {
366 1.1 jtc if ((digit = (val & 0xf)) < 10)
367 1.1 jtc *pt-- = '0' + (char)digit;
368 1.17 itohy else
369 1.1 jtc *pt-- = 'a' + (char)(digit - 10);
370 1.22 lukem if ((val = (val >> 4)) == (unsigned long long)0)
371 1.1 jtc break;
372 1.1 jtc }
373 1.1 jtc } else {
374 1.1 jtc while (pt >= str) {
375 1.1 jtc *pt-- = '0' + (char)(val & 0x7);
376 1.22 lukem if ((val = (val >> 3)) == (unsigned long long)0)
377 1.1 jtc break;
378 1.1 jtc }
379 1.1 jtc }
380 1.1 jtc
381 1.1 jtc /*
382 1.1 jtc * pad with leading ascii ZEROS. We return -1 if we ran out of space.
383 1.1 jtc */
384 1.1 jtc while (pt >= str)
385 1.1 jtc *pt-- = '0';
386 1.22 lukem if (val != (unsigned long long)0)
387 1.1 jtc return(-1);
388 1.1 jtc return(0);
389 1.1 jtc }
390 1.1 jtc #endif
391 1.15 tron
392 1.15 tron int
393 1.18 mrg check_Aflag(void)
394 1.18 mrg {
395 1.18 mrg
396 1.15 tron if (Aflag > 0)
397 1.15 tron return 1;
398 1.15 tron if (Aflag == 0) {
399 1.15 tron Aflag = -1;
400 1.21 lukem tty_warn(0,
401 1.21 lukem "Removing leading / from absolute path names in the archive");
402 1.15 tron }
403 1.15 tron return 0;
404 1.15 tron }
405