/art/runtime/arch/riscv64/ |
D | instruction_set_features_riscv64.cc | 54 uint32_t bits = kExtGeneric; in FromCppDefines() local 56 bits |= kExtCompressed; in FromCppDefines() 59 bits |= kExtVector; in FromCppDefines() 62 bits |= kExtZba; in FromCppDefines() 65 bits |= kExtZbb; in FromCppDefines() 68 bits |= kExtZbs; in FromCppDefines() 70 return FromBitmap(bits); in FromCppDefines() 124 uint32_t bits = bits_; in AddFeaturesFromSplitString() local 129 bits = 0; in AddFeaturesFromSplitString() 133 bits |= ext_bit; in AddFeaturesFromSplitString() [all …]
|
D | instruction_set_features_riscv64.h | 95 explicit Riscv64InstructionSetFeatures(uint32_t bits) : InstructionSetFeatures(), bits_(bits) {} in Riscv64InstructionSetFeatures() argument
|
/art/test/708-jit-cache-churn/src/ |
D | JitCacheChurnTest.java | 137 int bits = i; in $noinline$Call() local 138 bits = ((bits >>> 1) & 0x55555555) | ((bits << 1) & 0x55555555); in $noinline$Call() 139 bits = ((bits >>> 2) & 0x33333333) | ((bits << 2) & 0x33333333); in $noinline$Call() 140 bits = ((bits >>> 4) & 0x0f0f0f0f) | ((bits << 4) & 0x0f0f0f0f); in $noinline$Call() 141 bits = ((bits >>> 8) & 0x00ff00ff) | ((bits << 8) & 0x00ff00ff); in $noinline$Call() 142 bits = (bits >>> 16) | (bits << 16); in $noinline$Call() 143 sum += bits; in $noinline$Call()
|
/art/libartbase/base/ |
D | bit_utils.h | 267 constexpr T GetIntLimit(size_t bits) { in GetIntLimit() argument 268 DCHECK_NE(bits, 0u); in GetIntLimit() 269 DCHECK_LT(bits, BitSizeOf<T>()); in GetIntLimit() 270 return static_cast<T>(1) << (bits - 1); in GetIntLimit() 314 constexpr T MaxInt(size_t bits) { in MaxInt() argument 315 DCHECK(std::is_unsigned_v<T> || bits > 0u) << "bits cannot be zero for signed."; in MaxInt() 316 DCHECK_LE(bits, BitSizeOf<T>()); in MaxInt() 318 return bits == BitSizeOf<T>() in MaxInt() 321 ? ((bits == 1u) ? 0 : static_cast<T>(MaxInt<unsigned_type>(bits - 1))) in MaxInt() 322 : static_cast<T>(UINT64_C(1) << bits) - static_cast<T>(1); in MaxInt() [all …]
|
D | bit_utils_iterator.h | 49 explicit BitIteratorBase(T bits) : bits_(bits) { } in BitIteratorBase() argument 105 IterationRange<LowToHighBitIterator<T>> LowToHighBits(T bits) { in LowToHighBits() argument 107 LowToHighBitIterator<T>(bits), LowToHighBitIterator<T>()); in LowToHighBits() 111 IterationRange<HighToLowBitIterator<T>> HighToLowBits(T bits) { in HighToLowBits() argument 113 HighToLowBitIterator<T>(bits), HighToLowBitIterator<T>()); in HighToLowBits()
|
D | bit_vector_test.cc | 101 uint32_t bits[kWords]; in TEST() local 102 memset(bits, 0, sizeof(bits)); in TEST() 104 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits); in TEST() 107 EXPECT_EQ(bits, bv.GetRawStorage()); in TEST() 158 uint32_t bits[kWords]; in TEST() local 159 memset(bits, 0, sizeof(bits)); in TEST() 161 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits); in TEST()
|
D | stats.h | 38 void AddBits(double bits, size_t count = 1) { Add(bits / kBitsPerByte, count); }
|
D | bit_vector.h | 144 static constexpr uint32_t BitsToWords(uint32_t bits) { in BitsToWords() argument 145 return RoundUp(bits, kWordBits) / kWordBits; in BitsToWords()
|
/art/test/660-store-8-16/ |
D | info.txt | 2 used to crash on 8bits / 16bits immediate stores when the Java
|
/art/runtime/ |
D | art_field-inl.h | 281 JValue bits; in GetFloat() local 282 bits.SetI(Get32(object)); in GetFloat() 283 return bits.GetF(); in GetFloat() 289 JValue bits; in SetFloat() local 290 bits.SetF(f); in SetFloat() 291 Set32<kTransactionActive>(object, bits.GetI()); in SetFloat() 296 JValue bits; in GetDouble() local 297 bits.SetJ(Get64(object)); in GetDouble() 298 return bits.GetD(); in GetDouble() 304 JValue bits; in SetDouble() local [all …]
|
D | monitor_inflation.md | 25 pointer, except for some shifting and masking to avoid collisions with a few bits in the lock word 27 don't have enough bits in the lock word to store a 64-bit pointer. 29 In the 64-bit case, `Monitor`s are stored in "chunks" of 4K bytes. The bottom bits of a 30 `MonitorId` are the index of the `Monitor` within its chunk. The remaining bits are used to find 36 really triangular.) The high bits of a `MonitorId` are interpreted as row- and column-indices into
|
/art/tools/hiddenapi/ |
D | README.md | 31 Two bits of information are encoded in the DEX access flags. These are encoded 35 First bit is encoded as the inversion of visibility access flags (bits 2:0). 36 At most one of these flags can be set at any given time. Inverting these bits 37 therefore produces a value where at least two bits are set and there is never 42 LEB128 encoding. The following bits are used:
|
/art/runtime/oat/ |
D | stack_map.cc | 141 uint32_t bits = mask.LoadBits(reg, std::min<uint32_t>(end - reg, kNumBits)); in DecodeDexRegisterMap() local 142 while (bits != 0) { in DecodeDexRegisterMap() 143 uint32_t bit = CTZ(bits); in DecodeDexRegisterMap() 149 bits ^= 1u << bit; // Clear the bit. in DecodeDexRegisterMap() 232 BitMemoryRegion bits = table.GetBitMemoryRegion(r, c); in Dump() local 233 for (size_t b = 0, e = bits.size_in_bits(); b < e; b++) { in Dump() 234 vios->Stream() << bits.LoadBit(e - b - 1); in Dump()
|
/art/test/577-checker-fp2int/ |
D | info.txt | 1 Unit test for float/double to raw bits conversions.
|
/art/test/436-shift-constant/ |
D | info.txt | 1 Regression tests for shift instructions and constants larger than 8bits.
|
/art/test/583-checker-zero/ |
D | info.txt | 1 Regression test for optimizing that used to think 0.0 has the same bits
|
/art/test/817-hiddenapi/ |
D | info.txt | 1 Test that even if hiddenapi bits are not propagated up the hierarchy, the
|
/art/test/419-long-parameter/ |
D | info.txt | 2 on 32bits architectures. The move to hard float ABI makes it so that the
|
/art/runtime/arch/arm/ |
D | asm_support_arm.S | 375 @ (thread id, count of 0 and preserved read barrier bits), 378 ands ip, \tmp2, #LOCK_WORD_GC_STATE_MASK_SHIFTED_TOGGLED @ Test the non-gc bits. 380 @ unlocked case - store tmp3: original lock word plus thread id, preserved read barrier bits. 393 cbnz \tmp3, \slow_lock @ if either of the top two bits are set, or the lock word's 450 @ strex necessary for read barrier bits.
|
/art/test/670-bitstring-type-check/ |
D | generate-sources | 57 // less bits for the level 1 character. 1025 classes at level 2 similarly guarantees 58 // an overflow if the number of bits for level 2 character is 10 or less. To test
|
/art/libdexfile/dex/ |
D | dex_file_verifier_test.cc | 803 uint32_t bits = POPCOUNT(kInterfaceDisallowed); in TEST_F() local 804 for (uint32_t i = 1; i < (1u << bits); ++i) { in TEST_F() 953 uint32_t bits = POPCOUNT(kAccFlags); in TEST_F() local 954 for (uint32_t j = 1; j < (1u << bits); ++j) { in TEST_F() 1163 uint32_t bits = POPCOUNT(kInterfaceDisallowed); in TEST_F() local 1164 for (uint32_t i = 1; i < (1u << bits); ++i) { in TEST_F()
|
/art/build/apex/ |
D | art_apex_test.py | 190 bits = (zipinfo.external_attr >> 16) & 0xFFFF 191 is_dir = get_octal(bits, 4) == 4 192 is_symlink = get_octal(bits, 4) == 2 193 is_exec = bits_is_exec(bits)
|
/art/test/510-checker-try-catch/smali/ |
D | Runtime.smali | 60 # The sum of the low and high 32 bits treated as integers is returned to prove 253 # to the location of the catch phi. The sum of the low and high 32 bits treated 347 # Values were chosen so that all 64 bits are used. 439 # and returned. Values were chosen so that all 64 bits are used.
|
/art/disassembler/ |
D | disassembler_riscv64.cc | 158 static constexpr int32_t SignExtendBits(uint32_t bits) { in SignExtendBits() argument 160 const uint32_t sign_bit = (bits >> kWidth) & 1u; in SignExtendBits() 161 return static_cast<int32_t>(bits) - static_cast<int32_t>(sign_bit << kWidth); in SignExtendBits() 171 const T bits = in Decode16Imm6() local 173 const T checked_bits = dchecked_integral_cast<T>(bits); in Decode16Imm6()
|
/art/runtime/interpreter/mterp/x86_64ng/ |
D | other.S | 6 movl 2(rPC), %eax # grab all 32 bits at once
|