6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-14 11:32:34 +00:00
Code Issues Projects Releases Wiki Activity

Bug fix: nextToTry was not being initialized in one case.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1974 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Vikram S. Adve 2002-03-24 03:46:15 +00:00
parent 7c7e46ae5f
commit 1392d6903c
2 changed files with 10 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/CodeGen/InstrSched/SchedPriorities.cpp
View File

@ -89,6 +89,8 @@ SchedPriorities::initializeReadyHeap(const SchedGraph* graph)
candsAsHeap.makeHeap();
nextToTry = candsAsHeap.begin();
#ifdef TEST_HEAP_CONVERSION
cerr << "After heap conversion:\n";
copy(candsAsHeap.begin(), candsAsHeap.end(),
@ -107,9 +109,9 @@ SchedPriorities::insertReady(const SchedGraphNode* node)
if (SchedDebugLevel >= Sched_PrintSchedTrace)
{
cerr << " Cycle " << (long)getTime() << ": "
<< " Node " << node->getNodeId() << " is ready; "
<< " Delay = " << (long)getNodeDelayRef(node) << "; Instruction: \n";
cerr << " Node " << node->getNodeId() << " will be ready in Cycle "
<< earliestForNode[node->getNodeId()] << "; "
<< " Delay = " <<(long)getNodeDelayRef(node) << "; Instruction: \n";
cerr << " " << *node->getMachineInstr() << "\n";
}
}

8
lib/Target/SparcV9/InstrSched/SchedPriorities.cpp
View File

@ -89,6 +89,8 @@ SchedPriorities::initializeReadyHeap(const SchedGraph* graph)
candsAsHeap.makeHeap();
nextToTry = candsAsHeap.begin();
#ifdef TEST_HEAP_CONVERSION
cerr << "After heap conversion:\n";
copy(candsAsHeap.begin(), candsAsHeap.end(),
@ -107,9 +109,9 @@ SchedPriorities::insertReady(const SchedGraphNode* node)
if (SchedDebugLevel >= Sched_PrintSchedTrace)
{
cerr << " Cycle " << (long)getTime() << ": "
<< " Node " << node->getNodeId() << " is ready; "
<< " Delay = " << (long)getNodeDelayRef(node) << "; Instruction: \n";
cerr << " Node " << node->getNodeId() << " will be ready in Cycle "
<< earliestForNode[node->getNodeId()] << "; "
<< " Delay = " <<(long)getNodeDelayRef(node) << "; Instruction: \n";
cerr << " " << *node->getMachineInstr() << "\n";
}
}