Add TargetInstrInfo::isSafeToMoveRegisterClassDefs. It returns true if it's safe...

[oota-llvm.git] / lib / CodeGen / PBQP.cpp

diff --git a/lib/CodeGen/PBQP.cpp b/lib/CodeGen/PBQP.cpp
index ade9e7ce5323a62a85cc2b9f9d2509df6c70e0d6..562300f94e1f9a2bea512f1c82908122de238746 100644 (file)
--- a/lib/CodeGen/PBQP.cpp
+++ b/lib/CodeGen/PBQP.cpp
@@ -8,15 +8,15 @@
 //===----------------------------------------------------------------------===//
 //
 // Developed by:                   Bernhard Scholz
-//                             The Univesity of Sydney
+//                             The University of Sydney
 //                         http://www.it.usyd.edu.au/~scholz
 //===----------------------------------------------------------------------===//
 
-
+#include "PBQP.h"
+#include "llvm/Config/alloca.h"
 #include <limits>
 #include <cassert>
-
-#include "PBQP.h"
+#include <cstring>
 
 namespace llvm {
 
@@ -55,13 +55,13 @@ struct pbqp {
 
                              /* node fields */
   PBQPVector **node_costs;   /* cost vectors of nodes */
-  int *node_deg;            /* node degree of nodes */
-  int *solution;            /* solution for node */
+  int *node_deg;             /* node degree of nodes */
+  int *solution;             /* solution for node */
   adjnode **adj_list;        /* adj. list */
   bucketnode **bucket_ptr;   /* bucket pointer of a node */
 
                              /* node stack */
-  int *stack;               /* stack of nodes */
+  int *stack;                /* stack of nodes */
   int stack_ptr;             /* stack pointer */
 
                              /* bucket fields */
@@ -160,8 +160,8 @@ void free_pbqp(pbqp *this_)
     for(adj_ptr = this_->adj_list[u]; adj_ptr != NULL; adj_ptr = adj_next) {
       adj_next = adj_ptr -> succ;
       if (u < adj_ptr->adj) {
-       assert(adj_ptr != NULL);
-       delete adj_ptr->costs;
+        assert(adj_ptr != NULL);
+        delete adj_ptr->costs;
       }
       if (adj_ptr -> tc_safe_regs != NULL) {
            free(adj_ptr -> tc_safe_regs);
@@ -813,7 +813,7 @@ void eliminate_independent_edges(pbqp *this_)
       v = adj_ptr -> adj;
       assert(v >= 0 && v < this_->num_nodes);
       if (u < v) {
-       simplify_edge(this_,u,v);
+        simplify_edge(this_,u,v);
       } 
     }
   }
@@ -1327,9 +1327,9 @@ void check_pbqp(pbqp *this_)
       v = adj_ptr -> adj;
       assert( v>= 0 && v < this_->num_nodes);
       if (u < v ) {
-       costs = adj_ptr -> costs;
-       assert( costs->getRows() == this_->node_costs[u]->getLength() &&
-               costs->getCols() == this_->node_costs[v]->getLength());
+        costs = adj_ptr -> costs;
+        assert( costs->getRows() == this_->node_costs[u]->getLength() &&
+                costs->getCols() == this_->node_costs[v]->getLength());
       }           
     }
   }