mem/cache/queue.hh

100     typename Entry::List readyList;
106         if (readyList.empty() ||
107             readyList.back()->readyTime <= entry->readyTime) {
108             return readyList.insert(readyList.end(), entry);
111         for (auto i = readyList.begin(); i != readyList.end(); ++i) {
113                 return readyList.insert(i, entry);
207         for (const auto& ready_entry : readyList) {
216      * Returns the WriteQueueEntry at the head of the readyList.
221         if (readyList.empty() || readyList.front()->readyTime > curTick()) {
224         return readyList.front();
229         return readyList.empty() ? MaxTick : readyList.front()->readyTime;
246             readyList.erase(entry->readyIter);