| /external/aac/libSBRenc/src/ |
| env_bit.cpp | 22 the purpose of encoding or decoding bit streams in products that are compliant
105 \brief Remaining SBR Bit Writing Routines
161 /* reset bit buffer */
219 sbrLoad += 4; /* Do byte Align with 4 bit offset. ISO/IEC 14496-3:2005(E)
243 INT bit; local
244 bit = FDKreadBits(&tmpCRCBuf, 1);
245 crcAdvance(SBR_CRC_POLY, SBR_CRC_MASK, &crcReg, bit, 1);
|
| /external/elfutils/libcpu/ |
| i386_parse.y | 222 struct bitvalue *bit;
238 %type <bit> bit byte bytes
408 byte: byte bit
416 | bit
420 bit: '0' label
822 /* Now compute the bit offset of the field. */
[all...] |
| /external/icu/icu4c/source/layoutex/ |
| LXUtilities.cpp | 16 // Finds the high bit by binary searching
25 le_int8 bit = 0; local
29 bit += 16;
34 bit += 8;
39 bit += 4;
44 bit += 2;
49 bit += 1;
52 return bit;
|
| /external/libvpx/libvpx/test/ |
| vp8_boolcoder_test.cc | 85 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
88 bit = (i & 1);
90 bit = bit_rnd(2);
92 vp8_encode_bool(&bw, bit, static_cast<int>(probas[i]));
104 bit = (i & 1);
106 bit = bit_rnd(2);
108 GTEST_ASSERT_EQ(vp8dx_decode_bool(&br, probas[i]), bit)
|
| vp9_boolcoder_test.cc | 58 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
61 bit = (i & 1);
63 bit = bit_rnd(2);
65 vpx_write(&bw, bit, static_cast<int>(probas[i]));
70 // First bit should be zero
78 bit = (i & 1);
80 bit = bit_rnd(2);
82 GTEST_ASSERT_EQ(vpx_read(&br, probas[i]), bit)
|
| /external/libvpx/libvpx/vpx_dsp/ |
| bitwriter.h | 33 static INLINE void vpx_write(vpx_writer *br, int bit, int probability) {
44 if (bit) {
81 static INLINE void vpx_write_bit(vpx_writer *w, int bit) {
82 vpx_write(w, bit, 128); // vpx_prob_half
86 int bit; local
88 for (bit = bits - 1; bit >= 0; bit--) vpx_write_bit(w, 1 & (data >> bit));
|
| /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/mesa3d/src/mesa/main/ |
| querymatrix.c | 52 unsigned i, bit; local
93 for (i = 0, bit = 1; i < 16; i++, bit<<=1) {
125 rv |= bit;
139 rv |= bit;
148 rv |= bit;
|
| /external/pdfium/core/fxcrt/ |
| cfx_bitstream.cpp | 31 int bit = (data[m_BitPos / 8] & (1 << (7 - m_BitPos % 8))) ? 1 : 0; local
33 return bit;
|
| /external/skia/tests/ |
| PathOpsChalkboardTest.cpp | 143 int bit; local
145 bit = r.nextRangeU(0, 63);
146 } while (testlines & (1LL << bit));
147 testlines |= 1LL << bit;
|
| /external/skqp/tests/ |
| PathOpsChalkboardTest.cpp | 143 int bit; local
145 bit = r.nextRangeU(0, 63);
146 } while (testlines & (1LL << bit));
147 testlines |= 1LL << bit;
|
| /external/vboot_reference/utility/ |
| chromeos-tpm-recovery | 45 # bit <n> <i> outputs bit i of number n, with bit 0 being the lsb.
47 bit () { function
308 DEV_MODE_NOW=$(bit $(cat $CHSW) 4)
309 DEV_MODE_AT_BOOT=$(bit $(cat $CHSW) 5)
|
| /external/webp/src/utils/ |
| bit_reader_inl_utils.h | 106 // Read a bit with proba 'prob'. Speed-critical function!
119 const int bit = (value > split); local
120 if (bit) {
132 return bit;
167 int bit; // Don't use 'const int bit = (value > split);", it's slower. local
171 bit = 1;
174 bit = 0;
182 return bit;
|
| /hardware/libhardware/modules/input/evdev/ |
| MouseInputMapper.cpp | 130 // Map evdev button codes to bit indices. This function assumes code >=
153 auto bit = mUpdatedButtonMask.clearFirstMarkedBit(); local
154 getInputReport()->setBoolUsage(INPUT_COLLECTION_ID_MOUSE, codeMap[bit].usage,
155 mButtonValues.hasBit(bit), 0);
|
| SwitchInputMapper.cpp | 113 auto bit = mUpdatedSwitchMask.firstMarkedBit(); local
114 getInputReport()->setBoolUsage(INPUT_COLLECTION_ID_SWITCH, codeMap[bit].usage,
115 mSwitchValues.hasBit(bit), 0);
116 mUpdatedSwitchMask.clearBit(bit);
|
| /system/sepolicy/tools/sepolicy-analyze/ |
| attribute.c | 11 unsigned int bit; local
14 ebitmap_for_each_bit(&policydb->type_attr_map[dat->s.value - 1], n, bit) {
15 if (!ebitmap_node_get_bit(n, bit))
17 if (!strcmp(policydb->p_type_val_to_name[bit], name))
19 printf("%s\n", policydb->p_type_val_to_name[bit]);
22 ebitmap_for_each_bit(&policydb->attr_type_map[dat->s.value - 1], n, bit) {
23 if (!ebitmap_node_get_bit(n, bit))
25 printf("%s\n", policydb->p_type_val_to_name[bit]);
|
| /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...] |
| /device/google/contexthub/firmware/os/cpu/cortexm4/ |
| atomicBitset.c | 87 uint32_t scratch1, scratch2, scratch3, bit = 32; local
105 :"=r"(scratch1), "=r"(bit), "=r"(scratch2), "=l"(scratch3), "=r"(wordPtr)
110 if (bit != 32)
111 return (idx * 32) + bit;
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Wchar/ |
| Searching.c | 61 UINT8 bit;
local
64 //// Initialize bitmap. Bit 0 is always 1 which corresponds to '\0'
73 bit = WHICH_BIT(*s2);
74 bitmap[index] |= bit;
87 UINT8 bit;
local
98 bit = WHICH_BIT(*str);
99 if ((__wchar_bitmap[index] & bit) != 0)
115 UINT8 bit;
local
122 bit = WHICH_BIT(*s1);
123 if( (__wchar_bitmap[index] & bit) != 0) {
158 UINT8 bit; local
223 UINT8 bit; local
[all...] |
| /external/ImageMagick/coders/ |
| otb.c | 123 bit,
181 bit=0;
185 if (bit == 0)
191 SetPixelIndex(image,(byte & (0x01 << (7-bit))) ? 0x00 : 0x01,q);
192 bit++;
193 if (bit == 8)
194 bit=0;
325 bit,
368 bit=0;
373 byte|=0x1 << (7-bit);
121 bit, local
320 bit, local
[all...] |
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| random.c | 127 int ret = 0, bit, bytes, mask; local
150 bit = (bits - 1) % 8;
151 mask = 0xff << (bit + 1);
164 if (bit == 0) {
168 buf[0] |= (3 << (bit - 1));
171 buf[0] |= (1 << bit);
177 // Set the bottom bit if requested,
234 // Compute the bit length of |max_exclusive| (step 1), in terms of a number of
247 // This sets all bits in |mask| below the most significant bit.
268 // bits, where N is the bit length of |max_exclusive|
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/gcm/ |
| Tables1kGCMExponentiator.java | 28 int bit = 0; local
33 ensureAvailable(bit);
34 GCMUtil.multiply(y, (int[])lookupPowX2.elementAt(bit));
36 ++bit;
43 private void ensureAvailable(int bit)
46 if (count <= bit)
55 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/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_bitvector_test.cc | 94 uptr bit = ((uptr)my_rand() % bv.size()); local
95 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
98 EXPECT_EQ(bv.setBit(bit), s.insert(bit).second);
102 s.erase(bit);
103 EXPECT_EQ(bv.clearBit(bit), old_size > s.size());
106 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
|
