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