| /freebsd-14.2/sys/contrib/openzfs/module/zfs/ |
| H A D | vdev_raidz_math_impl.h | 75 coeff[MUL_PQ_X] = gf_div(a, e); in raidz_rec_pq_coeff() 111 coeff[MUL_QR_XQ] = ny; in raidz_rec_qr_coeff() 113 coeff[MUL_QR_YQ] = nx; in raidz_rec_qr_coeff() 146 coeff[MUL_PQR_YU] = nx; in raidz_rec_pqr_coeff() 148 coeff[MUL_PQR_YQ] = yd; in raidz_rec_pqr_coeff() 679 unsigned coeff[MUL_CNT]; in raidz_reconstruct_q_impl() local 773 unsigned coeff[MUL_CNT]; in raidz_reconstruct_r_impl() local 920 unsigned coeff[MUL_CNT]; in raidz_reconstruct_pq_impl() local 1080 unsigned coeff[MUL_CNT]; in raidz_reconstruct_pr_impl() local 1247 unsigned coeff[MUL_CNT]; in raidz_reconstruct_qr_impl() local [all …]
|
| /freebsd-14.2/contrib/arm-optimized-routines/pl/math/tools/ |
| H A D | asinh.sollya | 7 // we use 2^-6 as the lower bound for coeff generation, which yields sufficiently 22 poly = poly + x^i*coeff(p,0); 28 for i from 0 to deg do coeff(poly,i);
|
| H A D | sinpi.sollya | 22 // first coeff is predefine, iteratively find optimal double prec coeffs 26 poly = poly + x^(2*i+1)*coeff(p,0); 33 for i from 0 to deg do coeff(poly,i);
|
| H A D | sincosf.sollya | 21 // first coeff is fixed, iteratively find optimal double prec coeffs 25 poly = poly + x^(2*i)*coeff(p,0); 33 for i from 0 to deg do coeff(poly,i);
|
| H A D | sincos.sollya | 21 // first coeff is fixed, iteratively find optimal double prec coeffs 25 poly = poly + x^(2*i)*coeff(p,0); 33 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_log2f.sollya | 27 // first coeff is fixed, iteratively find optimal double prec coeffs 31 poly = poly + x^i*coeff(p,0); 38 for i from 0 to deg do coeff(poly,i);
|
| H A D | log10f.sollya | 26 // first coeff is fixed, iteratively find optimal double prec coeffs 30 poly = poly + x^i*coeff(p,0); 37 for i from 0 to deg do double(coeff(poly,i));
|
| H A D | v_log10.sollya | 23 // first coeff is fixed, iteratively find optimal double prec coeffs 27 poly = poly + x^i*coeff(p,0); 38 for i from 0 to deg do double(coeff(poly,i));
|
| H A D | log10.sollya | 29 // first coeff is fixed, iteratively find optimal double prec coeffs 33 poly = poly + x^i*coeff(p,0); 41 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_log10f.sollya | 31 // first coeff is fixed, iteratively find optimal double prec coeffs 35 poly = poly + x^i*coeff(p,0); 42 for i from 0 to deg do single(coeff(poly,i));
|
| H A D | exp10.sollya | 34 // first coeff is fixed, iteratively find optimal double prec coeffs 39 poly = poly + x^i*coeff(p,0); 47 for i from 0 to deg do coeff(poly,i);
|
| H A D | asinhf.sollya | 22 poly = poly + x^i*coeff(p,0); 29 for i from 2 to deg do coeff(poly,i);
|
| H A D | log1p.sollya | 22 poly = poly + x^i*coeff(p,0); 28 for i from 2 to deg do coeff(poly,i);
|
| H A D | asinf.sollya | 30 poly = poly + x^i*coeff(p,0); 36 for i from 0 to deg do print(coeff(poly, i));
|
| /freebsd-14.2/contrib/arm-optimized-routines/math/tools/ |
| H A D | cos.sollya | 19 // first coeff is fixed, iteratively find optimal double prec coeffs 23 poly = poly + x^(2*i)*coeff(p,0); 31 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_sin.sollya | 25 // first coeff is fixed, iteratively find optimal double prec coeffs 29 poly = poly + x^(2*i)*coeff(p,0); 36 for i from 0 to deg do coeff(poly,i);
|
| H A D | sin.sollya | 25 // first coeff is fixed, iteratively find optimal double prec coeffs 29 poly = poly + x^(2*i)*coeff(p,0); 37 for i from 0 to deg do coeff(poly,i);
|
| H A D | log.sollya | 24 // first coeff is fixed, iteratively find optimal double prec coeffs 28 poly = poly + x^i*coeff(p,0); 35 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_log.sollya | 23 // first coeff is fixed, iteratively find optimal double prec coeffs 27 poly = poly + x^i*coeff(p,0); 34 for i from 0 to deg do coeff(poly,i);
|
| H A D | log_abs.sollya | 19 // first coeff is fixed, iteratively find optimal double prec coeffs 23 poly = poly + x^i*coeff(p,0); 35 for i from 0 to deg do coeff(poly,i);
|
| H A D | log2_abs.sollya | 23 // first coeff is fixed, iteratively find optimal double prec coeffs 27 poly = poly + x^i*coeff(p,0); 41 for i from 0 to deg do coeff(poly,i);
|
| H A D | log2.sollya | 29 // first coeff is fixed, iteratively find optimal double prec coeffs 33 poly = poly + x^i*coeff(p,0); 42 for i from 0 to deg do coeff(poly,i);
|
| H A D | exp2.sollya | 31 // first coeff is fixed, iteratively find optimal double prec coeffs 36 poly = poly + x^i*coeff(p,0); 48 for i from 0 to deg do coeff(poly,i);
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/hwmon/ |
| H A D | moortec,mr75203.yaml | 103 moortec,ts-coeff-g: 112 moortec,ts-coeff-h: 121 moortec,ts-coeff-cal5: 129 moortec,ts-coeff-j: 161 moortec,ts-coeff-g = <61400>; 162 moortec,ts-coeff-h = <253700>;
|
| /freebsd-14.2/sys/contrib/dev/ath/ath_hal/ar9300/ |
| H A D | ar9300_reset.c | 5933 coeff->iqc_coeff[0]); in ar9300_tx_iq_cal_outlier_detection() 6087 static struct coeff_t coeff; in ar9300_tx_iq_cal_post_proc() local 6097 if (coeff.last_cal == AH_TRUE) { in ar9300_tx_iq_cal_post_proc() 6141 coeff.iqc_coeff[0]); in ar9300_tx_iq_cal_post_proc() 6146 coeff.iqc_coeff[0]); in ar9300_tx_iq_cal_post_proc() 6204 coeff.phs_coeff[ch_idx][im][iqcal_idx-1] = coeff.iqc_coeff[0] & 0x7f; in ar9300_tx_iq_cal_post_proc() 6205 coeff.mag_coeff[ch_idx][im][iqcal_idx-1] = (coeff.iqc_coeff[0] >> 7) & 0x7f; in ar9300_tx_iq_cal_post_proc() 6231 coeff.mag_coeff[ch_idx][im][ix] = coeff.mag_coeff[ch_idx][im][iy]; in ar9300_tx_iq_cal_post_proc() 6238 coeff.phs_coeff[ch_idx][im][ix]=coeff.phs_coeff[ch_idx][im][iy]; in ar9300_tx_iq_cal_post_proc() 6260 coeff.last_cal = AH_TRUE; in ar9300_tx_iq_cal_post_proc() [all …]
|