@@ -55,16 +55,15 @@ static inline struct llist_item *llist_item_get(void)
5555 } else {
5656 int i = 1 ;
5757 new = xmalloc (sizeof (struct llist_item ) * BLKSIZE );
58- for (; i < BLKSIZE ; i ++ ) {
58+ for (; i < BLKSIZE ; i ++ )
5959 llist_item_put (& new [i ]);
60- }
6160 }
6261 return new ;
6362}
6463
6564static void llist_free (struct llist * list )
6665{
67- while ((list -> back = list -> front )) {
66+ while ((list -> back = list -> front )) {
6867 list -> front = list -> front -> next ;
6968 llist_item_put (list -> back );
7069 }
@@ -146,7 +145,7 @@ static inline struct llist_item *llist_insert_sorted_unique(struct llist *list,
146145 if (cmp > 0 ) { /* we insert before this entry */
147146 return llist_insert (list , prev , sha1 );
148147 }
149- if (!cmp ) { /* already exists */
148+ if (!cmp ) { /* already exists */
150149 return l ;
151150 }
152151 prev = l ;
@@ -168,7 +167,7 @@ static inline struct llist_item * llist_sorted_remove(struct llist *list, const
168167 int cmp = hashcmp (l -> sha1 , sha1 );
169168 if (cmp > 0 ) /* not in list, since sorted */
170169 return prev ;
171- if (!cmp ) { /* found */
170+ if (!cmp ) { /* found */
172171 if (prev == NULL ) {
173172 if (hint != NULL && hint != list -> front ) {
174173 /* we don't know the previous element */
@@ -218,7 +217,7 @@ static inline struct pack_list * pack_list_insert(struct pack_list **pl,
218217static inline size_t pack_list_size (struct pack_list * pl )
219218{
220219 size_t ret = 0 ;
221- while (pl ) {
220+ while (pl ) {
222221 ret ++ ;
223222 pl = pl -> next ;
224223 }
@@ -396,7 +395,7 @@ static size_t get_pack_redundancy(struct pack_list *pl)
396395 return 0 ;
397396
398397 while ((subset = pl -> next )) {
399- while (subset ) {
398+ while (subset ) {
400399 ret += sizeof_union (pl -> pack , subset -> pack );
401400 subset = subset -> next ;
402401 }
@@ -427,7 +426,7 @@ static void minimize(struct pack_list **min)
427426
428427 pl = local_packs ;
429428 while (pl ) {
430- if (pl -> unique_objects -> size )
429+ if (pl -> unique_objects -> size )
431430 pack_list_insert (& unique , pl );
432431 else
433432 pack_list_insert (& non_unique , pl );
@@ -479,7 +478,7 @@ static void minimize(struct pack_list **min)
479478 * min = min_perm ;
480479 /* add the unique packs to the list */
481480 pl = unique ;
482- while (pl ) {
481+ while (pl ) {
483482 pack_list_insert (min , pl );
484483 pl = pl -> next ;
485484 }
@@ -516,7 +515,7 @@ static void cmp_local_packs(void)
516515 struct pack_list * subset , * pl = local_packs ;
517516
518517 while ((subset = pl )) {
519- while ((subset = subset -> next ))
518+ while ((subset = subset -> next ))
520519 cmp_two_packs (pl , subset );
521520 pl = pl -> next ;
522521 }
@@ -608,23 +607,23 @@ int main(int argc, char **argv)
608607
609608 for (i = 1 ; i < argc ; i ++ ) {
610609 const char * arg = argv [i ];
611- if (!strcmp (arg , "--" )) {
610+ if (!strcmp (arg , "--" )) {
612611 i ++ ;
613612 break ;
614613 }
615- if (!strcmp (arg , "--all" )) {
614+ if (!strcmp (arg , "--all" )) {
616615 load_all_packs = 1 ;
617616 continue ;
618617 }
619- if (!strcmp (arg , "--verbose" )) {
618+ if (!strcmp (arg , "--verbose" )) {
620619 verbose = 1 ;
621620 continue ;
622621 }
623- if (!strcmp (arg , "--alt-odb" )) {
622+ if (!strcmp (arg , "--alt-odb" )) {
624623 alt_odb = 1 ;
625624 continue ;
626625 }
627- if (* arg == '-' )
626+ if (* arg == '-' )
628627 usage (pack_redundant_usage );
629628 else
630629 break ;
0 commit comments