mirror of
https://github.com/AsahiLinux/u-boot
synced 2024-12-28 05:53:54 +00:00
83d290c56f
When U-Boot started using SPDX tags we were among the early adopters and there weren't a lot of other examples to borrow from. So we picked the area of the file that usually had a full license text and replaced it with an appropriate SPDX-License-Identifier: entry. Since then, the Linux Kernel has adopted SPDX tags and they place it as the very first line in a file (except where shebangs are used, then it's second line) and with slightly different comment styles than us. In part due to community overlap, in part due to better tag visibility and in part for other minor reasons, switch over to that style. This commit changes all instances where we have a single declared license in the tag as both the before and after are identical in tag contents. There's also a few places where I found we did not have a tag and have introduced one. Signed-off-by: Tom Rini <trini@konsulko.com>
67 lines
2 KiB
C
67 lines
2 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* Generic binary BCH encoding/decoding library
|
|
*
|
|
* Copyright © 2011 Parrot S.A.
|
|
*
|
|
* Author: Ivan Djelic <ivan.djelic@parrot.com>
|
|
*
|
|
* Description:
|
|
*
|
|
* This library provides runtime configurable encoding/decoding of binary
|
|
* Bose-Chaudhuri-Hocquenghem (BCH) codes.
|
|
*/
|
|
#ifndef _BCH_H
|
|
#define _BCH_H
|
|
|
|
#include <linux/types.h>
|
|
|
|
/**
|
|
* struct bch_control - BCH control structure
|
|
* @m: Galois field order
|
|
* @n: maximum codeword size in bits (= 2^m-1)
|
|
* @t: error correction capability in bits
|
|
* @ecc_bits: ecc exact size in bits, i.e. generator polynomial degree (<=m*t)
|
|
* @ecc_bytes: ecc max size (m*t bits) in bytes
|
|
* @a_pow_tab: Galois field GF(2^m) exponentiation lookup table
|
|
* @a_log_tab: Galois field GF(2^m) log lookup table
|
|
* @mod8_tab: remainder generator polynomial lookup tables
|
|
* @ecc_buf: ecc parity words buffer
|
|
* @ecc_buf2: ecc parity words buffer
|
|
* @xi_tab: GF(2^m) base for solving degree 2 polynomial roots
|
|
* @syn: syndrome buffer
|
|
* @cache: log-based polynomial representation buffer
|
|
* @elp: error locator polynomial
|
|
* @poly_2t: temporary polynomials of degree 2t
|
|
*/
|
|
struct bch_control {
|
|
unsigned int m;
|
|
unsigned int n;
|
|
unsigned int t;
|
|
unsigned int ecc_bits;
|
|
unsigned int ecc_bytes;
|
|
/* private: */
|
|
uint16_t *a_pow_tab;
|
|
uint16_t *a_log_tab;
|
|
uint32_t *mod8_tab;
|
|
uint32_t *ecc_buf;
|
|
uint32_t *ecc_buf2;
|
|
unsigned int *xi_tab;
|
|
unsigned int *syn;
|
|
int *cache;
|
|
struct gf_poly *elp;
|
|
struct gf_poly *poly_2t[4];
|
|
};
|
|
|
|
struct bch_control *init_bch(int m, int t, unsigned int prim_poly);
|
|
|
|
void free_bch(struct bch_control *bch);
|
|
|
|
void encode_bch(struct bch_control *bch, const uint8_t *data,
|
|
unsigned int len, uint8_t *ecc);
|
|
|
|
int decode_bch(struct bch_control *bch, const uint8_t *data, unsigned int len,
|
|
const uint8_t *recv_ecc, const uint8_t *calc_ecc,
|
|
const unsigned int *syn, unsigned int *errloc);
|
|
|
|
#endif /* _BCH_H */
|