changeset 24318:9d2b7bd56778

8041771: C1: remove unused IR::_locals_size Summary: The unused IR::_locals_size is removed. Reviewed-by: kvn, roland Contributed-by: Tobias Hartmann <tobias.hartmann@oracle.com>
author anoll
date Mon, 28 Apr 2014 14:34:12 +0200
parents b693c6344b16
children 457a79645387
files hotspot/src/share/vm/c1/c1_IR.cpp hotspot/src/share/vm/c1/c1_IR.hpp
diffstat 2 files changed, 1 insertions(+), 5 deletions(-) [+]
line wrap: on
line diff
--- a/hotspot/src/share/vm/c1/c1_IR.cpp	Mon Apr 28 03:44:35 2014 -0700
+++ b/hotspot/src/share/vm/c1/c1_IR.cpp	Mon Apr 28 14:34:12 2014 +0200
@@ -263,8 +263,7 @@
 // Implementation of IR
 
 IR::IR(Compilation* compilation, ciMethod* method, int osr_bci) :
-    _locals_size(in_WordSize(-1))
-  , _num_loops(0) {
+  _num_loops(0) {
   // setup IR fields
   _compilation = compilation;
   _top_scope   = new IRScope(compilation, NULL, -1, method, osr_bci, true);
--- a/hotspot/src/share/vm/c1/c1_IR.hpp	Mon Apr 28 03:44:35 2014 -0700
+++ b/hotspot/src/share/vm/c1/c1_IR.hpp	Mon Apr 28 14:34:12 2014 +0200
@@ -293,7 +293,6 @@
  private:
   Compilation*     _compilation;                 // the current compilation
   IRScope*         _top_scope;                   // the root of the scope hierarchy
-  WordSize         _locals_size;                 // the space required for all locals
   int              _num_loops;                   // Total number of loops
   BlockList*       _code;                        // the blocks in code generation order w/ use counts
 
@@ -310,8 +309,6 @@
   BlockBegin*      start() const                 { return top_scope()->start(); }
   BlockBegin*      std_entry() const             { return start()->end()->as_Base()->std_entry(); }
   BlockBegin*      osr_entry() const             { return start()->end()->as_Base()->osr_entry(); }
-  WordSize         locals_size() const           { return _locals_size; }
-  int              locals_size_in_words() const  { return in_words(_locals_size); }
   BlockList*       code() const                  { return _code; }
   int              num_loops() const             { return _num_loops; }
   int              max_stack() const             { return top_scope()->max_stack(); } // expensive