| /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_iterator.h | 44 explicit BitIteratorBase(T bits) : bits_(bits) { } in BitIteratorBase() argument
100 IterationRange<LowToHighBitIterator<T>> LowToHighBits(T bits) { in LowToHighBits() argument
102 LowToHighBitIterator<T>(bits), LowToHighBitIterator<T>()); in LowToHighBits()
106 IterationRange<HighToLowBitIterator<T>> HighToLowBits(T bits) { in HighToLowBits() argument
108 HighToLowBitIterator<T>(bits), HighToLowBitIterator<T>()); in HighToLowBits()
|
| D | bit_utils.h | 258 constexpr T GetIntLimit(size_t bits) { in GetIntLimit() argument
259 DCHECK_NE(bits, 0u); in GetIntLimit()
260 DCHECK_LT(bits, BitSizeOf<T>()); in GetIntLimit()
261 return static_cast<T>(1) << (bits - 1); in GetIntLimit()
305 constexpr T MaxInt(size_t bits) { in MaxInt() argument
306 DCHECK(std::is_unsigned<T>::value || bits > 0u) << "bits cannot be zero for signed."; in MaxInt()
307 DCHECK_LE(bits, BitSizeOf<T>()); in MaxInt()
309 return bits == BitSizeOf<T>() in MaxInt()
312 ? ((bits == 1u) ? 0 : static_cast<T>(MaxInt<unsigned_type>(bits - 1))) in MaxInt()
313 : static_cast<T>(UINT64_C(1) << bits) - static_cast<T>(1); in MaxInt()
[all …]
|
| D | bit_vector_test.cc | 71 uint32_t bits[kWords]; in TEST() local
72 memset(bits, 0, sizeof(bits)); in TEST()
74 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits); in TEST()
77 EXPECT_EQ(bits, bv.GetRawStorage()); in TEST()
128 uint32_t bits[kWords]; in TEST() local
129 memset(bits, 0, sizeof(bits)); in TEST()
131 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits); in TEST()
|
| D | stats.h | 35 void AddBits(double bits, size_t count = 1) { Add(bits / kBitsPerByte, count); }
|
| D | bit_vector.h | 132 static constexpr uint32_t BitsToWords(uint32_t bits) { in BitsToWords() argument
133 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 | 237 JValue bits; in GetFloat() local
238 bits.SetI(Get32(object)); in GetFloat()
239 return bits.GetF(); in GetFloat()
245 JValue bits; in SetFloat() local
246 bits.SetF(f); in SetFloat()
247 Set32<kTransactionActive>(object, bits.GetI()); in SetFloat()
252 JValue bits; in GetDouble() local
253 bits.SetJ(Get64(object)); in GetDouble()
254 return bits.GetD(); in GetDouble()
260 JValue bits; in SetDouble() local
[all …]
|
| D | stack_map.cc | 160 uint32_t bits = mask.LoadBits(reg, std::min<uint32_t>(end - reg, kNumBits)); in DecodeDexRegisterMap() local
161 while (bits != 0) { in DecodeDexRegisterMap()
162 uint32_t bit = CTZ(bits); in DecodeDexRegisterMap()
168 bits ^= 1u << bit; // Clear the bit. in DecodeDexRegisterMap()
255 BitMemoryRegion bits = table.GetBitMemoryRegion(r, c); in Dump() local
256 for (size_t b = 0, e = bits.size_in_bits(); b < e; b++) { in Dump()
257 vios->Stream() << bits.LoadBit(e - b - 1); in Dump()
|
| /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/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/419-long-parameter/ |
| D | info.txt | 2 on 32bits architectures. The move to hard float ABI makes it so that the
|
| /art/build/apex/ |
| D | art_apex_test.py | 98 bits = comps[2]
100 if len(bits) != 6:
101 logging.warning('Dont understand bits \'%s\'', bits)
103 is_dir = bits[1] == '4'
108 is_exec = is_exec_bit(bits[3]) and is_exec_bit(bits[4]) and is_exec_bit(bits[5])
109 is_symlink = bits[1] == '2'
171 bits = (zipinfo.external_attr >> 16) & 0xFFFF
172 is_dir = get_octal(bits, 4) == 4
173 is_symlink = get_octal(bits, 4) == 2
174 is_exec = bits_is_exec(bits)
|
| /art/runtime/interpreter/mterp/mips/ |
| D | object.S | 72 $load a0, 0(t0) # a0 <- obj.field (8/16/32 bits)
|
| /art/test/670-bitstring-type-check/ |
| D | build | 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/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/runtime/interpreter/mterp/x86_64/ |
| D | other.S | 25 movl 2(rPC), %eax # grab all 32 bits at once
|
| /art/runtime/arch/mips64/ |
| D | quick_entrypoints_mips64.S | 1256 # Unlocked case - $t1: original lock word that's zero except for the read barrier bits.
1257 …t2, $t1, $t0 # $t2 holds thread id with count of 0 with preserved read barrier bits
1263 # $t1: original lock word, $t0: thread_id with count of 0 and zero read barrier bits
1265 bnezc $t2, .Lslow_lock # if either of the top two bits are set, go slow path
1267 andi $t2, $t2, 0xFFFF # zero top 16 bits
1318 and $t2, $t1, $t3 # zero the gc bits
1322 and $t2, $t1, $t2 # $t2: zero except for the preserved gc bits
1887 dsrl $a3, $a3, PRIMITIVE_TYPE_SIZE_SHIFT_SHIFT # Component size shift is in high 16 bits.
2505 and $at, $at, $t9 # Sign bit = 1 IFF both bits are 1.
|
| /art/runtime/interpreter/mterp/x86/ |
| D | other.S | 29 movl 2(rPC), %eax # grab all 32 bits at once
|
| /art/runtime/interpreter/mterp/arm/ |
| D | object.S | 158 ldrd r0, [r3, ip] @ r0<- obj.field (64 bits, aligned)
|
| /art/runtime/arch/arm/ |
| D | quick_entrypoints_arm.S | 697 @ (thread id, count of 0 and preserved read barrier bits),
700 ands ip, r2, #LOCK_WORD_GC_STATE_MASK_SHIFTED_TOGGLED @ Test the non-gc bits.
702 @ unlocked case - store r3: original lock word plus thread id, preserved read barrier bits.
713 cbnz r3, .Lslow_lock @ if either of the top two bits are set, or the lock word's
783 strex r2, r3, [r0, #MIRROR_OBJECT_LOCK_WORD_OFFSET] @ strex necessary for read barrier bits.
|
| /art/runtime/interpreter/mterp/mips64/ |
| D | arithmetic.S | 299 GET_VREG a0, a3 # a0 <- vB (sign-extended to 64 bits)
|