Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	bin/ls/print.c	Lines:	50	165	30.3 %
Date:	2016-12-06	Branches:	35	173	20.2 %


/*	$OpenBSD: print.c,v 1.35 2015/12/01 18:36:13 schwarze Exp $	*/
/*	$NetBSD: print.c,v 1.15 1996/12/11 03:25:39 thorpej Exp $	*/

/*
 * Copyright (c) 1989, 1993, 1994
 *	The Regents of the University of California.  All rights reserved.
 *
 * 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. 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.
 */

#include <sys/types.h>
#include <sys/stat.h>

#include <err.h>
#include <errno.h>
#include <fts.h>
#include <grp.h>
#include <pwd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include <limits.h>
#include <util.h>

#include "ls.h"
#include "extern.h"

static int	printaname(FTSENT *, u_long, u_long);
static void	printlink(FTSENT *);
static void	printsize(size_t, off_t);
static void	printtime(time_t);
static int	printtype(u_int);
static int	compute_columns(DISPLAY *, int *);

#define	IS_NOPRINT(p)	((p)->fts_number == NO_PRINT)

#define	DATELEN		64

#define	SECSPERDAY	(24 * 60 * 60)
#define	SIXMONTHS	(SECSPERDAY * 365 / 2)

void
printscol(DISPLAY *dp)
{
	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);
		(void)putchar('\n');
	}
}

