Home
last modified time | relevance | path

Searched refs:pair (Results 51 – 75 of 149) sorted by relevance

123456

/art/cmdline/detail/
Dcmdline_parse_argument_detail.h68 virtual std::pair<size_t, size_t> GetNumTokens() const = 0;
130 std::pair<const TokenRange*, size_t> FindClosestMatch(const TokenRange& token_list) const { in FindClosestMatch()
307 std::pair<size_t, size_t> token_range_size_;
326 std::vector<std::pair<const char*, TArg>> value_map_;
541 virtual std::pair<size_t, size_t> GetNumTokens() const { in GetNumTokens()
/art/test/800-smali/smali/
Db_17410612.smali4 # a pair. This should fail in the verifier and not an abort in the compiler.
/art/libartbase/base/
Dhash_set_test.cc263 void MakeEmpty(std::pair<std::string, int>& pair) const { in MakeEmpty()
264 pair.first.clear(); in MakeEmpty()
266 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty()
267 return pair.first.empty(); in IsEmpty()
Dstl_util.h161 std::pair<typename IterLeft::value_type, typename IterRight::value_type>> {
180 std::pair<typename IterLeft::value_type, typename IterRight::value_type> operator*() const {
Dhash_set.h445 std::pair<iterator, bool> insert(const_iterator hint ATTRIBUTE_UNUSED, const T& element) { in insert()
448 std::pair<iterator, bool> insert(const_iterator hint ATTRIBUTE_UNUSED, T&& element) { in insert()
453 std::pair<iterator, bool> insert(const T& element) { in insert()
456 std::pair<iterator, bool> insert(T&& element) { in insert()
461 std::pair<iterator, bool> InsertWithHash(U&& element, size_t hash) { in InsertWithHash()
/art/runtime/
Ddex_to_dex_decompiler.cc94 for (const DexInstructionPcPair& pair : code_item_accessor_) { in Decompile() local
95 Instruction* inst = const_cast<Instruction*>(&pair.Inst()); in Decompile()
Dparsed_options.h40 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
Dtransaction.cc357 using ObjectPair = std::pair<mirror::Object*, mirror::Object*>; in VisitObjectLogs()
372 for (const ObjectPair& pair : moving_roots) { in VisitObjectLogs() local
373 mirror::Object* old_root = pair.first; in VisitObjectLogs()
374 mirror::Object* new_root = pair.second; in VisitObjectLogs()
385 using ArrayPair = std::pair<mirror::Array*, mirror::Array*>; in VisitArrayLogs()
399 for (const ArrayPair& pair : moving_roots) { in VisitArrayLogs() local
400 mirror::Array* old_root = pair.first; in VisitArrayLogs()
401 mirror::Array* new_root = pair.second; in VisitArrayLogs()
Dcha.h88 typedef std::pair<ArtMethod*, OatQuickMethodHeader*> MethodAndMethodHeaderPair;
Dcha.cc644 std::vector<std::pair<ArtMethod*, OatQuickMethodHeader*>> headers; in InvalidateSingleImplementationMethods()
689 for (const auto& pair : headers) { in InvalidateSingleImplementationMethods() local
690 code_cache->InvalidateCompiledCodeFor(pair.first, pair.second); in InvalidateSingleImplementationMethods()
Dclass_table.h104 using DescriptorHashPair = std::pair<const char*, uint32_t>;
117 uint32_t operator()(const DescriptorHashPair& pair) const NO_THREAD_SAFETY_ANALYSIS;
/art/test/503-dead-instructions/smali/
DDeadInstructions.smali41 # Give a non-sequential pair for the long argument.
51 # Give one half of a pair.
/art/libnativeloader/
Dlibrary_namespaces.h68 std::list<std::pair<jweak, NativeLoaderNamespace>> namespaces_;
/art/runtime/interpreter/
Dinterpreter_cache.h50 typedef std::pair<const void*, size_t> Entry ALIGNED(2 * sizeof(size_t));
/art/runtime/gc/space/
Dlarge_object_space.h117 virtual std::pair<uint8_t*, uint8_t*> GetBeginEndAtomic() const = 0;
166 std::pair<uint8_t*, uint8_t*> GetBeginEndAtomic() const override REQUIRES(!lock_);
201 std::pair<uint8_t*, uint8_t*> GetBeginEndAtomic() const override REQUIRES(!lock_);
/art/runtime/verifier/
Dregister_line.h372 for (const auto& pair : reg_to_lock_depths_) { in IterateRegToLockDepths() local
373 const uint32_t reg = pair.first; in IterateRegToLockDepths()
374 uint32_t depths = pair.second; in IterateRegToLockDepths()
Dregister_line.cc420 for (const std::pair<const uint32_t, uint32_t>& pair : search_map) { in FindLockAliasedRegister() local
421 if (pair.first != src && pair.second == src_lock_levels) { in FindLockAliasedRegister()
/art/dexlayout/
Ddexdiag.cc157 for (const auto& pair : kDexSectionInfoMap) { in ComputeHeaderWidth() local
158 const DexSectionInfo& section_info = pair.second; in ComputeHeaderWidth()
170 for (const auto& pair : kDexSectionInfoMap) { in PrintLetterKey() local
171 const DexSectionInfo& section_info = pair.second; in PrintLetterKey()
/art/runtime/base/
Dmutex.cc355 for (const auto& pair : most_common_blocked) { in DumpContention() local
356 if (pair.second > max_tid_count) { in DumpContention()
357 max_tid = pair.first; in DumpContention()
358 max_tid_count = pair.second; in DumpContention()
366 for (const auto& pair : most_common_blocker) { in DumpContention() local
367 if (pair.second > max_tid_count) { in DumpContention()
368 max_tid = pair.first; in DumpContention()
369 max_tid_count = pair.second; in DumpContention()
/art/dex2oat/linker/
Drelative_patcher.h81 virtual std::pair<bool, uint32_t> FindMethodOffset(MethodReference ref) = 0;
/art/dex2oat/linker/arm64/
Drelative_patcher_arm64.h75 std::vector<std::pair<uint32_t, uint32_t>> adrp_thunk_locations_;
/art/compiler/driver/
Dcompiled_method_storage.h81 using ThunkMapValueType = std::pair<const ThunkMapKey, ThunkMapValue>;
/art/dex2oat/driver/
Dcompiler_driver-inl.h86 inline std::pair<bool, bool> CompilerDriver::IsFastInstanceField( in IsFastInstanceField()
/art/tools/jvmti-agents/titrace/
Dtitrace.cc187 auto&& pair = bytecode_cache_.insert( in LookupBytecode()
189 it = pair.first; in LookupBytecode()
/art/runtime/gc/accounting/
Dspace_bitmap_test.cc105 std::vector<std::pair<uintptr_t, uintptr_t>> ranges = { in TEST_F()
113 for (const std::pair<uintptr_t, uintptr_t>& range : ranges) { in TEST_F()

123456