6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-17 21:29:20 +00:00
Code Issues Projects Releases Wiki Activity

Simplify some template parameterization.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@52571 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2008-06-21 01:08:22 +00:00
parent 9f99b7c595
commit 16c6859651
1 changed files with 12 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp
View File

@ -1324,9 +1324,8 @@ namespace {
} }
}; };
template<class SF>
class VISIBILITY_HIDDEN BURegReductionPriorityQueue class VISIBILITY_HIDDEN BURegReductionPriorityQueue
: public RegReductionPriorityQueue<SF> { : public RegReductionPriorityQueue<bu_ls_rr_sort> {
// SUnitMap SDNode to SUnit mapping (n -> n). // SUnitMap SDNode to SUnit mapping (n -> n).
DenseMap<SDNode*, std::vector<SUnit*> > *SUnitMap; DenseMap<SDNode*, std::vector<SUnit*> > *SUnitMap;
@ -1412,9 +1411,8 @@ namespace {
}; };
template<class SF>
class VISIBILITY_HIDDEN TDRegReductionPriorityQueue class VISIBILITY_HIDDEN TDRegReductionPriorityQueue
: public RegReductionPriorityQueue<SF> { : public RegReductionPriorityQueue<td_ls_rr_sort> {
// SUnitMap SDNode to SUnit mapping (n -> n). // SUnitMap SDNode to SUnit mapping (n -> n).
DenseMap<SDNode*, std::vector<SUnit*> > *SUnitMap; DenseMap<SDNode*, std::vector<SUnit*> > *SUnitMap;
@ -1551,8 +1549,8 @@ bool bu_ls_rr_sort::operator()(const SUnit *left, const SUnit *right) const {
return (left->NodeQueueId > right->NodeQueueId); return (left->NodeQueueId > right->NodeQueueId);
} }
template<class SF> bool bool
BURegReductionPriorityQueue<SF>::canClobber(const SUnit *SU, const SUnit *Op) { BURegReductionPriorityQueue::canClobber(const SUnit *SU, const SUnit *Op) {
if (SU->isTwoAddress) { if (SU->isTwoAddress) {
unsigned Opc = SU->Node->getTargetOpcode(); unsigned Opc = SU->Node->getTargetOpcode();
const TargetInstrDesc &TID = TII->get(Opc); const TargetInstrDesc &TID = TII->get(Opc);
@ -1619,8 +1617,7 @@ static bool canClobberPhysRegDefs(SUnit *SuccSU, SUnit *SU,
/// one that has a CopyToReg use (more likely to be a loop induction update). /// one that has a CopyToReg use (more likely to be a loop induction update).
/// If both are two-address, but one is commutable while the other is not /// If both are two-address, but one is commutable while the other is not
/// commutable, favor the one that's not commutable. /// commutable, favor the one that's not commutable.
template<class SF> void BURegReductionPriorityQueue::AddPseudoTwoAddrDeps() {
void BURegReductionPriorityQueue<SF>::AddPseudoTwoAddrDeps() {
for (unsigned i = 0, e = SUnits->size(); i != e; ++i) { for (unsigned i = 0, e = SUnits->size(); i != e; ++i) {
SUnit *SU = (SUnit *)&((*SUnits)[i]); SUnit *SU = (SUnit *)&((*SUnits)[i]);
if (!SU->isTwoAddress) if (!SU->isTwoAddress)
@ -1681,8 +1678,7 @@ void BURegReductionPriorityQueue<SF>::AddPseudoTwoAddrDeps() {
/// CalcNodeSethiUllmanNumber - Priority is the Sethi Ullman number. /// CalcNodeSethiUllmanNumber - Priority is the Sethi Ullman number.
/// Smaller number is the higher priority. /// Smaller number is the higher priority.
template<class SF> unsigned BURegReductionPriorityQueue::
unsigned BURegReductionPriorityQueue<SF>::
CalcNodeSethiUllmanNumber(const SUnit *SU) { CalcNodeSethiUllmanNumber(const SUnit *SU) {
unsigned &SethiUllmanNumber = SethiUllmanNumbers[SU->NodeNum]; unsigned &SethiUllmanNumber = SethiUllmanNumbers[SU->NodeNum];
if (SethiUllmanNumber != 0) if (SethiUllmanNumber != 0)
@ -1711,8 +1707,7 @@ CalcNodeSethiUllmanNumber(const SUnit *SU) {
/// CalculateSethiUllmanNumbers - Calculate Sethi-Ullman numbers of all /// CalculateSethiUllmanNumbers - Calculate Sethi-Ullman numbers of all
/// scheduling units. /// scheduling units.
template<class SF> void BURegReductionPriorityQueue::CalculateSethiUllmanNumbers() {
void BURegReductionPriorityQueue<SF>::CalculateSethiUllmanNumbers() {
SethiUllmanNumbers.assign(SUnits->size(), 0); SethiUllmanNumbers.assign(SUnits->size(), 0);
for (unsigned i = 0, e = SUnits->size(); i != e; ++i) for (unsigned i = 0, e = SUnits->size(); i != e; ++i)
@ -1784,8 +1779,7 @@ bool td_ls_rr_sort::operator()(const SUnit *left, const SUnit *right) const {
/// CalcNodeSethiUllmanNumber - Priority is the Sethi Ullman number. /// CalcNodeSethiUllmanNumber - Priority is the Sethi Ullman number.
/// Smaller number is the higher priority. /// Smaller number is the higher priority.
template<class SF> unsigned TDRegReductionPriorityQueue::
unsigned TDRegReductionPriorityQueue<SF>::
CalcNodeSethiUllmanNumber(const SUnit *SU) { CalcNodeSethiUllmanNumber(const SUnit *SU) {
unsigned &SethiUllmanNumber = SethiUllmanNumbers[SU->NodeNum]; unsigned &SethiUllmanNumber = SethiUllmanNumbers[SU->NodeNum];
if (SethiUllmanNumber != 0) if (SethiUllmanNumber != 0)
@ -1825,8 +1819,7 @@ CalcNodeSethiUllmanNumber(const SUnit *SU) {
/// CalculateSethiUllmanNumbers - Calculate Sethi-Ullman numbers of all /// CalculateSethiUllmanNumbers - Calculate Sethi-Ullman numbers of all
/// scheduling units. /// scheduling units.
template<class SF> void TDRegReductionPriorityQueue::CalculateSethiUllmanNumbers() {
void TDRegReductionPriorityQueue<SF>::CalculateSethiUllmanNumbers() {
SethiUllmanNumbers.assign(SUnits->size(), 0); SethiUllmanNumbers.assign(SUnits->size(), 0);
for (unsigned i = 0, e = SUnits->size(); i != e; ++i) for (unsigned i = 0, e = SUnits->size(); i != e; ++i)
@ -1843,8 +1836,8 @@ llvm::ScheduleDAG* llvm::createBURRListDAGScheduler(SelectionDAGISel *IS,
const TargetInstrInfo *TII = DAG->getTarget().getInstrInfo(); const TargetInstrInfo *TII = DAG->getTarget().getInstrInfo();
const TargetRegisterInfo *TRI = DAG->getTarget().getRegisterInfo(); const TargetRegisterInfo *TRI = DAG->getTarget().getRegisterInfo();
BURegReductionPriorityQueue<bu_ls_rr_sort> *priorityQueue = BURegReductionPriorityQueue *priorityQueue =
new BURegReductionPriorityQueue<bu_ls_rr_sort>(TII, TRI); new BURegReductionPriorityQueue(TII, TRI);
ScheduleDAGRRList * scheduleDAG = ScheduleDAGRRList * scheduleDAG =
new ScheduleDAGRRList(*DAG, BB, DAG->getTarget(), true, priorityQueue); new ScheduleDAGRRList(*DAG, BB, DAG->getTarget(), true, priorityQueue);
@ -1856,6 +1849,6 @@ llvm::ScheduleDAG* llvm::createTDRRListDAGScheduler(SelectionDAGISel *IS,
SelectionDAG *DAG, SelectionDAG *DAG,
MachineBasicBlock *BB) { MachineBasicBlock *BB) {
return new ScheduleDAGRRList(*DAG, BB, DAG->getTarget(), false, return new ScheduleDAGRRList(*DAG, BB, DAG->getTarget(), false,
new TDRegReductionPriorityQueue<td_ls_rr_sort>()); new TDRegReductionPriorityQueue());
} }