Lines Matching refs:queue
52 // 2. Let queue be generator.[[AsyncGeneratorQueue]].
53 JSHandle<TaggedQueue> queue(thread, generator->GetAsyncGeneratorQueue());
54 // 3. Assert: queue is not an empty List.
55 ASSERT(!(queue->Empty()));
56 // 4. Let next be the first element of queue.
57 JSHandle<AsyncGeneratorRequest> next(thread, queue->Front());
58 // 5. Remove the first element from queue.
59 queue->Pop(thread);
90 // 2. Let queue be generator.[[AsyncGeneratorQueue]].
91 JSHandle<TaggedQueue> queue(thread, generator->GetAsyncGeneratorQueue());
92 // 3. Assert: queue is not an empty List.
93 ASSERT(!(queue->Empty()));
94 // 4. Let next be the first element of queue.
95 JSHandle<JSTaggedValue> val(thread, queue->Front());
97 // 5. Remove the first element from queue.
98 queue->Pop(thread);
131 // 5. Let queue be generator.[[AsyncGeneratorQueue]].
132 JSHandle<TaggedQueue> queue(thread, generator->GetAsyncGeneratorQueue());
133 // 6. If queue is an empty List, return undefined.
134 if (queue->Empty()) {
137 // 7. Let next be the value of the first element of queue.
138 JSHandle<AsyncGeneratorRequest> next(thread, queue->Front());
275 // 4. Let queue be generator.[[AsyncGeneratorQueue]].
279 JSHandle<TaggedQueue> queue(thread, generator->GetAsyncGeneratorQueue());
286 // 6. Append request to the end of queue.
288 TaggedQueue *newQueue = TaggedQueue::Push(thread, queue, JSHandle<JSTaggedValue>::Cast(asyncGeneratorRst));