src/cpu/inorder/pipeline_traits.9stage.smt2.hh

   1 /*
   2  * Copyright (c) 2007 MIPS Technologies, Inc.
   3  * All rights reserved.
   4  *
   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.
  15  *
  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.
  27  *
  28  * Authors: Korey Sewell
  29  *
  30  */
  31
  32 #ifndef __CPU_INORDER_PIPELINE_IMPL_HH__
  33 #define __CPU_INORDER_PIPELINE_IMPL_HH__
  34
  35 #include <list>
  36 #include <map>
  37 #include <queue>
  38 #include <vector>
  39
  40 #include "arch/isa_traits.hh"
  41
  42 class InOrderDynInst;
  43
  44 /* This Namespace contains constants, typedefs, functions and
  45  * objects specific to the Pipeline Implementation.
  46  */
  47 namespace ThePipeline {
  48     // Pipeline Constants
  49     const unsigned NumStages = 9;
  50     const unsigned MaxThreads = 2;
  51     const unsigned StageWidth = 1;
  52     const unsigned BackEndStartStage = 3;
  53
  54     // Use this to over-ride default stage widths
  55     static std::map<unsigned, unsigned> stageBufferSizes;
  56
  57     //static unsigned interStageBuffSize[NumStages];
  58
  59     static const unsigned interStageBuffSize[NumStages] = {
  60         StageWidth, /* Stage 0 - 1 */
  61         StageWidth, /* Stage 1 - 2 */
  62         MaxThreads * 4,          /* Stage 2 - 3 */
  63         StageWidth, /* Stage 3 - 4 */
  64         MaxThreads * 4, /* Stage 4 - 5 */
  65         StageWidth, /* Stage 5 - 6 */
  66         StageWidth, /* Stage 6 - 7 */
  67         StageWidth, /* Stage 7 - 8 */
  68         MaxThreads  /* Stage 8 - 9 */
  69     };
  70
  71
  72     // Enumerated List of Resources The Pipeline Uses
  73     enum ResourceList {
  74        FetchSeq = 0,
  75        ITLB,
  76        ICache,
  77        Decode,
  78        BPred,
  79        RegManager,
  80        AGEN,
  81        ExecUnit,
  82        DTLB,
  83        DCache,
  84        Grad,
  85        FetchBuff,
  86        FetchBuff2
  87     };
  88
  89     typedef InOrderCPUParams Params;
  90     typedef RefCountingPtr<InOrderDynInst> DynInstPtr;
  91
  92 //void initPipelineTraits();
  93
  94     //////////////////////////
  95     // RESOURCE SCHEDULING
  96     //////////////////////////
  97     struct ScheduleEntry {
  98         ScheduleEntry(int stage_num, int _priority, int res_num, int _cmd = 0,
  99                       int _idx = 0) :
 100             stageNum(stage_num), resNum(res_num), cmd(_cmd),
 101             idx(_idx), priority(_priority)
 102         { }
 103         virtual ~ScheduleEntry(){}
 104
 105         // Stage number to perform this service.
 106         int stageNum;
 107
 108         // Resource ID to access
 109         int resNum;
 110
 111         // See specific resource for meaning
 112         unsigned cmd;
 113
 114         // See specific resource for meaning
 115         unsigned idx;
 116
 117         // Some Resources May Need Priority?
 118         int priority;
 119     };
 120
 121     struct entryCompare {
 122         bool operator()(const ScheduleEntry* lhs, const ScheduleEntry* rhs) const
 123         {
 124             // Prioritize first by stage number that the resource is needed
 125             if (lhs->stageNum > rhs->stageNum) {
 126                 return true;
 127             } else if (lhs->stageNum == rhs->stageNum) {
 128                 /*if (lhs->resNum > rhs->resNum) {
 129                   return true;
 130                 } else {
 131                   return false;
 132                   }*/
 133
 134                 if (lhs->priority > rhs->priority) {
 135                   return true;
 136                 } else {
 137                   return false;
 138                 }
 139             } else {
 140                 return false;
 141             }
 142         }
 143     };
 144
 145
 146     typedef std::priority_queue<ScheduleEntry*, std::vector<ScheduleEntry*>,
 147                                          entryCompare> ResSchedule;
 148
 149     void createFrontEndSchedule(DynInstPtr &inst);
 150     bool createBackEndSchedule(DynInstPtr &inst);
 151     int getNextPriority(DynInstPtr &inst, int stage_num);
 152 };
 153 #endif