| /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) {
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| hard-reg-set.h | 29 and it has enough bits to represent all the target machine's hard
505 HARD_REG_ELT_TYPE bits; member in struct:__anon33676
526 iter->bits = iter->pelt[iter->word_no];
527 iter->bits >>= min % HARD_REG_ELT_BITS;
530 min += !iter->bits;
544 if (iter->bits)
547 while (!(iter->bits & 1))
549 iter->bits >>= 1;
562 iter->bits = iter->pelt[iter->word_no];
563 if (iter->bits)
[all...] |
| /system/bt/embdrv/sbc/decoder/include/ |
| oi_codec_sbc.h | 168 } bits; member in struct:__anon69218
423 @return the approximate bit rate in bits per second,
|
| /system/core/libpixelflinger/codeflinger/ |
| texturing.cpp | 139 const int bits = parts.iterated.size(); local
140 const uint32_t size = ((bits>=32) ? 0 : (1LU << bits)) - 1;
169 mask, bits);
278 tmu.bits = tmu.format.size*8;
347 txPtr.setTo(obtainReg(), tmu.bits);
484 // for 8-bits textures, we can afford
485 // 7 bits of fractional precision at no
486 // additional cost (we can't do 8 bits
487 // because filter8 uses signed 16 bits muls
[all...] |
| /system/core/libpixelflinger/include/pixelflinger/ |
| format.h | 101 inline uint32_t bits(int i) const { function in struct:__anon69971
|
| /system/core/toolbox/ |
| getevent.c | 64 uint8_t bits[INPUT_PROP_CNT / 8]; local
71 res = ioctl(fd, EVIOCGPROP(sizeof(bits)), bits);
79 if (bits[i] & 1 << j) {
96 uint8_t *bits = NULL; local
108 res = ioctl(fd, EVIOCGBIT(i, bits_size), bits);
112 bits = realloc(bits, bits_size * 2);
113 if(bits == NULL) {
121 res2 = ioctl(fd, EVIOCGKEY(res), bits + bits_size)
[all...] |
| /frameworks/data-binding/prebuilds/1.0-rc0/ |
| databinding-baseLibrary.jar | |
| /art/compiler/dex/quick/arm/ |
| target_arm.cc | 331 uint32_t bits = value & 0xff; local
334 return bits;
336 return (bits << 16) | bits;
338 return (bits << 24) | (bits << 8);
340 return (bits << 24) | (bits << 16) | (bits << 8) | bits;
[all...] |
| /art/compiler/dex/quick/arm64/ |
| target_arm64.cc | 289 // An integer is constructed from the n, imm_s and imm_r bits according to
299 // (s bits must not be all set)
301 // A pattern is constructed of size bits, where the least significant S+1
302 // bits are set. The pattern is rotated right by R, and repeated across a
307 uint64_t bits = bit_mask(imm_s + 1); local
308 return RotateRight(bits, imm_r, 64);
315 uint64_t bits = bit_mask((imm_s & mask) + 1); local
316 return RepeatBitsAcrossReg(is_wide, RotateRight(bits, imm_r & mask, width), width);
570 /* Memory bits */
|
| utility_arm64.cc | 28 int32_t Arm64Mir2Lir::EncodeImmSingle(uint32_t bits) {
37 // bits[19..0] are cleared.
38 if ((bits & 0x0007ffff) != 0)
41 // bits[29..25] are all set or all cleared.
42 uint32_t b_pattern = (bits >> 16) & 0x3e00;
47 if (((bits ^ (bits << 1)) & 0x40000000) == 0)
50 // bits: aBbb.bbbc.defg.h000.0000.0000.0000.0000
52 uint32_t bit7 = ((bits >> 31) & 0x1) << 7;
54 uint32_t bit6 = ((bits >> 29) & 0x1) << 6
97 uint32_t bits = opcode_is_wide ? encoder->xskeleton : encoder->wskeleton; local
[all...] |
| /external/aac/libMpegTPDec/src/ |
| tpdec_lib.cpp | 321 needs a number 2^x. So we assume the maximum of 48 channels with 6144 bits per channel
398 /* For ELD and other payloads there is an unknown amount of padding, so ignore unread bits, but
399 throw an error only if too many bits where read. */
451 * \param bitsAvail the amount of available bits at the end of the first frame to be decoded.
561 /* Reset CRC because the next bits are the beginning of a raw_data_block() */
656 /* How many bits to advance for synchronization search. */
677 INT syncLength; /* Length of sync word in bits */
710 INT bitsAvail = 0; /* Bits available in bitstream buffer */
711 INT checkLengthBits; /* Helper to check remaining bits and buffer boundaries */
795 int bits; local
1126 INT bits; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| BitSet.java | 43 * is no way to access the internal bits (which I need for speed)
45 * Consider defining set degree. Without access to the bits, I must
49 * than this.bits.length.
54 protected final static int BITS = 64; // number of bits / long
62 protected final static int MOD_MASK = BITS - 1;
64 /** The actual data bits */
65 protected long bits[]; field in class:BitSet
67 /** Construct a bitset of size one word (64 bits) */
69 this(BITS);
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
| BigFraction.java | 155 * double value exactly, considering its internal bits representation.
180 final long bits = Double.doubleToLongBits(value); local
181 final long sign = bits & 0x8000000000000000L;
182 final long exponent = bits & 0x7ff0000000000000L;
183 long m = bits & 0x000fffffffffffffL;
[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/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/x509/ |
| X509CertificateObject.java | 106 DERBitString bits = DERBitString.getInstance(ASN1Primitive.fromByteArray(bytes)); local
108 bytes = bits.getBytes();
109 int length = (bytes.length * 8) - bits.getPadBits();
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| X509CertificateObject.java | 107 DERBitString bits = DERBitString.getInstance(ASN1Primitive.fromByteArray(bytes)); local
109 bytes = bits.getBytes();
110 int length = (bytes.length * 8) - bits.getPadBits();
|
| /external/deqp/modules/gles2/functional/ |
| es2fPolygonOffsetTests.cpp | 1209 int bits; member in struct:deqp::gles2::Functional::DepthBufferFormat
[all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fPolygonOffsetTests.cpp | 1212 int bits; member in struct:deqp::gles3::Functional::DepthBufferFormat
[all...] |
| es3fShaderPrecisionTests.cpp | 24 * floatBitsToUint() in shader to write out floating-point value bits.
310 // If 32-bit reference value is used, 2 bits of rounding error must be allowed.
312 // For mediump and lowp types the comparison currently allows 3 bits of rounding error:
313 // two bits from conversions and one from actual operation.
328 m_testCtx.getLog() << TestLog::Message << "Assuming " << mantissaBits << " mantissa bits, " << numLostBits << " bits lost in operation, and " << roundingUlpError << " ULP rounding error."
332 const deUint64 refBits = tcu::Float64(reference).bits();
333 const deUint64 resBits = tcu::Float64(result).bits();
340 m_testCtx.getLog() << TestLog::Message << "ERROR: comparison failed! ULP diff (ignoring lost/undefined bits) = " << ulpDiff << TestLog::EndMessage;
392 << "in0 = " << in0 << " / " << tcu::toHex(tcu::Float32(in0).bits())
907 int bits; member in struct:deqp::gles3::Functional::__anon7705
933 int bits; member in struct:deqp::gles3::Functional::__anon7706
[all...] |
| /external/deqp/modules/glshared/ |
| glsTextureBufferCase.cpp | 83 deUint8 extend2BitsToByte (deUint8 bits)
87 DE_ASSERT((bits & (~0x03u)) == 0);
89 x |= bits << 6;
90 x |= bits << 4;
91 x |= bits << 2;
92 x |= bits;
99 const deUint8 bits = 2; local
100 const deUint8 bitMask = deUint8((0x1u << bits) - 1);
[all...] |
| /external/elfutils/src/tests/ |
| varlocs.c | 91 Dwarf_Word bits; local
93 && dwarf_formudata (&bsize, &bits) == 0)
94 bits *= 8;
96 || dwarf_formudata (&bsize, &bits) != 0)
102 bits,
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| HashCodeTest.java | 346 byte[] bb = new byte[hash.bits() / 8];
371 assertTrue(hashCode.bits() >= 32); // sanity
373 int totalBytes = hashCode.bits() / 8;
|
| /external/iproute2/lib/ |
| utils.c | 49 unsigned bits = 0; local
58 ++bits;
59 return bits;
456 int inet_addr_match(const inet_prefix *a, const inet_prefix *b, int bits)
460 int words = bits >> 0x05;
462 bits &= 0x1f;
468 if (bits) {
475 mask = htonl((0xffffffff) << (0x20 - bits));
|
| /external/jemalloc/include/jemalloc/internal/ |
| arena.h | 110 size_t bits; member in struct:arena_chunk_map_bits_s
631 return (&arena_bitselm_get(chunk, pageind)->bits);
[all...] |
