Home
last modified time | relevance | path

Searched refs:next (Results 1 - 25 of 239) sorted by relevance

12345678910

/arkcompiler/ets_runtime/test/moduletest/container/
H A Dutility.js18 res.set("test keys:", iteratorKey1.next().value == "a" && iteratorKey1.next().value == "b" &&
19 iteratorKey1.next().value == "c" && iteratorKey1.next().value == undefined);
22 res.set("test values:", iteratorValues1.next().value == "aa" && iteratorValues1.next().value == "bb" &&
23 iteratorValues1.next().value == "cc" && iteratorValues1.next().value == undefined);
26 iteratorEntries1.next().value;
27 iteratorEntries1.next()
[all...]
H A Dcontainer_hashset.js38 map.set("test values:", iteratorSetValues.next().value == "aa" && iteratorSetValues.next().value == "bb" &&
39 iteratorSetValues.next().value == "cc" && iteratorSetValues.next().value == undefined);
42 iteratorSetEntries.next().value;
43 iteratorSetEntries.next().value;
44 map.set("test entries1:", iteratorSetEntries.next().value != undefined);
45 map.set("test entries2:", iteratorSetEntries.next().value == undefined);
95 map.set("test values:", iteratorSetValues1.next().value == "aa" && iteratorSetValues1.next()
[all...]
H A Dcontainer_lightweightset.js42 res.set("test values:", iteratorValues1.next().value == 1 && iteratorValues1.next().value == 2 &&
43 iteratorValues1.next().value == 3 && iteratorValues1.next().value == undefined);
46 iteratorEntries1.next().value;
47 iteratorEntries1.next().value;
48 res.set("test entries1:", iteratorEntries1.next().value != undefined);
49 res.set("itest entries2:", iteratorEntries1.next().value == undefined);
123 let temp = iter.next();
128 temp = iter.next();
[all...]
H A Dcontainer_treeset.js50 map.set("test values:", iteratorSetValues.next().value == "aa" && iteratorSetValues.next().value == "bb" &&
51 iteratorSetValues.next().value == "cc" && iteratorSetValues.next().value == undefined);
54 iteratorSetEntries.next().value;
55 iteratorSetEntries.next().value;
56 map.set("test entries1:", iteratorSetEntries.next().value != undefined);
57 map.set("test entries2:", iteratorSetEntries.next().value == undefined);
173 map.set("test values:", iteratorSetValues1.next().value == "aa" && iteratorSetValues1.next()
[all...]
/arkcompiler/runtime_core/static_core/runtime/tooling/sampler/
H A Dlock_free_queue.cpp29 Node *next = tail->next.load(std::memory_order_acquire); in Push() local
35 if (next == nullptr) { in Push()
36 if (tail->next.compare_exchange_weak(next, newNode)) { in Push()
42 Node *newTail = next; in Push()
57 Node *next = head->next.load(std::memory_order_acquire); in Pop() local
64 ASSERT(next != nullptr); in Pop()
65 Node *newTail = next; in Pop()
[all...]
/arkcompiler/runtime_core/static_core/compiler/optimizer/code_generator/
H A Dspill_fill_encoder.cpp84 auto next = std::next(it); in SortSpillFillData() local
85 while (next != spillFills->end() && it->SrcType() == next->SrcType() && it->DstType() == next->DstType()) { in SortSpillFillData()
86 ++next; in SortSpillFillData()
90 std::sort(it, next, [](auto sf1, auto sf2) { return sf1.DstValue() > sf2.DstValue(); }); in SortSpillFillData()
93 std::sort(it, next, [](auto sf1, auto sf2) { return sf1.SrcValue() > sf2.SrcValue(); }); in SortSpillFillData()
96 it = next; in SortSpillFillData()
120 auto nextIt = std::next(i in EncodeSpillFill()
121 SpillFillData *next = nextIt == end ? nullptr : &(*nextIt); EncodeSpillFill() local
222 EncodeRegisterToX(const SpillFillData &sf, const SpillFillData *next, int consecutiveOpsHint) EncodeRegisterToX() argument
262 EncodeStackToX(const SpillFillData &sf, const SpillFillData *next, int consecutiveOpsHint) EncodeStackToX() argument
[all...]
/arkcompiler/ets_runtime/ecmascript/
H A Decma_global_storage.h96 void Reset([[maybe_unused]] JSThread *thread, Node *next, JSTaggedType value, bool isUsing) in Reset() argument
99 SetNext(next); in Reset()
103 memtrace((void *)next, sizeof(Node), "ArkJsGlobalHandle", isUsing); in Reset()
118 void Reset(JSThread *thread, Node *next, JSTaggedType value, bool isUsing) in Reset() argument
120 Node::Reset(thread, next, value, isUsing); in Reset()
331 inline void SetNext(NodeList *next) in SetNext() argument
333 next_ = next; in SetNext()
349 inline void SetFreeNext(NodeList<T> *next) in SetFreeNext() argument
351 freeNext_ = next; in SetFreeNext()
370 T *next in IterateUsageGlobal() local
420 auto *next = topGlobalNodes_; ~EcmaGlobalStorage() local
481 NodeList<T> *next = topGlobalNodes_; IterateUsageGlobal() local
494 NodeList<WeakNode> *next = topWeakGlobalNodes_; IterateWeakUsageGlobal() local
557 auto next = (*freeList)->GetFreeNext(); NewGlobalHandleImplement() local
[all...]
/arkcompiler/ets_runtime/test/moduletest/mapget/
H A Dmapget.js236 midNotTought.next();
239 mid.next();
241 last.next();
242 last.next();
244 while (end.next().done) {
250 if (!begin.next().done) {
253 if (!mid.next().done) {
256 if (!last.next().done) {
259 if (!end.next().done) {
265 let v = beginNotTought.next();
[all...]
/arkcompiler/ets_runtime/test/aottest/asyncgenerator/
H A Dasyncgenerator.js25 next: function() {
39 asyncIterator_1.next().then(function() {
54 next: function() {
64 asyncIterator_2.next().then(function() {
81 next() {
109 iter_3.next().then(() => {
/arkcompiler/ets_runtime/ecmascript/compiler/base/
H A Ddepend_chain_helper.cpp24 head_ = head_->next; in Merge()
32 rhs = rhs->next; in Merge()
37 lhs = lhs->next; in Merge()
38 rhs = rhs->next; in Merge()
58 lhs = lhs->next; in Equals()
59 rhs = rhs->next; in Equals()
66 // assign node->next to head in UpdateNode()
H A Ddepend_chain_helper.h27 Node(GateRef gate, Node* next) : gate(gate), next(next) {} in Node()
29 Node *next; member
39 node_ = node_->next; in operator ++()
/arkcompiler/ets_frontend/es2panda/test/compiler/js/async-generator/file/
H A Dgenerator-yield-async-await-return-ut.js43 let n = g.next();
48 n = g.next();
53 n = g.next();
58 n = g.next();
63 n = g.next();
H A Dgenerator-yield-async-await-ut.js42 let n = g.next();
47 n = g.next();
52 n = g.next();
57 n = g.next();
62 n = g.next();
H A Dgenerator-yield-async-return-ut.js43 let n = g.next();
48 n = g.next();
53 n = g.next();
58 n = g.next();
63 n = g.next();
H A Dgenerator-yield-return-ut.js34 let n = g.next();
37 n = g.next();
40 n = g.next();
43 n = g.next();
/arkcompiler/ets_frontend/es2panda/test/compiler/js/async-generator/class/
H A Dgenerator-yield-async-await-return-ut.js46 let n = g.next();
51 n = g.next();
56 n = g.next();
61 n = g.next();
66 n = g.next();
H A Dgenerator-yield-async-await-ut.js45 let n = g.next();
50 n = g.next();
55 n = g.next();
60 n = g.next();
65 n = g.next();
H A Dgenerator-yield-async-return-ut.js46 let n = g.next();
51 n = g.next();
56 n = g.next();
61 n = g.next();
66 n = g.next();
H A Dgenerator-yield-return-ut.js37 let n = g.next();
40 n = g.next();
43 n = g.next();
46 n = g.next();
/arkcompiler/ets_frontend/es2panda/test/compiler/js/async-generator/object/
H A Dgenerator-yield-async-await-return-ut.js45 let n = g.next();
50 n = g.next();
55 n = g.next();
60 n = g.next();
65 n = g.next();
H A Dgenerator-yield-async-await-ut.js44 let n = g.next();
49 n = g.next();
54 n = g.next();
59 n = g.next();
64 n = g.next();
H A Dgenerator-yield-async-return-ut.js45 let n = g.next();
50 n = g.next();
55 n = g.next();
60 n = g.next();
65 n = g.next();
H A Dgenerator-yield-return-ut.js36 let n = g.next();
39 n = g.next();
42 n = g.next();
45 n = g.next();
/arkcompiler/runtime_core/static_core/plugins/ets/tests/interop_js/tests/proxies/ets_proxy/
H A Dcheck_proxy_objects.js23 let expected = ['next', 'tag', 'getNext', 'setNext', 'constructor'];
34 ASSERT_EQ(n1.next, null);
45 ASSERT_EQ(n2.next, n1);
48 ASSERT_EQ(n2.next, n1);
54 head.next = new ListNode(1, new ListNode(2, new ListNode(3, head)));
56 for (let n = head, i = 0; i < 256; ++i, n = n.next) {
/arkcompiler/runtime_core/static_core/runtime/tooling/
H A Ddebug_inf.cpp34 std::atomic<PCodeItem *> next; member
129 codeItem->next.store(head, std::memory_order_relaxed); in AddCodeMetaInfoImpl()
160 auto next = codeItem->next.load(std::memory_order_relaxed); in DelCodeMetaInfoImpl() local
164 codeItem->prev->next.store(next, std::memory_order_relaxed); in DelCodeMetaInfoImpl()
168 metaInfo->head.store(next, std::memory_order_relaxed); in DelCodeMetaInfoImpl()
171 if (next != nullptr) { in DelCodeMetaInfoImpl()
172 next->prev = codeItem->prev; in DelCodeMetaInfoImpl()

Completed in 10 milliseconds

12345678910