Lines Matching refs:t

97 #define GF_T(_p)               ((_p)->t)
389 const int t = GF_T(bch); in compute_syndromes() local
397 memset(syn, 0, 2*t*sizeof(*syn)); in compute_syndromes()
405 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
413 for (j = 0; j < t; j++) in compute_syndromes()
425 const unsigned int t = GF_T(bch); in compute_error_locator_polynomial() local
433 memset(pelp, 0, GF_POLY_SZ(2*t)); in compute_error_locator_polynomial()
434 memset(elp, 0, GF_POLY_SZ(2*t)); in compute_error_locator_polynomial()
442 for (i = 0; (i < t) && (elp->deg <= t); i++) { in compute_error_locator_polynomial()
464 if (i < t-1) { in compute_error_locator_polynomial()
471 return (elp->deg > t) ? -1 : (int)elp->deg; in compute_error_locator_polynomial()
560 unsigned int mask = 0xff, t, rows[16] = {0,}; in find_affine4_roots() local
580 t = ((rows[k] >> j)^rows[k+j]) & mask; in find_affine4_roots()
581 rows[k] ^= (t << j); in find_affine4_roots()
582 rows[k+j] ^= t; in find_affine4_roots()
1212 const unsigned int t = GF_T(bch); in compute_generator_polynomial() local
1218 g = bch_alloc(GF_POLY_SZ(m*t), &err); in compute_generator_polynomial()
1220 genpoly = bch_alloc(DIV_ROUND_UP(m*t+1, 32)*sizeof(*genpoly), &err); in compute_generator_polynomial()
1230 for (i = 0; i < t; i++) { in compute_generator_polynomial()
1294 struct bch_control *init_bch(int m, int t, unsigned int prim_poly) in init_bch() argument
1311 if ((m != (CONFIG_BCH_CONST_M)) || (t != (CONFIG_BCH_CONST_T))) { in init_bch()
1327 if ((t < 1) || (m*t >= ((1 << m)-1))) in init_bch()
1340 bch->t = t; in init_bch()
1342 words = DIV_ROUND_UP(m*t, 32); in init_bch()
1343 bch->ecc_bytes = DIV_ROUND_UP(m*t, 8); in init_bch()
1350 bch->syn = bch_alloc(2*t*sizeof(*bch->syn), &err); in init_bch()
1351 bch->cache = bch_alloc(2*t*sizeof(*bch->cache), &err); in init_bch()
1352 bch->elp = bch_alloc((t+1)*sizeof(struct gf_poly_deg1), &err); in init_bch()
1355 bch->poly_2t[i] = bch_alloc(GF_POLY_SZ(2*t), &err); in init_bch()