Home
last modified time | relevance | path

Searched refs:syn (Results 1 – 3 of 3) sorted by relevance

/lib/reed_solomon/
Ddecode_rs.c33 uint16_t *syn = rsc->buffers + RS_DECODE_SYN * (nroots + 1); variable
62 syn[i] = (((uint16_t) data[0]) ^ invmsk) & msk;
66 if (syn[i] == 0) {
67 syn[i] = (((uint16_t) data[j]) ^
70 syn[i] = ((((uint16_t) data[j]) ^
72 alpha_to[rs_modnn(rs, index_of[syn[i]] +
80 if (syn[i] == 0) {
81 syn[i] = ((uint16_t) par[j]) & msk;
83 syn[i] = (((uint16_t) par[j]) & msk) ^
84 alpha_to[rs_modnn(rs, index_of[syn[i]] +
[all …]
Dtest_rslib.c230 int len, uint16_t *syn) in compute_syndrome() argument
242 syn[i] = data[0]; in compute_syndrome()
244 if (syn[i] == 0) { in compute_syndrome()
245 syn[i] = data[j]; in compute_syndrome()
247 syn[i] = data[j] ^ in compute_syndrome()
248 alpha_to[rs_modnn(rs, index_of[syn[i]] in compute_syndrome()
256 syn[i] = rs->index_of[syn[i]]; in compute_syndrome()
/lib/
Dbch.c348 unsigned int *syn) in compute_syndromes() argument
361 memset(syn, 0, 2*t*sizeof(*syn)); in compute_syndromes()
370 syn[j] ^= a_pow(bch, (j+1)*(i+s)); in compute_syndromes()
378 syn[2*j+1] = gf_sqr(bch, syn[j]); in compute_syndromes()
387 const unsigned int *syn) in compute_error_locator_polynomial() argument
391 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial()
429 d = syn[2*i+2]; in compute_error_locator_polynomial()
431 d ^= gf_mul(bch, elp->c[j], syn[2*i+2-j]); in compute_error_locator_polynomial()
928 unsigned int i, j, syn, syn0, count = 0; in chien_search() local
938 for (j = 1, syn = syn0; j <= p->deg; j++) { in chien_search()
[all …]