| /arkcompiler/ets_runtime/ecmascript/mem/ |
| D | free_object_set.cpp | 48 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()
|
| D | ecma_list.h | 42 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()
|
| D | area.h | 65 Area *GetNext() const in GetNext() function
|
| D | space-inl.h | 50 auto next = current->GetNext(); in EnumerateRegions()
|
| D | space.cpp | 109 Region *next = currentRegion->GetNext(); in Sweep()
|
| /arkcompiler/ets_runtime/ecmascript/ |
| D | ecma_global_storage.h | 40 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 …]
|
| D | tagged_hash_array.cpp | 59 nextNodeVa = nextNode->GetNext(); in GetNode()
125 if (node->GetNext().IsHole()) { in Resize()
145 next = LinkedNode::Cast(nodeVa.GetTaggedObject())->GetNext(); in NodeDisperse()
196 nextVal.Update(root->GetNext()); in SetVal()
232 Set(thread, index, head->GetNext()); in RemoveNode()
235 JSTaggedValue nodeNextVa = head->GetNext(); in RemoveNode()
241 previousNode->SetNext(thread, nodeNext->GetNext()); in RemoveNode()
246 nodeNextVa = nodeNext->GetNext(); in RemoveNode()
284 if (!root->GetNext().IsHole()) { in GetCurrentNode()
285 JSHandle<JSTaggedValue> next(thread, root->GetNext()); in GetCurrentNode()
|
| D | js_finalization_registry.cpp | 100 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()
|
| D | tagged_node.cpp | 33 next.Update(next->GetNext()); in Treeing()
132 lowerHead.Update(lowerHead->GetNext()); in Divide()
137 higherHead.Update(higherHead->GetNext()); in Divide()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir/ |
| D | basicblock.cpp | 58 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()
|
| D | graph_checker.cpp | 52 ASSERT(u->GetNext() == nullptr || u->GetNext()->GetPrev() == u); in UserInputCheck()
53 u = u->GetNext(); in UserInputCheck()
199 if (inst->GetNext() == nullptr) { in CheckDataFlow()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir_builder/ |
| D | pbc_iterator.h | 29 inst_ = inst_.GetNext();
|
| D | inst_builder.cpp | 49 catch_phi = catch_phi->GetNext(); in UpdateDefsForCatch()
126 inst = inst->GetNext(); in AddCatchPhiInputs()
130 for (size_t vreg = 0; vreg < GetVRegsCount(); vreg++, inst = inst->GetNext()) { in AddCatchPhiInputs()
|
| /arkcompiler/runtime_core/compiler/tests/ |
| D | reg_alloc_graph_coloring_test.cpp | 30 ASSERT(param->GetNext()->IsSpillFill()); in GetParameterSpillFilll()
31 auto spill_fill = param->GetNext()->CastToSpillFill()->GetSpillFill(0); in GetParameterSpillFilll()
|
| D | compiler_basicblock_test.cpp | 195 EXPECT_EQ(inst->GetNext(), nullptr); in __anon9f1e038e0602()
227 EXPECT_EQ(inst->GetNext(), nullptr); in __anon9f1e038e0702()
307 EXPECT_EQ(block->GetLastInst()->GetNext(), graph->GetFirstConstInst()); in __anon9f1e038e0a02()
387 EXPECT_EQ(graph->GetFirstConstInst()->GetNext(), inst); in __anon9f1e038e0c02()
|
| D | split_resolver_test.cpp | 141 CheckSpillFills(INS(1).GetNext(), {{LocationType::STACK, LocationType::REGISTER, 0, 1}}); in TEST_F()
394 CheckSpillFills(INS(3).GetNext(), {{LocationType::REGISTER, LocationType::STACK, 0, 0}}); in TEST_F()
438 CheckSpillFills(INS(3).GetNext(), {{LocationType::STACK, LocationType::REGISTER, 0, 0}, in TEST_F()
537 CheckSpillFills(INS(2).GetNext(), {{LocationType::REGISTER, LocationType::STACK, 0, 0}}); in TEST_F()
698 CheckSpillFills(INS(4).GetNext(), {{LocationType::REGISTER, LocationType::STACK, 1, 0}}); in TEST_F()
1046 CheckSpillFills(INS(5).GetNext(), {{LocationType::IMMEDIATE, LocationType::REGISTER, 0, 2}}); in TEST_F()
1047 CheckSpillFills(INS(6).GetNext(), {{LocationType::IMMEDIATE, LocationType::REGISTER, 0, 2}}); in TEST_F()
1081 CheckSpillFills(INS(2).GetNext(), {{LocationType::REGISTER, LocationType::STACK, 1, 0}}); in TEST_F()
1226 CheckSpillFills(INS(6).GetNext(), {{LocationType::STACK, LocationType::REGISTER, 0, 0}, in TEST_F()
1230 CheckSpillFills(INS(7).GetNext(), {{LocationType::STACK, LocationType::REGISTER, 0, 0}, in TEST_F()
|
| D | basicblock_test.cpp | 349 ASSERT_EQ(new_bb->GetFirstInst()->GetNext(), &INS(4)); in TEST_F()
350 ASSERT_EQ(new_bb->GetFirstInst()->GetNext()->GetNext(), &INS(5)); in TEST_F()
|
| /arkcompiler/runtime_core/bytecode_optimizer/ |
| D | reg_acc_alloc.cpp | 31 compiler::Inst *inst = src_inst->GetNext(); in IsAccWriteBetween()
66 inst = inst->GetNext(); in IsAccWriteBetween()
|
| /arkcompiler/ets_runtime/ecmascript/js_api/ |
| D | js_api_hashmap_iterator.cpp | 105 if (!prevNode->GetNext().IsHole()) { in FastGetCurrentNode()
106 JSHandle<JSTaggedValue> next(thread, prevNode->GetNext()); in FastGetCurrentNode()
|
| D | js_api_hashset_iterator.cpp | 100 if (!prevNode->GetNext().IsHole()) { in FastGetCurrentNode()
101 JSHandle<JSTaggedValue> next(thread, prevNode->GetNext()); in FastGetCurrentNode()
|
| D | js_api_hashmap.cpp | 73 node = p->GetNext(); in HasValueLinkedNode()
179 node.Update(node->GetNext()); in SetAllLinkedNode()
|
| /arkcompiler/ets_runtime/ecmascript/tests/ |
| D | rb_tree_node_test.cpp | 190 node = JSHandle<LinkedNode>(thread, node->GetNext())) { in HWTEST_F_L0()
201 node = JSHandle<LinkedNode>(thread, node->GetNext())) { in HWTEST_F_L0()
232 for (; !head.GetTaggedValue().IsHole(); head = JSHandle<LinkedNode>(thread, head->GetNext())) { in HWTEST_F_L0()
|
| /arkcompiler/runtime_core/disassembler/templates/ |
| D | get_ins_info.cpp.erb | 71 bc_ins = bc_ins.GetNext();
|
| /arkcompiler/runtime_core/libpandafile/ |
| D | bytecode_instruction.h | 316 BytecodeInst GetNext() const in GetNext() function
321 BytecodeInst GetNext() const in GetNext() function
|
| /arkcompiler/ets_runtime/ecmascript/pgo_profiler/ |
| D | pgo_profiler_info.h | 736 descInfo = GetNext(descInfo); in Convert()
740 descInfo = GetNext(descInfo); in Convert()
744 descInfo = GetNext(descInfo); in Convert()
798 const PGOLayoutDescInfo *GetNext(const PGOLayoutDescInfo *current) const in GetNext() function
|