src/share/vm/opto/loopnode.hpp

changeset 1040
98cb887364d3
parent 836
ee8f06bfb27c
child 1356
046932b72aa2
     1.1 --- a/src/share/vm/opto/loopnode.hpp	Fri Feb 27 08:34:19 2009 -0800
     1.2 +++ b/src/share/vm/opto/loopnode.hpp	Fri Feb 27 13:27:09 2009 -0800
     1.3 @@ -390,7 +390,7 @@
     1.4  
     1.5    // Return TRUE or FALSE if the loop should be cache-line aligned.
     1.6    // Gather the expression that does the alignment.  Note that only
     1.7 -  // one array base can be aligned in a loop (unless the VM guarentees
     1.8 +  // one array base can be aligned in a loop (unless the VM guarantees
     1.9    // mutual alignment).  Note that if we vectorize short memory ops
    1.10    // into longer memory ops, we may want to increase alignment.
    1.11    bool policy_align( PhaseIdealLoop *phase ) const;
    1.12 @@ -403,7 +403,7 @@
    1.13    // Reassociate invariant add and subtract expressions.
    1.14    Node* reassociate_add_sub(Node* n1, PhaseIdealLoop *phase);
    1.15    // Return nonzero index of invariant operand if invariant and variant
    1.16 -  // are combined with an Add or Sub. Helper for reassoicate_invariants.
    1.17 +  // are combined with an Add or Sub. Helper for reassociate_invariants.
    1.18    int is_invariant_addition(Node* n, PhaseIdealLoop *phase);
    1.19  
    1.20    // Return true if n is invariant

mercurial