2010-06-25 23:42:34 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2010 The Regents of The University of Michigan
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* Authors: Korey Sewell
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
#include <cstdio>
|
2011-04-15 19:44:06 +02:00
|
|
|
#include <list>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include "cpu/inorder/pipeline_traits.hh"
|
|
|
|
#include "cpu/inorder/resource_sked.hh"
|
2010-06-25 23:42:34 +02:00
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
using namespace ThePipeline;
|
|
|
|
|
|
|
|
ResourceSked::ResourceSked()
|
|
|
|
{
|
2011-02-12 16:14:45 +01:00
|
|
|
stages.resize(NumStages);
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ResourceSked::init()
|
|
|
|
{
|
2011-02-12 16:14:45 +01:00
|
|
|
assert(!stages[0].empty());
|
2010-06-25 23:42:34 +02:00
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
curSkedEntry = stages[0].begin();
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ResourceSked::size()
|
|
|
|
{
|
|
|
|
int total = 0;
|
2011-02-12 16:14:45 +01:00
|
|
|
for (int i = 0; i < stages.size(); i++) {
|
|
|
|
total += stages[i].size();
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return total;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
ResourceSked::empty()
|
|
|
|
{
|
|
|
|
return size() == 0;
|
|
|
|
}
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
|
|
|
|
ResourceSked::SkedIt
|
|
|
|
ResourceSked::begin()
|
|
|
|
{
|
|
|
|
int num_stages = stages.size();
|
|
|
|
for (int i = 0; i < num_stages; i++) {
|
|
|
|
if (stages[i].size() > 0)
|
|
|
|
return stages[i].begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
return stages[num_stages - 1].end();
|
|
|
|
}
|
|
|
|
|
|
|
|
ResourceSked::SkedIt
|
|
|
|
ResourceSked::end()
|
|
|
|
{
|
|
|
|
int num_stages = stages.size();
|
|
|
|
return stages[num_stages - 1].end();
|
|
|
|
}
|
|
|
|
|
2010-06-25 23:42:34 +02:00
|
|
|
ScheduleEntry*
|
|
|
|
ResourceSked::top()
|
|
|
|
{
|
|
|
|
assert(size() > 0);
|
|
|
|
|
|
|
|
return *curSkedEntry;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ResourceSked::pop()
|
|
|
|
{
|
|
|
|
int stage_num = (*curSkedEntry)->stageNum;
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
stages[stage_num].erase(curSkedEntry);
|
2010-06-25 23:42:34 +02:00
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
if (!stages[stage_num].empty()) {
|
|
|
|
curSkedEntry = stages[stage_num].begin();
|
2010-06-25 23:42:34 +02:00
|
|
|
} else {
|
|
|
|
int next_stage = stage_num + 1;
|
|
|
|
|
|
|
|
while (next_stage < NumStages) {
|
2011-02-12 16:14:45 +01:00
|
|
|
if (stages[next_stage].empty()) {
|
2010-06-25 23:42:34 +02:00
|
|
|
next_stage++;
|
|
|
|
} else {
|
2011-02-12 16:14:45 +01:00
|
|
|
curSkedEntry = stages[next_stage].begin();
|
2010-06-25 23:42:34 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ResourceSked::push(ScheduleEntry* sked_entry)
|
|
|
|
{
|
|
|
|
int stage_num = sked_entry->stageNum;
|
|
|
|
assert(stage_num < NumStages);
|
|
|
|
|
|
|
|
SkedIt pri_iter = findIterByPriority(sked_entry, stage_num);
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
stages[stage_num].insert(pri_iter, sked_entry);
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ResourceSked::pushBefore(ScheduleEntry* sked_entry, int sked_cmd,
|
|
|
|
int sked_cmd_idx)
|
|
|
|
{
|
|
|
|
|
|
|
|
int stage_num = sked_entry->stageNum;
|
|
|
|
assert(stage_num < NumStages);
|
|
|
|
|
|
|
|
SkedIt pri_iter = findIterByCommand(sked_entry, stage_num,
|
|
|
|
sked_cmd, sked_cmd_idx);
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
assert(pri_iter != stages[stage_num].end() &&
|
2010-06-25 23:42:34 +02:00
|
|
|
"Could not find command to insert in front of.");
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
stages[stage_num].insert(pri_iter, sked_entry);
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
ResourceSked::SkedIt
|
|
|
|
ResourceSked::findIterByPriority(ScheduleEntry* sked_entry, int stage_num)
|
|
|
|
{
|
2011-02-12 16:14:45 +01:00
|
|
|
if (stages[stage_num].empty()) {
|
|
|
|
return stages[stage_num].end();
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int priority = sked_entry->priority;
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
SkedIt sked_it = stages[stage_num].begin();
|
|
|
|
SkedIt sked_end = stages[stage_num].end();
|
2010-06-25 23:42:34 +02:00
|
|
|
|
|
|
|
while (sked_it != sked_end) {
|
|
|
|
if ((*sked_it)->priority > priority)
|
|
|
|
break;
|
|
|
|
|
|
|
|
sked_it++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return sked_it;
|
|
|
|
}
|
|
|
|
|
|
|
|
ResourceSked::SkedIt
|
|
|
|
ResourceSked::findIterByCommand(ScheduleEntry* sked_entry, int stage_num,
|
|
|
|
int sked_cmd, int sked_cmd_idx)
|
|
|
|
{
|
2011-02-12 16:14:45 +01:00
|
|
|
if (stages[stage_num].empty()) {
|
|
|
|
return stages[stage_num].end();
|
2010-06-25 23:42:34 +02:00
|
|
|
}
|
|
|
|
|
2011-02-12 16:14:45 +01:00
|
|
|
SkedIt sked_it = stages[stage_num].begin();
|
|
|
|
SkedIt sked_end = stages[stage_num].end();
|
2010-06-25 23:42:34 +02:00
|
|
|
|
|
|
|
while (sked_it != sked_end) {
|
|
|
|
if ((*sked_it)->cmd == sked_cmd &&
|
|
|
|
(sked_cmd_idx != -1) ? (*sked_it)->idx == sked_cmd_idx : true)
|
|
|
|
break;
|
|
|
|
|
|
|
|
sked_it++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return sked_it;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ResourceSked::print()
|
|
|
|
{
|
2011-02-12 16:14:45 +01:00
|
|
|
for (int i = 0; i < stages.size(); i++) {
|
|
|
|
//ccprintf(cerr, "Stage %i\n====\n", i);
|
|
|
|
SkedIt sked_it = stages[i].begin();
|
|
|
|
SkedIt sked_end = stages[i].end();
|
2010-06-25 23:42:34 +02:00
|
|
|
while (sked_it != sked_end) {
|
2011-02-12 16:14:45 +01:00
|
|
|
DPRINTF(SkedCache, "\t stage:%i res:%i cmd:%i idx:%i\n",
|
|
|
|
(*sked_it)->stageNum,
|
|
|
|
(*sked_it)->resNum,
|
|
|
|
(*sked_it)->cmd,
|
|
|
|
(*sked_it)->idx);
|
2010-06-25 23:42:34 +02:00
|
|
|
sked_it++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|