32     uint32_t first = deque->GetFirst();  in InsertFront()  local
35     if ((first + capacity - 1) % capacity == last) {  in InsertFront()
36         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertFront()
39         first = 0;  in InsertFront()
43     first = (first + capacity - 1) % capacity;  in InsertFront()
44     elements->Set(thread, first, value);  in InsertFront()
45     deque->SetFirst(first);  in InsertFront()
53     uint32_t first = deque->GetFirst();  in InsertEnd()  local
56     if (first == (last + 1) % capacity) {  in InsertEnd()
57         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertEnd()
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()
111     uint32_t first = GetFirst();  in PopFirst()  local
115     JSTaggedValue firstElement = elements->Get(thread, first);  in PopFirst()
117     first = (first + 1) % capacity;  in PopFirst()
118     SetFirst(first);  in PopFirst()
140     uint32_t first = GetFirst();  in IsEmpty()  local
142     return first == last;  in IsEmpty()
149     uint32_t first = GetFirst();  in GetSize()  local
152     return (last - first + capacity) % capacity;  in GetSize()
160     uint32_t first = GetFirst();  in Get()  local
162     uint32_t curIndex = (first + index) % capacity;  in Get()
174     uint32_t first = GetFirst();  in Set()  local
176     uint32_t curIndex = (first + index) % capacity;  in Set()
183     uint32_t first = GetFirst();  in Has()  local
187     uint32_t index = first;  in Has()