2011-05-24 23:24:33 +00:00
|
|
|
/* See LICENSE file for copyright and license details. */
|
|
|
|
|
#include <errno.h>
|
|
|
|
|
#include <grp.h>
|
2015-03-08 23:37:34 +00:00
|
|
|
#include <limits.h>
|
2011-05-24 23:24:33 +00:00
|
|
|
#include <pwd.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
#include <unistd.h>
|
2014-11-13 17:29:30 +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-08 23:37:34 +00:00
|
|
|
static int hflag = 0;
|
|
|
|
|
static int Rflag = 0;
|
|
|
|
|
static uid_t uid = -1;
|
|
|
|
|
static gid_t gid = -1;
|
|
|
|
|
static int ret = 0;
|
2011-05-24 23:24:33 +00:00
|
|
|
|
2015-02-12 20:56:06 +00:00
|
|
|
static void
|
Refactor recurse() again
Okay, why yet another recurse()-refactor?
The last one added the recursor-struct, which simplified things
on the user-end, but there was still one thing that bugged me a lot:
Previously, all fn()'s were forced to (l)stat the paths themselves.
This does not work well when you try to keep up with H-, L- and P-
flags at the same time, as each utility-function would have to set
the right function-pointer for (l)stat every single time.
This is not desirable. Furthermore, recurse should be easy to use
and not involve trouble finding the right (l)stat-function to do it
right.
So, what we needed was a stat-argument for each fn(), so it is
directly accessible. This was impossible to do though when the
fn()'s are still directly called by the programs to "start" the
recurse.
Thus, the fundamental change is to make recurse() the function to
go, while designing the fn()'s in a way they can "live" with st
being NULL (we don't want a null-pointer-deref).
What you can see in this commit is the result of this work. Why
all this trouble instead of using nftw?
The special thing about recurse() is that you tell the function
when to recurse() in your fn(). You don't need special flags to
tell nftw() to skip the subtree, just to give an example.
The only single downside to this is that now, you are not allowed
to unconditionally call recurse() from your fn(). It has to be
a directory.
However, that is a cost I think is easily weighed up by the
advantages.
Another thing is the history: I added a procedure at the end of
the outmost recurse to free the history. This way we don't leak
memory.
A simple optimization on the side:
- if (h->dev == st.st_dev && h->ino == st.st_ino)
+ if (h->ino == st.st_ino && h->dev == st.st_dev)
First compare the likely difference in inode-numbers instead of
checking the unlikely condition that the device-numbers are
different.
2015-03-18 23:53:42 +00:00
|
|
|
chownpwgr(const char *path, struct stat *st, void *data, struct recursor *r)
|
2015-02-12 20:56:06 +00:00
|
|
|
{
|
2015-03-08 23:37:34 +00:00
|
|
|
char *chownf_name;
|
|
|
|
|
int (*chownf)(const char *, uid_t, gid_t);
|
|
|
|
|
|
2015-03-12 23:25:32 +00:00
|
|
|
if (r->follow == 'P' || (r->follow == 'H' && r->depth) || (hflag && !(r->depth))) {
|
2015-03-08 23:37:34 +00:00
|
|
|
chownf_name = "lchown";
|
|
|
|
|
chownf = lchown;
|
|
|
|
|
} else {
|
|
|
|
|
chownf_name = "chown";
|
|
|
|
|
chownf = chown;
|
|
|
|
|
}
|
|
|
|
|
|
2015-03-02 20:43:56 +00:00
|
|
|
if (chownf(path, uid, gid) < 0) {
|
|
|
|
|
weprintf("%s %s:", chownf_name, path);
|
2015-02-12 20:56:06 +00:00
|
|
|
ret = 1;
|
Refactor recurse() again
Okay, why yet another recurse()-refactor?
The last one added the recursor-struct, which simplified things
on the user-end, but there was still one thing that bugged me a lot:
Previously, all fn()'s were forced to (l)stat the paths themselves.
This does not work well when you try to keep up with H-, L- and P-
flags at the same time, as each utility-function would have to set
the right function-pointer for (l)stat every single time.
This is not desirable. Furthermore, recurse should be easy to use
and not involve trouble finding the right (l)stat-function to do it
right.
So, what we needed was a stat-argument for each fn(), so it is
directly accessible. This was impossible to do though when the
fn()'s are still directly called by the programs to "start" the
recurse.
Thus, the fundamental change is to make recurse() the function to
go, while designing the fn()'s in a way they can "live" with st
being NULL (we don't want a null-pointer-deref).
What you can see in this commit is the result of this work. Why
all this trouble instead of using nftw?
The special thing about recurse() is that you tell the function
when to recurse() in your fn(). You don't need special flags to
tell nftw() to skip the subtree, just to give an example.
The only single downside to this is that now, you are not allowed
to unconditionally call recurse() from your fn(). It has to be
a directory.
However, that is a cost I think is easily weighed up by the
advantages.
Another thing is the history: I added a procedure at the end of
the outmost recurse to free the history. This way we don't leak
memory.
A simple optimization on the side:
- if (h->dev == st.st_dev && h->ino == st.st_ino)
+ if (h->ino == st.st_ino && h->dev == st.st_dev)
First compare the likely difference in inode-numbers instead of
checking the unlikely condition that the device-numbers are
different.
2015-03-18 23:53:42 +00:00
|
|
|
} else if (Rflag && st && S_ISDIR(st->st_mode)) {
|
2015-03-12 23:25:32 +00:00
|
|
|
recurse(path, NULL, r);
|
2015-03-08 23:37:34 +00:00
|
|
|
}
|
2015-02-12 20:56:06 +00:00
|
|
|
}
|
2011-05-24 23:24:33 +00:00
|
|
|
|
2013-06-14 18:20:47 +00:00
|
|
|
static void
|
|
|
|
|
usage(void)
|
|
|
|
|
{
|
2015-03-08 23:37:34 +00:00
|
|
|
eprintf("usage: %s [-h] [-R [-H | -L | -P]] [owner][:[group]] file ...\n", argv0);
|
2013-06-14 18:20:47 +00:00
|
|
|
}
|
|
|
|
|
|
2011-05-24 23:24:33 +00:00
|
|
|
int
|
|
|
|
|
main(int argc, char *argv[])
|
|
|
|
|
{
|
2014-11-02 22:24:53 +00:00
|
|
|
struct group *gr;
|
2015-03-12 23:25:32 +00:00
|
|
|
struct passwd *pw;
|
|
|
|
|
struct recursor r = { .fn = chownpwgr, .hist = NULL, .depth = 0, .follow = 'P', .flags = 0};
|
2015-03-08 23:37:34 +00:00
|
|
|
char *owner, *group;
|
2011-05-24 23:24:33 +00:00
|
|
|
|
2013-06-14 18:20:47 +00:00
|
|
|
ARGBEGIN {
|
2015-02-12 20:56:06 +00:00
|
|
|
case 'h':
|
2015-03-08 23:37:34 +00:00
|
|
|
hflag = 1;
|
2015-02-12 20:56:06 +00:00
|
|
|
break;
|
2013-06-14 18:20:47 +00:00
|
|
|
case 'r':
|
2015-02-17 16:41:58 +00:00
|
|
|
case 'R':
|
2015-03-08 23:37:34 +00:00
|
|
|
Rflag = 1;
|
2013-06-14 18:20:47 +00:00
|
|
|
break;
|
2015-02-09 19:53:24 +00:00
|
|
|
case 'H':
|
|
|
|
|
case 'L':
|
|
|
|
|
case 'P':
|
2015-03-12 23:25:32 +00:00
|
|
|
r.follow = ARGC();
|
2015-02-09 19:53:24 +00:00
|
|
|
break;
|
2013-06-14 18:20:47 +00:00
|
|
|
default:
|
|
|
|
|
usage();
|
|
|
|
|
} ARGEND;
|
2014-04-18 17:46:02 +00:00
|
|
|
|
2015-03-08 23:37:34 +00:00
|
|
|
if (argc < 2)
|
2013-06-14 18:20:47 +00:00
|
|
|
usage();
|
|
|
|
|
|
|
|
|
|
owner = argv[0];
|
2014-11-13 17:29:30 +00:00
|
|
|
if ((group = strchr(owner, ':')))
|
2011-05-24 23:24:33 +00:00
|
|
|
*group++ = '\0';
|
|
|
|
|
|
2014-11-13 17:29:30 +00:00
|
|
|
if (owner && *owner) {
|
2011-05-24 23:24:33 +00:00
|
|
|
errno = 0;
|
|
|
|
|
pw = getpwnam(owner);
|
2014-11-13 17:29:30 +00:00
|
|
|
if (pw) {
|
2014-11-02 22:24:53 +00:00
|
|
|
uid = pw->pw_uid;
|
|
|
|
|
} else {
|
2015-03-08 23:37:34 +00:00
|
|
|
if (errno)
|
2014-07-09 13:48:59 +00:00
|
|
|
eprintf("getpwnam %s:", owner);
|
2015-03-08 23:37:34 +00:00
|
|
|
uid = estrtonum(owner, 0, UINT_MAX);
|
2014-07-09 13:48:59 +00:00
|
|
|
}
|
2011-05-24 23:24:33 +00:00
|
|
|
}
|
2014-11-13 17:29:30 +00:00
|
|
|
if (group && *group) {
|
2011-05-24 23:24:33 +00:00
|
|
|
errno = 0;
|
|
|
|
|
gr = getgrnam(group);
|
2014-11-13 17:29:30 +00:00
|
|
|
if (gr) {
|
2014-11-02 22:24:53 +00:00
|
|
|
gid = gr->gr_gid;
|
|
|
|
|
} else {
|
2015-03-08 23:37:34 +00:00
|
|
|
if (errno)
|
2014-07-09 13:48:59 +00:00
|
|
|
eprintf("getgrnam %s:", group);
|
2015-03-08 23:37:34 +00:00
|
|
|
gid = estrtonum(group, 0, UINT_MAX);
|
2014-07-09 13:48:59 +00:00
|
|
|
}
|
2011-05-24 23:24:33 +00:00
|
|
|
}
|
2015-03-08 23:37:34 +00:00
|
|
|
for (argc--, argv++; *argv; argc--, argv++)
|
Refactor recurse() again
Okay, why yet another recurse()-refactor?
The last one added the recursor-struct, which simplified things
on the user-end, but there was still one thing that bugged me a lot:
Previously, all fn()'s were forced to (l)stat the paths themselves.
This does not work well when you try to keep up with H-, L- and P-
flags at the same time, as each utility-function would have to set
the right function-pointer for (l)stat every single time.
This is not desirable. Furthermore, recurse should be easy to use
and not involve trouble finding the right (l)stat-function to do it
right.
So, what we needed was a stat-argument for each fn(), so it is
directly accessible. This was impossible to do though when the
fn()'s are still directly called by the programs to "start" the
recurse.
Thus, the fundamental change is to make recurse() the function to
go, while designing the fn()'s in a way they can "live" with st
being NULL (we don't want a null-pointer-deref).
What you can see in this commit is the result of this work. Why
all this trouble instead of using nftw?
The special thing about recurse() is that you tell the function
when to recurse() in your fn(). You don't need special flags to
tell nftw() to skip the subtree, just to give an example.
The only single downside to this is that now, you are not allowed
to unconditionally call recurse() from your fn(). It has to be
a directory.
However, that is a cost I think is easily weighed up by the
advantages.
Another thing is the history: I added a procedure at the end of
the outmost recurse to free the history. This way we don't leak
memory.
A simple optimization on the side:
- if (h->dev == st.st_dev && h->ino == st.st_ino)
+ if (h->ino == st.st_ino && h->dev == st.st_dev)
First compare the likely difference in inode-numbers instead of
checking the unlikely condition that the device-numbers are
different.
2015-03-18 23:53:42 +00:00
|
|
|
recurse(*argv, NULL, &r);
|
2013-06-14 18:20:47 +00:00
|
|
|
|
2015-03-12 23:25:32 +00:00
|
|
|
return ret || recurse_status;
|
2011-05-24 23:24:33 +00:00
|
|
|
}
|
