| /external/aac/libAACdec/src/ |
| rvlcbit.cpp | 20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
96 description: This function returns a bit from the bitstream according to read direction.
103 return: - bit from bitstream
110 UINT bit; local
118 bit = FDKreadBits(bs, 1);
123 bit = FDKreadBits(bs, 1);
129 return (bit);
|
| aacdec_hcr_bit.cpp | 20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
113 description: This function returns a bit from the bitstream according to read direction.
122 return: - bit from bitstream
129 UINT bit; local
138 bit = FDKreadBits(bs, 1);
149 bit = FDKreadBits(bs, 1);
159 bit = (bit == 0) ? 1 : 0;
163 return (bit);
|
| /external/aac/libSBRdec/src/ |
| huff_dec.cpp | 20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
109 int value, bit; local
112 bit = FDKreadBits (hBs, 1);
113 index = h[index][bit];
|
| /external/bison/lib/ |
| ldexpl.c | 43 int bit; local
60 for (bit = 1;;)
62 /* Invariant: Here bit = 2^i, factor = 2^-2^i or = 2^2^i,
63 and bit <= exp. */
64 if (exp & bit)
66 bit <<= 1;
67 if (bit > exp)
|
| /external/arduino/hardware/arduino/cores/arduino/ |
| wiring_pulse.c | 34 // cache the port and bit of the pin in order to speed up the
37 uint8_t bit = digitalPinToBitMask(pin); local
39 uint8_t stateMask = (state ? bit : 0);
48 while ((*portInputRegister(port) & bit) == stateMask)
53 while ((*portInputRegister(port) & bit) != stateMask)
58 while ((*portInputRegister(port) & bit) == stateMask) {
|
| wiring_digital.c | 32 uint8_t bit = digitalPinToBitMask(pin); local
44 *reg &= ~bit;
49 *reg |= bit;
127 uint8_t bit = digitalPinToBitMask(pin); local
142 *out &= ~bit;
147 *out |= bit;
155 uint8_t bit = digitalPinToBitMask(pin); local
164 if (*portInputRegister(port) & bit) return HIGH;
|
| /dalvik/vm/ |
| BitVector.cpp | 18 * Implementation of an expandable bit vector.
29 * Allocate a bit vector with enough space to hold at least the specified
37 assert(sizeof(bv->storage[0]) == 4); /* assuming 32-bit units */
62 * "Allocate" the first-available bit in the bitmap.
70 unsigned int word, bit; local
78 bit = ffs(~(pBits->storage[word])) -1;
79 assert(bit < 32);
80 pBits->storage[word] |= 1 << bit;
81 return (word << 5) | bit;
100 * Mark the specified bit as "set"
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| boolhuff.c | 65 int bit; local
67 for (bit = bits - 1; bit >= 0; bit--)
68 vp8_encode_bool(br, (1 & (data >> bit)), 0x80);
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| bits.c | 20 Description: Performs bit stream manipulation
36 Word16 coding_mode, /* i: coding bit-stream ratio mode */
37 Word16 mode, /* i: coding bit-stream ratio mode*/
193 Word16 i, bit; local
197 bit = (Word16) (value & 0x0001); /* get lsb */
198 if (bit == 0)
|
| /bionic/libc/include/ |
| signal.h | 61 int bit = signum - 1; // Signal numbers start at 1, but bit positions start at 0. local
62 if (set == NULL || bit < 0 || bit >= (int) (8*sizeof(sigset_t))) {
67 return (int) ((local_set[bit / LONG_BIT] >> (bit % LONG_BIT)) & 1);
71 int bit = signum - 1; // Signal numbers start at 1, but bit positions start at 0. local
72 if (set == NULL || bit < 0 || bit >= (int) (8*sizeof(sigset_t)))
82 int bit = signum - 1; \/\/ Signal numbers start at 1, but bit positions start at 0. local
[all...] |
| /external/aac/libSBRenc/src/ |
| env_bit.cpp | 20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
86 \brief Remaining SBR Bit Writing Routines
148 /* reset bit buffer */
213 sbrLoad += 4; /* Do byte Align with 4 bit offset. ISO/IEC 14496-3:2005(E) page 39. */
235 INT bit; local
236 bit = FDKreadBits(&tmpCRCBuf,1);
237 crcAdvance(SBR_CRC_POLY,SBR_CRC_MASK,&crcReg,bit,1);
|
| /external/chromium/net/base/ |
| dnsrr_resolver_unittest.cc | 203 unsigned bit = bit_to_corrupt & 7; local
206 copy[byte] ^= (1 << bit);
|
| /external/elfutils/libcpu/ |
| i386_parse.y | 218 struct bitvalue *bit;
234 %type <bit> bit byte bytes
404 byte: byte bit
412 | bit
416 bit: '0' label
818 /* Now compute the bit offset of the field. */
[all...] |
| /external/icu4c/layout/ |
| CoverageTables.cpp | 45 le_uint8 bit = OpenTypeUtilities::highBit(count); local
46 le_uint16 power = 1 << bit;
|
| OpenTypeUtilities.cpp | 15 // Finds the high bit by binary searching
24 le_uint8 bit = 0; local
28 bit += 16;
33 bit += 8;
38 bit += 4;
43 bit += 2;
48 bit += 1;
51 return bit;
56 le_uint8 bit = highBit(recordCount); local
57 le_int32 power = 1 << bit;
83 le_uint8 bit = highBit(recordCount); local
[all...] |
| /external/icu4c/layoutex/ |
| LXUtilities.cpp | 14 // Finds the high bit by binary searching
23 le_int8 bit = 0; local
27 bit += 16;
32 bit += 8;
37 bit += 4;
42 bit += 2;
47 bit += 1;
50 return bit;
|
| /external/libvpx/libvpx/test/ |
| boolcoder_test.cc | 61 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
64 bit = (i & 1);
66 bit = bit_rnd(2);
68 vp8_encode_bool(&bw, bit, static_cast<int>(probas[i]));
78 bit = (i & 1);
80 bit = bit_rnd(2);
82 GTEST_ASSERT_EQ(vp8dx_decode_bool(&br, probas[i]), bit)
|
| /external/marisa-trie/tests/ |
| vector-test.cc | 220 const bool bit = (std::rand() % 2) == 0; local
221 bits[i] = bit;
222 bv.push_back(bit);
223 (bit ? ones : zeros).push_back(i);
|
| /external/marisa-trie/v0_1_5/tests/ |
| vector-test.cc | 224 const bool bit = (std::rand() % 2) == 0; local
225 bits[i] = bit;
226 bv.push_back(bit);
227 (bit ? ones : zeros).push_back(i);
|
| /external/v8/tools/ |
| generate-ten-powers.scm | 43 (define (bit-lshbx::bignum x::bignum by::bint)
48 (define (bit-rshbx::bignum x::bignum by::bint)
57 (define max-container (- (bit-lshbx #z1 nb-bits) 1))
65 (-bx (bit-lshbx #z1
70 (bit-lshbx #z1
73 (cut (bit-rshbx (round n) shift))
74 (exact? (=bx n (bit-lshbx cut shift))))
93 (max-container (- (bit-lshbx #z1 nb-bits) 1)))
116 (loop i ten^i (bit-lshbx two^e 1) (+fx e 1)))))
122 (n (bit-lshbx #z1 (-fx nb-bits 1))
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/gcm/ |
| Tables1kGCMExponentiator.java | 27 int bit = 0; local
32 ensureAvailable(bit);
33 GCMUtil.multiply(y, (byte[])lookupPowX2.elementAt(bit));
35 ++bit;
42 private void ensureAvailable(int bit)
45 if (count <= bit)
54 while (++count <= bit);
|
| /external/bzip2/ |
| unzcrash.c | 6 and then repeatedly decompress it, each time with a different bit of
7 the compressed data inverted, so as to test all possible one-bit errors.
64 void flip_bit ( int bit )
66 int byteno = bit / 8;
67 int bitno = bit % 8;
69 //fprintf ( stderr, "(byte %d bit %d mask %d)",
78 int bit; local
102 for (bit = 0; bit < nZ*8; bit++)
[all...] |
| /external/libvorbis/doc/ |
| 02-bitpacking.tex | 23 seven, ten, eleven and sixteen bit 'bytes' have been used. For
36 the native bit-width of a given storage system. This document assumes
39 \subsubsection{bit order}
41 A byte has a well-defined 'least significant' bit (LSb), which is the
42 only bit set when the byte is storing the two's complement integer
43 value +1. A byte's 'most significant' bit (MSb) is at the opposite
70 The Vorbis codec has need to code arbitrary bit-width integers, from
73 is written at the bit position at which the previous field ends.
77 significant bit, etc, until the requested number of bits have been
80 significant unused bit position of the destination byte, followed b
[all...] |
| /external/libvpx/libvpx/vp8/decoder/ |
| dboolhuff.h | 77 unsigned int bit = 0; local
100 bit = 1;
113 return bit;
119 int bit; local
121 for (bit = bits - 1; bit >= 0; bit--)
123 z |= (vp8dx_decode_bool(br, 0x80) << bit);
|
| /external/openssl/crypto/bn/ |
| bn_rand.c | 121 int ret=0,bit,bytes,mask; local
131 bit=(bits-1)%8;
132 mask=0xff<<(bit+1);
181 if (bit == 0)
188 buf[0]|=(3<<(bit-1));
193 buf[0]|=(1<<bit);
197 if (bottom) /* set bottom bit if requested */
251 * so 3*range (= 11..._2) is exactly one bit longer than range */
|
