HomeSort by relevance Sort by last modified time
    Searched defs:bits (Results 251 - 275 of 1549) sorted by null

<<11121314151617181920>>

  /external/tinycompress/
cplay.c 105 /* check sync bits */
209 unsigned int channels, rate, bits; local
221 if (parse_mp3_header(&header, &channels, &rate, &bits) == -1) {
235 codec.bit_rate = bits;
286 SND_AUDIOCODEC_MP3, channels, rate, bits);
  /external/toybox/toys/other/
blkid.c 130 int bits = 0x550, size = fstypes[i].uuid_off >> 24, local
133 if (size) bits = 4*(size == 4);
137 for (j = 0; j < size; j++) printf("-%02x"+!(bits & (1<<j)), toybuf[uoff+j]);
  /external/v8/src/base/
bits.h 27 namespace bits { namespace in namespace:v8::base
29 // CountPopulation32(value) returns the number of bits set in |value|.
44 // CountPopulation64(value) returns the number of bits set in |value|.
66 // CountLeadingZeros32(value) returns the number of zero bits following the most
86 // CountLeadingZeros64(value) returns the number of zero bits following the most
116 // CountTrailingZeros32(value) returns the number of zero bits preceding the
136 // CountTrailingZeros64(value) returns the number of zero bits preceding the
272 // |rhs|, extracts the most significant 32 bits of the result, and returns
277 // |lhs| and |rhs|, extracts the most significant 32 bits of the result, and
331 } // namespace bits
    [all...]
  /external/v8/src/
safepoint-table.cc 66 uint8_t* bits = entry.bits(); local
68 // Print the stack slot bits.
73 for (int i = first; i < last; i++) PrintBits(os, bits[i], kBitsPerByte);
75 PrintBits(os, bits[last], last_bits);
144 // Take the register bits into account.
164 ZoneList<uint8_t> bits(bytes_per_entry, zone_);
168 bits.Clear();
169 bits.AddBlock(0, bytes_per_entry, zone_);
176 bits[j] = SafepointTable::kNoRegisters
    [all...]
  /external/webp/src/enc/
cost_enc.c 44 int bits = VP8LevelCodes[level - 1][1]; local
49 cost += VP8BitCost(bits & 1, probas[i]);
51 bits >>= 1;
326 const int bits = VP8LevelCodes[v - 1][1]; local
331 if (pattern & 1) VP8RecordStats(!!(bits & mask), s + 3 + i);
  /external/webrtc/webrtc/modules/video_coding/utility/
vp8_header_parser.cc 27 // Only read 8bits at a time.
39 int BITS = 24;
40 // Read 'BITS' bits at a time.
42 uint32_t bits; local
44 br->buf_ += BITS >> 3;
46 bits = static_cast<uint32_t>(in_bits);
47 if (BITS != 8 * sizeof(uint32_t))
48 bits >>= (8 * sizeof(uint32_t) - BITS);
168 const uint32_t bits = buf[0] | (buf[1] << 8) | (buf[2] << 16); local
    [all...]
  /external/zlib/src/contrib/inflate86/
inffas86.c 50 state->bits < 8
60 - The maximum input bits used by a length/distance pair is 15 bits for the
61 length code, 5 bits for the length extra, 15 bits for the distance code,
62 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
90 /* 88 44 */ unsigned bits; /* ebx rbx local strm->bits */ member in struct:inffast_ar
119 ar.bits = state->bits
    [all...]
  /external/zlib/src/examples/
