| /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;
|
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| ptw32_getprocessors.c | 71 DWORD_PTR bit; local
74 for (bit = 1; bit != 0; bit <<= 1)
76 if (vProcessCPUs & bit)
|
| /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
63 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
73 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/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| standard.h | 22 #define bit(target,mask) ((target) & (mask)) macro
|
| /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/ |
| vp8_boolcoder_test.cc | 86 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
89 bit = (i & 1);
91 bit = bit_rnd(2);
93 vp8_encode_bool(&bw, bit, static_cast<int>(probas[i]));
110 bit = (i & 1);
112 bit = bit_rnd(2);
114 GTEST_ASSERT_EQ(vp8dx_decode_bool(&br, probas[i]), bit)
|
| vp9_boolcoder_test.cc | 59 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
62 bit = (i & 1);
64 bit = bit_rnd(2);
66 vp9_write(&bw, bit, static_cast<int>(probas[i]));
71 // First bit should be zero
79 bit = (i & 1);
81 bit = bit_rnd(2);
83 GTEST_ASSERT_EQ(vp9_read(&br, probas[i]), bit)
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_treewriter.h | 16 bit coder. Timothy S Murphy 11 October 2004 */
25 /* Approximate length of an encoded bool in 256ths of a bit at given prob */
53 const int bit = (bits >> --len) & 1; local
54 vp9_write(w, bit, probs[i >> 1]);
55 i = tree[i + bit];
71 const int bit = (bits >> --len) & 1; local
72 cost += vp9_cost_bit(probs[i >> 1], bit);
73 i = tree[i + bit];
|
| vp9_write_bit_buffer.h | 27 static void vp9_wb_write_bit(struct vp9_write_bit_buffer *wb, int bit) {
32 wb->bit_buffer[p] = bit << q;
35 wb->bit_buffer[p] |= bit << q;
42 int bit; local
43 for (bit = bits - 1; bit >= 0; bit--)
44 vp9_wb_write_bit(wb, (data >> bit) & 1);
|
| /external/lzma/Java/SevenZip/Compression/RangeCoder/ |
| BitTreeDecoder.java | 33 int bit = rangeDecoder.DecodeBit(Models, m);
local
35 m += bit;
36 symbol |= (bit << bitIndex);
48 int bit = rangeDecoder.DecodeBit(Models, startIndex + m);
local
50 m += bit;
51 symbol |= (bit << bitIndex);
|
| BitTreeEncoder.java | 26 int bit = (symbol >>> bitIndex) & 1;
local
27 rangeEncoder.Encode(Models, m, bit);
28 m = (m << 1) | bit;
37 int bit = symbol & 1;
local
38 rangeEncoder.Encode(Models, m, bit);
39 m = (m << 1) | bit;
51 int bit = (symbol >>> bitIndex) & 1;
local
52 price += Encoder.GetPrice(Models[m], bit);
53 m = (m << 1) + bit;
64 int bit = symbol & 1; local
79 int bit = symbol & 1; local
93 int bit = symbol & 1; local
[all...] |
| /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);
|
