2 * Copyright (c) 2010 ARM Limited
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
14 * Copyright (c) 2004-2006 The Regents of The University of Michigan
15 * All rights reserved.
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions are
19 * met: redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer;
21 * redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution;
24 * neither the name of the copyright holders nor the names of its
25 * contributors may be used to endorse or promote products derived from
26 * this software without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
47 #include "arch/utility.hh"
48 #include "base/cp_annotate.hh"
49 #include "base/loader/symtab.hh"
50 #include "cpu/timebuf.hh"
51 #include "config/full_system.hh"
52 #include "config/the_isa.hh"
53 #include "config/use_checker.hh"
54 #include "cpu/exetrace.hh"
55 #include "cpu/o3/commit.hh"
56 #include "cpu/o3/thread_state.hh"
57 #include "params/DerivO3CPU.hh"
60 #include "cpu/checker/cpu.hh"
66 DefaultCommit<Impl>::TrapEvent::TrapEvent(DefaultCommit<Impl> *_commit,
68 : Event(CPU_Tick_Pri), commit(_commit), tid(_tid)
70 this->setFlags(AutoDelete);
75 DefaultCommit<Impl>::TrapEvent::process()
77 // This will get reset by commit if it was switched out at the
78 // time of this event processing.
79 commit->trapSquash[tid] = true;
84 DefaultCommit<Impl>::TrapEvent::description() const
90 DefaultCommit<Impl>::DefaultCommit(O3CPU *_cpu, DerivO3CPUParams *params)
93 iewToCommitDelay(params->iewToCommitDelay),
94 commitToIEWDelay(params->commitToIEWDelay),
95 renameToROBDelay(params->renameToROBDelay),
96 fetchToCommitDelay(params->commitToFetchDelay),
97 renameWidth(params->renameWidth),
98 commitWidth(params->commitWidth),
99 numThreads(params->numThreads),
102 trapLatency(params->trapLatency)
105 _nextStatus = Inactive;
106 std::string policy = params->smtCommitPolicy;
108 //Convert string to lowercase
109 std::transform(policy.begin(), policy.end(), policy.begin(),
110 (int(*)(int)) tolower);
112 //Assign commit policy
113 if (policy == "aggressive"){
114 commitPolicy = Aggressive;
116 DPRINTF(Commit,"Commit Policy set to Aggressive.");
117 } else if (policy == "roundrobin"){
118 commitPolicy = RoundRobin;
120 //Set-Up Priority List
121 for (ThreadID tid = 0; tid < numThreads; tid++) {
122 priority_list.push_back(tid);
125 DPRINTF(Commit,"Commit Policy set to Round Robin.");
126 } else if (policy == "oldestready"){
127 commitPolicy = OldestReady;
129 DPRINTF(Commit,"Commit Policy set to Oldest Ready.");
131 assert(0 && "Invalid SMT Commit Policy. Options Are: {Aggressive,"
132 "RoundRobin,OldestReady}");
135 for (ThreadID tid = 0; tid < numThreads; tid++) {
136 commitStatus[tid] = Idle;
137 changedROBNumEntries[tid] = false;
138 checkEmptyROB[tid] = false;
139 trapInFlight[tid] = false;
140 committedStores[tid] = false;
141 trapSquash[tid] = false;
142 tcSquash[tid] = false;
144 lastCommitedSeqNum[tid] = 0;
151 template <class Impl>
153 DefaultCommit<Impl>::name() const
155 return cpu->name() + ".commit";
158 template <class Impl>
160 DefaultCommit<Impl>::regStats()
162 using namespace Stats;
164 .name(name() + ".commitCommittedInsts")
165 .desc("The number of committed instructions")
166 .prereq(commitCommittedInsts);
168 .name(name() + ".commitSquashedInsts")
169 .desc("The number of squashed insts skipped by commit")
170 .prereq(commitSquashedInsts);
172 .name(name() + ".commitSquashEvents")
173 .desc("The number of times commit is told to squash")
174 .prereq(commitSquashEvents);
176 .name(name() + ".commitNonSpecStalls")
177 .desc("The number of times commit has been forced to stall to "
178 "communicate backwards")
179 .prereq(commitNonSpecStalls);
181 .name(name() + ".branchMispredicts")
182 .desc("The number of times a branch was mispredicted")
183 .prereq(branchMispredicts);
185 .init(0,commitWidth,1)
186 .name(name() + ".COM:committed_per_cycle")
187 .desc("Number of insts commited each cycle")
192 .init(cpu->numThreads)
193 .name(name() + ".COM:count")
194 .desc("Number of instructions committed")
199 .init(cpu->numThreads)
200 .name(name() + ".COM:swp_count")
201 .desc("Number of s/w prefetches committed")
206 .init(cpu->numThreads)
207 .name(name() + ".COM:refs")
208 .desc("Number of memory references committed")
213 .init(cpu->numThreads)
214 .name(name() + ".COM:loads")
215 .desc("Number of loads committed")
220 .init(cpu->numThreads)
221 .name(name() + ".COM:membars")
222 .desc("Number of memory barriers committed")
227 .init(cpu->numThreads)
228 .name(name() + ".COM:branches")
229 .desc("Number of branches committed")
234 .init(cpu->numThreads)
235 .name(name() + ".COM:fp_insts")
236 .desc("Number of committed floating point instructions.")
241 .init(cpu->numThreads)
242 .name(name()+".COM:int_insts")
243 .desc("Number of committed integer instructions.")
248 .init(cpu->numThreads)
249 .name(name()+".COM:function_calls")
250 .desc("Number of function calls committed.")
255 .init(cpu->numThreads)
256 .name(name() + ".COM:bw_limited")
257 .desc("number of insts not committed due to BW limits")
261 commitEligibleSamples
262 .name(name() + ".COM:bw_lim_events")
263 .desc("number cycles where commit BW limit reached")
267 template <class Impl>
269 DefaultCommit<Impl>::setThreads(std::vector<Thread *> &threads)
274 template <class Impl>
276 DefaultCommit<Impl>::setTimeBuffer(TimeBuffer<TimeStruct> *tb_ptr)
280 // Setup wire to send information back to IEW.
281 toIEW = timeBuffer->getWire(0);
283 // Setup wire to read data from IEW (for the ROB).
284 robInfoFromIEW = timeBuffer->getWire(-iewToCommitDelay);
287 template <class Impl>
289 DefaultCommit<Impl>::setFetchQueue(TimeBuffer<FetchStruct> *fq_ptr)
293 // Setup wire to get instructions from rename (for the ROB).
294 fromFetch = fetchQueue->getWire(-fetchToCommitDelay);
297 template <class Impl>
299 DefaultCommit<Impl>::setRenameQueue(TimeBuffer<RenameStruct> *rq_ptr)
301 renameQueue = rq_ptr;
303 // Setup wire to get instructions from rename (for the ROB).
304 fromRename = renameQueue->getWire(-renameToROBDelay);
307 template <class Impl>
309 DefaultCommit<Impl>::setIEWQueue(TimeBuffer<IEWStruct> *iq_ptr)
313 // Setup wire to get instructions from IEW.
314 fromIEW = iewQueue->getWire(-iewToCommitDelay);
317 template <class Impl>
319 DefaultCommit<Impl>::setIEWStage(IEW *iew_stage)
321 iewStage = iew_stage;
326 DefaultCommit<Impl>::setActiveThreads(list<ThreadID> *at_ptr)
328 activeThreads = at_ptr;
331 template <class Impl>
333 DefaultCommit<Impl>::setRenameMap(RenameMap rm_ptr[])
335 for (ThreadID tid = 0; tid < numThreads; tid++)
336 renameMap[tid] = &rm_ptr[tid];
339 template <class Impl>
341 DefaultCommit<Impl>::setROB(ROB *rob_ptr)
346 template <class Impl>
348 DefaultCommit<Impl>::initStage()
350 rob->setActiveThreads(activeThreads);
353 // Broadcast the number of free entries.
354 for (ThreadID tid = 0; tid < numThreads; tid++) {
355 toIEW->commitInfo[tid].usedROB = true;
356 toIEW->commitInfo[tid].freeROBEntries = rob->numFreeEntries(tid);
357 toIEW->commitInfo[tid].emptyROB = true;
360 // Commit must broadcast the number of free entries it has at the
361 // start of the simulation, so it starts as active.
362 cpu->activateStage(O3CPU::CommitIdx);
364 cpu->activityThisCycle();
365 trapLatency = cpu->ticks(trapLatency);
368 template <class Impl>
370 DefaultCommit<Impl>::drain()
377 template <class Impl>
379 DefaultCommit<Impl>::switchOut()
382 drainPending = false;
386 template <class Impl>
388 DefaultCommit<Impl>::resume()
390 drainPending = false;
393 template <class Impl>
395 DefaultCommit<Impl>::takeOverFrom()
399 _nextStatus = Inactive;
400 for (ThreadID tid = 0; tid < numThreads; tid++) {
401 commitStatus[tid] = Idle;
402 changedROBNumEntries[tid] = false;
403 trapSquash[tid] = false;
404 tcSquash[tid] = false;
410 template <class Impl>
412 DefaultCommit<Impl>::updateStatus()
414 // reset ROB changed variable
415 list<ThreadID>::iterator threads = activeThreads->begin();
416 list<ThreadID>::iterator end = activeThreads->end();
418 while (threads != end) {
419 ThreadID tid = *threads++;
421 changedROBNumEntries[tid] = false;
423 // Also check if any of the threads has a trap pending
424 if (commitStatus[tid] == TrapPending ||
425 commitStatus[tid] == FetchTrapPending) {
426 _nextStatus = Active;
430 if (_nextStatus == Inactive && _status == Active) {
431 DPRINTF(Activity, "Deactivating stage.\n");
432 cpu->deactivateStage(O3CPU::CommitIdx);
433 } else if (_nextStatus == Active && _status == Inactive) {
434 DPRINTF(Activity, "Activating stage.\n");
435 cpu->activateStage(O3CPU::CommitIdx);
438 _status = _nextStatus;
441 template <class Impl>
443 DefaultCommit<Impl>::setNextStatus()
447 list<ThreadID>::iterator threads = activeThreads->begin();
448 list<ThreadID>::iterator end = activeThreads->end();
450 while (threads != end) {
451 ThreadID tid = *threads++;
453 if (commitStatus[tid] == ROBSquashing) {
458 squashCounter = squashes;
460 // If commit is currently squashing, then it will have activity for the
461 // next cycle. Set its next status as active.
463 _nextStatus = Active;
467 template <class Impl>
469 DefaultCommit<Impl>::changedROBEntries()
471 list<ThreadID>::iterator threads = activeThreads->begin();
472 list<ThreadID>::iterator end = activeThreads->end();
474 while (threads != end) {
475 ThreadID tid = *threads++;
477 if (changedROBNumEntries[tid]) {
485 template <class Impl>
487 DefaultCommit<Impl>::numROBFreeEntries(ThreadID tid)
489 return rob->numFreeEntries(tid);
492 template <class Impl>
494 DefaultCommit<Impl>::generateTrapEvent(ThreadID tid)
496 DPRINTF(Commit, "Generating trap event for [tid:%i]\n", tid);
498 TrapEvent *trap = new TrapEvent(this, tid);
500 cpu->schedule(trap, curTick() + trapLatency);
501 trapInFlight[tid] = true;
504 template <class Impl>
506 DefaultCommit<Impl>::generateTCEvent(ThreadID tid)
508 assert(!trapInFlight[tid]);
509 DPRINTF(Commit, "Generating TC squash event for [tid:%i]\n", tid);
511 tcSquash[tid] = true;
514 template <class Impl>
516 DefaultCommit<Impl>::squashAll(ThreadID tid)
518 // If we want to include the squashing instruction in the squash,
519 // then use one older sequence number.
520 // Hopefully this doesn't mess things up. Basically I want to squash
521 // all instructions of this thread.
522 InstSeqNum squashed_inst = rob->isEmpty() ?
523 lastCommitedSeqNum[tid] : rob->readHeadInst(tid)->seqNum - 1;
525 // All younger instructions will be squashed. Set the sequence
526 // number as the youngest instruction in the ROB (0 in this case.
527 // Hopefully nothing breaks.)
528 youngestSeqNum[tid] = lastCommitedSeqNum[tid];
530 rob->squash(squashed_inst, tid);
531 changedROBNumEntries[tid] = true;
533 // Send back the sequence number of the squashed instruction.
534 toIEW->commitInfo[tid].doneSeqNum = squashed_inst;
536 // Send back the squash signal to tell stages that they should
538 toIEW->commitInfo[tid].squash = true;
540 // Send back the rob squashing signal so other stages know that
541 // the ROB is in the process of squashing.
542 toIEW->commitInfo[tid].robSquashing = true;
544 toIEW->commitInfo[tid].branchMispredict = false;
545 toIEW->commitInfo[tid].mispredictInst = NULL;
547 toIEW->commitInfo[tid].pc = pc[tid];
550 template <class Impl>
552 DefaultCommit<Impl>::squashFromTrap(ThreadID tid)
556 DPRINTF(Commit, "Squashing from trap, restarting at PC %s\n", pc[tid]);
558 thread[tid]->trapPending = false;
559 thread[tid]->inSyscall = false;
560 trapInFlight[tid] = false;
562 trapSquash[tid] = false;
564 commitStatus[tid] = ROBSquashing;
565 cpu->activityThisCycle();
568 template <class Impl>
570 DefaultCommit<Impl>::squashFromTC(ThreadID tid)
574 DPRINTF(Commit, "Squashing from TC, restarting at PC %s\n", pc[tid]);
576 thread[tid]->inSyscall = false;
577 assert(!thread[tid]->trapPending);
579 commitStatus[tid] = ROBSquashing;
580 cpu->activityThisCycle();
582 tcSquash[tid] = false;
585 template <class Impl>
587 DefaultCommit<Impl>::squashAfter(ThreadID tid, uint64_t squash_after_seq_num)
589 youngestSeqNum[tid] = squash_after_seq_num;
591 rob->squash(squash_after_seq_num, tid);
592 changedROBNumEntries[tid] = true;
594 // Send back the sequence number of the squashed instruction.
595 toIEW->commitInfo[tid].doneSeqNum = squash_after_seq_num;
597 // Send back the squash signal to tell stages that they should squash.
598 toIEW->commitInfo[tid].squash = true;
600 // Send back the rob squashing signal so other stages know that
601 // the ROB is in the process of squashing.
602 toIEW->commitInfo[tid].robSquashing = true;
604 toIEW->commitInfo[tid].branchMispredict = false;
606 toIEW->commitInfo[tid].pc = pc[tid];
607 DPRINTF(Commit, "Executing squash after for [tid:%i] inst [sn:%lli]\n",
608 tid, squash_after_seq_num);
609 commitStatus[tid] = ROBSquashing;
612 template <class Impl>
614 DefaultCommit<Impl>::tick()
616 wroteToTimeBuffer = false;
617 _nextStatus = Inactive;
619 if (drainPending && rob->isEmpty() && !iewStage->hasStoresToWB()) {
620 cpu->signalDrained();
621 drainPending = false;
625 if (activeThreads->empty())
628 list<ThreadID>::iterator threads = activeThreads->begin();
629 list<ThreadID>::iterator end = activeThreads->end();
631 // Check if any of the threads are done squashing. Change the
632 // status if they are done.
633 while (threads != end) {
634 ThreadID tid = *threads++;
636 // Clear the bit saying if the thread has committed stores
638 committedStores[tid] = false;
640 if (commitStatus[tid] == ROBSquashing) {
642 if (rob->isDoneSquashing(tid)) {
643 commitStatus[tid] = Running;
645 DPRINTF(Commit,"[tid:%u]: Still Squashing, cannot commit any"
646 " insts this cycle.\n", tid);
648 toIEW->commitInfo[tid].robSquashing = true;
649 wroteToTimeBuffer = true;
656 markCompletedInsts();
658 threads = activeThreads->begin();
660 while (threads != end) {
661 ThreadID tid = *threads++;
663 if (!rob->isEmpty(tid) && rob->readHeadInst(tid)->readyToCommit()) {
664 // The ROB has more instructions it can commit. Its next status
666 _nextStatus = Active;
668 DynInstPtr inst = rob->readHeadInst(tid);
670 DPRINTF(Commit,"[tid:%i]: Instruction [sn:%lli] PC %s is head of"
671 " ROB and ready to commit\n",
672 tid, inst->seqNum, inst->pcState());
674 } else if (!rob->isEmpty(tid)) {
675 DynInstPtr inst = rob->readHeadInst(tid);
677 DPRINTF(Commit,"[tid:%i]: Can't commit, Instruction [sn:%lli] PC "
678 "%s is head of ROB and not ready\n",
679 tid, inst->seqNum, inst->pcState());
682 DPRINTF(Commit, "[tid:%i]: ROB has %d insts & %d free entries.\n",
683 tid, rob->countInsts(tid), rob->numFreeEntries(tid));
687 if (wroteToTimeBuffer) {
688 DPRINTF(Activity, "Activity This Cycle.\n");
689 cpu->activityThisCycle();
696 template <class Impl>
698 DefaultCommit<Impl>::handleInterrupt()
700 // Verify that we still have an interrupt to handle
701 if (!cpu->checkInterrupts(cpu->tcBase(0))) {
702 DPRINTF(Commit, "Pending interrupt is cleared by master before "
703 "it got handled. Restart fetching from the orig path.\n");
704 toIEW->commitInfo[0].clearInterrupt = true;
709 // Wait until the ROB is empty and all stores have drained in
710 // order to enter the interrupt.
711 if (rob->isEmpty() && !iewStage->hasStoresToWB()) {
712 // Squash or record that I need to squash this cycle if
713 // an interrupt needed to be handled.
714 DPRINTF(Commit, "Interrupt detected.\n");
716 // Clear the interrupt now that it's going to be handled
717 toIEW->commitInfo[0].clearInterrupt = true;
719 assert(!thread[0]->inSyscall);
720 thread[0]->inSyscall = true;
722 // CPU will handle interrupt.
723 cpu->processInterrupts(interrupt);
725 thread[0]->inSyscall = false;
727 commitStatus[0] = TrapPending;
729 // Generate trap squash event.
730 generateTrapEvent(0);
734 DPRINTF(Commit, "Interrupt pending, waiting for ROB to empty.\n");
738 template <class Impl>
740 DefaultCommit<Impl>::propagateInterrupt()
742 if (commitStatus[0] == TrapPending || interrupt || trapSquash[0] ||
746 // Process interrupts if interrupts are enabled, not in PAL
747 // mode, and no other traps or external squashes are currently
749 // @todo: Allow other threads to handle interrupts.
751 // Get any interrupt that happened
752 interrupt = cpu->getInterrupts();
754 // Tell fetch that there is an interrupt pending. This
755 // will make fetch wait until it sees a non PAL-mode PC,
756 // at which point it stops fetching instructions.
757 if (interrupt != NoFault)
758 toIEW->commitInfo[0].interruptPending = true;
761 #endif // FULL_SYSTEM
763 template <class Impl>
765 DefaultCommit<Impl>::commit()
769 // Check for any interrupt that we've already squashed for and start processing it.
770 if (interrupt != NoFault)
773 // Check if we have a interrupt and get read to handle it
774 if (cpu->checkInterrupts(cpu->tcBase(0)))
775 propagateInterrupt();
776 #endif // FULL_SYSTEM
778 ////////////////////////////////////
779 // Check for any possible squashes, handle them first
780 ////////////////////////////////////
781 list<ThreadID>::iterator threads = activeThreads->begin();
782 list<ThreadID>::iterator end = activeThreads->end();
784 while (threads != end) {
785 ThreadID tid = *threads++;
787 // Not sure which one takes priority. I think if we have
788 // both, that's a bad sign.
789 if (trapSquash[tid] == true) {
790 assert(!tcSquash[tid]);
792 } else if (tcSquash[tid] == true) {
793 assert(commitStatus[tid] != TrapPending);
797 // Squashed sequence number must be older than youngest valid
798 // instruction in the ROB. This prevents squashes from younger
799 // instructions overriding squashes from older instructions.
800 if (fromIEW->squash[tid] &&
801 commitStatus[tid] != TrapPending &&
802 fromIEW->squashedSeqNum[tid] <= youngestSeqNum[tid]) {
804 DPRINTF(Commit, "[tid:%i]: Squashing due to PC %#x [sn:%i]\n",
806 fromIEW->mispredPC[tid],
807 fromIEW->squashedSeqNum[tid]);
809 DPRINTF(Commit, "[tid:%i]: Redirecting to PC %#x\n",
811 fromIEW->pc[tid].nextInstAddr());
813 commitStatus[tid] = ROBSquashing;
815 // If we want to include the squashing instruction in the squash,
816 // then use one older sequence number.
817 InstSeqNum squashed_inst = fromIEW->squashedSeqNum[tid];
819 if (fromIEW->includeSquashInst[tid] == true) {
823 // All younger instructions will be squashed. Set the sequence
824 // number as the youngest instruction in the ROB.
825 youngestSeqNum[tid] = squashed_inst;
827 rob->squash(squashed_inst, tid);
828 changedROBNumEntries[tid] = true;
830 toIEW->commitInfo[tid].doneSeqNum = squashed_inst;
832 toIEW->commitInfo[tid].squash = true;
834 // Send back the rob squashing signal so other stages know that
835 // the ROB is in the process of squashing.
836 toIEW->commitInfo[tid].robSquashing = true;
838 toIEW->commitInfo[tid].branchMispredict =
839 fromIEW->branchMispredict[tid];
840 toIEW->commitInfo[tid].mispredictInst =
841 fromIEW->mispredictInst[tid];
842 toIEW->commitInfo[tid].branchTaken =
843 fromIEW->branchTaken[tid];
845 toIEW->commitInfo[tid].pc = fromIEW->pc[tid];
847 toIEW->commitInfo[tid].mispredPC = fromIEW->mispredPC[tid];
849 if (toIEW->commitInfo[tid].branchMispredict) {
858 if (squashCounter != numThreads) {
859 // If we're not currently squashing, then get instructions.
862 // Try to commit any instructions.
866 //Check for any activity
867 threads = activeThreads->begin();
869 while (threads != end) {
870 ThreadID tid = *threads++;
872 if (changedROBNumEntries[tid]) {
873 toIEW->commitInfo[tid].usedROB = true;
874 toIEW->commitInfo[tid].freeROBEntries = rob->numFreeEntries(tid);
876 wroteToTimeBuffer = true;
877 changedROBNumEntries[tid] = false;
878 if (rob->isEmpty(tid))
879 checkEmptyROB[tid] = true;
882 // ROB is only considered "empty" for previous stages if: a)
883 // ROB is empty, b) there are no outstanding stores, c) IEW
884 // stage has received any information regarding stores that
886 // c) is checked by making sure to not consider the ROB empty
887 // on the same cycle as when stores have been committed.
888 // @todo: Make this handle multi-cycle communication between
890 if (checkEmptyROB[tid] && rob->isEmpty(tid) &&
891 !iewStage->hasStoresToWB(tid) && !committedStores[tid]) {
892 checkEmptyROB[tid] = false;
893 toIEW->commitInfo[tid].usedROB = true;
894 toIEW->commitInfo[tid].emptyROB = true;
895 toIEW->commitInfo[tid].freeROBEntries = rob->numFreeEntries(tid);
896 wroteToTimeBuffer = true;
902 template <class Impl>
904 DefaultCommit<Impl>::commitInsts()
906 ////////////////////////////////////
908 // Note that commit will be handled prior to putting new
909 // instructions in the ROB so that the ROB only tries to commit
910 // instructions it has in this current cycle, and not instructions
911 // it is writing in during this cycle. Can't commit and squash
912 // things at the same time...
913 ////////////////////////////////////
915 DPRINTF(Commit, "Trying to commit instructions in the ROB.\n");
917 unsigned num_committed = 0;
919 DynInstPtr head_inst;
921 // Commit as many instructions as possible until the commit bandwidth
922 // limit is reached, or it becomes impossible to commit any more.
923 while (num_committed < commitWidth) {
924 int commit_thread = getCommittingThread();
926 if (commit_thread == -1 || !rob->isHeadReady(commit_thread))
929 head_inst = rob->readHeadInst(commit_thread);
931 ThreadID tid = head_inst->threadNumber;
933 assert(tid == commit_thread);
935 DPRINTF(Commit, "Trying to commit head instruction, [sn:%i] [tid:%i]\n",
936 head_inst->seqNum, tid);
938 // If the head instruction is squashed, it is ready to retire
939 // (be removed from the ROB) at any time.
940 if (head_inst->isSquashed()) {
942 DPRINTF(Commit, "Retiring squashed instruction from "
945 rob->retireHead(commit_thread);
947 ++commitSquashedInsts;
949 // Record that the number of ROB entries has changed.
950 changedROBNumEntries[tid] = true;
952 pc[tid] = head_inst->pcState();
954 // Increment the total number of non-speculative instructions
956 // Hack for now: it really shouldn't happen until after the
957 // commit is deemed to be successful, but this count is needed
959 thread[tid]->funcExeInst++;
961 // Try to commit the head instruction.
962 bool commit_success = commitHead(head_inst, num_committed);
964 if (commit_success) {
967 changedROBNumEntries[tid] = true;
969 // Set the doneSeqNum to the youngest committed instruction.
970 toIEW->commitInfo[tid].doneSeqNum = head_inst->seqNum;
972 ++commitCommittedInsts;
974 // To match the old model, don't count nops and instruction
975 // prefetches towards the total commit count.
976 if (!head_inst->isNop() && !head_inst->isInstPrefetch()) {
980 // Updates misc. registers.
981 head_inst->updateMiscRegs();
983 TheISA::advancePC(pc[tid], head_inst->staticInst);
985 // Keep track of the last sequence number commited
986 lastCommitedSeqNum[tid] = head_inst->seqNum;
988 // If this is an instruction that doesn't play nicely with
989 // others squash everything and restart fetch
990 if (head_inst->isSquashAfter())
991 squashAfter(tid, head_inst->seqNum);
995 // Debug statement. Checks to make sure we're not
996 // currently updating state while handling PC events.
997 assert(!thread[tid]->inSyscall && !thread[tid]->trapPending);
999 oldpc = pc[tid].instAddr();
1000 cpu->system->pcEventQueue.service(thread[tid]->getTC());
1002 } while (oldpc != pc[tid].instAddr());
1005 "PC skip function event, stopping commit\n");
1009 DPRINTF(Commit, "Unable to commit head instruction PC:%s "
1010 "[tid:%i] [sn:%i].\n",
1011 head_inst->pcState(), tid ,head_inst->seqNum);
1017 DPRINTF(CommitRate, "%i\n", num_committed);
1018 numCommittedDist.sample(num_committed);
1020 if (num_committed == commitWidth) {
1021 commitEligibleSamples++;
1025 template <class Impl>
1027 DefaultCommit<Impl>::commitHead(DynInstPtr &head_inst, unsigned inst_num)
1031 ThreadID tid = head_inst->threadNumber;
1033 // If the instruction is not executed yet, then it will need extra
1034 // handling. Signal backwards that it should be executed.
1035 if (!head_inst->isExecuted()) {
1036 // Keep this number correct. We have not yet actually executed
1037 // and committed this instruction.
1038 thread[tid]->funcExeInst--;
1040 if (head_inst->isNonSpeculative() ||
1041 head_inst->isStoreConditional() ||
1042 head_inst->isMemBarrier() ||
1043 head_inst->isWriteBarrier()) {
1045 DPRINTF(Commit, "Encountered a barrier or non-speculative "
1046 "instruction [sn:%lli] at the head of the ROB, PC %s.\n",
1047 head_inst->seqNum, head_inst->pcState());
1049 if (inst_num > 0 || iewStage->hasStoresToWB(tid)) {
1050 DPRINTF(Commit, "Waiting for all stores to writeback.\n");
1054 toIEW->commitInfo[tid].nonSpecSeqNum = head_inst->seqNum;
1056 // Change the instruction so it won't try to commit again until
1058 head_inst->clearCanCommit();
1060 ++commitNonSpecStalls;
1063 } else if (head_inst->isLoad()) {
1064 if (inst_num > 0 || iewStage->hasStoresToWB(tid)) {
1065 DPRINTF(Commit, "Waiting for all stores to writeback.\n");
1069 assert(head_inst->uncacheable());
1070 DPRINTF(Commit, "[sn:%lli]: Uncached load, PC %s.\n",
1071 head_inst->seqNum, head_inst->pcState());
1073 // Send back the non-speculative instruction's sequence
1074 // number. Tell the lsq to re-execute the load.
1075 toIEW->commitInfo[tid].nonSpecSeqNum = head_inst->seqNum;
1076 toIEW->commitInfo[tid].uncached = true;
1077 toIEW->commitInfo[tid].uncachedLoad = head_inst;
1079 head_inst->clearCanCommit();
1083 panic("Trying to commit un-executed instruction "
1084 "of unknown type!\n");
1088 if (head_inst->isThreadSync()) {
1089 // Not handled for now.
1090 panic("Thread sync instructions are not handled yet.\n");
1093 // Check if the instruction caused a fault. If so, trap.
1094 Fault inst_fault = head_inst->getFault();
1096 // Stores mark themselves as completed.
1097 if (!head_inst->isStore() && inst_fault == NoFault) {
1098 head_inst->setCompleted();
1102 // Use checker prior to updating anything due to traps or PC
1105 cpu->checker->verify(head_inst);
1109 if (inst_fault != NoFault) {
1110 DPRINTF(Commit, "Inst [sn:%lli] PC %s has a fault\n",
1111 head_inst->seqNum, head_inst->pcState());
1113 if (iewStage->hasStoresToWB(tid) || inst_num > 0) {
1114 DPRINTF(Commit, "Stores outstanding, fault must wait.\n");
1118 head_inst->setCompleted();
1121 if (cpu->checker && head_inst->isStore()) {
1122 cpu->checker->verify(head_inst);
1126 assert(!thread[tid]->inSyscall);
1128 // Mark that we're in state update mode so that the trap's
1129 // execution doesn't generate extra squashes.
1130 thread[tid]->inSyscall = true;
1132 // Execute the trap. Although it's slightly unrealistic in
1133 // terms of timing (as it doesn't wait for the full timing of
1134 // the trap event to complete before updating state), it's
1135 // needed to update the state as soon as possible. This
1136 // prevents external agents from changing any specific state
1137 // that the trap need.
1138 cpu->trap(inst_fault, tid, head_inst->staticInst);
1140 // Exit state update mode to avoid accidental updating.
1141 thread[tid]->inSyscall = false;
1143 commitStatus[tid] = TrapPending;
1145 DPRINTF(Commit, "Committing instruction with fault [sn:%lli]\n",
1147 if (head_inst->traceData) {
1148 if (DTRACE(ExecFaulting)) {
1149 head_inst->traceData->setFetchSeq(head_inst->seqNum);
1150 head_inst->traceData->setCPSeq(thread[tid]->numInst);
1151 head_inst->traceData->dump();
1153 delete head_inst->traceData;
1154 head_inst->traceData = NULL;
1157 // Generate trap squash event.
1158 generateTrapEvent(tid);
1162 updateComInstStats(head_inst);
1165 if (thread[tid]->profile) {
1166 thread[tid]->profilePC = head_inst->instAddr();
1167 ProfileNode *node = thread[tid]->profile->consume(thread[tid]->getTC(),
1168 head_inst->staticInst);
1171 thread[tid]->profileNode = node;
1173 if (CPA::available()) {
1174 if (head_inst->isControl()) {
1175 ThreadContext *tc = thread[tid]->getTC();
1176 CPA::cpa()->swAutoBegin(tc, head_inst->nextInstAddr());
1181 if (head_inst->traceData) {
1182 head_inst->traceData->setFetchSeq(head_inst->seqNum);
1183 head_inst->traceData->setCPSeq(thread[tid]->numInst);
1184 head_inst->traceData->dump();
1185 delete head_inst->traceData;
1186 head_inst->traceData = NULL;
1189 // Update the commit rename map
1190 for (int i = 0; i < head_inst->numDestRegs(); i++) {
1191 renameMap[tid]->setEntry(head_inst->flattenedDestRegIdx(i),
1192 head_inst->renamedDestRegIdx(i));
1195 if (head_inst->isCopy())
1196 panic("Should not commit any copy instructions!");
1198 // Finally clear the head ROB entry.
1199 rob->retireHead(tid);
1201 // If this was a store, record it for this cycle.
1202 if (head_inst->isStore())
1203 committedStores[tid] = true;
1205 // Return true to indicate that we have committed an instruction.
1209 template <class Impl>
1211 DefaultCommit<Impl>::getInsts()
1213 DPRINTF(Commit, "Getting instructions from Rename stage.\n");
1215 // Read any renamed instructions and place them into the ROB.
1216 int insts_to_process = std::min((int)renameWidth, fromRename->size);
1218 for (int inst_num = 0; inst_num < insts_to_process; ++inst_num) {
1221 inst = fromRename->insts[inst_num];
1222 ThreadID tid = inst->threadNumber;
1224 if (!inst->isSquashed() &&
1225 commitStatus[tid] != ROBSquashing &&
1226 commitStatus[tid] != TrapPending) {
1227 changedROBNumEntries[tid] = true;
1229 DPRINTF(Commit, "Inserting PC %s [sn:%i] [tid:%i] into ROB.\n",
1230 inst->pcState(), inst->seqNum, tid);
1232 rob->insertInst(inst);
1234 assert(rob->getThreadEntries(tid) <= rob->getMaxEntries(tid));
1236 youngestSeqNum[tid] = inst->seqNum;
1238 DPRINTF(Commit, "Instruction PC %s [sn:%i] [tid:%i] was "
1239 "squashed, skipping.\n",
1240 inst->pcState(), inst->seqNum, tid);
1245 template <class Impl>
1247 DefaultCommit<Impl>::skidInsert()
1249 DPRINTF(Commit, "Attempting to any instructions from rename into "
1252 for (int inst_num = 0; inst_num < fromRename->size; ++inst_num) {
1253 DynInstPtr inst = fromRename->insts[inst_num];
1255 if (!inst->isSquashed()) {
1256 DPRINTF(Commit, "Inserting PC %s [sn:%i] [tid:%i] into ",
1257 "skidBuffer.\n", inst->pcState(), inst->seqNum,
1258 inst->threadNumber);
1259 skidBuffer.push(inst);
1261 DPRINTF(Commit, "Instruction PC %s [sn:%i] [tid:%i] was "
1262 "squashed, skipping.\n",
1263 inst->pcState(), inst->seqNum, inst->threadNumber);
1268 template <class Impl>
1270 DefaultCommit<Impl>::markCompletedInsts()
1272 // Grab completed insts out of the IEW instruction queue, and mark
1273 // instructions completed within the ROB.
1274 for (int inst_num = 0;
1275 inst_num < fromIEW->size && fromIEW->insts[inst_num];
1278 if (!fromIEW->insts[inst_num]->isSquashed()) {
1279 DPRINTF(Commit, "[tid:%i]: Marking PC %s, [sn:%lli] ready "
1281 fromIEW->insts[inst_num]->threadNumber,
1282 fromIEW->insts[inst_num]->pcState(),
1283 fromIEW->insts[inst_num]->seqNum);
1285 // Mark the instruction as ready to commit.
1286 fromIEW->insts[inst_num]->setCanCommit();
1291 template <class Impl>
1293 DefaultCommit<Impl>::robDoneSquashing()
1295 list<ThreadID>::iterator threads = activeThreads->begin();
1296 list<ThreadID>::iterator end = activeThreads->end();
1298 while (threads != end) {
1299 ThreadID tid = *threads++;
1301 if (!rob->isDoneSquashing(tid))
1308 template <class Impl>
1310 DefaultCommit<Impl>::updateComInstStats(DynInstPtr &inst)
1312 ThreadID tid = inst->threadNumber;
1315 // Pick off the software prefetches
1318 if (inst->isDataPrefetch()) {
1328 // Control Instructions
1330 if (inst->isControl())
1331 statComBranches[tid]++;
1334 // Memory references
1336 if (inst->isMemRef()) {
1339 if (inst->isLoad()) {
1340 statComLoads[tid]++;
1344 if (inst->isMemBarrier()) {
1345 statComMembars[tid]++;
1348 // Integer Instruction
1349 if (inst->isInteger())
1350 statComInteger[tid]++;
1352 // Floating Point Instruction
1353 if (inst->isFloating())
1354 statComFloating[tid]++;
1358 statComFunctionCalls[tid]++;
1362 ////////////////////////////////////////
1364 // SMT COMMIT POLICY MAINTAINED HERE //
1366 ////////////////////////////////////////
1367 template <class Impl>
1369 DefaultCommit<Impl>::getCommittingThread()
1371 if (numThreads > 1) {
1372 switch (commitPolicy) {
1375 //If Policy is Aggressive, commit will call
1376 //this function multiple times per
1378 return oldestReady();
1381 return roundRobin();
1384 return oldestReady();
1387 return InvalidThreadID;
1390 assert(!activeThreads->empty());
1391 ThreadID tid = activeThreads->front();
1393 if (commitStatus[tid] == Running ||
1394 commitStatus[tid] == Idle ||
1395 commitStatus[tid] == FetchTrapPending) {
1398 return InvalidThreadID;
1403 template<class Impl>
1405 DefaultCommit<Impl>::roundRobin()
1407 list<ThreadID>::iterator pri_iter = priority_list.begin();
1408 list<ThreadID>::iterator end = priority_list.end();
1410 while (pri_iter != end) {
1411 ThreadID tid = *pri_iter;
1413 if (commitStatus[tid] == Running ||
1414 commitStatus[tid] == Idle ||
1415 commitStatus[tid] == FetchTrapPending) {
1417 if (rob->isHeadReady(tid)) {
1418 priority_list.erase(pri_iter);
1419 priority_list.push_back(tid);
1428 return InvalidThreadID;
1431 template<class Impl>
1433 DefaultCommit<Impl>::oldestReady()
1435 unsigned oldest = 0;
1438 list<ThreadID>::iterator threads = activeThreads->begin();
1439 list<ThreadID>::iterator end = activeThreads->end();
1441 while (threads != end) {
1442 ThreadID tid = *threads++;
1444 if (!rob->isEmpty(tid) &&
1445 (commitStatus[tid] == Running ||
1446 commitStatus[tid] == Idle ||
1447 commitStatus[tid] == FetchTrapPending)) {
1449 if (rob->isHeadReady(tid)) {
1451 DynInstPtr head_inst = rob->readHeadInst(tid);
1456 } else if (head_inst->seqNum < oldest) {
1466 return InvalidThreadID;