386BSD 0.0 development

Work on file usr/src/bin/ls/cmp.c
Work on file usr/src/bin/ls/print.c
Work on file usr/src/bin/ls/ls.c
Work on file usr/src/bin/ls/ls.h
Work on file usr/src/bin/ls/util.c

Co-Authored-By: Lynne Greer Jolitz <ljolitz@cardio.ucsf.edu>
Synthesized-from: 386BSD-0.0/src

diff --git a/usr/src/bin/ls/cmp.c b/usr/src/bin/ls/cmp.c
new file mode 100644 (file)
index 0000000..1c8d3d5
--- /dev/null
+++ b/usr/src/bin/ls/cmp.c
@@ -0,0 +1,91 @@
+/*
+ * Copyright (c) 1989 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. 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
+static char sccsid[] = "@(#)cmp.c      5.4 (Berkeley) 3/8/91";
+#endif /* not lint */
+
+#include <sys/types.h>
+#include <sys/stat.h>
+#include "ls.h"
+
+namecmp(a, b)
+       LS *a, *b;
+{
+       return(strcmp(a->name, b->name));
+}
+
+revnamecmp(a, b)
+       LS *a, *b;
+{
+       return(strcmp(b->name, a->name));
+}
+
+modcmp(a, b)
+       LS *a, *b;
+{
+       return(b->lstat.st_mtime - a->lstat.st_mtime);
+}
+
+revmodcmp(a, b)
+       LS *a, *b;
+{
+       return(a->lstat.st_mtime - b->lstat.st_mtime);
+}
+
+acccmp(a, b)
+       LS *a, *b;
+{
+       return(b->lstat.st_atime - a->lstat.st_atime);
+}
+
+revacccmp(a, b)
+       LS *a, *b;
+{
+       return(a->lstat.st_atime - b->lstat.st_atime);
+}
+
+statcmp(a, b)
+       LS *a, *b;
+{
+       return(b->lstat.st_ctime - a->lstat.st_ctime);
+}
+
+revstatcmp(a, b)
+       LS *a, *b;
+{
+       return(a->lstat.st_ctime - b->lstat.st_ctime);
+}

