Searched refs:q_size_ (Results 1 - 4 of 4) sorted by relevance

/external/stressapptest/src/
H A Dqueue.cc31 q_size_ = queuesize + 1;
32 pages_ = new struct page_entry[q_size_];
53 nextnextin = (nextin_ + 1) % q_size_;
93 lastin = (nextin_ - 1 + q_size_) % q_size_;
94 entries = (lastin - nextout_ + q_size_) % q_size_;
98 newindex = ((rand % entries) + nextout_) % q_size_;
109 nextout_ = (nextout_ + 1) % q_size_;
H A Dfinelock_queue.cc39 q_size_ = queuesize;
40 pages_ = new struct page_entry[q_size_];
41 pagelocks_ = new pthread_mutex_t[q_size_];
48 for (uint64 i = 0; i < q_size_; i++) {
151 for (i = 0; i < q_size_; i++)
176 for (uint64 i = 0; i < q_size_; i++) {
274 for (uint64 i = 0; i < q_size_; i++) {
330 if (!pe || !q_size_)
334 uint64 first_try = GetRandom64() % q_size_;
338 for (uint64 i = 0; i < q_size_;
[all...]
H A Dfinelock_queue.h61 return index >= 0 && static_cast<uint64>(index) < q_size_;
90 uint64 q_size_; // Size of the queue. member in class:FineLockPEQueue
108 // generator. Used when q_size_ doesn't
H A Dqueue.h76 int64 q_size_; // Size of the queue. member in class:PageEntryQueue

Completed in 163 milliseconds