1.1 --- a/src/share/vm/opto/matcher.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/matcher.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -897,7 +897,7 @@
1.4 #ifdef ASSERT
1.5 _new2old_map.map(m->_idx, n);
1.6 #endif
1.7 - mstack.push(m, Post_Visit, n, i); // Don't neet to visit
1.8 + mstack.push(m, Post_Visit, n, i); // Don't need to visit
1.9 mstack.push(m->in(0), Visit, m, 0);
1.10 } else {
1.11 mstack.push(m, Visit, n, i);
1.12 @@ -1267,7 +1267,7 @@
1.13 }
1.14 }
1.15
1.16 - // Not forceably cloning. If shared, put it into a register.
1.17 + // Not forceable cloning. If shared, put it into a register.
1.18 return shared;
1.19 }
1.20
1.21 @@ -1542,7 +1542,7 @@
1.22 // This is what my child will give me.
1.23 int opnd_class_instance = s->_rule[op];
1.24 // Choose between operand class or not.
1.25 - // This is what I will recieve.
1.26 + // This is what I will receive.
1.27 int catch_op = (FIRST_OPERAND_CLASS <= op && op < NUM_OPERANDS) ? opnd_class_instance : op;
1.28 // New rule for child. Chase operand classes to get the actual rule.
1.29 int newrule = s->_rule[catch_op];
1.30 @@ -1966,7 +1966,7 @@
1.31 // BoolNode::match_edge always returns a zero.
1.32
1.33 // We reorder the Op_If in a pre-order manner, so we can visit without
1.34 - // accidently sharing the Cmp (the Bool and the If make 2 users).
1.35 + // accidentally sharing the Cmp (the Bool and the If make 2 users).
1.36 n->add_req( n->in(1)->in(1) ); // Add the Cmp next to the Bool
1.37 }
1.38 else if (nstate == Post_Visit) {
