Home | History | Annotate | Line # | Download | only in ls
print.c revision 1.40
      1  1.40   mycroft /*	$NetBSD: print.c,v 1.40 2004/11/17 17:00:00 mycroft Exp $	*/
      2  1.13       cgd 
      3   1.1       cgd /*
      4  1.11   mycroft  * Copyright (c) 1989, 1993, 1994
      5  1.11   mycroft  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * This code is derived from software contributed to Berkeley by
      8   1.1       cgd  * Michael Fischbein.
      9   1.1       cgd  *
     10   1.1       cgd  * Redistribution and use in source and binary forms, with or without
     11   1.1       cgd  * modification, are permitted provided that the following conditions
     12   1.1       cgd  * are met:
     13   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     14   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     15   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     16   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     17   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     18  1.35       agc  * 3. Neither the name of the University nor the names of its contributors
     19   1.1       cgd  *    may be used to endorse or promote products derived from this software
     20   1.1       cgd  *    without specific prior written permission.
     21   1.1       cgd  *
     22   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32   1.1       cgd  * SUCH DAMAGE.
     33   1.1       cgd  */
     34   1.1       cgd 
     35  1.16  christos #include <sys/cdefs.h>
     36   1.1       cgd #ifndef lint
     37  1.13       cgd #if 0
     38  1.14       jtc static char sccsid[] = "@(#)print.c	8.5 (Berkeley) 7/28/94";
     39  1.13       cgd #else
     40  1.40   mycroft __RCSID("$NetBSD: print.c,v 1.40 2004/11/17 17:00:00 mycroft Exp $");
     41  1.13       cgd #endif
     42   1.1       cgd #endif /* not lint */
     43   1.1       cgd 
     44   1.1       cgd #include <sys/param.h>
     45   1.1       cgd #include <sys/stat.h>
     46  1.11   mycroft 
     47  1.11   mycroft #include <err.h>
     48  1.11   mycroft #include <errno.h>
     49   1.5   mycroft #include <fts.h>
     50   1.1       cgd #include <grp.h>
     51   1.1       cgd #include <pwd.h>
     52  1.11   mycroft #include <stdio.h>
     53   1.5   mycroft #include <stdlib.h>
     54   1.5   mycroft #include <string.h>
     55  1.11   mycroft #include <time.h>
     56  1.11   mycroft #include <tzfile.h>
     57  1.11   mycroft #include <unistd.h>
     58  1.38     grant #include <util.h>
     59  1.11   mycroft 
     60   1.1       cgd #include "ls.h"
     61   1.5   mycroft #include "extern.h"
     62   1.1       cgd 
     63  1.31  christos extern int termwidth;
     64  1.31  christos 
     65  1.30     lukem static int	printaname(FTSENT *, int, int);
     66  1.30     lukem static void	printlink(FTSENT *);
     67  1.30     lukem static void	printtime(time_t);
     68  1.30     lukem static int	printtype(u_int);
     69   1.5   mycroft 
     70  1.20   mycroft static time_t	now;
     71  1.20   mycroft 
     72   1.5   mycroft #define	IS_NOPRINT(p)	((p)->fts_number == NO_PRINT)
     73   1.5   mycroft 
     74   1.5   mycroft void
     75  1.30     lukem printscol(DISPLAY *dp)
     76   1.1       cgd {
     77  1.11   mycroft 	FTSENT *p;
     78   1.5   mycroft 
     79   1.5   mycroft 	for (p = dp->list; p; p = p->fts_link) {
     80   1.5   mycroft 		if (IS_NOPRINT(p))
     81   1.5   mycroft 			continue;
     82   1.5   mycroft 		(void)printaname(p, dp->s_inode, dp->s_block);
     83   1.1       cgd 		(void)putchar('\n');
     84   1.1       cgd 	}
     85   1.1       cgd }
     86   1.1       cgd 
     87   1.5   mycroft void
     88  1.30     lukem printlong(DISPLAY *dp)
     89   1.5   mycroft {
     90  1.11   mycroft 	struct stat *sp;
     91  1.11   mycroft 	FTSENT *p;
     92   1.5   mycroft 	NAMES *np;
     93  1.38     grant 	char buf[20], szbuf[5];
     94   1.5   mycroft 
     95  1.22   mycroft 	now = time(NULL);
     96  1.20   mycroft 
     97  1.38     grant 	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) {
     98  1.38     grant 		if (f_humanize) {
     99  1.38     grant 			if ((humanize_number(szbuf, sizeof(szbuf), dp->stotal,
    100  1.38     grant 			    "", HN_AUTOSCALE,
    101  1.38     grant 			    (HN_DECIMAL | HN_B | HN_NOSPACE))) == -1)
    102  1.38     grant 				err(1, "humanize_number");
    103  1.38     grant 			(void)printf("total %s\n", szbuf);
    104  1.38     grant 		} else {
    105  1.38     grant 			(void)printf("total %llu\n",
    106  1.38     grant 			    (long long)(howmany(dp->btotal, blocksize)));
    107  1.38     grant 		}
    108  1.38     grant 	}
    109   1.5   mycroft 
    110   1.5   mycroft 	for (p = dp->list; p; p = p->fts_link) {
    111   1.5   mycroft 		if (IS_NOPRINT(p))
    112   1.5   mycroft 			continue;
    113   1.5   mycroft 		sp = p->fts_statp;
    114   1.1       cgd 		if (f_inode)
    115  1.23  christos 			(void)printf("%*lu ", dp->s_inode,
    116  1.23  christos 			    (unsigned long)sp->st_ino);
    117  1.38     grant 		if (f_size && !f_humanize) {
    118  1.24  christos 			(void)printf("%*llu ", dp->s_block,
    119  1.17   thorpej 			    (long long)howmany(sp->st_blocks, blocksize));
    120  1.38     grant 		}
    121   1.5   mycroft 		(void)strmode(sp->st_mode, buf);
    122   1.5   mycroft 		np = p->fts_pointer;
    123  1.34     grant 		(void)printf("%s %*lu ", buf, dp->s_nlink,
    124  1.34     grant 		    (unsigned long)sp->st_nlink);
    125  1.34     grant 		if (!f_grouponly)
    126  1.34     grant 			(void)printf("%-*s  ", dp->s_user, np->user);
    127  1.34     grant 		(void)printf("%-*s  ", dp->s_group, np->group);
    128   1.5   mycroft 		if (f_flags)
    129   1.5   mycroft 			(void)printf("%-*s ", dp->s_flags, np->flags);
    130   1.5   mycroft 		if (S_ISCHR(sp->st_mode) || S_ISBLK(sp->st_mode))
    131  1.18   mycroft 			(void)printf("%*u, %*u ",
    132  1.18   mycroft 			    dp->s_major, major(sp->st_rdev), dp->s_minor,
    133  1.18   mycroft 			    minor(sp->st_rdev));
    134   1.1       cgd 		else
    135  1.38     grant 			if (f_humanize) {
    136  1.38     grant 				if ((humanize_number(szbuf, sizeof(szbuf),
    137  1.38     grant 				    sp->st_size, "", HN_AUTOSCALE,
    138  1.38     grant 				    (HN_DECIMAL | HN_B | HN_NOSPACE))) == -1)
    139  1.38     grant 					err(1, "humanize_number");
    140  1.38     grant 				(void)printf("%*s ", dp->s_size, szbuf);
    141  1.38     grant 			} else {
    142  1.38     grant 				(void)printf("%*llu ", dp->s_size,
    143  1.38     grant 				    (long long)sp->st_size);
    144  1.38     grant 			}
    145   1.1       cgd 		if (f_accesstime)
    146   1.5   mycroft 			printtime(sp->st_atime);
    147   1.1       cgd 		else if (f_statustime)
    148   1.5   mycroft 			printtime(sp->st_ctime);
    149   1.1       cgd 		else
    150   1.5   mycroft 			printtime(sp->st_mtime);
    151  1.37  jschauma 		if (f_octal || f_octal_escape)
    152  1.36  jschauma 			(void)safe_print(p->fts_name);
    153  1.36  jschauma 		else if (f_nonprint)
    154  1.29     assar 			(void)printescaped(p->fts_name);
    155  1.28     assar 		else
    156  1.28     assar 			(void)printf("%s", p->fts_name);
    157  1.28     assar 
    158  1.26    kleink 		if (f_type || (f_typedir && S_ISDIR(sp->st_mode)))
    159   1.5   mycroft 			(void)printtype(sp->st_mode);
    160   1.5   mycroft 		if (S_ISLNK(sp->st_mode))
    161   1.5   mycroft 			printlink(p);
    162   1.1       cgd 		(void)putchar('\n');
    163   1.1       cgd 	}
    164   1.1       cgd }
    165   1.1       cgd 
    166   1.5   mycroft void
    167  1.30     lukem printcol(DISPLAY *dp)
    168   1.1       cgd {
    169   1.5   mycroft 	static FTSENT **array;
    170   1.5   mycroft 	static int lastentries = -1;
    171  1.11   mycroft 	FTSENT *p;
    172  1.16  christos 	int base, chcnt, col, colwidth, num;
    173  1.15   thorpej 	int numcols, numrows, row;
    174  1.38     grant 	char szbuf[5];
    175   1.1       cgd 
    176  1.19     lukem 	colwidth = dp->maxlen;
    177  1.19     lukem 	if (f_inode)
    178  1.19     lukem 		colwidth += dp->s_inode + 1;
    179  1.38     grant 	if (f_size) {
    180  1.38     grant 		if (f_humanize)
    181  1.38     grant 			colwidth += dp->s_size + 1;
    182  1.38     grant 		else
    183  1.38     grant 			colwidth += dp->s_block + 1;
    184  1.38     grant 	}
    185  1.26    kleink 	if (f_type || f_typedir)
    186  1.19     lukem 		colwidth += 1;
    187  1.19     lukem 
    188  1.19     lukem 	colwidth += 1;
    189  1.19     lukem 
    190  1.19     lukem 	if (termwidth < 2 * colwidth) {
    191  1.19     lukem 		printscol(dp);
    192  1.19     lukem 		return;
    193  1.19     lukem 	}
    194  1.19     lukem 
    195   1.5   mycroft 	/*
    196   1.5   mycroft 	 * Have to do random access in the linked list -- build a table
    197   1.5   mycroft 	 * of pointers.
    198   1.5   mycroft 	 */
    199   1.5   mycroft 	if (dp->entries > lastentries) {
    200   1.5   mycroft 		lastentries = dp->entries;
    201   1.5   mycroft 		if ((array =
    202   1.5   mycroft 		    realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) {
    203  1.27  drochner 			warn(NULL);
    204   1.5   mycroft 			printscol(dp);
    205   1.5   mycroft 		}
    206   1.5   mycroft 	}
    207   1.5   mycroft 	for (p = dp->list, num = 0; p; p = p->fts_link)
    208   1.5   mycroft 		if (p->fts_number != NO_PRINT)
    209   1.5   mycroft 			array[num++] = p;
    210   1.5   mycroft 
    211  1.19     lukem 	numcols = termwidth / colwidth;
    212  1.19     lukem 	colwidth = termwidth / numcols;		/* spread out if possible */
    213  1.19     lukem 	numrows = num / numcols;
    214  1.19     lukem 	if (num % numcols)
    215  1.19     lukem 		++numrows;
    216  1.19     lukem 
    217  1.38     grant 	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) {
    218  1.38     grant 		if (f_humanize) {
    219  1.38     grant 			if ((humanize_number(szbuf, sizeof(szbuf), dp->stotal,
    220  1.38     grant 			    "", HN_AUTOSCALE,
    221  1.38     grant 			    (HN_DECIMAL | HN_B | HN_NOSPACE))) == -1)
    222  1.38     grant 				err(1, "humanize_number");
    223  1.38     grant 			(void)printf("total %s\n", szbuf);
    224  1.38     grant 		} else {
    225  1.38     grant 			(void)printf("total %llu\n",
    226  1.38     grant 			    (long long)(howmany(dp->btotal, blocksize)));
    227  1.38     grant 		}
    228  1.38     grant 	}
    229  1.19     lukem 	for (row = 0; row < numrows; ++row) {
    230  1.19     lukem 		for (base = row, chcnt = col = 0; col < numcols; ++col) {
    231  1.19     lukem 			chcnt = printaname(array[base], dp->s_inode,
    232  1.38     grant 			    f_humanize ? dp->s_size : dp->s_block);
    233  1.19     lukem 			if ((base += numrows) >= num)
    234  1.19     lukem 				break;
    235  1.19     lukem 			while (chcnt++ < colwidth)
    236  1.22   mycroft 				(void)putchar(' ');
    237  1.19     lukem 		}
    238  1.19     lukem 		(void)putchar('\n');
    239  1.19     lukem 	}
    240  1.19     lukem }
    241  1.19     lukem 
    242  1.19     lukem void
    243  1.30     lukem printacol(DISPLAY *dp)
    244  1.19     lukem {
    245  1.19     lukem 	FTSENT *p;
    246  1.19     lukem 	int chcnt, col, colwidth;
    247  1.19     lukem 	int numcols;
    248  1.38     grant 	char szbuf[5];
    249  1.19     lukem 
    250   1.5   mycroft 	colwidth = dp->maxlen;
    251   1.1       cgd 	if (f_inode)
    252   1.5   mycroft 		colwidth += dp->s_inode + 1;
    253  1.38     grant 	if (f_size) {
    254  1.38     grant 		if (f_humanize)
    255  1.38     grant 			colwidth += dp->s_size + 1;
    256  1.38     grant 		else
    257  1.38     grant 			colwidth += dp->s_block + 1;
    258  1.38     grant 	}
    259  1.26    kleink 	if (f_type || f_typedir)
    260   1.1       cgd 		colwidth += 1;
    261   1.1       cgd 
    262  1.15   thorpej 	colwidth += 1;
    263  1.15   thorpej 
    264   1.1       cgd 	if (termwidth < 2 * colwidth) {
    265   1.5   mycroft 		printscol(dp);
    266   1.1       cgd 		return;
    267   1.1       cgd 	}
    268   1.1       cgd 
    269   1.1       cgd 	numcols = termwidth / colwidth;
    270  1.15   thorpej 	colwidth = termwidth / numcols;		/* spread out if possible */
    271   1.1       cgd 
    272  1.38     grant 	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) {
    273  1.38     grant 		if (f_humanize) {
    274  1.38     grant 			if ((humanize_number(szbuf, sizeof(szbuf), dp->stotal,
    275  1.38     grant 			    "", HN_AUTOSCALE,
    276  1.38     grant 			    (HN_DECIMAL | HN_B | HN_NOSPACE))) == -1)
    277  1.38     grant 				err(1, "humanize_number");
    278  1.38     grant 			(void)printf("total %s\n", szbuf);
    279  1.38     grant 		} else {
    280  1.38     grant 			(void)printf("total %llu\n",
    281  1.38     grant 			    (long long)(howmany(dp->btotal, blocksize)));
    282  1.38     grant 		}
    283  1.38     grant 	}
    284  1.19     lukem 	chcnt = col = 0;
    285  1.19     lukem 	for (p = dp->list; p; p = p->fts_link) {
    286  1.19     lukem 		if (IS_NOPRINT(p))
    287  1.19     lukem 			continue;
    288  1.19     lukem 		if (col >= numcols) {
    289  1.19     lukem 			chcnt = col = 0;
    290  1.22   mycroft 			(void)putchar('\n');
    291   1.1       cgd 		}
    292  1.38     grant 		chcnt = printaname(p, dp->s_inode,
    293  1.38     grant 		    f_humanize ? dp->s_size : dp->s_block);
    294  1.19     lukem 		while (chcnt++ < colwidth)
    295  1.22   mycroft 			(void)putchar(' ');
    296  1.19     lukem 		col++;
    297  1.25    kleink 	}
    298  1.25    kleink 	(void)putchar('\n');
    299  1.25    kleink }
    300  1.25    kleink 
    301  1.25    kleink void
    302  1.30     lukem printstream(DISPLAY *dp)
    303  1.25    kleink {
    304  1.25    kleink 	FTSENT *p;
    305  1.25    kleink 	int col;
    306  1.25    kleink 	int extwidth;
    307  1.25    kleink 
    308  1.25    kleink 	extwidth = 0;
    309  1.25    kleink 	if (f_inode)
    310  1.25    kleink 		extwidth += dp->s_inode + 1;
    311  1.38     grant 	if (f_size) {
    312  1.38     grant 		if (f_humanize)
    313  1.38     grant 			extwidth += dp->s_size + 1;
    314  1.38     grant 		else
    315  1.38     grant 			extwidth += dp->s_block + 1;
    316  1.38     grant 	}
    317  1.25    kleink 	if (f_type)
    318  1.25    kleink 		extwidth += 1;
    319  1.25    kleink 
    320  1.25    kleink 	for (col = 0, p = dp->list; p != NULL; p = p->fts_link) {
    321  1.25    kleink 		if (IS_NOPRINT(p))
    322  1.25    kleink 			continue;
    323  1.25    kleink 		if (col > 0) {
    324  1.25    kleink 			(void)putchar(','), col++;
    325  1.25    kleink 			if (col + 1 + extwidth + p->fts_namelen >= termwidth)
    326  1.25    kleink 				(void)putchar('\n'), col = 0;
    327  1.25    kleink 			else
    328  1.25    kleink 				(void)putchar(' '), col++;
    329  1.25    kleink 		}
    330  1.38     grant 		col += printaname(p, dp->s_inode,
    331  1.38     grant 		    f_humanize ? dp->s_size : dp->s_block);
    332   1.1       cgd 	}
    333  1.22   mycroft 	(void)putchar('\n');
    334   1.1       cgd }
    335   1.1       cgd 
    336   1.1       cgd /*
    337   1.1       cgd  * print [inode] [size] name
    338   1.5   mycroft  * return # of characters printed, no trailing characters.
    339   1.1       cgd  */
    340   1.5   mycroft static int
    341  1.30     lukem printaname(FTSENT *p, int inodefield, int sizefield)
    342   1.1       cgd {
    343   1.5   mycroft 	struct stat *sp;
    344   1.1       cgd 	int chcnt;
    345  1.38     grant 	char szbuf[5];
    346   1.1       cgd 
    347   1.5   mycroft 	sp = p->fts_statp;
    348   1.1       cgd 	chcnt = 0;
    349   1.1       cgd 	if (f_inode)
    350  1.23  christos 		chcnt += printf("%*lu ", inodefield, (unsigned long)sp->st_ino);
    351  1.38     grant 	if (f_size) {
    352  1.38     grant 		if (f_humanize) {
    353  1.38     grant 			if ((humanize_number(szbuf, sizeof(szbuf), sp->st_size,
    354  1.38     grant 			    "", HN_AUTOSCALE,
    355  1.38     grant 			    (HN_DECIMAL | HN_B | HN_NOSPACE))) == -1)
    356  1.38     grant 				err(1, "humanize_number");
    357  1.38     grant 			chcnt += printf("%*s ", sizefield, szbuf);
    358  1.38     grant 		} else {
    359  1.38     grant 			chcnt += printf("%*llu ", sizefield,
    360  1.38     grant 			    (long long)howmany(sp->st_blocks, blocksize));
    361  1.38     grant 		}
    362  1.38     grant 	}
    363  1.37  jschauma 	if (f_octal || f_octal_escape)
    364  1.36  jschauma 		chcnt += safe_print(p->fts_name);
    365  1.36  jschauma 	else if (f_nonprint)
    366  1.36  jschauma 		chcnt += printescaped(p->fts_name);
    367  1.29     assar 	else
    368  1.36  jschauma 		chcnt += printf("%s", p->fts_name);
    369  1.26    kleink 	if (f_type || (f_typedir && S_ISDIR(sp->st_mode)))
    370   1.5   mycroft 		chcnt += printtype(sp->st_mode);
    371   1.5   mycroft 	return (chcnt);
    372   1.1       cgd }
    373   1.1       cgd 
    374   1.5   mycroft static void
    375  1.30     lukem printtime(time_t ftime)
    376   1.1       cgd {
    377   1.1       cgd 	int i;
    378   1.5   mycroft 	char *longstring;
    379   1.1       cgd 
    380   1.5   mycroft 	longstring = ctime(&ftime);
    381   1.1       cgd 	for (i = 4; i < 11; ++i)
    382   1.1       cgd 		(void)putchar(longstring[i]);
    383   1.1       cgd 
    384   1.1       cgd #define	SIXMONTHS	((DAYSPERNYEAR / 2) * SECSPERDAY)
    385   1.1       cgd 	if (f_sectime)
    386   1.1       cgd 		for (i = 11; i < 24; i++)
    387   1.1       cgd 			(void)putchar(longstring[i]);
    388  1.40   mycroft 	else if (ftime + SIXMONTHS > now && ftime - SIXMONTHS < now)
    389   1.1       cgd 		for (i = 11; i < 16; ++i)
    390   1.1       cgd 			(void)putchar(longstring[i]);
    391   1.1       cgd 	else {
    392   1.1       cgd 		(void)putchar(' ');
    393   1.1       cgd 		for (i = 20; i < 24; ++i)
    394   1.1       cgd 			(void)putchar(longstring[i]);
    395   1.1       cgd 	}
    396   1.1       cgd 	(void)putchar(' ');
    397   1.1       cgd }
    398   1.1       cgd 
    399   1.5   mycroft static int
    400  1.30     lukem printtype(u_int mode)
    401   1.1       cgd {
    402  1.11   mycroft 	switch (mode & S_IFMT) {
    403   1.1       cgd 	case S_IFDIR:
    404   1.1       cgd 		(void)putchar('/');
    405   1.5   mycroft 		return (1);
    406  1.11   mycroft 	case S_IFIFO:
    407  1.11   mycroft 		(void)putchar('|');
    408  1.11   mycroft 		return (1);
    409   1.1       cgd 	case S_IFLNK:
    410   1.1       cgd 		(void)putchar('@');
    411   1.5   mycroft 		return (1);
    412   1.1       cgd 	case S_IFSOCK:
    413   1.1       cgd 		(void)putchar('=');
    414  1.12   mycroft 		return (1);
    415  1.12   mycroft 	case S_IFWHT:
    416  1.12   mycroft 		(void)putchar('%');
    417   1.6       jtc 		return (1);
    418   1.1       cgd 	}
    419   1.1       cgd 	if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) {
    420   1.1       cgd 		(void)putchar('*');
    421   1.5   mycroft 		return (1);
    422   1.1       cgd 	}
    423   1.5   mycroft 	return (0);
    424   1.1       cgd }
    425   1.1       cgd 
    426   1.5   mycroft static void
    427  1.30     lukem printlink(FTSENT *p)
    428   1.1       cgd {
    429   1.1       cgd 	int lnklen;
    430   1.5   mycroft 	char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1];
    431   1.5   mycroft 
    432   1.5   mycroft 	if (p->fts_level == FTS_ROOTLEVEL)
    433   1.5   mycroft 		(void)snprintf(name, sizeof(name), "%s", p->fts_name);
    434  1.33     enami 	else
    435  1.11   mycroft 		(void)snprintf(name, sizeof(name),
    436  1.11   mycroft 		    "%s/%s", p->fts_parent->fts_accpath, p->fts_name);
    437  1.11   mycroft 	if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) {
    438   1.1       cgd 		(void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
    439   1.1       cgd 		return;
    440   1.1       cgd 	}
    441   1.1       cgd 	path[lnklen] = '\0';
    442  1.28     assar 	(void)printf(" -> ");
    443  1.37  jschauma 	if (f_octal || f_octal_escape)
    444  1.36  jschauma 		(void)safe_print(path);
    445  1.36  jschauma 	else if (f_nonprint)
    446  1.36  jschauma 		(void)printescaped(path);
    447  1.28     assar 	else
    448  1.28     assar 		(void)printf("%s", path);
    449   1.1       cgd }
    450