1.1 --- a/src/share/vm/opto/postaloc.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/postaloc.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -46,7 +46,7 @@
1.4 // be splitting live ranges for callee save registers to such
1.5 // an extent that in large methods the chains can be very long
1.6 // (50+). The conservative answer is to return true if we don't
1.7 - // know as this prevents optimizations from occuring.
1.8 + // know as this prevents optimizations from occurring.
1.9
1.10 const int limit = 60;
1.11 int i;
1.12 @@ -286,7 +286,7 @@
1.13 //
1.14 // n will be replaced with the old value but n might have
1.15 // kills projections associated with it so remove them now so that
1.16 - // yank_if_dead will be able to elminate the copy once the uses
1.17 + // yank_if_dead will be able to eliminate the copy once the uses
1.18 // have been transferred to the old[value].
1.19 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
1.20 Node* use = n->fast_out(i);
