HomeSort by relevance Sort by last modified time
    Searched defs:bit (Results 26 - 50 of 294) sorted by null

12 3 4 5 6 7 8 91011>>

  /bionic/libc/include/android/
legacy_signal_inlines.h 40 /* Signal numbers start at 1, but bit positions start at 0. */
41 int bit = signum - 1; local
43 if (set == NULL || bit < 0 || bit >= (int)(8 * sizeof(sigset_t))) {
47 return (int)((local_set[bit / LONG_BIT] >> (bit % LONG_BIT)) & 1);
51 /* Signal numbers start at 1, but bit positions start at 0. */
52 int bit = signum - 1; local
54 if (set == NULL || bit < 0 || bit >= (int)(8 * sizeof(sigset_t)))
64 int bit = signum - 1; local
    [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);
  /external/libvpx/libvpx/vp9/decoder/
vp9_read_bit_buffer.c 24 const int bit = (rb->bit_buffer[p] & (1 << q)) >> q; local
26 return bit;
31 int value = 0, bit; local
32 for (bit = bits - 1; bit >= 0; bit--)
33 value |= vp9_rb_read_bit(rb) << bit;
  /external/libvpx/libvpx/vp9/encoder/
vp9_cost.h 26 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vp9_complement(prob) \
40 const int bit = (bits >> --len) & 1; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
42 i = tree[i + bit];
vp9_writer.h 33 static INLINE void vp9_write(vp9_writer *br, int bit, int probability) {
44 if (bit) {
81 static INLINE void vp9_write_bit(vp9_writer *w, int bit) {
82 vp9_write(w, bit, 128); // vp9_prob_half
86 int bit; local
88 for (bit = bits - 1; bit >= 0; bit--)
89 vp9_write_bit(w, 1 & (data >> bit));
  /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)
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/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);
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/
vp9_read_bit_buffer.c 24 const int bit = (rb->bit_buffer[p] & (1 << q)) >> q; local
26 return bit;
31 int value = 0, bit; local
32 for (bit = bits - 1; bit >= 0; bit--)
33 value |= vp9_rb_read_bit(rb) << bit;
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/
vp9_cost.h 26 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vp9_complement(prob) \
40 const int bit = (bits >> --len) & 1; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
42 i = tree[i + bit];
  /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/src/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;
  /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/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 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)
  /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);
  /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/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)
  /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...]

Completed in 603 milliseconds

12 3 4 5 6 7 8 91011>>