Lines Matching +full:differ +full:-

3 /*-
4 * Copyright (c) 2003 Poul-Henning Kamp
49 (((a)->flags & (c)) && ((b)->flags & (c)) && ((a)->d) != ((b)->d))
51 (((a)->flags & (c)) && ((b)->flags & (c)) && strcmp((a)->d,(b)->d))
53 (((a)->flags & (c)) && ((b)->flags & (c)) && memcmp(&(a)->d,&(b)->d, sizeof (a)->d))
61 printf("%s%s %s", path, n->name, inotype(nodetoino(n->type))); in shownode()
63 printf(" cksum=%lu", n->cksum); in shownode()
65 printf(" gid=%d", n->st_gid); in shownode()
67 gr = getgrgid(n->st_gid); in shownode()
69 printf(" gid=%d", n->st_gid); in shownode()
71 printf(" gname=%s", gr->gr_name); in shownode()
74 printf(" mode=%o", n->st_mode); in shownode()
76 printf(" nlink=%ju", (uintmax_t)n->st_nlink); in shownode()
78 printf(" size=%jd", (intmax_t)n->st_size); in shownode()
80 printf(" uid=%d", n->st_uid); in shownode()
82 pw = getpwuid(n->st_uid); in shownode()
84 printf(" uid=%d", n->st_uid); in shownode()
86 printf(" uname=%s", pw->pw_name); in shownode()
89 printf(" %s=%s", MD5KEY, n->md5digest); in shownode()
91 printf(" %s=%s", SHA1KEY, n->sha1digest); in shownode()
93 printf(" %s=%s", RMD160KEY, n->rmd160digest); in shownode()
95 printf(" %s=%s", SHA256KEY, n->sha256digest); in shownode()
97 printf(" %s=%s", SHA384KEY, n->sha384digest); in shownode()
99 printf(" %s=%s", SHA512KEY, n->sha512digest); in shownode()
101 printf(" flags=%s", flags_to_string(n->st_flags, "none")); in shownode()
106 mismatch(NODE *n1, NODE *n2, int differ, char const *path) in mismatch() argument
110 shownode(n1, differ, path); in mismatch()
115 shownode(n2, differ, path); in mismatch()
118 if (!(differ & keys)) in mismatch()
121 shownode(n1, differ, path); in mismatch()
123 shownode(n2, differ, path); in mismatch()
132 if (n1 != NULL && n1->type == F_LINK) in compare_nodes()
133 n1->flags &= ~F_MODE; in compare_nodes()
134 if (n2 != NULL && n2->type == F_LINK) in compare_nodes()
135 n2->flags &= ~F_MODE; in compare_nodes()
138 differs = n2->flags; in compare_nodes()
143 differs = n1->flags; in compare_nodes()
147 if (n1->type != n2->type) { in compare_nodes()
202 c1 = t1->child; in walk_in_the_forest()
206 c2 = t2->child; in walk_in_the_forest()
212 n1 = c1->next; in walk_in_the_forest()
214 n2 = c2->next; in walk_in_the_forest()
216 if (c1->type != F_DIR && c2->type == F_DIR) { in walk_in_the_forest()
219 } else if (c1->type == F_DIR && c2->type != F_DIR) { in walk_in_the_forest()
223 i = strcmp(c1->name, c2->name); in walk_in_the_forest()
233 if (c1 == NULL && c2->type == F_DIR) { in walk_in_the_forest()
234 asprintf(&np, "%s%s/", path, c2->name); in walk_in_the_forest()
238 } else if (c2 == NULL && c1->type == F_DIR) { in walk_in_the_forest()
239 asprintf(&np, "%s%s/", path, c1->name); in walk_in_the_forest()
245 } else if (c1->type == F_DIR && c2->type == F_DIR) { in walk_in_the_forest()
246 asprintf(&np, "%s%s/", path, c1->name); in walk_in_the_forest()