HomeSort by relevance Sort by last modified time
    Searched refs:old_top_ (Results 1 - 6 of 6) sorted by null

  /external/v8/src/
store-buffer.cc 43 old_top_(NULL),
68 old_top_ = old_start_ =
114 old_start_ = old_top_ = old_limit_ = old_reserved_limit_ = NULL;
157 for (Address* read = old_start_; read < old_top_; read++) {
166 old_top_ = write;
171 while (old_limit_ - old_top_ < space_needed &&
180 if (old_limit_ - old_top_ >= space_needed) return;
201 if (old_limit_ - old_top_ > old_top_ - old_start_) return;
219 ASSERT(i != 0 || old_top_ == old_start_)
    [all...]
store-buffer-inl.h 62 Address* top = old_top_;
64 old_top_ = top;
store-buffer.h 98 Object*** Top() { return reinterpret_cast<Object***>(old_top_); }
102 old_top_ = reinterpret_cast<Address*>(top);
136 Address* old_top_; member in class:v8::internal::StoreBuffer
  /external/chromium_org/v8/src/
store-buffer-inl.h 63 Address* top = old_top_;
65 old_top_ = top;
store-buffer.cc 45 old_top_(NULL),
70 old_top_ = old_start_ =
116 old_start_ = old_top_ = old_limit_ = old_reserved_limit_ = NULL;
133 for (Address* read = old_start_; read < old_top_; read++) {
142 old_top_ = write;
147 return old_limit_ - old_top_ >= space_needed;
152 while (old_limit_ - old_top_ < space_needed &&
201 ASSERT(i != (kSampleFinenesses - 1) || old_top_ == old_start_);
218 for (Address* p = old_start_; p < old_top_; p += prime_sample_step) {
244 for (Address* p = old_start_; p < old_top_; p++)
    [all...]
store-buffer.h 106 Object*** Top() { return reinterpret_cast<Object***>(old_top_); }
110 old_top_ = reinterpret_cast<Address*>(top);
144 Address* old_top_; member in class:v8::internal::StoreBuffer

Completed in 218 milliseconds