zran.c 32 necessary the first few bits of the compressed data is read from the file.
33 inflate is initialized with those bits and the 32K of uncompressed data, and
70 int bits; /* number of bits (1-7) from byte at in - 1, or 0 */ member in struct:point
92 local struct access *addpoint(struct access *index, int bits,
123 next->bits = bits;
209 except for up to seven bits) -- the totout == 0 provides an
277 ret = fseeko(in, here->in - (here->bits ? 1 : 0), SEEK_SET);
280 if (here->bits) {
    [all...]
  /external/zlib/src/
infback.c 92 unsigned sym, bits; local
103 bits = 9;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
110 bits = 5;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
135 bits = state->bits; \
146 state->bits = bits; \
153 bits = 0;
262 unsigned bits; \/* bits in bit buffer *\/ local
    [all...]
  /frameworks/opt/telephony/src/java/com/android/internal/telephony/
HardwareConfig.java 153 char[] bits = Integer.toBinaryString(ratBits).toCharArray(); local
157 rat = new BitSet(bits.length);
158 for (int i = 0 ; i < bits.length ; i++) {
159 rat.set(i, (bits[i] == '1' ? true : false));
  /hardware/intel/common/libva/va/
va_enc_jpeg.h 93 } bits; member in union:_VAEncPictureParameterBufferJPEG::__anon47571
97 /** \brief number of bits per sample. */
  /packages/apps/DeskClock/src/com/android/deskclock/data/
Weekdays.java 43 * also converts between those bits and the {@link Calendar#DAY_OF_WEEK} values for easier mutation
68 /** All valid bits set. */
94 private Weekdays(int bits) {
95 // Mask off the unused bits.
96 mBits = ALL_DAYS & bits;
100 * @param bits {@link #getBits bits} representing the encoded weekly repeat schedule
101 * @return a Weekdays instance representing the same repeat schedule as the {@code bits}
103 public static Weekdays fromBits(int bits) {
104 return new Weekdays(bits);
121 int bits = 0; local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/support/
float_comparison.h 141 // For float, there are 8 exponent bits and 23 fraction bits.
143 // For double, there are 11 exponent bits and 52 fraction bits.
156 typedef typename TypeWithSize<sizeof(RawType)>::UInt Bits;
160 // # of bits in a number.
163 // # of fraction bits in a number.
167 // # of exponent bits in a number.
171 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1)
224 const Bits &bits() const { return u_.bits_; } function in class:FloatingPoint
    [all...]
  /system/bt/embdrv/sbc/decoder/srce/
bitalloc.c 28 The functions in this file relate to the allocation of available bits to
108 * bitpool may be larger than the bits actually required but the only input we
109 * have are the scale factors. For example, it takes 2 bits to represent values
112 * preferred bitpool. This is not ideal because 0 requires 0 bits but we
119 * @param preferredBitpool Returns the number of reserved bits
143 OI_INT bits = scale_factor[sb]; local
144 if (bits > maxBits) {
145 maxBits = bits;
147 bitneeds[sb] = bits;
149 bitcount += bits;
161 OI_INT bits = scale_factor[sb]; local
    [all...]
  /system/core/libpixelflinger/
fixed.cpp 110 // Compute a full precision square-root (24 bits accuracy)
270 if ((result >> 31) != 0) // result must fit in 31 bits
274 int bits = 31; local
284 } while (bits--);
  /system/core/libunwindstack/
ArmExidx.cpp 52 // Each entry is a 32 bit prel31 offset followed by 32 bits
245 uint8_t bits = byte & 0xf; local
246 if (bits == 13 || bits == 15) {
257 log(log_indent_, "vsp = r%d", bits);
262 // It is impossible for bits to be larger than the total number of
263 // arm registers, so don't bother checking if bits is a valid register.
264 cfa_ = (*regs_)[bits];
485 uint8_t bits = byte & 0x7; local
486 if (bits == 6)
566 uint8_t bits = byte & 0x7; local
    [all...]
  /test/suite_harness/tools/dex-tools/src/dex/reader/
DexBuffer.java 146 int bits = readInt(nBytes); local
148 bits <<= bytesToMove;
149 return Float.intBitsToFloat(bits);
173 long bits = readLong(nBytes); local
175 bits <<= bytesToMove;
176 return Double.longBitsToDouble(bits);
  /toolchain/binutils/binutils-2.27/gas/config/
atof-vax.c 30 /* Length in LittleNums of guard bits. */
152 long *exponent_bitsP) /* Number of exponent bits. */
198 LITTLENUM_TYPE bits[MAX_PRECISION + MAX_PRECISION + GUARD];
199 /* Extra bits for zeroed low-order bits.
201 the last contain flonum bits. */
207 f.low = bits + MAX_PRECISION;
221 memset (bits, '\0', sizeof (LITTLENUM_TYPE) * MAX_PRECISION);
225 15 leading 0 bits, so could be useless. */
283 Bits 14:n are excess-whatever exponent
195 LITTLENUM_TYPE bits[MAX_PRECISION + MAX_PRECISION + GUARD]; local
    [all...]
  /toolchain/binutils/binutils-2.27/include/opcode/
mn10200.h 32 /* The opcode itself. Those bits which will be filled in with
37 mask containing ones indicating those bits which must match the
38 opcode field, and zeroes indicating those bits which need not
63 /* The number of bits in the operand. */ member in struct:mn10200_operand
64 int bits;
tic80.h 33 /* The opcode itself. Those bits which will be filled in with operands
39 containing ones indicating those bits which must match the opcode
40 field, and zeroes indicating those bits which need not match (and are
70 /* The number of bits in the operand. */
72 int bits;
82 i |= (op & ((1 << o->bits) - 1)) << o->shift;
102 op = ((i) >> o->shift) & ((1 << o->bits) - 1);
104 && (op & (1 << (o->bits - 1))) != 0)
105 op -= 1 << o->bits;
135 or'd into an int where the lower bits contain the actual numeric valu
71 int bits; member in struct:tic80_operand
    [all...]
  /toolchain/binutils/binutils-2.27/opcodes/
d30v-dis.c 96 int mask = (0xFFFFFFFF >> (32 - oper->bits));
100 if (oper->bits == 32)
158 int bits; local
161 bits = oper->bits;
163 bits += 3;
267 if (oper->flags & OPERAND_SIGNED || bits == 32)
270 max = (1 << (bits - 1));
273 if (bits == 32)
276 val = -val & ((1 << bits) - 1)
    [all...]
s390-dis.c 112 int bits; local
117 bits = (operand->shift & 7) + operand->bits;
123 bits -= 8;
125 while (bits > 0);
126 val >>= -bits;
127 val &= ((1U << (operand->bits - 1)) << 1) - 1;
130 if (operand->bits == 20 && operand->shift == 20)
137 unsigned int m = 1U << (operand->bits - 1);
150 /* Extract the extra bits for a vector register operand store
    [all...]
  /toolchain/binutils/binutils-2.27/zlib/contrib/inflate86/
inffas86.c 50 state->bits < 8
60 - The maximum input bits used by a length/distance pair is 15 bits for the
61 length code, 5 bits for the length extra, 15 bits for the distance code,
62 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
90 /* 88 44 */ unsigned bits; /* ebx rbx local strm->bits */ member in struct:inffast_ar
119 ar.bits = state->bits
    [all...]
  /toolchain/binutils/binutils-2.27/zlib/examples/
zran.c 32 necessary the first few bits of the compressed data is read from the file.
33 inflate is initialized with those bits and the 32K of uncompressed data, and
70 int bits; /* number of bits (1-7) from byte at in - 1, or 0 */ member in struct:point
92 local struct access *addpoint(struct access *index, int bits,
123 next->bits = bits;
209 except for up to seven bits) -- the totout == 0 provides an
277 ret = fseeko(in, here->in - (here->bits ? 1 : 0), SEEK_SET);
280 if (here->bits) {
    [all...]
  /toolchain/binutils/binutils-2.27/zlib/
infback.c 92 unsigned sym, bits; local
103 bits = 9;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
110 bits = 5;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
135 bits = state->bits; \
146 state->bits = bits; \
153 bits = 0;
262 unsigned bits; \/* bits in bit buffer *\/ local
    [all...]

Completed in 727 milliseconds

<<11121314151617181920>>