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

<<11121314151617

  /external/quake/quake/src/WinQuake/
cl_input.cpp 346 int bits; local
371 // send button bits
373 bits = 0;
376 bits |= 1;
380 bits |= 2;
383 MSG_WriteByte (&buf, bits);
  /external/webkit/Source/WebCore/platform/image-decoders/gif/
GIFImageReader.h 89 int bits; /* Number of unread bits in "datum" */ member in struct:GIFFrameReader
126 bits = datum = 0;
  /external/webkit/Source/WebCore/plugins/android/
PluginViewAndroid.cpp 564 uint32_t* bits = reinterpret_cast<uint32_t*>(value); local
565 *bits = kBitmap_ANPDrawingModel & kSurface_ANPDrawingModel;
  /external/wpa_supplicant_6/wpa_supplicant/src/crypto/
crypto_internal.c 45 u32 bits[2]; member in struct:MD5Context
  /external/zlib/contrib/puff/
puff.c 19 * assumes that long's are at least 32 bits. puff.c uses the short data type,
20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code
48 * are 16 bits
84 #define MAXBITS 15 /* maximum bits in a code */
102 int bitcnt; /* number of bits in bit buffer */
104 /* input limit error return state for bits() and decode() */
109 * Return need bits from the input stream. This always leaves less than
110 * eight bits in the buffer. bits() works properly for need == 0.
114 * - Bits are stored in bytes from the least significant bit to the mos
119 local int bits(struct state *s, int need) function
    [all...]
  /external/zlib/
inflate.h 32 TYPE, /* i: waiting for type bits, including last-flag bit */
42 LENEXT, /* i: waiting for length extra bits */
44 DISTEXT, /* i: waiting for distance extra bits */
99 unsigned bits; /* number of bits in "in" */ member in struct:inflate_state
104 unsigned extra; /* extra bits needed */
108 unsigned lenbits; /* index bits for lencode */
109 unsigned distbits; /* index bits for distcode */
120 int back; /* bits back of last unprocessed length/lit */
  /frameworks/base/opengl/libagl/
