6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-04-22 00:37:49 +00:00
Code Issues Projects Releases Wiki Activity

Remove unneeded #includes

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@489 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2001-09-07 21:22:28 +00:00
parent c83e954025
commit 15dedbc585
2 changed files with 4 additions and 36 deletions
lib
CodeGen/InstrSched
SchedPriorities.cpp
Target/SparcV9/InstrSched
SchedPriorities.cpp

20
lib/CodeGen/InstrSched/SchedPriorities.cpp

@ -18,24 +18,9 @@
* 7/30/01 - Vikram Adve - Created
***************************************************************************/
//************************** System Include Files **************************/
#include <hash_map>
#include <vector>
#include <algorithm>
#include <sys/types.h>
//*************************** User Include Files ***************************/
#include "llvm/Method.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/InstrScheduling.h"
#include "llvm/CodeGen/SchedPriorities.h"
//************************* Forward Declarations ***************************/
/*ctor*/
SchedPriorities::SchedPriorities(const Method* method,
const SchedGraph* _graph)
: curTime(0),
@ -219,7 +204,7 @@ SchedPriorities::getNextHighest(const SchedulingManager& S,
// it becomes empty.
nextChoice = candsAsHeap.getNode(mcands[nextIdx]);
if (getEarliestForNodeRef(nextChoice) > curTime
|| ! instrIsFeasible(S, nextChoice->getOpCode()))
|| ! instrIsFeasible(S, nextChoice->getMachineInstr()->getOpCode()))
{
mcands.erase(mcands.begin() + nextIdx);
nextIdx = -1;
@ -255,8 +240,7 @@ SchedPriorities::findSetWithMaxDelay(vector<candIndex>& mcands,
if (SchedDebugLevel >= Sched_PrintSchedTrace)
{
printIndent(2);
cout << "Cycle " << this->getTime() << ": "
cout << " Cycle " << this->getTime() << ": "
<< "Next highest delay = " << maxDelay << " : "
<< mcands.size() << " Nodes with this delay: ";
for (unsigned i=0; i < mcands.size(); i++)

20
lib/Target/SparcV9/InstrSched/SchedPriorities.cpp

@ -18,24 +18,9 @@
* 7/30/01 - Vikram Adve - Created
***************************************************************************/
//************************** System Include Files **************************/
#include <hash_map>
#include <vector>
#include <algorithm>
#include <sys/types.h>
//*************************** User Include Files ***************************/
#include "llvm/Method.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/InstrScheduling.h"
#include "llvm/CodeGen/SchedPriorities.h"
//************************* Forward Declarations ***************************/
/*ctor*/
SchedPriorities::SchedPriorities(const Method* method,
const SchedGraph* _graph)
: curTime(0),
@ -219,7 +204,7 @@ SchedPriorities::getNextHighest(const SchedulingManager& S,
// it becomes empty.
nextChoice = candsAsHeap.getNode(mcands[nextIdx]);
if (getEarliestForNodeRef(nextChoice) > curTime
|| ! instrIsFeasible(S, nextChoice->getOpCode()))
|| ! instrIsFeasible(S, nextChoice->getMachineInstr()->getOpCode()))
{
mcands.erase(mcands.begin() + nextIdx);
nextIdx = -1;
@ -255,8 +240,7 @@ SchedPriorities::findSetWithMaxDelay(vector<candIndex>& mcands,
if (SchedDebugLevel >= Sched_PrintSchedTrace)
{
printIndent(2);
cout << "Cycle " << this->getTime() << ": "
cout << " Cycle " << this->getTime() << ": "
<< "Next highest delay = " << maxDelay << " : "
<< mcands.size() << " Nodes with this delay: ";
for (unsigned i=0; i < mcands.size(); i++)