src/share/vm/opto/output.cpp

changeset 1040
98cb887364d3
parent 895
424f9bfe6b96
child 1142
4ec1257180ec
     1.1 --- a/src/share/vm/opto/output.cpp	Fri Feb 27 08:34:19 2009 -0800
     1.2 +++ b/src/share/vm/opto/output.cpp	Fri Feb 27 13:27:09 2009 -0800
     1.3 @@ -1171,7 +1171,7 @@
     1.4          cb->flush_bundle(false);
     1.5  
     1.6        // The following logic is duplicated in the code ifdeffed for
     1.7 -      // ENABLE_ZAP_DEAD_LOCALS which apppears above in this file.  It
     1.8 +      // ENABLE_ZAP_DEAD_LOCALS which appears above in this file.  It
     1.9        // should be factored out.  Or maybe dispersed to the nodes?
    1.10  
    1.11        // Special handling for SafePoint/Call Nodes
    1.12 @@ -1275,7 +1275,7 @@
    1.13          }
    1.14  
    1.15  #ifdef ASSERT
    1.16 -        // Check that oop-store preceeds the card-mark
    1.17 +        // Check that oop-store precedes the card-mark
    1.18          else if( mach->ideal_Opcode() == Op_StoreCM ) {
    1.19            uint storeCM_idx = j;
    1.20            Node *oop_store = mach->in(mach->_cnt);  // First precedence edge
    1.21 @@ -1291,7 +1291,7 @@
    1.22  #endif
    1.23  
    1.24          else if( !n->is_Proj() ) {
    1.25 -          // Remember the begining of the previous instruction, in case
    1.26 +          // Remember the beginning of the previous instruction, in case
    1.27            // it's followed by a flag-kill and a null-check.  Happens on
    1.28            // Intel all the time, with add-to-memory kind of opcodes.
    1.29            previous_offset = current_offset;
    1.30 @@ -1567,7 +1567,7 @@
    1.31  
    1.32    compile.set_node_bundling_limit(_node_bundling_limit);
    1.33  
    1.34 -  // This one is persistant within the Compile class
    1.35 +  // This one is persistent within the Compile class
    1.36    _node_bundling_base = NEW_ARENA_ARRAY(compile.comp_arena(), Bundle, node_max);
    1.37  
    1.38    // Allocate space for fixed-size arrays
    1.39 @@ -1666,7 +1666,7 @@
    1.40  // Compute the latency of all the instructions.  This is fairly simple,
    1.41  // because we already have a legal ordering.  Walk over the instructions
    1.42  // from first to last, and compute the latency of the instruction based
    1.43 -// on the latency of the preceeding instruction(s).
    1.44 +// on the latency of the preceding instruction(s).
    1.45  void Scheduling::ComputeLocalLatenciesForward(const Block *bb) {
    1.46  #ifndef PRODUCT
    1.47    if (_cfg->C->trace_opto_output())
    1.48 @@ -1931,7 +1931,7 @@
    1.49      uint siz = _available.size();
    1.50  
    1.51      // Conditional branches can support an instruction that
    1.52 -    // is unconditionally executed and not dependant by the
    1.53 +    // is unconditionally executed and not dependent by the
    1.54      // branch, OR a conditionally executed instruction if
    1.55      // the branch is taken.  In practice, this means that
    1.56      // the first instruction at the branch target is
    1.57 @@ -1947,7 +1947,7 @@
    1.58  #endif
    1.59  
    1.60        // At least 1 instruction is on the available list
    1.61 -      // that is not dependant on the branch
    1.62 +      // that is not dependent on the branch
    1.63        for (uint i = 0; i < siz; i++) {
    1.64          Node *d = _available[i];
    1.65          const Pipeline *avail_pipeline = d->pipeline();

mercurial