| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| dec_gain2_amr_wb.cpp | 48 int16 nbits, (i) : number of bits (6 or 7)
171 int16 nbits, /* (i) : number of bits (6 or 7) */
327 if (nbits == 6)
|
| pvamrwbdecoder_acelp.h | 252 int16 nbits, /* (i) : number of bits (6 or 7) */
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| q_gain2.c | 71 Word16 nbits, /* (i) : number of bits (6 or 7) */
92 if (nbits == 6)
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkMath.cpp | 250 int nbits = SkCLZ(numer) - 1; local
252 int bits = shift_bias - nbits + dbits;
262 numer <<= nbits; local
|
| /external/chromium_org/third_party/skia/src/effects/gradients/ |
| SkSweepGradient.cpp | 105 int nbits = SkCLZ(numer); local
107 int bits = 6 - nbits + dbits;
115 numer <<= nbits - 1;
|
| /external/skia/src/core/ |
| SkMath.cpp | 250 int nbits = SkCLZ(numer) - 1; local
252 int bits = shift_bias - nbits + dbits;
262 numer <<= nbits; local
|
| /external/skia/src/effects/gradients/ |
| SkSweepGradient.cpp | 105 int nbits = SkCLZ(numer); local
107 int bits = 6 - nbits + dbits;
115 numer <<= nbits - 1;
|
| /external/aac/libAACdec/src/ |
| block.cpp | 292 const int nbits = (IsLongBlock(&pAacDecoderChannelInfo->icsInfo) == 1) ? 5 : 3; local
294 int sect_esc_val = (1 << nbits) - 1 ;
309 sect_len_incr = FDKreadBits(bs, nbits);
313 sect_len_incr = FDKreadBits(bs, nbits);
|
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.h | 139 const int nbits = nbytes * 8; local
143 for(int i = start; i < nbits; i++)
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/ |
| acelp.h | 394 Word16 nbits, /* (i) : number of bits (6 or 7) */
406 Word16 nbits, /* (i) : number of bits (6 or 7) */
|
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| pitch_analysis_core_FIX.c | 726 opus_int32 nbits, x_max; local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| perfect.c | 74 /* compute p(x), where p is a permutation of 0..(1<<nbits)-1 */
78 ub4 nbits) /* input, number of bits in range */
81 int mask = ((ub4)1<<nbits)-1; /* all ones */
82 int const2 = 1+nbits/2;
83 int const3 = 1+nbits/3;
84 int const4 = 1+nbits/4;
85 int const5 = 1+nbits/5;
[all...] |
| /hardware/broadcom/wlan/bcmdhd/dhdutil/include/ |
| bcmutils.h | 675 #define NBITS(type) (sizeof(type) * 8)
676 #define NBITVAL(nbits) (1 << (nbits))
677 #define MAXBITVAL(nbits) ((1 << (nbits)) - 1)
678 #define NBITMASK(nbits) MAXBITVAL(nbits)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_long.py | 97 nbits = 0
99 while nbits < nbits_lo:
101 bits = min(bits, nbits_hi - nbits)
103 nbits = nbits + bits
108 self.assertTrue(nbits_lo <= nbits <= nbits_hi)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_long.py | 97 nbits = 0
99 while nbits < nbits_lo:
101 bits = min(bits, nbits_hi - nbits)
103 nbits = nbits + bits
108 self.assertTrue(nbits_lo <= nbits <= nbits_hi)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| BitSet.java | 57 /* We will often need to do a mod operator (i mod nbits). Its
59 * same as (i & (nbits-1)). Since mod is slow, we use a
78 * @param nbits The size of the bitset in bits
80 public BitSet(int nbits) {
81 bits = new long[((nbits - 1) >> LOG_BITS) + 1];
|
| /external/qemu/ |
| mips-dis.c | [all...] |
| /external/chromium/base/third_party/dmg_fp/ |
| dtoa.cc | 350 #define Nbits 53
407 #define Nbits 56
436 #define Nbits 56
1743 int big, denorm, esign, havedig, k, n, nbits, up, zret; variable
[all...] |
| /external/chromium_org/base/third_party/dmg_fp/ |
| dtoa.cc | 350 #define Nbits 53
407 #define Nbits 56
436 #define Nbits 56
1743 int big, denorm, esign, havedig, k, n, nbits, up, zret; variable
[all...] |
| /external/chromium_org/tools/android/memdump/ |
| memdump.cc | 36 void resize(size_t nbits) {
37 data_.resize((nbits + 7) / 8);
|
| /external/jpeg/ |
| jdhuff.c | 295 int nbits)
296 /* Load up the bit buffer to a depth of at least nbits */
367 if (nbits > bits_left) {
|
| /external/qemu/distrib/jpeg-6b/ |
| jdhuff.c | 295 int nbits)
296 /* Load up the bit buffer to a depth of at least nbits */
367 if (nbits > bits_left) {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| MultiCall.py | 119 def nbits(n): function in function:expand_substates
129 substates.sort(key=nbits, reverse=True)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| MultiCall.py | 119 def nbits(n): function in function:expand_substates
129 substates.sort(key=nbits, reverse=True)
|
| /external/chromium_org/third_party/libwebp/enc/ |
| vp8l.c | 362 const int nbits = VP8LBitsLog2Ceiling(trimmed_length - 1); local
363 const int nbitpairs = (nbits == 0) ? 1 : (nbits + 1) / 2;
[all...] |
