39     uint32_t last = deque->GetLast();  in InsertFront()  local
41     if ((first + capacity - 1) % capacity == last) {  in InsertFront()
42         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertFront()
60     uint32_t last = deque->GetLast();  in InsertEnd()  local
62     if (first == (last + 1) % capacity) {  in InsertEnd()
63         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertEnd()
66         last = capacity - 1;  in InsertEnd()
68     elements->Set(thread, last, value);  in InsertEnd()
71     last = (last + 1) % capacity;  in InsertEnd()
72     deque->SetLast(last);  in InsertEnd()
94     uint32_t last = GetLast();  in GetTail()  local
96     return elements->Get((last + capacity - 1) % capacity);  in GetTail()
100                                                uint32_t oldCapacity, uint32_t first, uint32_t last)  in GrowCapacity()  argument
107         thread->GetEcmaVM()->GetFactory()->CopyDeque(oldElements, newCapacity, size, first, last);  in GrowCapacity()
133     uint32_t last = GetLast();  in PopLast()  local
138     last = (last + capacity - 1) % capacity;  in PopLast()
139     JSTaggedValue lastElement = elements->Get(last);  in PopLast()
140     SetLast(last);  in PopLast()
147     uint32_t last = GetLast();  in IsEmpty()  local
148     return first == last;  in IsEmpty()
156     uint32_t last = GetLast();  in GetSize()  local
158     return (last - first + capacity) % capacity;  in GetSize()
187     uint32_t last = GetLast();  in Has()  local
191     while (index != last) {  in Has()