Fix typos pointed out by Duncan. Also untabify these files.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@57018 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/CodeGen/PBQP.cpp b/lib/CodeGen/PBQP.cpp
index 00ca2a82f4b424dce6abcbff0186942ace5d9230..6b2110583fe33aac0c355cb2eaff86392f4484ba 100644 (file)
--- a/lib/CodeGen/PBQP.cpp
+++ b/lib/CodeGen/PBQP.cpp
@@ -8,7 +8,7 @@
 //===----------------------------------------------------------------------===//
 //
 // Developed by:                   Bernhard Scholz
-//                             The Univesity of Sydney
+//                             The University of Sydney
 //                         http://www.it.usyd.edu.au/~scholz
 //===----------------------------------------------------------------------===//
 
@@ -56,13 +56,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 */
@@ -161,8 +161,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);
@@ -814,7 +814,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);
       } 
     }
   }
@@ -1328,9 +1328,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());
       }           
     }
   }

diff --git a/lib/CodeGen/PBQP.h b/lib/CodeGen/PBQP.h
index e31ccc449ca57d0ddb7e68851e1b67c24815b797..5fd2c06c335e544e76b36e3c8304e8602a3a5f5f 100644 (file)
--- a/lib/CodeGen/PBQP.h
+++ b/lib/CodeGen/PBQP.h
@@ -8,7 +8,7 @@
 //===----------------------------------------------------------------------===//
 //
 // Developed by:                   Bernhard Scholz
-//                             The Univesity of Sydney
+//                             The University of Sydney
 //                         http://www.it.usyd.edu.au/~scholz
 //===----------------------------------------------------------------------===//
 

diff --git a/lib/CodeGen/RegAllocPBQP.cpp b/lib/CodeGen/RegAllocPBQP.cpp
index 7783766c61ea49c64ce830d0e7cc33ebc5596e76..107d277f4de703fa0460f65106b1af3d9fbefd3d 100644 (file)
--- a/lib/CodeGen/RegAllocPBQP.cpp
+++ b/lib/CodeGen/RegAllocPBQP.cpp
@@ -120,7 +120,7 @@ namespace {
     PBQPVector* buildCostVector(const Container &allowed,
                                 PBQPNum spillCost) const;
 
-    //! \brief Builds a PBQP interfernce matrix.
+    //! \brief Builds a PBQP interference matrix.
     //!
     //! @return Either a pointer to a non-zero PBQP matrix representing the
     //!         allocation option costs, or a null pointer for a zero matrix.
@@ -142,7 +142,7 @@ namespace {
                                       const Container &allowed2,
                                       PBQPNum cBenefit) const;
 
-    //! \brief Helper functior for constructInitialPBQPProblem().
+    //! \brief Helper function for constructInitialPBQPProblem().
     //!
     //! This function iterates over the Function we are about to allocate for
     //! and computes spill costs.
@@ -281,8 +281,8 @@ void PBQPRegAlloc::calcSpillCosts() {
         assert ((mo.isUse() || mo.isDef()) &&
                 "Not a use, not a def, what is it?");
 
-       //... Just the virtual registers. We treat loads and stores as equal.
-       li->getInterval(moReg).weight += powf(10.0f, loopDepth);
+        //... Just the virtual registers. We treat loads and stores as equal.
+        li->getInterval(moReg).weight += powf(10.0f, loopDepth);
       }
 
     }