2 * Copyright (c) 2007 MIPS Technologies, Inc.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Korey Sewell
32 #ifndef __CPU_INORDER_PIPELINE_IMPL_HH__
33 #define __CPU_INORDER_PIPELINE_IMPL_HH__
39 #include "arch/isa_traits.hh"
43 /* This Namespace contains constants, typedefs, functions and
44 * objects specific to the Pipeline Implementation.
46 namespace ThePipeline {
48 const unsigned NumStages = 5;
49 const unsigned MaxThreads = 3;
50 const unsigned StageWidth = 1;
51 const unsigned BackEndStartStage = 2;
53 // Enumerated List of Resources The Pipeline Uses
70 // Expand this as necessary for your inter stage buffer sizes
71 static const unsigned interStageBuffSize[] = {
72 StageWidth, /* Stage 0 - 1 */
73 StageWidth, /* Stage 1 - 2 */
74 StageWidth, /* Stage 2 - 3 */
75 StageWidth, /* Stage 3 - 4 */
76 StageWidth, /* Stage 4 - 5 */
77 StageWidth, /* Stage 5 - 6 */
78 StageWidth, /* Stage 6 - 7 */
79 StageWidth, /* Stage 7 - 8 */
80 StageWidth /* Stage 8 - 9 */
83 typedef InOrderCPUParams Params;
84 typedef RefCountingPtr<InOrderDynInst> DynInstPtr;
86 //////////////////////////
87 // RESOURCE SCHEDULING
88 //////////////////////////
89 struct ScheduleEntry {
90 ScheduleEntry(int stage_num, int _priority, int res_num, int _cmd = 0,
92 stageNum(stage_num), resNum(res_num), cmd(_cmd),
93 idx(_idx), priority(_priority)
95 virtual ~ScheduleEntry(){}
97 // Stage number to perform this service.
100 // Resource ID to access
103 // See specific resource for meaning
106 // See specific resource for meaning
109 // Some Resources May Need Priority?
113 struct entryCompare {
114 bool operator()(const ScheduleEntry* lhs, const ScheduleEntry* rhs) const
116 // Prioritize first by stage number that the resource is needed
117 if (lhs->stageNum > rhs->stageNum) {
119 } else if (lhs->stageNum == rhs->stageNum) {
120 /*if (lhs->resNum > rhs->resNum) {
126 if (lhs->priority > rhs->priority) {
138 typedef std::priority_queue<ScheduleEntry*, std::vector<ScheduleEntry*>,
139 entryCompare> ResSchedule;
141 void createFrontEndSchedule(DynInstPtr &inst);
142 bool createBackEndSchedule(DynInstPtr &inst);
143 int getNextPriority(DynInstPtr &inst, int stage_num);