Lines Matching defs:bpred
111 static void choose_predictor (unsigned int channels, short *data, int *bpred, int *idelta) ;
219 short bytecode, bpred [2], chan_idelta [2] ;
242 { bpred [0] = msadpcm_get_bpred (psf, pms, pms->block [0]) ;
252 { bpred [0] = msadpcm_get_bpred (psf, pms, pms->block [0]) ;
253 bpred [1] = msadpcm_get_bpred (psf, pms, pms->block [1]) ;
304 predict = ((pms->samples [k - pms->channels] * AdaptCoeff1 [bpred [chan]])
305 + (pms->samples [k - 2 * pms->channels] * AdaptCoeff2 [bpred [chan]])) >> 8 ; /* => / 256 => FIXED_POINT_COEFF_BASE == 256 */
529 int chan, k, predict, bpred [2] = { 0 }, idelta [2] = { 0 },
532 choose_predictor (pms->channels, pms->samples, bpred, idelta) ;
537 { pms->block [0] = bpred [0] ;
551 { predict = (pms->samples [k-1] * AdaptCoeff1 [bpred [0]] + pms->samples [k-2] * AdaptCoeff2 [bpred [0]]) >> 8 ;
579 pms->block [0] = bpred [0] ;
580 pms->block [1] = bpred [1] ;
604 predict = (pms->samples [k-2] * AdaptCoeff1 [bpred [chan]] + pms->samples [k-4] * AdaptCoeff2 [bpred [chan]]) >> 8 ;
825 { unsigned int chan, k, bpred, idelta_sum, best_bpred, best_idelta ;
830 for (bpred = 0 ; bpred < 7 ; bpred++)
833 idelta_sum += abs (data [k * channels] - ((data [(k - 1) * channels] * AdaptCoeff1 [bpred] + data [(k - 2) * channels] * AdaptCoeff2 [bpred]) >> 8)) ;
836 if (bpred == 0 || idelta_sum < best_idelta)
837 { best_bpred = bpred ;
842 { best_bpred = bpred ;
847 } ; /* for bpred ... */