00001 // 00002 // Copyright (c) 2005-2008 Kenichi Watanabe. 00003 // Copyright (c) 2005-2008 Yasuhiro Watari. 00004 // Copyright (c) 2005-2008 Hironori Ichibayashi. 00005 // Copyright (c) 2008-2009 Kazuo Horio. 00006 // Copyright (c) 2009-2013 Naruki Kurata. 00007 // Copyright (c) 2005-2013 Ryota Shioya. 00008 // Copyright (c) 2005-2013 Masahiro Goshima. 00009 // 00010 // This software is provided 'as-is', without any express or implied 00011 // warranty. In no event will the authors be held liable for any damages 00012 // arising from the use of this software. 00013 // 00014 // Permission is granted to anyone to use this software for any purpose, 00015 // including commercial applications, and to alter it and redistribute it 00016 // freely, subject to the following restrictions: 00017 // 00018 // 1. The origin of this software must not be misrepresented; you must not 00019 // claim that you wrote the original software. If you use this software 00020 // in a product, an acknowledgment in the product documentation would be 00021 // appreciated but is not required. 00022 // 00023 // 2. Altered source versions must be plainly marked as such, and must not be 00024 // misrepresented as being the original software. 00025 // 00026 // 3. This notice may not be removed or altered from any source 00027 // distribution. 00028 // 00029 // 00030 00031 00032 #include "pch.h" 00033 00034 #include "Sim/Pipeline/Scheduler/IssueSelector/InorderIssueSelector.h" 00035 #include "Sim/Op/Op.h" 00036 00037 using namespace Onikiri; 00038 00039 InorderIssueSelector::InorderIssueSelector() 00040 { 00041 00042 } 00043 00044 InorderIssueSelector::~InorderIssueSelector() 00045 { 00046 00047 } 00048 00049 void InorderIssueSelector::Initialize( InitPhase phase ) 00050 { 00051 } 00052 00053 void InorderIssueSelector::Finalize() 00054 { 00055 ReleaseParam(); 00056 } 00057 00058 void InorderIssueSelector::EvaluateSelect( Scheduler* scheduler ) 00059 { 00060 // Select issued ops. 00061 int issueCount = 0; 00062 int issueWidth = scheduler->GetIssueWidth(); 00063 00064 const OpList& readyOps = scheduler->GetReadyOps(); 00065 const OpList& notReadyOps = scheduler->GetNotReadyOps(); 00066 const SchedulingOps& wokeUpOps = scheduler->GetWokeUpOps(); 00067 00068 OpList::const_iterator r = readyOps.begin(); 00069 SchedulingOps::const_iterator w = wokeUpOps.begin(); 00070 00071 while( issueCount < issueWidth ){ 00072 OpIterator selected; 00073 00074 // Selects the oldest ops from ready ops on issue. 00075 if( r != readyOps.end() && w != wokeUpOps.end() ){ 00076 // There are both of ready ops and woke-up ops. 00077 if( (*r)->GetGlobalSerialID() < (*w)->GetGlobalSerialID() ){ 00078 selected = *r; ++r; 00079 } 00080 else{ 00081 selected = *w; ++w; 00082 } 00083 } 00084 else if( r != readyOps.end() ){ 00085 // There are only ready ops. 00086 selected = *r; ++r; 00087 } 00088 else if( w != wokeUpOps.end() ){ 00089 // There are only woke-up ops. 00090 selected = *w; ++w; 00091 } 00092 else{ 00093 // No op can be selected. 00094 break; 00095 } 00096 00097 // If there are any older ops, the op is not selected. 00098 if( notReadyOps.size() > 0 && 00099 notReadyOps.begin()->GetOp()->GetGlobalSerialID() < selected->GetGlobalSerialID() 00100 ){ 00101 break; 00102 } 00103 00104 if( scheduler->CanSelect( selected ) ) { 00105 scheduler->ReserveSelect( selected ); 00106 ++issueCount; 00107 } 00108 else{ 00109 g_dumper.Dump( DS_WAITING_UNIT, selected ); 00110 } 00111 } 00112 }