specspec.c revision 123067
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 123067 2003-11-30 18:06:02Z 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 75 if (n2 == NULL) { 76 shownode(n1, differ, path); 77 return (1); 78 } 79 if (n1 == NULL) { 80 printf("\t"); 81 shownode(n2, differ, path); 82 return (1); 83 } 84 printf("\t\t"); 85 shownode(n1, differ, path); 86 printf("\t\t"); 87 shownode(n2, differ, path); 88 return (1); 89} 90 91static int 92compare_nodes(NODE *n1, NODE *n2, char const *path) 93{ 94 int differs; 95 96 differs = 0; 97 if (n1 == NULL && n2 != NULL) { 98 differs = n2->flags; 99 mismatch(n1, n2, differs, path); 100 return (1); 101 } 102 if (n1 != NULL && n2 == NULL) { 103 differs = n1->flags; 104 mismatch(n1, n2, differs, path); 105 return (1); 106 } 107 if (n1->type != n2->type) { 108 differs = 0; 109 mismatch(n1, n2, differs, path); 110 return (1); 111 } 112 if (FF(n1, n2, F_CKSUM, cksum)) 113 differs |= F_CKSUM; 114 if (FF(n1, n2, F_GID, st_gid)) 115 differs |= F_GID; 116 if (FF(n1, n2, F_GNAME, st_gid)) 117 differs |= F_GNAME; 118 if (FF(n1, n2, F_MODE, st_mode)) 119 differs |= F_MODE; 120 if (FF(n1, n2, F_NLINK, st_nlink)) 121 differs |= F_NLINK; 122 if (FF(n1, n2, F_SIZE, st_size)) 123 differs |= F_SIZE; 124 if (FS(n1, n2, F_SLINK, slink)) 125 differs |= F_SLINK; 126 if (FM(n1, n2, F_TIME, st_mtimespec)) 127 differs |= F_TIME; 128 if (FF(n1, n2, F_UID, st_uid)) 129 differs |= F_UID; 130 if (FF(n1, n2, F_UNAME, st_uid)) 131 differs |= F_UNAME; 132 if (FS(n1, n2, F_MD5, md5digest)) 133 differs |= F_MD5; 134 if (FS(n1, n2, F_SHA1, sha1digest)) 135 differs |= F_SHA1; 136 if (FS(n1, n2, F_RMD160, rmd160digest)) 137 differs |= F_RMD160; 138 if (FF(n1, n2, F_FLAGS, st_flags)) 139 differs |= F_FLAGS; 140 if (differs) { 141 mismatch(n1, n2, differs, path); 142 return (1); 143 } 144 return (0); 145} 146static int 147walk_in_the_forest(NODE *t1, NODE *t2, char const *path) 148{ 149 int r, i; 150 NODE *c1, *c2, *n1, *n2; 151 char *np; 152 153 r = 0; 154 155 if (t1 != NULL) 156 c1 = t1->child; 157 else 158 c1 = NULL; 159 if (t2 != NULL) 160 c2 = t2->child; 161 else 162 c2 = NULL; 163 while (c1 != NULL || c2 != NULL) { 164 n1 = n2 = NULL; 165 if (c1 != NULL) 166 n1 = c1->next; 167 if (c2 != NULL) 168 n2 = c2->next; 169 if (c1 != NULL && c2 != NULL) { 170 if (c1->type != F_DIR && c2->type == F_DIR) { 171 n2 = c2; 172 c2 = NULL; 173 } else if (c1->type == F_DIR && c2->type != F_DIR) { 174 n1 = c1; 175 c1 = NULL; 176 } else { 177 i = strcmp(c1->name, c2->name); 178 if (i > 0) { 179 n1 = c1; 180 c1 = NULL; 181 } else if (i < 0) { 182 n2 = c2; 183 c2 = NULL; 184 } 185 } 186 } 187 if (c1 == NULL || c2 == NULL) { 188 i = compare_nodes(c1, c2, path); 189 } else if (c1->child != NULL || c2->child != NULL) { 190 asprintf(&np, "%s%s/", path, c1->name); 191 i = walk_in_the_forest(c1, c2, np); 192 free(np); 193 } else { 194 i = compare_nodes(c1, c2, path); 195 } 196 r += i; 197 c1 = n1; 198 c2 = n2; 199 } 200 i = compare_nodes(t1, t2, path); 201 return (r); 202} 203 204int 205mtree_specspec(FILE *fi, FILE *fj) 206{ 207 int rval; 208 NODE *root1, *root2; 209 210 root1 = mtree_readspec(fi); 211 root2 = mtree_readspec(fj); 212 rval = walk_in_the_forest(root1, root2, ""); 213 if (rval > 0) 214 return (MISMATCHEXIT); 215 return (0); 216} 217