diff options
author | Thomas Gleixner <tglx@linutronix.de> | 2005-11-07 06:15:37 -0500 |
---|---|---|
committer | Thomas Gleixner <tglx@mtd.linutronix.de> | 2005-11-07 08:25:38 -0500 |
commit | 03ead8427d65f6986a8bf5fd3f29a879348780ad (patch) | |
tree | a70bff642d66eb3dbafd31e017f0f9783ffca6c2 /lib/reed_solomon/encode_rs.c | |
parent | 182ec4eee397543101a6db8906ed88727d3f7e53 (diff) |
[LIB] reed_solomon: Clean up trailing white spaces
Diffstat (limited to 'lib/reed_solomon/encode_rs.c')
-rw-r--r-- | lib/reed_solomon/encode_rs.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/lib/reed_solomon/encode_rs.c b/lib/reed_solomon/encode_rs.c index 237bf65ae886..0b5b1a6728ec 100644 --- a/lib/reed_solomon/encode_rs.c +++ b/lib/reed_solomon/encode_rs.c | |||
@@ -1,19 +1,19 @@ | |||
1 | /* | 1 | /* |
2 | * lib/reed_solomon/encode_rs.c | 2 | * lib/reed_solomon/encode_rs.c |
3 | * | 3 | * |
4 | * Overview: | 4 | * Overview: |
5 | * Generic Reed Solomon encoder / decoder library | 5 | * Generic Reed Solomon encoder / decoder library |
6 | * | 6 | * |
7 | * Copyright 2002, Phil Karn, KA9Q | 7 | * Copyright 2002, Phil Karn, KA9Q |
8 | * May be used under the terms of the GNU General Public License (GPL) | 8 | * May be used under the terms of the GNU General Public License (GPL) |
9 | * | 9 | * |
10 | * Adaption to the kernel by Thomas Gleixner (tglx@linutronix.de) | 10 | * Adaption to the kernel by Thomas Gleixner (tglx@linutronix.de) |
11 | * | 11 | * |
12 | * $Id: encode_rs.c,v 1.4 2004/10/22 15:41:47 gleixner Exp $ | 12 | * $Id: encode_rs.c,v 1.5 2005/11/07 11:14:59 gleixner Exp $ |
13 | * | 13 | * |
14 | */ | 14 | */ |
15 | 15 | ||
16 | /* Generic data width independent code which is included by the | 16 | /* Generic data width independent code which is included by the |
17 | * wrappers. | 17 | * wrappers. |
18 | * int encode_rsX (struct rs_control *rs, uintX_t *data, int len, uintY_t *par) | 18 | * int encode_rsX (struct rs_control *rs, uintX_t *data, int len, uintY_t *par) |
19 | */ | 19 | */ |
@@ -35,16 +35,16 @@ | |||
35 | for (i = 0; i < len; i++) { | 35 | for (i = 0; i < len; i++) { |
36 | fb = index_of[((((uint16_t) data[i])^invmsk) & msk) ^ par[0]]; | 36 | fb = index_of[((((uint16_t) data[i])^invmsk) & msk) ^ par[0]]; |
37 | /* feedback term is non-zero */ | 37 | /* feedback term is non-zero */ |
38 | if (fb != nn) { | 38 | if (fb != nn) { |
39 | for (j = 1; j < nroots; j++) { | 39 | for (j = 1; j < nroots; j++) { |
40 | par[j] ^= alpha_to[rs_modnn(rs, fb + | 40 | par[j] ^= alpha_to[rs_modnn(rs, fb + |
41 | genpoly[nroots - j])]; | 41 | genpoly[nroots - j])]; |
42 | } | 42 | } |
43 | } | 43 | } |
44 | /* Shift */ | 44 | /* Shift */ |
45 | memmove(&par[0], &par[1], sizeof(uint16_t) * (nroots - 1)); | 45 | memmove(&par[0], &par[1], sizeof(uint16_t) * (nroots - 1)); |
46 | if (fb != nn) { | 46 | if (fb != nn) { |
47 | par[nroots - 1] = alpha_to[rs_modnn(rs, | 47 | par[nroots - 1] = alpha_to[rs_modnn(rs, |
48 | fb + genpoly[0])]; | 48 | fb + genpoly[0])]; |
49 | } else { | 49 | } else { |
50 | par[nroots - 1] = 0; | 50 | par[nroots - 1] = 0; |