Lines Matching refs:cb
63 int w, swb, cb, start, size;
75 for (cb = 0; cb < CB_TOT_ALL; cb++) {
76 path[0][cb].cost = run_bits+4;
77 path[0][cb].prev_idx = -1;
78 path[0][cb].run = 0;
99 for (cb = 1; cb < CB_TOT_ALL; cb++) {
100 path[swb+1][cb].cost = 61450;
101 path[swb+1][cb].prev_idx = -1;
102 path[swb+1][cb].run = 0;
111 for (cb = 0; cb < startcb; cb++) {
112 path[swb+1][cb].cost = 61450;
113 path[swb+1][cb].prev_idx = -1;
114 path[swb+1][cb].run = 0;
116 for (cb = startcb; cb < CB_TOT_ALL; cb++) {
119 if (cb >= 12 && sce->band_type[win*16+swb] != aac_cb_out_map[cb]) {
120 path[swb+1][cb].cost = 61450;
121 path[swb+1][cb].prev_idx = -1;
122 path[swb+1][cb].run = 0;
129 aac_cb_out_map[cb],
132 cost_stay_here = path[swb][cb].cost + bits;
134 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
135 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
138 path[swb+1][cb].prev_idx = mincb;
139 path[swb+1][cb].cost = cost_get_here;
140 path[swb+1][cb].run = 1;
142 path[swb+1][cb].prev_idx = cb;
143 path[swb+1][cb].cost = cost_stay_here;
144 path[swb+1][cb].run = path[swb][cb].run + 1;
146 if (path[swb+1][cb].cost < next_minbits) {
147 next_minbits = path[swb+1][cb].cost;
148 next_mincb = cb;
158 for (cb = 1; cb < CB_TOT_ALL; cb++)
159 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
160 idx = cb;
164 cb = idx;
165 stackrun[stack_len] = path[ppos][cb].run;
166 stackcb [stack_len] = cb;
167 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
168 ppos -= path[ppos][cb].run;
174 cb = aac_cb_out_map[stackcb[i]];
175 put_bits(&s->pb, 4, cb);
177 memset(sce->zeroes + win*16 + start, !cb, count);
180 sce->band_type[win*16 + start] = cb;