diff --git a/usr/src/bin/ls/ls.c b/usr/src/bin/ls/ls.c
new file mode 100644 (file)
index 0000000..00e5626
--- /dev/null
+++ b/usr/src/bin/ls/ls.c
@@ -0,0 +1,497 @@
+/*
+ * Copyright (c) 1989 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. 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
+char copyright[] =
+"@(#) Copyright (c) 1989 The Regents of the University of California.\n\
+ All rights reserved.\n";
+#endif /* not lint */
+
+#ifndef lint
+static char sccsid[] = "@(#)ls.c       5.48 (Berkeley) 4/3/91";
+#endif /* not lint */
+
+#include <sys/param.h>
+#include <sys/stat.h>
+#include <sys/ioctl.h>
+#include <dirent.h>
+#include <string.h>
+#include <errno.h>
+#include <stdio.h>
+#include "ls.h"
+
+int (*sortfcn)(), (*printfcn)();
+int lstat();
+char *emalloc();
+
+int termwidth = 80;            /* default terminal width */
+
+/* flags */
+int f_accesstime;              /* use time of last access */
+int f_column;                  /* columnated format */
+int f_group;                   /* show group ownership of a file */
+int f_ignorelink;              /* indirect through symbolic link operands */
+int f_inode;                   /* print inode */
+int f_kblocks;                 /* print size in kilobytes */
+int f_listalldot;              /* list . and .. as well */
+int f_listdir;                 /* list actual directory, not contents */
+int f_listdot;                 /* list files beginning with . */
+int f_longform;                        /* long listing format */
+int f_needstat;                        /* if need to stat files */
+int f_newline;                 /* if precede with newline */
+int f_nonprint;                        /* show unprintables as ? */
+int f_nosort;                  /* don't sort output */
+int f_recursive;               /* ls subdirectories also */
+int f_reversesort;             /* reverse whatever sort is used */
+int f_sectime;                 /* print the real time for all files */
+int f_singlecol;               /* use single column output */
+int f_size;                    /* list size in short listing */
+int f_statustime;              /* use time of last mode change */
+int f_dirname;                 /* if precede with directory name */
+int f_timesort;                        /* sort by time vice name */
+int f_total;                   /* if precede with "total" line */
+int f_type;                    /* add type character for non-regular files */
+
+int (*statfcn)(), stat(), lstat();
+
+main(argc, argv)
+       int argc;
+       char **argv;
+{
+       extern int optind, stat();
+       struct winsize win;
+       int ch;
+       char *p, *getenv();
+       int acccmp(), modcmp(), namecmp(), prcopy(), printcol();
+       int printlong(), printscol(), revacccmp(), revmodcmp(), revnamecmp();
+       int revstatcmp(), statcmp();
+
+       /* terminal defaults to -Cq, non-terminal defaults to -1 */
+       if (isatty(1)) {
+               f_nonprint = 1;
+               if (ioctl(1, TIOCGWINSZ, &win) == -1 || !win.ws_col) {
+                       if (p = getenv("COLUMNS"))
+                               termwidth = atoi(p);
+               }
+               else
+                       termwidth = win.ws_col;
+               f_column = 1;
+       } else
+               f_singlecol = 1;
+
+       /* root is -A automatically */
+       if (!getuid())
+               f_listdot = 1;
+
+       while ((ch = getopt(argc, argv, "1ACFLRTacdfgiklqrstu")) != EOF) {
+               switch (ch) {
+               /*
+                * -1, -C and -l all override each other
+                * so shell aliasing works right
+                */
+               case '1':
+                       f_singlecol = 1;
+                       f_column = f_longform = 0;
+                       break;
+               case 'C':
+                       f_column = 1;
+                       f_longform = f_singlecol = 0;
+                       break;
+               case 'l':
+                       f_longform = 1;
+                       f_column = f_singlecol = 0;
+                       break;
+               /* -c and -u override each other */
+               case 'c':
+                       f_statustime = 1;
+                       f_accesstime = 0;
+                       break;
+               case 'u':
+                       f_accesstime = 1;
+                       f_statustime = 0;
+                       break;
+               case 'F':
+                       f_type = 1;
+                       break;
+               case 'L':
+                       f_ignorelink = 1;
+                       break;
+               case 'R':
+                       f_recursive = 1;
+                       break;
+               case 'a':
+                       f_listalldot = 1;
+                       /* FALLTHROUGH */
+               case 'A':
+                       f_listdot = 1;
+                       break;
+               case 'd':
+                       f_listdir = 1;
+                       break;
+               case 'f':
+                       f_nosort = 1;
+                       break;
+               case 'g':
+                       f_group = 1;
+                       break;
+               case 'i':
+                       f_inode = 1;
+                       break;
+               case 'k':
+                       f_kblocks = 1;
+                       break;
+               case 'q':
+                       f_nonprint = 1;
+                       break;
+               case 'r':
+                       f_reversesort = 1;
+                       break;
+               case 's':
+                       f_size = 1;
+                       break;
+               case 'T':
+                       f_sectime = 1;
+                       break;
+               case 't':
+                       f_timesort = 1;
+                       break;
+               default:
+               case '?':
+                       usage();
+               }
+       }
+       argc -= optind;
+       argv += optind;
+
+       /* -d turns off -R */
+       if (f_listdir)
+               f_recursive = 0;
+
+       /* if need to stat files */
+       f_needstat = f_longform || f_recursive || f_timesort ||
+           f_size || f_type;
+
+       /* select a sort function */
+       if (f_reversesort) {
+               if (!f_timesort)
+                       sortfcn = revnamecmp;
+               else if (f_accesstime)
+                       sortfcn = revacccmp;
+               else if (f_statustime)
+                       sortfcn = revstatcmp;
+               else /* use modification time */
+                       sortfcn = revmodcmp;
+       } else {
+               if (!f_timesort)
+                       sortfcn = namecmp;
+               else if (f_accesstime)
+                       sortfcn = acccmp;
+               else if (f_statustime)
+                       sortfcn = statcmp;
+               else /* use modification time */
+                       sortfcn = modcmp;
+       }
+
+       /* select a print function */
+       if (f_singlecol)
+               printfcn = printscol;
+       else if (f_longform)
+               printfcn = printlong;
+       else
+               printfcn = printcol;
+
+       /* if -l, -d or -F, and not ignoring the link, use lstat() */
+       statfcn =
+           (f_longform || f_listdir || f_type) && !f_ignorelink ? lstat : stat;
+
+       if (!argc) {
+               static char dot[] = ".";
+
+               argc = 1;
+               argv[0] = dot;
+               argv[1] = NULL;
+       }
+       doargs(argc, argv);
+       exit(0);
+}
+
+static char path[MAXPATHLEN + 1];
+static char *endofpath = path;
+
+doargs(argc, argv)
+       int argc;
+       char **argv;
+{
+       register LS *dstatp, *rstatp;
+       register int cnt, dircnt, maxlen, regcnt;
+       LS *dstats, *rstats;
+       struct stat sb;
+       char top[MAXPATHLEN + 1];
+       u_long blocks;
+
+       /*
+        * walk through the operands, building separate arrays of LS
+        * structures for directory and non-directory files.
+        */
+       dstats = rstats = NULL;
+       for (dircnt = regcnt = 0; *argv; ++argv) {
+               if (statfcn(*argv, &sb) &&
+                   (statfcn == lstat || lstat(*argv, &sb))) {
+                       (void)fprintf(stderr,
+                           "ls: %s: %s\n", *argv, strerror(errno));
+                       if (errno == ENOENT)
+                               continue;
+                       exit(1);
+               }
+               if (S_ISDIR(sb.st_mode) && !f_listdir) {
+                       if (!dstats)
+                               dstatp = dstats = (LS *)emalloc((u_int)argc *
+                                   (sizeof(LS)));
+                       dstatp->name = *argv;
+                       dstatp->lstat = sb;
+                       ++dstatp;
+                       ++dircnt;
+               }
+               else {
+                       if (!rstats) {
+                               rstatp = rstats = (LS *)emalloc((u_int)argc *
+                                   (sizeof(LS)));
+                               blocks = 0;
+                               maxlen = -1;
+                       }
+                       rstatp->name = *argv;
+                       rstatp->lstat = sb;
+
+                       /* save name length for -C format */
+                       rstatp->len = strlen(*argv);
+
+                       if (f_nonprint)
+                               prcopy(*argv, *argv, rstatp->len);
+
+                       /* calculate number of blocks if -l/-s formats */
+                       if (f_longform || f_size)
+                               blocks += sb.st_blocks;
+
+                       /* save max length if -C format */
+                       if (f_column && maxlen < rstatp->len)
+                               maxlen = rstatp->len;
+
+                       ++rstatp;
+                       ++regcnt;
+               }
+       }
+       /* display regular files */
+       if (regcnt) {
+               rstats[0].lstat.st_btotal = blocks;
+               rstats[0].lstat.st_maxlen = maxlen;
+               displaydir(rstats, regcnt);
+               f_newline = f_dirname = 1;
+       }
+       /* display directories */
+       if (dircnt) {
+               register char *p;
+
+               f_total = 1;
+               if (dircnt > 1) {
+                       (void)getwd(top);
+                       qsort((char *)dstats, dircnt, sizeof(LS), sortfcn);
+                       f_dirname = 1;
+               }
+               for (cnt = 0; cnt < dircnt; ++dstats) {
+                       for (endofpath = path, p = dstats->name;
+                           *endofpath = *p++; ++endofpath);
+                       subdir(dstats);
+                       f_newline = 1;
+                       if (++cnt < dircnt && chdir(top)) {
+                               (void)fprintf(stderr, "ls: %s: %s\n",
+                                   top, strerror(errno));
+                               exit(1);
+                       }
+               }
+       }
+}
+
+displaydir(stats, num)
+       LS *stats;
+       register int num;
+{
+       register char *p, *savedpath;
+       LS *lp;
+
+       if (num > 1 && !f_nosort) {
+               u_long save1, save2;
+
+               save1 = stats[0].lstat.st_btotal;
+               save2 = stats[0].lstat.st_maxlen;
+               qsort((char *)stats, num, sizeof(LS), sortfcn);
+               stats[0].lstat.st_btotal = save1;
+               stats[0].lstat.st_maxlen = save2;
+       }
+
+       printfcn(stats, num);
+
+       if (f_recursive) {
+               savedpath = endofpath;
+               for (lp = stats; num--; ++lp) {
+                       if (!S_ISDIR(lp->lstat.st_mode))
+                               continue;
+                       p = lp->name;
+                       if (p[0] == '.' && (!p[1] || p[1] == '.' && !p[2]))
+                               continue;
+                       if (endofpath != path && endofpath[-1] != '/')
+                               *endofpath++ = '/';
+                       for (; *endofpath = *p++; ++endofpath);
+                       f_newline = f_dirname = f_total = 1;
+                       subdir(lp);
+                       *(endofpath = savedpath) = '\0';
+               }
+       }
+}
+
+subdir(lp)
+       LS *lp;
+{
+       LS *stats;
+       int num;
+       char *names;
+
+       if (f_newline)
+               (void)putchar('\n');
+       if (f_dirname)
+               (void)printf("%s:\n", path);
+
+       if (chdir(lp->name)) {
+               (void)fprintf(stderr, "ls: %s: %s\n", lp->name,
+                    strerror(errno));
+               return;
+       }
+       if (num = tabdir(lp, &stats, &names)) {
+               displaydir(stats, num);
+               (void)free((char *)stats);
+               (void)free((char *)names);
+       }
+       if (chdir("..")) {
+               (void)fprintf(stderr, "ls: ..: %s\n", strerror(errno));
+               exit(1);
+       }
+}
+
+tabdir(lp, s_stats, s_names)
+       LS *lp, **s_stats;
+       char **s_names;
+{
+       register DIR *dirp;
+       register int cnt, maxentry, maxlen;
+       register char *p, *names;
+       struct dirent *dp;
+       u_long blocks;
+       LS *stats;
+
+       if (!(dirp = opendir("."))) {
+               (void)fprintf(stderr, "ls: %s: %s\n", lp->name,
+                   strerror(errno));
+               return(0);
+       }
+       blocks = maxentry = maxlen = 0;
+       stats = NULL;
+       for (cnt = 0; dp = readdir(dirp);) {
+               /* this does -A and -a */
+               p = dp->d_name;
+               if (p[0] == '.') {
+                       if (!f_listdot)
+                               continue;
+                       if (!f_listalldot && (!p[1] || p[1] == '.' && !p[2]))
+                               continue;
+               }
+               if (cnt == maxentry) {
+                       if (!maxentry)
+                               *s_names = names =
+                                   emalloc((u_int)lp->lstat.st_size);
+#define        DEFNUM  256
+                       maxentry += DEFNUM;
+                       if (!(*s_stats = stats = (LS *)realloc((char *)stats,
+                           (u_int)maxentry * sizeof(LS))))
+                               nomem();
+               }
+               if (f_needstat && statfcn(dp->d_name, &stats[cnt].lstat) &&
+                   statfcn == stat && lstat(dp->d_name, &stats[cnt].lstat)) {
+                       /*
+                        * don't exit -- this could be an NFS mount that has
+                        * gone away.  Flush stdout so the messages line up.
+                        */
+                       (void)fflush(stdout);
+                       (void)fprintf(stderr,
+                           "ls: %s: %s\n", dp->d_name, strerror(errno));
+                       continue;
+               }
+               stats[cnt].name = names;
+
+               if (f_nonprint)
+                       prcopy(dp->d_name, names, (int)dp->d_namlen);
+               else
+                       bcopy(dp->d_name, names, (int)dp->d_namlen);
+               names += dp->d_namlen;
+               *names++ = '\0';
+
+               /*
+                * get the inode from the directory, so the -f flag
+                * works right.
+                */
+               stats[cnt].lstat.st_ino = dp->d_ino;
+
+               /* save name length for -C format */
+               stats[cnt].len = dp->d_namlen;
+
+               /* calculate number of blocks if -l/-s formats */
+               if (f_longform || f_size)
+                       blocks += stats[cnt].lstat.st_blocks;
+
+               /* save max length if -C format */
+               if (f_column && maxlen < (int)dp->d_namlen)
+                       maxlen = dp->d_namlen;
+               ++cnt;
+       }
+       (void)closedir(dirp);
+
+       if (cnt) {
+               stats[0].lstat.st_btotal = blocks;
+               stats[0].lstat.st_maxlen = maxlen;
+       } else if (stats) {
+               (void)free((char *)stats);
+               (void)free((char *)names);
+       }
+       return(cnt);
+}

