hotspot/src/share/vm/opto/superword.cpp
changeset 2131 98f9cef66a34
parent 2022 28ce8115a91d
child 2154 72a9b7284ccf
--- a/hotspot/src/share/vm/opto/superword.cpp	Fri Feb 27 08:34:19 2009 -0800
+++ b/hotspot/src/share/vm/opto/superword.cpp	Fri Feb 27 13:27:09 2009 -0800
@@ -470,7 +470,7 @@
 }
 
 //------------------------------stmts_can_pack---------------------------
-// Can s1 and s2 be in a pack with s1 immediately preceeding s2 and
+// Can s1 and s2 be in a pack with s1 immediately preceding s2 and
 // s1 aligned at "align"
 bool SuperWord::stmts_can_pack(Node* s1, Node* s2, int align) {
   if (isomorphic(s1, s2)) {
@@ -869,7 +869,7 @@
   for (uint i = start; i < end; i++) {
     if (!is_vector_use(p0, i)) {
       // For now, return false if not scalar promotion case (inputs are the same.)
-      // Later, implement PackNode and allow differring, non-vector inputs
+      // Later, implement PackNode and allow differing, non-vector inputs
       // (maybe just the ones from outside the block.)
       Node* p0_def = p0->in(i);
       for (uint j = 1; j < p->size(); j++) {