From: Chris Lattner <sabre@nondot.org>
Date: Mon, 15 Oct 2007 16:46:29 +0000 (+0000)
Subject: updates from duncan
X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=1296e9d306e32ee475e5f01826032e736698b5da;p=oota-llvm.git

updates from duncan


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

diff --git a/lib/CodeGen/SelectionDAG/LegalizeDAGTypes.cpp b/lib/CodeGen/SelectionDAG/LegalizeDAGTypes.cpp
index d6ee72c9582..31107d11bc6 100644
--- a/lib/CodeGen/SelectionDAG/LegalizeDAGTypes.cpp
+++ b/lib/CodeGen/SelectionDAG/LegalizeDAGTypes.cpp
@@ -55,9 +55,9 @@ class VISIBILITY_HIDDEN DAGTypeLegalizer {
   };
   
   enum LegalizeAction {
-    Legal,      // The target natively supports this operation.
-    Promote,    // This operation should be executed in a larger type.
-    Expand      // Try to expand this to other ops, otherwise use a libcall.
+    Legal,      // The target natively supports this type.
+    Promote,    // This type should be executed in a larger type.
+    Expand      // This type should be split into two types of half the size.
   };
   
   /// ValueTypeActions - This is a bitvector that contains two bits for each
@@ -244,7 +244,7 @@ void DAGTypeLegalizer::run() {
       }
     }
 
-    // If the node needs revisitation, don't add all users to the worklist etc.
+    // If the node needs revisiting, don't add all users to the worklist etc.
     if (NeedsRevisit)
       continue;
     
@@ -328,7 +328,7 @@ void DAGTypeLegalizer::MarkNewNodes(SDNode *N) {
   // Okay, we know that this node is new.  Recursively walk all of its operands
   // to see if they are new also.  The depth of this walk is bounded by the size
   // of the new tree that was constructed (usually 2-3 nodes), so we don't worry
-  // about revisitation of nodes.
+  // about revisitating of nodes.
   //
   // As we walk the operands, keep track of the number of nodes that are
   // processed.  If non-zero, this will become the new nodeid of this node.