1994-05-26 06:18:55 +00:00
|
|
|
/*-
|
|
|
|
* 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. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lint
|
1998-05-15 06:30:58 +00:00
|
|
|
#if 0
|
|
|
|
static char sccsid[] = "@(#)gen_subs.c 8.1 (Berkeley) 5/31/93";
|
|
|
|
#endif
|
|
|
|
static const char rcsid[] =
|
1999-08-27 23:15:48 +00:00
|
|
|
"$FreeBSD$";
|
1994-05-26 06:18:55 +00:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/stat.h>
|
2001-03-21 13:33:09 +00:00
|
|
|
#include <langinfo.h>
|
1994-05-26 06:18:55 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <utmp.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.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
|
1995-08-07 19:17:46 +00:00
|
|
|
#define SIXMONTHS ((365 / 2) * 86400)
|
2001-03-21 13:33:09 +00:00
|
|
|
#define CURFRMTM "%b %e %H:%M"
|
|
|
|
#define OLDFRMTM "%b %e %Y"
|
|
|
|
#define CURFRMTD "%e %b %H:%M"
|
|
|
|
#define OLDFRMTD "%e %b %Y"
|
1994-05-26 06:18:55 +00:00
|
|
|
#ifndef UT_NAMESIZE
|
|
|
|
#define UT_NAMESIZE 8
|
|
|
|
#endif
|
|
|
|
#define UT_GRPSIZE 6
|
|
|
|
|
2001-03-21 13:33:09 +00:00
|
|
|
static int d_first = -1;
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* ls_list()
|
|
|
|
* list the members of an archive in ls format
|
|
|
|
*/
|
|
|
|
|
|
|
|
void
|
2002-02-02 07:07:59 +00:00
|
|
|
ls_list(ARCHD *arcn, time_t now, FILE *fp)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
2002-02-02 07:07:59 +00:00
|
|
|
struct stat *sbp;
|
1994-05-26 06:18:55 +00:00
|
|
|
char f_mode[MODELEN];
|
|
|
|
char f_date[DATELEN];
|
|
|
|
char *timefrmt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if not verbose, just print the file name
|
|
|
|
*/
|
|
|
|
if (!vflag) {
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%s\n", arcn->name);
|
|
|
|
(void)fflush(fp);
|
1994-05-26 06:18:55 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-03-21 13:33:09 +00:00
|
|
|
if (d_first < 0)
|
|
|
|
d_first = (*nl_langinfo(D_MD_ORDER) == 'd');
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* user wants long mode
|
|
|
|
*/
|
|
|
|
sbp = &(arcn->sb);
|
|
|
|
strmode(sbp->st_mode, f_mode);
|
|
|
|
|
2001-03-02 16:19:49 +00:00
|
|
|
/*
|
|
|
|
* time format based on age compared to the time pax was started.
|
|
|
|
*/
|
|
|
|
if ((sbp->st_mtime + SIXMONTHS) <= now)
|
2001-03-21 13:33:09 +00:00
|
|
|
timefrmt = d_first ? OLDFRMTD : OLDFRMTM;
|
2001-03-02 16:19:49 +00:00
|
|
|
else
|
2001-03-21 13:33:09 +00:00
|
|
|
timefrmt = d_first ? CURFRMTD : CURFRMTM;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* print file mode, link count, uid, gid and time
|
|
|
|
*/
|
|
|
|
if (strftime(f_date,DATELEN,timefrmt,localtime(&(sbp->st_mtime))) == 0)
|
|
|
|
f_date[0] = '\0';
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%s%2u %-*s %-*s ", f_mode, sbp->st_nlink,
|
|
|
|
UT_NAMESIZE, name_uid(sbp->st_uid, 1), UT_GRPSIZE,
|
1994-05-26 06:18:55 +00:00
|
|
|
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))
|
|
|
|
# ifdef NET2_STAT
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%4u,%4u ", MAJOR(sbp->st_rdev),
|
1996-12-14 06:08:03 +00:00
|
|
|
MINOR(sbp->st_rdev));
|
1994-05-26 06:18:55 +00:00
|
|
|
# else
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%4lu,%4lu ", (unsigned long)MAJOR(sbp->st_rdev),
|
1996-12-14 06:08:03 +00:00
|
|
|
(unsigned long)MINOR(sbp->st_rdev));
|
1994-05-26 06:18:55 +00:00
|
|
|
# endif
|
|
|
|
else {
|
|
|
|
# ifdef NET2_STAT
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%9lu ", sbp->st_size);
|
1994-05-26 06:18:55 +00:00
|
|
|
# else
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%9qu ", sbp->st_size);
|
1994-05-26 06:18:55 +00:00
|
|
|
# endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* print name and link info for hard and soft links
|
|
|
|
*/
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, "%s %s", f_date, arcn->name);
|
1994-05-26 06:18:55 +00:00
|
|
|
if ((arcn->type == PAX_HLK) || (arcn->type == PAX_HRG))
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, " == %s\n", arcn->ln_name);
|
1994-05-26 06:18:55 +00:00
|
|
|
else if (arcn->type == PAX_SLK)
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)fprintf(fp, " => %s\n", arcn->ln_name);
|
1994-05-26 06:18:55 +00:00
|
|
|
else
|
2001-05-08 06:19:06 +00:00
|
|
|
(void)putc('\n', fp);
|
|
|
|
(void)fflush(fp);
|
1994-05-26 06:18:55 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* tty_ls()
|
|
|
|
* print a short summary of file to tty.
|
|
|
|
*/
|
|
|
|
|
|
|
|
void
|
2002-02-02 07:07:59 +00:00
|
|
|
ls_tty(ARCHD *arcn)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
|
|
|
char f_date[DATELEN];
|
|
|
|
char f_mode[MODELEN];
|
|
|
|
char *timefrmt;
|
|
|
|
|
2001-03-21 13:33:09 +00:00
|
|
|
if (d_first < 0)
|
|
|
|
d_first = (*nl_langinfo(D_MD_ORDER) == 'd');
|
|
|
|
|
2001-04-26 08:37:00 +00:00
|
|
|
if ((arcn->sb.st_mtime + SIXMONTHS) <= time(NULL))
|
2001-03-21 13:33:09 +00:00
|
|
|
timefrmt = d_first ? OLDFRMTD : OLDFRMTM;
|
2001-03-02 16:19:49 +00:00
|
|
|
else
|
2001-03-21 13:33:09 +00:00
|
|
|
timefrmt = d_first ? CURFRMTD : CURFRMTM;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* convert time to string, and print
|
|
|
|
*/
|
|
|
|
if (strftime(f_date, DATELEN, timefrmt,
|
|
|
|
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);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* l_strncpy()
|
2001-05-08 06:19:06 +00:00
|
|
|
* copy src to dest up to len chars (stopping at first '\0').
|
|
|
|
* when src is shorter than len, pads to len with '\0'.
|
1994-05-26 06:18:55 +00:00
|
|
|
* Return:
|
|
|
|
* number of chars copied. (Note this is a real performance win over
|
2001-05-08 06:19:06 +00:00
|
|
|
* doing a strncpy(), a strlen(), and then a possible memset())
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2002-02-02 07:07:59 +00:00
|
|
|
l_strncpy(char *dest, char *src, int len)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
2002-02-02 07:07:59 +00:00
|
|
|
char *stop;
|
|
|
|
char *start;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
stop = dest + len;
|
|
|
|
start = dest;
|
|
|
|
while ((dest < stop) && (*src != '\0'))
|
|
|
|
*dest++ = *src++;
|
2001-05-08 06:19:06 +00:00
|
|
|
len = dest - start;
|
|
|
|
while (dest < stop)
|
|
|
|
*dest++ = '\0';
|
|
|
|
return(len);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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
|
2002-02-02 07:07:59 +00:00
|
|
|
asc_ul(char *str, int len, int base)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
2002-02-02 07:07:59 +00:00
|
|
|
char *stop;
|
1994-05-26 06:18:55 +00:00
|
|
|
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
|
2002-02-02 07:07:59 +00:00
|
|
|
ul_asc(u_long val, char *str, int len, int base)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
2002-02-02 07:07:59 +00:00
|
|
|
char *pt;
|
1994-05-26 06:18:55 +00:00
|
|
|
u_long digit;
|
1995-05-30 00:07:29 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* 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;
|
1995-05-30 00:07:29 +00:00
|
|
|
else
|
1994-05-26 06:18:55 +00:00
|
|
|
*pt-- = 'a' + (char)(digit - 10);
|
|
|
|
if ((val = (val >> 4)) == (u_long)0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
while (pt >= str) {
|
|
|
|
*pt-- = '0' + (char)(val & 0x7);
|
|
|
|
if ((val = (val >> 3)) == (u_long)0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* pad with leading ascii ZEROS. We return -1 if we ran out of space.
|
|
|
|
*/
|
|
|
|
while (pt >= str)
|
|
|
|
*pt-- = '0';
|
|
|
|
if (val != (u_long)0)
|
|
|
|
return(-1);
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef NET2_STAT
|
|
|
|
/*
|
|
|
|
* asc_uqd()
|
|
|
|
* convert hex/octal character string into a u_quad_t. 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:
|
|
|
|
* u_quad_t value
|
|
|
|
*/
|
|
|
|
|
|
|
|
u_quad_t
|
2002-02-02 07:07:59 +00:00
|
|
|
asc_uqd(char *str, int len, int base)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
2002-02-02 07:07:59 +00:00
|
|
|
char *stop;
|
1994-05-26 06:18:55 +00:00
|
|
|
u_quad_t 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);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* uqd_asc()
|
|
|
|
* convert an u_quad_t into a hex/oct ascii string. pads with LEADING
|
|
|
|
* ascii 0's to fill string completely
|
|
|
|
* NOTE: the string created is NOT TERMINATED.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2002-02-02 07:07:59 +00:00
|
|
|
uqd_asc(u_quad_t val, char *str, int len, int base)
|
1994-05-26 06:18:55 +00:00
|
|
|
{
|
2002-02-02 07:07:59 +00:00
|
|
|
char *pt;
|
1994-05-26 06:18:55 +00:00
|
|
|
u_quad_t digit;
|
1995-05-30 00:07:29 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* 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;
|
1995-05-30 00:07:29 +00:00
|
|
|
else
|
1994-05-26 06:18:55 +00:00
|
|
|
*pt-- = 'a' + (char)(digit - 10);
|
|
|
|
if ((val = (val >> 4)) == (u_quad_t)0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
while (pt >= str) {
|
|
|
|
*pt-- = '0' + (char)(val & 0x7);
|
|
|
|
if ((val = (val >> 3)) == (u_quad_t)0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* pad with leading ascii ZEROS. We return -1 if we ran out of space.
|
|
|
|
*/
|
|
|
|
while (pt >= str)
|
|
|
|
*pt-- = '0';
|
|
|
|
if (val != (u_quad_t)0)
|
|
|
|
return(-1);
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
#endif
|