OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kBitsPerByte
(Results
1 - 25
of
62
) sorted by null
1
2
3
/art/runtime/
memory_region_test.cc
31
+ (2u <<
kBitsPerByte
)
32
+ (3u << 2 *
kBitsPerByte
)
33
+ (4u << 3 *
kBitsPerByte
),
35
ASSERT_EQ(5 + (6 <<
kBitsPerByte
), region.LoadUnaligned<int16_t>(5));
45
region.StoreUnaligned<int16_t>(1, 6 + (5 <<
kBitsPerByte
));
48
+ (3u <<
kBitsPerByte
)
49
+ (2u << 2 *
kBitsPerByte
)
50
+ (1u << 3 *
kBitsPerByte
));
65
for (size_t bit_offset = 0; bit_offset < 2 *
kBitsPerByte
; ++bit_offset) {
66
for (size_t length = 0; length < 2 *
kBitsPerByte
; ++length)
[
all
...]
bit_memory_region.h
30
bit_start_ = bit_offset %
kBitsPerByte
;
31
const size_t start = bit_offset /
kBitsPerByte
;
32
const size_t end = (bit_offset + bit_size +
kBitsPerByte
- 1) /
kBitsPerByte
;
memory_region.cc
43
// How many remaining bits in current byte is (bit_offset %
kBitsPerByte
) + 1.
47
uintptr_t bit_remainder = bit_offset %
kBitsPerByte
;
49
const uintptr_t remaining_bits =
kBitsPerByte
- bit_remainder;
globals.h
32
static constexpr size_t
kBitsPerByte
= 8;
34
static constexpr int kBitsPerIntPtrT = sizeof(intptr_t) *
kBitsPerByte
;
memory_region.h
49
size_t size_in_bits() const { return size_ *
kBitsPerByte
; }
87
*ComputeInternalPointer<uint8_t>(offset + i) << (i *
kBitsPerByte
);
102
(equivalent_unsigned_integer_value >> (i *
kBitsPerByte
)) & 0xFF;
140
const uint8_t* address = begin() + bit_offset /
kBitsPerByte
;
141
const uint32_t shift = bit_offset & (
kBitsPerByte
- 1);
205
uintptr_t bit_remainder = (bit_offset & (
kBitsPerByte
- 1));
stack_map.h
531
GetLocationMappingDataOffset(number_of_dex_registers) *
kBitsPerByte
;
561
GetLocationMappingDataOffset(number_of_dex_registers) *
kBitsPerByte
;
572
size_t live_bit_mask_offset_in_bits = GetLiveBitMaskOffset() *
kBitsPerByte
;
579
size_t live_bit_mask_offset_in_bits = GetLiveBitMaskOffset() *
kBitsPerByte
;
600
return RoundUp(number_of_dex_registers,
kBitsPerByte
) /
kBitsPerByte
;
612
return RoundUp(location_mapping_data_size_in_bits,
kBitsPerByte
) /
kBitsPerByte
;
[
all
...]
obj_ptr.h
37
sizeof(kHeapReferenceSize) *
kBitsPerByte
- kObjectAlignmentShift;
38
static constexpr size_t kCookieBits = sizeof(uintptr_t) *
kBitsPerByte
- kCookieShift;
utils.h
206
return ((bitmap[idx /
kBitsPerByte
] >> (idx %
kBitsPerByte
)) & 0x01) != 0;
/art/runtime/base/
bit_field.h
36
static_assert(position < sizeof(uintptr_t) *
kBitsPerByte
, "Invalid position.");
38
static_assert(size <= sizeof(uintptr_t) *
kBitsPerByte
, "Invalid size.");
39
static_assert(size + position <= sizeof(uintptr_t) *
kBitsPerByte
, "Invalid position + size.");
bit_vector.h
261
DCHECK_LE(static_cast<size_t>(GetHighestBitSet() + 1), len *
kBitsPerByte
);
/external/v8/src/
safepoint-table.cc
19
DCHECK(IsAligned(kNumSafepointRegisters,
kBitsPerByte
));
32
int bit_index = reg_index & (
kBitsPerByte
- 1);
70
DCHECK(IsAligned(kNumSafepointRegisters,
kBitsPerByte
));
73
for (int i = first; i < last; i++) PrintBits(os, bits[i],
kBitsPerByte
);
74
int last_bits = code_->stack_slots() - ((last - first) *
kBitsPerByte
);
90
DCHECK(digits >= 0 && digits <=
kBitsPerByte
);
149
RoundUp(bits_per_entry,
kBitsPerByte
) >> kBitsPerByteLog2;
172
DCHECK(IsAligned(kNumSafepointRegisters,
kBitsPerByte
));
183
int bit_index = index & (
kBitsPerByte
- 1);
192
int bit_index = index & (
kBitsPerByte
- 1)
[
all
...]
source-position-table.cc
53
static const int kShift = sizeof(T) *
kBitsPerByte
- 1;
assembler.cc
290
const int kShortDataBits =
kBitsPerByte
- kShortDataTypeTagBits;
297
const int kSmallPCDeltaBits =
kBitsPerByte
- kTagBits;
426
number = number >>
kBitsPerByte
;
435
data_delta = data_delta >>
kBitsPerByte
;
517
x |= static_cast<int>(*--pos_) << i *
kBitsPerByte
;
527
x |= static_cast<int>(*--pos_) << i *
kBitsPerByte
;
536
x |= static_cast<intptr_t>(*--pos_) << i *
kBitsPerByte
;
[
all
...]
/external/vixl/src/aarch64/
abi-aarch64.h
107
return GenericOperand(FPRegister(NSRN_++, size *
kBitsPerByte
));
121
return GenericOperand(Register(NGRN_++, operand_size *
kBitsPerByte
));
/art/compiler/optimizing/
intrinsics.h
176
DCHECK_LT(bit, sizeof(uint32_t) *
kBitsPerByte
);
181
DCHECK_LT(bit, sizeof(uint32_t) *
kBitsPerByte
);
stack_map_stream.cc
93
(current_dex_register_ % (sizeof(DexRegisterMapEntry::hash) *
kBitsPerByte
)));
209
RoundUp(map_entries_size_in_bits,
kBitsPerByte
) /
kBitsPerByte
;
419
size_t stack_mask_bytes = RoundUp(stack_mask_bits,
kBitsPerByte
) /
kBitsPerByte
;
582
const size_t byte_entry_size = RoundUp(entry_size_in_bits,
kBitsPerByte
) /
kBitsPerByte
;
/external/v8/src/interpreter/
constant-array-builder.h
36
static const size_t k8BitCapacity = 1u <<
kBitsPerByte
;
39
static const size_t k16BitCapacity = (1u << 2 *
kBitsPerByte
) - k8BitCapacity;
/art/runtime/gc/accounting/
bitmap.h
102
static constexpr size_t kBitsPerBitmapWord = sizeof(uintptr_t) *
kBitsPerByte
;
card_table-inl.h
40
const size_t shift_in_bits = shift_in_bytes *
kBitsPerByte
;
space_bitmap.cc
42
return bitmap_bytes *
kBitsPerByte
* kAlignment;
/external/vixl/src/
globals-vixl.h
72
const int
kBitsPerByte
= 8;
/external/webrtc/webrtc/modules/desktop_capture/
window_capturer_x11.cc
43
const int
kBitsPerByte
= 8;
55
if (sizeof(PropertyType) *
kBitsPerByte
!= actual_format) {
/external/v8/src/regexp/
interpreter-irregexp.cc
291
(subject[pos] | (next << (
kBitsPerByte
* sizeof(Char))));
299
current_char = (subject[pos] | (next << (
kBitsPerByte
* sizeof(Char))));
439
int bit = (current_char & (
kBitsPerByte
- 1));
regexp-macro-assembler-irregexp.cc
363
for (int i = 0; i < kTableSize; i +=
kBitsPerByte
) {
365
for (int j = 0; j <
kBitsPerByte
; j++) {
/art/runtime/jit/
profile_compilation_info.h
421
bitmap_storage.resize(RoundUp(num_bits,
kBitsPerByte
) /
kBitsPerByte
);
Completed in 1212 milliseconds
1
2
3