Home
last modified time | relevance | path

Searched refs:GetNext (Results 1 – 25 of 160) sorted by relevance

1234567

/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/be/
Dbbt.cpp57 for (StmtNode *s = head; s != nullptr; s = s->GetNext()) { in ValidateStmtList()
58 if (s->GetNext() != nullptr) { in ValidateStmtList()
59 CHECK_FATAL(s->GetNext()->GetPrev() == s, "make sure the prev node of s' next is s"); in ValidateStmtList()
62 CHECK_FATAL(s->GetPrev()->GetNext() == s, "make sure the next node of s' prev is s"); in ValidateStmtList()
66 for (StmtNode *s = detached; s != nullptr; s = s->GetNext()) { in ValidateStmtList()
67 if (s->GetNext() != nullptr) { in ValidateStmtList()
68 CHECK_FATAL(s->GetNext()->GetPrev() == s, "make sure the prev node of s' next is s"); in ValidateStmtList()
71 CHECK_FATAL(s->GetPrev()->GetNext() == s, "make sure the next node of s' prev is s"); in ValidateStmtList()
Dtrycatchblockslower.cpp44 js = js->GetNext(); in MoveCondGotoIntoTry()
54 … CHECK_FATAL(ts->GetNext() == jtBB.GetFirstStmt(), "make sure ts's next equal jtBB's firstStmt"); in MoveCondGotoIntoTry()
74 jtStmt->GetNext()->SetPrev(brS); in MoveCondGotoIntoTry()
75 brS->SetNext(jtStmt->GetNext()); in MoveCondGotoIntoTry()
115 next = stmt->GetNext(); in RecoverBasicBlock()
123 CHECK_FATAL(commentE->GetNext() == stmt, "make sure commentE's next is stmt"); in RecoverBasicBlock()
130 CHECK_FATAL(commentB == nullptr || (commentE != nullptr && commentE->GetNext() == stmt), in RecoverBasicBlock()
323 … CHECK_FATAL(threadHead->GetFirstStmt()->GetPrev()->GetNext() == threadHead->GetFirstStmt(), in CheckAndProcessCatchNodeInCurrTryBlock()
328 threadTail->GetLastStmt()->SetNext(endTryBB->GetLastStmt()->GetNext()); in CheckAndProcessCatchNodeInCurrTryBlock()
329 if (endTryBB->GetLastStmt()->GetNext() != nullptr) { in CheckAndProcessCatchNodeInCurrTryBlock()
[all …]
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/
Dcfgo.cpp38 …for (bb = from.GetNext(); bb != nullptr && bb != &to && bb != cgFunc->GetLastBB(); bb = bb->GetNex… in NoInsnBetween()
51 …while (insn1 != nullptr && insn1 != last1.GetNext() && insn2 != nullptr && insn2 != last2.GetNext(… in DoSameThing()
53 insn1 = insn1->GetNext(); in DoSameThing()
57 insn2 = insn2->GetNext(); in DoSameThing()
74 insn1 = insn1->GetNext(); in DoSameThing()
75 insn2 = insn2->GetNext(); in DoSameThing()
77 return (insn1 == last1.GetNext() && insn2 == last2.GetNext()); in DoSameThing()
88 BB *sucBB = curBB.GetNext(); in MergeFallthuBB()
131 sucBB.GetPrev()->SetNext(sucBB.GetNext()); in MoveSuccBBAsCurBBNext()
132 if (sucBB.GetNext() != nullptr) { in MoveSuccBBAsCurBBNext()
[all …]
Dloop.cpp258 for (LoopHierarchy *loop = loops; loop != nullptr; loop = loop->GetNext()) { in markExtraEntryAndEncl()
386 …y *loopHierarchy1 = loops; loopHierarchy1 != nullptr; loopHierarchy1 = loopHierarchy1->GetNext()) { in MergeLoops()
387 for (LoopHierarchy *loopHierarchy2 = loopHierarchy1->GetNext(); loopHierarchy2 != nullptr; in MergeLoops()
388 loopHierarchy2 = loopHierarchy2->GetNext()) { in MergeLoops()
409 loopHierarchy2->GetPrev()->SetNext(loopHierarchy2->GetNext()); in MergeLoops()
410 if (loopHierarchy2->GetNext() != nullptr) { in MergeLoops()
411 loopHierarchy2->GetNext()->SetPrev(loopHierarchy2->GetPrev()); in MergeLoops()
433 loopHierarchy2->GetPrev()->SetNext(loopHierarchy2->GetNext()); in MergeLoops()
434 if (loopHierarchy2->GetNext() != nullptr) { in MergeLoops()
435 loopHierarchy2->GetNext()->SetPrev(loopHierarchy2->GetPrev()); in MergeLoops()
[all …]
Dcgbb.cpp46 newInsn.SetNext(existing.GetNext()); in InsertInsnAfter()
50 } else if (newInsn.GetNext()) { in InsertInsnAfter()
51 newInsn.GetNext()->SetPrev(&newInsn); in InsertInsnAfter()
67 newInsn.SetNext(insn.GetNext()); in ReplaceInsn()
70 } else if (newInsn.GetNext() != nullptr) { in ReplaceInsn()
71 newInsn.GetNext()->SetPrev(&newInsn); in ReplaceInsn()
87 firstInsn = insn.GetNext(); in RemoveInsn()
93 Insn *nextInsn = insn.GetNext(); in RemoveInsn()
104 DEBUG_ASSERT(insn.GetNext() == &nextInsn, "next_insn is supposed to follow insn"); in RemoveInsnPair()
109 firstInsn = nextInsn.GetNext(); in RemoveInsnPair()
[all …]
Dcg_cfg.cpp54 for (BB *curBB = firstBB; curBB != nullptr; curBB = curBB->GetNext()) { in BuildCFG()
68 BB *fallthruBB = curBB->GetNext(); in BuildCFG()
127 BB *fallthruBB = curBB->GetNext(); in BuildCFG()
349 mergee.GetPrev()->SetNext(mergee.GetNext()); in MergeBB()
351 if (mergee.GetNext() != nullptr) { in MergeBB()
352 mergee.GetNext()->SetPrev(mergee.GetPrev()); in MergeBB()
406 bb = bb->GetNext(); in FindAndMarkUnreachable()
505 DEBUG_ASSERT(fallthruSuc == curBB.GetNext(), "fallthru succ should be its next bb."); in RemoveBB()
521 if (curBB.GetNext()->GetLabIdx() == 0) { in RemoveBB()
523 curBB.GetNext()->SetLabIdx(targetLabel); in RemoveBB()
[all …]
Dreaching.cpp147 …bool findFinish = FindRegUseBetweenInsn(regNO, insn.GetNext(), insn.GetBB()->GetLastInsn(), useIns… in FindUseForRegOpnd()
228 …bool findFinish = FindRegUseBetweenInsn(regNO, regDefInsn.GetNext(), regDefInsn.GetBB()->GetLastIn… in RegHasUsePoint()
937 if (startInsn.GetNext() == &endInsn || &startInsn == &endInsn) { in RegIsUsedIncaller()
940 auto RegDefVec = FindRegDefBetweenInsn(regNO, startInsn.GetNext(), endInsn.GetPrev()); in RegIsUsedIncaller()
944 if (IsCallerSavedReg(regNO) && startInsn.GetNext() != nullptr && in RegIsUsedIncaller()
945 …KilledByCallBetweenInsnInSameBB(*startInsn.GetNext(), *(startInsn.GetBB()->GetLastInsn()), regNO))… in RegIsUsedIncaller()
968 if (startInsn.GetNext() == &endInsn) { in RegIsLiveBetweenInsn()
974 RegDefVec = FindRegDefBetweenInsn(regNO, startInsn.GetNext(), endInsn.GetPrev()); in RegIsLiveBetweenInsn()
983 KilledByCallBetweenInsnInSameBB(*startInsn.GetNext(), *endInsn.GetPrev(), regNO)) { in RegIsLiveBetweenInsn()
990 … !FindRegDefBetweenInsn(regNO, startInsn.GetNext(), startInsn.GetBB()->GetLastInsn()).empty()) { in RegIsLiveBetweenInsn()
[all …]
/arkcompiler/ets_runtime/ecmascript/mem/
Dfree_object_set.cpp48 freeObject_ = freeObject_->GetNext(); in ObtainSmallFreeObject()
68 freeObject_ = curFreeObject->GetNext(); in ObtainLargeFreeObject()
70 prevFreeObject->SetNext(curFreeObject->GetNext()); in ObtainLargeFreeObject()
82 curFreeObject = curFreeObject->GetNext(); in ObtainLargeFreeObject()
113 curFreeObject = curFreeObject->GetNext(); in LookupLargeFreeObject()
Decma_list.h42 T *lastNext = last_->GetNext(); in AddNode()
91 first_ = node->GetNext(); in RemoveNode()
94 T *next = node->GetNext(); in RemoveNode()
117 it = it->GetNext(); in HasNode()
Darea.h65 Area *GetNext() const in GetNext() function
/arkcompiler/runtime_core/static_core/compiler/tests/
Dscheduler_test.cpp55 ASSERT_EQ(INS(8U).GetNext(), &INS(9U)); in TEST_F()
56 ASSERT_NE(INS(9U).GetNext(), &INS(10U)); in TEST_F()
58 EXPECT_TRUE((INS(11U).GetNext() == &INS(10U)) || (INS(12U).GetNext() == &INS(10U))); in TEST_F()
60 ASSERT_EQ(INS(13U).GetNext(), &INS(14U)); in TEST_F()
61 ASSERT_EQ(INS(14U).GetNext(), &INS(15U)); in TEST_F()
104 ASSERT_EQ(INS(11U).GetNext(), &INS(13U)); in TEST_F()
105 ASSERT_EQ(INS(13U).GetNext(), &INS(12U)); in TEST_F()
106 ASSERT_EQ(INS(12U).GetNext(), &INS(21U)); in TEST_F()
107 ASSERT_EQ(INS(21U).GetNext(), &INS(14U)); in TEST_F()
108 ASSERT_EQ(INS(15U).GetNext(), &INS(16U)); in TEST_F()
[all …]
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_util/include/
Dptr_list_ref.h33 T *GetNext() const in GetNext() function
177 this->ptr = this->ptr->GetNext();
255 return iterator(this->last == nullptr ? nullptr : this->last->GetNext()); in end()
260 return const_iterator(this->last == nullptr ? nullptr : this->last->GetNext()); in end()
265 return const_iterator(this->last == nullptr ? nullptr : this->last->GetNext()); in cend()
353 this->first = this->first->GetNext(); in pop_front()
427 value->SetNext(ptr->GetNext()); in insertAfter()
428 value->GetNext()->SetPrev(value); in insertAfter()
451 DEBUG_ASSERT(where->GetNext() != nullptr, "null ptr check"); in splice()
455 other.back().SetNext(ptr->GetNext()); in splice()
[all …]
/arkcompiler/ets_runtime/ecmascript/
Decma_global_storage.h40 Node *GetNext() const in GetNext() function
258 freeList_ = reinterpret_cast<T *>(node->GetNext()); in GetFreeNode()
271 node->GetPrev()->SetNext(node->GetNext()); in FreeNode()
273 if (node->GetNext() != nullptr) { in FreeNode()
274 node->GetNext()->SetPrev(node->GetPrev()); in FreeNode()
277 usedList_ = reinterpret_cast<T *>(node->GetNext()); in FreeNode()
332 inline NodeList<T> *GetNext() const in GetNext() function
371 next = reinterpret_cast<T *>(current->GetNext()); in IterateUsageGlobal()
407 weakNext = weakCurrent->GetNext(); in ~EcmaGlobalStorage()
421 next = current->GetNext(); in ~EcmaGlobalStorage()
[all …]
Dtagged_hash_array.cpp58 nextNodeVa = nextNode->GetNext(); in GetNode()
124 if (node->GetNext().IsHole()) { in Resize()
144 next = LinkedNode::Cast(nodeVa.GetTaggedObject())->GetNext(); in NodeDisperse()
195 nextVal.Update(root->GetNext()); in SetVal()
230 Set(thread, index, head->GetNext()); in RemoveNode()
233 JSTaggedValue nodeNextVa = head->GetNext(); in RemoveNode()
239 previousNode->SetNext(thread, nodeNext->GetNext()); in RemoveNode()
244 nodeNextVa = nodeNext->GetNext(); in RemoveNode()
282 if (!root->GetNext().IsHole()) { in GetCurrentNode()
283 JSHandle<JSTaggedValue> next(thread, root->GetNext()); in GetCurrentNode()
Djs_finalization_registry.cpp100 if (obj->GetPrev().IsNull() && obj->GetNext().IsNull()) { in CleanFinRegLists()
106 prev->SetNext(thread, obj->GetNext()); in CleanFinRegLists()
108 if (!obj->GetNext().IsNull()) { in CleanFinRegLists()
109 JSHandle<JSFinalizationRegistry> next(thread, obj->GetNext()); in CleanFinRegLists()
226 if (!next->GetPrev().IsNull() || !next->GetNext().IsNull()) { in AddFinRegLists()
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/aarch64/
Daarch64_yieldpoint.cpp58 for (BB *bb = aarchCGFunc->GetFirstBB()->GetNext(); bb != nullptr; bb = bb->GetNext()) { in InsertYieldPoint()
Daarch64_ra_opt.cpp110 for (Insn *ninsn = insn->GetNext(); (ninsn != nullptr) && ninsn != bb->GetLastInsn()->GetNext(); in PropagateX0Optimize()
111 ninsn = ninsn->GetNext()) { in PropagateX0Optimize()
179 …or (Insn *ninsn = optVal.GetRenameInsn()->GetNext(); (ninsn != nullptr) && ninsn != bb->GetLastIns… in PropagateX0ForCurrBb()
180 ninsn = ninsn->GetNext()) { in PropagateX0ForCurrBb()
203 …sn = nextBb->GetFirstInsn(); ninsn != nextBb->GetLastInsn()->GetNext(); ninsn = ninsn->GetNext()) { in PropagateX0ForNextBb()
234 insn = insn->GetNext(); in PropagateX0()
271 BB *nextBb = bb->GetNext(); in PropagateX0()
Daarch64_alignment.cpp68 while (curBB->GetNext() != nullptr && curBB->GetNext()->GetLabIdx() == 0) { in IsInSizeRange()
69 FOR_BB_INSNS_CONST(insn, curBB->GetNext()) { in IsInSizeRange()
76 curBB = curBB->GetNext(); in IsInSizeRange()
266 for (auto *bb = aarFunc->GetFirstBB(); bb != nullptr && !split; bb = bb->GetNext()) { in MarkShortBranchSplit()
/arkcompiler/runtime_core/static_core/runtime/
Dglobal_handle_storage-inl.h59 freeList_ = freeList_->GetNext(); in NewGlobalHandle()
69 node->SetNext(freeList_->GetNext()); in DisposeGlobalHandle()
81 node->SetNext(freeList_->GetNext()); in DisposeGlobalHandle()
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/be/
Dbbt.h50 …CHECK_FATAL(sNode != nullptr ? lastStmt->GetNext() == sNode : lastStmt->GetNext() == eNode, "Exten… in Extend()
/arkcompiler/runtime_core/static_core/runtime/mem/
Dhumongous_obj_allocator-inl.h157 MemoryPoolHeader *next = currentPool->GetNext(); in IterateOverObjects()
270 currentPool = currentPool->GetNext(); in IterateOverObjectsInRange()
301 currentPool = currentPool->GetNext(); in AllocatedByHumongousObjAllocatorUnsafe()
354 head_ = pool->GetNext(); in Pop()
384 curPool = curPool->GetNext(); in FindSuitablePool()
399 curPool = curPool->GetNext(); in IsInThisList()
411 MemoryPoolHeader *tmp = currentPool->GetNext(); in IterateAndPopOverPools()
481 MemoryPoolHeader *next = cur->GetNext(); in SortedInsert()
Dfree_object.h33 FreeObject *GetNext() const in GetNext() function
/arkcompiler/runtime_core/compiler/optimizer/ir/
Dbasicblock.cpp58 auto next_inst = inst->GetNext(); in SplitBlockAfterInstruction()
63 for (; next_inst != nullptr; next_inst = next_inst->GetNext()) { in SplitBlockAfterInstruction()
421 ASSERT(range_last->GetNext() == nullptr); in AppendRangeInst()
426 inst_db = inst_db->GetNext(); in AppendRangeInst()
455 Inst *next = after->GetNext(); in InsertAfter()
495 ASSERT(range_last->GetNext() == nullptr); in InsertRangeBefore()
501 inst_db = inst_db->GetNext(); in InsertRangeBefore()
527 Inst *next = old_inst->GetNext(); in ReplaceInst()
557 Inst *next = inst->GetNext(); in EraseInst()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
Dscheduler.cpp130 for (auto user = inst->GetNext(); user != oldLastBarrier; user = user->GetNext()) { in ProcessInst()
260 for (auto inst = bb->GetFirstInst(); inst != nullptr; inst = inst->GetNext()) { in ScheduleBasicBlock()
359 for (auto inst = first; inst != last->GetNext(); inst = inst->GetNext()) { in ScheduleInstsBetweenBarriers()
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/cg/
Dcgbb.h41 …e FOR_ALL_BB_CONST(BASE, FUNC) FOR_BB_BETWEEN_CONST(BASE, FIRST_BB_OF_FUNC(FUNC), nullptr, GetNext)
42 #define FOR_ALL_BB(BASE, FUNC) FOR_BB_BETWEEN(BASE, FIRST_BB_OF_FUNC(FUNC), nullptr, GetNext)
48 #define NEXT_INSN(INSN) (INSN)->GetNext()
55 …INSN, BLOCK) for (Insn * (INSN) = FIRST_INSN(BLOCK); (INSN) != nullptr; (INSN) = (INSN)->GetNext())
57 for (const Insn *(INSN) = FIRST_INSN(BLOCK); (INSN) != nullptr; (INSN) = (INSN)->GetNext())
303 BB *GetNext() in GetNext() function
307 const BB *GetNext() const in GetNext() function

1234567