diff --git a/usr/src/bin/ls/ls.h b/usr/src/bin/ls/ls.h
new file mode 100644 (file)
index 0000000..2d30337
--- /dev/null
+++ b/usr/src/bin/ls/ls.h
@@ -0,0 +1,66 @@
+/*
+ * Copyright (c) 1989 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. 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.
+ *
+ *     @(#)ls.h        5.11 (Berkeley) 7/22/90
+ */
+
+typedef struct _lsstruct {
+       char *name;                     /* file name */
+       int len;                        /* file name length */
+       struct stat lstat;              /* lstat(2) for file */
+} LS;
+
+/*
+ * overload -- we probably have to save blocks and/or maxlen with the lstat
+ * array, so tabdir() stuffs it into unused fields in the first stat structure.
+ * If there's ever a type larger than u_long, fix this.  Any calls to qsort
+ * must save and restore the values.
+ */
+#define        st_btotal       st_flags
+#define        st_maxlen       st_gen
+
+extern int errno;
+
+extern int f_accesstime;       /* use time of last access */
+extern int f_group;            /* show group ownership of a file */
+extern int f_inode;            /* print inode */
+extern int f_kblocks;          /* print size in kilobytes */
+extern int f_longform;         /* long listing format */
+extern int f_sectime;          /* print the real time for all files */
+extern int f_singlecol;                /* use single column output */
+extern int f_size;             /* list size in short listing */
+extern int f_statustime;       /* use time of last mode change */
+extern int f_total;            /* if precede with "total" line */
+extern int f_type;             /* add type character for non-regular files */

