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