Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 1 | /* |
| 2 | * |
| 3 | * Copyright 2005, Lukas Sandstrom <lukass@etek.chalmers.se> |
| 4 | * |
| 5 | * This file is licensed under the GPL v2. |
| 6 | * |
| 7 | */ |
| 8 | |
| 9 | #include "cache.h" |
| 10 | |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 11 | #define BLKSIZE 512 |
| 12 | |
Lukas_Sandström | 9bc0f32 | 2005-11-10 00:16:13 +0100 | [diff] [blame] | 13 | static const char pack_redundant_usage[] = |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 14 | "git-pack-redundant [ --verbose ] [ --alt-odb ] < --all | <.pack filename> ...>"; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 15 | |
David Rientjes | 96f1e58 | 2006-08-15 10:23:48 -0700 | [diff] [blame] | 16 | static int load_all_packs, verbose, alt_odb; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 17 | |
| 18 | struct llist_item { |
| 19 | struct llist_item *next; |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 20 | const unsigned char *sha1; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 21 | }; |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 22 | static struct llist { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 23 | struct llist_item *front; |
| 24 | struct llist_item *back; |
| 25 | size_t size; |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 26 | } *all_objects; /* all objects which must be present in local packfiles */ |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 27 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 28 | static struct pack_list { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 29 | struct pack_list *next; |
| 30 | struct packed_git *pack; |
| 31 | struct llist *unique_objects; |
| 32 | struct llist *all_objects; |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 33 | } *local_packs = NULL, *altodb_packs = NULL; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 34 | |
| 35 | struct pll { |
| 36 | struct pll *next; |
| 37 | struct pack_list *pl; |
| 38 | }; |
| 39 | |
David Rientjes | 96f1e58 | 2006-08-15 10:23:48 -0700 | [diff] [blame] | 40 | static struct llist_item *free_nodes; |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 41 | |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 42 | static inline void llist_item_put(struct llist_item *item) |
| 43 | { |
| 44 | item->next = free_nodes; |
| 45 | free_nodes = item; |
| 46 | } |
| 47 | |
Timo Hirvonen | 962554c | 2006-02-26 17:13:46 +0200 | [diff] [blame] | 48 | static inline struct llist_item *llist_item_get(void) |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 49 | { |
| 50 | struct llist_item *new; |
| 51 | if ( free_nodes ) { |
| 52 | new = free_nodes; |
| 53 | free_nodes = free_nodes->next; |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 54 | } else { |
| 55 | int i = 1; |
| 56 | new = xmalloc(sizeof(struct llist_item) * BLKSIZE); |
| 57 | for(;i < BLKSIZE; i++) { |
| 58 | llist_item_put(&new[i]); |
| 59 | } |
| 60 | } |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 61 | return new; |
| 62 | } |
| 63 | |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 64 | static void llist_free(struct llist *list) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 65 | { |
| 66 | while((list->back = list->front)) { |
| 67 | list->front = list->front->next; |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 68 | llist_item_put(list->back); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 69 | } |
| 70 | free(list); |
| 71 | } |
| 72 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 73 | static inline void llist_init(struct llist **list) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 74 | { |
| 75 | *list = xmalloc(sizeof(struct llist)); |
| 76 | (*list)->front = (*list)->back = NULL; |
| 77 | (*list)->size = 0; |
| 78 | } |
| 79 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 80 | static struct llist * llist_copy(struct llist *list) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 81 | { |
| 82 | struct llist *ret; |
| 83 | struct llist_item *new, *old, *prev; |
Junio C Hamano | a6080a0 | 2007-06-07 00:04:01 -0700 | [diff] [blame] | 84 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 85 | llist_init(&ret); |
| 86 | |
| 87 | if ((ret->size = list->size) == 0) |
| 88 | return ret; |
| 89 | |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 90 | new = ret->front = llist_item_get(); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 91 | new->sha1 = list->front->sha1; |
| 92 | |
| 93 | old = list->front->next; |
| 94 | while (old) { |
| 95 | prev = new; |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 96 | new = llist_item_get(); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 97 | prev->next = new; |
| 98 | new->sha1 = old->sha1; |
| 99 | old = old->next; |
| 100 | } |
| 101 | new->next = NULL; |
| 102 | ret->back = new; |
Junio C Hamano | a6080a0 | 2007-06-07 00:04:01 -0700 | [diff] [blame] | 103 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 104 | return ret; |
| 105 | } |
| 106 | |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 107 | static inline struct llist_item *llist_insert(struct llist *list, |
| 108 | struct llist_item *after, |
| 109 | const unsigned char *sha1) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 110 | { |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 111 | struct llist_item *new = llist_item_get(); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 112 | new->sha1 = sha1; |
| 113 | new->next = NULL; |
| 114 | |
| 115 | if (after != NULL) { |
| 116 | new->next = after->next; |
| 117 | after->next = new; |
| 118 | if (after == list->back) |
| 119 | list->back = new; |
| 120 | } else {/* insert in front */ |
| 121 | if (list->size == 0) |
| 122 | list->back = new; |
| 123 | else |
| 124 | new->next = list->front; |
| 125 | list->front = new; |
| 126 | } |
| 127 | list->size++; |
| 128 | return new; |
| 129 | } |
| 130 | |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 131 | static inline struct llist_item *llist_insert_back(struct llist *list, |
| 132 | const unsigned char *sha1) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 133 | { |
| 134 | return llist_insert(list, list->back, sha1); |
| 135 | } |
| 136 | |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 137 | static inline struct llist_item *llist_insert_sorted_unique(struct llist *list, |
| 138 | const unsigned char *sha1, struct llist_item *hint) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 139 | { |
| 140 | struct llist_item *prev = NULL, *l; |
| 141 | |
| 142 | l = (hint == NULL) ? list->front : hint; |
| 143 | while (l) { |
David Rientjes | a89fccd | 2006-08-17 11:54:57 -0700 | [diff] [blame] | 144 | int cmp = hashcmp(l->sha1, sha1); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 145 | if (cmp > 0) { /* we insert before this entry */ |
| 146 | return llist_insert(list, prev, sha1); |
| 147 | } |
| 148 | if(!cmp) { /* already exists */ |
| 149 | return l; |
| 150 | } |
| 151 | prev = l; |
| 152 | l = l->next; |
| 153 | } |
| 154 | /* insert at the end */ |
| 155 | return llist_insert_back(list, sha1); |
| 156 | } |
| 157 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 158 | /* returns a pointer to an item in front of sha1 */ |
Junio C Hamano | b99a394 | 2005-11-23 16:08:36 -0800 | [diff] [blame] | 159 | static inline struct llist_item * llist_sorted_remove(struct llist *list, const unsigned char *sha1, struct llist_item *hint) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 160 | { |
| 161 | struct llist_item *prev, *l; |
| 162 | |
| 163 | redo_from_start: |
| 164 | l = (hint == NULL) ? list->front : hint; |
| 165 | prev = NULL; |
| 166 | while (l) { |
David Rientjes | a89fccd | 2006-08-17 11:54:57 -0700 | [diff] [blame] | 167 | int cmp = hashcmp(l->sha1, sha1); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 168 | if (cmp > 0) /* not in list, since sorted */ |
| 169 | return prev; |
| 170 | if(!cmp) { /* found */ |
| 171 | if (prev == NULL) { |
| 172 | if (hint != NULL && hint != list->front) { |
| 173 | /* we don't know the previous element */ |
| 174 | hint = NULL; |
| 175 | goto redo_from_start; |
| 176 | } |
| 177 | list->front = l->next; |
| 178 | } else |
| 179 | prev->next = l->next; |
| 180 | if (l == list->back) |
| 181 | list->back = prev; |
Alex Riesen | 60435f6 | 2005-11-22 15:56:35 +0100 | [diff] [blame] | 182 | llist_item_put(l); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 183 | list->size--; |
| 184 | return prev; |
| 185 | } |
| 186 | prev = l; |
| 187 | l = l->next; |
| 188 | } |
| 189 | return prev; |
| 190 | } |
| 191 | |
Lukas Sandström | 1a41e74 | 2005-11-15 22:24:02 +0100 | [diff] [blame] | 192 | /* computes A\B */ |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 193 | static void llist_sorted_difference_inplace(struct llist *A, |
Lukas Sandström | 1a41e74 | 2005-11-15 22:24:02 +0100 | [diff] [blame] | 194 | struct llist *B) |
| 195 | { |
| 196 | struct llist_item *hint, *b; |
| 197 | |
| 198 | hint = NULL; |
| 199 | b = B->front; |
| 200 | |
| 201 | while (b) { |
| 202 | hint = llist_sorted_remove(A, b->sha1, hint); |
| 203 | b = b->next; |
| 204 | } |
| 205 | } |
| 206 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 207 | static inline struct pack_list * pack_list_insert(struct pack_list **pl, |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 208 | struct pack_list *entry) |
| 209 | { |
| 210 | struct pack_list *p = xmalloc(sizeof(struct pack_list)); |
| 211 | memcpy(p, entry, sizeof(struct pack_list)); |
| 212 | p->next = *pl; |
| 213 | *pl = p; |
| 214 | return p; |
| 215 | } |
| 216 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 217 | static inline size_t pack_list_size(struct pack_list *pl) |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 218 | { |
| 219 | size_t ret = 0; |
| 220 | while(pl) { |
| 221 | ret++; |
| 222 | pl = pl->next; |
| 223 | } |
| 224 | return ret; |
| 225 | } |
| 226 | |
Alex Riesen | d1ab157 | 2005-11-22 15:59:22 +0100 | [diff] [blame] | 227 | static struct pack_list * pack_list_difference(const struct pack_list *A, |
| 228 | const struct pack_list *B) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 229 | { |
Alex Riesen | d1ab157 | 2005-11-22 15:59:22 +0100 | [diff] [blame] | 230 | struct pack_list *ret; |
| 231 | const struct pack_list *pl; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 232 | |
| 233 | if (A == NULL) |
| 234 | return NULL; |
| 235 | |
| 236 | pl = B; |
| 237 | while (pl != NULL) { |
| 238 | if (A->pack == pl->pack) |
| 239 | return pack_list_difference(A->next, B); |
| 240 | pl = pl->next; |
| 241 | } |
| 242 | ret = xmalloc(sizeof(struct pack_list)); |
| 243 | memcpy(ret, A, sizeof(struct pack_list)); |
| 244 | ret->next = pack_list_difference(A->next, B); |
| 245 | return ret; |
| 246 | } |
| 247 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 248 | static void cmp_two_packs(struct pack_list *p1, struct pack_list *p2) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 249 | { |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 250 | unsigned long p1_off = 0, p2_off = 0, p1_step, p2_step; |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 251 | const unsigned char *p1_base, *p2_base; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 252 | struct llist_item *p1_hint = NULL, *p2_hint = NULL; |
Florian Forster | 1d7f171 | 2006-06-18 17:18:09 +0200 | [diff] [blame] | 253 | |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 254 | p1_base = p1->pack->index_data; |
| 255 | p2_base = p2->pack->index_data; |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 256 | p1_base += 256 * 4 + ((p1->pack->index_version < 2) ? 4 : 8); |
| 257 | p2_base += 256 * 4 + ((p2->pack->index_version < 2) ? 4 : 8); |
| 258 | p1_step = (p1->pack->index_version < 2) ? 24 : 20; |
| 259 | p2_step = (p2->pack->index_version < 2) ? 24 : 20; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 260 | |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 261 | while (p1_off < p1->pack->num_objects * p1_step && |
| 262 | p2_off < p2->pack->num_objects * p2_step) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 263 | { |
David Rientjes | a89fccd | 2006-08-17 11:54:57 -0700 | [diff] [blame] | 264 | int cmp = hashcmp(p1_base + p1_off, p2_base + p2_off); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 265 | /* cmp ~ p1 - p2 */ |
| 266 | if (cmp == 0) { |
| 267 | p1_hint = llist_sorted_remove(p1->unique_objects, |
| 268 | p1_base + p1_off, p1_hint); |
| 269 | p2_hint = llist_sorted_remove(p2->unique_objects, |
| 270 | p1_base + p1_off, p2_hint); |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 271 | p1_off += p1_step; |
| 272 | p2_off += p2_step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 273 | continue; |
| 274 | } |
| 275 | if (cmp < 0) { /* p1 has the object, p2 doesn't */ |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 276 | p1_off += p1_step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 277 | } else { /* p2 has the object, p1 doesn't */ |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 278 | p2_off += p2_step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 279 | } |
| 280 | } |
| 281 | } |
| 282 | |
Timo Hirvonen | 962554c | 2006-02-26 17:13:46 +0200 | [diff] [blame] | 283 | static void pll_free(struct pll *l) |
Lukas Sandström | 751a71e | 2005-11-17 14:11:56 +0100 | [diff] [blame] | 284 | { |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 285 | struct pll *old; |
| 286 | struct pack_list *opl; |
Lukas Sandström | 751a71e | 2005-11-17 14:11:56 +0100 | [diff] [blame] | 287 | |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 288 | while (l) { |
| 289 | old = l; |
| 290 | while (l->pl) { |
| 291 | opl = l->pl; |
| 292 | l->pl = opl->next; |
| 293 | free(opl); |
Lukas Sandström | 751a71e | 2005-11-17 14:11:56 +0100 | [diff] [blame] | 294 | } |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 295 | l = l->next; |
| 296 | free(old); |
Lukas Sandström | 751a71e | 2005-11-17 14:11:56 +0100 | [diff] [blame] | 297 | } |
Lukas Sandström | 751a71e | 2005-11-17 14:11:56 +0100 | [diff] [blame] | 298 | } |
| 299 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 300 | /* all the permutations have to be free()d at the same time, |
| 301 | * since they refer to each other |
| 302 | */ |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 303 | static struct pll * get_permutations(struct pack_list *list, int n) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 304 | { |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 305 | struct pll *subset, *ret = NULL, *new_pll = NULL, *pll; |
| 306 | |
| 307 | if (list == NULL || pack_list_size(list) < n || n == 0) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 308 | return NULL; |
| 309 | |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 310 | if (n == 1) { |
| 311 | while (list) { |
| 312 | new_pll = xmalloc(sizeof(pll)); |
| 313 | new_pll->pl = NULL; |
| 314 | pack_list_insert(&new_pll->pl, list); |
| 315 | new_pll->next = ret; |
| 316 | ret = new_pll; |
| 317 | list = list->next; |
Lukas Sandström | 751a71e | 2005-11-17 14:11:56 +0100 | [diff] [blame] | 318 | } |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 319 | return ret; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 320 | } |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 321 | |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 322 | while (list->next) { |
| 323 | subset = get_permutations(list->next, n - 1); |
| 324 | while (subset) { |
| 325 | new_pll = xmalloc(sizeof(pll)); |
| 326 | new_pll->pl = subset->pl; |
| 327 | pack_list_insert(&new_pll->pl, list); |
| 328 | new_pll->next = ret; |
| 329 | ret = new_pll; |
| 330 | subset = subset->next; |
| 331 | } |
| 332 | list = list->next; |
| 333 | } |
| 334 | return ret; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 335 | } |
| 336 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 337 | static int is_superset(struct pack_list *pl, struct llist *list) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 338 | { |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 339 | struct llist *diff; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 340 | |
| 341 | diff = llist_copy(list); |
| 342 | |
| 343 | while (pl) { |
Alex Riesen | d1ab157 | 2005-11-22 15:59:22 +0100 | [diff] [blame] | 344 | llist_sorted_difference_inplace(diff, pl->all_objects); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 345 | if (diff->size == 0) { /* we're done */ |
| 346 | llist_free(diff); |
| 347 | return 1; |
| 348 | } |
| 349 | pl = pl->next; |
| 350 | } |
| 351 | llist_free(diff); |
| 352 | return 0; |
| 353 | } |
| 354 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 355 | static size_t sizeof_union(struct packed_git *p1, struct packed_git *p2) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 356 | { |
| 357 | size_t ret = 0; |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 358 | unsigned long p1_off = 0, p2_off = 0, p1_step, p2_step; |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 359 | const unsigned char *p1_base, *p2_base; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 360 | |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 361 | p1_base = p1->index_data; |
| 362 | p2_base = p2->index_data; |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 363 | p1_base += 256 * 4 + ((p1->index_version < 2) ? 4 : 8); |
| 364 | p2_base += 256 * 4 + ((p2->index_version < 2) ? 4 : 8); |
| 365 | p1_step = (p1->index_version < 2) ? 24 : 20; |
| 366 | p2_step = (p2->index_version < 2) ? 24 : 20; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 367 | |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 368 | while (p1_off < p1->num_objects * p1_step && |
| 369 | p2_off < p2->num_objects * p2_step) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 370 | { |
David Rientjes | a89fccd | 2006-08-17 11:54:57 -0700 | [diff] [blame] | 371 | int cmp = hashcmp(p1_base + p1_off, p2_base + p2_off); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 372 | /* cmp ~ p1 - p2 */ |
| 373 | if (cmp == 0) { |
| 374 | ret++; |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 375 | p1_off += p1_step; |
| 376 | p2_off += p2_step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 377 | continue; |
| 378 | } |
| 379 | if (cmp < 0) { /* p1 has the object, p2 doesn't */ |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 380 | p1_off += p1_step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 381 | } else { /* p2 has the object, p1 doesn't */ |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 382 | p2_off += p2_step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 383 | } |
| 384 | } |
| 385 | return ret; |
| 386 | } |
| 387 | |
| 388 | /* another O(n^2) function ... */ |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 389 | static size_t get_pack_redundancy(struct pack_list *pl) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 390 | { |
| 391 | struct pack_list *subset; |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 392 | size_t ret = 0; |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 393 | |
| 394 | if (pl == NULL) |
| 395 | return 0; |
| 396 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 397 | while ((subset = pl->next)) { |
| 398 | while(subset) { |
| 399 | ret += sizeof_union(pl->pack, subset->pack); |
| 400 | subset = subset->next; |
| 401 | } |
| 402 | pl = pl->next; |
| 403 | } |
| 404 | return ret; |
| 405 | } |
| 406 | |
Shawn O. Pearce | c4001d9 | 2007-03-06 20:44:30 -0500 | [diff] [blame] | 407 | static inline off_t pack_set_bytecount(struct pack_list *pl) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 408 | { |
Shawn O. Pearce | c4001d9 | 2007-03-06 20:44:30 -0500 | [diff] [blame] | 409 | off_t ret = 0; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 410 | while (pl) { |
| 411 | ret += pl->pack->pack_size; |
| 412 | ret += pl->pack->index_size; |
| 413 | pl = pl->next; |
| 414 | } |
| 415 | return ret; |
| 416 | } |
| 417 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 418 | static void minimize(struct pack_list **min) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 419 | { |
| 420 | struct pack_list *pl, *unique = NULL, |
| 421 | *non_unique = NULL, *min_perm = NULL; |
| 422 | struct pll *perm, *perm_all, *perm_ok = NULL, *new_perm; |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 423 | struct llist *missing; |
Shawn O. Pearce | c4001d9 | 2007-03-06 20:44:30 -0500 | [diff] [blame] | 424 | off_t min_perm_size = 0, perm_size; |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 425 | int n; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 426 | |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 427 | pl = local_packs; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 428 | while (pl) { |
| 429 | if(pl->unique_objects->size) |
| 430 | pack_list_insert(&unique, pl); |
| 431 | else |
| 432 | pack_list_insert(&non_unique, pl); |
| 433 | pl = pl->next; |
| 434 | } |
| 435 | /* find out which objects are missing from the set of unique packs */ |
| 436 | missing = llist_copy(all_objects); |
| 437 | pl = unique; |
| 438 | while (pl) { |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 439 | llist_sorted_difference_inplace(missing, pl->all_objects); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 440 | pl = pl->next; |
| 441 | } |
| 442 | |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 443 | /* return if there are no objects missing from the unique set */ |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 444 | if (missing->size == 0) { |
| 445 | *min = unique; |
| 446 | return; |
| 447 | } |
| 448 | |
| 449 | /* find the permutations which contain all missing objects */ |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 450 | for (n = 1; n <= pack_list_size(non_unique) && !perm_ok; n++) { |
| 451 | perm_all = perm = get_permutations(non_unique, n); |
| 452 | while (perm) { |
| 453 | if (is_superset(perm->pl, missing)) { |
| 454 | new_perm = xmalloc(sizeof(struct pll)); |
| 455 | memcpy(new_perm, perm, sizeof(struct pll)); |
| 456 | new_perm->next = perm_ok; |
| 457 | perm_ok = new_perm; |
| 458 | } |
| 459 | perm = perm->next; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 460 | } |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 461 | if (perm_ok) |
| 462 | break; |
| 463 | pll_free(perm_all); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 464 | } |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 465 | if (perm_ok == NULL) |
| 466 | die("Internal error: No complete sets found!\n"); |
| 467 | |
| 468 | /* find the permutation with the smallest size */ |
| 469 | perm = perm_ok; |
| 470 | while (perm) { |
| 471 | perm_size = pack_set_bytecount(perm->pl); |
Shawn O. Pearce | c4001d9 | 2007-03-06 20:44:30 -0500 | [diff] [blame] | 472 | if (!min_perm_size || min_perm_size > perm_size) { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 473 | min_perm_size = perm_size; |
| 474 | min_perm = perm->pl; |
| 475 | } |
| 476 | perm = perm->next; |
| 477 | } |
| 478 | *min = min_perm; |
| 479 | /* add the unique packs to the list */ |
| 480 | pl = unique; |
| 481 | while(pl) { |
| 482 | pack_list_insert(min, pl); |
| 483 | pl = pl->next; |
| 484 | } |
| 485 | } |
| 486 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 487 | static void load_all_objects(void) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 488 | { |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 489 | struct pack_list *pl = local_packs; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 490 | struct llist_item *hint, *l; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 491 | |
| 492 | llist_init(&all_objects); |
| 493 | |
| 494 | while (pl) { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 495 | hint = NULL; |
| 496 | l = pl->all_objects->front; |
| 497 | while (l) { |
| 498 | hint = llist_insert_sorted_unique(all_objects, |
| 499 | l->sha1, hint); |
| 500 | l = l->next; |
| 501 | } |
| 502 | pl = pl->next; |
| 503 | } |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 504 | /* remove objects present in remote packs */ |
| 505 | pl = altodb_packs; |
| 506 | while (pl) { |
| 507 | llist_sorted_difference_inplace(all_objects, pl->all_objects); |
| 508 | pl = pl->next; |
| 509 | } |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 510 | } |
| 511 | |
| 512 | /* this scales like O(n^2) */ |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 513 | static void cmp_local_packs(void) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 514 | { |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 515 | struct pack_list *subset, *pl = local_packs; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 516 | |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 517 | while ((subset = pl)) { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 518 | while((subset = subset->next)) |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 519 | cmp_two_packs(pl, subset); |
| 520 | pl = pl->next; |
| 521 | } |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 522 | } |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 523 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 524 | static void scan_alt_odb_packs(void) |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 525 | { |
| 526 | struct pack_list *local, *alt; |
| 527 | |
| 528 | alt = altodb_packs; |
| 529 | while (alt) { |
| 530 | local = local_packs; |
| 531 | while (local) { |
| 532 | llist_sorted_difference_inplace(local->unique_objects, |
| 533 | alt->all_objects); |
| 534 | local = local->next; |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 535 | } |
Lukas Sandström | 6d016c9 | 2005-12-20 21:05:54 +0100 | [diff] [blame] | 536 | llist_sorted_difference_inplace(all_objects, alt->all_objects); |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 537 | alt = alt->next; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 538 | } |
| 539 | } |
| 540 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 541 | static struct pack_list * add_pack(struct packed_git *p) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 542 | { |
| 543 | struct pack_list l; |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 544 | unsigned long off = 0, step; |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 545 | const unsigned char *base; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 546 | |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 547 | if (!p->pack_local && !(alt_odb || verbose)) |
| 548 | return NULL; |
| 549 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 550 | l.pack = p; |
| 551 | llist_init(&l.all_objects); |
| 552 | |
Shawn O. Pearce | eaa8677 | 2007-05-30 02:12:28 -0400 | [diff] [blame] | 553 | if (open_pack_index(p)) |
Shawn O. Pearce | d079837 | 2007-05-26 01:24:19 -0400 | [diff] [blame] | 554 | return NULL; |
| 555 | |
Nicolas Pitre | 4287307 | 2007-03-16 16:42:50 -0400 | [diff] [blame] | 556 | base = p->index_data; |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 557 | base += 256 * 4 + ((p->index_version < 2) ? 4 : 8); |
| 558 | step = (p->index_version < 2) ? 24 : 20; |
| 559 | while (off < p->num_objects * step) { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 560 | llist_insert_back(l.all_objects, base + off); |
Nicolas Pitre | 8c681e0 | 2007-04-09 01:06:37 -0400 | [diff] [blame] | 561 | off += step; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 562 | } |
| 563 | /* this list will be pruned in cmp_two_packs later */ |
| 564 | l.unique_objects = llist_copy(l.all_objects); |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 565 | if (p->pack_local) |
| 566 | return pack_list_insert(&local_packs, &l); |
| 567 | else |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 568 | return pack_list_insert(&altodb_packs, &l); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 569 | } |
| 570 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 571 | static struct pack_list * add_pack_file(char *filename) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 572 | { |
| 573 | struct packed_git *p = packed_git; |
| 574 | |
| 575 | if (strlen(filename) < 40) |
| 576 | die("Bad pack filename: %s\n", filename); |
| 577 | |
| 578 | while (p) { |
| 579 | if (strstr(p->pack_name, filename)) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 580 | return add_pack(p); |
| 581 | p = p->next; |
| 582 | } |
| 583 | die("Filename %s not found in packed_git\n", filename); |
| 584 | } |
| 585 | |
Timo Hirvonen | bd22c90 | 2005-11-21 02:52:52 +0200 | [diff] [blame] | 586 | static void load_all(void) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 587 | { |
| 588 | struct packed_git *p = packed_git; |
| 589 | |
| 590 | while (p) { |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 591 | add_pack(p); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 592 | p = p->next; |
| 593 | } |
| 594 | } |
| 595 | |
| 596 | int main(int argc, char **argv) |
| 597 | { |
| 598 | int i; |
| 599 | struct pack_list *min, *red, *pl; |
Lukas Sandström | bb931cf | 2005-11-18 23:17:50 +0100 | [diff] [blame] | 600 | struct llist *ignore; |
Junio C Hamano | b99a394 | 2005-11-23 16:08:36 -0800 | [diff] [blame] | 601 | unsigned char *sha1; |
| 602 | char buf[42]; /* 40 byte sha1 + \n + \0 */ |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 603 | |
Junio C Hamano | 53228a5 | 2005-11-26 00:50:02 -0800 | [diff] [blame] | 604 | setup_git_directory(); |
| 605 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 606 | for (i = 1; i < argc; i++) { |
| 607 | const char *arg = argv[i]; |
Lukas_Sandström | 9bc0f32 | 2005-11-10 00:16:13 +0100 | [diff] [blame] | 608 | if(!strcmp(arg, "--")) { |
| 609 | i++; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 610 | break; |
Lukas_Sandström | 9bc0f32 | 2005-11-10 00:16:13 +0100 | [diff] [blame] | 611 | } |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 612 | if(!strcmp(arg, "--all")) { |
| 613 | load_all_packs = 1; |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 614 | continue; |
| 615 | } |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 616 | if(!strcmp(arg, "--verbose")) { |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 617 | verbose = 1; |
| 618 | continue; |
| 619 | } |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 620 | if(!strcmp(arg, "--alt-odb")) { |
| 621 | alt_odb = 1; |
| 622 | continue; |
| 623 | } |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 624 | if(*arg == '-') |
Lukas_Sandström | 9bc0f32 | 2005-11-10 00:16:13 +0100 | [diff] [blame] | 625 | usage(pack_redundant_usage); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 626 | else |
| 627 | break; |
| 628 | } |
| 629 | |
| 630 | prepare_packed_git(); |
| 631 | |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 632 | if (load_all_packs) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 633 | load_all(); |
| 634 | else |
| 635 | while (*(argv + i) != NULL) |
| 636 | add_pack_file(*(argv + i++)); |
| 637 | |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 638 | if (local_packs == NULL) |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 639 | die("Zero packs found!\n"); |
| 640 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 641 | load_all_objects(); |
| 642 | |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 643 | cmp_local_packs(); |
| 644 | if (alt_odb) |
| 645 | scan_alt_odb_packs(); |
| 646 | |
Lukas Sandström | bb931cf | 2005-11-18 23:17:50 +0100 | [diff] [blame] | 647 | /* ignore objects given on stdin */ |
| 648 | llist_init(&ignore); |
| 649 | if (!isatty(0)) { |
| 650 | while (fgets(buf, sizeof(buf), stdin)) { |
| 651 | sha1 = xmalloc(20); |
| 652 | if (get_sha1_hex(buf, sha1)) |
| 653 | die("Bad sha1 on stdin: %s", buf); |
| 654 | llist_insert_sorted_unique(ignore, sha1, NULL); |
| 655 | } |
| 656 | } |
| 657 | llist_sorted_difference_inplace(all_objects, ignore); |
| 658 | pl = local_packs; |
| 659 | while (pl) { |
| 660 | llist_sorted_difference_inplace(pl->unique_objects, ignore); |
| 661 | pl = pl->next; |
| 662 | } |
| 663 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 664 | minimize(&min); |
Lukas Sandström | 06a45c8 | 2005-11-18 23:00:55 +0100 | [diff] [blame] | 665 | |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 666 | if (verbose) { |
Kai Ruemmler | abacbe4 | 2005-11-12 17:33:24 +0100 | [diff] [blame] | 667 | fprintf(stderr, "There are %lu packs available in alt-odbs.\n", |
| 668 | (unsigned long)pack_list_size(altodb_packs)); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 669 | fprintf(stderr, "The smallest (bytewise) set of packs is:\n"); |
| 670 | pl = min; |
| 671 | while (pl) { |
| 672 | fprintf(stderr, "\t%s\n", pl->pack->pack_name); |
| 673 | pl = pl->next; |
| 674 | } |
Kai Ruemmler | abacbe4 | 2005-11-12 17:33:24 +0100 | [diff] [blame] | 675 | fprintf(stderr, "containing %lu duplicate objects " |
| 676 | "with a total size of %lukb.\n", |
| 677 | (unsigned long)get_pack_redundancy(min), |
| 678 | (unsigned long)pack_set_bytecount(min)/1024); |
| 679 | fprintf(stderr, "A total of %lu unique objects were considered.\n", |
| 680 | (unsigned long)all_objects->size); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 681 | fprintf(stderr, "Redundant packs (with indexes):\n"); |
| 682 | } |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 683 | pl = red = pack_list_difference(local_packs, min); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 684 | while (pl) { |
| 685 | printf("%s\n%s\n", |
Lukas_Sandström | 1c3039e | 2005-11-11 01:25:04 +0100 | [diff] [blame] | 686 | sha1_pack_index_name(pl->pack->sha1), |
| 687 | pl->pack->pack_name); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 688 | pl = pl->next; |
| 689 | } |
Lukas Sandström | bb931cf | 2005-11-18 23:17:50 +0100 | [diff] [blame] | 690 | if (verbose) |
Junio C Hamano | b99a394 | 2005-11-23 16:08:36 -0800 | [diff] [blame] | 691 | fprintf(stderr, "%luMB of redundant packs in total.\n", |
| 692 | (unsigned long)pack_set_bytecount(red)/(1024*1024)); |
Lukas_Sandström | c283ab2 | 2005-11-09 02:22:40 +0100 | [diff] [blame] | 693 | |
| 694 | return 0; |
| 695 | } |