Lines Matching defs:that
12 * This library is distributed in the hope that it will be useful,
395 block_sf(algo_t * that, const FLOAT l3_xmin[SFBMAX], int vbrsf[SFBMAX], int vbrsfmin[SFBMAX])
398 const FLOAT *const xr = &that->cod_info->xr[0];
399 const FLOAT *const xr34_orig = &that->xr34orig[0];
400 const int *const width = &that->cod_info->width[0];
401 const char *const energy_above_cutoff = &that->cod_info->energy_above_cutoff[0];
402 unsigned int const max_nonzero_coeff = (unsigned int) that->cod_info->max_nonzero_coeff;
406 int const psymax = that->cod_info->psymax;
408 assert(that->cod_info->max_nonzero_coeff >= 0);
410 that->mingain_l = 0;
411 that->mingain_s[0] = 0;
412 that->mingain_s[1] = 0;
413 that->mingain_s[2] = 0;
426 if (that->mingain_l < m1) {
427 that->mingain_l = m1;
429 if (that->mingain_s[i] < m1) {
430 that->mingain_s[i] = m1;
437 m2 = that->find(&xr[j], &xr34_orig[j], l3_xmin[sfb], l, m1);
446 DEBUGF(that->gfc, "sfb=%3d guess=%3d found=%3d diff=%3d\n", sfb, guess, m2,
501 quantize_x34(const algo_t * that)
504 const FLOAT *xr34_orig = that->xr34orig;
505 gr_info *const cod_info = that->cod_info;
770 short_block_constrain(const algo_t * that, const int vbrsf[SFBMAX],
773 gr_info *const cod_info = that->cod_info;
774 lame_internal_flags const *const gfc = that->gfc;
776 int const maxminsfb = that->mingain_l;
833 set_subblock_gain(cod_info, &that->mingain_s[0], sf_temp);
848 long_block_constrain(const algo_t * that, const int vbrsf[SFBMAX], const int vbrsfmin[SFBMAX],
851 gr_info *const cod_info = that->cod_info;
852 lame_internal_flags const *const gfc = that->gfc;
855 int const maxminsfb = that->mingain_l;
985 bitcount(const algo_t * that)
987 int rc = scale_bitcount(that->gfc, that->cod_info);
993 ERRORF(that->gfc, "INTERNAL ERROR IN VBR NEW CODE (986), please send bug report\n");
1000 quantizeAndCountBits(const algo_t * that)
1002 quantize_x34(that);
1003 that->cod_info->part2_3_length = noquant_count_bits(that->gfc, that->cod_info, 0);
1004 return that->cod_info->part2_3_length;
1012 tryGlobalStepsize(const algo_t * that, const int sfwork[SFBMAX],
1015 FLOAT const xrpow_max = that->cod_info->xrpow_max;
1031 that->alloc(that, sftemp, vbrsfmin, vbrmax);
1032 bitcount(that);
1033 nbits = quantizeAndCountBits(that);
1034 that->cod_info->xrpow_max = xrpow_max;
1041 searchGlobalStepsizeMax(const algo_t * that, const int sfwork[SFBMAX],
1044 gr_info const *const cod_info = that->cod_info;
1054 nbits = tryGlobalStepsize(that, sfwork, vbrsfmin, curr - gain);
1068 nbits = tryGlobalStepsize(that, sfwork, vbrsfmin, curr - gain);
1141 tryThatOne(algo_t const* that, const int sftemp[SFBMAX], const int vbrsfmin[SFBMAX], int vbrmax)
1143 FLOAT const xrpow_max = that->cod_info->xrpow_max;
1145 that->alloc(that, sftemp, vbrsfmin, vbrmax);
1146 bitcount(that);
1147 nbits = quantizeAndCountBits(that);
1148 nbits += that->cod_info->part2_length;
1149 that->cod_info->xrpow_max = xrpow_max;
1155 outOfBitsStrategy(algo_t const* that, const int sfwork[SFBMAX], const int vbrsfmin[SFBMAX], int target)
1159 int const p = that->cod_info->global_gain;
1170 nbits = tryThatOne(that, wrk, vbrsfmin, sfmax);
1188 nbits = tryThatOne(that, wrk, vbrsfmin, sfmax);
1202 nbits = tryThatOne(that, wrk, vbrsfmin, sfmax);
1220 nbits = tryThatOne(that, wrk, vbrsfmin, sfmax);
1227 searchGlobalStepsizeMax(that, wrk, vbrsfmin, target);
1300 algo_t *that = &that_[gr][ch];
1305 vbrmax = block_sf(that, l3_xmin[gr][ch], sfwork, vbrsfmin);
1306 that->alloc(that, sfwork, vbrsfmin, vbrmax);
1307 bitcount(that);
1323 algo_t const *that = &that_[gr][ch];
1325 memset(&that->cod_info->l3_enc[0], 0, sizeof(that->cod_info->l3_enc));
1326 (void) quantizeAndCountBits(that);
1346 /* violates the rule that every granule has to use no more
1353 /* violates the rule that every gr_ch has to use no more
1357 * part2_3_length field has only 12 bits, that makes it
1556 algo_t const *that = &that_[gr][ch];
1561 cutDistribution(sfwork, sfwork, that->cod_info->global_gain);
1562 outOfBitsStrategy(that, sfwork, vbrsfmin, max_nbits_ch[gr][ch]);