Home
last modified time | relevance | path

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

/external/stressapptest/src/
Dqueue.cc31 q_size_ = queuesize + 1; in PageEntryQueue()
32 pages_ = new struct page_entry[q_size_]; in PageEntryQueue()
53 nextnextin = (nextin_ + 1) % q_size_; in Push()
93 lastin = (nextin_ - 1 + q_size_) % q_size_; in PopRandom()
94 entries = (lastin - nextout_ + q_size_) % q_size_; in PopRandom()
98 newindex = ((rand % entries) + nextout_) % q_size_; in PopRandom()
109 nextout_ = (nextout_ + 1) % q_size_; in PopRandom()
Dfinelock_queue.cc39 q_size_ = queuesize; in FineLockPEQueue()
40 pages_ = new struct page_entry[q_size_]; in FineLockPEQueue()
41 pagelocks_ = new pthread_mutex_t[q_size_]; in FineLockPEQueue()
48 for (uint64 i = 0; i < q_size_; i++) { in FineLockPEQueue()
151 for (i = 0; i < q_size_; i++) in ~FineLockPEQueue()
176 for (uint64 i = 0; i < q_size_; i++) { in QueueAnalysis()
274 for (uint64 i = 0; i < q_size_; i++) { in GetPageFromPhysical()
330 if (!pe || !q_size_) in GetRandomWithPredicateTag()
334 uint64 first_try = GetRandom64() % q_size_; in GetRandomWithPredicateTag()
338 for (uint64 i = 0; i < q_size_; i++) { in GetRandomWithPredicateTag()
[all …]
Dfinelock_queue.h61 return index >= 0 && static_cast<uint64>(index) < q_size_; in valid_index()
90 uint64 q_size_; // Size of the queue. variable
Dqueue.h76 int64 q_size_; // Size of the queue. variable