/ark/js_runtime/ecmascript/ |
D | ecma_global_storage.h | 38 NodeList *next = topGlobalNodes_; in ~EcmaGlobalStorage() local 40 while (next != nullptr) { in ~EcmaGlobalStorage() 41 current = next; in ~EcmaGlobalStorage() 42 next = current->GetNext(); in ~EcmaGlobalStorage() 46 next = topWeakGlobalNodes_; in ~EcmaGlobalStorage() 47 while (next != nullptr) { in ~EcmaGlobalStorage() 48 current = next; in ~EcmaGlobalStorage() 49 next = current->GetNext(); in ~EcmaGlobalStorage() 158 inline void SetNext(NodeList *next) in SetNext() argument 160 next_ = next; in SetNext() [all …]
|
D | js_iterator.cpp | 77 JSHandle<JSTaggedValue> next(JSObject::GetMethod(thread, iter, key)); in IteratorNext() local 78 ASSERT(next->IsCallable()); in IteratorNext() 79 JSTaggedValue ret = JSFunction::Call(thread, next, iter, 0, nullptr); in IteratorNext() 95 JSHandle<JSTaggedValue> next(JSObject::GetMethod(thread, iter, key)); in IteratorNext() local 96 ASSERT(next->IsCallable()); in IteratorNext() 99 JSTaggedValue ret = JSFunction::Call(thread, next, iter, 1, arguments->GetArgv()); in IteratorNext()
|
D | ecma_global_storage-inl.h | 130 auto next = (*freeList)->GetFreeNext(); in NewGlobalHandleImplement() local 133 if (next != nullptr) { in NewGlobalHandleImplement() 134 next->SetFreePrev(nullptr); in NewGlobalHandleImplement() 136 *freeList = next; in NewGlobalHandleImplement()
|
/ark/js_runtime/test/moduletest/container/ |
D | container_treemap.js | 40 print("test keys, out:", iteratorKey.next().value == "a" && iteratorKey.next().value == "b" && 41 iteratorKey.next().value == "c" && iteratorKey.next().value == undefined); 44 print("test values, out:", iteratorValues.next().value == "aa" && iteratorValues.next().value == "b… 45 iteratorValues.next().value == "cc" && iteratorValues.next().value == undefined); 48 iteratorEntries.next().value; 49 iteratorEntries.next().value; 50 print("test entries, out:", iteratorEntries.next().value); 51 print(iteratorEntries.next().value);
|
D | container_treeset.js | 38 print("test values, out:", iteratorSetValues.next().value == "aa" && iteratorSetValues.next().value… 39 iteratorSetValues.next().value == "cc" && iteratorSetValues.next().value == undefined); 42 iteratorSetEntries.next().value; 43 iteratorSetEntries.next().value; 44 print("test entries, out:", iteratorSetEntries.next().value); 45 print(iteratorSetEntries.next().value);
|
/ark/runtime_core/verification/debug/parser/ |
D | parser.h | 72 using next = base_parser<Context, type_sum<NType, T>, Char, Iter>; 76 static next<charset<Char>> of_charset(const charset<Char> &c) 92 static next<Char *> of_string(Char *str) 110 static next<op_end> end() 116 next<op_optional> operator~() && 125 next<op_optional> operator~() const & 137 bool, next<type_prod<op_action, F>>>::type 163 next<type_prod<op_action, F>>>::type 188 next<type_prod<op_action, F>>>::type 213 …typename if_type<decltype(f(action::START, ref_to<Context>())), bool, next<type_prod<op_action, F>… [all …]
|
/ark/runtime_core/tests/cts-assembly/ |
D | obj-13.pa | 18 # Obj* next; 24 # o->next = newObj; 32 # head->next = nullptr; 37 # cur = cur->next; 44 # cur = cur->next; 54 Obj next 62 stobj.obj a0, Obj.next 78 ldobj.obj v1, Obj.next 94 ldobj.obj v1, Obj.next
|
/ark/js_runtime/test/moduletest/generator/ |
D | generator.js | 22 var a = p.next() 24 var b = p.next() 26 var c = p.next() 28 var d = p.next()
|
/ark/runtime_core/libpandafile/ |
D | helpers.h | 90 …e std::optional<T> GetOptionalTaggedValue(Span<const uint8_t> sp, E tag, Span<const uint8_t> *next) in GetOptionalTaggedValue() argument 95 *next = sp; in GetOptionalTaggedValue() 98 *next = sp; in GetOptionalTaggedValue() 107 …e void EnumerateTaggedValues(Span<const uint8_t> sp, E tag, Callback cb, Span<const uint8_t> *next) in EnumerateTaggedValues() argument 115 if (next == nullptr) { in EnumerateTaggedValues() 119 *next = sp; in EnumerateTaggedValues()
|
/ark/js_runtime/test/moduletest/yieldstar/ |
D | yieldstar.js | 26 var a = p.next() 28 var b = p.next() 30 var c = p.next()
|
/ark/runtime_core/runtime/mem/ |
D | freelist.h | 206 … auto next = static_cast<MemoryBlockHeader *>(ToVoidPtr(ToUintPtr(GetRawMemory()) + GetSize())); in GetNextHeader() local 208 return next; in GetNextHeader() 228 MemoryBlockHeader *next = GetNextHeader(); in GetNextUsedHeader() local 229 if (next != nullptr) { in GetNextUsedHeader() 230 if (!next->IsUsed()) { in GetNextUsedHeader() 231 next = next->GetNextHeader(); in GetNextUsedHeader() 232 if (next != nullptr) { in GetNextUsedHeader() 234 ASSERT(next->IsUsed()); in GetNextUsedHeader() 238 return next; in GetNextUsedHeader()
|
D | humongous_obj_allocator.h | 165 void Initialize(size_t size, MemoryPoolHeader *prev, MemoryPoolHeader *next); 182 MemoryPoolHeader *next = next_; in GetNext() local 184 return next; in GetNext() 196 void SetNext(MemoryPoolHeader *next) in SetNext() argument 199 next_ = next; in SetNext()
|
D | freelist_allocator.h | 187 void Initialize(size_t size, MemoryPoolHeader *prev, MemoryPoolHeader *next); 202 MemoryPoolHeader *next = next_; in GetNext() local 204 return next; in GetNext() 216 void SetNext(MemoryPoolHeader *next) in SetNext() argument 219 next_ = next; in SetNext()
|
D | freelist_allocator-inl.h | 350 MemoryPoolHeader *next = current_pool->GetNext(); in VisitAndRemoveFreePools() local 352 if (next != nullptr) { in VisitAndRemoveFreePools() 353 ASSERT(next->GetPrev() == current_pool); in VisitAndRemoveFreePools() 354 next->SetPrev(prev); in VisitAndRemoveFreePools() 363 prev->SetNext(next); in VisitAndRemoveFreePools() 368 mempool_head_ = next; in VisitAndRemoveFreePools() 575 size_t size, MemoryPoolHeader *prev, MemoryPoolHeader *next) in Initialize() argument 578 << prev << " and next link = " << next; in Initialize() 582 next_ = next; in Initialize() 717 FreeListHeader *next = current->GetNextFree(); in FindTheMostSuitableBlockInOrderedList() local [all …]
|
/ark/js_runtime/ecmascript/mem/ |
D | free_object_list.cpp | 62 FreeObjectSet *next = nullptr; in Allocate() local 67 next = current->next_; in Allocate() 78 current = next; in Allocate() 101 FreeObjectSet *next = nullptr; in LookupSuitableFreeObject() local 106 next = current->next_; in LookupSuitableFreeObject() 112 current = next; in LookupSuitableFreeObject() 256 FreeObjectSet *next = current->next_; in EnumerateSets() local 258 current = next; in EnumerateSets()
|
D | ecma_list.h | 94 T *next = node->GetNext(); in RemoveNode() local 97 if (next != nullptr) { in RemoveNode() 98 next->LinkPrev(prev); in RemoveNode() 101 prev->LinkNext(next); in RemoveNode()
|
D | area.h | 46 void LinkNext(Area *next) in LinkNext() argument 48 next_ = next; in LinkNext()
|
/ark/runtime_core/libpandabase/utils/ |
D | list.h | 36 explicit ListNode(ListNode *next) : next_(next) {} in ListNode() argument 374 DListNode *next = nullptr; member 393 node_ = node_->next; 528 return Iterator(head_.next); in begin() 534 return ConstIterator(head_.next); in begin() 576 new_node->next = position.node_; in insert() 578 position.node_->prev->next = new_node; in insert() 592 node->next->prev = node->prev; in erase() 593 node->prev->next = node->next; in erase() 594 return Iterator(node->next); in erase() [all …]
|
/ark/runtime_core/runtime/tooling/ |
D | debug_inf.cpp | 152 auto next = codeItem->next_.load(std::memory_order_relaxed); in DelCodeMetaInfoImpl() local 154 codeItem->prev_->next_.store(next, std::memory_order_relaxed); in DelCodeMetaInfoImpl() 156 metaInfo->head_.store(next, std::memory_order_relaxed); in DelCodeMetaInfoImpl() 159 if (next != nullptr) { in DelCodeMetaInfoImpl() 160 next->prev_ = codeItem->prev_; in DelCodeMetaInfoImpl()
|
/ark/js_runtime/ecmascript/builtins/ |
D | builtins_weak_map.cpp | 77 JSHandle<JSTaggedValue> next = JSIterator::IteratorStep(thread, iter); in WeakMapConstructor() local 78 RETURN_VALUE_IF_ABRUPT_COMPLETION(thread, next.GetTaggedValue()); in WeakMapConstructor() 80 while (!next->IsFalse()) { in WeakMapConstructor() 82 RETURN_VALUE_IF_ABRUPT_COMPLETION(thread, next.GetTaggedValue()); in WeakMapConstructor() 84 JSHandle<JSTaggedValue> nextValue(JSIterator::IteratorValue(thread, next)); in WeakMapConstructor() 86 RETURN_VALUE_IF_ABRUPT_COMPLETION(thread, next.GetTaggedValue()); in WeakMapConstructor() 124 next = JSIterator::IteratorStep(thread, iter); in WeakMapConstructor()
|
D | builtins_weak_set.cpp | 77 JSHandle<JSTaggedValue> next = JSIterator::IteratorStep(thread, iter); in WeakSetConstructor() local 79 while (!next->IsFalse()) { in WeakSetConstructor() 81 RETURN_VALUE_IF_ABRUPT_COMPLETION(thread, next.GetTaggedValue()); in WeakSetConstructor() 83 JSHandle<JSTaggedValue> nextValue(JSIterator::IteratorValue(thread, next)); in WeakSetConstructor() 101 next = JSIterator::IteratorStep(thread, iter); in WeakSetConstructor()
|
D | builtins_promise.cpp | 455 JSMutableHandle<JSTaggedValue> next(thread, globalConst->GetUndefined()); in PerformPromiseAll() local 458 next.Update(JSIterator::IteratorStep(thread, itor).GetTaggedValue()); in PerformPromiseAll() 462 next.Update(JSPromise::IfThrowGetThrowValue(thread).GetTaggedValue()); in PerformPromiseAll() 465 RETURN_COMPLETION_IF_ABRUPT(thread, next); in PerformPromiseAll() 467 if (next->IsFalse()) { in PerformPromiseAll() 493 JSHandle<JSTaggedValue> nextVal = JSIterator::IteratorValue(thread, next); in PerformPromiseAll() 571 JSMutableHandle<JSTaggedValue> next(thread, globalConst->GetUndefined()); in PerformPromiseRace() local 573 next.Update(JSIterator::IteratorStep(thread, iterator).GetTaggedValue()); in PerformPromiseRace() 576 next.Update(JSPromise::IfThrowGetThrowValue(thread).GetTaggedValue()); in PerformPromiseRace() 578 RETURN_COMPLETION_IF_ABRUPT(thread, next); in PerformPromiseRace() [all …]
|
/ark/runtime_core/verification/job_queue/ |
D | job.h | 91 auto nxt = next; in TakeNext() 92 next = nullptr; in TakeNext() 98 next = nxt; in SetNext() 151 Job *next {nullptr};
|
/ark/js_runtime/ecmascript/tooling/backend/ |
D | js_pt_extractor.cpp | 92 auto next = it + 1; in GetStepRanges() local 94 JSPtStepRange range {it->offset, next != table.end() ? next->offset : UINT32_MAX}; in GetStepRanges()
|
/ark/runtime_core/verification/models/typesystem/ |
D | ark_subtyping_closure.als | 66 // subtyping relation on next step 111 Id est, only next forms of other types should be considered: 135 | {tn1, tn2: Type | // search tn1, tn2, that should be subtyped tn1 <: tn2 on next step 167 // calculate next set of affected type pairs 214 some TypeSystem.to_be_subtyped.(first.next) 215 #TypeSystem.to_be_subtyped.(first.next.next) > 1 216 #TypeSystem.to_be_subtyped.(first.next.next.next) > 1
|