[fusl] Remove some more tabs

fusl/src/crypt/crypt_blowfish.c

 /* Modified by Rich Felker in for inclusion in musl libc, based on
  * Solar Designer's second size-optimized version sent to the musl
  * mailing list. */
 
 /*
  * The crypt_blowfish homepage is:
  *
- *      http://www.openwall.com/crypt/
+ *      http://www.openwall.com/crypt/
  *
  * This code comes from John the Ripper password cracker, with reentrant
  * and crypt(3) interfaces added, but optimizations specific to password
  * cracking removed.
  *
  * Written by Solar Designer <solar at openwall.com> in 1998-2012.
  * No copyright is claimed, and the software is hereby placed in the public
  * domain.  In case this attempt to disclaim copyright and place the software
  * in the public domain is deemed null and void, then the software is
  * Copyright (c) 1998-2012 Solar Designer and it is hereby released to the
@@ skipping 14 matching lines @@
  *
  * This implementation is mostly compatible with OpenBSD's bcrypt.c (prefix
  * "$2a$") by Niels Provos <provos at citi.umich.edu>, and uses some of his
  * ideas.  The password hashing algorithm was designed by David Mazieres
  * <dm at lcs.mit.edu>.  For more information on the level of compatibility,
  * please refer to the comments in BF_set_key() below and to the included
  * crypt(3) man page.
  *
  * There's a paper on the algorithm that explains its design decisions:
  *
- *      http://www.usenix.org/events/usenix99/provos.html
+ *      http://www.usenix.org/events/usenix99/provos.html
  *
  * Some of the tricks in BF_ROUND might be inspired by Eric Young's
  * Blowfish library (I can't be sure if I would think of something if I
  * hadn't seen his code).
  */
 
 #include <string.h>
 #include <stdint.h>
 
 typedef uint32_t BF_word;
@@ skipping 309 matching lines @@
 static BF_word BF_encrypt(BF_ctx* ctx,
                           BF_word L,
                           BF_word R,
                           BF_word* start,
                           BF_word* end) {
   BF_word tmp1, tmp2, tmp3, tmp4;
   BF_word* ptr = start;
 
   do {
     L ^= ctx->s.P[0];
-#if 0
-                BF_ROUND(L, R, 0);
-                BF_ROUND(R, L, 1);
-                BF_ROUND(L, R, 2);
-                BF_ROUND(R, L, 3);
-                BF_ROUND(L, R, 4);
-                BF_ROUND(R, L, 5);
-                BF_ROUND(L, R, 6);
-                BF_ROUND(R, L, 7);
-                BF_ROUND(L, R, 8);
-                BF_ROUND(R, L, 9);
-                BF_ROUND(L, R, 10);
-                BF_ROUND(R, L, 11);
-                BF_ROUND(L, R, 12);
-                BF_ROUND(R, L, 13);
-                BF_ROUND(L, R, 14);
-                BF_ROUND(R, L, 15);
-#else
     for (int i = 0; i < 16; i += 2) {
       BF_ROUND(L, R, i);
       BF_ROUND(R, L, i + 1);
     }
-#endif
     tmp4 = R;
     R = L;
     L = tmp4 ^ ctx->s.P[BF_N + 1];
     *ptr++ = L;
     *ptr++ = R;
   } while (ptr < end);
 
   return L;
 }
 
@@ skipping 290 matching lines @@
     ai[0] ^= 0x10000;         /* undo the safety (for comparison) */
     ok = ok && ai[0] == 0xdb9c59bc && ye[17] == 0x33343500 &&
          !memcmp(ae, ye, sizeof(ae)) && !memcmp(ai, yi, sizeof(ai));
   }
 
   if (ok && retval)
     return retval;
 
   return "*";
 }