Home
last modified time | relevance | path

Searched refs:it (Results 126 – 150 of 334) sorted by relevance

12345678910>>...14

/art/build/
DAndroid.bp62 // This is the default visibility for the //art package, but we repeat it
63 // here so that it gets merged with other visibility rules in modules
107 // We use it to implement OFFSETOF_MEMBER - see macros.h.
157 // Apple, it's a pain.
221 // the following code is dead (it is, but not for all configurations), disable unreachable
240 // This has to be duplicated for android and host to make sure it
261 // therefore set a stem. Without it, the file would be installed as
281 // therefore set a stem. Without it, the file would be installed as
/art/libdexfile/dex/
Ddex_file.cc377 DexFileParameterIterator it(*this, proto); in FindProtoId() local
379 while (it.HasNext() && i < signature_length && compare == 0) { in FindProtoId()
380 compare = signature_type_idxs[i].index_ - it.GetTypeIdx().index_; in FindProtoId()
381 it.Next(); in FindProtoId()
385 if (it.HasNext()) { in FindProtoId()
578 CallSiteArrayValueIterator it(*this, csi); in GetProtoIndexForCallSite() local
579 it.Next(); in GetProtoIndexForCallSite()
580 it.Next(); in GetProtoIndexForCallSite()
581 DCHECK_EQ(EncodedArrayValueIterator::ValueType::kMethodType, it.GetValueType()); in GetProtoIndexForCallSite()
582 return dex::ProtoIndex(it.GetJavaValue().i); in GetProtoIndexForCallSite()
Ddex_file_verifier.cc2418 auto it = offset_to_type_map_.find(offset); in CheckOffsetToTypeMap() local
2419 if (UNLIKELY(it == offset_to_type_map_.end())) { in CheckOffsetToTypeMap()
2423 if (UNLIKELY(it->second != type)) { in CheckOffsetToTypeMap()
2425 offset, type, it->second); in CheckOffsetToTypeMap()
2552 DexFileParameterIterator it(*dex_file_, *item); in CheckInterProtoIdItem() local
2553 while (it.HasNext() && *shorty != '\0') { in CheckInterProtoIdItem()
2554 if (!CheckIndex(it.GetTypeIdx().index_, in CheckInterProtoIdItem()
2559 const char* descriptor = it.GetDescriptor(); in CheckInterProtoIdItem()
2563 it.Next(); in CheckInterProtoIdItem()
2566 if (UNLIKELY(it.HasNext() || *shorty != '\0')) { in CheckInterProtoIdItem()
[all …]
/art/compiler/optimizing/
Dgraph_visualizer.cc720 auto it = disasm_info_->GetInstructionIntervals().find(instruction); in PrintInstruction() local
721 if (it != disasm_info_->GetInstructionIntervals().end() in PrintInstruction()
722 && it->second.start != it->second.end) { in PrintInstruction()
724 disassembler_->Disassemble(output_, it->second.start, it->second.end); in PrintInstruction()
730 for (HInstructionIterator it(list); !it.Done(); it.Advance()) { in PrintInstructions() local
731 HInstruction* instruction = it.Current(); in PrintInstructions()
856 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
858 HInstruction* instruction = it.Current(); in VisitBasicBlock()
Dprepare_for_register_allocation.cc143 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { in VisitClinitCheck() local
144 HInstruction* user = it->GetUser(); in VisitClinitCheck()
147 ++it; // Advance before we remove the node, reference to the next node is preserved. in VisitClinitCheck()
Dregister_allocator_linear_scan.cc843 for (auto it = active_.begin(), end = active_.end(); it != end; ++it) { in TrySplitNonPairOrUnalignedPairIntervalAt() local
844 LiveInterval* active = *it; in TrySplitNonPairOrUnalignedPairIntervalAt()
861 RemoveIntervalAndPotentialOtherHalf(&active_, it); in TrySplitNonPairOrUnalignedPairIntervalAt()
998 for (auto it = active_.begin(), end = active_.end(); it != end; ++it) { in AllocateBlockedReg() local
999 LiveInterval* active = *it; in AllocateBlockedReg()
1006 RemoveIntervalAndPotentialOtherHalf(&active_, it); in AllocateBlockedReg()
1013 for (auto it = inactive_.begin(); it != inactive_.end(); ) { in AllocateBlockedReg() local
1014 LiveInterval* inactive = *it; in AllocateBlockedReg()
1036 it = RemoveIntervalAndPotentialOtherHalf(&inactive_, it); in AllocateBlockedReg()
1047 ++it; in AllocateBlockedReg()
/art/test/1958-transform-try-jit/
Dinfo.txt4 Note this test deliberately avoids any internal libart calls so it can be
/art/test/419-long-parameter/
Dinfo.txt2 on 32bits architectures. The move to hard float ABI makes it so that the
/art/adbconnection/
DAndroid.bp25 // Note that this tool needs to be built for both 32-bit and 64-bit since it requires
26 // to be same ISA as what it is attached to.
/art/tools/jvmti-agents/titrace/
DAndroid.bp28 // Note that this tool needs to be built for both 32-bit and 64-bit since it requires
29 // to be same ISA as what it is attached to.
/art/tools/jvmti-agents/simple-force-redefine/
DAndroid.bp24 // Note that this tool needs to be built for both 32-bit and 64-bit since it requires
25 // to be same ISA as what it is attached to.
/art/dt_fd_forward/
DAndroid.bp25 // Note that this tool needs to be built for both 32-bit and 64-bit since it needs to be same
26 // ISA as what it is attached to.
/art/tools/jvmti-agents/jit-load/
DAndroid.bp27 // Note that this tool needs to be built for both 32-bit and 64-bit since it requires
28 // to be same ISA as what it is attached to.
/art/test/661-oat-writer-layout/
Dinfo.txt3 Whenever we pass in a profile to dex2oat, we expect that it sorts the methods by the
/art/runtime/
Ddexopt_test.cc204 for (BacktraceMap::iterator it = map->begin(); in ReserveImageSpace() local
205 reservation_start < reservation_end && it != map->end(); ++it) { in ReserveImageSpace()
206 const backtrace_map_t* entry = *it; in ReserveImageSpace()
/art/oatdump/
DAndroid.bp83 // TODO: Having this is not ideal as it might obscure errors.
84 // Try to get rid of it.
106 // correctly. Multiple source libraries depend on it.
/art/runtime/interpreter/mterp/arm/
Dfloating_point.S43 SET_VREG_FLOAT_BY_ADDR s2, r9 @ vAA<- s2 No need to clear as it's 2addr
355 beq d2l_notNaN @ if fraction is non-zero, it's a NaN
395 beq f2l_notNaN @ if fraction is non-zero, it's a NaN
/art/test/1962-multi-thread-events/
Dinfo.txt4 deoptimization count if it was the first thread of a particular event type to be activated. This
/art/libartbase/base/
Dtransform_iterator_test.cc135 auto it = MakeTransformIterator(input.begin(), add1); in TEST() local
136 decltype(MakeTransformIterator(input.cbegin(), add1)) cit = it; in TEST()
137 static_assert(!std::is_same<decltype(it), decltype(cit)>::value, "Types must be different"); in TEST()
138 ASSERT_EQ(it, cit); in TEST()
203 auto it = MakeTransformIterator(input.begin(), sub1); in TEST() local
204 decltype(MakeTransformIterator(input.cbegin(), sub1)) cit = it; in TEST()
205 static_assert(!std::is_same<decltype(it), decltype(cit)>::value, "Types must be different"); in TEST()
206 ASSERT_EQ(it, cit); in TEST()
241 auto it = MakeTransformIterator(input.begin(), mul3); in TEST() local
242 decltype(MakeTransformIterator(input.cbegin(), mul3)) cit = it; in TEST()
[all …]
/art/dexlayout/
Ddexdiag.cc92 for (auto it = kDexSectionInfoMap.begin(); it != kDexSectionInfoMap.end(); ++it) { in PageCount() local
93 map_[it->first] = 0; in PageCount()
100 auto it = map_.find(type); in Get() local
101 DCHECK(it != map_.end()); in Get()
102 return it->second; in Get()
/art/tools/jvmti-agents/wrapagentproperties/
Dwrapagentproperties.cc142 auto it = funcs->proxy_vm->map->find(prop); in WrapGetSystemProperty() local
143 if (it != funcs->proxy_vm->map->end()) { in WrapGetSystemProperty()
144 const std::string& val = it->second; in WrapGetSystemProperty()
202 auto it = funcs->proxy_vm->map->find(prop); in WrapSetSystemProperty() local
203 if (it != funcs->proxy_vm->map->end()) { in WrapSetSystemProperty()
204 it->second = val; in WrapSetSystemProperty()
/art/tools/ahat/etc/
Dahat_api_msg.txt4 whether it may break any current users of the API. If the API change
/art/test/683-clinit-inline-static-invoke/
Dinfo.txt3 current dex file does not have a TypeId for it. This was likely to crash.
/art/test/958-methodhandle-stackframe/
Dinfo.txt2 MethodHandle transformations. This is a separate test because it tests
/art/tools/jvmti-agents/field-counts/
DAndroid.bp23 // Note that this tool needs to be built for both 32-bit and 64-bit since it requires
24 // to be same ISA as what it is attached to.

12345678910>>...14