[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: tabs
From: |
Bruno Haible |
Subject: |
Re: tabs |
Date: |
Wed, 28 Jul 2010 10:11:07 +0200 |
User-agent: |
KMail/1.9.9 |
Pádraig Brady wrote:
> BTW you introduced 9 tabs which you may want to remove.
I'm re-untabifying some source files which accidentally got infected by
tabs recently:
2010-07-28 Bruno Haible <address@hidden>
Use spaces for indentation, not tabs.
* lib/**/*.[hcy] except lib/reg*.[hc]: Untabify.
--- lib/exclude.c.orig Wed Jul 28 10:04:56 2010
+++ lib/exclude.c Wed Jul 28 09:58:54 2010
@@ -142,14 +142,14 @@
do
{
if (inset)
- {
- if (*q == ']')
- inset = 0;
- }
+ {
+ if (*q == ']')
+ inset = 0;
+ }
else if (*q == '[')
- inset = 1;
+ inset = 1;
else if (*q == '\\')
- q++;
+ q++;
}
while ((*str++ = *q++));
}
@@ -501,7 +501,7 @@
str = xstrdup (pattern);
if (options & EXCLUDE_WILDCARDS)
- unescape_pattern (str);
+ unescape_pattern (str);
p = hash_insert (seg->v.table, str);
if (p != str)
free (str);
--- lib/pthread.in.h.orig Wed Jul 28 10:04:56 2010
+++ lib/pthread.in.h Wed Jul 28 09:57:40 2010
@@ -100,7 +100,7 @@
static inline int
pthread_cond_init (pthread_cond_t *restrict cond,
- pthread_condattr_t const *restrict attr)
+ pthread_condattr_t const *restrict attr)
{
/* COND is never seriously used. */
return 0;
@@ -115,7 +115,7 @@
static inline int
pthread_cond_wait (pthread_cond_t *restrict cond,
- pthread_mutex_t *restrict mutex)
+ pthread_mutex_t *restrict mutex)
{
/* Properly-written applications never come here. */
abort ();
@@ -155,7 +155,7 @@
static inline int
pthread_mutex_init (pthread_mutex_t *restrict mutex,
- pthread_mutexattr_t const *restrict attr)
+ pthread_mutexattr_t const *restrict attr)
{
/* MUTEX is never seriously used. */
return 0;
--- lib/pwrite.c.orig Wed Jul 28 10:04:56 2010
+++ lib/pwrite.c Wed Jul 28 09:59:50 2010
@@ -55,7 +55,7 @@
if (__libc_lseek (fd, old_offset, SEEK_SET) == (off_t) -1)
{
if (result == -1)
- __set_errno (save_errno);
+ __set_errno (save_errno);
return -1;
}
__set_errno (save_errno);
--- lib/sys_time.in.h.orig Wed Jul 28 10:04:56 2010
+++ lib/sys_time.in.h Wed Jul 28 09:55:06 2010
@@ -88,7 +88,7 @@
# undef gettimeofday
# if HAVE_RAW_DECL_GETTIMEOFDAY
_GL_WARN_ON_USE (gettimeofday, "gettimeofday is unportable - "
- "use gnulib module gettimeofday for portability");
+ "use gnulib module gettimeofday for portability");
# endif
# endif
--- lib/unistr/u8-chr.c.orig Wed Jul 28 10:04:56 2010
+++ lib/unistr/u8-chr.c Wed Jul 28 09:54:44 2010
@@ -95,9 +95,9 @@
uint8_t c1 = c[1];
uint8_t c2 = c[2];
const uint8_t *end = s + n - 2;
- size_t skip;
+ size_t skip;
- if (c2 == c1)
+ if (c2 == c1)
skip = 1;
else
skip = 3;
@@ -134,7 +134,7 @@
const uint8_t *end = s + n - 3;
size_t skip;
- if (c3 == c2)
+ if (c3 == c2)
skip = 1;
else if (c3 == c1)
skip = 2;
--- lib/unistr/u8-strchr.c.orig Wed Jul 28 10:04:56 2010
+++ lib/unistr/u8-strchr.c Wed Jul 28 09:54:14 2010
@@ -35,12 +35,12 @@
if (false)
{
/* Unoptimized code. */
- for (;;)
+ for (;;)
{
uint8_t s0 = *s;
if (s0 == c0)
- return (uint8_t *) s;
- s++;
+ return (uint8_t *) s;
+ s++;
if (s0 == 0)
break;
}
@@ -56,9 +56,9 @@
else
/* Loops equivalent to strstr, optimized for a specific length (2, 3, 4)
of the needle. We use an algorithm similar to Boyer-Moore which
- is documented in lib/unistr/u8-chr.c. There is additional
- complication because we need to check after every byte for
- a NUL byte, but the idea is the same. */
+ is documented in lib/unistr/u8-chr.c. There is additional
+ complication because we need to check after every byte for
+ a NUL byte, but the idea is the same. */
switch (u8_uctomb_aux (c, uc, 6))
{
case 2:
- Re: guarantees of u8_mbtouc/u8_strmbtouc, (continued)
- Message not available
- Re: [PATCH v2 0/5] Speed up uNN_chr and uNN_strchr with Boyer-Moore algorithm, Paolo Bonzini, 2010/07/29
- Re: speed up u8_strstr, Bruno Haible, 2010/07/31
- Re: speed up u8_strstr, Bruno Haible, 2010/07/31
- Re: [PATCH v2 0/5] Speed up uNN_chr and uNN_strchr with Boyer-Moore algorithm, Bruno Haible, 2010/07/28
- Re: [PATCH v2 0/5] Speed up uNN_chr and uNN_strchr with Boyer-Moore algorithm, Paolo Bonzini, 2010/07/28
- Re: [PATCH v2 0/5] Speed up uNN_chr and uNN_strchr with Boyer-Moore algorithm, Bruno Haible, 2010/07/31
- Re: [PATCH v2 0/5] Speed up uNN_chr and uNN_strchr with Boyer-Moore algorithm, Paolo Bonzini, 2010/07/31
Re: [PATCH v2 0/5] Speed up uNN_chr and uNN_strchr with Boyer-Moore algorithm, Pádraig Brady, 2010/07/23
- Re: tabs,
Bruno Haible <=