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