| /art/runtime/gc/ |
| D | heap-visit-objects-inl.h | 112 for (auto* it = allocation_stack_->Begin(), *end = allocation_stack_->End(); it < end; ++it) { in VisitObjectsInternal() local
113 mirror::Object* const obj = it->AsMirrorPtr(); in VisitObjectsInternal()
|
| /art/tools/veridex/ |
| D | hidden_api.cc | 61 auto it = api_list_.find(signature); in AddSignatureToApiList() local
62 if (it == api_list_.end()) { in AddSignatureToApiList()
65 } else if (membership.GetMaxAllowedSdkVersion() < it->second.GetMaxAllowedSdkVersion()) { in AddSignatureToApiList()
67 it->second = membership; in AddSignatureToApiList()
|
| D | README.md | 10 To build it:
13 To run it:
|
| /art/libartbase/base/unix_file/ |
| D | README | 8 it's trivial to add new implementations.
10 This code will not log, because it can't know whether that's appropriate in
14 of multiple sub-operations, it will return the errno corresponding to the most
|
| /art/compiler/optimizing/ |
| D | instruction_simplifier_arm.cc | 62 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
63 HInstruction* instruction = it.Current(); in VisitBasicBlock()
178 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { in TryMergeIntoUsersShifterOperand() local
179 HInstruction* user = it->GetUser(); in TryMergeIntoUsersShifterOperand()
181 ++it; in TryMergeIntoUsersShifterOperand()
|
| D | instruction_simplifier_arm64.cc | 64 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
65 HInstruction* instruction = it.Current(); in VisitBasicBlock()
182 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { in TryMergeIntoUsersShifterOperand() local
183 HInstruction* user = it->GetUser(); in TryMergeIntoUsersShifterOperand()
185 ++it; in TryMergeIntoUsersShifterOperand()
|
| D | cha_guard_optimization.cc | 80 HInstructionIterator it(block->GetInstructions()); in VisitBasicBlock() local
81 instruction_iterator_ = ⁢ in VisitBasicBlock()
82 for (; !it.Done(); it.Advance()) { in VisitBasicBlock()
83 DCHECK(it.Current()->IsInBlock()); in VisitBasicBlock()
84 it.Current()->Accept(this); in VisitBasicBlock()
|
| D | loop_analysis.cc | 51 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in CalculateLoopBasicProperties() local
52 HInstruction* instruction = it.Current(); in CalculateLoopBasicProperties()
53 if (it.Current()->GetType() == DataType::Type::kInt64) { in CalculateLoopBasicProperties()
353 for (HBlocksInLoopIterator it(*loop_info); !it.Done(); it.Advance()) { in GetUnrollingFactor() local
354 HBasicBlock* block = it.Current(); in GetUnrollingFactor()
|
| D | induction_var_analysis.cc | 166 for (auto it = uses.begin(), end = uses.end(); it != end; ) { in FixOutsideUse() local
167 HInstruction* user = it->GetUser(); in FixOutsideUse()
168 size_t index = it->GetIndex(); in FixOutsideUse()
169 ++it; // increment prior to potential removal in FixOutsideUse()
180 for (auto it = env_uses.begin(), end = env_uses.end(); it != end;) { in FixOutsideUse() local
181 HEnvironment* user = it->GetUser(); in FixOutsideUse()
182 size_t index = it->GetIndex(); in FixOutsideUse()
183 ++it; // increment prior to potential removal in FixOutsideUse()
207 for (HInstructionIterator it(loop->GetHeader()->GetPhis()); !it.Done(); it.Advance()) { in RewriteBreakLoopBody() local
208 HInstruction* exit_value = it.Current() == index ? upper : nullptr; in RewriteBreakLoopBody()
[all …]
|
| D | nodes.cc | 149 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in RemoveInstructionsAsUsersFromDeadBlocks() local
150 RemoveAsUser(it.Current()); in RemoveInstructionsAsUsersFromDeadBlocks()
152 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in RemoveInstructionsAsUsersFromDeadBlocks() local
153 RemoveAsUser(it.Current()); in RemoveInstructionsAsUsersFromDeadBlocks()
375 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in FixPhisAfterPredecessorsReodering() local
376 HPhi* phi = it.Current()->AsPhi(); in FixPhisAfterPredecessorsReodering()
474 for (HInstructionIterator it(header->GetPhis()); !it.Done(); it.Advance()) { in TransformLoopToSinglePreheaderFormat() local
475 HPhi* header_phi = it.Current()->AsPhi(); in TransformLoopToSinglePreheaderFormat()
1215 for (HInstructionIterator it(*this); !it.Done(); it.Advance()) { in Contains() local
1216 if (it.Current() == instruction) { in Contains()
[all …]
|
| D | loop_optimization.cc | 413 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { in TryToEvaluateIfCondition() local
414 HInstruction* user = it->GetUser(); in TryToEvaluateIfCondition()
415 size_t index = it->GetIndex(); in TryToEvaluateIfCondition()
418 ++it; in TryToEvaluateIfCondition()
652 for (HInstructionIterator it(header->GetPhis()); !it.Done(); it.Advance()) { in SimplifyInduction() local
653 HPhi* phi = it.Current()->AsPhi(); in SimplifyInduction()
673 for (HBlocksInLoopIterator it(*node->loop_info); !it.Done(); it.Advance()) { in SimplifyBlocks() local
674 HBasicBlock* block = it.Current(); in SimplifyBlocks()
718 for (HBlocksInLoopIterator it(*node->loop_info); !it.Done(); it.Advance()) { in TryOptimizeInnerLoopFinite() local
719 if (it.Current() != header) { in TryOptimizeInnerLoopFinite()
[all …]
|
| D | code_sinking.cc | 148 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in AddInputs() local
149 AddInputs(it.Current(), processed_instructions, discard_blocks, worklist); in AddInputs()
151 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in AddInputs() local
152 AddInputs(it.Current(), processed_instructions, discard_blocks, worklist); in AddInputs()
|
| /art/runtime/ |
| D | intern_table.cc | 382 auto it = table.set_.find(GcRoot<mirror::String>(s)); in Remove() local
383 if (it != table.set_.end()) { in Remove()
384 table.set_.erase(it); in Remove()
394 auto it = table.set_.find(GcRoot<mirror::String>(s)); in Find() local
395 if (it != table.set_.end()) { in Find()
396 return it->Read(); in Find()
405 auto it = table.set_.find(string); in Find() local
406 if (it != table.set_.end()) { in Find()
407 return it->Read(); in Find()
441 for (auto it = set->begin(), end = set->end(); it != end;) { in SweepWeaks() local
[all …]
|
| D | stack_map.cc | 99 std::map<BitMemoryRegion, uint32_t, BitMemoryRegion::Less>::iterator it[kNumBitTables]; in Dedupe() local
101 it[i] = dedupe_map_.emplace(region, /*bit_offset=*/0).first; in Dedupe()
102 if (it[i]->second != 0 && region.size_in_bits() > kMinDedupSize) { // Seen before and large? in Dedupe()
113 ForEachBitTableField([this, &code_info, &it](size_t i, auto) { in Dedupe()
115 uint32_t& bit_offset = it[i]->second; in Dedupe()
121 writer_.WriteRegion(it[i]->first); in Dedupe()
146 auto it = std::partition_point( in GetStackMapForNativePcOffset() local
153 for (; it != stack_maps_.end() && (*it).GetNativePcOffset(isa) == pc; ++it) { in GetStackMapForNativePcOffset()
154 StackMap::Kind kind = static_cast<StackMap::Kind>((*it).GetKind()); in GetStackMapForNativePcOffset()
156 return *it; in GetStackMapForNativePcOffset()
|
| /art/test/995-breakpoints-throw/ |
| D | info.txt | 3 Tests that it is possible to throw exceptions while handling breakpoint events
4 and that they are handled appropriately. This includes checking that it is
|
| /art/runtime/interpreter/ |
| D | lock_count_data.cc | 53 auto it = std::find(monitors_->begin(), monitors_->end(), obj); in RemoveMonitorOrThrow() local
54 if (it != monitors_->end()) { in RemoveMonitorOrThrow()
55 monitors_->erase(it); in RemoveMonitorOrThrow()
|
| /art/dex2oat/linker/ |
| D | multi_oat_relative_patcher.cc | 78 auto it = map.find(ref); in FindMethodOffset() local
79 if (it == map.end()) { in FindMethodOffset()
82 return std::pair<bool, uint32_t>(true, it->second); in FindMethodOffset()
|
| /art/test/980-redefine-object/ |
| D | info.txt | 13 If this test starts failing during the doCommonClassRedefinition call it is
16 normal Object dex bytes is that (a) it contains only the bytes of the Object
17 class itself, and (b) it adds an
21 It is also possible it could fail due to the pattern of allocations caused by
|
| /art/cmdline/ |
| D | token_range.h | 214 auto it = std::remove_if(token.begin(), token.end(), [&](char ch) { in RemoveCharacter() local
221 token.erase(it, token.end()); in RemoveCharacter()
291 for (iterator it = begin(); it != end(); ++it) { in MatchSubstrings() local
292 const std::string& tok = *it; in MatchSubstrings()
397 for (auto it = begin_; it != end_; ++it) { in RemoveIf() local
398 auto&& token = *it; in RemoveIf()
|
| /art/libartbase/base/ |
| D | iteration_range.h | 58 inline IterationRange<Iter> MakeEmptyIterationRange(const Iter& it) { in MakeEmptyIterationRange() argument
59 return IterationRange<Iter>(it, it); in MakeEmptyIterationRange()
|
| D | stats.h | 41 for (auto it : children_) { in SumChildrenValues() local
42 sum += it.second.Value(); in SumChildrenValues()
|
| /art/runtime/verifier/ |
| D | register_line.h | 388 auto it = reg_to_lock_depths_.find(src); in CopyRegToLockDepth() local
389 if (it != reg_to_lock_depths_.end()) { in CopyRegToLockDepth()
390 reg_to_lock_depths_.Put(dst, it->second); in CopyRegToLockDepth()
395 auto it = reg_to_lock_depths_.find(reg); in IsSetLockDepth() local
396 if (it != reg_to_lock_depths_.end()) { in IsSetLockDepth()
397 return (it->second & (1 << depth)) != 0; in IsSetLockDepth()
408 auto it = reg_to_lock_depths_.find(reg); in SetRegToLockDepth() local
409 if (it == reg_to_lock_depths_.end()) { in SetRegToLockDepth()
412 it->second |= (1 << depth); in SetRegToLockDepth()
|
| /art/runtime/gc/space/ |
| D | large_object_space.cc | 175 auto it = large_objects_.find(obj); in IsZygoteLargeObject() local
176 CHECK(it != large_objects_.end()); in IsZygoteLargeObject()
177 return it->second.is_zygote; in IsZygoteLargeObject()
193 auto it = large_objects_.find(ptr); in Free() local
194 if (UNLIKELY(it == large_objects_.end())) { in Free()
199 const size_t map_size = it->second.mem_map.BaseSize(); in Free()
204 large_objects_.erase(it); in Free()
210 auto it = large_objects_.find(obj); in AllocationSize() local
211 CHECK(it != large_objects_.end()) << "Attempted to get size of a large object which is not live"; in AllocationSize()
212 size_t alloc_size = it->second.mem_map.BaseSize(); in AllocationSize()
[all …]
|
| /art/test/1948-obsolete-const-method-handle/util-src/ |
| D | info.txt | 2 contents of src/. Then it uses TestGenerator to add additional functions to the
4 constant method-handle and invokes it in TestInvoker and functions that will
|
| /art/compiler/utils/ |
| D | dedupe_set-inl.h | 74 auto it = keys_.find(hashed_in_key);
75 if (it != keys_.end()) {
76 DCHECK(it->Key() != nullptr);
77 return it->Key();
95 auto it = stats.find(key.Hash());
96 if (it == stats.end()) {
99 ++it->second;
|