1.1 --- a/src/share/vm/opto/cfgnode.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/cfgnode.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -1350,7 +1350,7 @@
1.4 }
1.5
1.6 // Register the new node but do not transform it. Cannot transform until the
1.7 - // entire Region/Phi conglerate has been hacked as a single huge transform.
1.8 + // entire Region/Phi conglomerate has been hacked as a single huge transform.
1.9 igvn->register_new_node_with_optimizer( newn );
1.10 // Now I can point to the new node.
1.11 n->add_req(newn);
1.12 @@ -1381,7 +1381,7 @@
1.13 Node *val = phi->in(i); // Constant to split for
1.14 uint hit = 0; // Number of times it occurs
1.15
1.16 - for( ; i < phi->req(); i++ ){ // Count occurances of constant
1.17 + for( ; i < phi->req(); i++ ){ // Count occurrences of constant
1.18 Node *n = phi->in(i);
1.19 if( !n ) return NULL;
1.20 if( phase->type(n) == Type::TOP ) return NULL;
1.21 @@ -1423,7 +1423,7 @@
1.22
1.23 //=============================================================================
1.24 //------------------------------simple_data_loop_check-------------------------
1.25 -// Try to determing if the phi node in a simple safe/unsafe data loop.
1.26 +// Try to determining if the phi node in a simple safe/unsafe data loop.
1.27 // Returns:
1.28 // enum LoopSafety { Safe = 0, Unsafe, UnsafeLoop };
1.29 // Safe - safe case when the phi and it's inputs reference only safe data
1.30 @@ -1687,7 +1687,7 @@
1.31 progress = phase->C->top();
1.32 break;
1.33 }
1.34 - // If tranformed to a MergeMem, get the desired slice
1.35 + // If transformed to a MergeMem, get the desired slice
1.36 // Otherwise the returned node represents memory for every slice
1.37 Node *new_mem = (m->is_MergeMem()) ?
1.38 m->as_MergeMem()->memory_at(alias_idx) : m;
1.39 @@ -1962,7 +1962,7 @@
1.40 f[CatchProjNode::fall_through_index] = Type::TOP;
1.41 } else if( call->req() > TypeFunc::Parms ) {
1.42 const Type *arg0 = phase->type( call->in(TypeFunc::Parms) );
1.43 - // Check for null reciever to virtual or interface calls
1.44 + // Check for null receiver to virtual or interface calls
1.45 if( call->is_CallDynamicJava() &&
1.46 arg0->higher_equal(TypePtr::NULL_PTR) ) {
1.47 f[CatchProjNode::fall_through_index] = Type::TOP;
1.48 @@ -1995,7 +1995,7 @@
1.49 // also remove any exception table entry. Thus we must know the call
1.50 // feeding the Catch will not really throw an exception. This is ok for
1.51 // the main fall-thru control (happens when we know a call can never throw
1.52 - // an exception) or for "rethrow", because a further optimnization will
1.53 + // an exception) or for "rethrow", because a further optimization will
1.54 // yank the rethrow (happens when we inline a function that can throw an
1.55 // exception and the caller has no handler). Not legal, e.g., for passing
1.56 // a NULL receiver to a v-call, or passing bad types to a slow-check-cast.
