2011-05-24 23:24:33 +00:00
|
|
|
/* See LICENSE file for copyright and license details. */
|
|
|
|
#include <dirent.h>
|
2015-03-11 22:21:52 +00:00
|
|
|
#include <errno.h>
|
2014-01-30 12:37:35 +00:00
|
|
|
#include <limits.h>
|
|
|
|
#include <stdio.h>
|
2011-05-24 23:24:33 +00:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2011-06-04 13:30:54 +00:00
|
|
|
#include <sys/stat.h>
|
2014-01-30 12:37:35 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <unistd.h>
|
2013-03-05 20:46:48 +00:00
|
|
|
|
2015-03-12 23:25:32 +00:00
|
|
|
#include "../fs.h"
|
2011-05-24 23:24:33 +00:00
|
|
|
#include "../util.h"
|
|
|
|
|
2015-03-12 23:25:32 +00:00
|
|
|
int recurse_status = 0;
|
2015-03-02 20:43:56 +00:00
|
|
|
|
2011-05-24 23:24:33 +00:00
|
|
|
void
|
2015-03-12 23:25:32 +00:00
|
|
|
recurse(const char *path, void *data, struct recursor *r)
|
2011-05-24 23:24:33 +00:00
|
|
|
{
|
|
|
|
struct dirent *d;
|
2015-03-12 23:25:32 +00:00
|
|
|
struct history *new, *h;
|
|
|
|
struct stat st, dst;
|
2011-05-24 23:24:33 +00:00
|
|
|
DIR *dp;
|
2015-03-12 23:25:32 +00:00
|
|
|
int (*statf)(const char *, struct stat *);
|
|
|
|
char subpath[PATH_MAX], *statf_name;
|
2011-05-24 23:24:33 +00:00
|
|
|
|
2015-03-12 23:25:32 +00:00
|
|
|
if (r->follow == 'P' || (r->follow == 'H' && r->depth)) {
|
|
|
|
statf_name = "lstat";
|
|
|
|
statf = lstat;
|
|
|
|
} else {
|
|
|
|
statf_name = "stat";
|
|
|
|
statf = stat;
|
2015-03-11 22:21:52 +00:00
|
|
|
}
|
2015-03-12 23:25:32 +00:00
|
|
|
|
|
|
|
if (statf(path, &st) < 0) {
|
|
|
|
if (errno != ENOENT) {
|
|
|
|
weprintf("%s %s:", statf_name, path);
|
|
|
|
recurse_status = 1;
|
|
|
|
}
|
2015-03-11 22:21:52 +00:00
|
|
|
return;
|
|
|
|
}
|
2015-03-12 23:25:32 +00:00
|
|
|
if (!S_ISDIR(st.st_mode))
|
2011-06-04 13:30:54 +00:00
|
|
|
return;
|
2014-06-30 14:58:00 +00:00
|
|
|
|
2015-03-12 23:25:32 +00:00
|
|
|
new = emalloc(sizeof(struct history));
|
|
|
|
|
|
|
|
new->prev = r->hist;
|
|
|
|
r->hist = new;
|
|
|
|
new->dev = st.st_dev;
|
|
|
|
new->ino = st.st_ino;
|
|
|
|
|
|
|
|
for (h = new->prev; h; h = h->prev)
|
|
|
|
if (h->dev == st.st_dev && h->ino == st.st_ino)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!(dp = opendir(path))) {
|
|
|
|
weprintf("opendir %s:", path);
|
|
|
|
recurse_status = 1;
|
|
|
|
return;
|
|
|
|
}
|
2011-06-04 13:30:54 +00:00
|
|
|
|
2014-06-30 14:58:00 +00:00
|
|
|
while ((d = readdir(dp))) {
|
2015-03-12 23:25:32 +00:00
|
|
|
if (r->follow == 'H') {
|
|
|
|
statf_name = "lstat";
|
|
|
|
statf = lstat;
|
|
|
|
}
|
2015-03-02 20:43:56 +00:00
|
|
|
if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
|
2014-01-30 12:37:35 +00:00
|
|
|
continue;
|
2015-03-12 12:22:37 +00:00
|
|
|
if (strlcpy(subpath, path, PATH_MAX) >= PATH_MAX)
|
|
|
|
eprintf("strlcpy: path too long\n");
|
|
|
|
if (path[strlen(path) - 1] != '/' && strlcat(subpath, "/", PATH_MAX) >= PATH_MAX)
|
|
|
|
eprintf("strlcat: path too long\n");
|
|
|
|
if (strlcat(subpath, d->d_name, PATH_MAX) >= PATH_MAX)
|
|
|
|
eprintf("strlcat: path too long\n");
|
2015-03-12 23:25:32 +00:00
|
|
|
if ((r->flags & SAMEDEV) && statf(subpath, &dst) < 0) {
|
|
|
|
if (errno != ENOENT) {
|
|
|
|
weprintf("%s %s:", statf_name, subpath);
|
|
|
|
recurse_status = 1;
|
|
|
|
}
|
|
|
|
} else if (!((r->flags & SAMEDEV) && dst.st_dev != st.st_dev)) {
|
|
|
|
r->depth++;
|
|
|
|
(r->fn)(subpath, data, r);
|
|
|
|
r->depth--;
|
|
|
|
}
|
2013-03-05 20:46:48 +00:00
|
|
|
}
|
2011-05-24 23:24:33 +00:00
|
|
|
|
|
|
|
closedir(dp);
|
|
|
|
}
|