dxt.cpp 162 // There's no need to endian-swap within 'bits'
164 uint32_t bits = *d32++; local
166 // Detect if any (odd, even) pair of bits are '11'
167 // bits: b31 b30 b29 ... b3 b2 b1 b0
168 // bits >> 1: b31 b31 b30 ... b4 b3 b2 b1
171 if (((bits & (bits >> 1)) & 0x55555555) != 0) {
216 uint32_t bits = *d32++; local
220 bits = swap(bits);
339 uint32_t bits = *d32++; local
463 uint32_t bits = *d32++; local
    [all...]
  /frameworks/compile/slang/
slang_rs_type_spec.h 82 #define ENUM_PRIMITIVE_DATA_TYPE(x, name, bits) RS_DT_ ## x,
126 unsigned bits; // NOTE: Little-endian is assumed. member in union:RSTypeBase::__anon15808
159 // esize is encoded in base.bits{8-31} in little-endian way. This implicates
173 // num_fields is encoded in base.bits{16-31} in little-endian way. This
235 (RS_CAST_TO_CONSTANT_ARRAY_TYPE(R)->base.bits & 0x00ffffff)
237 RS_CAST_TO_CONSTANT_ARRAY_TYPE(R)->base.bits = \
238 ((RS_CAST_TO_CONSTANT_ARRAY_TYPE(R)->base.bits & 0x000000ff) | \
246 ((RS_CAST_TO_RECORD_TYPE(R)->base.bits & 0xffff0000) >> 16)
248 RS_CAST_TO_RECORD_TYPE(R)->base.bits = \
249 ((RS_CAST_TO_RECORD_TYPE(R)->base.bits & 0x0000ffff) | ((V & 0xffff) << 16)
    [all...]
  /hardware/ti/omap3/omx/ti_omx_config_parser/src/
ti_m4v_config_parser.cpp 139 //DV: this is the wrong way to skip bits, use FLush or Read psBits->dataBitPos += 32;
140 ReadBits(psBits, 32, &codeword); // skip 32 bits of the Start code
257 /* vol_id (4 bits) */
625 uint8 ucNBits, /* nr of bits to read */
629 uint8 *bits; local
636 if (ucNBits > (32 - bitPos)) /* not enough bits */
652 bits = &pStream->data[dataBytePos];
653 pStream->bitBuf = (bits[0] << 24) | (bits[1] << 16) | (bits[2] << 8) | bits[3]
671 uint8 *bits; local
703 uint8 *bits; local
739 uint8 *bits; local
    [all...]
  /libcore/luni/src/main/java/java/util/
BitSet.java 40 * The bits. Access bit n thus:
42 * boolean bit = (bits[n / 64] | (1 << n)) != 0;
49 private long[] bits; field in class:BitSet
52 * The number of elements of 'bits' that are actually in use (non-zero). Amongst other
58 * Updates 'longCount' by inspecting 'bits'. Assumes that the new longCount is <= the current
67 while (i >= 0 && bits[i] == 0) {
74 * Creates a new {@code BitSet} with size equal to 64 bits.
90 this.bits = arrayForBits(bitCount);
94 private BitSet(long[] bits) {
95 this.bits = bits
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/security/asn1/
BerInputStream.java 220 // content: check unused bits
223 + "]. A number of unused bits MUST be in range 0 to 7");
228 + "]. For empty string unused bits MUST be 0");
256 int bits = buffer[contentOffset] & 0xFF; local
258 bits += 0x100;
261 if (bits == 0 || bits == 0x1FF) {
  /system/core/include/pixelflinger/
format.h 101 inline uint32_t bits(int i) const { function in struct:__anon30599
  /system/core/libpixelflinger/codeflinger/
texturing.cpp 143 const int bits = parts.iterated.size(); local
144 const uint32_t size = ((bits>=32) ? 0 : (1LU << bits)) - 1;
173 mask, bits);
282 tmu.bits = tmu.format.size*8;
351 txPtr.setTo(obtainReg(), tmu.bits);
482 // for 8-bits textures, we can afford
483 // 7 bits of fractional precision at no
484 // additional cost (we can't do 8 bits
485 // because filter8 uses signed 16 bits muls
    [all...]
  /system/core/toolbox/
getevent.c 45 uint8_t bits[INPUT_PROP_CNT / 8]; local
52 res = ioctl(fd, EVIOCGPROP(sizeof(bits)), bits);
60 if (bits[i] & 1 << j) {
77 uint8_t *bits = NULL; local
89 res = ioctl(fd, EVIOCGBIT(i, bits_size), bits);
93 bits = realloc(bits, bits_size * 2);
94 if(bits == NULL) {
102 res2 = ioctl(fd, EVIOCGKEY(res), bits + bits_size)
    [all...]
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/
FloatTest.java 175 int bits = Float.floatToIntBits(f); local
176 float r = Float.intBitsToFloat(bits);
186 assertTrue("Wrong raw bits", Float.floatToRawIntBits(f) == i);
224 int bits = Float.floatToIntBits(f); local
225 float r = Float.intBitsToFloat(bits);
    [all...]
  /external/blktrace/
blkiomon.c 362 int bits = BLK_TC_WRITE | BLK_TC_READ | BLK_TC_FS | BLK_TC_PC; local
363 return a & (BLK_TC_ACT(bits));
  /external/bluetooth/bluez/sbc/
sbc.c 30 for high and low bytes) fill bitpool by 16 bits instead of one at a time in
31 bits allocation/bitpool generation port to the dsp
80 /* only the lower 4 bits of every element are to be used */
100 * Calculates the CRC-8 of the first len bits in data
159 * Code straight from the spec to calculate the bits array
160 * Takes a pointer to the frame in question, a pointer to the bits array and
164 const struct sbc_frame *frame, int (*bits)[8], int subbands)
221 bits[ch][sb] = 0;
223 bits[ch][sb] = bitneed[ch][sb] - bitslice;
224 if (bits[ch][sb] > 16
389 int bits[2][8]; \/* bits distribution *\/ local
776 int bits[2][8]; \/* bits distribution *\/ local
    [all...]
  /external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/
X509CertificateObject.java 95 DERBitString bits = DERBitString.getInstance(ASN1Object.fromByteArray(bytes)); local
97 bytes = bits.getBytes();
98 int length = (bytes.length * 8) - bits.getPadBits();
  /external/opencv/otherlibs/highgui/
bitstrm.cpp 101 m_unGetsize = 4; // 32 bits
396 int RLBitStream::Get( int bits )
399 int new_bit_idx = bit_idx + bits;
403 assert( (unsigned)bits < 32 );
412 ((current[1] <<-bit_idx) & mask)) & bs_bit_mask[bits];
415 int RLBitStream::Show( int bits )
418 int new_bit_idx = bit_idx + bits;
422 assert( (unsigned)bits < 32 );
431 ((current[1] <<-bit_idx) & mask)) & bs_bit_mask[bits];
506 int RMBitStream::Get( int bits )
595 int bits; member in struct:__anon8893
    [all...]
  /external/openssl/crypto/engine/
eng_cryptodev.c 898 ssize_t bytes, bits; local
904 bits = BN_num_bits(a);
905 bytes = (bits + 7) / 8;
913 crp->crp_nbits = bits;
    [all...]
  /external/protobuf/gtest/include/gtest/internal/
gtest-internal.h 322 // For float, there are 8 exponent bits and 23 fraction bits.
324 // For double, there are 11 exponent bits and 52 fraction bits.
337 typedef typename TypeWithSize<sizeof(RawType)>::UInt Bits;
341 // # of bits in a number.
344 // # of fraction bits in a number.
348 // # of exponent bits in a number.
352 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1)
402 const Bits &bits() const { return u_.bits_; } function in class:testing::internal::FloatingPoint
    [all...]
  /external/qemu/audio/
audio_int.h 59 int bits; member in struct:audio_pcm_info
  /external/qemu/distrib/zlib-1.2.3/
trees.c 47 /* Bit length codes must not exceed MAX_BL_BITS bits */
53 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
56 /* repeat a zero length 3-10 times (3 bits of repeat count) */
59 /* repeat a zero length 11-138 times (7 bits of repeat count) */
61 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
77 /* Number of bits used within bi_buf. (bi_buf might be implemented on
78 * more than 16 bits on some systems.)
99 * 5 bits.
243 int bits; \/* bit counter *\/ local
502 int bits; \/* bit length *\/ local
584 int bits; \/* bit index *\/ local
    [all...]
  /external/qemu/hw/
goldfish_fb.c 139 uint8_t bits; member in struct:__anon10071
168 printf(" bits/pixel: %d\n", pf->bits_per_pixel);
171 printf(" red: bits=%d mask=0x%x shift=%d max=0x%x\n",
173 printf(" green: bits=%d mask=0x%x shift=%d max=0x%x\n",
175 printf(" blue: bits=%d mask=0x%x shift=%d max=0x%x\n",
177 printf(" alpha: bits=%d mask=0x%x shift=%d max=0x%x\n",
185 if (pf->bits_per_pixel == fbc->bits &&
266 * used to speed-up the check using the VGA dirty bits. In practice
288 * use the VGA dirty bits table to speed up the detection of
434 /* Always clear the dirty VGA bits */
    [all...]
  /external/qemu/telephony/
gsm.c 803 int bits; member in struct:__anon10270
814 writer->bits = shift;
825 writer->pad |= (unsigned)(value << writer->bits);
826 writer->bits += 7;
827 if (writer->bits >= 8) {
829 writer->bits -= 8;
839 if (writer->bits > 0) {
842 writer->bits = 0;

Completed in 2625 milliseconds

<<11121314151617