heap.h | 261 PromotionQueue() : front_(NULL), rear_(NULL) { } 264 front_ = rear_ = reinterpret_cast<intptr_t*>(start_address); 267 bool is_empty() { return front_ <= rear_; } 275 ASSERT(front_ >= rear_); 281 intptr_t* rear_; member in class:v8::internal::PromotionQueue [all...] |