? diffs.txt
? lib/System/platform
Index: include/llvm/Type.h
===================================================================
RCS file: /var/cvs/llvm/llvm/include/llvm/Type.h,v
retrieving revision 1.58
diff -u -r1.58 Type.h
--- include/llvm/Type.h	1 Sep 2004 22:55:34 -0000	1.58
+++ include/llvm/Type.h	26 Sep 2004 17:32:00 -0000
@@ -50,7 +50,8 @@
 class StructType;
 class PackedType;
 
-struct Type {
+class Type {
+  public:
   ///===-------------------------------------------------------------------===//
   /// Definitions of all of the base types for the Type system.  Based on this
   /// value, you can cast to a "DerivedType" subclass (see DerivedTypes.h)
Index: include/llvm/CodeGen/IntrinsicLowering.h
===================================================================
RCS file: /var/cvs/llvm/llvm/include/llvm/CodeGen/IntrinsicLowering.h,v
retrieving revision 1.6
diff -u -r1.6 IntrinsicLowering.h
--- include/llvm/CodeGen/IntrinsicLowering.h	20 Jun 2004 07:40:46 -0000	1.6
+++ include/llvm/CodeGen/IntrinsicLowering.h	26 Sep 2004 17:32:00 -0000
@@ -39,7 +39,8 @@
   class CallInst;
   class Module;
   
-  struct IntrinsicLowering {
+  class IntrinsicLowering {
+    public:
     virtual ~IntrinsicLowering() {}
 
     /// AddPrototypes - This method, if called, causes all of the prototypes
Index: include/llvm/Target/TargetJITInfo.h
===================================================================
RCS file: /var/cvs/llvm/llvm/include/llvm/Target/TargetJITInfo.h,v
retrieving revision 1.1
diff -u -r1.1 TargetJITInfo.h
--- include/llvm/Target/TargetJITInfo.h	20 Dec 2003 01:21:37 -0000	1.1
+++ include/llvm/Target/TargetJITInfo.h	26 Sep 2004 17:32:00 -0000
@@ -24,7 +24,8 @@
 
   /// TargetJITInfo - Target specific information required by the Just-In-Time
   /// code generator.
-  struct TargetJITInfo {
+  class TargetJITInfo {
+    public:
     virtual ~TargetJITInfo() {}
     
     /// addPassesToJITCompile - Add passes to the specified pass manager to
Index: lib/CodeGen/LiveInterval.cpp
===================================================================
RCS file: /var/cvs/llvm/llvm/lib/CodeGen/LiveInterval.cpp,v
retrieving revision 1.12
diff -u -r1.12 LiveInterval.cpp
--- lib/CodeGen/LiveInterval.cpp	1 Sep 2004 22:55:35 -0000	1.12
+++ lib/CodeGen/LiveInterval.cpp	26 Sep 2004 17:32:00 -0000
@@ -20,6 +20,7 @@
 
 #include "LiveInterval.h"
 #include "llvm/ADT/STLExtras.h"
+#include <algorithm>
 #include <iostream>
 #include <map>
 using namespace llvm;
Index: lib/Support/IsInf.cpp
===================================================================
RCS file: /var/cvs/llvm/llvm/lib/Support/IsInf.cpp,v
retrieving revision 1.3
diff -u -r1.3 IsInf.cpp
--- lib/Support/IsInf.cpp	1 Sep 2004 22:55:35 -0000	1.3
+++ lib/Support/IsInf.cpp	26 Sep 2004 17:32:01 -0000
@@ -24,6 +24,9 @@
 // apparently this has been a problem with Solaris for years.
 # include <ieeefp.h>
 static int isinf(double x) { return !finite(x) && x==x; }
+#elif HAVE__FINITE_IN_FLOAT_H
+# include <float.h>
+static int isinf(double x) { return !_finite(x); }
 #else
 # error "Don't know how to get isinf()"
 #endif
Index: lib/Support/IsNAN.cpp
===================================================================
RCS file: /var/cvs/llvm/llvm/lib/Support/IsNAN.cpp,v
retrieving revision 1.2
diff -u -r1.2 IsNAN.cpp
--- lib/Support/IsNAN.cpp	1 Sep 2004 22:55:35 -0000	1.2
+++ lib/Support/IsNAN.cpp	26 Sep 2004 17:32:01 -0000
@@ -19,6 +19,9 @@
 #elif HAVE_STD_ISNAN_IN_CMATH
 # include <cmath>
 using std::isnan;
+#elif HAVE__ISNAN_IN_FLOAT_H
+# include <float.h>
+static int isnan(double x) { return _isnan(x); }
 #else
 # error "Don't know how to get isnan()"
 #endif
Index: lib/Target/TargetSchedInfo.cpp
===================================================================
RCS file: /var/cvs/llvm/llvm/lib/Target/TargetSchedInfo.cpp,v
retrieving revision 1.18
diff -u -r1.18 TargetSchedInfo.cpp
--- lib/Target/TargetSchedInfo.cpp	2 Jun 2004 05:56:04 -0000	1.18
+++ lib/Target/TargetSchedInfo.cpp	26 Sep 2004 17:32:01 -0000
@@ -14,6 +14,7 @@
 
 #include "llvm/Target/TargetSchedInfo.h"
 #include "llvm/Target/TargetMachine.h"
+#include <algorithm>
 #include <iostream>
 using namespace llvm;
 
@@ -175,7 +176,7 @@
   // resources usages for each class, because most instruction pairs will
   // usually behave the same as their class.
   // 
-  int classPairGaps[numSchedClasses][numSchedClasses];
+  std::vector< std::vector<int> > classPairGaps(numSchedClasses, std::vector<int>(numSchedClasses,0));
   for (InstrSchedClass fromSC=0; fromSC < numSchedClasses; fromSC++)
     for (InstrSchedClass toSC=0; toSC < numSchedClasses; toSC++) {
       int classPairGap = ComputeMinGap(instrRUForClasses[fromSC],
@@ -228,7 +229,7 @@
   // Sort each resource usage vector by resourceId_t to speed up conflict
   // checking
   for (unsigned i=0; i < this->resourcesByCycle.size(); i++)
-    sort(resourcesByCycle[i].begin(), resourcesByCycle[i].end());
+    std::sort(resourcesByCycle[i].begin(), resourcesByCycle[i].end());
 }
 
 // Add the extra resource usage requirements specified in the delta.
Index: lib/Target/CBackend/Writer.cpp
===================================================================
RCS file: /var/cvs/llvm/llvm/lib/Target/CBackend/Writer.cpp,v
retrieving revision 1.197
diff -u -r1.197 Writer.cpp
--- lib/Target/CBackend/Writer.cpp	20 Sep 2004 04:46:35 -0000	1.197
+++ lib/Target/CBackend/Writer.cpp	26 Sep 2004 17:32:01 -0000
@@ -1224,8 +1224,8 @@
                                           unsigned Indent) {
   for (succ_iterator SI = succ_begin(CurBlock), E = succ_end(CurBlock);
        SI != E; ++SI)
-    for (BasicBlock::iterator I = SI->begin();
-         PHINode *PN = dyn_cast<PHINode>(I); ++I) {
+    for (BasicBlock::iterator I = SI->begin(); isa<PHINode>(I); ++I) {
+      PHINode *PN = cast<PHINode>(I);
       //  now we have to do the printing
       Out << std::string(Indent, ' ');
       Out << "  " << Mang->getValueName(I) << "__PHI_TEMPORARY = ";
Index: lib/Transforms/Scalar/LoopSimplify.cpp
===================================================================
RCS file: /var/cvs/llvm/llvm/lib/Transforms/Scalar/LoopSimplify.cpp,v
retrieving revision 1.50
diff -u -r1.50 LoopSimplify.cpp
--- lib/Transforms/Scalar/LoopSimplify.cpp	20 Sep 2004 04:43:14 -0000	1.50
+++ lib/Transforms/Scalar/LoopSimplify.cpp	26 Sep 2004 17:32:02 -0000
@@ -213,8 +213,8 @@
   if (!Preds.empty()) {  // Is the loop not obviously dead?
     // Check to see if the values being merged into the new block need PHI
     // nodes.  If so, insert them.
-    for (BasicBlock::iterator I = BB->begin();
-         PHINode *PN = dyn_cast<PHINode>(I); ) {
+    for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ) {
+      PHINode *PN = cast<PHINode>(I);
       ++I;
 
       // Check to see if all of the values coming in are the same.  If so, we
@@ -266,10 +266,11 @@
     }
     
   } else {                       // Otherwise the loop is dead...
-    for (BasicBlock::iterator I = BB->begin();
-         PHINode *PN = dyn_cast<PHINode>(I); ++I)
+    for (BasicBlock::iterator I = BB->begin(); isa<PHINode>(I); ++I) {
+      PHINode *PN = cast<PHINode>(I);
       // Insert dummy values as the incoming value...
       PN->addIncoming(Constant::getNullValue(PN->getType()), NewBB);
+    }
   }  
   return NewBB;
 }
@@ -427,7 +428,8 @@
 /// PHI node that tells us how to partition the loops.
 static PHINode *FindPHIToPartitionLoops(Loop *L) {
   for (BasicBlock::iterator I = L->getHeader()->begin();
-       PHINode *PN = dyn_cast<PHINode>(I); ) {
+       isa<PHINode>(I); ) {
+    PHINode *PN = cast<PHINode>(I);
     ++I;
     if (Value *V = hasConstantValue(PN)) {
       // This is a degenerate PHI already, don't modify it!
@@ -565,8 +567,8 @@
   
   // Now that the block has been inserted into the function, create PHI nodes in
   // the backedge block which correspond to any PHI nodes in the header block.
-  for (BasicBlock::iterator I = Header->begin();
-       PHINode *PN = dyn_cast<PHINode>(I); ++I) {
+  for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
+    PHINode *PN = cast<PHINode>(I);
     PHINode *NewPN = new PHINode(PN->getType(), PN->getName()+".be",
                                  BETerminator);
     NewPN->op_reserve(2*BackedgeBlocks.size());