[llvm-commits] [llvm] r57018 - in /llvm/trunk/lib/CodeGen: PBQP.cpp PBQP.h RegAllocPBQP.cpp
Evan Cheng
evan.cheng at apple.com
Fri Oct 3 10:11:59 PDT 2008
Author: evancheng
Date: Fri Oct 3 12:11:58 2008
New Revision: 57018
URL: http://llvm.org/viewvc/llvm-project?rev=57018&view=rev
Log:
Fix typos pointed out by Duncan. Also untabify these files.
Modified:
llvm/trunk/lib/CodeGen/PBQP.cpp
llvm/trunk/lib/CodeGen/PBQP.h
llvm/trunk/lib/CodeGen/RegAllocPBQP.cpp
Modified: llvm/trunk/lib/CodeGen/PBQP.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/PBQP.cpp?rev=57018&r1=57017&r2=57018&view=diff
==============================================================================
--- llvm/trunk/lib/CodeGen/PBQP.cpp (original)
+++ llvm/trunk/lib/CodeGen/PBQP.cpp Fri Oct 3 12:11:58 2008
@@ -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 @@
/* 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 @@
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 @@
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 @@
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());
}
}
}
Modified: llvm/trunk/lib/CodeGen/PBQP.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/PBQP.h?rev=57018&r1=57017&r2=57018&view=diff
==============================================================================
--- llvm/trunk/lib/CodeGen/PBQP.h (original)
+++ llvm/trunk/lib/CodeGen/PBQP.h Fri Oct 3 12:11:58 2008
@@ -8,7 +8,7 @@
//===----------------------------------------------------------------------===//
//
// Developed by: Bernhard Scholz
-// The Univesity of Sydney
+// The University of Sydney
// http://www.it.usyd.edu.au/~scholz
//===----------------------------------------------------------------------===//
Modified: llvm/trunk/lib/CodeGen/RegAllocPBQP.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/RegAllocPBQP.cpp?rev=57018&r1=57017&r2=57018&view=diff
==============================================================================
--- llvm/trunk/lib/CodeGen/RegAllocPBQP.cpp (original)
+++ llvm/trunk/lib/CodeGen/RegAllocPBQP.cpp Fri Oct 3 12:11:58 2008
@@ -120,7 +120,7 @@
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 @@
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 @@
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);
}
}
More information about the llvm-commits
mailing list