X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Funistr%2Fu8-chr.c;h=435d1be612d90a9f21ef8fa5b8540d497c6e5e96;hb=3213c107e7632d3b7e462c06acaefde7d50e5067;hp=2c4d7687b26c0aa957d6f8e8606bbdd7108bec5f;hpb=ac5cf7982cea8a4bb17680b6b9925f301cfa4220;p=gnulib.git

diff --git a/lib/unistr/u8-chr.c b/lib/unistr/u8-chr.c
index 2c4d7687b..435d1be61 100644
--- a/lib/unistr/u8-chr.c
+++ b/lib/unistr/u8-chr.c
@@ -1,5 +1,6 @@
 /* Search character in piece of UTF-8 string.
-   Copyright (C) 1999, 2002, 2006-2007 Free Software Foundation, Inc.
+   Copyright (C) 1999, 2002, 2006-2007, 2009-2010 Free Software Foundation,
+   Inc.
    Written by Bruno Haible <bruno@clisp.org>, 2002.
 
    This program is free software: you can redistribute it and/or modify it
@@ -30,58 +31,58 @@ u8_chr (const uint8_t *s, size_t n, ucs4_t uc)
       uint8_t c0 = uc;
 
       for (; n > 0; s++, n--)
-	{
-	  if (*s == c0)
-	    return (uint8_t *) s;
-	}
+        {
+          if (*s == c0)
+            return (uint8_t *) s;
+        }
     }
   else
     switch (u8_uctomb_aux (c, uc, 6))
       {
       case 2:
-	if (n > 1)
-	  {
-	    uint8_t c0 = c[0];
-	    uint8_t c1 = c[1];
+        if (n > 1)
+          {
+            uint8_t c0 = c[0];
+            uint8_t c1 = c[1];
 
-	    for (n--; n > 0; s++, n--)
-	      {
-		if (*s == c0 && s[1] == c1)
-		  return (uint8_t *) s;
-	      }
-	  }
-	break;
+            for (n--; n > 0; s++, n--)
+              {
+                if (*s == c0 && s[1] == c1)
+                  return (uint8_t *) s;
+              }
+          }
+        break;
 
       case 3:
-	if (n > 2)
-	  {
-	    uint8_t c0 = c[0];
-	    uint8_t c1 = c[1];
-	    uint8_t c2 = c[2];
+        if (n > 2)
+          {
+            uint8_t c0 = c[0];
+            uint8_t c1 = c[1];
+            uint8_t c2 = c[2];
 
-	    for (n -= 2; n > 0; s++, n--)
-	      {
-		if (*s == c0 && s[1] == c1 && s[2] == c2)
-		  return (uint8_t *) s;
-	      }
-	  }
-	break;
+            for (n -= 2; n > 0; s++, n--)
+              {
+                if (*s == c0 && s[1] == c1 && s[2] == c2)
+                  return (uint8_t *) s;
+              }
+          }
+        break;
 
       case 4:
-	if (n > 3)
-	  {
-	    uint8_t c0 = c[0];
-	    uint8_t c1 = c[1];
-	    uint8_t c2 = c[2];
-	    uint8_t c3 = c[3];
+        if (n > 3)
+          {
+            uint8_t c0 = c[0];
+            uint8_t c1 = c[1];
+            uint8_t c2 = c[2];
+            uint8_t c3 = c[3];
 
-	    for (n -= 3; n > 0; s++, n--)
-	      {
-		if (*s == c0 && s[1] == c1 && s[2] == c2 && s[3] == c3)
-		  return (uint8_t *) s;
-	      }
-	  }
-	break;
+            for (n -= 3; n > 0; s++, n--)
+              {
+                if (*s == c0 && s[1] == c1 && s[2] == c2 && s[3] == c3)
+                  return (uint8_t *) s;
+              }
+          }
+        break;
       }
   return NULL;
 }