Lines Matching refs:cb
109 int cb, const float lambda, const float uplim,
122 const int range = aac_cb_range[cb];
123 const int maxval = aac_cb_maxval[cb];
153 curbits = ff_aac_spectral_bits[cb-1][curidx];
154 vec = &ff_aac_codebook_vectors[cb-1][curidx*dim];
186 put_bits(pb, ff_aac_spectral_bits[cb-1][curidx], ff_aac_spectral_codes[cb-1][curidx]);
189 if (ff_aac_codebook_vectors[cb-1][curidx*dim+j] != 0.0f)
193 if (ff_aac_codebook_vectors[cb-1][curidx*2+j] == 64.0f) {
215 int cb, const float lambda, const float uplim, \
219 BT_ESC ? ESC_BT : cb, lambda, uplim, bits, \
234 int cb, const float lambda, const float uplim,
251 s, pb, in, scaled, size, scale_idx, cb, \
253 quantize_and_encode_band_cost_arr[cb]( \
254 s, pb, in, scaled, size, scale_idx, cb, \
259 int cb, const float lambda, const float uplim,
263 cb, lambda, uplim, bits);
268 int cb, const float lambda)
270 quantize_and_encode_band_cost(s, pb, in, NULL, size, scale_idx, cb, lambda,
288 int qmaxval, cb;
290 if (qmaxval == 0) cb = 0;
291 else if (qmaxval == 1) cb = 1;
292 else if (qmaxval == 2) cb = 3;
293 else if (qmaxval <= 4) cb = 5;
294 else if (qmaxval <= 7) cb = 7;
295 else if (qmaxval <= 12) cb = 9;
296 else cb = 11;
297 return cb;
316 int w, swb, cb, start, size;
328 for (cb = 0; cb < 12; cb++) {
329 path[0][cb].cost = 0.0f;
330 path[0][cb].prev_idx = -1;
331 path[0][cb].run = 0;
336 for (cb = 0; cb < 12; cb++) {
337 path[swb+1][cb].prev_idx = cb;
338 path[swb+1][cb].cost = path[swb][cb].cost;
339 path[swb+1][cb].run = path[swb][cb].run + 1;
346 for (cb = 0; cb < 12; cb++) {
353 sce->sf_idx[(win+w)*16+swb], cb,
356 cost_stay_here = path[swb][cb].cost + rd;
358 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
359 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
362 path[swb+1][cb].prev_idx = mincb;
363 path[swb+1][cb].cost = cost_get_here;
364 path[swb+1][cb].run = 1;
366 path[swb+1][cb].prev_idx = cb;
367 path[swb+1][cb].cost = cost_stay_here;
368 path[swb+1][cb].run = path[swb][cb].run + 1;
370 if (path[swb+1][cb].cost < next_minrd) {
371 next_minrd = path[swb+1][cb].cost;
372 next_mincb = cb;
382 for (cb = 1; cb < 12; cb++)
383 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
384 idx = cb;
387 cb = idx;
388 stackrun[stack_len] = path[ppos][cb].run;
389 stackcb [stack_len] = cb;
390 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
391 ppos -= path[ppos][cb].run;
417 int w, swb, cb, start, size;
429 for (cb = 0; cb < 12; cb++) {
430 path[0][cb].cost = run_bits+4;
431 path[0][cb].prev_idx = -1;
432 path[0][cb].run = 0;
453 for (cb = 1; cb < 12; cb++) {
454 path[swb+1][cb].cost = 61450;
455 path[swb+1][cb].prev_idx = -1;
456 path[swb+1][cb].run = 0;
464 for (cb = 0; cb < startcb; cb++) {
465 path[swb+1][cb].cost = 61450;
466 path[swb+1][cb].prev_idx = -1;
467 path[swb+1][cb].run = 0;
469 for (cb = startcb; cb < 12; cb++) {
475 sce->sf_idx[(win+w)*16+swb], cb,
478 cost_stay_here = path[swb][cb].cost + bits;
480 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
481 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
484 path[swb+1][cb].prev_idx = mincb;
485 path[swb+1][cb].cost = cost_get_here;
486 path[swb+1][cb].run = 1;
488 path[swb+1][cb].prev_idx = cb;
489 path[swb+1][cb].cost = cost_stay_here;
490 path[swb+1][cb].run = path[swb][cb].run + 1;
492 if (path[swb+1][cb].cost < next_minbits) {
493 next_minbits = path[swb+1][cb].cost;
494 next_mincb = cb;
504 for (cb = 1; cb < 12; cb++)
505 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
506 idx = cb;
510 cb = idx;
511 stackrun[stack_len] = path[ppos][cb].run;
512 stackcb [stack_len] = cb;
513 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
514 ppos -= path[ppos][cb].run;
654 int cb = find_min_book(maxval, sce->sf_idx[w*16+g]);
658 q + q0, cb, lambda / band->threshold, INFINITY, NULL);
786 int cb;
794 cb = find_min_book(maxvals[w*16+g], sce->sf_idx[w*16+g]);
801 cb,