1.1 --- a/src/share/vm/opto/gcm.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/gcm.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -606,7 +606,7 @@
1.4 if (pred_block != early) {
1.5 // If any predecessor of the Phi matches the load's "early block",
1.6 // we do not need a precedence edge between the Phi and 'load'
1.7 - // since the load will be forced into a block preceeding the Phi.
1.8 + // since the load will be forced into a block preceding the Phi.
1.9 pred_block->set_raise_LCA_mark(load_index);
1.10 assert(!LCA_orig->dominates(pred_block) ||
1.11 early->dominates(pred_block), "early is high enough");
1.12 @@ -1399,7 +1399,7 @@
1.13 #ifdef ASSERT
1.14 for (uint i = 0; i < _num_blocks; i++ ) {
1.15 Block *b = _blocks[i];
1.16 - assert(b->_freq >= MIN_BLOCK_FREQUENCY, "Register Allocator requiers meaningful block frequency");
1.17 + assert(b->_freq >= MIN_BLOCK_FREQUENCY, "Register Allocator requires meaningful block frequency");
1.18 }
1.19 #endif
1.20
1.21 @@ -1652,7 +1652,7 @@
1.22 // successor blocks.
1.23 assert(_num_succs == 2, "expecting 2 successors of a null check");
1.24 // If either successor has only one predecessor, then the
1.25 - // probabiltity estimate can be derived using the
1.26 + // probability estimate can be derived using the
1.27 // relative frequency of the successor and this block.
1.28 if (_succs[i]->num_preds() == 2) {
1.29 return _succs[i]->_freq / _freq;
1.30 @@ -1854,7 +1854,7 @@
1.31 }
1.32
1.33 //------------------------------update_succ_freq-------------------------------
1.34 -// Update the appropriate frequency associated with block 'b', a succesor of
1.35 +// Update the appropriate frequency associated with block 'b', a successor of
1.36 // a block in this loop.
1.37 void CFGLoop::update_succ_freq(Block* b, float freq) {
1.38 if (b->_loop == this) {
