Home
last modified time | relevance | path

Searched full:it (Results 1 – 25 of 934) sorted by relevance

12345678910>>...38

/arkcompiler/ets_runtime/ecmascript/interpreter/
Dframe_handler.cpp43 FrameIterator it(sp_, thread_); in AdvanceToJSFrame() local
44 for (; !it.Done(); it.Advance()) { in AdvanceToJSFrame()
45 FrameType t = it.GetFrameType(); in AdvanceToJSFrame()
50 sp_ = it.GetSp(); in AdvanceToJSFrame()
56 FrameIterator it(sp_, thread_); in PrevJSFrame() local
57 it.Advance(); in PrevJSFrame()
58 sp_ = it.GetSp(); in PrevJSFrame()
62 FrameIterator it(sp_, thread_); in PrevJSFrame() local
63 FrameType t = it.GetFrameType(); in PrevJSFrame()
65 auto frame = it.GetFrame<AsmInterpretedFrame>(); in PrevJSFrame()
[all …]
/arkcompiler/ets_frontend/es2panda/typescript/types/
DunionType.cpp25 for (auto it = constituentTypes_.begin(); it != constituentTypes_.end(); it++) { in ToString() local
26 (*it)->ToString(ss); in ToString()
27 if (std::next(it) != constituentTypes_.end()) { in ToString()
60 for (auto *it : constituentTypes_) { in AssignmentSource() local
61 if (!relation->IsAssignableTo(it, target)) { in AssignmentSource()
72 for (auto *it : constituentTypes_) { in AssignmentTarget() local
73 if (relation->IsAssignableTo(source, it)) { in AssignmentTarget()
83 for (auto *it : constituentTypes_) { in GetTypeFacts() local
84 facts |= it->GetTypeFacts(); in GetTypeFacts()
95 auto it = compare + 1; in RemoveDuplicatedTypes() local
[all …]
DinterfaceType.cpp34 for (auto it = typeParamTypes_.begin(); it != typeParamTypes_.end(); it++) { in ToString() local
35 (*it)->ToString(ss); in ToString()
37 if (std::next(it) != typeParamTypes_.end()) { in ToString()
138 for (auto *it : bases_) { in Instantiate() local
140 it->Instantiate(allocator, relation, globalTypes)->AsObjectType()); in Instantiate()
149 for (auto *it : desc_->callSignatures) { in CollectSignatures() local
150 collectedSignatures->push_back(it); in CollectSignatures()
153 for (auto *it : desc_->constructSignatures) { in CollectSignatures() local
154 collectedSignatures->push_back(it); in CollectSignatures()
158 for (auto *it : bases_) { in CollectSignatures() local
[all …]
DobjectDescriptor.cpp26 for (auto *it : properties) { in FindProperty() local
27 if (it->Name() == name) { in FindProperty()
28 return it; in FindProperty()
39 for (auto *it : properties) { in Copy() local
40 auto *copiedProp = it->Copy(allocator, it->Declaration()); in Copy()
41 copiedProp->SetTsType(it->TsType()->Instantiate(allocator, relation, globalTypes)); in Copy()
45 for (auto *it : callSignatures) { in Copy() local
46 copiedDesc->callSignatures.push_back(it->Copy(allocator, relation, globalTypes)); in Copy()
49 for (auto *it : constructSignatures) { in Copy() local
50 copiedDesc->constructSignatures.push_back(it->Copy(allocator, relation, globalTypes)); in Copy()
DobjectLiteralType.cpp40 for (auto *it : desc_->callSignatures) { in ToString() local
41 it->ToString(ss, nullptr, true); in ToString()
45 for (auto *it : desc_->constructSignatures) { in ToString() local
47 it->ToString(ss, nullptr, true); in ToString()
51 for (auto *it : desc_->properties) { in ToString() local
52 if (it->HasFlag(binder::VariableFlags::READONLY)) { in ToString()
55 ss << it->Name(); in ToString()
57 if (it->HasFlag(binder::VariableFlags::OPTIONAL)) { in ToString()
60 if (it->HasFlag(binder::VariableFlags::PROPERTY)) { in ToString()
64 if (it->TsType()) { in ToString()
[all …]
DobjectType.cpp39 for (auto it = targetSignatures->begin(); it != targetSignatures->end();) { in SignatureRelatedToSomeSignature() local
40 if (relation->IsIdenticalTo(sourceSignature, *it)) { in SignatureRelatedToSomeSignature()
41 targetSignatures->erase(it); in SignatureRelatedToSomeSignature()
45 it++; in SignatureRelatedToSomeSignature()
70 for (auto *it : desc_->properties) { in Identical() local
71 binder::LocalVariable *found = otherObj->Desc()->FindProperty(it->Name()); in Identical()
77 relation->IsIdenticalTo(it->TsType(), found->TsType()); in Identical()
83 if (it->Flags() != found->Flags()) { in Identical()
120 for (auto *it : targetProperties) { in AssignProperties() local
121 binder::LocalVariable *found = source->GetProperty(it->Name(), true); in AssignProperties()
[all …]
DtupleType.cpp26 for (const auto *it : desc_->properties) { in ConvertToArrayType() local
27 unionTypes.push_back(it->TsType()); in ConvertToArrayType()
42 for (auto it = desc_->properties.begin(); it != desc_->properties.end(); it++) { in ToString() local
43 (*it)->TsType()->ToString(ss); in ToString()
44 if ((*it)->HasFlag(binder::VariableFlags::OPTIONAL)) { in ToString()
48 if (std::next(it) != desc_->properties.end()) { in ToString()
53 for (auto it = desc_->properties.begin(); it != desc_->properties.end(); it++) { in ToString() local
54 const util::StringView &memberName = FindNamedMemberName(*it); in ToString()
57 if ((*it)->HasFlag(binder::VariableFlags::OPTIONAL)) { in ToString()
62 (*it)->TsType()->ToString(ss); in ToString()
[all …]
/arkcompiler/ets_frontend/es2panda/typescript/core/
DtypeElaborationContext.cpp34 for (auto it = potentialTypes_.begin(); it != potentialTypes_.end();) { in GetBestMatchingType() local
35 Type *currentType = checker_->GetPropertyTypeForIndexType(*it, indexType); in GetBestMatchingType()
38 it = potentialTypes_.erase(it); in GetBestMatchingType()
43 it = potentialTypes_.erase(it); in GetBestMatchingType()
45 it++; in GetBestMatchingType()
59 for (auto *it : sourceNode_->AsArrayExpression()->Elements()) { in Start() local
60 if (it->IsOmittedExpression()) { in Start()
70 … targetElementType = GetBestMatchingType(checker_->CreateStringLiteralType(memberIndex), it); in Start()
80 checker_->ElaborateElementwise(targetElementType, it, it->Start()); in Start()
91 for (auto *it : targetType_->AsUnionType()->ConstituentTypes()) { in RemoveUnnecessaryTypes() local
[all …]
DdestructuringContext.cpp201 for (auto *it : inferedType_->AsUnionType()->ConstituentTypes()) { in ValidateInferedType() local
202 if (!it->IsArrayType() && (!it->IsObjectType() || !it->AsObjectType()->IsTupleType())) { in ValidateInferedType()
284 for (auto *it : inferedType->ConstituentTypes()) { in CreateArrayTypeForRest() local
285 if (it->IsArrayType()) { in CreateArrayTypeForRest()
286 unionTypes.push_back(it->AsArrayType()->ElementType()); in CreateArrayTypeForRest()
290 ASSERT(it->IsObjectType() && it->AsObjectType()->IsTupleType()); in CreateArrayTypeForRest()
291 Type *tupleElementType = GetTypeFromTupleByIndex(it->AsObjectType()->AsTupleType()); in CreateArrayTypeForRest()
296 tupleElementType = GetTypeFromTupleByIndex(it->AsObjectType()->AsTupleType()); in CreateArrayTypeForRest()
348 for (auto *it : inferedType_->AsUnionType()->ConstituentTypes()) { in GetRestType() local
349 if (it->IsArrayType()) { in GetRestType()
[all …]
/arkcompiler/runtime_core/libpandabase/tests/
Dbit_vector_test.cpp147 for (auto it = vector.end() - 1;; --it) { in TestIteration() local
148 ASSERT_EQ(*it, index-- % 2); in TestIteration()
149 if (it == vector.begin()) { in TestIteration()
164 auto it = vector.begin(); in TestIteration() local
165 ASSERT_EQ(*it, false); in TestIteration()
166 ++it; in TestIteration()
167 ASSERT_EQ(*it, true); in TestIteration()
168 auto it1 = it++; in TestIteration()
169 ASSERT_EQ(*it, false); in TestIteration()
171 ASSERT_TRUE(it1 < it); in TestIteration()
[all …]
Dsmall_vector_test.cpp106 auto it = std::find(vector.begin(), vector.end(), 30); in TestVectorIteration() local
107 ASSERT_NE(it, vector.end()); in TestVectorIteration()
108 ASSERT_EQ(*it, 30); in TestVectorIteration()
109 ASSERT_EQ(std::distance(vector.begin(), it), 2); in TestVectorIteration()
111 it = std::find(vector.begin(), vector.end(), 50); in TestVectorIteration()
112 ASSERT_EQ(it, vector.end()); in TestVectorIteration()
116 auto it = std::find(vector.rbegin(), vector.rend(), 30); in TestVectorIteration() local
117 ASSERT_NE(it, vector.rend()); in TestVectorIteration()
118 ASSERT_EQ(*it, 30); in TestVectorIteration()
119 ASSERT_EQ(std::distance(vector.rbegin(), it), 1); in TestVectorIteration()
[all …]
/arkcompiler/runtime_core/bytecode_optimizer/
Dir_interface.h38 auto it = maps_->methods.find(offset); in GetMethodIdByOffset() local
39 ASSERT(it != maps_->methods.cend()); in GetMethodIdByOffset()
41 return std::string(it->second); in GetMethodIdByOffset()
46 auto it = maps_->strings.find(offset); in GetStringIdByOffset() local
47 ASSERT(it != maps_->strings.cend()); in GetStringIdByOffset()
49 return std::string(it->second); in GetStringIdByOffset()
54 auto it = maps_->literalarrays.find(offset); in GetLiteralArrayByOffset() local
55 ASSERT(it != maps_->strings.cend()); in GetLiteralArrayByOffset()
57 return std::string(it->second); in GetLiteralArrayByOffset()
67 auto it = prog_->literalarray_table.find(id); in GetLiteralArrayIdByOffset() local
[all …]
/arkcompiler/ets_frontend/es2panda/ir/expressions/
DarrayExpression.cpp35 for (auto *it : elements_) { in ConvertibleToArrayPattern() local
36 switch (it->Type()) { in ConvertibleToArrayPattern()
38 convResult = it->AsArrayExpression()->ConvertibleToArrayPattern(); in ConvertibleToArrayPattern()
42 if (!restFound && it == elements_.back() && !trailingComma_) { in ConvertibleToArrayPattern()
43 convResult = it->AsSpreadElement()->ConvertibleToRest(isDeclaration_); in ConvertibleToArrayPattern()
51 convResult = it->AsObjectExpression()->ConvertibleToObjectPattern(); in ConvertibleToArrayPattern()
55 convResult = it->AsAssignmentExpression()->ConvertibleToAssignmentPattern(); in ConvertibleToArrayPattern()
82 for (auto *it : elements_) { in ValidateExpression() local
83 switch (it->Type()) { in ValidateExpression()
85 info = it->AsObjectExpression()->ValidateExpression(); in ValidateExpression()
[all …]
/arkcompiler/runtime_core/runtime/
Dstring_table.cpp96 for (auto it = table_.find(hash_code); it != table_.end(); it++) { in GetString() local
97 auto found_string = it->second; in GetString()
110 for (auto it = table_.find(hash_code); it != table_.end(); it++) { in GetString() local
111 auto found_string = it->second; in GetString()
124 for (auto it = table_.find(hash); it != table_.end(); it++) { in GetString() local
125 auto found_string = it->second; in GetString()
146 for (auto it = table_.find(hash_code); it != table_.end(); it++) { in InternString() local
147 auto found_string = it->second; in InternString()
164 // Even if this string is not inserted, it should get removed during GC in GetOrInternString()
183 // Even if this string is not inserted, it should get removed during GC in GetOrInternString()
[all …]
Dmonitor_pool.cpp47 auto it = monitors_.find(id); in LookupMonitor() local
48 if (it != monitors_.end()) { in LookupMonitor()
49 return it->second; in LookupMonitor()
57 auto it = monitors_.find(id); in FreeMonitor() local
58 if (it != monitors_.end()) { in FreeMonitor()
59 auto *monitor = it->second; in FreeMonitor()
60 monitors_.erase(it); in FreeMonitor()
82 for (auto &it : monitors_) { in ReleaseMonitors() local
83 auto *monitor = it.second; in ReleaseMonitors()
95 for (auto &it : monitors_) { in GetEnteredMonitorsIds() local
[all …]
/arkcompiler/runtime_core/verification/util/
Dequiv_classes.h208 template <typename It>
209 void Equate(It begin, It end) in Equate()
214 It it = begin; in Equate() local
215 ClassIndex cls = ObjClass(*it++); in Equate()
216 for (; it != end; ++it) { in Equate()
217 cls = JoinClasses(cls, ObjClass(*it)); in Equate()
251 template <typename It>
252 bool IsAllEqual(It begin, It end) in IsAllEqual()
257 It it = begin; in IsAllEqual() local
258 ClassIndex cls = ObjClass(*it++); in IsAllEqual()
[all …]
/arkcompiler/runtime_core/compiler/optimizer/analysis/
Drpo.h31 * will be build from scratch after the next request for it.
32 * Also it provides methods for updating an existing tree.
51 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), rm_block); in RemoveBasicBlock() local
52 if (it != rpo_vector_.end()) { in RemoveBasicBlock()
53 rpo_vector_.erase(it); in RemoveBasicBlock()
60 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), cur_block); in AddBasicBlockAfter() local
61 rpo_vector_.insert(it + 1, new_block); in AddBasicBlockAfter()
67 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), cur_block); in AddBasicBlockBefore() local
68 rpo_vector_.insert(it, new_block); in AddBasicBlockBefore()
74 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), cur_block); in AddVectorAfter() local
[all …]
/arkcompiler/ets_frontend/es2panda/typescript/
Dchecker.cpp55 for (const auto &it : list) { in ThrowTypeError() local
56 if (std::holds_alternative<char *>(it)) { in ThrowTypeError()
57 ss << std::get<char *>(it); in ThrowTypeError()
58 } else if (std::holds_alternative<util::StringView>(it)) { in ThrowTypeError()
59 ss << std::get<util::StringView>(it); in ThrowTypeError()
60 } else if (std::holds_alternative<lexer::TokenType>(it)) { in ThrowTypeError()
61 ss << TokenToString(std::get<lexer::TokenType>(it)); in ThrowTypeError()
62 } else if (std::holds_alternative<const Type *>(it)) { in ThrowTypeError()
63 std::get<const Type *>(it)->ToString(ss); in ThrowTypeError()
64 } else if (std::holds_alternative<AsSrc>(it)) { in ThrowTypeError()
[all …]
/arkcompiler/runtime_core/runtime/include/
Dhistogram-inl.h30 for (auto it = start; it != finish; ++it) { in SimpleHistogram() local
31 AddValue(*it); in SimpleHistogram()
65 for (auto it = start; it != finish; ++it) { in Histogram() local
66 AddValue(*it); in Histogram()
75 for (auto it : frequency_) { in GetTopDump() local
82 statistic << it.first << ":" << it.second; in GetTopDump()
/arkcompiler/runtime_core/libpandabase/utils/
Drange.h20 template <class It>
23 Range(It begin, It end) : begin_(begin), end_(end) {} in Range()
25 It begin() in begin()
30 It end() in end()
41 It begin_;
42 It end_;
/arkcompiler/runtime_core/compiler/docs/
Dreg_alloc_graph_coloring_doc.md18 …ordal-graphs is described in works of Sebastian Hack and Fernando Pereira. It is based on observat…
19 …thm. In this implementation was used alternative algorithm that is LexBFS. It uses little bit more…
20 …ial intervals that are placeholders of convention registers) of call-site, it will shift coloring …
26 … is set as pre-color for node. And input parameters is marked for split if it has intersection wit…
27 Here additionally to the built graph with regular edges that represent interference, it is built af…
32 PEO on chordal graph always builds a clique, so it always color consequently nodes of the same cliq…
37 …esce after coloring, that makes work when major decisions already done, so it decrease ability for…
38 …oloring nodes are “hinted” with preferred colors. And on stage of coloring it is tried to satisfy …
42it is used component search algorithm which is recursive call to DFS, until all nodes having affin…
48 …olors bitsets. For each node it is checked if it is a neighbor and it has a color, this value is s…
[all …]
/arkcompiler/ets_runtime/ecmascript/
Djs_for_in_iterator.cpp32 bool JSForInIterator::CheckObjProto(const JSThread *thread, const JSHandle<JSForInIterator> &it) in CheckObjProto() argument
35 JSHandle<JSTaggedValue> object(thread, it->GetObject()); in CheckObjProto()
52 …id JSForInIterator::FastGetAllEnumKeys(const JSThread *thread, const JSHandle<JSForInIterator> &it, in FastGetAllEnumKeys() argument
185 it->SetRemainingKeys(thread, remaining); in FastGetAllEnumKeys()
186 it->SetWasVisited(true); in FastGetAllEnumKeys()
189 void JSForInIterator::SlowGetAllEnumKeys(JSThread *thread, const JSHandle<JSForInIterator> &it, in SlowGetAllEnumKeys() argument
192 JSMutableHandle<TaggedQueue> visited(thread, it->GetVisitedKeys()); in SlowGetAllEnumKeys()
194 JSMutableHandle<TaggedQueue> remaining(thread, it->GetRemainingKeys()); in SlowGetAllEnumKeys()
204 it->SetRemainingKeys(thread, remaining); in SlowGetAllEnumKeys()
205 it->SetVisitedKeys(thread, visited); in SlowGetAllEnumKeys()
[all …]
Dframes.cpp292 // it may be asm code stub's leave frame. in Advance()
425 ARK_INLINE void OptimizedFrame::GCIterate(const FrameIterator &it, in GCIterate() argument
430 bool ret = it.IteratorStackMap(visitor, derivedVisitor); in GCIterate()
433 LOG_ECMA(DEBUG) << " stackmap don't found returnAddr " << it.GetOptimizedReturnAddr(); in GCIterate()
448 ARK_INLINE JSTaggedType* OptimizedJSFunctionFrame::GetArgv(const FrameIterator &it) const in GetArgv()
450 uintptr_t *preFrameSp = ComputePrevFrameSp(it); in GetArgv()
454 ARK_INLINE uintptr_t* OptimizedJSFunctionFrame::ComputePrevFrameSp(const FrameIterator &it) const in ComputePrevFrameSp()
456 const JSTaggedType *sp = it.GetSp(); in ComputePrevFrameSp()
457 int delta = it.ComputeDelta(); in ComputePrevFrameSp()
465 void OptimizedJSFunctionFrame::CollectBCOffsetInfo(const FrameIterator &it, kungfu::ConstInfo &info… in CollectBCOffsetInfo() argument
[all …]
/arkcompiler/runtime_core/compiler/optimizer/code_generator/
Dspill_fill_encoder.cpp66 auto it = spill_fills->begin(); in SortSpillFillData() local
67 while (it != spill_fills->end()) { in SortSpillFillData()
71 bool is_fill = it->SrcType() == LocationType::STACK && it->GetDst().IsAnyRegister(); in SortSpillFillData()
72 bool is_spill = it->GetSrc().IsAnyRegister() && it->DstType() == LocationType::STACK; in SortSpillFillData()
74 ++it; in SortSpillFillData()
77 auto next = std::next(it); in SortSpillFillData()
78 …while (next != spill_fills->end() && it->SrcType() == next->SrcType() && it->DstType() == next->Ds… in SortSpillFillData()
83 std::sort(it, next, [](auto sf1, auto sf2) { return sf1.DstValue() > sf2.DstValue(); }); in SortSpillFillData()
86 std::sort(it, next, [](auto sf1, auto sf2) { return sf1.SrcValue() > sf2.SrcValue(); }); in SortSpillFillData()
89 it = next; in SortSpillFillData()
[all …]
/arkcompiler/runtime_core/dprof/converter/
Dfeatures_manager.h36 auto it = map_.find(featureName); in RegisterFeature() local
37 if (it != map_.end()) { in RegisterFeature()
57 auto it = map_.find(featureName); in ProcessingFeature() local
58 if (it == map_.end()) { in ProcessingFeature()
63 return it->second(appData, data); in ProcessingFeature()
68 for (const auto &it : appData.GetFeaturesMap()) { in ProcessingFeatures() local
69 if (!ProcessingFeature(appData, it.first, it.second)) { in ProcessingFeatures()
70 … LOG(ERROR, DPROF) << "Cannot processing feature: " << it.first << ", app: " << appData.GetName(); in ProcessingFeatures()

12345678910>>...38