Searched refs:it (Results 26 - 50 of 154) sorted by relevance

1234567

/art/compiler/optimizing/
H A Dssa_test.cc70 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
71 it.Current()->SetId(id++);
73 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
74 it.Current()->SetId(id++);
90 for (HInstructionIterator it(block->GetPhis()); !it
[all...]
H A Doptimizing_unit_test.h67 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
68 HInstruction* current = it.Current();
103 // An alias for the empty string used to make it clear that a line is
H A Dpretty_printer.h45 for (HInputIterator it(instruction); !it.Done(); it.Advance()) {
51 PrintInt(it.Current()->GetId());
H A Dnodes.cc40 // Create the inexact Object reference type and store it in the HGraph.
53 // "visited" must be empty on entry, it's an output argument for all visited (i.e. live) blocks.
117 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
118 RemoveAsUser(it.Current());
134 // never see it.
185 for (HReversePostOrderIterator it(*this); !it.Done(); it
[all...]
H A Dprepare_for_register_allocation.cc23 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
24 HBasicBlock* block = it.Current();
89 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
90 HInstruction* user = it->GetUser();
93 ++it; // Advance before we remove the node, reference to the next node is preserved.
126 // - the class needs access checks (we do not know if it'
[all...]
H A Dssa_builder.cc29 for (HInstructionIterator it(itb.Current()->GetInstructions()); !it.Done(); it.Advance()) {
30 HInstruction* equality_instr = it.Current();
61 for (HInstructionIterator it(itb.Current()->GetPhis()); !it.Done(); it.Advance()) {
62 HPhi* phi = it.Current()->AsPhi();
82 for (HReversePostOrderIterator it(*graph_); !it
[all...]
H A Dssa_liveness_analysis.cc69 // current reverse post order in the graph, but it would require making
71 // for it.
74 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
75 HBasicBlock* block = it.Current();
117 for (HLinearOrderIterator it(*graph_); !it.Done(); it.Advance()) {
118 HBasicBlock* block = it
[all...]
/art/runtime/base/
H A Diteration_range.h53 static inline IterationRange<Iter> MakeEmptyIterationRange(const Iter& it) { argument
54 return IterationRange<Iter>(it, it);
/art/runtime/
H A Dclass_table.cc37 auto it = class_set.Find(GcRoot<mirror::Class>(klass)); local
38 if (it != class_set.end()) {
39 return it->Read() == klass;
48 auto it = class_set.Find(GcRoot<mirror::Class>(klass)); local
49 if (it != class_set.end()) {
50 return it->Read();
97 auto it = class_set.FindWithHash(descriptor, hash); local
98 if (it != class_set.end()) {
99 return it->Read();
122 auto it local
[all...]
H A Dtransaction.cc44 for (auto it : object_logs_) {
45 field_values_count += it.second.Size();
49 for (auto it : array_logs_) {
50 array_values_count += it.second.Size();
66 // We just keep the message of the first abort because it will cause the
208 for (auto it : object_logs_) {
209 it.second.Undo(it.first);
217 for (auto it : array_logs_) {
218 it
331 auto it = field_values_.find(offset.Uint32Value()); local
485 auto it = array_values_.find(index); local
[all...]
H A Dsafe_map.h72 iterator erase(iterator it) { return map_.erase(it); } argument
85 const_iterator it = map_.find(k); local
86 DCHECK(it != map_.end());
87 return it->second;
136 auto it = PutBefore(lb, k, create()); local
137 return it->second;
H A Doat.cc36 SafeMap<std::string, std::string>::const_iterator it = variable_data->begin(); local
38 for ( ; it != end; ++it) {
39 estimate += it->first.length() + 1;
40 estimate += it->second.length() + 1;
82 // Don't want asserts in header as they would be checked in each file that includes it. But the
397 // Advance start until it is either end or \0.
502 SafeMap<std::string, std::string>::const_iterator it = key_value_store->begin(); local
504 for ( ; it != end; ++it) {
[all...]
/art/runtime/jit/
H A Djit_code_cache.cc171 for (auto& it : method_code_map_) {
172 if (it.second == method) {
270 for (auto it = method_code_map_.begin(); it != method_code_map_.end();) {
271 if (alloc.ContainsUnsafe(it->second)) {
272 FreeCode(it->first, it->second);
273 it = method_code_map_.erase(it);
275 ++it;
797 auto it = method_code_map_.lower_bound(reinterpret_cast<const void*>(pc)); local
814 auto it = osr_code_map_.find(method); local
989 auto it = osr_code_map_.find(method); local
[all...]
/art/runtime/gc/
H A Dtask_processor.cc53 // Non empty queue, look at the top element and see if we are ready to run it.
57 // task if it is late enough.
78 for (auto it = range.first; it != range.second; ++it) {
79 if (*it == task) {
82 tasks_.erase(it);
H A Dallocation_record.cc104 for (auto it = entries_.rbegin(), end = entries_.rend(); it != end; ++it) {
105 AllocRecord& record = it->second;
142 for (auto it = entries_.begin(), end = entries_.end(); it != end;) {
145 mirror::Object* old_object = it->first.Read<kWithoutReadBarrier>();
146 AllocRecord& record = it->second;
150 it->first = GcRoot<mirror::Object>(nullptr);
152 ++it;
[all...]
/art/runtime/verifier/
H A Dregister_line.h92 // The register index was validated during the static pass, so we don't need to check it here.
94 // LockOp::kClear should be used by default; it will clear the lock levels associated with the
185 * The "this" argument to <init> uses code offset kUninitThisArgAddr, which puts it at the start
186 * of the list in slot 0. If we see a register with an uninitialized slot 0 reference, we know it
210 * caller can decide whether it needs the reference to be initialized or not. (Can also return
359 auto it = reg_to_lock_depths_.find(src); local
360 if (it != reg_to_lock_depths_.end()) {
361 reg_to_lock_depths_.Put(dst, it->second);
366 auto it = reg_to_lock_depths_.find(reg); local
367 if (it !
379 auto it = reg_to_lock_depths_.find(reg); local
391 auto it = reg_to_lock_depths_.find(reg); local
[all...]
/art/runtime/interpreter/mterp/arm/
H A Dop_const_string.S10 bne MterpPossibleException @ let reference interpreter deal with it.
/art/runtime/interpreter/mterp/mips64/
H A Dop_const_class.S10 bnez v0, MterpPossibleException # let reference interpreter deal with it.
H A Dop_const_string.S10 bnez v0, MterpPossibleException # let reference interpreter deal with it.
H A Dop_const_string_jumbo.S12 bnez v0, MterpPossibleException # let reference interpreter deal with it.
/art/compiler/debug/dwarf/
H A Ddwarf_test.h53 // If next is true, it must be the next line. Otherwise lines are skipped.
139 for (auto it = actual_line; it < actual_lines.end(); it++) {
140 if (it->find(substring) != std::string::npos) {
141 actual_line = it;
/art/tools/
H A Danalyze-init-failures.py39 it = iter(lines)
51 raw_line = it.next()
60 raw_line = it.next()
70 raw_line = it.next()
91 raw_line = it.next()
/art/cmdline/
H A Dtoken_range.h34 // if it *actually* mutates the token).
112 // Since the separator are retained as tokens, it might be useful to call
153 // The size of the range, i.e. how many tokens are in it.
163 // Look up a token by it's offset.
212 auto it = std::remove_if(token.begin(), token.end(), [&](char ch) {
219 token.erase(it, token.end());
268 // function can fail, in which cause it will return null.
289 for (iterator it = begin(); it != end(); ++it) {
[all...]
/art/compiler/utils/
H A Dtest_dex_file_builder.h40 auto it = strings_.emplace(str, IdxAndDataOffset()).first; local
41 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128.
72 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; local
73 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_.
81 // NOTE: The builder holds the actual data, so it must live as long as the dex file.
208 auto it = protos_.find(*entry.first.proto); local
209 CHECK(it != protos_.end());
210 Write16(raw_offset + 2u, it->second.idx);
218 // Write the complete header early, as part of it needs to be checksummed.
238 auto it local
244 auto it = types_.find(type); local
252 auto it = fields_.find(key); local
261 auto it = methods_.find(method_key); local
[all...]
/art/compiler/linker/
H A Dmulti_oat_relative_patcher.h52 // GetOffset() and an error indication in WriteThunks(). Additionally, it must be
53 // page-aligned, so that it does not skew alignment calculations, say arm64 ADRP.
58 auto it = method_offset_map_.map.find(method_ref); local
59 return (it != method_offset_map_.map.end()) ? it->second - adjustment_ : 0u;

Completed in 2739 milliseconds

1234567