From 16df176fa4667d17146479219ba8816d89d1d78b Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sun, 30 Apr 2006 00:16:00 +0200 Subject: [PATCH] Removed trailing whitespaces. Please fix your editors not to generate such things, especially when auto-indenting. --- build/git/hooks/update | 2 +- charset/mp-charconv.c | 6 +++--- charset/mp-charconv.h | 4 ++-- charset/stk-charconv.c | 2 +- charset/stk-charconv.h | 4 ++-- lib/asort-test.c | 2 +- lib/base64.c | 2 +- lib/hashfunc.c | 2 +- lib/hashtable.h | 2 +- lib/kmp-search.h | 10 +++++----- lib/kmp.h | 18 +++++++++--------- lib/lists.h | 2 +- lib/lizard.c | 4 ++-- lib/md5.c | 2 +- lib/perl/Ulimit/Ulimit.pm | 4 ++-- lib/perl/Ulimit/Ulimit.xs | 2 +- lib/redblack.h | 2 +- 17 files changed, 35 insertions(+), 35 deletions(-) diff --git a/build/git/hooks/update b/build/git/hooks/update index 881621f0..aca1a7fe 100755 --- a/build/git/hooks/update +++ b/build/git/hooks/update @@ -50,7 +50,7 @@ else fi done <$t rm $t -fi +fi exec >&2 mutt -x -e 'set charset="utf-8"; set send_charset="us-ascii:iso-8859-2:utf-8"' -s "$subj" "$recipient" <$out diff --git a/charset/mp-charconv.c b/charset/mp-charconv.c index 6615973c..ef0adf95 100644 --- a/charset/mp-charconv.c +++ b/charset/mp-charconv.c @@ -1,5 +1,5 @@ /* - * Sherlock Library -- Character Conversion with Allocation on a Memory Pool + * Sherlock Library -- Character Conversion with Allocation on a Memory Pool * * (c) 2006 Pavel Charvat * @@ -17,12 +17,12 @@ mp_strconv(struct mempool *mp, byte *s, uns in_cs, uns out_cs) { if (in_cs == out_cs) return mp_strdup(mp, s); - + struct conv_context c; char *b[32]; uns bs[32], n = 0, sum = 0; uns l = strlen(s) + 1; - + conv_init(&c); conv_set_charset(&c, in_cs, out_cs); c.source = s; diff --git a/charset/mp-charconv.h b/charset/mp-charconv.h index 0c34c469..f33cd373 100644 --- a/charset/mp-charconv.h +++ b/charset/mp-charconv.h @@ -1,5 +1,5 @@ /* - * Sherlock Library -- Character Conversion with Allocation on a Memory Pool + * Sherlock Library -- Character Conversion with Allocation on a Memory Pool * * (c) 2006 Pavel Charvat * @@ -16,7 +16,7 @@ byte *mp_strconv(struct mempool *mp, byte *s, uns cs_in, uns cs_out); static inline byte * -mp_strconv_to_utf8(struct mempool *mp, byte *s, uns cs_in) +mp_strconv_to_utf8(struct mempool *mp, byte *s, uns cs_in) { return mp_strconv(mp, s, cs_in, CONV_CHARSET_UTF8); } static inline byte * diff --git a/charset/stk-charconv.c b/charset/stk-charconv.c index 7fc2d72c..d5f55fed 100644 --- a/charset/stk-charconv.c +++ b/charset/stk-charconv.c @@ -1,5 +1,5 @@ /* - * Sherlock Library -- Character Conversion with Allocation on the Stack + * Sherlock Library -- Character Conversion with Allocation on the Stack * * (c) 2006 Pavel Charvat * diff --git a/charset/stk-charconv.h b/charset/stk-charconv.h index 01a242cd..3b47940f 100644 --- a/charset/stk-charconv.h +++ b/charset/stk-charconv.h @@ -1,5 +1,5 @@ /* - * Sherlock Library -- Character Conversion with Allocation on the Stack + * Sherlock Library -- Character Conversion with Allocation on the Stack * * (c) 2006 Pavel Charvat * @@ -21,7 +21,7 @@ #define stk_strconv_to_utf8(s, cs_in) stk_strconv(s, cs_in, CONV_CHARSET_UTF8) #define stk_strconv_from_utf8(s, cs_out) stk_strconv(s, CONV_CHARSET_UTF8, cs_out) - + /* Internals */ uns stk_strconv_init(struct conv_context *c, byte *s, uns cs_in, uns cs_out); diff --git a/lib/asort-test.c b/lib/asort-test.c index b84bb53a..acc209fc 100644 --- a/lib/asort-test.c +++ b/lib/asort-test.c @@ -68,7 +68,7 @@ int main(void) check(); generate(); init_timer(); - as_sort(N); + as_sort(N); printf("asort: %d ms\n", get_timer()); check(); return 0; diff --git a/lib/base64.c b/lib/base64.c index 6a06055a..0f1b0144 100644 --- a/lib/base64.c +++ b/lib/base64.c @@ -93,7 +93,7 @@ base64_decode(byte *dest, byte *src, uns len) headache. - Turadg Aleahmad */ - if (ch == ' ') ch = '+'; + if (ch == ' ') ch = '+'; ch = reverse_table[ch]; if (ch == 0xff) continue; diff --git a/lib/hashfunc.c b/lib/hashfunc.c index 10c29abd..f51c84e8 100644 --- a/lib/hashfunc.c +++ b/lib/hashfunc.c @@ -45,7 +45,7 @@ str_len_uns(uns x) uns a, i; byte *bytes; a = ~x & (x - sub) & and; - /* + /* * x_2 = x - 0x01010101; * x_3 = ~x & x_2; * a = x_3 & 0x80808080; diff --git a/lib/hashtable.h b/lib/hashtable.h index 0419a47c..ec581ed7 100644 --- a/lib/hashtable.h +++ b/lib/hashtable.h @@ -611,7 +611,7 @@ do { \ GLUE_(h_px,node) *h_var = &h_buck->n; #define HASH_FOR_ALL(h_px, h_var) HASH_FOR_ALL_DYNAMIC(h_px, &GLUE_(h_px,table), h_var) #define HASH_END_FOR } } while(0) -#define HASH_BREAK +#define HASH_BREAK #define HASH_CONTINUE continue #endif diff --git a/lib/kmp-search.h b/lib/kmp-search.h index 726593f0..188f9790 100644 --- a/lib/kmp-search.h +++ b/lib/kmp-search.h @@ -13,14 +13,14 @@ * Each time you include it with parameters set in the corresponding * preprocessor macros, it generates KMP structures and functions * with the parameters given. See lib/kmp.h before reading this description. - * + * * This file defines: * * struct search structure with both the internal and the user-defined variables * used during the search and accessible from all macros * * void search(kmp,search,src) executes the search; search structure is allocated by the caller (possible input/output) - * + * * void run(kmp,src) the same, but automatically allocates search structre from the stack * * @@ -41,11 +41,11 @@ * * KMPS_INIT(kmp,src,search) statement executed at the beginning of search() * KMPS_EXIT(kmp,src,search) ... at the end - * KMPS_STEP(kmp,src,search) ... after each step (read of next character + current state update) + * KMPS_STEP(kmp,src,search) ... after each step (read of next character + current state update) * of the algorithm, but before KMPS_FOUND[_CHAIN] - * KMPS_FOUND_CHAIN(kmp,src,search) ... for each state representing locally longest match + * KMPS_FOUND_CHAIN(kmp,src,search) ... for each state representing locally longest match * (stored in search->out - NOT necessary search->s!); - * all matches form a NULL-terminated link list (search->out, search->out->next, ...) + * all matches form a NULL-terminated link list (search->out, search->out->next, ...) * in order of decreasing length * KMPS_FOUND(kmp,src,search) ... called for every match (in search->out) * KMPS_WANT_BEST algorithm computes globally longest match, which is available diff --git a/lib/kmp.h b/lib/kmp.h index 86a0f98f..67889a17 100644 --- a/lib/kmp.h +++ b/lib/kmp.h @@ -54,11 +54,11 @@ * we abbreviate this to P(x) below * * KMP_CHAR alphabet type, the default is u16 - * - * KMP_SOURCE user-defined text source; KMP_GET_CHAR must + * + * KMP_SOURCE user-defined text source; KMP_GET_CHAR must * KMP_GET_CHAR(kmp,src,c) return zero at the end or nonzero together with the next character in c otherwise; * if not defined, zero-terminated array of bytes is used as the input - * + * * KMP_VARS user-defined variables in 'struct P(struct)' * -- a structure describing the whole automaton; * these variables are stored in .u substructure to avoid collisions @@ -139,7 +139,7 @@ struct P(state) { struct { # ifdef KMP_STATE_VARS KMP_STATE_VARS -# endif +# endif } u; /* user-defined data*/ }; @@ -213,10 +213,10 @@ static inline void P(hash_init_key) (struct P(hash_table) *t UNUSED, struct P(state) *s, struct P(state) *f, P(char_t) c) { bzero(s, sizeof(*s)); -# ifdef KMP_INIT_STATE +# ifdef KMP_INIT_STATE struct P(struct) *kmp = (struct P(struct) *)t; { KMP_INIT_STATE(kmp, s); } -# endif +# endif s->from = f; s->c = c; s->next = f->back; /* the pointers hold the link-list of sons... changed in build() */ @@ -287,7 +287,7 @@ P(get_char) (struct P(struct) *kmp UNUSED, P(source_t) *src, P(char_t) *c) else if (!Ualpha(cc)) cc = P(control)(); else -# endif +# endif { # ifdef KMP_TOLOWER cc = Utolower(cc); @@ -402,7 +402,7 @@ P(build) (struct P(struct) *kmp) null->back = NULL; # ifdef KMP_BUILD_STATE { KMP_BUILD_STATE(kmp, null); } -# endif +# endif while (read != write) { struct P(state) *s = fifo[read++], *t; @@ -425,7 +425,7 @@ P(build) (struct P(struct) *kmp) } # ifdef KMP_BUILD_STATE { KMP_BUILD_STATE(kmp, s); } -# endif +# endif } } diff --git a/lib/lists.h b/lib/lists.h index 756085f7..39036913 100644 --- a/lib/lists.h +++ b/lib/lists.h @@ -22,7 +22,7 @@ * null head_node.prev tail_node.next * tail tail_node.prev */ - + typedef struct node { struct node *next, *prev; } node; diff --git a/lib/lizard.c b/lib/lizard.c index 10fd5f0c..e5035e05 100644 --- a/lib/lizard.c +++ b/lib/lizard.c @@ -6,7 +6,7 @@ * This software may be freely distributed and used according to the terms * of the GNU Lesser General Public License. * - * The file format is based on LZO1X and + * The file format is based on LZO1X and * the compression method is based on zlib. */ @@ -450,7 +450,7 @@ long. Decode sequences of these types until the EOF or END marker is read. C following characters will be copied from the compressed text to the output. The number CC is always stored in the 2 least significant bits of the second last byte of the sequence. - + If END is read, the algorithm switches to the copy mode. pattern length position diff --git a/lib/md5.c b/lib/md5.c index a0e50ab8..43052b9e 100644 --- a/lib/md5.c +++ b/lib/md5.c @@ -104,7 +104,7 @@ void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len) } /* - * Final wrapup - pad to 64-byte boundary with the bit pattern + * Final wrapup - pad to 64-byte boundary with the bit pattern * 1 0* (64-bit count of bits processed, MSB-first) */ void MD5Final(unsigned char digest[16], struct MD5Context *ctx) diff --git a/lib/perl/Ulimit/Ulimit.pm b/lib/perl/Ulimit/Ulimit.pm index ed66b3f9..a05ea5b5 100644 --- a/lib/perl/Ulimit/Ulimit.pm +++ b/lib/perl/Ulimit/Ulimit.pm @@ -10,7 +10,7 @@ # Interface: # Sherlock::Ulimit::setlimit( $resource, $softlimit, $hardlimit) # Sherlock::Ulimit::getlimit( $resource, $softlimit, $hardlimit) -# +# # setlimit sets limit to values supplied in softlimit and hardlimit # getlimit reads limits into softlimit and hardlimit # $resource constants are defined below @@ -44,7 +44,7 @@ our $AS = 9; # If you do not need this, moving things directly into @EXPORT or @EXPORT_OK # will save memory. our %EXPORT_TAGS = ( 'all' => [ qw( - + ) ] ); our @EXPORT_OK = ( @{ $EXPORT_TAGS{'all'} } ); diff --git a/lib/perl/Ulimit/Ulimit.xs b/lib/perl/Ulimit/Ulimit.xs index 2951ac69..5d6a368d 100644 --- a/lib/perl/Ulimit/Ulimit.xs +++ b/lib/perl/Ulimit/Ulimit.xs @@ -12,7 +12,7 @@ #include -MODULE = Sherlock::Ulimit PACKAGE = Sherlock::Ulimit +MODULE = Sherlock::Ulimit PACKAGE = Sherlock::Ulimit PROTOTYPES: ENABLED diff --git a/lib/redblack.h b/lib/redblack.h index b0254c59..fc7dd736 100644 --- a/lib/redblack.h +++ b/lib/redblack.h @@ -15,7 +15,7 @@ * A red-black tree is a binary search tree, where records are stored * in nodes (may be also leaves). Every node has a colour. The * following restrictions hold: - * + * * - a parent of a red node is black * - every path from the root to a node with less than 2 children * contains the same number of black nodes -- 2.39.2