HomeSort by relevance Sort by last modified time
    Searched defs:numBits (Results 1 - 25 of 72) sorted by null

1 2 3

  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm_neon_asm/
h264bsdFlushBits.s 26 numBits RN 1
57 ADD readBits, readBits, numBits
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm_neon_asm_gcc/
h264bsdFlushBits.S 26 #define numBits r1
55 ADD readBits, readBits, numBits
  /external/deqp/framework/delibs/debase/
deInt32Test.c 74 int numBits;
98 for (numBits = 0; numBits < 32; numBits++)
100 DE_TEST_ASSERT(dePop32(1<<numBits) == 1);
101 DE_TEST_ASSERT(dePop32(~(1<<numBits)) == 31);
105 for (numBits = 0; numBits < 32; numBits++)
107 deUint32 val = (1u<<numBits);
    [all...]
  /external/chromium_org/third_party/tlslite/scripts/
tlsdb.py 140 def numBits(n):
146 print(numBits(N), username)
  /frameworks/av/media/libstagefright/foundation/
ABitReader.cpp 112 size_t numBits = numBitsLeft();
113 if (n > numBits) {
  /external/aac/libAACdec/src/
aac_rom.h 135 UCHAR numBits;
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3bitset.h 101 ANTLR3_UINT32 (*numBits) (struct ANTLR3_BITSET_struct * bitset);
  /external/guava/guava/src/com/google/common/hash/
BloomFilter.java 142 int numBits = optimalNumOfBits(expectedInsertions, falsePositiveProbability);
143 int numHashFunctions = optimalNumOfHashFunctions(expectedInsertions, numBits);
144 return new BloomFilter<T>(new BitArray(numBits), numHashFunctions, funnel,
  /frameworks/av/media/libstagefright/codecs/avc/enc/src/
header.cpp 232 int i, iGroup, numBits;
274 numBits = 0;/* ceil(log2(num_slice_groups_minus1+1)) bits */
278 numBits++;
284 status = BitstreamWriteBits(stream, numBits, picParam->slice_group_id[i]);
    [all...]
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/
h264bsd_slice_header.c 416 u32 tmp,numBits,mask;
430 numBits = 0;
433 /* set numBits to position of right-most non-zero bit */
434 while (tmp & (mask<<++numBits))
436 numBits--;
438 /* add one more bit if value greater than 2^numBits */
439 if (tmp & ((1<<numBits)-1))
440 numBits++;
442 return(numBits);
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/image-decoders/bmp/
BMPImageReader.cpp 414 const int numBits = (m_infoHeader.biBitCount == 16) ? 5 : 8;
416 m_bitMasks[i] = ((static_cast<uint32_t>(1) << (numBits * (3 - i))) - 1) ^ ((static_cast<uint32_t>(1) << (numBits * (2 - i))) - 1);
505 size_t numBits = 0;
507 ++numBits;
515 if (numBits >= 8) {
516 m_bitShiftsRight[i] += (numBits - 8);
517 numBits = 0;
521 m_lookupTableAddresses[i] = numBits ? (nBitTo8BitlookupTable + (1 << numBits) - 2) : 0
    [all...]
  /external/chromium_org/third_party/tlslite/tlslite/utils/
cryptomath.py 127 if (numBits(n) & 0x7)==0:
142 def numBits(n):
157 bits = numBits(n)
167 howManyBits = numBits(high)
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3bitset.c 76 antlr3BitsetNew(ANTLR3_UINT32 numBits)
93 if (numBits < (8 * ANTLR3_BITSET_BITS))
95 numBits = 8 * ANTLR3_BITSET_BITS;
101 numelements = ((numBits -1) >> ANTLR3_BITSET_LOG_BITS) + 1;
132 bitset->numBits = antlr3BitsetNumBits;
649 ANTLR3_UINT32 numBits; // How many bits are in the set
656 numBits = bitset->numBits(bitset);
669 for (i = 0, index = 1; i<numBits; i++)
antlr3collections.c     [all...]
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
BitSet.java 258 public int numBits() {
  /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/
SecureRandom2Test.java 163 int numBits = 29;
164 int random = mySecureRandom.getNext(numBits);
165 assertEquals(numBits, Integer.bitCount(random));
167 numBits = 0;
168 random = mySecureRandom.getNext(numBits);
169 assertEquals(numBits, Integer.bitCount(random));
171 numBits = 40;
172 random = mySecureRandom.getNext(numBits);
175 numBits = -1;
176 random = mySecureRandom.getNext(numBits);
    [all...]
  /external/deqp/framework/referencerenderer/
rrRasterizer.hpp 45 const int numBits = sizeof(deUint64)*8;
46 const int maxSamples = numBits/4;
  /external/llvm/lib/AsmParser/
LLLexer.cpp 492 uint64_t NumBits = atoull(StartChar, CurPtr);
493 if (NumBits < IntegerType::MIN_INT_BITS ||
494 NumBits > IntegerType::MAX_INT_BITS) {
498 TyVal = IntegerType::get(Context, NumBits);
879 uint32_t numBits = ((Len * 64) / 19) + 2;
880 APInt Tmp(numBits, StringRef(TokStart, Len), 10);
883 if (minBits > 0 && minBits < numBits)
888 if (activeBits > 0 && activeBits < numBits)
  /external/llvm/utils/TableGen/
CodeGenTarget.cpp 355 unsigned numBits = BI->getNumBits();
357 SmallVector<Init *, 16> NewBits(numBits);
359 for (unsigned bit = 0, end = numBits / 2; bit != end; ++bit) {
360 unsigned bitSwapIdx = numBits - bit - 1;
366 if (numBits % 2) {
367 unsigned middle = (numBits + 1) / 2;
  /libcore/luni/src/main/java/java/lang/
RealToString.java 94 int numBits = Double.MANTISSA_BITS;
100 numBits--;
111 longDigitGenerator(f, pow, e == 0, mantissaIsZero, numBits);
113 bigIntDigitGenerator(f, pow, e == 0, numBits);
156 int numBits = Float.MANTISSA_BITS;
166 numBits--;
177 longDigitGenerator(f, pow, e == 0, mantissaIsZero, numBits);
179 bigIntDigitGenerator(f, pow, e == 0, numBits);
  /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
SecureRandom2Test.java 276 int numBits = 29;
277 int random = mySecureRandom.getNext(numBits);
278 assertEquals(numBits, Integer.bitCount(random));
280 numBits = 0;
281 random = mySecureRandom.getNext(numBits);
282 assertEquals(numBits, Integer.bitCount(random));
284 numBits = 40;
285 random = mySecureRandom.getNext(numBits);
288 numBits = -1;
289 random = mySecureRandom.getNext(numBits);
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/
cso_hash.c 47 static int primeForNumBits(int numBits)
49 return (1 << numBits) + prime_deltas[numBits];
58 int numBits = 0;
63 numBits++;
66 if (numBits >= (int)sizeof(prime_deltas)) {
67 numBits = sizeof(prime_deltas) - 1;
68 } else if (primeForNumBits(numBits) < hint) {
69 ++numBits;
71 return numBits;
    [all...]
  /external/mesa3d/src/gallium/auxiliary/cso_cache/
cso_hash.c 47 static int primeForNumBits(int numBits)
49 return (1 << numBits) + prime_deltas[numBits];
58 int numBits = 0;
63 numBits++;
66 if (numBits >= (int)sizeof(prime_deltas)) {
67 numBits = sizeof(prime_deltas) - 1;
68 } else if (primeForNumBits(numBits) < hint) {
69 ++numBits;
71 return numBits;
    [all...]
  /libcore/luni/src/main/native/
java_lang_StringToReal.cpp 255 int32_t numBits;
261 numBits = highestSetBitHighPrecision (f, length) + 1;
262 numBits -= lowestSetBitHighPrecision (f, length);
263 if (numBits < 54 && e >= 0 && e < DOUBLE_LOG5_OF_TWO_TO_THE_N)
267 else if (numBits < 54 && e < 0 && (-e) < DOUBLE_LOG5_OF_TWO_TO_THE_N)
689 int32_t numBits;
693 numBits = highestSetBitHighPrecision (f, length) + 1;
694 if (numBits < 25 && e >= 0 && e < FLOAT_LOG5_OF_TWO_TO_THE_N)
698 else if (numBits < 25 && e < 0 && (-e) < FLOAT_LOG5_OF_TWO_TO_THE_N)
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
BitSet.java 414 public int numBits() {

Completed in 1092 milliseconds

1 2 3