Searched refs:pair (Results 26 - 50 of 52) sorted by relevance

123

/art/compiler/dex/
H A Ddataflow_iterator.h435 GrowableArray<std::pair<uint16_t, bool>>* const loop_head_stack_;
H A Dssa_transformation.cc192 ScopedArenaVector<std::pair<BasicBlock*, ArenaBitVector::IndexIterator>> work_stack(
197 std::pair<BasicBlock*, ArenaBitVector::IndexIterator>* curr = &work_stack.back();
H A Dmir_graph.h240 * uses/defs retain the Dalvik convention that long operations operate on a pair of 32-bit
704 GrowableArray<std::pair<uint16_t, bool>>* GetTopologicalSortOrderLoopHeadStack() {
1161 GrowableArray<std::pair<uint16_t, bool>>* topological_order_loop_head_stack_;
1178 typedef std::pair<int, int> MIRLocation; // Insert point, (m_unit_ index, offset)
/art/compiler/
H A Dimage_writer.h257 std::vector<std::pair<mirror::Object*, uint32_t>> saved_hashes_;
/art/compiler/sea_ir/ir/
H A Dinstruction_nodes.h58 definition_edges_.insert(std::pair<int, InstructionNode*>(reg_no, definition));
/art/compiler/utils/
H A Darena_containers.h58 SafeMap<K, V, Comparator, ArenaAllocatorAdapter<std::pair<const K, V>>>;
H A Ddedupe_set.h39 typedef std::pair<HashType, const InKey*> HashedInKey;
H A Dscoped_arena_containers.h56 SafeMap<K, V, Comparator, ScopedArenaAllocatorAdapter<std::pair<const K, V>>>;
H A Dswap_space.h85 typedef std::pair<size_t, FreeByStartSet::const_iterator> FreeBySizeEntry;
/art/runtime/gc/space/
H A Dlarge_object_space.h136 TrackingAllocator<std::pair<mirror::Object*, MemMap*>, kAllocatorTagLOSMaps>> MemMaps;
/art/compiler/optimizing/
H A Dcode_generator_arm.cc180 ArmManagedRegister pair = local
182 blocked_registers[pair.AsRegisterPairLow()] = true;
183 blocked_registers[pair.AsRegisterPairHigh()] = true;
184 // Block all other register pairs that share a register with `pair`.
188 if (current.AsRegisterPairLow() == pair.AsRegisterPairLow()
189 || current.AsRegisterPairLow() == pair.AsRegisterPairHigh()
190 || current.AsRegisterPairHigh() == pair.AsRegisterPairLow()
191 || current.AsRegisterPairHigh() == pair.AsRegisterPairHigh()) {
195 return pair;
231 // Don't allocate the dalvik style register pair passin
[all...]
H A Dcode_generator_x86.cc162 X86ManagedRegister pair = local
164 blocked_registers[pair.AsRegisterPairLow()] = true;
165 blocked_registers[pair.AsRegisterPairHigh()] = true;
166 // Block all other register pairs that share a register with `pair`.
170 if (current.AsRegisterPairLow() == pair.AsRegisterPairLow()
171 || current.AsRegisterPairLow() == pair.AsRegisterPairHigh()
172 || current.AsRegisterPairHigh() == pair.AsRegisterPairLow()
173 || current.AsRegisterPairHigh() == pair.AsRegisterPairHigh()) {
177 return pair;
214 // Don't allocate the dalvik style register pair passin
[all...]
/art/runtime/
H A Dclass_linker.cc2017 typedef std::pair<const DexFile*, const DexFile::ClassDef*> ClassPathEntry;
2041 ClassPathEntry pair = FindInClassPath(descriptor, hash, boot_class_path_); local
2043 if (pair.second != nullptr) {
2048 klass = DefineClass(self, descriptor, hash, NullHandle<mirror::ClassLoader>(), *pair.first,
2049 *pair.second);
2138 ClassPathEntry pair = FindInClassPath(descriptor, hash, boot_class_path_); local
2139 if (pair.second != nullptr) {
2140 return DefineClass(self, descriptor, hash, NullHandle<mirror::ClassLoader>(), *pair.first,
2141 *pair.second);
2160 ClassPathEntry pair local
3334 auto pair = std::make_pair(descriptor, class_loader); local
[all...]
H A Dprofiler.cc62 BoundedStackVisitor(std::vector<std::pair<mirror::ArtMethod*, uint32_t>>* stack,
84 std::vector<std::pair<mirror::ArtMethod*, uint32_t>>* stack_;
835 typedef std::set<std::pair<int, std::vector<std::string>>> ProfileSet;
H A Delf_file.cc879 std::pair<SymbolTable::iterator, bool> result =
1447 off_map_.insert(std::pair<uint32_t, uint32_t>(type, size_));
1448 size_map_.insert(std::pair<uint32_t, uint32_t>(type, attr_size));
1469 abbrev->tags_.insert(std::pair<uint32_t, uint32_t>(tag->index_, abbrev->tag_list_.size()));
H A Dclass_linker.h709 std::size_t operator()(const std::pair<const char*, mirror::ClassLoader*>& element) const
712 const std::pair<const char*, mirror::ClassLoader*>& b)
H A Dmem_map.cc50 std::pair<BacktraceMap::const_iterator, BacktraceMap::const_iterator> iters) {
H A Druntime.h74 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
H A Dinstrumentation.cc1143 for (auto pair : deoptimized_methods_) {
1144 pair.second.VisitRoot(callback, arg, RootInfo(kRootVMInternal));
/art/runtime/arch/
H A Dstub_test.cc52 for (std::pair<std::string, const void*>& pair : *options) {
53 if (pair.first.find("-Xmx") == 0) {
54 pair.first = "-Xmx4M"; // Smallest we can go.
/art/compiler/driver/
H A Dcompiler_driver.h253 std::pair<bool, bool> IsFastInstanceField(
261 std::pair<bool, bool> IsFastStaticField(
/art/runtime/verifier/
H A Dreg_type.h253 * A basic Join operation on classes. For a pair of types S and T the Join, written S v T = J, is
909 std::pair<uint16_t, uint16_t> GetTopMergedTypes() const {
927 const std::pair<uint16_t, uint16_t> merged_types_;
H A Dreg_type.cc590 std::pair<uint16_t, uint16_t> refs = GetTopMergedTypes();
/art/runtime/hprof/
H A Dhprof.cc557 for (std::pair<std::string, HprofStringId> p : strings_) {
/art/oatdump/
H A Doatdump.cc1434 std::vector<std::pair<std::string, size_t>> oat_dex_file_sizes;
1647 for (const std::pair<std::string, size_t>& oat_dex_file_size : oat_dex_file_sizes) {

Completed in 1341 milliseconds

123