Searched refs:front_ (Results 1 – 3 of 3) sorted by relevance
116 TrivialQueue() : QueueBase<S>(TRIVIAL_QUEUE), front_(kNoStateId) {} in TrivialQueue()117 StateId Head() const { return front_; } in Head()118 void Enqueue(StateId s) { front_ = s; } in Enqueue()119 void Dequeue() { front_ = kNoStateId; } in Dequeue()121 bool Empty() const { return front_ == kNoStateId; } in Empty()122 void Clear() { front_ = kNoStateId; } in Clear()136 StateId front_; variable322 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId), in TopOrderQueue()337 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId), in TopOrderQueue()340 StateId Head() const { return state_[front_]; } in Head()[all …]
374 : front_(NULL), in PromotionQueue()415 return (front_ == rear_) && in is_empty()423 if (front_ == rear_) { in remove()430 if (NewSpacePage::IsAtStart(reinterpret_cast<Address>(front_))) { in remove()432 NewSpacePage::FromAddress(reinterpret_cast<Address>(front_)); in remove()434 front_ = reinterpret_cast<intptr_t*>(front_page->prev_page()->area_end()); in remove()436 *target = reinterpret_cast<HeapObject*>(*(--front_)); in remove()437 *size = static_cast<int>(*(--front_)); in remove()440 reinterpret_cast<Address>(front_)); in remove()445 intptr_t* front_;
1365 front_ = rear_ = in Initialize()1376 intptr_t* head_end = Min(front_, reinterpret_cast<intptr_t*>(p->area_end())); in RelocateQueueHead()