[fusl] Remove some more tabs

fusl/src/regex/regcomp.c

 /*
   regcomp.c - TRE POSIX compatible regex compilation functions.
 
   Copyright (c) 2001-2009 Ville Laurikari <vl@iki.fi>
   All rights reserved.
 
   Redistribution and use in source and binary forms, with or without
   modification, are permitted provided that the following conditions
   are met:
 
@@ skipping 2294 matching lines @@
         if (p2->position == prev_p2_pos) {
           p2++;
           continue;
         }
         prev_p2_pos = p2->position;
         /* Set `trans' to point to the next unused transition from
            position `p1->position'. */
         trans = transitions + offs[p1->position];
         while (trans->state != NULL) {
 #if 0
-                /* If we find a previous transition from `p1->position' to
-                   `p2->position', it is overwritten.  This can happen only
-                   if there are nested loops in the regexp, like in "((a)*)*".
-                   In POSIX.2 repetition using the outer loop is always
-                   preferred over using the inner loop.  Therefore the
-                   transition for the inner loop is useless and can be thrown
-                   away. */
-                /* XXX - The same position is used for all nodes in a bracket
-                   expression, so this optimization cannot be used (it will
-                   break bracket expressions) unless I figure out a way to
-                   detect it here. */
-                if (trans->state_id == p2->position)
-                  {
-                    break;
-                  }
+          /* If we find a previous transition from `p1->position' to
+             `p2->position', it is overwritten.  This can happen only
+             if there are nested loops in the regexp, like in "((a)*)*".
+             In POSIX.2 repetition using the outer loop is always
+             preferred over using the inner loop.        Therefore the

[viettrungluu, 2016/02/19 17:21:53]

You still have a tab!

[kulakowski, 2016/02/19 18:03:22]

Yeah. I said in the message that I didn't get ones in comments. But I'll get
them now, everywhere but .s files.

+             transition for the inner loop is useless and can be thrown
+             away. */
+          /* XXX - The same position is used for all nodes in a bracket
+             expression, so this optimization cannot be used (it will
+             break bracket expressions) unless I figure out a way to
+             detect it here. */
+          if (trans->state_id == p2->position) {
+            break;
+          }
 #endif
           trans++;
         }
 
         if (trans->state == NULL)
           (trans + 1)->state = NULL;
         /* Use the character ranges, assertions, etc. from `p1' for
            the transition from `p1' to `p2'. */
         trans->code_min = p1->code_min;
         trans->code_max = p1->code_max;
@@ skipping 386 matching lines @@
   }
 
   if (tnfa->tag_directions)
     xfree(tnfa->tag_directions);
   if (tnfa->firstpos_chars)
     xfree(tnfa->firstpos_chars);
   if (tnfa->minimal_tags)
     xfree(tnfa->minimal_tags);
   xfree(tnfa);
 }