| /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/e2fsprogs/debugfs/ |
| zap.c | 38 int bit = -1; local
52 bit = parse_ulong(optarg, argv[0],
53 "bit", &err);
56 if (bit >= (int) current_fs->blocksize * 8) {
57 com_err(argv[0], 0, "The bit to flip "
70 "be an 8-bit value\n");
99 if (bit > 0 && offset > 0) {
117 com_err(0, 0, "\tzap_block [-f file] [-b bit] "
152 if (bit >= 0)
153 buf[bit >> 3] ^= 1 << (bit & 7)
[all...] |
| /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/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;
61 le_uint8 bit = highBit(recordCount); local
62 le_int32 power = 1 << bit;
100 le_uint8 bit = highBit(recordCount); local
[all...] |
| /external/icu/icu4c/source/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/libgdx/gdx/src/com/badlogic/gdx/utils/compression/rangecoder/ |
| BitTreeDecoder.java | 43 int bit = rangeDecoder.DecodeBit(Models, m);
local
45 m += bit;
46 symbol |= (bit << bitIndex);
56 int bit = rangeDecoder.DecodeBit(Models, startIndex + m);
local
58 m += bit;
59 symbol |= (bit << bitIndex);
|
| /external/libvpx/libvpx/test/ |
| vp8_boolcoder_test.cc | 84 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
87 bit = (i & 1);
89 bit = bit_rnd(2);
91 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 | 56 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
59 bit = (i & 1);
61 bit = bit_rnd(2);
63 vpx_write(&bw, bit, static_cast<int>(probas[i]));
68 // First bit should be zero
76 bit = (i & 1);
78 bit = bit_rnd(2);
80 GTEST_ASSERT_EQ(vpx_read(&br, probas[i]), bit)
|
| /external/libvpx/libvpx/vpx_dsp/ |
| bitreader_buffer.c | 22 const int bit = (rb->bit_buffer[p] >> q) & 1; local
24 return bit;
32 int value = 0, bit; local
33 for (bit = bits - 1; bit >= 0; bit--)
34 value |= vpx_rb_read_bit(rb) << bit;
|
| 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--)
89 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/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.h | 108 // Read a bit with proba 'prob'. Speed-critical function!
122 const int bit = ((int)(split - value) >> 31) & 1; local
130 int bit; // Don't use 'const int bit = (value > split);", it's slower. local
134 bit = 1;
137 bit = 0;
146 return bit;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/test/ |
| vp8_boolcoder_test.cc | 84 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
87 bit = (i & 1);
89 bit = bit_rnd(2);
91 vp8_encode_bool(&bw, bit, static_cast<int>(probas[i]));
108 bit = (i & 1);
110 bit = bit_rnd(2);
112 GTEST_ASSERT_EQ(vp8dx_decode_bool(&br, probas[i]), bit)
|
| vp9_boolcoder_test.cc | 57 int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0; local
60 bit = (i & 1);
62 bit = bit_rnd(2);
64 vp9_write(&bw, bit, static_cast<int>(probas[i]));
69 // First bit should be zero
77 bit = (i & 1);
79 bit = bit_rnd(2);
81 GTEST_ASSERT_EQ(vp9_read(&br, probas[i]), 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);
|
| /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/src/cpu/cortexm4f/ |
| 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;
|
| /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/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);
|
