mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-29 23:12:55 +01:00
d7b8fb8263
Fixed many many bugs. This now works on almost all Singlesource , and most of MultiSource. llvm-svn: 20780
272 lines
8.8 KiB
C++
272 lines
8.8 KiB
C++
//===-- MSSchedule.cpp Schedule ---------------------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
//
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
#define DEBUG_TYPE "ModuloSched"
|
|
|
|
#include "MSSchedule.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "llvm/Target/TargetSchedInfo.h"
|
|
#include "../SparcV9Internals.h"
|
|
|
|
using namespace llvm;
|
|
|
|
//Returns a boolean indicating if the start cycle needs to be increased/decreased
|
|
bool MSSchedule::insert(MSchedGraphNode *node, int cycle) {
|
|
|
|
//First, check if the cycle has a spot free to start
|
|
if(schedule.find(cycle) != schedule.end()) {
|
|
//Check if we have a free issue slot at this cycle
|
|
if (schedule[cycle].size() < numIssue) {
|
|
//Now check if all the resources in their respective cycles are available
|
|
if(resourcesFree(node, cycle)) {
|
|
//Insert to preserve dependencies
|
|
addToSchedule(cycle,node);
|
|
DEBUG(std::cerr << "Found spot in map, and there is an issue slot\n");
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
//Not in the map yet so put it in
|
|
else {
|
|
if(resourcesFree(node,cycle)) {
|
|
std::vector<MSchedGraphNode*> nodes;
|
|
nodes.push_back(node);
|
|
schedule[cycle] = nodes;
|
|
DEBUG(std::cerr << "Nothing in map yet so taking an issue slot\n");
|
|
return false;
|
|
}
|
|
}
|
|
|
|
DEBUG(std::cerr << "All issue slots taken\n");
|
|
return true;
|
|
|
|
}
|
|
|
|
void MSSchedule::addToSchedule(int cycle, MSchedGraphNode *node) {
|
|
std::vector<MSchedGraphNode*> nodesAtCycle = schedule[cycle];
|
|
|
|
std::map<unsigned, MSchedGraphNode*> indexMap;
|
|
for(unsigned i=0; i < nodesAtCycle.size(); ++i) {
|
|
indexMap[nodesAtCycle[i]->getIndex()] = nodesAtCycle[i];
|
|
}
|
|
|
|
indexMap[node->getIndex()] = node;
|
|
|
|
std::vector<MSchedGraphNode*> nodes;
|
|
for(std::map<unsigned, MSchedGraphNode*>::iterator I = indexMap.begin(), E = indexMap.end(); I != E; ++I)
|
|
nodes.push_back(I->second);
|
|
|
|
schedule[cycle] = nodes;
|
|
}
|
|
|
|
|
|
bool MSSchedule::resourcesFree(MSchedGraphNode *node, int cycle) {
|
|
|
|
//Get Resource usage for this instruction
|
|
const TargetSchedInfo *msi = node->getParent()->getTarget()->getSchedInfo();
|
|
int currentCycle = cycle;
|
|
bool success = true;
|
|
|
|
//Get resource usage for this instruction
|
|
InstrRUsage rUsage = msi->getInstrRUsage(node->getInst()->getOpcode());
|
|
std::vector<std::vector<resourceId_t> > resources = rUsage.resourcesByCycle;
|
|
|
|
//Loop over resources in each cycle and increments their usage count
|
|
for(unsigned i=0; i < resources.size(); ++i) {
|
|
for(unsigned j=0; j < resources[i].size(); ++j) {
|
|
|
|
//Get Resource to check its availability
|
|
int resourceNum = resources[i][j];
|
|
|
|
DEBUG(std::cerr << "Attempting to schedule Resource Num: " << resourceNum << " in cycle: " << currentCycle << "\n");
|
|
|
|
//Check if this resource is available for this cycle
|
|
std::map<int, std::map<int,int> >::iterator resourcesForCycle = resourceNumPerCycle.find(currentCycle);
|
|
|
|
//First check if map exists for this cycle
|
|
if(resourcesForCycle != resourceNumPerCycle.end()) {
|
|
//A map exists for this cycle, so lets check for the resource
|
|
std::map<int, int>::iterator resourceUse = resourcesForCycle->second.find(resourceNum);
|
|
if(resourceUse != resourcesForCycle->second.end()) {
|
|
//Check if there are enough of this resource and if so, increase count and move on
|
|
if(resourceUse->second < CPUResource::getCPUResource(resourceNum)->maxNumUsers)
|
|
++resourceUse->second;
|
|
|
|
else {
|
|
DEBUG(std::cerr << "No resource num " << resourceNum << " available for cycle " << currentCycle << "\n");
|
|
success = false;
|
|
}
|
|
}
|
|
//Not in the map yet, so put it
|
|
else
|
|
resourcesForCycle->second[resourceNum] = 1;
|
|
|
|
}
|
|
else {
|
|
//Create a new map and put in our resource
|
|
std::map<int, int> resourceMap;
|
|
resourceMap[resourceNum] = 1;
|
|
resourceNumPerCycle[currentCycle] = resourceMap;
|
|
}
|
|
if(!success)
|
|
break;
|
|
}
|
|
if(!success)
|
|
break;
|
|
|
|
|
|
//Increase cycle
|
|
currentCycle++;
|
|
}
|
|
|
|
if(!success) {
|
|
int oldCycle = cycle;
|
|
DEBUG(std::cerr << "Backtrack\n");
|
|
//Get resource usage for this instruction
|
|
InstrRUsage rUsage = msi->getInstrRUsage(node->getInst()->getOpcode());
|
|
std::vector<std::vector<resourceId_t> > resources = rUsage.resourcesByCycle;
|
|
|
|
//Loop over resources in each cycle and increments their usage count
|
|
for(unsigned i=0; i < resources.size(); ++i) {
|
|
if(oldCycle < currentCycle) {
|
|
|
|
//Check if this resource is available for this cycle
|
|
std::map<int, std::map<int,int> >::iterator resourcesForCycle = resourceNumPerCycle.find(oldCycle);
|
|
if(resourcesForCycle != resourceNumPerCycle.end()) {
|
|
for(unsigned j=0; j < resources[i].size(); ++j) {
|
|
int resourceNum = resources[i][j];
|
|
//remove from map
|
|
std::map<int, int>::iterator resourceUse = resourcesForCycle->second.find(resourceNum);
|
|
//assert if not in the map.. since it should be!
|
|
//assert(resourceUse != resourcesForCycle.end() && "Resource should be in map!");
|
|
DEBUG(std::cerr << "Removing resource num " << resourceNum << " from cycle " << oldCycle << "\n");
|
|
--resourceUse->second;
|
|
}
|
|
}
|
|
}
|
|
else
|
|
break;
|
|
oldCycle++;
|
|
}
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
bool MSSchedule::constructKernel(int II, std::vector<MSchedGraphNode*> &branches, std::map<const MachineInstr*, unsigned> &indVar) {
|
|
|
|
//Our schedule is allowed to have negative numbers, so lets calculate this offset
|
|
int offset = schedule.begin()->first;
|
|
if(offset > 0)
|
|
offset = 0;
|
|
|
|
DEBUG(std::cerr << "Offset: " << offset << "\n");
|
|
|
|
//Not sure what happens in this case, but assert if offset is > II
|
|
//assert(offset > -II && "Offset can not be more then II");
|
|
|
|
std::vector<std::pair<MSchedGraphNode*, int> > tempKernel;
|
|
|
|
|
|
int stageNum = ((schedule.rbegin()->first-offset)+1)/ II;
|
|
int maxSN = 0;
|
|
|
|
DEBUG(std::cerr << "Number of Stages: " << stageNum << "\n");
|
|
|
|
for(int index = offset; index < (II+offset); ++index) {
|
|
int count = 0;
|
|
for(int i = index; i <= (schedule.rbegin()->first); i+=II) {
|
|
if(schedule.count(i)) {
|
|
for(std::vector<MSchedGraphNode*>::iterator I = schedule[i].begin(),
|
|
E = schedule[i].end(); I != E; ++I) {
|
|
//Check if its a branch
|
|
if((*I)->isBranch()) {
|
|
assert(count == 0 && "Branch can not be from a previous iteration");
|
|
tempKernel.push_back(std::make_pair(*I, count));
|
|
}
|
|
else {
|
|
//FIXME: Check if the instructions in the earlier stage conflict
|
|
tempKernel.push_back(std::make_pair(*I, count));
|
|
maxSN = std::max(maxSN, count);
|
|
}
|
|
}
|
|
}
|
|
++count;
|
|
}
|
|
}
|
|
|
|
//Add in induction var code
|
|
for(std::vector<std::pair<MSchedGraphNode*, int> >::iterator I = tempKernel.begin(), IE = tempKernel.end();
|
|
I != IE; ++I) {
|
|
//Add indVar instructions before this one for the current iteration
|
|
if(I->second == 0) {
|
|
std::map<unsigned, MachineInstr*> tmpMap;
|
|
|
|
//Loop over induction variable instructions in the map that come before this instr
|
|
for(std::map<const MachineInstr*, unsigned>::iterator N = indVar.begin(), NE = indVar.end(); N != NE; ++N) {
|
|
|
|
|
|
if(N->second < I->first->getIndex())
|
|
tmpMap[N->second] = (MachineInstr*) N->first;
|
|
}
|
|
|
|
//Add to kernel, and delete from indVar
|
|
for(std::map<unsigned, MachineInstr*>::iterator N = tmpMap.begin(), NE = tmpMap.end(); N != NE; ++N) {
|
|
kernel.push_back(std::make_pair(N->second, 0));
|
|
indVar.erase(N->second);
|
|
}
|
|
}
|
|
|
|
kernel.push_back(std::make_pair((MachineInstr*) I->first->getInst(), I->second));
|
|
|
|
}
|
|
|
|
std::map<unsigned, MachineInstr*> tmpMap;
|
|
|
|
//Add remaining invar instructions
|
|
for(std::map<const MachineInstr*, unsigned>::iterator N = indVar.begin(), NE = indVar.end(); N != NE; ++N) {
|
|
tmpMap[N->second] = (MachineInstr*) N->first;
|
|
}
|
|
|
|
//Add to kernel, and delete from indVar
|
|
for(std::map<unsigned, MachineInstr*>::iterator N = tmpMap.begin(), NE = tmpMap.end(); N != NE; ++N) {
|
|
kernel.push_back(std::make_pair(N->second, 0));
|
|
indVar.erase(N->second);
|
|
}
|
|
|
|
|
|
maxStage = maxSN;
|
|
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
void MSSchedule::print(std::ostream &os) const {
|
|
os << "Schedule:\n";
|
|
|
|
for(schedule_const_iterator I = schedule.begin(), E = schedule.end(); I != E; ++I) {
|
|
os << "Cycle: " << I->first << "\n";
|
|
for(std::vector<MSchedGraphNode*>::const_iterator node = I->second.begin(), nodeEnd = I->second.end(); node != nodeEnd; ++node)
|
|
os << **node << "\n";
|
|
}
|
|
|
|
os << "Kernel:\n";
|
|
for(std::vector<std::pair<MachineInstr*, int> >::const_iterator I = kernel.begin(),
|
|
E = kernel.end(); I != E; ++I)
|
|
os << "Node: " << *(I->first) << " Stage: " << I->second << "\n";
|
|
}
|
|
|