Lines Matching refs:cb
109 int cb, const float lambda, const float uplim,
121 const int range = aac_cb_range[cb];
122 const int maxval = aac_cb_maxval[cb];
152 curbits = ff_aac_spectral_bits[cb-1][curidx];
153 vec = &ff_aac_codebook_vectors[cb-1][curidx*dim];
185 put_bits(pb, ff_aac_spectral_bits[cb-1][curidx], ff_aac_spectral_codes[cb-1][curidx]);
188 if (ff_aac_codebook_vectors[cb-1][curidx*dim+j] != 0.0f)
192 if (ff_aac_codebook_vectors[cb-1][curidx*2+j] == 64.0f) {
214 int cb, const float lambda, const float uplim, \
218 BT_ESC ? ESC_BT : cb, lambda, uplim, bits, \
233 int cb, const float lambda, const float uplim,
250 s, pb, in, scaled, size, scale_idx, cb, \
252 quantize_and_encode_band_cost_arr[cb]( \
253 s, pb, in, scaled, size, scale_idx, cb, \
258 int cb, const float lambda, const float uplim,
262 cb, lambda, uplim, bits);
267 int cb, const float lambda)
269 quantize_and_encode_band_cost(s, pb, in, NULL, size, scale_idx, cb, lambda,
287 int qmaxval, cb;
289 if (qmaxval == 0) cb = 0;
290 else if (qmaxval == 1) cb = 1;
291 else if (qmaxval == 2) cb = 3;
292 else if (qmaxval <= 4) cb = 5;
293 else if (qmaxval <= 7) cb = 7;
294 else if (qmaxval <= 12) cb = 9;
295 else cb = 11;
296 return cb;
315 int w, swb, cb, start, size;
327 for (cb = 0; cb < 12; cb++) {
328 path[0][cb].cost = 0.0f;
329 path[0][cb].prev_idx = -1;
330 path[0][cb].run = 0;
335 for (cb = 0; cb < 12; cb++) {
336 path[swb+1][cb].prev_idx = cb;
337 path[swb+1][cb].cost = path[swb][cb].cost;
338 path[swb+1][cb].run = path[swb][cb].run + 1;
345 for (cb = 0; cb < 12; cb++) {
352 sce->sf_idx[(win+w)*16+swb], cb,
355 cost_stay_here = path[swb][cb].cost + rd;
357 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
358 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
361 path[swb+1][cb].prev_idx = mincb;
362 path[swb+1][cb].cost = cost_get_here;
363 path[swb+1][cb].run = 1;
365 path[swb+1][cb].prev_idx = cb;
366 path[swb+1][cb].cost = cost_stay_here;
367 path[swb+1][cb].run = path[swb][cb].run + 1;
369 if (path[swb+1][cb].cost < next_minrd) {
370 next_minrd = path[swb+1][cb].cost;
371 next_mincb = cb;
381 for (cb = 1; cb < 12; cb++)
382 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
383 idx = cb;
386 cb = idx;
387 stackrun[stack_len] = path[ppos][cb].run;
388 stackcb [stack_len] = cb;
389 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
390 ppos -= path[ppos][cb].run;
416 int w, swb, cb, start, size;
428 for (cb = 0; cb < 12; cb++) {
429 path[0][cb].cost = run_bits+4;
430 path[0][cb].prev_idx = -1;
431 path[0][cb].run = 0;
452 for (cb = 1; cb < 12; cb++) {
453 path[swb+1][cb].cost = 61450;
454 path[swb+1][cb].prev_idx = -1;
455 path[swb+1][cb].run = 0;
463 for (cb = 0; cb < startcb; cb++) {
464 path[swb+1][cb].cost = 61450;
465 path[swb+1][cb].prev_idx = -1;
466 path[swb+1][cb].run = 0;
468 for (cb = startcb; cb < 12; cb++) {
474 sce->sf_idx[(win+w)*16+swb], cb,
477 cost_stay_here = path[swb][cb].cost + rd;
479 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
480 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
483 path[swb+1][cb].prev_idx = mincb;
484 path[swb+1][cb].cost = cost_get_here;
485 path[swb+1][cb].run = 1;
487 path[swb+1][cb].prev_idx = cb;
488 path[swb+1][cb].cost = cost_stay_here;
489 path[swb+1][cb].run = path[swb][cb].run + 1;
491 if (path[swb+1][cb].cost < next_minrd) {
492 next_minrd = path[swb+1][cb].cost;
493 next_mincb = cb;
503 for (cb = 1; cb < 12; cb++)
504 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
505 idx = cb;
509 cb = idx;
510 stackrun[stack_len] = path[ppos][cb].run;
511 stackcb [stack_len] = cb;
512 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
513 ppos -= path[ppos][cb].run;
656 int cb = find_min_book(maxval, sce->sf_idx[w*16+g]);
660 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,