Searched refs:readyList (Results 1 - 10 of 10) sorted by relevance

/gem5/src/mem/cache/
H A Dqueue.hh100 typename Entry::List readyList; member in class:Queue
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
[all...]
H A Dmshr_queue.cc82 readyList.erase(mshr->readyIter);
83 mshr->readyIter = readyList.insert(readyList.begin(), mshr);
91 auto it = std::find_if(mshr->readyIter, readyList.end(),
95 readyList.splice(it, readyList, mshr->readyIter);
102 readyList.erase(mshr->readyIter);
H A Dmshr_queue.hh120 * readyList or deallocates the MSHR if it does not expect a response.
146 return !readyList.empty();
/gem5/src/gpu-compute/
H A Dscoreboard_check_stage.cc59 readyList.clear();
72 readyList.push_back(&computeUnit->readyList[unitId]);
136 readyList[unitId]->clear();
148 readyList[unitId]->push_back(curWave);
155 readyList[computeUnit->GlbMemUnitId()]->push_back(curWave);
158 readyList[computeUnit->ShrMemUnitId()]->push_back(curWave);
161 readyList[computeUnit->GlbMemUnitId()]->push_back(curWave);
164 readyList[computeUnit->GlbMemUnitId()]->push_back(curWave);
H A Dschedule_stage.cc67 scheduler[j].bindList(&computeUnit->readyList[j]);
126 uint32_t readyListSize = computeUnit->readyList[j].size();
142 assert(computeUnit->readyList[j].size() == readyListSize - 1);
H A Dscoreboard_check_stage.hh62 * added to readyList.
95 std::vector<std::vector<Wavefront*>*> readyList; member in class:ScoreboardCheckStage
99 // is already present in the readyList
H A Dcompute_unit.hh107 // Each execution resource has a ready list. readyList is
110 // TODO: make enum to index readyList
111 std::vector<std::vector<Wavefront*>> readyList; member in class:ComputeUnit
115 // is already present in the readyList. waveStatusList is
H A Dcompute_unit.cc172 readyList.clear();
594 readyList.resize(numSIMDs + numGlbMemUnits + numLocMemUnits);
/gem5/src/cpu/trace/
H A Dtrace_cpu.cc322 // Print readyList
326 auto free_itr = readyList.begin();
336 for (auto& free_node : readyList) {
434 DPRINTFR(TraceCPUData, "\tdepGraph = %d, readyList = %d, "
435 "depFreeQueue = %d ,", depGraph.size(), readyList.size(),
448 // then issue it, i.e. add the node to readyList.
458 // Proceed to execute from readyList
460 auto free_itr = readyList.begin();
461 // Iterate through readyList until the next free node has its execute
462 // tick later than curTick or the end of readyList i
[all...]
H A Dtrace_cpu.hh99 * the readyList but also load nodes that are executed (and thus removed from
100 * readyList) but are not complete. ReadyList handles what and when to execute
124 * complete nodes from the readyList.
770 * flight nodes. This includes all nodes that are in the readyList
772 * present in the readyList. But such loads are not yet complete
923 * sorted readyList. First attempt to issue the pending dependency-free
925 * the readyList. Then iterate through the readyList and when a node
945 * Add a ready node to the readyList. When inserting, ensure the nodes
953 /** Print readyList fo
1047 std::list<ReadyNode> readyList; member in class:TraceCPU::ElasticDataGen
[all...]

Completed in 29 milliseconds