gen_subs.c revision 1.1 1 1.1 jtc /*-
2 1.1 jtc * Copyright (c) 1992 Keith Muller.
3 1.1 jtc * Copyright (c) 1992, 1993
4 1.1 jtc * The Regents of the University of California. All rights reserved.
5 1.1 jtc *
6 1.1 jtc * This code is derived from software contributed to Berkeley by
7 1.1 jtc * Keith Muller of the University of California, San Diego.
8 1.1 jtc *
9 1.1 jtc * Redistribution and use in source and binary forms, with or without
10 1.1 jtc * modification, are permitted provided that the following conditions
11 1.1 jtc * are met:
12 1.1 jtc * 1. Redistributions of source code must retain the above copyright
13 1.1 jtc * notice, this list of conditions and the following disclaimer.
14 1.1 jtc * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 jtc * notice, this list of conditions and the following disclaimer in the
16 1.1 jtc * documentation and/or other materials provided with the distribution.
17 1.1 jtc * 3. All advertising materials mentioning features or use of this software
18 1.1 jtc * must display the following acknowledgement:
19 1.1 jtc * This product includes software developed by the University of
20 1.1 jtc * California, Berkeley and its contributors.
21 1.1 jtc * 4. Neither the name of the University nor the names of its contributors
22 1.1 jtc * may be used to endorse or promote products derived from this software
23 1.1 jtc * without specific prior written permission.
24 1.1 jtc *
25 1.1 jtc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 jtc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 jtc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 jtc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 jtc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 jtc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 jtc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 jtc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 jtc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 jtc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 jtc * SUCH DAMAGE.
36 1.1 jtc */
37 1.1 jtc
38 1.1 jtc #ifndef lint
39 1.1 jtc static char sccsid[] = "@(#)gen_subs.c 8.1 (Berkeley) 5/31/93";
40 1.1 jtc #endif /* not lint */
41 1.1 jtc
42 1.1 jtc #include <sys/types.h>
43 1.1 jtc #include <sys/time.h>
44 1.1 jtc #include <sys/stat.h>
45 1.1 jtc #include <sys/param.h>
46 1.1 jtc #include <stdio.h>
47 1.1 jtc #include <ctype.h>
48 1.1 jtc #include <tzfile.h>
49 1.1 jtc #include <utmp.h>
50 1.1 jtc #include <unistd.h>
51 1.1 jtc #include <stdlib.h>
52 1.1 jtc #include <string.h>
53 1.1 jtc #include "pax.h"
54 1.1 jtc #include "extern.h"
55 1.1 jtc
56 1.1 jtc /*
57 1.1 jtc * a collection of general purpose subroutines used by pax
58 1.1 jtc */
59 1.1 jtc
60 1.1 jtc /*
61 1.1 jtc * constants used by ls_list() when printing out archive members
62 1.1 jtc */
63 1.1 jtc #define MODELEN 20
64 1.1 jtc #define DATELEN 64
65 1.1 jtc #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY)
66 1.1 jtc #define CURFRMT "%b %e %H:%M"
67 1.1 jtc #define OLDFRMT "%b %e %Y"
68 1.1 jtc #ifndef UT_NAMESIZE
69 1.1 jtc #define UT_NAMESIZE 8
70 1.1 jtc #endif
71 1.1 jtc #define UT_GRPSIZE 6
72 1.1 jtc
73 1.1 jtc /*
74 1.1 jtc * ls_list()
75 1.1 jtc * list the members of an archive in ls format
76 1.1 jtc */
77 1.1 jtc
78 1.1 jtc #if __STDC__
79 1.1 jtc void
80 1.1 jtc ls_list(register ARCHD *arcn, time_t now)
81 1.1 jtc #else
82 1.1 jtc void
83 1.1 jtc ls_list(arcn, now)
84 1.1 jtc register ARCHD *arcn;
85 1.1 jtc time_t now;
86 1.1 jtc #endif
87 1.1 jtc {
88 1.1 jtc register struct stat *sbp;
89 1.1 jtc char f_mode[MODELEN];
90 1.1 jtc char f_date[DATELEN];
91 1.1 jtc char *timefrmt;
92 1.1 jtc
93 1.1 jtc /*
94 1.1 jtc * if not verbose, just print the file name
95 1.1 jtc */
96 1.1 jtc if (!vflag) {
97 1.1 jtc (void)printf("%s\n", arcn->name);
98 1.1 jtc (void)fflush(stdout);
99 1.1 jtc return;
100 1.1 jtc }
101 1.1 jtc
102 1.1 jtc /*
103 1.1 jtc * user wants long mode
104 1.1 jtc */
105 1.1 jtc sbp = &(arcn->sb);
106 1.1 jtc strmode(sbp->st_mode, f_mode);
107 1.1 jtc
108 1.1 jtc if (ltmfrmt == NULL) {
109 1.1 jtc /*
110 1.1 jtc * no locale specified format. time format based on age
111 1.1 jtc * compared to the time pax was started.
112 1.1 jtc */
113 1.1 jtc if ((sbp->st_mtime + SIXMONTHS) <= now)
114 1.1 jtc timefrmt = OLDFRMT;
115 1.1 jtc else
116 1.1 jtc timefrmt = CURFRMT;
117 1.1 jtc } else
118 1.1 jtc timefrmt = ltmfrmt;
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.1 jtc (void)printf("%s%2u %-*s %-*s ", f_mode, sbp->st_nlink, UT_NAMESIZE,
126 1.1 jtc name_uid(sbp->st_uid, 1), UT_GRPSIZE,
127 1.1 jtc name_gid(sbp->st_gid, 1));
128 1.1 jtc
129 1.1 jtc /*
130 1.1 jtc * print device id's for devices, or sizes for other nodes
131 1.1 jtc */
132 1.1 jtc if ((arcn->type == PAX_CHR) || (arcn->type == PAX_BLK))
133 1.1 jtc # ifdef NET2_STAT
134 1.1 jtc (void)printf("%4u,%4u ", MAJOR(sbp->st_rdev),
135 1.1 jtc # else
136 1.1 jtc (void)printf("%4lu,%4lu ", MAJOR(sbp->st_rdev),
137 1.1 jtc # endif
138 1.1 jtc MINOR(sbp->st_rdev));
139 1.1 jtc else {
140 1.1 jtc # ifdef NET2_STAT
141 1.1 jtc (void)printf("%9lu ", sbp->st_size);
142 1.1 jtc # else
143 1.1 jtc (void)printf("%9qu ", sbp->st_size);
144 1.1 jtc # endif
145 1.1 jtc }
146 1.1 jtc
147 1.1 jtc /*
148 1.1 jtc * print name and link info for hard and soft links
149 1.1 jtc */
150 1.1 jtc (void)printf("%s %s", f_date, arcn->name);
151 1.1 jtc if ((arcn->type == PAX_HLK) || (arcn->type == PAX_HRG))
152 1.1 jtc (void)printf(" == %s\n", arcn->ln_name);
153 1.1 jtc else if (arcn->type == PAX_SLK)
154 1.1 jtc (void)printf(" => %s\n", arcn->ln_name);
155 1.1 jtc else
156 1.1 jtc (void)putchar('\n');
157 1.1 jtc (void)fflush(stdout);
158 1.1 jtc return;
159 1.1 jtc }
160 1.1 jtc
161 1.1 jtc /*
162 1.1 jtc * tty_ls()
163 1.1 jtc * print a short summary of file to tty.
164 1.1 jtc */
165 1.1 jtc
166 1.1 jtc #if __STDC__
167 1.1 jtc void
168 1.1 jtc ls_tty(register ARCHD *arcn)
169 1.1 jtc #else
170 1.1 jtc void
171 1.1 jtc ls_tty(arcn)
172 1.1 jtc register ARCHD *arcn;
173 1.1 jtc #endif
174 1.1 jtc {
175 1.1 jtc char f_date[DATELEN];
176 1.1 jtc char f_mode[MODELEN];
177 1.1 jtc char *timefrmt;
178 1.1 jtc
179 1.1 jtc if (ltmfrmt == NULL) {
180 1.1 jtc /*
181 1.1 jtc * no locale specified format
182 1.1 jtc */
183 1.1 jtc if ((arcn->sb.st_mtime + SIXMONTHS) <= time((time_t *)NULL))
184 1.1 jtc timefrmt = OLDFRMT;
185 1.1 jtc else
186 1.1 jtc timefrmt = CURFRMT;
187 1.1 jtc } else
188 1.1 jtc timefrmt = ltmfrmt;
189 1.1 jtc
190 1.1 jtc /*
191 1.1 jtc * convert time to string, and print
192 1.1 jtc */
193 1.1 jtc if (strftime(f_date, DATELEN, timefrmt,
194 1.1 jtc localtime(&(arcn->sb.st_mtime))) == 0)
195 1.1 jtc f_date[0] = '\0';
196 1.1 jtc strmode(arcn->sb.st_mode, f_mode);
197 1.1 jtc tty_prnt("%s%s %s\n", f_mode, f_date, arcn->name);
198 1.1 jtc return;
199 1.1 jtc }
200 1.1 jtc
201 1.1 jtc /*
202 1.1 jtc * zf_strncpy()
203 1.1 jtc * copy src to dest up to len chars (stopping at first '\0'), when src is
204 1.1 jtc * shorter than len, pads to len with '\0'. big performance win (and
205 1.1 jtc * a lot easier to code) over strncpy(), then a strlen() then a
206 1.1 jtc * bzero(). (or doing the bzero() first).
207 1.1 jtc */
208 1.1 jtc
209 1.1 jtc #if __STDC__
210 1.1 jtc void
211 1.1 jtc zf_strncpy(register char *dest, register char *src, int len)
212 1.1 jtc #else
213 1.1 jtc void
214 1.1 jtc zf_strncpy(dest, src, len)
215 1.1 jtc register char *dest;
216 1.1 jtc register char *src;
217 1.1 jtc int len;
218 1.1 jtc #endif
219 1.1 jtc {
220 1.1 jtc register char *stop;
221 1.1 jtc
222 1.1 jtc stop = dest + len;
223 1.1 jtc while ((dest < stop) && (*src != '\0'))
224 1.1 jtc *dest++ = *src++;
225 1.1 jtc while (dest < stop)
226 1.1 jtc *dest++ = '\0';
227 1.1 jtc return;
228 1.1 jtc }
229 1.1 jtc
230 1.1 jtc /*
231 1.1 jtc * l_strncpy()
232 1.1 jtc * copy src to dest up to len chars (stopping at first '\0')
233 1.1 jtc * Return:
234 1.1 jtc * number of chars copied. (Note this is a real performance win over
235 1.1 jtc * doing a strncpy() then a strlen()
236 1.1 jtc */
237 1.1 jtc
238 1.1 jtc #if __STDC__
239 1.1 jtc int
240 1.1 jtc l_strncpy(register char *dest, register char *src, int len)
241 1.1 jtc #else
242 1.1 jtc int
243 1.1 jtc l_strncpy(dest, src, len)
244 1.1 jtc register char *dest;
245 1.1 jtc register char *src;
246 1.1 jtc int len;
247 1.1 jtc #endif
248 1.1 jtc {
249 1.1 jtc register char *stop;
250 1.1 jtc register char *start;
251 1.1 jtc
252 1.1 jtc stop = dest + len;
253 1.1 jtc start = dest;
254 1.1 jtc while ((dest < stop) && (*src != '\0'))
255 1.1 jtc *dest++ = *src++;
256 1.1 jtc if (dest < stop)
257 1.1 jtc *dest = '\0';
258 1.1 jtc return(dest - start);
259 1.1 jtc }
260 1.1 jtc
261 1.1 jtc /*
262 1.1 jtc * asc_ul()
263 1.1 jtc * convert hex/octal character string into a u_long. We do not have to
264 1.1 jtc * check for overflow! (the headers in all supported formats are not large
265 1.1 jtc * enough to create an overflow).
266 1.1 jtc * NOTE: strings passed to us are NOT TERMINATED.
267 1.1 jtc * Return:
268 1.1 jtc * unsigned long value
269 1.1 jtc */
270 1.1 jtc
271 1.1 jtc #if __STDC__
272 1.1 jtc u_long
273 1.1 jtc asc_ul(register char *str, int len, register int base)
274 1.1 jtc #else
275 1.1 jtc u_long
276 1.1 jtc asc_ul(str, len, base)
277 1.1 jtc register char *str;
278 1.1 jtc int len;
279 1.1 jtc register int base;
280 1.1 jtc #endif
281 1.1 jtc {
282 1.1 jtc register char *stop;
283 1.1 jtc u_long tval = 0;
284 1.1 jtc
285 1.1 jtc stop = str + len;
286 1.1 jtc
287 1.1 jtc /*
288 1.1 jtc * skip over leading blanks and zeros
289 1.1 jtc */
290 1.1 jtc while ((str < stop) && ((*str == ' ') || (*str == '0')))
291 1.1 jtc ++str;
292 1.1 jtc
293 1.1 jtc /*
294 1.1 jtc * for each valid digit, shift running value (tval) over to next digit
295 1.1 jtc * and add next digit
296 1.1 jtc */
297 1.1 jtc if (base == HEX) {
298 1.1 jtc while (str < stop) {
299 1.1 jtc if ((*str >= '0') && (*str <= '9'))
300 1.1 jtc tval = (tval << 4) + (*str++ - '0');
301 1.1 jtc else if ((*str >= 'A') && (*str <= 'F'))
302 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'A');
303 1.1 jtc else if ((*str >= 'a') && (*str <= 'f'))
304 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'a');
305 1.1 jtc else
306 1.1 jtc break;
307 1.1 jtc }
308 1.1 jtc } else {
309 1.1 jtc while ((str < stop) && (*str >= '0') && (*str <= '7'))
310 1.1 jtc tval = (tval << 3) + (*str++ - '0');
311 1.1 jtc }
312 1.1 jtc return(tval);
313 1.1 jtc }
314 1.1 jtc
315 1.1 jtc /*
316 1.1 jtc * ul_asc()
317 1.1 jtc * convert an unsigned long into an hex/oct ascii string. pads with LEADING
318 1.1 jtc * ascii 0's to fill string completely
319 1.1 jtc * NOTE: the string created is NOT TERMINATED.
320 1.1 jtc */
321 1.1 jtc
322 1.1 jtc #if __STDC__
323 1.1 jtc int
324 1.1 jtc ul_asc(u_long val, register char *str, register int len, register int base)
325 1.1 jtc #else
326 1.1 jtc int
327 1.1 jtc ul_asc(val, str, len, base)
328 1.1 jtc u_long val;
329 1.1 jtc register char *str;
330 1.1 jtc register int len;
331 1.1 jtc register int base;
332 1.1 jtc #endif
333 1.1 jtc {
334 1.1 jtc register char *pt;
335 1.1 jtc u_long digit;
336 1.1 jtc
337 1.1 jtc /*
338 1.1 jtc * WARNING str is not '\0' terminated by this routine
339 1.1 jtc */
340 1.1 jtc pt = str + len - 1;
341 1.1 jtc
342 1.1 jtc /*
343 1.1 jtc * do a tailwise conversion (start at right most end of string to place
344 1.1 jtc * least significant digit). Keep shifting until conversion value goes
345 1.1 jtc * to zero (all digits were converted)
346 1.1 jtc */
347 1.1 jtc if (base == HEX) {
348 1.1 jtc while (pt >= str) {
349 1.1 jtc if ((digit = (val & 0xf)) < 10)
350 1.1 jtc *pt-- = '0' + (char)digit;
351 1.1 jtc else
352 1.1 jtc *pt-- = 'a' + (char)(digit - 10);
353 1.1 jtc if ((val = (val >> 4)) == (u_long)0)
354 1.1 jtc break;
355 1.1 jtc }
356 1.1 jtc } else {
357 1.1 jtc while (pt >= str) {
358 1.1 jtc *pt-- = '0' + (char)(val & 0x7);
359 1.1 jtc if ((val = (val >> 3)) == (u_long)0)
360 1.1 jtc break;
361 1.1 jtc }
362 1.1 jtc }
363 1.1 jtc
364 1.1 jtc /*
365 1.1 jtc * pad with leading ascii ZEROS. We return -1 if we ran out of space.
366 1.1 jtc */
367 1.1 jtc while (pt >= str)
368 1.1 jtc *pt-- = '0';
369 1.1 jtc if (val != (u_long)0)
370 1.1 jtc return(-1);
371 1.1 jtc return(0);
372 1.1 jtc }
373 1.1 jtc
374 1.1 jtc #ifndef NET2_STAT
375 1.1 jtc /*
376 1.1 jtc * asc_uqd()
377 1.1 jtc * convert hex/octal character string into a u_quad_t. We do not have to
378 1.1 jtc * check for overflow! (the headers in all supported formats are not large
379 1.1 jtc * enough to create an overflow).
380 1.1 jtc * NOTE: strings passed to us are NOT TERMINATED.
381 1.1 jtc * Return:
382 1.1 jtc * u_quad_t value
383 1.1 jtc */
384 1.1 jtc
385 1.1 jtc #if __STDC__
386 1.1 jtc u_quad_t
387 1.1 jtc asc_uqd(register char *str, int len, register int base)
388 1.1 jtc #else
389 1.1 jtc u_quad_t
390 1.1 jtc asc_uqd(str, len, base)
391 1.1 jtc register char *str;
392 1.1 jtc int len;
393 1.1 jtc register int base;
394 1.1 jtc #endif
395 1.1 jtc {
396 1.1 jtc register char *stop;
397 1.1 jtc u_quad_t tval = 0;
398 1.1 jtc
399 1.1 jtc stop = str + len;
400 1.1 jtc
401 1.1 jtc /*
402 1.1 jtc * skip over leading blanks and zeros
403 1.1 jtc */
404 1.1 jtc while ((str < stop) && ((*str == ' ') || (*str == '0')))
405 1.1 jtc ++str;
406 1.1 jtc
407 1.1 jtc /*
408 1.1 jtc * for each valid digit, shift running value (tval) over to next digit
409 1.1 jtc * and add next digit
410 1.1 jtc */
411 1.1 jtc if (base == HEX) {
412 1.1 jtc while (str < stop) {
413 1.1 jtc if ((*str >= '0') && (*str <= '9'))
414 1.1 jtc tval = (tval << 4) + (*str++ - '0');
415 1.1 jtc else if ((*str >= 'A') && (*str <= 'F'))
416 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'A');
417 1.1 jtc else if ((*str >= 'a') && (*str <= 'f'))
418 1.1 jtc tval = (tval << 4) + 10 + (*str++ - 'a');
419 1.1 jtc else
420 1.1 jtc break;
421 1.1 jtc }
422 1.1 jtc } else {
423 1.1 jtc while ((str < stop) && (*str >= '0') && (*str <= '7'))
424 1.1 jtc tval = (tval << 3) + (*str++ - '0');
425 1.1 jtc }
426 1.1 jtc return(tval);
427 1.1 jtc }
428 1.1 jtc
429 1.1 jtc /*
430 1.1 jtc * uqd_asc()
431 1.1 jtc * convert an u_quad_t into a hex/oct ascii string. pads with LEADING
432 1.1 jtc * ascii 0's to fill string completely
433 1.1 jtc * NOTE: the string created is NOT TERMINATED.
434 1.1 jtc */
435 1.1 jtc
436 1.1 jtc #if __STDC__
437 1.1 jtc int
438 1.1 jtc uqd_asc(u_quad_t val, register char *str, register int len, register int base)
439 1.1 jtc #else
440 1.1 jtc int
441 1.1 jtc uqd_asc(val, str, len, base)
442 1.1 jtc u_quad_t val;
443 1.1 jtc register char *str;
444 1.1 jtc register int len;
445 1.1 jtc register int base;
446 1.1 jtc #endif
447 1.1 jtc {
448 1.1 jtc register char *pt;
449 1.1 jtc u_quad_t digit;
450 1.1 jtc
451 1.1 jtc /*
452 1.1 jtc * WARNING str is not '\0' terminated by this routine
453 1.1 jtc */
454 1.1 jtc pt = str + len - 1;
455 1.1 jtc
456 1.1 jtc /*
457 1.1 jtc * do a tailwise conversion (start at right most end of string to place
458 1.1 jtc * least significant digit). Keep shifting until conversion value goes
459 1.1 jtc * to zero (all digits were converted)
460 1.1 jtc */
461 1.1 jtc if (base == HEX) {
462 1.1 jtc while (pt >= str) {
463 1.1 jtc if ((digit = (val & 0xf)) < 10)
464 1.1 jtc *pt-- = '0' + (char)digit;
465 1.1 jtc else
466 1.1 jtc *pt-- = 'a' + (char)(digit - 10);
467 1.1 jtc if ((val = (val >> 4)) == (u_quad_t)0)
468 1.1 jtc break;
469 1.1 jtc }
470 1.1 jtc } else {
471 1.1 jtc while (pt >= str) {
472 1.1 jtc *pt-- = '0' + (char)(val & 0x7);
473 1.1 jtc if ((val = (val >> 3)) == (u_quad_t)0)
474 1.1 jtc break;
475 1.1 jtc }
476 1.1 jtc }
477 1.1 jtc
478 1.1 jtc /*
479 1.1 jtc * pad with leading ascii ZEROS. We return -1 if we ran out of space.
480 1.1 jtc */
481 1.1 jtc while (pt >= str)
482 1.1 jtc *pt-- = '0';
483 1.1 jtc if (val != (u_quad_t)0)
484 1.1 jtc return(-1);
485 1.1 jtc return(0);
486 1.1 jtc }
487 1.1 jtc #endif
488