void
printlong(DISPLAY *dp)
{
	struct stat *sp;
	FTSENT *p;
	NAMES *np;
	char buf[20];

	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
		(void)printf("total %llu\n", howmany(dp->btotal, blocksize));

	for (p = dp->list; p; p = p->fts_link) {
		if (IS_NOPRINT(p))
			continue;
		sp = p->fts_statp;
		if (f_inode)
			(void)printf("%*llu ", dp->s_inode,
			    (unsigned long long)sp->st_ino);
		if (f_size)
			(void)printf("%*qd ",
			    dp->s_block, howmany(sp->st_blocks, blocksize));
		(void)strmode(sp->st_mode, buf);
		np = p->fts_pointer;
		(void)printf("%s %*u ", buf, dp->s_nlink, sp->st_nlink);
		if (!f_grouponly)
			(void)printf("%-*s  ", dp->s_user, np->user);
		(void)printf("%-*s  ", 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("%3d, %3d ",
			    major(sp->st_rdev), minor(sp->st_rdev));
		else if (dp->bcfile)
			(void)printf("%*s%*qd ",
			    8 - dp->s_size, "", dp->s_size, sp->st_size);
		else
			printsize(dp->s_size, sp->st_size);
		if (f_accesstime)
			printtime(sp->st_atime);
		else if (f_statustime)
			printtime(sp->st_ctime);
		else
			printtime(sp->st_mtime);
		(void)mbsprint(p->fts_name, 1);
		if (f_type || (f_typedir && S_ISDIR(sp->st_mode)))
			(void)printtype(sp->st_mode);
		if (S_ISLNK(sp->st_mode))
			printlink(p);
		(void)putchar('\n');
	}
}

static int
compute_columns(DISPLAY *dp, int *pnum)
{
	int colwidth;
	extern int termwidth;
	int mywidth;

	colwidth = dp->maxlen;
	if (f_inode)
		colwidth += dp->s_inode + 1;
	if (f_size)
		colwidth += dp->s_block + 1;
	if (f_type || f_typedir)
		colwidth += 1;

	colwidth += 1;
	mywidth = termwidth + 1;	/* no extra space for last column */

	if (mywidth < 2 * colwidth) {
		printscol(dp);
		return (0);
	}

	*pnum = mywidth / colwidth;
	return (mywidth / *pnum);		/* spread out if possible */
}

void
printcol(DISPLAY *dp)
{
	static FTSENT **array;
	static int lastentries = -1;
	FTSENT *p;
	int base, chcnt, col, colwidth, num;
	int numcols, numrows, row;

	if ((colwidth = compute_columns(dp, &numcols)) == 0)
		return;
	/*
	 * Have to do random access in the linked list -- build a table
	 * of pointers.
	 */
	if (dp->entries > lastentries) {
		FTSENT **a;

		if ((a = reallocarray(array, dp->entries, sizeof(FTSENT *))) ==
		    NULL) {
			free(array);
			array = NULL;
			dp->entries = 0;
			lastentries = -1;
			warn(NULL);
			printscol(dp);
			return;
		}
		lastentries = dp->entries;
		array = a;
	}
	for (p = dp->list, num = 0; p; p = p->fts_link)
		if (p->fts_number != NO_PRINT)
			array[num++] = p;

	numrows = num / numcols;
	if (num % numcols)
		++numrows;

	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
		(void)printf("total %llu\n", howmany(dp->btotal, blocksize));
	for (row = 0; row < numrows; ++row) {
		for (base = row, col = 0;;) {
			chcnt = printaname(array[base], dp->s_inode, dp->s_block);
			if ((base += numrows) >= num)
				break;
			if (++col == numcols)
				break;
			while (chcnt++ < colwidth)
				putchar(' ');
		}
		(void)putchar('\n');
	}
}

/*
 * print [inode] [size] name
 * return # of characters printed, no trailing characters.
 */
static int
printaname(FTSENT *p, u_long inodefield, u_long sizefield)
{
	struct stat *sp;
	int chcnt;

	sp = p->fts_statp;
	chcnt = 0;
	if (f_inode)
		chcnt += printf("%*llu ", (int)inodefield,
		    (unsigned long long)sp->st_ino);
	if (f_size)
		chcnt += printf("%*qd ",
		    (int)sizefield, howmany(sp->st_blocks, blocksize));
	chcnt += mbsprint(p->fts_name, 1);
	if (f_type || (f_typedir && S_ISDIR(sp->st_mode)))
		chcnt += printtype(sp->st_mode);
	return (chcnt);
}

static void
printtime(time_t ftime)
{
	char f_date[DATELEN];
	static time_t now;
	static int now_set = 0;

	if (! now_set) {
		now = time(NULL);
		now_set = 1;
	}

	/*
	 * convert time to string, and print
	 */
	if (strftime(f_date, sizeof(f_date), f_sectime ? "%b %e %H:%M:%S %Y" :
	    (ftime <= now - SIXMONTHS || ftime > now) ? "%b %e  %Y" :
	    "%b %e %H:%M", localtime(&ftime)) == 0)
		f_date[0] = '\0';

	printf("%s ", f_date);
}

void
printacol(DISPLAY *dp)
{
	FTSENT *p;
	int chcnt, col, colwidth;
	int numcols;

	if ( (colwidth = compute_columns(dp, &numcols)) == 0)
		return;

	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
		(void)printf("total %llu\n", howmany(dp->btotal, blocksize));
	col = 0;
	for (p = dp->list; p; p = p->fts_link) {
		if (IS_NOPRINT(p))
			continue;
		if (col >= numcols) {
			col = 0;
			(void)putchar('\n');
		}
		chcnt = printaname(p, dp->s_inode, dp->s_block);
		col++;
		if (col < numcols)
			while (chcnt++ < colwidth)
				(void)putchar(' ');
	}
	(void)putchar('\n');
}

void
printstream(DISPLAY *dp)
{
	extern int termwidth;
	FTSENT *p;
	int col;
	int extwidth;

	extwidth = 0;
	if (f_inode)
		extwidth += dp->s_inode + 1;
	if (f_size)
		extwidth += dp->s_block + 1;
	if (f_type)
		extwidth += 1;

	for (col = 0, p = dp->list; p != NULL; p = p->fts_link) {
		if (IS_NOPRINT(p))
			continue;
		if (col > 0) {
			(void)putchar(','), col++;
			if (col + 1 + extwidth + mbsprint(p->fts_name, 0) >=
			    termwidth)
				(void)putchar('\n'), col = 0;
			else
				(void)putchar(' '), col++;
		}
		col += printaname(p, dp->s_inode, dp->s_block);
	}
	(void)putchar('\n');
}

static int
printtype(u_int mode)
{
	switch (mode & S_IFMT) {
	case S_IFDIR:
		(void)putchar('/');
		return (1);
	case S_IFIFO:
		(void)putchar('|');
		return (1);
	case S_IFLNK:
		(void)putchar('@');
		return (1);
	case S_IFSOCK:
		(void)putchar('=');
		return (1);
	}
	if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) {
		(void)putchar('*');
		return (1);
	}
	return (0);
}

