| /art/libartbase/base/ |
| D | variant_map.h | 312 auto&& it = GetKeyValueIterator(key); in Remove()
313 if (it != storage_map_.end()) { in Remove()
314 key.ValueDelete(it->second); in Remove()
315 delete it->first; in Remove()
316 storage_map_.erase(it); in Remove()
444 auto&& it = GetKeyValueIterator(key); in GetValueConstPtr()
445 if (it == storage_map_.end()) { in GetValueConstPtr()
449 return reinterpret_cast<const TValue*>(it->second); in GetValueConstPtr()
|
| D | bit_table.h | 238 const_iterator it = this->begin() + index; variable
239 DCHECK(it < this->end());
240 return *it;
313 for (auto it = range.first; it != range.second; ++it) { variable
314 uint32_t index = it->second;
423 for (auto it = range.first; it != range.second; ++it) { in Dedup() local
424 if (MemoryRegion::ContentEquals()(region, rows_[it->second])) { in Dedup()
425 return it->second; in Dedup()
|
| /art/runtime/ |
| D | cha.cc | 38 const auto it = cha_dependency_map_.insert( in AddDependency() local
40 it->second.push_back({dependent_method, dependent_header}); in AddDependency()
47 auto it = cha_dependency_map_.find(method); in GetDependents() local
48 if (it != cha_dependency_map_.end()) { in GetDependents()
49 return it->second; in GetDependents()
215 auto it = std::find(method_headers_.begin(), method_headers_.end(), method_header); in VisitFrame() local
216 if (it == method_headers_.end()) { in VisitFrame()
709 for (auto it = cha_dependency_map_.begin(); it != cha_dependency_map_.end(); ) { in RemoveDependenciesForLinearAlloc() local
711 if (linear_alloc->ContainsUnsafe(it->first)) { in RemoveDependenciesForLinearAlloc()
713 it = cha_dependency_map_.erase(it); in RemoveDependenciesForLinearAlloc()
[all …]
|
| /art/tools/veridex/ |
| D | api_list_filter.h | 60 for (const auto& it : lists_) { in Matches() local
61 if (list.GetIntValue() == it.GetIntValue()) { in Matches()
|
| /art/compiler/optimizing/ |
| D | graph_checker.cc | 98 for (auto it = sorted_predecessors.begin(), end = sorted_predecessors.end(); it != end; ) { in VisitBasicBlock() local
99 HBasicBlock* p = *it++; in VisitBasicBlock()
101 for (; it != end && *it == p; ++it) { in VisitBasicBlock()
121 for (auto it = sorted_successors.begin(), end = sorted_successors.end(); it != end; ) { in VisitBasicBlock() local
122 HBasicBlock* s = *it++; in VisitBasicBlock()
124 for (; it != end && *it == s; ++it) { in VisitBasicBlock()
163 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
164 HInstruction* current = it.Current(); in VisitBasicBlock()
180 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
181 HInstruction* current = it.Current(); in VisitBasicBlock()
[all …]
|
| D | ssa_builder.cc | 35 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in FixNullConstantType() local
36 HInstruction* equality_instr = it.Current(); in FixNullConstantType()
68 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in EquivalentPhisCleanup() local
69 HPhi* phi = it.Current()->AsPhi(); in EquivalentPhisCleanup()
505 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in HasPhiEquivalentAtLoopEntry() local
506 if (it.Current()->AsPhi()->HasEquivalentPhi()) { in HasPhiEquivalentAtLoopEntry()
|
| /art/runtime/jit/ |
| D | profile_saver.cc | 109 for (auto& it : profile_cache_) { in ~ProfileSaver() local
110 delete it.second; in ~ProfileSaver()
442 for (const auto& it : tracked_dex_base_locations_) { in FetchAndCacheResolvedClassesAndMethods() local
443 const std::string& filename = it.first; in FetchAndCacheResolvedClassesAndMethods()
453 const std::set<std::string>& locations = it.second; in FetchAndCacheResolvedClassesAndMethods()
454 VLOG(profiler) << "Locations for " << it.first << " " << android::base::Join(locations, ':'); in FetchAndCacheResolvedClassesAndMethods()
536 for (const auto& it : tracked_locations) { in ProcessProfilingInfo() local
544 const std::string& filename = it.first; in ProcessProfilingInfo()
545 const std::set<std::string>& locations = it.second; in ProcessProfilingInfo()
866 auto it = map->find(output_filename); in AddTrackedLocationsToMap() local
[all …]
|
| /art/compiler/debug/ |
| D | elf_symtab_writer.h | 106 for (auto it : debug_info.dex_files) { in WriteDebugSymbols() local
107 uint64_t dex_address = dex->GetAddress() + it.first /* offset within the section */; in WriteDebugSymbols()
108 const DexFile* dex_file = it.second; in WriteDebugSymbols()
|
| D | elf_debug_loc_writer.h | 115 for (auto it = stack_maps.begin(); it != stack_maps.end(); it++) { in GetVariableLocations() local
116 const uint32_t low_pc = it->first; in GetVariableLocations()
117 const uint32_t stack_map_index = it->second; in GetVariableLocations()
119 auto next_it = it; in GetVariableLocations()
|
| /art/test/800-smali/smali/ |
| D | b_23300986.smali | 10 monitor-enter v2 # Do it again.
20 monitor-enter v2 # Do it again.
|
| D | b_22411633_2.smali | 20 # Allocate a java.lang.Object and initialize it.
37 # other reference being an uninitialized reference, as we'd suddenly allow calling on it.
39 # Test whether it's some initialized reference by calling hashCode. This should fail, as we
|
| D | b_22411633_1.smali | 27 # v4 is still an uninitialized reference here. Initialize it.
30 # And test whether it's initialized by calling hashCode.
|
| /art/cmdline/ |
| D | README.md | 17 it can parse a string into a `VariantMap`, although in the future it might be desirable to parse
85 `-orange:` prefix and then strip it, leaving only the remains to be parsed.
104 When parsing an enumeration, it might be very convenient to map a list of possible argument string
114 `-hello:whatever`), converting it to the type-safe value of `kWorld` or `kGalaxy` respectively.
117 general it takes a variadic number of `pair<const char* /*arg name*/, T /*value*/>`.
120 When an argument definition has multiple aliases with no wildcards, it might be convenient to
130 In general, it uses the position of the argument alias to map into the WithValues position value.
136 By default, the argument is assumed to appear exactly once, and if the user specifies it more than
157 This specifies that when a value is parsed, it will get saved into a variant map using the specific
175 get saved anywhere. Values will still get parsed as normal, so it will *not* ignore known arguments
[all …]
|
| /art/runtime/verifier/ |
| D | register_line-inl.h | 212 auto it = reg_to_lock_depths_.find(reg); in ClearRegToLockDepth() local
213 DCHECK(it != reg_to_lock_depths_.end()); in ClearRegToLockDepth()
214 uint32_t depths = it->second ^ (1 << depth); in ClearRegToLockDepth()
216 it->second = depths; in ClearRegToLockDepth()
218 reg_to_lock_depths_.erase(it); in ClearRegToLockDepth()
|
| /art/test/051-thread/src/ |
| D | Main.java | 187 Iterator<StackTraceElement> it = list.iterator(); in testMainThreadAllStackTraces() local
188 while (it.hasNext()) { in testMainThreadAllStackTraces()
189 StackTraceElement ste = it.next(); in testMainThreadAllStackTraces()
195 StackTraceElement ste2 = it.next(); in testMainThreadAllStackTraces()
|
| /art/runtime/interpreter/ |
| D | interpreter_common.cc | 719 CallSiteArrayValueIterator* it, in PackArgumentForBootstrapMethod() argument
722 auto type = it->GetValueType(); in PackArgumentForBootstrapMethod()
723 const JValue encoded_value = ConvertScalarBootstrapArgument(it->GetJavaValue()); in PackArgumentForBootstrapMethod()
728 switch (it->GetValueType()) { in PackArgumentForBootstrapMethod()
764 CallSiteArrayValueIterator* it, in PackCollectorArrayForBootstrapMethod() argument
777 for (int32_t i = 0; it->HasNext(); it->Next(), ++i) { \ in PackCollectorArrayForBootstrapMethod()
778 auto type = it->GetValueType(); \ in PackCollectorArrayForBootstrapMethod()
781 ConvertScalarBootstrapArgument(it->GetJavaValue()); \ in PackCollectorArrayForBootstrapMethod()
800 for (int32_t i = 0; it->HasNext(); it->Next(), ++i) { \ in PackCollectorArrayForBootstrapMethod()
801 auto type = it->GetValueType(); \ in PackCollectorArrayForBootstrapMethod()
[all …]
|
| /art/test/714-invoke-custom-lambda-metafactory/ |
| D | info.txt | 1 Checks that ART doesn't crash when it encounters LambdaMetafactory.
|
| /art/test/1907-suspend-list-self-twice/ |
| D | info.txt | 1 Test jvmti SuspendThreadList with the current thread on it twice.
|
| /art/test/459-dead-phi/ |
| D | info.txt | 1 Regression test for optimizing when it is building the SSA form.
|
| /art/test/451-spill-splot/ |
| D | info.txt | 2 way it spills intervals of different types.
|
| /art/dt_fd_forward/ |
| D | NOTICE | 12 This code is free software; you can redistribute it and/or modify it
18 This code is distributed in the hope that it will be useful, but WITHOUT
|
| /art/openjdkjvmti/ |
| D | NOTICE | 11 This code is free software; you can redistribute it and/or modify it
17 This code is distributed in the hope that it will be useful, but WITHOUT
|
| /art/test/1949-short-dex-file/ |
| D | info.txt | 7 it. They are (in order):
20 This test tries to get the JIT to read out-of-bounds on the initial dex file by getting it to
25 alphabet (package xyz, method foo). If it is further forward than the other method-ids then the
|
| /art/openjdkjvm/ |
| D | NOTICE | 11 This code is free software; you can redistribute it and/or modify it
17 This code is distributed in the hope that it will be useful, but WITHOUT
|
| /art/test/497-inlining-and-class-loader/ |
| D | info.txt | 1 Regression test for optimizing to ensure it is using
|