1.1 --- a/src/share/vm/opto/loopnode.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/loopnode.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -274,7 +274,7 @@
1.4 //
1.5 // Canonicalize the condition on the test. If we can exactly determine
1.6 // the trip-counter exit value, then set limit to that value and use
1.7 - // a '!=' test. Otherwise use conditon '<' for count-up loops and
1.8 + // a '!=' test. Otherwise use condition '<' for count-up loops and
1.9 // '>' for count-down loops. If the condition is inverted and we will
1.10 // be rolling through MININT to MAXINT, then bail out.
1.11
1.12 @@ -290,7 +290,7 @@
1.13
1.14 // If compare points to incr, we are ok. Otherwise the compare
1.15 // can directly point to the phi; in this case adjust the compare so that
1.16 - // it points to the incr by adusting the limit.
1.17 + // it points to the incr by adjusting the limit.
1.18 if( cmp->in(1) == phi || cmp->in(2) == phi )
1.19 limit = gvn->transform(new (C, 3) AddINode(limit,stride));
1.20
1.21 @@ -471,7 +471,7 @@
1.22 lazy_replace( x, l );
1.23 set_idom(l, init_control, dom_depth(x));
1.24
1.25 - // Check for immediately preceeding SafePoint and remove
1.26 + // Check for immediately preceding SafePoint and remove
1.27 Node *sfpt2 = le->in(0);
1.28 if( sfpt2->Opcode() == Op_SafePoint && is_deleteable_safept(sfpt2))
1.29 lazy_replace( sfpt2, sfpt2->in(TypeFunc::Control));
1.30 @@ -1506,7 +1506,7 @@
1.31
1.32 // Build Dominators for elision of NULL checks & loop finding.
1.33 // Since nodes do not have a slot for immediate dominator, make
1.34 - // a persistant side array for that info indexed on node->_idx.
1.35 + // a persistent side array for that info indexed on node->_idx.
1.36 _idom_size = C->unique();
1.37 _idom = NEW_RESOURCE_ARRAY( Node*, _idom_size );
1.38 _dom_depth = NEW_RESOURCE_ARRAY( uint, _idom_size );
1.39 @@ -1529,7 +1529,7 @@
1.40
1.41 // Given dominators, try to find inner loops with calls that must
1.42 // always be executed (call dominates loop tail). These loops do
1.43 - // not need a seperate safepoint.
1.44 + // not need a separate safepoint.
1.45 Node_List cisstack(a);
1.46 _ltree_root->check_safepts(visited, cisstack);
1.47
1.48 @@ -2332,7 +2332,7 @@
1.49 if (done) {
1.50 // All of n's inputs have been processed, complete post-processing.
1.51
1.52 - // Compute earilest point this Node can go.
1.53 + // Compute earliest point this Node can go.
1.54 // CFG, Phi, pinned nodes already know their controlling input.
1.55 if (!has_node(n)) {
1.56 // Record earliest legal location
1.57 @@ -2672,9 +2672,9 @@
1.58 pinned = false;
1.59 }
1.60 if( pinned ) {
1.61 - IdealLoopTree *choosen_loop = get_loop(n->is_CFG() ? n : get_ctrl(n));
1.62 - if( !choosen_loop->_child ) // Inner loop?
1.63 - choosen_loop->_body.push(n); // Collect inner loops
1.64 + IdealLoopTree *chosen_loop = get_loop(n->is_CFG() ? n : get_ctrl(n));
1.65 + if( !chosen_loop->_child ) // Inner loop?
1.66 + chosen_loop->_body.push(n); // Collect inner loops
1.67 return;
1.68 }
1.69 } else { // No slot zero
1.70 @@ -2746,9 +2746,9 @@
1.71 set_ctrl(n, least);
1.72
1.73 // Collect inner loop bodies
1.74 - IdealLoopTree *choosen_loop = get_loop(least);
1.75 - if( !choosen_loop->_child ) // Inner loop?
1.76 - choosen_loop->_body.push(n);// Collect inner loops
1.77 + IdealLoopTree *chosen_loop = get_loop(least);
1.78 + if( !chosen_loop->_child ) // Inner loop?
1.79 + chosen_loop->_body.push(n);// Collect inner loops
1.80 }
1.81
1.82 #ifndef PRODUCT
