Lines Matching defs:bits
68 uint8_t fbits[MAX_CHANNELS]; ///< fraction bits
448 /** Calculates the smallest number of bits it takes to encode a given signed
549 /* TODO 20 bits: */
1234 int bits = ff_ctz(sample);
1238 if (bits >= 24)
1241 return bits;
1244 /** Determines how many bits are zero at the end of all samples so they can be
1268 /** Determines the smallest number of bits needed to encode the filter
1275 int bits, shift;
1289 bits = FFMAX(number_sbits(min), number_sbits(max));
1291 for (shift = 0; shift < 7 && bits + shift < 16 && !(coeff_mask & (1<<shift)); shift++);
1293 fp->coeff_bits = bits;
1395 /** Determines how many fractional bits are needed to encode matrix
1396 * coefficients. Also shifts the coefficients to fit within 2.14 bits.
1403 unsigned int bits;
1410 for (bits = 0; bits < 14 && !(coeff_mask & (1<<bits)); bits++);
1412 mp->fbits [mat] = 14 - bits;
1471 /** Determines the amount of bits needed to encode the samples using no
1500 /** Determines the least amount of bits needed to encode the samples using no
1515 * so that more bits are used, thus shifting the offset. */
1521 /* Determine offset and minimum number of bits. */
1540 /** Determines the least amount of bits needed to encode the samples using a
1603 /** Determines the least amount of bits needed to encode the samples using a
1604 * given codebook. Searches for the best offset to minimize the bits.
1643 /** Determines the least amount of bits needed to encode the samples using
1709 #define MSB_MASK(bits) (-(int)(1u << (bits)))
1713 * maximum amount of bits allowed (24), the samples buffer is left as is and