src/share/vm/opto/lcm.cpp

changeset 2040
0e35fa8ebccd
parent 1934
e9ff18c4ace7
child 2048
6c9cc03d8726
     1.1 --- a/src/share/vm/opto/lcm.cpp	Fri Jul 30 10:21:15 2010 -0700
     1.2 +++ b/src/share/vm/opto/lcm.cpp	Tue Aug 03 15:55:03 2010 -0700
     1.3 @@ -461,7 +461,7 @@
     1.4        n_choice = 1;
     1.5      }
     1.6  
     1.7 -    uint n_latency = cfg->_node_latency.at_grow(n->_idx);
     1.8 +    uint n_latency = cfg->_node_latency->at_grow(n->_idx);
     1.9      uint n_score   = n->req();   // Many inputs get high score to break ties
    1.10  
    1.11      // Keep best latency found
    1.12 @@ -738,7 +738,7 @@
    1.13          Node     *n = _nodes[j];
    1.14          int     idx = n->_idx;
    1.15          tty->print("#   ready cnt:%3d  ", ready_cnt[idx]);
    1.16 -        tty->print("latency:%3d  ", cfg->_node_latency.at_grow(idx));
    1.17 +        tty->print("latency:%3d  ", cfg->_node_latency->at_grow(idx));
    1.18          tty->print("%4d: %s\n", idx, n->Name());
    1.19        }
    1.20      }
    1.21 @@ -765,7 +765,7 @@
    1.22  #ifndef PRODUCT
    1.23      if (cfg->trace_opto_pipelining()) {
    1.24        tty->print("#    select %d: %s", n->_idx, n->Name());
    1.25 -      tty->print(", latency:%d", cfg->_node_latency.at_grow(n->_idx));
    1.26 +      tty->print(", latency:%d", cfg->_node_latency->at_grow(n->_idx));
    1.27        n->dump();
    1.28        if (Verbose) {
    1.29          tty->print("#   ready list:");

mercurial