/art/runtime/ |
H A D | cha.h | 85 typedef std::pair<ArtMethod*, OatQuickMethodHeader*> MethodAndMethodHeaderPair;
|
H A D | image-inl.h | 75 table->Visit([&visitor](const std::pair<ArtMethod*, ArtMethod*>& methods) {
|
H A D | jni_env_ext.h | 137 std::vector<std::pair<uintptr_t, jobject>> locked_objects_;
|
H A D | monitor_test.cc | 39 for (std::pair<std::string, const void*>& pair : *options) { 40 if (pair.first.find("-Xmx") == 0) { 41 pair.first = "-Xmx4M"; // Smallest we can go.
|
H A D | class_table.h | 99 using DescriptorHashPair = std::pair<const char*, uint32_t>; 112 uint32_t operator()(const DescriptorHashPair& pair) const NO_THREAD_SAFETY_ANALYSIS;
|
H A D | transaction.cc | 279 typedef std::pair<mirror::Object*, mirror::Object*> ObjectPair; 294 for (const ObjectPair& pair : moving_roots) { 295 mirror::Object* old_root = pair.first; 296 mirror::Object* new_root = pair.second; 307 typedef std::pair<mirror::Array*, mirror::Array*> ArrayPair; 321 for (const ArrayPair& pair : moving_roots) { 322 mirror::Array* old_root = pair.first; 323 mirror::Array* new_root = pair.second;
|
/art/runtime/verifier/ |
H A D | register_line.h | 400 for (auto& pair : reg_to_lock_depths_) { 401 if ((pair.second & mask) != 0) { 402 VLOG(verifier) << "Also unlocking " << pair.first; 403 pair.second ^= mask;
|
H A D | register_line.cc | 418 for (const std::pair<const uint32_t, uint32_t>& pair : search_map) { 419 if (pair.first != src && pair.second == src_lock_levels) { 461 // Example (lock status in curly braces as pair of register and lock leels): 499 // Example (lock status in curly braces as pair of register and lock leels):
|
/art/runtime/base/ |
H A D | allocator.h | 161 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>>; 172 Key, T, Hash, Pred, TrackingAllocator<std::pair<const Key, T>, kTag>>; 181 Key, T, EmptyFn, Hash, Pred, TrackingAllocator<std::pair<Key, T>, kTag>>;
|
H A D | scoped_arena_containers.h | 59 SafeMap<K, V, Comparator, ScopedArenaAllocatorAdapter<std::pair<const K, V>>>; 63 std::unordered_map<K, V, Hash, KeyEqual, ScopedArenaAllocatorAdapter<std::pair<const K, V>>>;
|
/art/runtime/gc/space/ |
H A D | large_object_space.h | 109 virtual std::pair<uint8_t*, uint8_t*> GetBeginEndAtomic() const = 0; 146 std::pair<uint8_t*, uint8_t*> GetBeginEndAtomic() const OVERRIDE REQUIRES(!lock_); 181 std::pair<uint8_t*, uint8_t*> GetBeginEndAtomic() const OVERRIDE REQUIRES(!lock_);
|
H A D | large_object_space.cc | 175 for (auto& pair : large_objects_) { 176 pair.second.is_zygote = true; 223 for (auto& pair : large_objects_) { 224 MemMap* mem_map = pair.second.mem_map; 598 std::pair<uint8_t*, uint8_t*> range = GetBeginEndAtomic(); 612 std::pair<uint8_t*, uint8_t*> LargeObjectMapSpace::GetBeginEndAtomic() const { 617 std::pair<uint8_t*, uint8_t*> FreeListSpace::GetBeginEndAtomic() const {
|
H A D | malloc_space.h | 173 std::pair<const mirror::Object*, mirror::Class*> recent_freed_objects_[kRecentFreeCount];
|
/art/cmdline/detail/ |
H A D | cmdline_parse_argument_detail.h | 65 virtual std::pair<size_t, size_t> GetNumTokens() const = 0; 123 std::pair<const TokenRange*, size_t> FindClosestMatch(const TokenRange& token_list) const { 257 std::pair<size_t, size_t> token_range_size_; 276 std::vector<std::pair<const char*, TArg>> value_map_; 479 virtual std::pair<size_t, size_t> GetNumTokens() const {
|
/art/compiler/linker/ |
H A D | relative_patcher_test.h | 257 std::pair<bool, uint32_t> FindMethodOffset(MethodReference ref) OVERRIDE { 260 return std::pair<bool, uint32_t>(false, 0u); 262 return std::pair<bool, uint32_t>(true, it->second);
|
H A D | multi_oat_relative_patcher.h | 132 std::pair<bool, uint32_t> FindMethodOffset(MethodReference ref) OVERRIDE;
|
/art/compiler/optimizing/ |
H A D | optimizing_unit_test.h | 106 typedef std::list<std::pair<std::string, std::string>> diff_t;
|
H A D | stack_map_stream.h | 34 void MakeEmpty(std::pair<DexRegisterLocation, size_t>& item) const { 37 bool IsEmpty(const std::pair<DexRegisterLocation, size_t>& item) const {
|
/art/dexlayout/ |
H A D | dexdiag.cc | 147 for (const auto& pair : kDexSectionInfoMap) { 148 const DexSectionInfo& section_info = pair.second; 160 for (const auto& pair : kDexSectionInfoMap) { 161 const DexSectionInfo& section_info = pair.second;
|
/art/imgdiag/ |
H A D | imgdiag.cc | 708 for (auto pair : art_method_field_dirty_count_sorted) { 709 off_t offset = pair.second; 710 int count = pair.first; 759 for (auto pair : class_field_dirty_count_sorted) { 760 off_t offset = pair.second; 761 int count = pair.first; 884 static std::vector<std::pair<V, K>> SortByValueDesc( 887 // Store value->key so that we can use the default sort from pair which 889 std::vector<std::pair<V, K>> value_key_vector;
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap_test.cc | 104 std::vector<std::pair<uintptr_t, uintptr_t>> ranges = { 112 for (const std::pair<uintptr_t, uintptr_t>& range : ranges) {
|
/art/runtime/openjdkjvmti/ |
H A D | events.h | 115 using UniqueThread = std::pair<art::Thread*, uint32_t>; 118 std::vector<std::pair<UniqueThread, EventMask>> thread_event_masks;
|
/art/compiler/ |
H A D | image_writer.cc | 969 auto pair = mirror::DexCache::GetNativePairPtrSize(resolved_fields, slot_idx, target_ptr_size_); local 970 uint32_t stored_index = pair.index; 971 ArtField* field = pair.object; 1010 mirror::TypeDexCachePair pair = local 1012 uint32_t stored_index = pair.index; 1013 ObjPtr<mirror::Class> klass = pair.object.Read(); 1028 mirror::StringDexCachePair pair = local 1030 uint32_t stored_index = pair.index; 1031 ObjPtr<mirror::String> string = pair.object.Read(); 1145 for (auto& pair [all...] |
/art/compiler/linker/arm64/ |
H A D | relative_patcher_arm64.h | 105 std::vector<std::pair<uint32_t, uint32_t>> adrp_thunk_locations_;
|
/art/compiler/utils/ |
H A D | assembler.h | 328 std::pair<std::vector<uint8_t>, std::vector<DelayedAdvancePC>> 332 std::pair<std::vector<uint8_t>, std::vector<DelayedAdvancePC>> result;
|