[llvm-commits] CVS: llvm/lib/Target/TargetSchedInfo.cpp

[Chris Lattner]

Changes in directory llvm/lib/Target:

TargetSchedInfo.cpp updated: 1.21 -> 1.22
---
Log message:

Improve compatiblity with HPUX on Itanium, patch by Duraid Madina


---
Diffs of the changes:  (+5 -5)

Index: llvm/lib/Target/TargetSchedInfo.cpp
diff -u llvm/lib/Target/TargetSchedInfo.cpp:1.21 llvm/lib/Target/TargetSchedInfo.cpp:1.22
--- llvm/lib/Target/TargetSchedInfo.cpp:1.21	Mon Oct 25 14:04:01 2004
+++ llvm/lib/Target/TargetSchedInfo.cpp	Sat Jan 15 19:26:32 2005
@@ -61,22 +61,22 @@
 }
 
 
-static cycles_t
+static CycleCount_t
 ComputeMinGap(const InstrRUsage &fromRU, 
 	      const InstrRUsage &toRU)
 {
-  cycles_t minGap = 0;
+  CycleCount_t minGap = 0;
   
   if (fromRU.numBubbles > 0)
     minGap = fromRU.numBubbles;
   
   if (minGap < fromRU.numCycles) {
     // only need to check from cycle `minGap' onwards
-    for (cycles_t gap=minGap; gap <= fromRU.numCycles-1; gap++) {
+    for (CycleCount_t gap=minGap; gap <= fromRU.numCycles-1; gap++) {
       // check if instr. #2 can start executing `gap' cycles after #1
       // by checking for resource conflicts in each overlapping cycle
-      cycles_t numOverlap =std::min(fromRU.numCycles - gap, toRU.numCycles);
-      for (cycles_t c = 0; c <= numOverlap-1; c++)
+      CycleCount_t numOverlap =std::min(fromRU.numCycles - gap, toRU.numCycles);
+      for (CycleCount_t c = 0; c <= numOverlap-1; c++)
         if (RUConflict(fromRU.resourcesByCycle[gap + c],
                        toRU.resourcesByCycle[c])) {
           // conflict found so minGap must be more than `gap'