HomeSort by relevance Sort by last modified time
    Searched refs:BITRES (Results 1 - 7 of 7) sorted by null

  /external/libopus/celt/
rate.c 135 get_required_bits(tmp, entryN[i], get_pulses(entryK[i]), BITRES);
155 max_bits = C*(1+MAX_FINE_BITS)<<BITRES;
192 offset = ((m->logN[j]+((LM0+k)<<BITRES))>>1)-QTHETA_OFFSET;
208 offset = ((m->logN[j]+(i<<BITRES))>>1)-(N==2?QTHETA_OFFSET_TWOPHASE:QTHETA_OFFSET);
223 offset = ((m->logN[j] + (i<<BITRES))>>1)-FINE_OFFSET;
226 offset += 1<<BITRES>>2;
230 den = (ndof-1)<<BITRES;
233 max_bits += C*qb<<BITRES;
265 alloc_floor = C<<BITRES;
268 logM = LM<<BITRES;
    [all...]
entcode.c 82 nbits=_this->nbits_total<<BITRES;
85 for(i=BITRES;i-->0;){
entcode.h 51 # define BITRES 3
112 Return: The number of bits scaled by 2**BITRES.
celt_encoder.c 979 boost_bits = boost*width<<BITRES;
982 boost_bits = (boost*width<<BITRES)/8;
985 boost_bits = boost*6<<BITRES;
989 && (tot_boost+boost_bits)>>BITRES>>3 > effectiveBytes/4)
991 opus_int32 cap = ((effectiveBytes/4)<<BITRES<<3);
    [all...]
bands.c 278 thresh32 = SHR32(celt_exp2(-SHL16(depth, 10-BITRES)),1);
625 qb = IMIN(b-pulse_cap-(4<<BITRES), (b+N2*offset)/N2);
627 qb = IMIN(8<<BITRES, qb);
629 if (qb<(1<<BITRES>>1)) {
632 qn = exp2_table8[qb&0x7]>>(14-(qb>>BITRES));
690 pulse_cap = m->logN[i]+LM*(1<<BITRES);
794 if (*b>2<<BITRES && ctx->remaining_bits > 2<<BITRES)
854 if (ctx->remaining_bits>=1<<BITRES)
863 ctx->remaining_bits -= 1<<BITRES;
    [all...]
celt_decoder.c 847 total_bits<<=BITRES;
857 quanta = IMIN(width<<BITRES, IMAX(6<<BITRES, width));
860 while (tell+(dynalloc_loop_logp<<BITRES) < total_bits && boost < cap[i])
878 alloc_trim = tell+(6<<BITRES) <= total_bits ?
881 bits = (((opus_int32)len*8)<<BITRES) - ec_tell_frac(dec) - 1;
882 anti_collapse_rsv = isTransient&&LM>=2&&bits>=((LM+2)<<BITRES) ? (1<<BITRES) : 0;
900 len*(8<<BITRES)-anti_collapse_rsv, balance, dec, LM, codedBands, &st->rng);
    [all...]
modes.c 386 logN[i] = log2_frac(mode->eBands[i+1]-mode->eBands[i], BITRES);

Completed in 2317 milliseconds