| /art/libartbase/base/ |
| D | bit_vector-inl.h | 28 inline bool BitVector::IndexIterator::operator==(const IndexIterator& other) const {
34 inline uint32_t BitVector::IndexIterator::operator*() const {
39 inline BitVector::IndexIterator& BitVector::IndexIterator::operator++() {
45 inline BitVector::IndexIterator BitVector::IndexIterator::operator++(int) {
51 inline uint32_t BitVector::IndexIterator::FindIndex(uint32_t start_index) const { in FindIndex()
70 inline BitVector::IndexIterator::IndexIterator(const BitVector* bit_vector, begin_tag) in IndexIterator()
75 inline BitVector::IndexIterator::IndexIterator(const BitVector* bit_vector, end_tag) in IndexIterator()
80 inline BitVector::IndexIterator BitVector::IndexContainer::begin() const { in begin()
84 inline BitVector::IndexIterator BitVector::IndexContainer::end() const { in end()
88 inline void BitVector::ClearAllBits() { in ClearAllBits()
[all …]
|
| D | bit_vector.h | 38 class BitVector {
85 IndexIterator(const BitVector* bit_vector, begin_tag);
86 IndexIterator(const BitVector* bit_vector, end_tag);
97 friend class BitVector::IndexContainer;
105 explicit IndexContainer(const BitVector* bit_vector) : bit_vector_(bit_vector) { } in IndexContainer()
111 const BitVector* const bit_vector_;
116 BitVector(const BitVector& other) = delete;
117 BitVector& operator=(const BitVector& other) = delete;
119 BitVector(BitVector&& other) noexcept in BitVector() function
128 BitVector(uint32_t start_bits,
[all …]
|
| D | bit_vector.cc | 27 BitVector::BitVector(bool expandable, in BitVector() function in art::BitVector
41 BitVector::BitVector(uint32_t start_bits, bool expandable, Allocator* allocator) in BitVector() function in art::BitVector
42 : BitVector(expandable, in BitVector()
47 BitVector::BitVector(const BitVector& src, in BitVector() function in art::BitVector
50 : BitVector(expandable, in BitVector()
58 BitVector::~BitVector() { in ~BitVector()
65 bool BitVector::SameBitsSet(const BitVector *src) const { in SameBitsSet()
91 bool BitVector::IsSubsetOf(const BitVector *other) const { in IsSubsetOf()
117 void BitVector::Intersect(const BitVector* src) { in Intersect()
137 bool BitVector::Union(const BitVector* src) { in Union()
[all …]
|
| D | bit_vector_test.cc | 28 TEST(BitVector, Test) { in TEST() argument
31 BitVector bv(kBits, false, Allocator::GetCallocAllocator()); in TEST()
61 BitVector::IndexIterator iterator = bv.Indexes().begin(); in TEST()
90 TEST(BitVector, MessyAllocator) { in TEST() argument
92 BitVector bv(32, false, &alloc); in TEST()
98 TEST(BitVector, NoopAllocator) { in TEST() argument
104 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits); in TEST()
155 TEST(BitVector, SetInitialBits) { in TEST() argument
161 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits); in TEST()
174 TEST(BitVector, UnionIfNotIn) { in TEST() argument
[all …]
|
| D | arena_bit_vector.cc | 85 : BitVector(start_bits, in ArenaBitVector()
95 : BitVector(start_bits, in ArenaBitVector()
|
| D | arena_bit_vector.h | 33 class ArenaBitVector : public BitVector, public ArenaObject<kArenaAllocGrowableBitMap> {
|
| /art/compiler/optimizing/ |
| D | liveness_test.cc | 36 static void DumpBitVector(BitVector* vector, in DumpBitVector()
62 BitVector* live_in = liveness.GetLiveInSet(*block); in TestCode()
64 BitVector* live_out = liveness.GetLiveOutSet(*block); in TestCode()
66 BitVector* kill = liveness.GetKillSet(*block); in TestCode()
|
| D | ssa_liveness_analysis.cc | 108 BitVector* live_in) { in RecursivelyProcessInputs()
142 BitVector* live_in) { in ProcessEnvironment()
172 BitVector* kill = GetKillSet(*block); in ComputeLiveRanges()
173 BitVector* live_in = GetLiveInSet(*block); in ComputeLiveRanges()
292 BitVector* live_out = GetLiveOutSet(block); in UpdateLiveOut()
305 BitVector* live_out = GetLiveOutSet(block); in UpdateLiveIn()
306 BitVector* kill = GetKillSet(block); in UpdateLiveIn()
307 BitVector* live_in = GetLiveInSet(block); in UpdateLiveIn()
|
| D | stack_map_stream.h | 77 BitVector* sp_mask = nullptr,
145 ScopedArenaVector<BitVector*> lazy_stack_masks_;
|
| D | ssa_liveness_analysis.h | 1187 BitVector* GetLiveInSet(const HBasicBlock& block) const { in GetLiveInSet()
1191 BitVector* GetLiveOutSet(const HBasicBlock& block) const { in GetLiveOutSet()
1195 BitVector* GetKillSet(const HBasicBlock& block) const { in GetKillSet()
1269 BitVector* live_in);
1272 BitVector* live_in);
1297 BitVector* live_in = GetLiveInSet(block); in CheckNoLiveInIrreducibleLoop()
|
| D | register_allocator.cc | 217 BitVector* liveness_of_spill_slot = liveness_of_values[number_of_registers in ValidateIntervals()
241 BitVector* liveness_of_register = liveness_of_values[reg]; in ValidateIntervals()
|
| D | locations.h | 675 BitVector* GetStackMask() const { in GetStackMask()
729 BitVector* stack_mask_;
|
| D | stack_map_stream.cc | 86 BitVector* stack_mask = lazy_stack_masks_[i]; in EndMethod()
111 BitVector* stack_mask, in BeginStackMapEntry()
|
| D | find_loops_test.cc | 114 const BitVector& blocks = info->GetBlocks(); in TestBlock()
|
| D | register_allocation_resolver.cc | 158 BitVector* live = liveness_.GetLiveInSet(*block); in Resolve()
171 BitVector* live = liveness_.GetLiveInSet(*block); in Resolve()
|
| D | optimizing_unit_test.h | 343 BitVector bv(preds.size(), false, Allocator::GetCallocAllocator()); in EnsurePredecessorOrder()
|
| D | stack_map_test.cc | 34 const BitVector& bit_vector) { in CheckStackMask()
|
| /art/dex2oat/linker/ |
| D | oat_writer.h | 41 class BitVector; variable
446 SafeMap<const DexFile*, BitVector> bss_method_entry_references_;
449 SafeMap<const DexFile*, BitVector> bss_type_entry_references_;
452 SafeMap<const DexFile*, BitVector> bss_public_type_entry_references_;
455 SafeMap<const DexFile*, BitVector> bss_package_type_entry_references_;
458 SafeMap<const DexFile*, BitVector> bss_string_entry_references_;
461 SafeMap<const DexFile*, BitVector> bss_method_type_entry_references_;
|
| D | oat_writer.cc | 248 std::unique_ptr<BitVector> method_bitmap_;
796 /*inout*/ SafeMap<const DexFile*, BitVector>* references) { in AddBssReference()
805 BitVector(number_of_indexes, /* expandable */ false, Allocator::GetCallocAllocator())); in AddBssReference()
2022 const BitVector& indexes, in CalculateNumberOfIndexBssMappingEntries()
2042 const BitVector& indexes, in CalculateIndexBssMappingSize()
2053 const BitVector& type_indexes, in CalculateIndexBssMappingSize()
2169 const BitVector& method_indexes = method_it->second; in InitIndexBssMappingsHelper()
2182 const BitVector& type_indexes = type_it->second; in InitIndexBssMappingsHelper()
2190 const BitVector& type_indexes = public_type_it->second; in InitIndexBssMappingsHelper()
2198 const BitVector& type_indexes = package_type_it->second; in InitIndexBssMappingsHelper()
[all …]
|
| /art/runtime/verifier/ |
| D | reg_type.h | 999 const BitVector& unresolved,
1009 const BitVector& GetUnresolvedTypes() const { in GetUnresolvedTypes()
1037 const BitVector unresolved_types_;
|
| D | reg_type.cc | 141 const BitVector& types = GetUnresolvedTypes(); in Dump()
764 const BitVector& unresolved, in UnresolvedMergedType()
|
| D | reg_type_cache.cc | 381 const BitVector& unresolved_part = cmp_type->GetUnresolvedTypes(); in FromUnresolvedMerge()
|
| /art/dex2oat/driver/ |
| D | compiler_driver.h | 60 class BitVector; variable
|
| /art/runtime/oat/ |
| D | oat_file.cc | 2320 uint32_t bitmap_size = BitVector::BitsToWords(num_methods) * BitVector::kWordBytes; in GetOatClass()
2327 num_method_offsets = BitVector::NumSetBits(bitmap_pointer, num_methods); in GetOatClass()
2415 if (!BitVector::IsBitSet(bitmap_, method_index)) { in GetOatMethodOffsets()
2418 size_t num_set_bits = BitVector::NumSetBits(bitmap_, method_index); in GetOatMethodOffsets()
|
| D | oat_file.h | 43 class BitVector; variable
|