specspec.c revision 122141
1/*- 2 * Copyright (c) 2003 Poul-Henning Kamp 3 * All rights reserved. 4 * 5 * Please see src/share/examples/etc/bsd-style-copyright. 6 */ 7 8#include <sys/cdefs.h> 9__FBSDID("$FreeBSD: head/usr.sbin/mtree/specspec.c 122141 2003-11-05 22:26:08Z phk $"); 10 11#include <err.h> 12#include <grp.h> 13#include <pwd.h> 14#include <stdio.h> 15#include <stdint.h> 16#include <unistd.h> 17#include "mtree.h" 18#include "extern.h" 19 20#define FF(a, b, c, d) \ 21 (((a)->flags & (c)) && ((b)->flags & (c)) && ((a)->d) != ((b)->d)) 22#define FS(a, b, c, d) \ 23 (((a)->flags & (c)) && ((b)->flags & (c)) && strcmp((a)->d,(b)->d)) 24#define FM(a, b, c, d) \ 25 (((a)->flags & (c)) && ((b)->flags & (c)) && memcmp(&(a)->d,&(b)->d, sizeof (a)->d)) 26 27static void 28shownode(NODE *n, int f, char const *path) 29{ 30 struct group *gr; 31 struct passwd *pw; 32 33 printf("%s%s %s", path, n->name, ftype(n->type)); 34 if (f & F_CKSUM) 35 printf(" cksum=%lu", n->cksum); 36 if (f & F_GID) 37 printf(" gid=%d", n->st_gid); 38 if (f & F_GNAME) { 39 gr = getgrgid(n->st_gid); 40 if (gr == NULL) 41 printf(" gid=%d", n->st_gid); 42 else 43 printf(" gname=%s", gr->gr_name); 44 } 45 if (f & F_MODE) 46 printf(" mode=%o", n->st_mode); 47 if (f & F_NLINK) 48 printf(" nlink=%d", n->st_nlink); 49 if (f & F_SIZE) 50 printf(" size=%jd", (intmax_t)n->st_size); 51 if (f & F_UID) 52 printf(" uid=%d", n->st_uid); 53 if (f & F_UNAME) { 54 pw = getpwuid(n->st_uid); 55 if (pw == NULL) 56 printf(" uid=%d", n->st_uid); 57 else 58 printf(" uname=%s", pw->pw_name); 59 } 60 if (f & F_MD5) 61 printf(" md5digest=%s", n->md5digest); 62 if (f & F_SHA1) 63 printf(" sha1digest=%s", n->sha1digest); 64 if (f & F_RMD160) 65 printf(" rmd160digest=%s", n->rmd160digest); 66 if (f & F_FLAGS) 67 printf(" flags=%s", flags_to_string(n->st_flags)); 68 printf("\n"); 69} 70 71static int 72mismatch(NODE *n1, NODE *n2, int differ, char const *path) 73{ 74 if (n2 == NULL) { 75 shownode(n1, differ, path); 76 return (1); 77 } 78 if (n1 == NULL) { 79 printf("\t"); 80 shownode(n2, differ, path); 81 return (1); 82 } 83 printf("\t\t"); 84 shownode(n1, differ, path); 85 printf("\t\t"); 86 shownode(n2, differ, path); 87 return (1); 88} 89 90static int 91compare_nodes(NODE *n1, NODE *n2, char const *path) 92{ 93 int differs; 94 95 differs = 0; 96 if (n1 == NULL && n2 != NULL) { 97 differs = n2->flags; 98 mismatch(n1, n2, differs, path); 99 return (1); 100 } 101 if (n1 != NULL && n2 == NULL) { 102 differs = n1->flags; 103 mismatch(n1, n2, differs, path); 104 return (1); 105 } 106 if (n1->type != n2->type) { 107 differs = 0; 108 mismatch(n1, n2, differs, path); 109 return (1); 110 } 111 if (FF(n1, n2, F_CKSUM, cksum)) 112 differs |= F_CKSUM; 113 if (FF(n1, n2, F_GID, st_gid)) 114 differs |= F_GID; 115 if (FF(n1, n2, F_GNAME, st_gid)) 116 differs |= F_GNAME; 117 if (FF(n1, n2, F_MODE, st_mode)) 118 differs |= F_MODE; 119 if (FF(n1, n2, F_NLINK, st_nlink)) 120 differs |= F_NLINK; 121 if (FF(n1, n2, F_SIZE, st_size)) 122 differs |= F_SIZE; 123 if (FS(n1, n2, F_SLINK, slink)) 124 differs |= F_SLINK; 125 if (FM(n1, n2, F_TIME, st_mtimespec)) 126 differs |= F_TIME; 127 if (FF(n1, n2, F_UID, st_uid)) 128 differs |= F_UID; 129 if (FF(n1, n2, F_UNAME, st_uid)) 130 differs |= F_UNAME; 131 if (FS(n1, n2, F_MD5, md5digest)) 132 differs |= F_MD5; 133 if (FS(n1, n2, F_SHA1, sha1digest)) 134 differs |= F_SHA1; 135 if (FS(n1, n2, F_RMD160, rmd160digest)) 136 differs |= F_RMD160; 137 if (FF(n1, n2, F_FLAGS, st_flags)) 138 differs |= F_FLAGS; 139 if (differs) { 140 mismatch(n1, n2, differs, path); 141 return (1); 142 } 143 return (0); 144} 145static int 146walk_in_the_forest(NODE *t1, NODE *t2, char const *path) 147{ 148 int r, i; 149 NODE *c1, *c2, *n1, *n2; 150 char *np; 151 152 r = 0; 153 154 c1 = t1->child; 155 c2 = t2->child; 156 while (c1 != NULL || c2 != NULL) { 157 n1 = n2 = NULL; 158 if (c1 != NULL) 159 n1 = c1->next; 160 if (c2 != NULL) 161 n2 = c2->next; 162 if (c1 != NULL && c2 != NULL) { 163 i = strcmp(c1->name, c2->name); 164 if (i > 0) { 165 n1 = c1; 166 c1 = NULL; 167 } else if (i < 0) { 168 n2 = c2; 169 c2 = NULL; 170 } 171 } 172 if (c1 == NULL || c2 == NULL) { 173 i = compare_nodes(c1, c2, path); 174 } else if (c1->child != NULL || c2->child != NULL) { 175 asprintf(&np, "%s%s/", path, c1->name); 176 i = walk_in_the_forest(c1, c2, np); 177 free(np); 178 } else { 179 i = compare_nodes(c1, c2, path); 180 } 181 r += i; 182 c1 = n1; 183 c2 = n2; 184 } 185 i = compare_nodes(t1, t2, path); 186 return (r); 187} 188 189int 190mtree_specspec(FILE *fi, FILE *fj) 191{ 192 int rval; 193 NODE *root1, *root2; 194 195 root1 = mtree_readspec(fi); 196 root2 = mtree_readspec(fj); 197 rval = walk_in_the_forest(root1, root2, ""); 198 if (rval > 0) 199 return (MISMATCHEXIT); 200 return (0); 201} 202