/art/compiler/dex/ |
H A D | dataflow_iterator.h | 435 GrowableArray<std::pair<uint16_t, bool>>* const loop_head_stack_;
|
H A D | ssa_transformation.cc | 192 ScopedArenaVector<std::pair<BasicBlock*, ArenaBitVector::IndexIterator>> work_stack( 197 std::pair<BasicBlock*, ArenaBitVector::IndexIterator>* curr = &work_stack.back();
|
H A D | mir_graph.h | 240 * 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 D | image_writer.h | 257 std::vector<std::pair<mirror::Object*, uint32_t>> saved_hashes_;
|
/art/compiler/sea_ir/ir/ |
H A D | instruction_nodes.h | 58 definition_edges_.insert(std::pair<int, InstructionNode*>(reg_no, definition));
|
/art/compiler/utils/ |
H A D | arena_containers.h | 58 SafeMap<K, V, Comparator, ArenaAllocatorAdapter<std::pair<const K, V>>>;
|
H A D | dedupe_set.h | 39 typedef std::pair<HashType, const InKey*> HashedInKey;
|
H A D | scoped_arena_containers.h | 56 SafeMap<K, V, Comparator, ScopedArenaAllocatorAdapter<std::pair<const K, V>>>;
|
H A D | swap_space.h | 85 typedef std::pair<size_t, FreeByStartSet::const_iterator> FreeBySizeEntry;
|
/art/runtime/gc/space/ |
H A D | large_object_space.h | 136 TrackingAllocator<std::pair<mirror::Object*, MemMap*>, kAllocatorTagLOSMaps>> MemMaps;
|
/art/compiler/optimizing/ |
H A D | code_generator_arm.cc | 180 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 D | code_generator_x86.cc | 162 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 D | class_linker.cc | 2017 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 D | profiler.cc | 62 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 D | elf_file.cc | 879 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 D | class_linker.h | 709 std::size_t operator()(const std::pair<const char*, mirror::ClassLoader*>& element) const 712 const std::pair<const char*, mirror::ClassLoader*>& b)
|
H A D | mem_map.cc | 50 std::pair<BacktraceMap::const_iterator, BacktraceMap::const_iterator> iters) {
|
H A D | runtime.h | 74 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
|
H A D | instrumentation.cc | 1143 for (auto pair : deoptimized_methods_) { 1144 pair.second.VisitRoot(callback, arg, RootInfo(kRootVMInternal));
|
/art/runtime/arch/ |
H A D | stub_test.cc | 52 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 D | compiler_driver.h | 253 std::pair<bool, bool> IsFastInstanceField( 261 std::pair<bool, bool> IsFastStaticField(
|
/art/runtime/verifier/ |
H A D | reg_type.h | 253 * 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 D | reg_type.cc | 590 std::pair<uint16_t, uint16_t> refs = GetTopMergedTypes();
|
/art/runtime/hprof/ |
H A D | hprof.cc | 557 for (std::pair<std::string, HprofStringId> p : strings_) {
|
/art/oatdump/ |
H A D | oatdump.cc | 1434 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) {
|