1.1 --- a/src/share/vm/opto/loopTransform.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/loopTransform.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -119,7 +119,7 @@
1.4
1.5 //---------------------is_invariant_addition-----------------------------
1.6 // Return nonzero index of invariant operand for an Add or Sub
1.7 -// of (nonconstant) invariant and variant values. Helper for reassoicate_invariants.
1.8 +// of (nonconstant) invariant and variant values. Helper for reassociate_invariants.
1.9 int IdealLoopTree::is_invariant_addition(Node* n, PhaseIdealLoop *phase) {
1.10 int op = n->Opcode();
1.11 if (op == Op_AddI || op == Op_SubI) {
1.12 @@ -520,7 +520,7 @@
1.13 //------------------------------policy_align-----------------------------------
1.14 // Return TRUE or FALSE if the loop should be cache-line aligned. Gather the
1.15 // expression that does the alignment. Note that only one array base can be
1.16 -// aligned in a loop (unless the VM guarentees mutual alignment). Note that
1.17 +// aligned in a loop (unless the VM guarantees mutual alignment). Note that
1.18 // if we vectorize short memory ops into longer memory ops, we may want to
1.19 // increase alignment.
1.20 bool IdealLoopTree::policy_align( PhaseIdealLoop *phase ) const {
