1/*- 2 * Copyright (c) 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30#if 0 31#ifndef lint 32static char sccsid[] = "@(#)compare.c 8.1 (Berkeley) 6/6/93"; 33#endif /* not lint */ 34#endif 35#include <sys/cdefs.h>
|
58#include <stdint.h> 59#include <stdio.h> 60#include <time.h> 61#include <unistd.h> 62#include <vis.h> 63 64#include "mtree.h" 65#include "extern.h" 66 67#define INDENTNAMELEN 8 68#define LABEL \ 69 if (!label++) { \ 70 len = printf("%s changed\n", RP(p)); \ 71 tab = "\t"; \ 72 } 73 74int 75compare(char *name __unused, NODE *s, FTSENT *p) 76{ 77 struct timeval tv[2]; 78 uint32_t val; 79 int fd, label; 80 off_t len; 81 char *cp; 82 const char *tab = ""; 83 char *fflags; 84 85 label = 0; 86 switch(s->type) { 87 case F_BLOCK: 88 if (!S_ISBLK(p->fts_statp->st_mode)) 89 goto typeerr; 90 break; 91 case F_CHAR: 92 if (!S_ISCHR(p->fts_statp->st_mode)) 93 goto typeerr; 94 break; 95 case F_DIR: 96 if (!S_ISDIR(p->fts_statp->st_mode)) 97 goto typeerr; 98 break; 99 case F_FIFO: 100 if (!S_ISFIFO(p->fts_statp->st_mode)) 101 goto typeerr; 102 break; 103 case F_FILE: 104 if (!S_ISREG(p->fts_statp->st_mode)) 105 goto typeerr; 106 break; 107 case F_LINK: 108 if (!S_ISLNK(p->fts_statp->st_mode)) 109 goto typeerr; 110 break; 111 case F_SOCK: 112 if (!S_ISSOCK(p->fts_statp->st_mode)) { 113typeerr: LABEL; 114 (void)printf("\ttype expected %s found %s\n", 115 ftype(s->type), inotype(p->fts_statp->st_mode)); 116 return (label); 117 } 118 break; 119 } 120 /* Set the uid/gid first, then set the mode. */ 121 if (s->flags & (F_UID | F_UNAME) && s->st_uid != p->fts_statp->st_uid) { 122 LABEL; 123 (void)printf("%suser expected %lu found %lu", 124 tab, (u_long)s->st_uid, (u_long)p->fts_statp->st_uid); 125 if (uflag) 126 if (chown(p->fts_accpath, s->st_uid, -1)) 127 (void)printf(" not modified: %s\n", 128 strerror(errno)); 129 else 130 (void)printf(" modified\n"); 131 else 132 (void)printf("\n"); 133 tab = "\t"; 134 } 135 if (s->flags & (F_GID | F_GNAME) && s->st_gid != p->fts_statp->st_gid) { 136 LABEL; 137 (void)printf("%sgid expected %lu found %lu", 138 tab, (u_long)s->st_gid, (u_long)p->fts_statp->st_gid); 139 if (uflag) 140 if (chown(p->fts_accpath, -1, s->st_gid)) 141 (void)printf(" not modified: %s\n", 142 strerror(errno)); 143 else 144 (void)printf(" modified\n"); 145 else 146 (void)printf("\n"); 147 tab = "\t"; 148 } 149 if (s->flags & F_MODE && 150 !S_ISLNK(p->fts_statp->st_mode) && 151 s->st_mode != (p->fts_statp->st_mode & MBITS)) { 152 LABEL; 153 (void)printf("%spermissions expected %#o found %#o", 154 tab, s->st_mode, p->fts_statp->st_mode & MBITS); 155 if (uflag) 156 if (chmod(p->fts_accpath, s->st_mode)) 157 (void)printf(" not modified: %s\n", 158 strerror(errno)); 159 else 160 (void)printf(" modified\n"); 161 else 162 (void)printf("\n"); 163 tab = "\t"; 164 } 165 if (s->flags & F_NLINK && s->type != F_DIR && 166 s->st_nlink != p->fts_statp->st_nlink) { 167 LABEL; 168 (void)printf("%slink_count expected %u found %u\n", 169 tab, s->st_nlink, p->fts_statp->st_nlink); 170 tab = "\t"; 171 } 172 if (s->flags & F_SIZE && s->st_size != p->fts_statp->st_size && 173 !S_ISDIR(p->fts_statp->st_mode)) { 174 LABEL; 175 (void)printf("%ssize expected %jd found %jd\n", tab, 176 (intmax_t)s->st_size, (intmax_t)p->fts_statp->st_size); 177 tab = "\t"; 178 } 179 /* 180 * XXX 181 * Catches nano-second differences, but doesn't display them. 182 */ 183 if ((s->flags & F_TIME) && 184 ((s->st_mtimespec.tv_sec != p->fts_statp->st_mtimespec.tv_sec) || 185 (s->st_mtimespec.tv_nsec != p->fts_statp->st_mtimespec.tv_nsec))) { 186 LABEL; 187 (void)printf("%smodification time expected %.24s ", 188 tab, ctime(&s->st_mtimespec.tv_sec)); 189 (void)printf("found %.24s", 190 ctime(&p->fts_statp->st_mtimespec.tv_sec)); 191 if (uflag) { 192 tv[0].tv_sec = s->st_mtimespec.tv_sec; 193 tv[0].tv_usec = s->st_mtimespec.tv_nsec / 1000; 194 tv[1] = tv[0]; 195 if (utimes(p->fts_accpath, tv)) 196 (void)printf(" not modified: %s\n", 197 strerror(errno)); 198 else 199 (void)printf(" modified\n"); 200 } else 201 (void)printf("\n"); 202 tab = "\t"; 203 } 204 if (s->flags & F_CKSUM) { 205 if ((fd = open(p->fts_accpath, O_RDONLY, 0)) < 0) { 206 LABEL; 207 (void)printf("%scksum: %s: %s\n", 208 tab, p->fts_accpath, strerror(errno)); 209 tab = "\t"; 210 } else if (crc(fd, &val, &len)) { 211 (void)close(fd); 212 LABEL; 213 (void)printf("%scksum: %s: %s\n", 214 tab, p->fts_accpath, strerror(errno)); 215 tab = "\t"; 216 } else { 217 (void)close(fd); 218 if (s->cksum != val) { 219 LABEL; 220 (void)printf("%scksum expected %lu found %lu\n", 221 tab, s->cksum, (unsigned long)val); 222 tab = "\t"; 223 } 224 } 225 } 226 if ((s->flags & F_FLAGS) && s->st_flags != p->fts_statp->st_flags) { 227 LABEL; 228 fflags = flags_to_string(s->st_flags); 229 (void)printf("%sflags expected \"%s\"", tab, fflags); 230 free(fflags); 231 232 fflags = flags_to_string(p->fts_statp->st_flags); 233 (void)printf(" found \"%s\"", fflags); 234 free(fflags); 235 236 if (uflag) 237 if (chflags(p->fts_accpath, s->st_flags)) 238 (void)printf(" not modified: %s\n", 239 strerror(errno)); 240 else 241 (void)printf(" modified\n"); 242 else 243 (void)printf("\n"); 244 tab = "\t"; 245 } 246#ifdef MD5 247 if (s->flags & F_MD5) { 248 char *new_digest, buf[33]; 249 250 new_digest = MD5File(p->fts_accpath, buf); 251 if (!new_digest) { 252 LABEL; 253 printf("%sMD5: %s: %s\n", tab, p->fts_accpath, 254 strerror(errno)); 255 tab = "\t"; 256 } else if (strcmp(new_digest, s->md5digest)) { 257 LABEL; 258 printf("%sMD5 expected %s found %s\n", tab, s->md5digest, 259 new_digest); 260 tab = "\t"; 261 } 262 } 263#endif /* MD5 */ 264#ifdef SHA1 265 if (s->flags & F_SHA1) { 266 char *new_digest, buf[41]; 267 268 new_digest = SHA1_File(p->fts_accpath, buf); 269 if (!new_digest) { 270 LABEL; 271 printf("%sSHA-1: %s: %s\n", tab, p->fts_accpath, 272 strerror(errno)); 273 tab = "\t"; 274 } else if (strcmp(new_digest, s->sha1digest)) { 275 LABEL; 276 printf("%sSHA-1 expected %s found %s\n", 277 tab, s->sha1digest, new_digest); 278 tab = "\t"; 279 } 280 } 281#endif /* SHA1 */ 282#ifdef RMD160 283 if (s->flags & F_RMD160) { 284 char *new_digest, buf[41]; 285 286 new_digest = RIPEMD160_File(p->fts_accpath, buf); 287 if (!new_digest) { 288 LABEL; 289 printf("%sRIPEMD160: %s: %s\n", tab, 290 p->fts_accpath, strerror(errno)); 291 tab = "\t"; 292 } else if (strcmp(new_digest, s->rmd160digest)) { 293 LABEL; 294 printf("%sRIPEMD160 expected %s found %s\n", 295 tab, s->rmd160digest, new_digest); 296 tab = "\t"; 297 } 298 } 299#endif /* RMD160 */
|