static void
printlink(FTSENT *p)
{
	int lnklen;
	char name[PATH_MAX], path[PATH_MAX];

	if (p->fts_level == FTS_ROOTLEVEL)
		(void)snprintf(name, sizeof(name), "%s", p->fts_name);
	else
		(void)snprintf(name, sizeof(name),
		    "%s/%s", p->fts_parent->fts_accpath, p->fts_name);
	if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) {
		(void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
		return;
	}
	path[lnklen] = '\0';
	(void)printf(" -> ");
	(void)mbsprint(path, 1);
}

static void
printsize(size_t width, off_t bytes)
{
	char ret[FMT_SCALED_STRSIZE];

	if ((f_humanval) && (fmt_scaled(bytes, ret) != -1)) {
		(void)printf("%*s ", (u_int)width, ret);
		return;
	}
	(void)printf("%*qd ", (u_int)width, bytes);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: print.c,v 1.35 2015/12/01 18:36:13 schwarze Exp $ */
2			/* $NetBSD: print.c,v 1.15 1996/12/11 03:25:39 thorpej Exp $ */
3
4			/*
5			* Copyright (c) 1989, 1993, 1994
6			* The Regents of the University of California. All rights reserved.
7			*
8			* This code is derived from software contributed to Berkeley by
9			* Michael Fischbein.
10			*
11			* Redistribution and use in source and binary forms, with or without
12			* modification, are permitted provided that the following conditions
13			* are met:
14			* 1. Redistributions of source code must retain the above copyright
15			* notice, this list of conditions and the following disclaimer.
16			* 2. Redistributions in binary form must reproduce the above copyright
17			* notice, this list of conditions and the following disclaimer in the
18			* documentation and/or other materials provided with the distribution.
19			* 3. Neither the name of the University nor the names of its contributors
20			* may be used to endorse or promote products derived from this software
21			* without specific prior written permission.
22			*
23			* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24			* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26			* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27			* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28			* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29			* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31			* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32			* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33			* SUCH DAMAGE.
34			*/
35
36			#include <sys/types.h>
37			#include <sys/stat.h>
38
39			#include <err.h>
40			#include <errno.h>
41			#include <fts.h>
42			#include <grp.h>
43			#include <pwd.h>
44			#include <stdio.h>
45			#include <stdlib.h>
46			#include <string.h>
47			#include <time.h>
48			#include <unistd.h>
49			#include <limits.h>
50			#include <util.h>
51
52			#include "ls.h"
53			#include "extern.h"
54
55			static int printaname(FTSENT *, u_long, u_long);
56			static void printlink(FTSENT *);
57			static void printsize(size_t, off_t);
58			static void printtime(time_t);
59			static int printtype(u_int);
60			static int compute_columns(DISPLAY , int );
61
62			#define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT)
63
64			#define DATELEN 64
65
66			#define SECSPERDAY (24 * 60 * 60)
67			#define SIXMONTHS (SECSPERDAY * 365 / 2)
68
69			void
70			printscol(DISPLAY *dp)
71		95	{
72			FTSENT *p;
73
74	✓✓	2816	for (p = dp->list; p; p = p->fts_link) {
75	✗✓	2721	if (IS_NOPRINT(p))
76			continue;
77		2721	(void)printaname(p, dp->s_inode, dp->s_block);
78	✓✗	2721	(void)putchar('\n');
79			}
80		95	}
81
82			void
83			printlong(DISPLAY *dp)
84			{
85			struct stat *sp;
86			FTSENT *p;
87			NAMES *np;
88			char buf[20];
89
90			if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform \|\| f_size))
91			(void)printf("total %llu\n", howmany(dp->btotal, blocksize));
92
93			for (p = dp->list; p; p = p->fts_link) {
94			if (IS_NOPRINT(p))
95			continue;
96			sp = p->fts_statp;
97			if (f_inode)
98			(void)printf("%*llu ", dp->s_inode,
99			(unsigned long long)sp->st_ino);
100			if (f_size)
101			(void)printf("%*qd ",
102			dp->s_block, howmany(sp->st_blocks, blocksize));
103			(void)strmode(sp->st_mode, buf);
104			np = p->fts_pointer;
105			(void)printf("%s %*u ", buf, dp->s_nlink, sp->st_nlink);
106			if (!f_grouponly)
107			(void)printf("%-*s ", dp->s_user, np->user);
108			(void)printf("%-*s ", dp->s_group, np->group);
109			if (f_flags)
110			(void)printf("%-*s ", dp->s_flags, np->flags);
111			if (S_ISCHR(sp->st_mode) \|\| S_ISBLK(sp->st_mode))
112			(void)printf("%3d, %3d ",
113			major(sp->st_rdev), minor(sp->st_rdev));
114			else if (dp->bcfile)
115			(void)printf("%s%qd ",
116			8 - dp->s_size, "", dp->s_size, sp->st_size);
117			else
118			printsize(dp->s_size, sp->st_size);
119			if (f_accesstime)
120			printtime(sp->st_atime);
121			else if (f_statustime)
122			printtime(sp->st_ctime);
123			else
124			printtime(sp->st_mtime);
125			(void)mbsprint(p->fts_name, 1);
126			if (f_type \|\| (f_typedir && S_ISDIR(sp->st_mode)))
127			(void)printtype(sp->st_mode);
128			if (S_ISLNK(sp->st_mode))
129			printlink(p);
130			(void)putchar('\n');
131			}
132			}
133
134			static int
135			compute_columns(DISPLAY dp, int pnum)
136		6	{
137			int colwidth;
138			extern int termwidth;
139			int mywidth;
140
141		6	colwidth = dp->maxlen;
142	✗✓	6	if (f_inode)
143			colwidth += dp->s_inode + 1;
144	✗✓	6	if (f_size)
145			colwidth += dp->s_block + 1;
146	✓✗✗✓	6	if (f_type \|\| f_typedir)
147			colwidth += 1;
148
149		6	colwidth += 1;
150		6	mywidth = termwidth + 1; /* no extra space for last column */
151
152	✓✓	6	if (mywidth < 2 * colwidth) {
153		1	printscol(dp);
154		1	return (0);
155			}
156
157		5	*pnum = mywidth / colwidth;
158		5	return (mywidth / pnum); / spread out if possible */
159			}
160
161			void
162			printcol(DISPLAY *dp)
163		6	{
164			static FTSENT **array;
165			static int lastentries = -1;
166			FTSENT *p;
167			int base, chcnt, col, colwidth, num;
168			int numcols, numrows, row;
169
170	✓✓	6	if ((colwidth = compute_columns(dp, &numcols)) == 0)
171		1	return;
172			/*
173			* Have to do random access in the linked list -- build a table
174			* of pointers.
175			*/
176	✓✗	5	if (dp->entries > lastentries) {
177			FTSENT **a;
178
179	✗✓	5	if ((a = reallocarray(array, dp->entries, sizeof(FTSENT *))) ==
180			NULL) {
181			free(array);
182			array = NULL;
183			dp->entries = 0;
184			lastentries = -1;
185			warn(NULL);
186			printscol(dp);
187			return;
188			}
189		5	lastentries = dp->entries;
190		5	array = a;
191			}
192	✓✓	86	for (p = dp->list, num = 0; p; p = p->fts_link)
193	✓✗	81	if (p->fts_number != NO_PRINT)
194		81	array[num++] = p;
195
196		5	numrows = num / numcols;
197	✓✗	5	if (num % numcols)
198		5	++numrows;
199
200	✓✗✓✗ ✗✓	5	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform \|\| f_size))
201			(void)printf("total %llu\n", howmany(dp->btotal, blocksize));
202	✓✓	18	for (row = 0; row < numrows; ++row) {
203		13	for (base = row, col = 0;;) {
204		81	chcnt = printaname(array[base], dp->s_inode, dp->s_block);
205	✓✓	81	if ((base += numrows) >= num)
206		13	break;
207	✗✓	68	if (++col == numcols)
208			break;
209	✓✓	667	while (chcnt++ < colwidth)
210	✓✗	599	putchar(' ');
211			}
212	✓✗	13	(void)putchar('\n');
213			}
214			}
215
216			/*
217			* print [inode] [size] name
218			* return # of characters printed, no trailing characters.
219			*/
220			static int
221			printaname(FTSENT *p, u_long inodefield, u_long sizefield)
222		2802	{
223			struct stat *sp;
224			int chcnt;
225
226		2802	sp = p->fts_statp;
227		2802	chcnt = 0;
228	✓✓	2802	if (f_inode)
229		4	chcnt += printf("%*llu ", (int)inodefield,
230			(unsigned long long)sp->st_ino);
231	✗✓	2802	if (f_size)
232			chcnt += printf("%*qd ",
233			(int)sizefield, howmany(sp->st_blocks, blocksize));
234		2802	chcnt += mbsprint(p->fts_name, 1);
235	✓✗✗✓ ✗✗	2802	if (f_type \|\| (f_typedir && S_ISDIR(sp->st_mode)))
236			chcnt += printtype(sp->st_mode);
237		2802	return (chcnt);
238			}
239
240			static void
241			printtime(time_t ftime)
242			{
243			char f_date[DATELEN];
244			static time_t now;
245			static int now_set = 0;
246
247			if (! now_set) {
248			now = time(NULL);
249			now_set = 1;
250			}
251
252			/*
253			* convert time to string, and print
254			*/
255			if (strftime(f_date, sizeof(f_date), f_sectime ? "%b %e %H:%M:%S %Y" :
256			(ftime <= now - SIXMONTHS \|\| ftime > now) ? "%b %e %Y" :
257			"%b %e %H:%M", localtime(&ftime)) == 0)
258			f_date[0] = '\0';
259
260			printf("%s ", f_date);
261			}
262
263			void
264			printacol(DISPLAY *dp)
265			{
266			FTSENT *p;
267			int chcnt, col, colwidth;
268			int numcols;
269
270			if ( (colwidth = compute_columns(dp, &numcols)) == 0)
271			return;
272
273			if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform \|\| f_size))
274			(void)printf("total %llu\n", howmany(dp->btotal, blocksize));
275			col = 0;
276			for (p = dp->list; p; p = p->fts_link) {
277			if (IS_NOPRINT(p))
278			continue;
279			if (col >= numcols) {
280			col = 0;
281			(void)putchar('\n');
282			}
283			chcnt = printaname(p, dp->s_inode, dp->s_block);
284			col++;
285			if (col < numcols)
286			while (chcnt++ < colwidth)
287			(void)putchar(' ');
288			}
289			(void)putchar('\n');
290			}
291
292			void
293			printstream(DISPLAY *dp)
294			{
295			extern int termwidth;
296			FTSENT *p;
297			int col;
298			int extwidth;
299
300			extwidth = 0;
301			if (f_inode)
302			extwidth += dp->s_inode + 1;
303			if (f_size)
304			extwidth += dp->s_block + 1;
305			if (f_type)
306			extwidth += 1;
307
308			for (col = 0, p = dp->list; p != NULL; p = p->fts_link) {
309			if (IS_NOPRINT(p))
310			continue;
311			if (col > 0) {
312			(void)putchar(','), col++;
313			if (col + 1 + extwidth + mbsprint(p->fts_name, 0) >=
314			termwidth)
315			(void)putchar('\n'), col = 0;
316			else
317			(void)putchar(' '), col++;
318			}
319			col += printaname(p, dp->s_inode, dp->s_block);
320			}
321			(void)putchar('\n');
322			}
323
324			static int
325			printtype(u_int mode)
326			{
327			switch (mode & S_IFMT) {
328			case S_IFDIR:
329			(void)putchar('/');
330			return (1);
331			case S_IFIFO:
332			(void)putchar('\|');
333			return (1);
334			case S_IFLNK:
335			(void)putchar('@');
336			return (1);
337			case S_IFSOCK:
338			(void)putchar('=');
339			return (1);
340			}
341			if (mode & (S_IXUSR \| S_IXGRP \| S_IXOTH)) {
342			(void)putchar('*');
343			return (1);
344			}
345			return (0);
346			}
347
348			static void
349			printlink(FTSENT *p)
350			{
351			int lnklen;
352			char name[PATH_MAX], path[PATH_MAX];
353
354			if (p->fts_level == FTS_ROOTLEVEL)
355			(void)snprintf(name, sizeof(name), "%s", p->fts_name);
356			else
357			(void)snprintf(name, sizeof(name),
358			"%s/%s", p->fts_parent->fts_accpath, p->fts_name);
359			if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) {
360			(void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
361			return;
362			}
363			path[lnklen] = '\0';
364			(void)printf(" -> ");
365			(void)mbsprint(path, 1);
366			}
367
368			static void
369			printsize(size_t width, off_t bytes)
370			{
371			char ret[FMT_SCALED_STRSIZE];
372
373			if ((f_humanval) && (fmt_scaled(bytes, ret) != -1)) {
374			(void)printf("%*s ", (u_int)width, ret);
375			return;
376			}
377			(void)printf("%*qd ", (u_int)width, bytes);
378			}