NetBSD/bin/ls/print.c

350 lines
8.3 KiB
C
Raw Normal View History

/* $NetBSD: print.c,v 1.20 1998/01/21 00:25:19 mycroft Exp $ */
1995-03-21 12:01:59 +03:00
1993-03-21 12:45:37 +03:00
/*
1994-09-23 10:14:39 +04:00
* Copyright (c) 1989, 1993, 1994
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* This code is derived from software contributed to Berkeley by
* Michael Fischbein.
*
* 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.
*/
1997-07-20 22:52:57 +04:00
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
1995-03-21 12:01:59 +03:00
#if 0
1995-09-07 10:42:58 +04:00
static char sccsid[] = "@(#)print.c 8.5 (Berkeley) 7/28/94";
1995-03-21 12:01:59 +03:00
#else
__RCSID("$NetBSD: print.c,v 1.20 1998/01/21 00:25:19 mycroft Exp $");
1995-03-21 12:01:59 +03:00
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
#include <sys/param.h>
#include <sys/stat.h>
1994-09-23 10:14:39 +04:00
#include <err.h>
#include <errno.h>
1994-09-23 10:14:39 +04:00
#include <fts.h>
1993-03-21 12:45:37 +03:00
#include <grp.h>
#include <pwd.h>
#include <stdio.h>
1994-09-23 10:14:39 +04:00
#include <stdlib.h>
#include <string.h>
1994-09-23 10:14:39 +04:00
#include <time.h>
#include <tzfile.h>
#include <unistd.h>
#include <utmp.h>
1993-03-21 12:45:37 +03:00
#include "ls.h"
#include "extern.h"
static int printaname __P((FTSENT *, u_long, u_long));
static void printlink __P((FTSENT *));
static void printtime __P((time_t));
static int printtype __P((u_int));
1993-03-21 12:45:37 +03:00
static time_t now;
#define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT)
void
printscol(dp)
DISPLAY *dp;
1993-03-21 12:45:37 +03:00
{
1994-09-23 10:14:39 +04:00
FTSENT *p;
for (p = dp->list; p; p = p->fts_link) {
if (IS_NOPRINT(p))
continue;
(void)printaname(p, dp->s_inode, dp->s_block);
1993-03-21 12:45:37 +03:00
(void)putchar('\n');
}
}
void
printlong(dp)
DISPLAY *dp;
1993-03-21 12:45:37 +03:00
{
1994-09-23 10:14:39 +04:00
struct stat *sp;
FTSENT *p;
NAMES *np;
char buf[20];
time(&now);
if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
(void)printf("total %lu\n", howmany(dp->btotal, blocksize));
for (p = dp->list; p; p = p->fts_link) {
if (IS_NOPRINT(p))
continue;
sp = p->fts_statp;
1993-03-21 12:45:37 +03:00
if (f_inode)
1997-07-20 22:52:57 +04:00
(void)printf("%*u ", dp->s_inode, sp->st_ino);
1993-03-21 12:45:37 +03:00
if (f_size)
1994-09-23 10:14:39 +04:00
(void)printf("%*qd ",
dp->s_block,
(long long)howmany(sp->st_blocks, blocksize));
(void)strmode(sp->st_mode, buf);
np = p->fts_pointer;
(void)printf("%s %*u %-*s %-*s ", buf, dp->s_nlink,
sp->st_nlink, dp->s_user, np->user, dp->s_group,
np->group);
if (f_flags)
(void)printf("%-*s ", dp->s_flags, np->flags);
if (S_ISCHR(sp->st_mode) || S_ISBLK(sp->st_mode))
(void)printf("%*u, %*u ",
dp->s_major, major(sp->st_rdev), dp->s_minor,
minor(sp->st_rdev));
1993-03-21 12:45:37 +03:00
else
(void)printf("%*qd ", dp->s_size,
(long long)sp->st_size);
1993-03-21 12:45:37 +03:00
if (f_accesstime)
printtime(sp->st_atime);
1993-03-21 12:45:37 +03:00
else if (f_statustime)
printtime(sp->st_ctime);
1993-03-21 12:45:37 +03:00
else
printtime(sp->st_mtime);
(void)printf("%s", p->fts_name);
1993-03-21 12:45:37 +03:00
if (f_type)
(void)printtype(sp->st_mode);
if (S_ISLNK(sp->st_mode))
printlink(p);
1993-03-21 12:45:37 +03:00
(void)putchar('\n');
}
}
void
printcol(dp)
DISPLAY *dp;
1993-03-21 12:45:37 +03:00
{
extern int termwidth;
static FTSENT **array;
static int lastentries = -1;
1994-09-23 10:14:39 +04:00
FTSENT *p;
1997-07-20 22:52:57 +04:00
int base, chcnt, col, colwidth, num;
int numcols, numrows, row;
1993-03-21 12:45:37 +03:00
colwidth = dp->maxlen;
if (f_inode)
colwidth += dp->s_inode + 1;
if (f_size)
colwidth += dp->s_block + 1;
if (f_type)
colwidth += 1;
colwidth += 1;
if (termwidth < 2 * colwidth) {
printscol(dp);
return;
}
/*
* Have to do random access in the linked list -- build a table
* of pointers.
*/
if (dp->entries > lastentries) {
lastentries = dp->entries;
if ((array =
realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) {
1997-07-20 22:52:57 +04:00
warn("%s", "");
printscol(dp);
}
}
for (p = dp->list, num = 0; p; p = p->fts_link)
if (p->fts_number != NO_PRINT)
array[num++] = p;
numcols = termwidth / colwidth;
colwidth = termwidth / numcols; /* spread out if possible */
numrows = num / numcols;
if (num % numcols)
++numrows;
if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
(void)printf("total %lu\n", howmany(dp->btotal, blocksize));
for (row = 0; row < numrows; ++row) {
for (base = row, chcnt = col = 0; col < numcols; ++col) {
chcnt = printaname(array[base], dp->s_inode,
dp->s_block);
if ((base += numrows) >= num)
break;
while (chcnt++ < colwidth)
putchar(' ');
}
(void)putchar('\n');
}
}
void
printacol(dp)
DISPLAY *dp;
{
extern int termwidth;
FTSENT *p;
int chcnt, col, colwidth;
int numcols;
colwidth = dp->maxlen;
1993-03-21 12:45:37 +03:00
if (f_inode)
colwidth += dp->s_inode + 1;
1993-03-21 12:45:37 +03:00
if (f_size)
colwidth += dp->s_block + 1;
1993-03-21 12:45:37 +03:00
if (f_type)
colwidth += 1;
colwidth += 1;
1993-03-21 12:45:37 +03:00
if (termwidth < 2 * colwidth) {
printscol(dp);
1993-03-21 12:45:37 +03:00
return;
}
numcols = termwidth / colwidth;
colwidth = termwidth / numcols; /* spread out if possible */
1993-03-21 12:45:37 +03:00
if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
(void)printf("total %lu\n", howmany(dp->btotal, blocksize));
chcnt = col = 0;
for (p = dp->list; p; p = p->fts_link) {
if (IS_NOPRINT(p))
continue;
if (col >= numcols) {
chcnt = col = 0;
putchar('\n');
1993-03-21 12:45:37 +03:00
}
chcnt = printaname(p, dp->s_inode, dp->s_block);
while (chcnt++ < colwidth)
putchar(' ');
col++;
1993-03-21 12:45:37 +03:00
}
putchar('\n');
1993-03-21 12:45:37 +03:00
}
/*
* print [inode] [size] name
* return # of characters printed, no trailing characters.
1993-03-21 12:45:37 +03:00
*/
static int
printaname(p, inodefield, sizefield)
1994-09-23 10:14:39 +04:00
FTSENT *p;
u_long sizefield, inodefield;
1993-03-21 12:45:37 +03:00
{
struct stat *sp;
1993-03-21 12:45:37 +03:00
int chcnt;
sp = p->fts_statp;
1993-03-21 12:45:37 +03:00
chcnt = 0;
if (f_inode)
1997-07-20 22:52:57 +04:00
chcnt += printf("%*u ", (int)inodefield, sp->st_ino);
1993-03-21 12:45:37 +03:00
if (f_size)
1994-09-23 10:14:39 +04:00
chcnt += printf("%*qd ",
(int)sizefield,
(long long)howmany(sp->st_blocks, blocksize));
chcnt += printf("%s", p->fts_name);
1993-03-21 12:45:37 +03:00
if (f_type)
chcnt += printtype(sp->st_mode);
return (chcnt);
1993-03-21 12:45:37 +03:00
}
static void
1993-03-21 12:45:37 +03:00
printtime(ftime)
time_t ftime;
{
int i;
char *longstring;
1993-03-21 12:45:37 +03:00
longstring = ctime(&ftime);
1993-03-21 12:45:37 +03:00
for (i = 4; i < 11; ++i)
(void)putchar(longstring[i]);
#define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY)
if (f_sectime)
for (i = 11; i < 24; i++)
(void)putchar(longstring[i]);
else if (ftime + SIXMONTHS > now && ftime - SIXMONTHS < now)
1993-03-21 12:45:37 +03:00
for (i = 11; i < 16; ++i)
(void)putchar(longstring[i]);
else {
(void)putchar(' ');
for (i = 20; i < 24; ++i)
(void)putchar(longstring[i]);
}
(void)putchar(' ');
}
static int
1993-03-21 12:45:37 +03:00
printtype(mode)
u_int mode;
1993-03-21 12:45:37 +03:00
{
1994-09-23 10:14:39 +04:00
switch (mode & S_IFMT) {
1993-03-21 12:45:37 +03:00
case S_IFDIR:
(void)putchar('/');
return (1);
1994-09-23 10:14:39 +04:00
case S_IFIFO:
(void)putchar('|');
return (1);
1993-03-21 12:45:37 +03:00
case S_IFLNK:
(void)putchar('@');
return (1);
1993-03-21 12:45:37 +03:00
case S_IFSOCK:
(void)putchar('=');
return (1);
1994-12-28 02:14:46 +03:00
case S_IFWHT:
(void)putchar('%');
return (1);
1993-03-21 12:45:37 +03:00
}
if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) {
(void)putchar('*');
return (1);
1993-03-21 12:45:37 +03:00
}
return (0);
1993-03-21 12:45:37 +03:00
}
static void
printlink(p)
FTSENT *p;
1993-03-21 12:45:37 +03:00
{
int lnklen;
char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1];
if (p->fts_level == FTS_ROOTLEVEL)
(void)snprintf(name, sizeof(name), "%s", p->fts_name);
else
1994-09-23 10:14:39 +04:00
(void)snprintf(name, sizeof(name),
"%s/%s", p->fts_parent->fts_accpath, p->fts_name);
if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) {
1993-03-21 12:45:37 +03:00
(void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
return;
}
path[lnklen] = '\0';
(void)printf(" -> %s", path);
}