33     uint32_t last = deque->GetLast();  in InsertFront()  local
35     if ((first + capacity - 1) % capacity == last) {  in InsertFront()
36         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertFront()
54     uint32_t last = deque->GetLast();  in InsertEnd()  local
56     if (first == (last + 1) % capacity) {  in InsertEnd()
57         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertEnd()
60         last = capacity - 1;  in InsertEnd()
62     elements->Set(thread, last, value);  in InsertEnd()
65     last = (last + 1) % capacity;  in InsertEnd()
66     deque->SetLast(last);  in InsertEnd()
88     uint32_t last = GetLast();  in GetTail()  local
90     return elements->Get((last + capacity - 1) % capacity);  in GetTail()
94                                                uint32_t oldCapacity, uint32_t first, uint32_t last)  in GrowCapacity()  argument
101         thread->GetEcmaVM()->GetFactory()->CopyDeque(oldElements, newCapacity, size, first, last);  in GrowCapacity()
128     uint32_t last = GetLast();  in PopLast()  local
133     elements->Set(thread, last, JSTaggedValue::Hole());  in PopLast()
134     last = (last + capacity - 1) % capacity;  in PopLast()
135     JSTaggedValue lastElement = elements->Get(last);  in PopLast()
136     SetLast(last);  in PopLast()
143     uint32_t last = GetLast();  in IsEmpty()  local
144     return first == last;  in IsEmpty()
152     uint32_t last = GetLast();  in GetSize()  local
154     return (last - first + capacity) % capacity;  in GetSize()
186     uint32_t last = GetLast();  in Has()  local
190     while (index != last) {  in Has()