From 9daa8a12d33412d3d7c78f7b5a00f0883e388b58 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Wed, 23 Jul 2003 14:59:40 +0000 Subject: [PATCH] Random cleanups git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7247 91177308-0d34-0410-b5e6-96231b3b80d8 --- .../ModuloScheduling/ModuloScheduling.cpp | 44 ++++++++----------- .../ModuloScheduling/ModuloScheduling.cpp | 44 ++++++++----------- 2 files changed, 36 insertions(+), 52 deletions(-) diff --git a/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp b/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp index 29f4a4131e4..49f4246c022 100644 --- a/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp +++ b/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp @@ -4,12 +4,8 @@ // //===----------------------------------------------------------------------===// -//#include "llvm/CodeGen/MachineCodeForBasicBlock.h" -//#include "llvm/CodeGen/MachineCodeForMethod.h" -//#include "llvm/Analysis/LiveVar/FunctionLiveVarInfo.h" // FIXME: Remove when modularized better #include "llvm/BasicBlock.h" #include "llvm/Constants.h" -#include "llvm/Instruction.h" #include "llvm/iTerminators.h" #include "llvm/iPHINode.h" #include "llvm/CodeGen/MachineInstr.h" @@ -24,10 +20,6 @@ #include "ModuloScheduling.h" #include #include -#include - -using std::endl; -using std::cerr; //************************************************************ // printing Debug information @@ -455,9 +447,9 @@ ModuloScheduling::constructKernel(BasicBlock *prologue, kernel_ist.erase(--kernel_ist.end()); // set the first successor to itself - ((BranchInst *) cln)->setSuccessor(0, kernel); + cln->setSuccessor(0, kernel); // set the second successor to eiplogue - ((BranchInst *) cln)->setSuccessor(1, epilogue); + cln->setSuccessor(1, epilogue); //*****change the condition******* @@ -907,38 +899,38 @@ ModuloScheduling::dumpScheduling(){ void ModuloScheduling::dumpFinalSchedule(){ - cerr << "dump schedule:" << endl; + std::cerr << "dump schedule:" << "\n"; const TargetSchedInfo & msi = target.getSchedInfo(); unsigned numIssueSlots = msi.maxNumIssueTotal; for (unsigned i = 0; i < numIssueSlots; i++) - cerr << "\t#"; - cerr << endl; + std::cerr << "\t#"; + std::cerr << "\n"; for (unsigned i = 0; i < schedule.size(); i++) { - cerr << "cycle" << i << ": "; + std::cerr << "cycle" << i << ": "; for (unsigned j = 0; j < schedule[i].size(); j++) if (schedule[i][j] != NULL) - cerr << schedule[i][j]->getNodeId() << "\t"; + std::cerr << schedule[i][j]->getNodeId() << "\t"; else - cerr << "\t"; - cerr << endl; + std::cerr << "\t"; + std::cerr << "\n"; } - cerr << "dump coreSchedule:" << endl; + std::cerr << "dump coreSchedule:" << "\n"; for (unsigned i = 0; i < numIssueSlots; i++) - cerr << "\t#"; - cerr << endl; + std::cerr << "\t#"; + std::cerr << "\n"; for (unsigned i = 0; i < coreSchedule.size(); i++) { - cerr << "cycle" << i << ": "; + std::cerr << "cycle" << i << ": "; for (unsigned j = 0; j < coreSchedule[i].size(); j++) if (coreSchedule[i][j] != NULL) - cerr << coreSchedule[i][j]->getNodeId() << "\t"; + std::cerr << coreSchedule[i][j]->getNodeId() << "\t"; else - cerr << "\t"; - cerr << endl; + std::cerr << "\t"; + std::cerr << "\n"; } } @@ -979,13 +971,13 @@ ModuloSchedulingPass::runOnFunction(Function &F){ ModuloSchedulingSet ModuloSchedulingSet(*graphSet); - DEBUG_PRINT(cerr<<"runOnFunction in ModuloSchedulingPass returns\n"< #include -#include - -using std::endl; -using std::cerr; //************************************************************ // printing Debug information @@ -455,9 +447,9 @@ ModuloScheduling::constructKernel(BasicBlock *prologue, kernel_ist.erase(--kernel_ist.end()); // set the first successor to itself - ((BranchInst *) cln)->setSuccessor(0, kernel); + cln->setSuccessor(0, kernel); // set the second successor to eiplogue - ((BranchInst *) cln)->setSuccessor(1, epilogue); + cln->setSuccessor(1, epilogue); //*****change the condition******* @@ -907,38 +899,38 @@ ModuloScheduling::dumpScheduling(){ void ModuloScheduling::dumpFinalSchedule(){ - cerr << "dump schedule:" << endl; + std::cerr << "dump schedule:" << "\n"; const TargetSchedInfo & msi = target.getSchedInfo(); unsigned numIssueSlots = msi.maxNumIssueTotal; for (unsigned i = 0; i < numIssueSlots; i++) - cerr << "\t#"; - cerr << endl; + std::cerr << "\t#"; + std::cerr << "\n"; for (unsigned i = 0; i < schedule.size(); i++) { - cerr << "cycle" << i << ": "; + std::cerr << "cycle" << i << ": "; for (unsigned j = 0; j < schedule[i].size(); j++) if (schedule[i][j] != NULL) - cerr << schedule[i][j]->getNodeId() << "\t"; + std::cerr << schedule[i][j]->getNodeId() << "\t"; else - cerr << "\t"; - cerr << endl; + std::cerr << "\t"; + std::cerr << "\n"; } - cerr << "dump coreSchedule:" << endl; + std::cerr << "dump coreSchedule:" << "\n"; for (unsigned i = 0; i < numIssueSlots; i++) - cerr << "\t#"; - cerr << endl; + std::cerr << "\t#"; + std::cerr << "\n"; for (unsigned i = 0; i < coreSchedule.size(); i++) { - cerr << "cycle" << i << ": "; + std::cerr << "cycle" << i << ": "; for (unsigned j = 0; j < coreSchedule[i].size(); j++) if (coreSchedule[i][j] != NULL) - cerr << coreSchedule[i][j]->getNodeId() << "\t"; + std::cerr << coreSchedule[i][j]->getNodeId() << "\t"; else - cerr << "\t"; - cerr << endl; + std::cerr << "\t"; + std::cerr << "\n"; } } @@ -979,13 +971,13 @@ ModuloSchedulingPass::runOnFunction(Function &F){ ModuloSchedulingSet ModuloSchedulingSet(*graphSet); - DEBUG_PRINT(cerr<<"runOnFunction in ModuloSchedulingPass returns\n"<