Give mtree(8) the ability to take [two -f spec] arguments and compare
the two specifications to each other.
This commit is contained in:
parent
5324d49a71
commit
b3e66ec9df
Notes:
svn2git
2020-12-20 02:59:44 +00:00
svn path=/head/; revision=122141
@ -6,6 +6,7 @@
|
||||
PROG= mtree
|
||||
MAN= mtree.8
|
||||
SRCS= compare.c crc.c create.c excludes.c misc.c mtree.c spec.c verify.c
|
||||
SRCS+= specspec.c
|
||||
|
||||
WARNS?= 4
|
||||
|
||||
|
@ -64,8 +64,6 @@ __FBSDID("$FreeBSD$");
|
||||
extern int uflag;
|
||||
extern int lineno;
|
||||
|
||||
static const char *ftype(u_int);
|
||||
|
||||
#define INDENTNAMELEN 8
|
||||
#define LABEL \
|
||||
if (!label++) { \
|
||||
@ -333,7 +331,7 @@ inotype(u_int type)
|
||||
/* NOTREACHED */
|
||||
}
|
||||
|
||||
static const char *
|
||||
const char *
|
||||
ftype(u_int type)
|
||||
{
|
||||
switch(type) {
|
||||
|
@ -31,7 +31,9 @@
|
||||
*/
|
||||
extern uint32_t crc_total;
|
||||
|
||||
#ifdef _FTS_H_
|
||||
int compare(char *, NODE *, FTSENT *);
|
||||
#endif
|
||||
int crc(int, uint32_t *, off_t *);
|
||||
void cwalk(void);
|
||||
char *flags_to_string(u_long);
|
||||
@ -41,7 +43,9 @@ u_int parsekey(char *, int *);
|
||||
char *rlink(char *);
|
||||
NODE *mtree_readspec(FILE *fi);
|
||||
int mtree_verifyspec(FILE *fi);
|
||||
int mtree_specspec(FILE *fi, FILE *fj);
|
||||
|
||||
int check_excludes(const char *, const char *);
|
||||
void init_excludes(void);
|
||||
void read_excludes_file(const char *);
|
||||
const char * ftype(u_int type);
|
||||
|
@ -45,6 +45,9 @@
|
||||
.Op Fl f Ar spec
|
||||
.Ek
|
||||
.Bk -words
|
||||
.Op Fl f Ar spec
|
||||
.Ek
|
||||
.Bk -words
|
||||
.Op Fl K Ar keywords
|
||||
.Ek
|
||||
.Bk -words
|
||||
@ -122,6 +125,16 @@ Don't descend below mount points in the file hierarchy.
|
||||
Read the specification from
|
||||
.Ar file ,
|
||||
instead of from the standard input.
|
||||
.Pp
|
||||
If this option is specified twice, the two specifications are compared
|
||||
to each other rather than to the file hierarchy.
|
||||
The specifications be sorted like output generated using
|
||||
.Fl c .
|
||||
The output format in this case is somewhat remniscent of
|
||||
.Xr comm 1 ,
|
||||
having "in first spec only", "in second spec only", and "different"
|
||||
columns, prefixed by zero, one and two TAB characters respectively.
|
||||
Each entry in the "different" column occupies two lines, one from each specfication.
|
||||
.It Fl K Ar keywords
|
||||
Add the specified (whitespace or comma separated)
|
||||
.Ar keywords
|
||||
|
@ -64,10 +64,13 @@ main(int argc, char *argv[])
|
||||
int ch;
|
||||
char *dir, *p;
|
||||
int status;
|
||||
FILE *spec1, *spec2;
|
||||
|
||||
dir = NULL;
|
||||
keys = KEYDEFAULT;
|
||||
init_excludes();
|
||||
spec1 = stdin;
|
||||
spec2 = NULL;
|
||||
|
||||
while ((ch = getopt(argc, argv, "cdef:iK:k:LnPp:qrs:UuxX:")) != -1)
|
||||
switch((char)ch) {
|
||||
@ -81,8 +84,16 @@ main(int argc, char *argv[])
|
||||
eflag = 1;
|
||||
break;
|
||||
case 'f':
|
||||
if (!(freopen(optarg, "r", stdin)))
|
||||
err(1, "%s", optarg);
|
||||
if (spec1 == stdin) {
|
||||
spec1 = fopen(optarg, "r");
|
||||
if (spec1 == NULL)
|
||||
err(1, "%s", optarg);
|
||||
} else if (spec2 == NULL) {
|
||||
spec2 = fopen(optarg, "r");
|
||||
if (spec2 == NULL)
|
||||
err(1, "%s", optarg);
|
||||
} else
|
||||
usage();
|
||||
break;
|
||||
case 'i':
|
||||
iflag = 1;
|
||||
@ -157,7 +168,10 @@ main(int argc, char *argv[])
|
||||
cwalk();
|
||||
exit(0);
|
||||
}
|
||||
status = mtree_verifyspec(stdin);
|
||||
if (spec2 != NULL)
|
||||
status = mtree_specspec(spec1, spec2);
|
||||
else
|
||||
status = mtree_verifyspec(spec1);
|
||||
if (Uflag & (status == MISMATCHEXIT))
|
||||
status = 0;
|
||||
exit(status);
|
||||
@ -167,7 +181,7 @@ static void
|
||||
usage(void)
|
||||
{
|
||||
(void)fprintf(stderr,
|
||||
"usage: mtree [-LPUcdeinqrux] [-f spec] [-K key] [-k key] [-p path] [-s seed]\n"
|
||||
"usage: mtree [-LPUcdeinqrux] [-f spec] [-f spec] [-K key] [-k key] [-p path] [-s seed]\n"
|
||||
"\t[-X excludes]\n");
|
||||
exit(1);
|
||||
}
|
||||
|
201
usr.sbin/mtree/specspec.c
Normal file
201
usr.sbin/mtree/specspec.c
Normal file
@ -0,0 +1,201 @@
|
||||
/*-
|
||||
* Copyright (c) 2003 Poul-Henning Kamp
|
||||
* All rights reserved.
|
||||
*
|
||||
* Please see src/share/examples/etc/bsd-style-copyright.
|
||||
*/
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
__FBSDID("$FreeBSD$");
|
||||
|
||||
#include <err.h>
|
||||
#include <grp.h>
|
||||
#include <pwd.h>
|
||||
#include <stdio.h>
|
||||
#include <stdint.h>
|
||||
#include <unistd.h>
|
||||
#include "mtree.h"
|
||||
#include "extern.h"
|
||||
|
||||
#define FF(a, b, c, d) \
|
||||
(((a)->flags & (c)) && ((b)->flags & (c)) && ((a)->d) != ((b)->d))
|
||||
#define FS(a, b, c, d) \
|
||||
(((a)->flags & (c)) && ((b)->flags & (c)) && strcmp((a)->d,(b)->d))
|
||||
#define FM(a, b, c, d) \
|
||||
(((a)->flags & (c)) && ((b)->flags & (c)) && memcmp(&(a)->d,&(b)->d, sizeof (a)->d))
|
||||
|
||||
static void
|
||||
shownode(NODE *n, int f, char const *path)
|
||||
{
|
||||
struct group *gr;
|
||||
struct passwd *pw;
|
||||
|
||||
printf("%s%s %s", path, n->name, ftype(n->type));
|
||||
if (f & F_CKSUM)
|
||||
printf(" cksum=%lu", n->cksum);
|
||||
if (f & F_GID)
|
||||
printf(" gid=%d", n->st_gid);
|
||||
if (f & F_GNAME) {
|
||||
gr = getgrgid(n->st_gid);
|
||||
if (gr == NULL)
|
||||
printf(" gid=%d", n->st_gid);
|
||||
else
|
||||
printf(" gname=%s", gr->gr_name);
|
||||
}
|
||||
if (f & F_MODE)
|
||||
printf(" mode=%o", n->st_mode);
|
||||
if (f & F_NLINK)
|
||||
printf(" nlink=%d", n->st_nlink);
|
||||
if (f & F_SIZE)
|
||||
printf(" size=%jd", (intmax_t)n->st_size);
|
||||
if (f & F_UID)
|
||||
printf(" uid=%d", n->st_uid);
|
||||
if (f & F_UNAME) {
|
||||
pw = getpwuid(n->st_uid);
|
||||
if (pw == NULL)
|
||||
printf(" uid=%d", n->st_uid);
|
||||
else
|
||||
printf(" uname=%s", pw->pw_name);
|
||||
}
|
||||
if (f & F_MD5)
|
||||
printf(" md5digest=%s", n->md5digest);
|
||||
if (f & F_SHA1)
|
||||
printf(" sha1digest=%s", n->sha1digest);
|
||||
if (f & F_RMD160)
|
||||
printf(" rmd160digest=%s", n->rmd160digest);
|
||||
if (f & F_FLAGS)
|
||||
printf(" flags=%s", flags_to_string(n->st_flags));
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
static int
|
||||
mismatch(NODE *n1, NODE *n2, int differ, char const *path)
|
||||
{
|
||||
if (n2 == NULL) {
|
||||
shownode(n1, differ, path);
|
||||
return (1);
|
||||
}
|
||||
if (n1 == NULL) {
|
||||
printf("\t");
|
||||
shownode(n2, differ, path);
|
||||
return (1);
|
||||
}
|
||||
printf("\t\t");
|
||||
shownode(n1, differ, path);
|
||||
printf("\t\t");
|
||||
shownode(n2, differ, path);
|
||||
return (1);
|
||||
}
|
||||
|
||||
static int
|
||||
compare_nodes(NODE *n1, NODE *n2, char const *path)
|
||||
{
|
||||
int differs;
|
||||
|
||||
differs = 0;
|
||||
if (n1 == NULL && n2 != NULL) {
|
||||
differs = n2->flags;
|
||||
mismatch(n1, n2, differs, path);
|
||||
return (1);
|
||||
}
|
||||
if (n1 != NULL && n2 == NULL) {
|
||||
differs = n1->flags;
|
||||
mismatch(n1, n2, differs, path);
|
||||
return (1);
|
||||
}
|
||||
if (n1->type != n2->type) {
|
||||
differs = 0;
|
||||
mismatch(n1, n2, differs, path);
|
||||
return (1);
|
||||
}
|
||||
if (FF(n1, n2, F_CKSUM, cksum))
|
||||
differs |= F_CKSUM;
|
||||
if (FF(n1, n2, F_GID, st_gid))
|
||||
differs |= F_GID;
|
||||
if (FF(n1, n2, F_GNAME, st_gid))
|
||||
differs |= F_GNAME;
|
||||
if (FF(n1, n2, F_MODE, st_mode))
|
||||
differs |= F_MODE;
|
||||
if (FF(n1, n2, F_NLINK, st_nlink))
|
||||
differs |= F_NLINK;
|
||||
if (FF(n1, n2, F_SIZE, st_size))
|
||||
differs |= F_SIZE;
|
||||
if (FS(n1, n2, F_SLINK, slink))
|
||||
differs |= F_SLINK;
|
||||
if (FM(n1, n2, F_TIME, st_mtimespec))
|
||||
differs |= F_TIME;
|
||||
if (FF(n1, n2, F_UID, st_uid))
|
||||
differs |= F_UID;
|
||||
if (FF(n1, n2, F_UNAME, st_uid))
|
||||
differs |= F_UNAME;
|
||||
if (FS(n1, n2, F_MD5, md5digest))
|
||||
differs |= F_MD5;
|
||||
if (FS(n1, n2, F_SHA1, sha1digest))
|
||||
differs |= F_SHA1;
|
||||
if (FS(n1, n2, F_RMD160, rmd160digest))
|
||||
differs |= F_RMD160;
|
||||
if (FF(n1, n2, F_FLAGS, st_flags))
|
||||
differs |= F_FLAGS;
|
||||
if (differs) {
|
||||
mismatch(n1, n2, differs, path);
|
||||
return (1);
|
||||
}
|
||||
return (0);
|
||||
}
|
||||
static int
|
||||
walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
|
||||
{
|
||||
int r, i;
|
||||
NODE *c1, *c2, *n1, *n2;
|
||||
char *np;
|
||||
|
||||
r = 0;
|
||||
|
||||
c1 = t1->child;
|
||||
c2 = t2->child;
|
||||
while (c1 != NULL || c2 != NULL) {
|
||||
n1 = n2 = NULL;
|
||||
if (c1 != NULL)
|
||||
n1 = c1->next;
|
||||
if (c2 != NULL)
|
||||
n2 = c2->next;
|
||||
if (c1 != NULL && c2 != NULL) {
|
||||
i = strcmp(c1->name, c2->name);
|
||||
if (i > 0) {
|
||||
n1 = c1;
|
||||
c1 = NULL;
|
||||
} else if (i < 0) {
|
||||
n2 = c2;
|
||||
c2 = NULL;
|
||||
}
|
||||
}
|
||||
if (c1 == NULL || c2 == NULL) {
|
||||
i = compare_nodes(c1, c2, path);
|
||||
} else if (c1->child != NULL || c2->child != NULL) {
|
||||
asprintf(&np, "%s%s/", path, c1->name);
|
||||
i = walk_in_the_forest(c1, c2, np);
|
||||
free(np);
|
||||
} else {
|
||||
i = compare_nodes(c1, c2, path);
|
||||
}
|
||||
r += i;
|
||||
c1 = n1;
|
||||
c2 = n2;
|
||||
}
|
||||
i = compare_nodes(t1, t2, path);
|
||||
return (r);
|
||||
}
|
||||
|
||||
int
|
||||
mtree_specspec(FILE *fi, FILE *fj)
|
||||
{
|
||||
int rval;
|
||||
NODE *root1, *root2;
|
||||
|
||||
root1 = mtree_readspec(fi);
|
||||
root2 = mtree_readspec(fj);
|
||||
rval = walk_in_the_forest(root1, root2, "");
|
||||
if (rval > 0)
|
||||
return (MISMATCHEXIT);
|
||||
return (0);
|
||||
}
|
@ -63,6 +63,5 @@ if [ ! -d ${TMP}/mt/\# ] ; then
|
||||
fi
|
||||
rmdir ${TMP}/mr/\#
|
||||
|
||||
echo Passed test 1>&2
|
||||
rm -rf ${TMP}
|
||||
exit 0
|
||||
|
Loading…
Reference in New Issue
Block a user