sbase/ls.c

479 lines
9.2 KiB
C
Raw Normal View History

2011-05-26 03:01:20 +00:00
/* See LICENSE file for copyright and license details. */
2015-02-14 20:02:41 +00:00
#include <sys/stat.h>
#include <sys/types.h>
2015-02-14 20:02:41 +00:00
2011-05-26 03:01:20 +00:00
#include <dirent.h>
#include <grp.h>
#include <pwd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include "utf.h"
2011-05-26 03:01:20 +00:00
#include "util.h"
2015-02-16 18:20:06 +00:00
struct entry {
char *name;
mode_t mode, tmode;
2011-05-26 03:01:20 +00:00
nlink_t nlink;
2015-02-16 18:20:06 +00:00
uid_t uid;
gid_t gid;
off_t size;
struct timespec t;
dev_t dev;
dev_t rdev;
ino_t ino, tino;
2015-02-16 18:20:06 +00:00
};
2011-05-26 03:01:20 +00:00
static struct {
dev_t dev;
ino_t ino;
2015-09-06 20:33:41 +00:00
} tree[PATH_MAX];
static int Aflag = 0;
static int aflag = 0;
static int cflag = 0;
static int dflag = 0;
static int Fflag = 0;
2015-03-18 18:26:42 +00:00
static int fflag = 0;
static int Hflag = 0;
static int hflag = 0;
static int iflag = 0;
static int Lflag = 0;
static int lflag = 0;
2015-02-22 11:55:38 +00:00
static int nflag = 0;
2015-02-19 18:48:15 +00:00
static int pflag = 0;
static int qflag = 0;
2015-02-21 10:45:15 +00:00
static int Rflag = 0;
static int rflag = 0;
static int Uflag = 0;
2015-02-18 16:29:46 +00:00
static int uflag = 0;
static int first = 1;
static char sort = 0;
static size_t ds = 0;
2011-05-26 03:01:20 +00:00
static void ls(const char *, const struct entry *, int);
2015-02-21 10:45:15 +00:00
2013-06-14 18:20:47 +00:00
static void
2015-02-16 18:20:06 +00:00
mkent(struct entry *ent, char *path, int dostat, int follow)
2011-05-26 03:01:20 +00:00
{
struct stat st;
2015-02-16 18:20:06 +00:00
ent->name = path;
if (!dostat)
2013-07-18 19:14:53 +00:00
return;
if ((follow ? stat : lstat)(path, &st) < 0)
eprintf("%s %s:", follow ? "stat" : "lstat", path);
2015-02-16 18:20:06 +00:00
ent->mode = st.st_mode;
ent->nlink = st.st_nlink;
ent->uid = st.st_uid;
ent->gid = st.st_gid;
ent->size = st.st_size;
2015-02-18 16:29:46 +00:00
if (cflag)
ent->t = st.st_ctim;
2015-02-18 16:29:46 +00:00
else if (uflag)
ent->t = st.st_atim;
2015-02-18 16:29:46 +00:00
else
ent->t = st.st_mtim;
ent->dev = st.st_dev;
ent->rdev = st.st_rdev;
2015-02-16 18:20:06 +00:00
ent->ino = st.st_ino;
if (S_ISLNK(ent->mode)) {
if (stat(path, &st) == 0) {
ent->tmode = st.st_mode;
ent->dev = st.st_dev;
ent->tino = st.st_ino;
} else {
ent->tmode = ent->tino = 0;
}
}
2011-05-26 03:01:20 +00:00
}
static char *
2014-02-17 14:41:09 +00:00
indicator(mode_t mode)
{
2015-02-19 18:48:15 +00:00
if (pflag || Fflag)
if (S_ISDIR(mode))
return "/";
2014-02-17 14:41:09 +00:00
2015-02-19 18:48:15 +00:00
if (Fflag) {
if (S_ISLNK(mode))
return "@";
else if (S_ISFIFO(mode))
return "|";
else if (S_ISSOCK(mode))
return "=";
else if (mode & S_IXUSR || mode & S_IXGRP || mode & S_IXOTH)
return "*";
}
return "";
2014-02-17 14:41:09 +00:00
}
static void
2015-02-16 18:20:06 +00:00
output(const struct entry *ent)
2011-05-26 03:01:20 +00:00
{
struct group *gr;
struct passwd *pw;
2015-02-16 18:20:06 +00:00
ssize_t len;
size_t l;
char *name, *c, *u, *fmt, buf[BUFSIZ],
2015-02-16 18:20:06 +00:00
pwname[_SC_LOGIN_NAME_MAX], grname[_SC_LOGIN_NAME_MAX],
mode[] = "----------";
Rune r;
if (qflag) {
name = emalloc(strlen(ent->name) + 1);
for (c = name, u = ent->name; *u; u += l) {
l = chartorune(&r, u);
if (isprintrune(r)) {
memcpy(c, u, l);
c += l;
} else {
*c++ = '?';
}
}
*c = '\0';
} else {
name = ent->name;
}
2011-05-26 03:01:20 +00:00
2013-09-27 14:32:50 +00:00
if (iflag)
printf("%lu ", (unsigned long)ent->ino);
if (!lflag) {
printf("%s%s\n", name, indicator(ent->mode));
goto cleanup;
2011-05-26 03:01:20 +00:00
}
if (S_ISREG(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = '-';
else if (S_ISBLK(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = 'b';
else if (S_ISCHR(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = 'c';
else if (S_ISDIR(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = 'd';
else if (S_ISFIFO(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = 'p';
else if (S_ISLNK(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = 'l';
else if (S_ISSOCK(ent->mode))
2011-05-26 03:01:20 +00:00
mode[0] = 's';
else
mode[0] = '?';
if (ent->mode & S_IRUSR) mode[1] = 'r';
if (ent->mode & S_IWUSR) mode[2] = 'w';
if (ent->mode & S_IXUSR) mode[3] = 'x';
if (ent->mode & S_IRGRP) mode[4] = 'r';
if (ent->mode & S_IWGRP) mode[5] = 'w';
if (ent->mode & S_IXGRP) mode[6] = 'x';
if (ent->mode & S_IROTH) mode[7] = 'r';
if (ent->mode & S_IWOTH) mode[8] = 'w';
if (ent->mode & S_IXOTH) mode[9] = 'x';
2011-05-27 22:56:43 +00:00
if (ent->mode & S_ISUID) mode[3] = (mode[3] == 'x') ? 's' : 'S';
if (ent->mode & S_ISGID) mode[6] = (mode[6] == 'x') ? 's' : 'S';
if (ent->mode & S_ISVTX) mode[9] = (mode[9] == 'x') ? 't' : 'T';
2011-05-26 03:01:20 +00:00
2015-02-22 11:55:38 +00:00
if (!nflag && (pw = getpwuid(ent->uid)))
2015-09-06 20:35:14 +00:00
snprintf(pwname, sizeof(pwname), "%s", pw->pw_name);
else
2015-09-06 20:35:14 +00:00
snprintf(pwname, sizeof(pwname), "%d", ent->uid);
2011-05-26 03:01:20 +00:00
2015-02-22 11:55:38 +00:00
if (!nflag && (gr = getgrgid(ent->gid)))
2015-09-06 20:35:14 +00:00
snprintf(grname, sizeof(grname), "%s", gr->gr_name);
else
2015-09-06 20:35:14 +00:00
snprintf(grname, sizeof(grname), "%d", ent->gid);
2011-05-26 03:01:20 +00:00
if (time(NULL) > ent->t.tv_sec + (180 * 24 * 60 * 60)) /* 6 months ago? */
2011-06-04 11:40:05 +00:00
fmt = "%b %d %Y";
2011-05-26 03:01:20 +00:00
else
fmt = "%b %d %H:%M";
strftime(buf, sizeof(buf), fmt, localtime(&ent->t.tv_sec));
printf("%s %4ld %-8.8s %-8.8s ", mode, (long)ent->nlink, pwname, grname);
2015-02-22 11:55:38 +00:00
if (S_ISBLK(ent->mode) || S_ISCHR(ent->mode))
printf("%4u, %4u ", major(ent->rdev), minor(ent->rdev));
else if (hflag)
printf("%10s ", humansize(ent->size));
else
printf("%10lu ", (unsigned long)ent->size);
printf("%s %s%s", buf, ent->name, indicator(ent->mode));
if (S_ISLNK(ent->mode)) {
2015-02-16 18:20:06 +00:00
if ((len = readlink(ent->name, buf, sizeof(buf) - 1)) < 0)
2011-06-04 11:40:05 +00:00
eprintf("readlink %s:", ent->name);
buf[len] = '\0';
printf(" -> %s%s", buf, indicator(ent->tmode));
2011-06-04 11:40:05 +00:00
}
putchar('\n');
cleanup:
if (qflag)
free(name);
2011-05-26 03:01:20 +00:00
}
2015-02-16 18:20:06 +00:00
static int
entcmp(const void *va, const void *vb)
{
2015-03-18 18:26:42 +00:00
int cmp = 0;
2015-02-16 18:20:06 +00:00
const struct entry *a = va, *b = vb;
switch (sort) {
case 'S':
2015-03-18 18:26:42 +00:00
cmp = b->size - a->size;
break;
case 't':
if (!(cmp = b->t.tv_sec - a->t.tv_sec))
cmp = b->t.tv_nsec - a->t.tv_nsec;
break;
}
if (!cmp)
cmp = strcmp(a->name, b->name);
2015-03-18 18:26:42 +00:00
return rflag ? 0 - cmp : cmp;
2015-02-16 18:20:06 +00:00
}
static void
lsdir(const char *path, const struct entry *dir)
2015-02-16 18:20:06 +00:00
{
DIR *dp;
struct entry *ent, *ents = NULL;
2015-02-16 18:20:06 +00:00
struct dirent *d;
size_t i, n = 0;
char prefix[PATH_MAX];
2015-02-16 18:20:06 +00:00
if (!(dp = opendir(dir->name)))
eprintf("opendir %s:", dir->name);
if (chdir(dir->name) < 0)
eprintf("chdir %s:", dir->name);
2015-02-16 18:20:06 +00:00
while ((d = readdir(dp))) {
if (d->d_name[0] == '.' && !aflag && !Aflag)
2015-02-16 18:20:06 +00:00
continue;
else if (Aflag)
if (strcmp(d->d_name, ".") == 0 ||
strcmp(d->d_name, "..") == 0)
continue;
ents = ereallocarray(ents, ++n, sizeof(*ents));
mkent(&ents[n - 1], estrdup(d->d_name), Fflag || iflag ||
lflag || pflag || Rflag || sort, Lflag);
2015-02-16 18:20:06 +00:00
}
2015-02-16 18:20:06 +00:00
closedir(dp);
if (!Uflag)
2015-02-16 18:20:06 +00:00
qsort(ents, n, sizeof(*ents), entcmp);
if (ds++)
printf("%s:\n", dir->name);
for (i = 0; i < n; i++)
output(&ents[i]);
if (Rflag) {
if (snprintf(prefix, PATH_MAX, "%s%s/", path, dir->name) >=
PATH_MAX)
eprintf("path too long: %s%s\n", path, dir->name);
2015-02-16 18:20:06 +00:00
for (i = 0; i < n; i++) {
ent = &ents[i];
if (strcmp(ent->name, ".") == 0 ||
strcmp(ent->name, "..") == 0)
continue;
if (S_ISLNK(ent->mode) && S_ISDIR(ent->tmode) && !Lflag)
continue;
ls(prefix, ent, Rflag);
2015-02-16 18:20:06 +00:00
}
}
for (i = 0; i < n; ++i)
free(ents[i].name);
2015-02-16 18:20:06 +00:00
free(ents);
}
static int
visit(const struct entry *ent)
{
dev_t dev;
ino_t ino;
int i;
dev = ent->dev;
ino = S_ISLNK(ent->mode) ? ent->tino : ent->ino;
for (i = 0; tree[i].ino && i < PATH_MAX; ++i) {
if (ino == tree[i].ino && dev == tree[i].dev)
return -1;
}
tree[i].ino = ino;
tree[i].dev = dev;
2015-09-06 20:33:41 +00:00
return i;
}
2015-02-16 18:20:06 +00:00
static void
ls(const char *path, const struct entry *ent, int listdir)
2015-02-16 18:20:06 +00:00
{
int treeind;
char cwd[PATH_MAX];
if (!listdir) {
2015-02-16 18:20:06 +00:00
output(ent);
} else if (S_ISDIR(ent->mode) ||
(S_ISLNK(ent->mode) && S_ISDIR(ent->tmode))) {
if ((treeind = visit(ent)) < 0) {
fprintf(stderr, "%s%s: already visited\n",
path, ent->name);
return;
}
if (!getcwd(cwd, PATH_MAX))
eprintf("getcwd:");
if (first)
first = !first;
else
putchar('\n');
fputs(path, stdout);
lsdir(path, ent);
tree[treeind].ino = 0;
if (chdir(cwd) < 0)
eprintf("chdir %s:", cwd);
}
2015-02-16 18:20:06 +00:00
}
static void
usage(void)
{
eprintf("usage: %s [-1AacdFfHhiLlnpqRrtUu] [file ...]\n", argv0);
2015-02-16 18:20:06 +00:00
}
int
main(int argc, char *argv[])
{
struct entry ent, *dents, *fents;
size_t i, fs;
2015-02-16 18:20:06 +00:00
ARGBEGIN {
case '1':
/* ignore */
break;
case 'A':
Aflag = 1;
break;
2015-02-16 18:20:06 +00:00
case 'a':
aflag = 1;
break;
case 'c':
cflag = 1;
2015-02-18 16:29:46 +00:00
uflag = 0;
2015-02-16 18:20:06 +00:00
break;
case 'd':
dflag = 1;
break;
2015-03-18 18:26:42 +00:00
case 'f':
aflag = 1;
fflag = 1;
Uflag = 1;
break;
2015-02-16 18:20:06 +00:00
case 'F':
Fflag = 1;
break;
case 'H':
Hflag = 1;
break;
case 'h':
hflag = 1;
break;
case 'i':
iflag = 1;
break;
case 'L':
Lflag = 1;
break;
case 'l':
lflag = 1;
break;
2015-02-22 11:55:38 +00:00
case 'n':
lflag = 1;
nflag = 1;
break;
2015-02-19 18:48:15 +00:00
case 'p':
pflag = 1;
break;
case 'q':
qflag = 1;
break;
2015-02-21 10:45:15 +00:00
case 'R':
Rflag = 1;
break;
2015-02-16 18:20:06 +00:00
case 'r':
rflag = 1;
2015-03-18 18:26:42 +00:00
break;
case 'S':
sort = 'S';
2015-02-16 18:20:06 +00:00
break;
case 't':
sort = 't';
2015-02-16 18:20:06 +00:00
break;
case 'U':
Uflag = 1;
break;
2015-02-18 16:29:46 +00:00
case 'u':
uflag = 1;
cflag = 0;
break;
2015-02-16 18:20:06 +00:00
default:
usage();
} ARGEND
2015-02-16 18:20:06 +00:00
switch (argc) {
case 0: /* fallthrough */
*--argv = ".", ++argc;
case 1:
mkent(&ent, argv[0], 1, Hflag || Lflag);
ls("", &ent, (!dflag && S_ISDIR(ent.mode)) ||
((S_ISLNK(ent.mode) && S_ISDIR(ent.tmode)) &&
((Hflag || Lflag) || !(dflag || Fflag || lflag))));
break;
default:
for (i = ds = fs = 0, fents = dents = NULL; i < argc; ++i) {
mkent(&ent, argv[i], 1, Hflag || Lflag);
if ((!dflag && S_ISDIR(ent.mode)) ||
((S_ISLNK(ent.mode) && S_ISDIR(ent.tmode)) &&
((Hflag || Lflag) || !(dflag || Fflag || lflag)))) {
dents = ereallocarray(dents, ++ds, sizeof(*dents));
memcpy(&dents[ds - 1], &ent, sizeof(ent));
} else {
fents = ereallocarray(fents, ++fs, sizeof(*fents));
memcpy(&fents[fs - 1], &ent, sizeof(ent));
}
}
qsort(fents, fs, sizeof(ent), entcmp);
qsort(dents, ds, sizeof(ent), entcmp);
2015-02-16 18:20:06 +00:00
for (i = 0; i < fs; ++i)
ls("", &fents[i], 0);
free(fents);
if (fs && ds)
putchar('\n');
for (i = 0; i < ds; ++i)
ls("", &dents[i], 1);
free(dents);
}
2015-02-16 18:20:06 +00:00
Add *fshut() functions to properly flush file streams This has been a known issue for a long time. Example: printf "word" > /dev/full wouldn't report there's not enough space on the device. This is due to the fact that every libc has internal buffers for stdout which store fragments of written data until they reach a certain size or on some callback to flush them all at once to the kernel. You can force the libc to flush them with fflush(). In case flushing fails, you can check the return value of fflush() and report an error. However, previously, sbase didn't have such checks and without fflush(), the libc silently flushes the buffers on exit without checking the errors. No offense, but there's no way for the libc to report errors in the exit- condition. GNU coreutils solve this by having onexit-callbacks to handle the flushing and report issues, but they have obvious deficiencies. After long discussions on IRC, we came to the conclusion that checking the return value of every io-function would be a bit too much, and having a general-purpose fclose-wrapper would be the best way to go. It turned out that fclose() alone is not enough to detect errors. The right way to do it is to fflush() + check ferror on the fp and then to a fclose(). This is what fshut does and that's how it's done before each return. The return value is obviously affected, reporting an error in case a flush or close failed, but also when reading failed for some reason, the error- state is caught. the !!( ... + ...) construction is used to call all functions inside the brackets and not "terminating" on the first. We want errors to be reported, but there's no reason to stop flushing buffers when one other file buffer has issues. Obviously, functionales come before the flush and ret-logic comes after to prevent early exits as well without reporting warnings if there are any. One more advantage of fshut() is that it is even able to report errors on obscure NFS-setups which the other coreutils are unable to detect, because they only check the return-value of fflush() and fclose(), not ferror() as well.
2015-04-04 19:25:17 +00:00
return fshut(stdout, "<stdout>");
2015-02-16 18:20:06 +00:00
}