Searched refs:seqNum (Results 1 - 25 of 31) sorted by relevance

12

/gem5/src/cpu/o3/
H A Dmem_dep_unit_impl.hh81 hash_it = memDepHash.find((*inst_list_it)->seqNum);
182 std::pair<InstSeqNum, MemDepEntryPtr>(inst->seqNum, inst_entry));
223 "%s [sn:%lli].\n", inst->pcState(), inst->seqNum);
257 inst->pcState(), inst->seqNum);
259 depPred.insertStore(inst->instAddr(), inst->seqNum, inst->threadNumber);
279 std::pair<InstSeqNum, MemDepEntryPtr>(inst->seqNum, inst_entry));
293 inst->pcState(), inst->seqNum);
295 depPred.insertStore(inst->instAddr(), inst->seqNum, inst->threadNumber);
309 InstSeqNum barr_sn = barr_inst->seqNum;
347 inst->pcState(), inst->seqNum);
[all...]
H A Dlsq_unit_impl.hh299 load_inst->pcState(), loadQueue.tail(), load_inst->seqNum);
323 store_inst->pcState(), storeQueue.tail(), store_inst->seqNum);
413 ld_inst->seqNum, invalidate_addr);
425 pkt->getAddr(), ld_inst->seqNum);
431 pkt->getAddr(), ld_inst->seqNum);
480 ld_inst->seqNum < memDepViolator->seqNum) {
483 inst->seqNum, ld_inst->seqNum, ld_eff_addr1);
491 inst->seqNum, ld_ins
[all...]
H A Drob_impl.hh259 head_inst->seqNum);
331 if ((*squashIt[tid])->seqNum < squashedSeqNum[tid]) {
346 (*squashIt[tid])->seqNum > squashedSeqNum[tid];
352 (*squashIt[tid])->seqNum);
383 if ((*squashIt[tid])->seqNum <= squashedSeqNum[tid]) {
417 lowest_num = (*head)->seqNum;
428 if (head_inst->seqNum < lowest_num) {
430 lowest_num = head_inst->seqNum;
471 if ((*tail_thread)->seqNum > (*tail)->seqNum) {
[all...]
H A Dinst_queue_impl.hh593 new_inst->seqNum, new_inst->pcState());
640 nonSpecInsts[new_inst->seqNum] = new_inst;
644 new_inst->seqNum, new_inst->pcState());
707 queue_entry.oldestInst = readyInsts[op_class].top()->seqNum;
740 queue_entry.oldestInst = readyInsts[op_class].top()->seqNum;
754 DPRINTF(IQ, "Processing FU completion [sn:%llu]\n", inst->seqNum);
820 assert(issuing_inst->seqNum == (*order_it).oldestInst);
891 issuing_inst->seqNum);
980 (*iq_it)->seqNum <= inst) {
1057 "PC %s.\n", dep_inst->seqNum, dep_ins
[all...]
H A Dcommit_impl.hh563 lastCommitedSeqNum[tid] : rob->readHeadInst(tid)->seqNum - 1;
648 tid, head_inst->seqNum);
709 tid, inst->seqNum, inst->pcState());
718 tid, inst->seqNum, inst->pcState());
1016 tid, head_inst->seqNum);
1054 toIEW->commitInfo[tid].doneSeqNum = head_inst->seqNum;
1082 lastCommitedSeqNum[tid] = head_inst->seqNum;
1138 head_inst->pcState(), tid ,head_inst->seqNum);
1178 tid, head_inst->seqNum, head_inst->pcState());
1184 tid, head_inst->seqNum);
[all...]
H A Dlsq_unit.hh587 ? loadQueue.front().instruction()->seqNum
598 ? storeQueue.front().instruction()->seqNum
637 load_inst->seqNum, load_inst->pcState());
646 load_inst->seqNum, load_inst->pcState());
687 assert(store_it->instruction()->seqNum < load_inst->seqNum);
793 load_inst->seqNum <
794 loadQueue[stallingLoadIdx].instruction()->seqNum)) {
796 stallingStoreIsn = store_it->instruction()->seqNum;
823 load_inst->seqNum, load_ins
[all...]
H A Diew_impl.hh503 "\n", tid, inst->seqNum, inst->pcState() );
506 inst->seqNum < toCommit->squashedSeqNum[tid]) {
508 toCommit->squashedSeqNum[tid] = inst->seqNum;
528 "insts, PC: %s [sn:%llu].\n", tid, inst->pcState(), inst->seqNum);
529 // Need to include inst->seqNum in the following comparison to cover the
536 inst->seqNum <= toCommit->squashedSeqNum[tid]) {
539 toCommit->squashedSeqNum[tid] = inst->seqNum;
676 "dispatch skidBuffer %i\n",tid, inst->seqNum,
993 tid, inst->pcState(), inst->seqNum, inst->threadNumber);
1196 << " SN: " << fromIssue->insts[inst]->seqNum << " | ";
[all...]
H A Ddep_graph.hh281 i, curr->inst->pcState(), curr->inst->seqNum);
290 curr->inst->pcState(), curr->inst->seqNum);
H A Ddecode_impl.hh309 "prediction detected at decode.\n", tid, inst->seqNum);
316 toFetch->decodeInfo[tid].doneSeqNum = inst->seqNum;
324 InstSeqNum squash_seq_num = inst->seqNum;
337 fromFetch->insts[i]->seqNum > squash_seq_num) {
420 inst->threadNumber, inst->seqNum, inst->pcState(), skidBuffer[tid].size());
682 "PC %s\n", tid, inst->seqNum, inst->pcState());
687 tid, inst->seqNum, inst->pcState());
753 tid, inst->seqNum, target);
H A Drename_impl.hh390 if (serializeInst[tid]->seqNum <= squash_seq_num) {
410 fromDecode->insts[i]->seqNum > squash_seq_num) {
674 tid, inst->seqNum, inst->pcState());
681 tid, inst->seqNum, inst->pcState());
694 tid, inst->seqNum, inst->pcState());
815 "skidBuffer\n", tid, inst->seqNum, inst->pcState());
830 (*it)->seqNum);
1161 RenameHistory hb_entry(inst->seqNum, flat_dest_regid,
1407 "PC %s.\n", tid, serial_inst->seqNum, serial_inst->pcState());
H A Dinst_queue.hh344 return lhs->seqNum > rhs->seqNum;
H A Ddyn_inst_impl.hh82 this->seqNum,
H A Dcpu.cc1540 inst->threadNumber, inst->pcState(), inst->seqNum);
1607 tid, seq_num, (*inst_iter)->seqNum);
1609 while ((*inst_iter)->seqNum > seq_num) {
1630 (*instIt)->seqNum,
1651 (*removeList.front())->seqNum,
1683 (*inst_list_it)->seqNum, (*inst_list_it)->isIssued(),
/gem5/src/cpu/pred/
H A Dbpred_unit.cc172 BPredUnit::predict(const StaticInstPtr &inst, const InstSeqNum &seqNum, argument
192 tid,seqNum);
202 tid, seqNum, pred_taken, pc);
212 "for PC %s\n", tid, seqNum, pc);
214 PredictorHistory predict_record(seqNum, pc.instAddr(), pred_taken,
236 tid, seqNum, pc, target, predict_record.RASIndex);
251 tid, seqNum, pc, pc, RAS[tid].topIdx());
263 tid, seqNum, pc, target);
266 "valid entry\n",tid,seqNum);
276 tid, seqNum, p
[all...]
H A Dbpred_unit.hh94 bool predict(const StaticInstPtr &inst, const InstSeqNum &seqNum,
208 : seqNum(seq_num), pc(instPC), bpHistory(bp_history),
216 return this->seqNum == entry.seqNum;
220 InstSeqNum seqNum; member in struct:BPredUnit::PredictorHistory
H A Dsimple_indirect.hh86 : pcAddr(br_addr), targetAddr(tgt_addr), seqNum(seq_num) { }
89 InstSeqNum seqNum; member in struct:SimpleIndirectPredictor::HistoryEntry
H A Dsimple_indirect.cc136 t_info.pathHist[t_info.headHistEntry].seqNum <= seq_num) {
152 if (squash_itr->seqNum > seq_num) {
159 squash_itr->seqNum);
/gem5/src/cpu/
H A Dbase_dyn_inst_impl.hh74 seqNum = seq_num;
87 seqNum = 0;
133 seqNum, cpu->name(), cpu->instcount);
137 cpu->snList.insert(seqNum);
160 seqNum, cpu->name(), cpu->instcount);
163 cpu->snList.erase(seqNum);
209 seqNum, readyRegs+1, numSrcRegs(), readyToIssue());
/gem5/src/cpu/trace/
H A Dtrace_cpu.cc328 " is %d.\n", free_itr->seqNum, free_itr->execTick);
386 depGraph[new_node->seqNum] = new_node;
452 "%lli.\n", (depFreeQueue.front())->seqNum);
466 graph_itr = depGraph.find(free_itr->seqNum);
474 if (retryPkt->req->getReqInstSeqNum() != node_ptr->seqNum) {
506 "dependents..\n", node_ptr->seqNum);
513 (*child_itr)->removeRobDep(node_ptr->seqNum)) {
537 " up dependents..\n", node_ptr->seqNum);
542 if (child->removeDepOnInst(node_ptr->seqNum)) {
630 node_ptr->seqNum, node_pt
[all...]
H A Dtrace_cpu.hh595 NodeSeqNum seqNum; member in class:TraceCPU::ElasticDataGen::GraphNode
688 NodeSeqNum seqNum; member in struct:TraceCPU::ElasticDataGen::ReadyNode
/gem5/src/cpu/o3/probe/
H A Delastic_trace.cc178 if (dyn_inst->seqNum <= lastClearedSeqNum) {
180 has already retired (mostly squashed)", dyn_inst->seqNum);
186 DPRINTFR(ElasticTrace, "[sn:%lli] Execute Tick = %i\n", dyn_inst->seqNum,
193 auto itr_exec_info = tempStore.find(dyn_inst->seqNum);
198 tempStore[dyn_inst->seqNum] = exec_info_ptr;
213 auto itr_exec_info = tempStore.find(dyn_inst->seqNum);
216 " skipping.\n", dyn_inst->seqNum);
220 DPRINTFR(ElasticTrace, "[sn:%lli] To Commit Tick = %i\n", dyn_inst->seqNum,
231 InstSeqNum seq_num = dyn_inst->seqNum;
233 assert(dyn_inst->seqNum > lastClearedSeqNu
[all...]
/gem5/src/gpu-compute/
H A Dglobal_memory_pipeline.cc78 vrfOperandAccessReady(m->seqNum(), w, m, VrfAccessType::WRITE);
142 gmOrderedRespBuffer.insert(std::make_pair(mp->seqNum(),
197 assert(gmOrderedRespBuffer.begin()->first == gpuDynInst->seqNum());
202 gmOrderedRespBuffer.erase(gpuDynInst->seqNum());
224 auto mem_req = gmOrderedRespBuffer.find(gpuDynInst->seqNum());
H A Dlocal_memory_pipeline.cc72 vrfOperandAccessReady(m->seqNum(), w, m,
H A Dgpu_dyn_inst.cc142 GPUDynInst::seqNum() const function in class:GPUDynInst
/gem5/src/cpu/checker/
H A Dcpu_impl.hh137 (instList.front()->seqNum != completed_inst->seqNum) : 0)) {
140 completed_inst->seqNum, completed_inst->pcState());
149 if (youngestSN < completed_inst->seqNum) {
151 completed_inst->seqNum, completed_inst->pcState());
153 youngestSN = completed_inst->seqNum;
164 if (youngestSN < completed_inst->seqNum) {
166 completed_inst->seqNum, completed_inst->pcState());
168 youngestSN = completed_inst->seqNum;
172 if (youngestSN < completed_inst->seqNum) {
[all...]

Completed in 64 milliseconds

12