diff --git a/usr/src/bin/ls/print.c b/usr/src/bin/ls/print.c
new file mode 100644 (file)
index 0000000..09ab426
--- /dev/null
+++ b/usr/src/bin/ls/print.c
@@ -0,0 +1,234 @@
+/*
+ * Copyright (c) 1989 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. 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
+static char sccsid[] = "@(#)print.c    5.24 (Berkeley) 10/19/90";
+#endif /* not lint */
+
+#include <sys/param.h>
+#include <sys/stat.h>
+#include <stdio.h>
+#include <grp.h>
+#include <pwd.h>
+#include <utmp.h>
+#include <tzfile.h>
+#include "ls.h"
+
+printscol(stats, num)
+       register LS *stats;
+       register int num;
+{
+       for (; num--; ++stats) {
+               (void)printaname(stats);
+               (void)putchar('\n');
+       }
+}
+
+printlong(stats, num)
+       LS *stats;
+       register int num;
+{
+       extern int errno;
+       char modep[15], *user_from_uid(), *group_from_gid(), *strerror();
+
+       if (f_total)
+               (void)printf("total %lu\n", f_kblocks ?
+                   howmany(stats[0].lstat.st_btotal, 2) :
+                   stats[0].lstat.st_btotal);
+       for (; num--; ++stats) {
+               if (f_inode)
+                       (void)printf("%6lu ", stats->lstat.st_ino);
+               if (f_size)
+                       (void)printf("%4ld ", f_kblocks ?
+                           howmany(stats->lstat.st_blocks, 2) :
+                           stats->lstat.st_blocks);
+               (void)strmode(stats->lstat.st_mode, modep);
+               (void)printf("%s %3u %-*s ", modep, stats->lstat.st_nlink,
+                   UT_NAMESIZE, user_from_uid(stats->lstat.st_uid, 0));
+               if (f_group)
+                       (void)printf("%-*s ", UT_NAMESIZE,
+                           group_from_gid(stats->lstat.st_gid, 0));
+               if (S_ISCHR(stats->lstat.st_mode) ||
+                   S_ISBLK(stats->lstat.st_mode))
+                       (void)printf("%3d, %3d ", major(stats->lstat.st_rdev),
+                           minor(stats->lstat.st_rdev));
+               else
+                       (void)printf("%8ld ", stats->lstat.st_size);
+               if (f_accesstime)
+                       printtime(stats->lstat.st_atime);
+               else if (f_statustime)
+                       printtime(stats->lstat.st_ctime);
+               else
+                       printtime(stats->lstat.st_mtime);
+               (void)printf("%s", stats->name);
+               if (f_type)
+                       (void)printtype(stats->lstat.st_mode);
+               if (S_ISLNK(stats->lstat.st_mode))
+                       printlink(stats->name);
+               (void)putchar('\n');
+       }
+}
+
+#define        TAB     8
+
+printcol(stats, num)
+       LS *stats;
+       int num;
+{
+       extern int termwidth;
+       register int base, chcnt, cnt, col, colwidth;
+       int endcol, numcols, numrows, row;
+
+       colwidth = stats[0].lstat.st_maxlen;
+       if (f_inode)
+               colwidth += 6;
+       if (f_size)
+               colwidth += 5;
+       if (f_type)
+               colwidth += 1;
+
+       colwidth = (colwidth + TAB) & ~(TAB - 1);
+       if (termwidth < 2 * colwidth) {
+               printscol(stats, num);
+               return;
+       }
+
+       numcols = termwidth / colwidth;
+       numrows = num / numcols;
+       if (num % numcols)
+               ++numrows;
+
+       if (f_size && f_total)
+               (void)printf("total %lu\n", f_kblocks ?
+                   howmany(stats[0].lstat.st_btotal, 2) :
+                   stats[0].lstat.st_btotal);
+       for (row = 0; row < numrows; ++row) {
+               endcol = colwidth;
+               for (base = row, chcnt = col = 0; col < numcols; ++col) {
+                       chcnt += printaname(stats + base);
+                       if ((base += numrows) >= num)
+                               break;
+                       while ((cnt = (chcnt + TAB & ~(TAB - 1))) <= endcol) {
+                               (void)putchar('\t');
+                               chcnt = cnt;
+                       }
+                       endcol += colwidth;
+               }
+               putchar('\n');
+       }
+}
+
+/*
+ * print [inode] [size] name
+ * return # of characters printed, no trailing characters
+ */
+printaname(lp)
+       LS *lp;
+{
+       int chcnt;
+
+       chcnt = 0;
+       if (f_inode)
+               chcnt += printf("%5lu ", lp->lstat.st_ino);
+       if (f_size)
+               chcnt += printf("%4ld ", f_kblocks ?
+                   howmany(lp->lstat.st_blocks, 2) : lp->lstat.st_blocks);
+       chcnt += printf("%s", lp->name);
+       if (f_type)
+               chcnt += printtype(lp->lstat.st_mode);
+       return(chcnt);
+}
+
+printtime(ftime)
+       time_t ftime;
+{
+       int i;
+       char *longstring, *ctime();
+       time_t time();
+
+       longstring = ctime((long *)&ftime);
+       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 > time((time_t *)NULL))
+               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(' ');
+}
+
+printtype(mode)
+       mode_t mode;
+{
+       switch(mode & S_IFMT) {
+       case S_IFDIR:
+               (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);
+}
+
+printlink(name)
+       char *name;
+{
+       int lnklen;
+       char path[MAXPATHLEN + 1], *strerror();
+
+       if ((lnklen = readlink(name, path, MAXPATHLEN)) == -1) {
+               (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
+               return;
+       }
+       path[lnklen] = '\0';
+       (void)printf(" -> %s", path);
+}

diff --git a/usr/src/bin/ls/util.c b/usr/src/bin/ls/util.c
new file mode 100644 (file)
index 0000000..7c3861b
--- /dev/null
+++ b/usr/src/bin/ls/util.c
@@ -0,0 +1,78 @@
+/*
+ * Copyright (c) 1989 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. 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
+static char sccsid[] = "@(#)util.c     5.8 (Berkeley) 7/22/90";
+#endif /* not lint */
+
+#include <sys/types.h>
+#include <stdio.h>
+#include <ctype.h>
+
+prcopy(src, dest, len)
+       register char *src, *dest;
+       register int len;
+{
+       register int ch;
+
+       while(len--) {
+               ch = *src++;
+               *dest++ = isprint(ch) ? ch : '?';
+       }
+}
+
+char
+*emalloc(size)
+       u_int size;
+{
+       char *retval, *malloc();
+
+       if (!(retval = malloc(size)))
+               nomem();
+       return(retval);
+}
+
+nomem()
+{
+       (void)fprintf(stderr, "ls: out of memory.\n");
+       exit(1);
+}
+
+usage()
+{
+       (void)fprintf(stderr, "usage: ls [-1ACFLRTacdfgiklqrstu] [file ...]\n");
+       exit(1);
+}