jdk8-mips64-public/hotspot: comparison src/share/vm/opto/loopnode.cpp

-:ec59443af135
+:98cb887364d3
 // =================================================
 // ---- SUCCESS!   Found A Trip-Counted Loop!  -----
 //
 // Canonicalize the condition on the test.  If we can exactly determine
 // the trip-counter exit value, then set limit to that value and use
-// a '!=' test.  Otherwise use conditon '<' for count-up loops and
+// a '!=' test.  Otherwise use condition '<' for count-up loops and
 // '>' for count-down loops.  If the condition is inverted and we will
 // be rolling through MININT to MAXINT, then bail out.
 C->print_method("Before CountedLoop", 3);
 }
 // If compare points to incr, we are ok.  Otherwise the compare
 // can directly point to the phi; in this case adjust the compare so that
-// it points to the incr by adusting the limit.
+// it points to the incr by adjusting the limit.
 if( cmp->in(1) == phi || cmp->in(2) == phi )
 limit = gvn->transform(new (C, 3) AddINode(limit,stride));
 // trip-count for +-tive stride should be: (limit - init_trip + stride - 1)/stride.
 // Final value for iterator should be: trip_count * stride + init_trip.
 // Fix all data nodes placed at the old loop head.
 // Uses the lazy-update mechanism of 'get_ctrl'.
 lazy_replace( x, l );
 set_idom(l, init_control, dom_depth(x));
-// Check for immediately preceeding SafePoint and remove
+// Check for immediately preceding SafePoint and remove
 Node *sfpt2 = le->in(0);
 if( sfpt2->Opcode() == Op_SafePoint && is_deleteable_safept(sfpt2))
 lazy_replace( sfpt2, sfpt2->in(TypeFunc::Control));
 // Free up intermediate goo
 }
 }
 // Build Dominators for elision of NULL checks & loop finding.
 // Since nodes do not have a slot for immediate dominator, make
-// a persistant side array for that info indexed on node->_idx.
+// a persistent side array for that info indexed on node->_idx.
 _idom_size = C->unique();
 _idom      = NEW_RESOURCE_ARRAY( Node*, _idom_size );
 _dom_depth = NEW_RESOURCE_ARRAY( uint,  _idom_size );
 _dom_stk   = NULL; // Allocated on demand in recompute_dom_depth
 memset( _dom_depth, 0, _idom_size * sizeof(uint) );
 }
 }
 // Given dominators, try to find inner loops with calls that must
 // always be executed (call dominates loop tail).  These loops do
-// not need a seperate safepoint.
+// not need a separate safepoint.
 Node_List cisstack(a);
 _ltree_root->check_safepts(visited, cisstack);
 // Walk the DATA nodes and place into loops.  Find earliest control
 // node.  For CFG nodes, the _nodes array starts out and remains
 }
 }
 if (done) {
 // All of n's inputs have been processed, complete post-processing.
-// Compute earilest point this Node can go.
+// Compute earliest point this Node can go.
 // CFG, Phi, pinned nodes already know their controlling input.
 if (!has_node(n)) {
 // Record earliest legal location
 set_early_ctrl( n );
 }
 case Op_StrComp:            // Does a bunch of load-like effects
 case Op_AryEq:
 pinned = false;
 }
 if( pinned ) {
-IdealLoopTree *choosen_loop = get_loop(n->is_CFG() ? n : get_ctrl(n));
+IdealLoopTree *chosen_loop = get_loop(n->is_CFG() ? n : get_ctrl(n));
-if( !choosen_loop->_child )       // Inner loop?
+if( !chosen_loop->_child )       // Inner loop?
-choosen_loop->_body.push(n); // Collect inner loops
+chosen_loop->_body.push(n); // Collect inner loops
 return;
 }
 } else {                      // No slot zero
 if( n->is_CFG() ) {         // CFG with no slot 0 is dead
 _nodes.map(n->_idx,0);    // No block setting, it's globally dead
 // Assign discovered "here or above" point
 least = find_non_split_ctrl(least);
 set_ctrl(n, least);
 // Collect inner loop bodies
-IdealLoopTree *choosen_loop = get_loop(least);
+IdealLoopTree *chosen_loop = get_loop(least);
-if( !choosen_loop->_child )   // Inner loop?
+if( !chosen_loop->_child )   // Inner loop?
-choosen_loop->_body.push(n);// Collect inner loops
+chosen_loop->_body.push(n);// Collect inner loops
 }
 #ifndef PRODUCT
 //------------------------------dump-------------------------------------------
 void PhaseIdealLoop::dump( ) const {

Mercurial > jdk8-mips64-public > hotspot / file comparison

comparison: src/share/vm/opto/loopnode.cpp

src/share/vm/opto/loopnode.cpp