38     uint32_t first = deque->GetFirst();  in InsertFront()  local
41     if ((first + capacity - 1) % capacity == last) {  in InsertFront()
42         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertFront()
45         first = 0;  in InsertFront()
49     first = (first + capacity - 1) % capacity;  in InsertFront()
50     elements->Set(thread, first, value);  in InsertFront()
51     deque->SetFirst(first);  in InsertFront()
59     uint32_t first = deque->GetFirst();  in InsertEnd()  local
62     if (first == (last + 1) % capacity) {  in InsertEnd()
63         elements = GrowCapacity(thread, deque, capacity, first, last);  in InsertEnd()
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()
117     uint32_t first = GetFirst();  in PopFirst()  local
121     JSTaggedValue firstElement = elements->Get(first);  in PopFirst()
123     first = (first + 1) % capacity;  in PopFirst()
124     SetFirst(first);  in PopFirst()
146     uint32_t first = GetFirst();  in IsEmpty()  local
148     return first == last;  in IsEmpty()
155     uint32_t first = GetFirst();  in GetSize()  local
158     return (last - first + capacity) % capacity;  in GetSize()
166     uint32_t first = GetFirst();  in Get()  local
168     uint32_t curIndex = (first + index) % capacity;  in Get()
177     uint32_t first = GetFirst();  in Set()  local
179     uint32_t curIndex = (first + index) % capacity;  in Set()
186     uint32_t first = GetFirst();  in Has()  local
190     uint32_t index = first;  in Has()