hotspot/src/share/vm/opto/compile.hpp
author roland
Tue, 12 Feb 2013 12:56:11 +0100
changeset 15618 3eb521896836
parent 15118 1a1a6d1dfaab
child 15871 b04dd94da4e6
permissions -rw-r--r--
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob Summary: Add support for expensive nodes. Reviewed-by: kvn
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
     2
 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
5547
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 5353
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 5353
diff changeset
    20
 * or visit www.oracle.com if you need additional information or have any
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 5353
diff changeset
    21
 * questions.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    25
#ifndef SHARE_VM_OPTO_COMPILE_HPP
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    26
#define SHARE_VM_OPTO_COMPILE_HPP
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    27
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    28
#include "asm/codeBuffer.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    29
#include "ci/compilerInterface.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    30
#include "code/debugInfoRec.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    31
#include "code/exceptionHandlerTable.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    32
#include "compiler/compilerOracle.hpp"
14828
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
    33
#include "compiler/compileBroker.hpp"
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    34
#include "libadt/dict.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    35
#include "libadt/port.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    36
#include "libadt/vectset.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    37
#include "memory/resourceArea.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    38
#include "opto/idealGraphPrinter.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    39
#include "opto/phase.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    40
#include "opto/regmask.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    41
#include "runtime/deoptimization.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    42
#include "runtime/vmThread.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
    43
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
class Block;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
class Bundle;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
class C2Compiler;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
class CallGenerator;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
class ConnectionGraph;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
class InlineTree;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
class Int_Array;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
class Matcher;
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
    52
class MachConstantNode;
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
    53
class MachConstantBaseNode;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
class MachNode;
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
    55
class MachOper;
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
    56
class MachSafePointNode;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
class Node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
class Node_Array;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
class Node_Notes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
class OptoReg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
class PhaseCFG;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
class PhaseGVN;
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
    63
class PhaseIterGVN;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
class PhaseRegAlloc;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
class PhaseCCP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
class PhaseCCP_DCE;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
class RootNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
class relocInfo;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
class Scope;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
class StartNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
class SafePointNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
class JVMState;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
class TypeData;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
class TypePtr;
15118
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
    75
class TypeOopPtr;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
class TypeFunc;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
class Unique_Node_List;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
class nmethod;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
class WarmCallInfo;
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
    80
class Node_Stack;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
    81
struct Final_Reshape_Counts;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
//------------------------------Compile----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
// This class defines a top-level Compiler invocation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
class Compile : public Phase {
10547
ea4a2ec31ae2 7088955: add C2 IR support to the SA
never
parents: 10270
diff changeset
    87
  friend class VMStructs;
ea4a2ec31ae2 7088955: add C2 IR support to the SA
never
parents: 10270
diff changeset
    88
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
  // Fixed alias indexes.  (See also MergeMemNode.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  enum {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
    AliasIdxTop = 1,  // pseudo-index, aliases to nothing (used as sentinel value)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
    AliasIdxBot = 2,  // pseudo-index, aliases to everything
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
    AliasIdxRaw = 3   // hard-wired index for TypeRawPtr::BOTTOM
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
  // Integrated with logging.  If logging is turned on, and dolog is true,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  // then brackets are put into the log, with time stamps and node counts.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
  // (The time collection itself is always conditionalized on TimeCompiler.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
  class TracePhase : public TraceTime {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
   private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
    Compile*    C;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
    CompileLog* _log;
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   105
    const char* _phase_name;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   106
    bool _dolog;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
   public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
    TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
    ~TracePhase();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
  // Information per category of alias (memory slice)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  class AliasType {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
   private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
    friend class Compile;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
    int             _index;         // unique index, used with MergeMemNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
    const TypePtr*  _adr_type;      // normalized address type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
    ciField*        _field;         // relevant instance field, or null if none
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
    bool            _is_rewritable; // false if the memory is write-once only
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
    int             _general_index; // if this is type is an instance, the general
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
                                    // type that this is an instance of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
    void Init(int i, const TypePtr* at);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
   public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
    int             index()         const { return _index; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
    const TypePtr*  adr_type()      const { return _adr_type; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
    ciField*        field()         const { return _field; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
    bool            is_rewritable() const { return _is_rewritable; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
    bool            is_volatile()   const { return (_field ? _field->is_volatile() : false); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
    int             general_index() const { return (_general_index != 0) ? _general_index : _index; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
    void set_rewritable(bool z) { _is_rewritable = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
    void set_field(ciField* f) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
      assert(!_field,"");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
      _field = f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
      if (f->is_final())  _is_rewritable = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
    void print_on(outputStream* st) PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
  enum {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
    logAliasCacheSize = 6,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
    AliasCacheSize = (1<<logAliasCacheSize)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
  struct AliasCacheEntry { const TypePtr* _adr_type; int _index; };  // simple duple type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
  enum {
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   150
    trapHistLength = MethodData::_trap_hist_limit
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   153
  // Constant entry of the constant table.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   154
  class Constant {
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   155
  private:
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   156
    BasicType _type;
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   157
    union {
14126
afb8a3a86f1f 8000623: tools/javac/Diagnostics/6769027/T6769027.java crashes in PSPromotionManager::copy_to_survivor_space
kvn
parents: 13883
diff changeset
   158
      jvalue    _value;
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   159
      Metadata* _metadata;
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   160
    } _v;
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   161
    int       _offset;         // offset of this constant (in bytes) relative to the constant table base.
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   162
    float     _freq;
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   163
    bool      _can_be_reused;  // true (default) if the value can be shared with other users.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   164
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   165
  public:
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   166
    Constant() : _type(T_ILLEGAL), _offset(-1), _freq(0.0f), _can_be_reused(true) { _v._value.l = 0; }
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   167
    Constant(BasicType type, jvalue value, float freq = 0.0f, bool can_be_reused = true) :
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   168
      _type(type),
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   169
      _offset(-1),
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   170
      _freq(freq),
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   171
      _can_be_reused(can_be_reused)
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   172
    {
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   173
      assert(type != T_METADATA, "wrong constructor");
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   174
      _v._value = value;
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   175
    }
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   176
    Constant(Metadata* metadata, bool can_be_reused = true) :
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   177
      _type(T_METADATA),
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   178
      _offset(-1),
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   179
      _freq(0.0f),
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   180
      _can_be_reused(can_be_reused)
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   181
    {
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   182
      _v._metadata = metadata;
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   183
    }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   184
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   185
    bool operator==(const Constant& other);
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   186
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   187
    BasicType type()      const    { return _type; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   188
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   189
    jlong   get_jlong()   const    { return _v._value.j; }
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   190
    jfloat  get_jfloat()  const    { return _v._value.f; }
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   191
    jdouble get_jdouble() const    { return _v._value.d; }
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   192
    jobject get_jobject() const    { return _v._value.l; }
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   193
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   194
    Metadata* get_metadata() const { return _v._metadata; }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   195
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   196
    int         offset()  const    { return _offset; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   197
    void    set_offset(int offset) {        _offset = offset; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   198
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   199
    float       freq()    const    { return _freq;         }
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   200
    void    inc_freq(float freq)   {        _freq += freq; }
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   201
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   202
    bool    can_be_reused() const  { return _can_be_reused; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   203
  };
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   204
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   205
  // Constant table.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   206
  class ConstantTable {
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   207
  private:
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   208
    GrowableArray<Constant> _constants;          // Constants of this table.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   209
    int                     _size;               // Size in bytes the emitted constant table takes (including padding).
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   210
    int                     _table_base_offset;  // Offset of the table base that gets added to the constant offsets.
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   211
    int                     _nof_jump_tables;    // Number of jump-tables in this constant table.
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   212
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   213
    static int qsort_comparator(Constant* a, Constant* b);
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   214
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   215
    // We use negative frequencies to keep the order of the
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   216
    // jump-tables in which they were added.  Otherwise we get into
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   217
    // trouble with relocation.
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   218
    float next_jump_table_freq() { return -1.0f * (++_nof_jump_tables); }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   219
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   220
  public:
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   221
    ConstantTable() :
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   222
      _size(-1),
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   223
      _table_base_offset(-1),  // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit).
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   224
      _nof_jump_tables(0)
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   225
    {}
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   226
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   227
    int size() const { assert(_size != -1, "not calculated yet"); return _size; }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   228
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   229
    int calculate_table_base_offset() const;  // AD specific
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   230
    void set_table_base_offset(int x)  { assert(_table_base_offset == -1 || x == _table_base_offset, "can't change"); _table_base_offset = x; }
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   231
    int      table_base_offset() const { assert(_table_base_offset != -1, "not set yet");                      return _table_base_offset; }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   232
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   233
    void emit(CodeBuffer& cb);
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   234
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   235
    // Returns the offset of the last entry (the top) of the constant table.
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   236
    int  top_offset() const { assert(_constants.top().offset() != -1, "not bound yet"); return _constants.top().offset(); }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   237
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   238
    void calculate_offsets_and_size();
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   239
    int  find_offset(Constant& con) const;
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   240
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   241
    void     add(Constant& con);
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   242
    Constant add(MachConstantNode* n, BasicType type, jvalue value);
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   243
    Constant add(Metadata* metadata);
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   244
    Constant add(MachConstantNode* n, MachOper* oper);
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   245
    Constant add(MachConstantNode* n, jfloat f) {
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   246
      jvalue value; value.f = f;
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   247
      return add(n, T_FLOAT, value);
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   248
    }
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   249
    Constant add(MachConstantNode* n, jdouble d) {
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   250
      jvalue value; value.d = d;
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   251
      return add(n, T_DOUBLE, value);
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   252
    }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   253
11190
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   254
    // Jump-table
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   255
    Constant  add_jump_table(MachConstantNode* n);
d561d41f241a 7003454: order constants in constant table by number of references in code
twisti
parents: 10547
diff changeset
   256
    void     fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const;
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   257
  };
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   258
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
 private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
  // Fixed parameters to this compilation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
  const int             _compile_id;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
  const bool            _save_argument_registers; // save/restore arg regs for trampolines
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
  const bool            _subsume_loads;         // Load can be matched as part of a larger op.
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   264
  const bool            _do_escape_analysis;    // Do escape analysis.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  ciMethod*             _method;                // The method being compiled.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
  int                   _entry_bci;             // entry bci for osr methods.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  const TypeFunc*       _tf;                    // My kind of signature
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
  InlineTree*           _ilt;                   // Ditto (temporary).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
  address               _stub_function;         // VM entry for stub being compiled, or NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
  const char*           _stub_name;             // Name of stub or adapter being compiled, or NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
  address               _stub_entry_point;      // Compile code entry for generated stub, or NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
  // Control of this compilation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  int                   _num_loop_opts;         // Number of iterations for doing loop optimiztions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  int                   _max_inline_size;       // Max inline size for this compilation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  int                   _freq_inline_size;      // Max hot method inline size for this compilation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
  int                   _fixed_slots;           // count of frame slots not allocated by the register
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
                                                // allocator i.e. locks, original deopt pc, etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
  // For deopt
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  int                   _orig_pc_slot;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  int                   _orig_pc_slot_offset_in_bytes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  int                   _major_progress;        // Count of something big happening
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   284
  bool                  _inlining_progress;     // progress doing incremental inlining?
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   285
  bool                  _inlining_incrementally;// Are we doing incremental inlining (post parse)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
  bool                  _has_loops;             // True if the method _may_ have some loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  bool                  _has_split_ifs;         // True if the method _may_ have some split-if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
  bool                  _has_unsafe_access;     // True if the method _may_ produce faults in unsafe loads or stores.
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   289
  bool                  _has_stringbuilder;     // True StringBuffers or StringBuilders are allocated
13883
6979b9850feb 7196199: java/text/Bidi/Bug6665028.java failed: Bidi run count incorrect
kvn
parents: 13728
diff changeset
   290
  int                   _max_vector_size;       // Maximum size of generated vectors
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
  uint                  _trap_hist[trapHistLength];  // Cumulative traps
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
  bool                  _trap_can_recompile;    // Have we emitted a recompiling trap?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
  uint                  _decompile_count;       // Cumulative decompilation counts.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
  bool                  _do_inlining;           // True if we intend to do inlining
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  bool                  _do_scheduling;         // True if we intend to do scheduling
1498
346bf226078e 6743900: frequency based block layout
rasbold
parents: 1399
diff changeset
   296
  bool                  _do_freq_based_layout;  // True if we intend to do frequency based block layout
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
  bool                  _do_count_invocations;  // True if we generate code to count invocations
13728
882756847a04 6964458: Reimplement class meta-data storage to use native memory
coleenp
parents: 12107
diff changeset
   298
  bool                  _do_method_data_update; // True if we generate code to update MethodData*s
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
  int                   _AliasLevel;            // Locally-adjusted version of AliasLevel flag.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
  bool                  _print_assembly;        // True if we should dump assembly code for this compilation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
  bool                  _trace_opto_output;
1399
9648dfd4ce09 6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents: 670
diff changeset
   303
  bool                  _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
4906
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   306
  // JSR 292
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   307
  bool                  _has_method_handle_invokes; // True if this method has MethodHandle invokes.
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   308
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  // Compilation environment.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
  Arena                 _comp_arena;            // Arena with lifetime equivalent to Compile
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
  ciEnv*                _env;                   // CI interface
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
  CompileLog*           _log;                   // from CompilerThread
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  const char*           _failure_reason;        // for record_failure/failing pattern
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
  GrowableArray<CallGenerator*>* _intrinsics;   // List of intrinsics.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
  GrowableArray<Node*>* _macro_nodes;           // List of nodes which need to be expanded before matching.
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   316
  GrowableArray<Node*>* _predicate_opaqs;       // List of Opaque1 nodes for the loop predicates.
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   317
  GrowableArray<Node*>* _expensive_nodes;       // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  ConnectionGraph*      _congraph;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  IdealGraphPrinter*    _printer;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  // Node management
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
  uint                  _unique;                // Counter for unique Node indices
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   325
  VectorSet             _dead_node_list;        // Set of dead nodes
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   326
  uint                  _dead_node_count;       // Number of dead nodes; VectorSet::Size() is O(N).
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   327
                                                // So use this to keep count and make the call O(1).
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  debug_only(static int _debug_idx;)            // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
  Arena                 _node_arena;            // Arena for new-space Nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
  Arena                 _old_arena;             // Arena for old-space Nodes, lifetime during xform
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
  RootNode*             _root;                  // Unique root of compilation, or NULL after bail-out.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
  Node*                 _top;                   // Unique top node.  (Reset by various phases.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
  Node*                 _immutable_memory;      // Initial memory state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
  Node*                 _recent_alloc_obj;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
  Node*                 _recent_alloc_ctl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   339
  // Constant table
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   340
  ConstantTable         _constant_table;        // The constant table for this compile.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   341
  MachConstantBaseNode* _mach_constant_base_node;  // Constant table base node singleton.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   342
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   343
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
  // Blocked array of debugging and profiling information,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
  // tracked per node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
  enum { _log2_node_notes_block_size = 8,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
         _node_notes_block_size = (1<<_log2_node_notes_block_size)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
  GrowableArray<Node_Notes*>* _node_note_array;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
  Node_Notes*           _default_node_notes;  // default notes for new nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
  // After parsing and every bulk phase we hang onto the Root instruction.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
  // The RootNode instruction is where the whole program begins.  It produces
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
  // the initial Control and BOTTOM for everybody else.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
  // Type management
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
  Arena                 _Compile_types;         // Arena for all types
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
  Arena*                _type_arena;            // Alias for _Compile_types except in Initialize_shared()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
  Dict*                 _type_dict;             // Intern table
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
  void*                 _type_hwm;              // Last allocation (see Type::operator new/delete)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
  size_t                _type_last_size;        // Last allocation size (see Type::operator new/delete)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
  ciMethod*             _last_tf_m;             // Cache for
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
  const TypeFunc*       _last_tf;               //  TypeFunc::make
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
  AliasType**           _alias_types;           // List of alias types seen so far.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  int                   _num_alias_types;       // Logical length of _alias_types
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
  int                   _max_alias_types;       // Physical length of _alias_types
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
  AliasCacheEntry       _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
  // Parsing, optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
  PhaseGVN*             _initial_gvn;           // Results of parse-time PhaseGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
  Unique_Node_List*     _for_igvn;              // Initial work-list for next round of Iterative GVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
  WarmCallInfo*         _warm_calls;            // Sorted work-list for heat-based inlining.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   374
  GrowableArray<CallGenerator*> _late_inlines;        // List of CallGenerators to be revisited after
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   375
                                                      // main parsing has finished.
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   376
  GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   377
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   378
  int                           _late_inlines_pos;    // Where in the queue should the next late inlining candidate go (emulate depth first inlining)
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   379
  uint                          _number_of_mh_late_inlines; // number of method handle late inlining still pending
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   380
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   381
14828
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   382
  // Inlining may not happen in parse order which would make
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   383
  // PrintInlining output confusing. Keep track of PrintInlining
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   384
  // pieces in order.
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   385
  class PrintInliningBuffer : public ResourceObj {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   386
   private:
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   387
    CallGenerator* _cg;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   388
    stringStream* _ss;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   389
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   390
   public:
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   391
    PrintInliningBuffer()
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   392
      : _cg(NULL) { _ss = new stringStream(); }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   393
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   394
    stringStream* ss() const { return _ss; }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   395
    CallGenerator* cg() const { return _cg; }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   396
    void set_cg(CallGenerator* cg) { _cg = cg; }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   397
  };
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   398
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   399
  GrowableArray<PrintInliningBuffer>* _print_inlining_list;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   400
  int _print_inlining;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   401
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   402
  // Only keep nodes in the expensive node list that need to be optimized
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   403
  void cleanup_expensive_nodes(PhaseIterGVN &igvn);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   404
  // Use for sorting expensive nodes to bring similar nodes together
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   405
  static int cmp_expensive_nodes(Node** n1, Node** n2);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   406
  // Expensive nodes list already sorted?
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   407
  bool expensive_nodes_sorted() const;
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   408
14828
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   409
 public:
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   410
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   411
  outputStream* print_inlining_stream() const {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   412
    return _print_inlining_list->at(_print_inlining).ss();
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   413
  }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   414
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   415
  void print_inlining_skip(CallGenerator* cg) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   416
    if (PrintInlining) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   417
      _print_inlining_list->at(_print_inlining).set_cg(cg);
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   418
      _print_inlining++;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   419
      _print_inlining_list->insert_before(_print_inlining, PrintInliningBuffer());
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   420
    }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   421
  }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   422
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   423
  void print_inlining_insert(CallGenerator* cg) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   424
    if (PrintInlining) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   425
      for (int i = 0; i < _print_inlining_list->length(); i++) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   426
        if (_print_inlining_list->at(i).cg() == cg) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   427
          _print_inlining_list->insert_before(i+1, PrintInliningBuffer());
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   428
          _print_inlining = i+1;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   429
          _print_inlining_list->at(i).set_cg(NULL);
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   430
          return;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   431
        }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   432
      }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   433
      ShouldNotReachHere();
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   434
    }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   435
  }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   436
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   437
  void print_inlining(ciMethod* method, int inline_level, int bci, const char* msg = NULL) {
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   438
    stringStream ss;
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   439
    CompileTask::print_inlining(&ss, method, inline_level, bci, msg);
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   440
    print_inlining_stream()->print(ss.as_string());
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   441
  }
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   442
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   443
 private:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
  // Matching, CFG layout, allocation, code generation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
  PhaseCFG*             _cfg;                   // Results of CFG finding
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
  bool                  _select_24_bit_instr;   // We selected an instruction with a 24-bit result
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
  bool                  _in_24_bit_fp_mode;     // We are emitting instructions with 24-bit results
3276
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   448
  int                   _java_calls;            // Number of java calls in the method
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   449
  int                   _inner_loops;           // Number of inner loops in the method
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
  Matcher*              _matcher;               // Engine to map ideal to machine instructions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
  PhaseRegAlloc*        _regalloc;              // Results of register allocation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
  int                   _frame_slots;           // Size of total frame in stack slots
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
  CodeOffsets           _code_offsets;          // Offsets into the code for various interesting entries
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  RegMask               _FIRST_STACK_mask;      // All stack slots usable for spills (depends on frame layout)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  Arena*                _indexSet_arena;        // control IndexSet allocation within PhaseChaitin
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
  void*                 _indexSet_free_block_list; // free list of IndexSet bit blocks
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
  uint                  _node_bundling_limit;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
  Bundle*               _node_bundling_base;    // Information for instruction bundling
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
  // Instruction bits passed off to the VM
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
  int                   _method_size;           // Size of nmethod code segment in bytes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  CodeBuffer            _code_buffer;           // Where the code is assembled
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
  int                   _first_block_size;      // Size of unvalidated entry point code / OSR poison code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  ExceptionHandlerTable _handler_table;         // Table of native-code exception handlers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
  ImplicitExceptionTable _inc_table;            // Table of implicit null checks in native code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
  OopMapSet*            _oop_map_set;           // Table of oop maps (one for each safepoint location)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
  static int            _CompiledZap_count;     // counter compared against CompileZap[First/Last]
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  BufferBlob*           _scratch_buffer_blob;   // For temporary code buffers.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
  relocInfo*            _scratch_locs_memory;   // For temporary code buffers.
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   471
  int                   _scratch_const_size;    // For temporary code buffers.
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   472
  bool                  _in_scratch_emit_size;  // true when in scratch_emit_size.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  // Accessors
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
  // The Compile instance currently active in this (compiler) thread.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
  static Compile* current() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
    return (Compile*) ciEnv::current()->compiler_data();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
  // ID for this compilation.  Useful for setting breakpoints in the debugger.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
  int               compile_id() const          { return _compile_id; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
  // Does this compilation allow instructions to subsume loads?  User
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
  // instructions that subsume a load may result in an unschedulable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
  // instruction sequence.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
  bool              subsume_loads() const       { return _subsume_loads; }
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   489
  // Do escape analysis.
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   490
  bool              do_escape_analysis() const  { return _do_escape_analysis; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
  bool              save_argument_registers() const { return _save_argument_registers; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
  // Other fixed compilation parameters.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
  ciMethod*         method() const              { return _method; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
  int               entry_bci() const           { return _entry_bci; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
  bool              is_osr_compilation() const  { return _entry_bci != InvocationEntryBci; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
  bool              is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
  const TypeFunc*   tf() const                  { assert(_tf!=NULL, ""); return _tf; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
  void         init_tf(const TypeFunc* tf)      { assert(_tf==NULL, ""); _tf = tf; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
  InlineTree*       ilt() const                 { return _ilt; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  address           stub_function() const       { return _stub_function; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
  const char*       stub_name() const           { return _stub_name; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
  address           stub_entry_point() const    { return _stub_entry_point; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
  // Control of this compilation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
  int               fixed_slots() const         { assert(_fixed_slots >= 0, "");         return _fixed_slots; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
  void          set_fixed_slots(int n)          { _fixed_slots = n; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
  int               major_progress() const      { return _major_progress; }
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   510
  void          set_inlining_progress(bool z)   { _inlining_progress = z; }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   511
  int               inlining_progress() const   { return _inlining_progress; }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   512
  void          set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   513
  int               inlining_incrementally() const { return _inlining_incrementally; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
  void          set_major_progress()            { _major_progress++; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
  void        clear_major_progress()            { _major_progress = 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
  int               num_loop_opts() const       { return _num_loop_opts; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
  void          set_num_loop_opts(int n)        { _num_loop_opts = n; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  int               max_inline_size() const     { return _max_inline_size; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
  void          set_freq_inline_size(int n)     { _freq_inline_size = n; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  int               freq_inline_size() const    { return _freq_inline_size; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
  void          set_max_inline_size(int n)      { _max_inline_size = n; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
  bool              has_loops() const           { return _has_loops; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
  void          set_has_loops(bool z)           { _has_loops = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
  bool              has_split_ifs() const       { return _has_split_ifs; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
  void          set_has_split_ifs(bool z)       { _has_split_ifs = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
  bool              has_unsafe_access() const   { return _has_unsafe_access; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
  void          set_has_unsafe_access(bool z)   { _has_unsafe_access = z; }
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   528
  bool              has_stringbuilder() const   { return _has_stringbuilder; }
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   529
  void          set_has_stringbuilder(bool z)   { _has_stringbuilder = z; }
13883
6979b9850feb 7196199: java/text/Bidi/Bug6665028.java failed: Bidi run count incorrect
kvn
parents: 13728
diff changeset
   530
  int               max_vector_size() const     { return _max_vector_size; }
6979b9850feb 7196199: java/text/Bidi/Bug6665028.java failed: Bidi run count incorrect
kvn
parents: 13728
diff changeset
   531
  void          set_max_vector_size(int s)      { _max_vector_size = s; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
  void          set_trap_count(uint r, uint c)  { assert(r < trapHistLength, "oob");        _trap_hist[r] = c; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  uint              trap_count(uint r) const    { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
  bool              trap_can_recompile() const  { return _trap_can_recompile; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  void          set_trap_can_recompile(bool z)  { _trap_can_recompile = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  uint              decompile_count() const     { return _decompile_count; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  void          set_decompile_count(uint c)     { _decompile_count = c; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  bool              allow_range_check_smearing() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
  bool              do_inlining() const         { return _do_inlining; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
  void          set_do_inlining(bool z)         { _do_inlining = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  bool              do_scheduling() const       { return _do_scheduling; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
  void          set_do_scheduling(bool z)       { _do_scheduling = z; }
1498
346bf226078e 6743900: frequency based block layout
rasbold
parents: 1399
diff changeset
   543
  bool              do_freq_based_layout() const{ return _do_freq_based_layout; }
346bf226078e 6743900: frequency based block layout
rasbold
parents: 1399
diff changeset
   544
  void          set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
  bool              do_count_invocations() const{ return _do_count_invocations; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
  void          set_do_count_invocations(bool z){ _do_count_invocations = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
  bool              do_method_data_update() const { return _do_method_data_update; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
  void          set_do_method_data_update(bool z) { _do_method_data_update = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
  int               AliasLevel() const          { return _AliasLevel; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
  bool              print_assembly() const       { return _print_assembly; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  void          set_print_assembly(bool z)       { _print_assembly = z; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
  // check the CompilerOracle for special behaviours for this compile
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  bool          method_has_option(const char * option) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
    return method() != NULL && method()->has_option(option);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
  bool          trace_opto_output() const       { return _trace_opto_output; }
1399
9648dfd4ce09 6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents: 670
diff changeset
   558
  bool              parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
9648dfd4ce09 6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents: 670
diff changeset
   559
  void          set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
4906
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   562
  // JSR 292
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   563
  bool              has_method_handle_invokes() const { return _has_method_handle_invokes;     }
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   564
  void          set_has_method_handle_invokes(bool z) {        _has_method_handle_invokes = z; }
90640ad2d401 6926782: CodeBuffer size too small after 6921352
twisti
parents: 4643
diff changeset
   565
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
  void begin_method() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
    if (_printer) _printer->begin_method(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
  void print_method(const char * name, int level = 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
    if (_printer) _printer->print_method(this, name, level);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
  void end_method() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
    if (_printer) _printer->end_method();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
  int           macro_count()                   { return _macro_nodes->length(); }
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   583
  int           predicate_count()               { return _predicate_opaqs->length();}
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   584
  int           expensive_count()               { return _expensive_nodes->length(); }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  Node*         macro_node(int idx)             { return _macro_nodes->at(idx); }
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   586
  Node*         predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);}
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   587
  Node*         expensive_node(int idx)         { return _expensive_nodes->at(idx); }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
  ConnectionGraph* congraph()                   { return _congraph;}
5914
8363e7e6915a 6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents: 5547
diff changeset
   589
  void set_congraph(ConnectionGraph* congraph)  { _congraph = congraph;}
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
  void add_macro_node(Node * n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
    //assert(n->is_macro(), "must be a macro node");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
    assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
    _macro_nodes->append(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
  void remove_macro_node(Node * n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
    // this function may be called twice for a node so check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
    // that the node is in the array before attempting to remove it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
    if (_macro_nodes->contains(n))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
      _macro_nodes->remove(n);
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   600
    // remove from _predicate_opaqs list also if it is there
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   601
    if (predicate_count() > 0 && _predicate_opaqs->contains(n)){
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   602
      _predicate_opaqs->remove(n);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   603
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
  }
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   605
  void add_expensive_node(Node * n);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   606
  void remove_expensive_node(Node * n) {
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   607
    if (_expensive_nodes->contains(n)) {
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   608
      _expensive_nodes->remove(n);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   609
    }
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   610
  }
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   611
  void add_predicate_opaq(Node * n) {
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   612
    assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1");
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   613
    assert(_macro_nodes->contains(n), "should have already been in macro list");
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   614
    _predicate_opaqs->append(n);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   615
  }
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   616
  // remove the opaque nodes that protect the predicates so that the unused checks and
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   617
  // uncommon traps will be eliminated from the graph.
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 4450
diff changeset
   618
  void cleanup_loop_predicates(PhaseIterGVN &igvn);
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8725
diff changeset
   619
  bool is_predicate_opaq(Node * n) {
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8725
diff changeset
   620
    return _predicate_opaqs->contains(n);
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8725
diff changeset
   621
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   623
  // Are there candidate expensive nodes for optimization?
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   624
  bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   625
  // Check whether n1 and n2 are similar
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   626
  static int cmp_expensive_nodes(Node* n1, Node* n2);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   627
  // Sort expensive nodes to locate similar expensive nodes
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   628
  void sort_expensive_nodes();
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 15118
diff changeset
   629
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
  // Compilation environment.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
  Arena*            comp_arena()                { return &_comp_arena; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
  ciEnv*            env() const                 { return _env; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
  CompileLog*       log() const                 { return _log; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
  bool              failing() const             { return _env->failing() || _failure_reason != NULL; }
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   635
  const char*       failure_reason() { return _failure_reason; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
  bool              failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
  void record_failure(const char* reason);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
  void record_method_not_compilable(const char* reason, bool all_tiers = false) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
    // All bailouts cover "all_tiers" when TieredCompilation is off.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
    if (!TieredCompilation) all_tiers = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
    env()->record_method_not_compilable(reason, all_tiers);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
    // Record failure reason.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
    record_failure(reason);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
  void record_method_not_compilable_all_tiers(const char* reason) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
    record_method_not_compilable(reason, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
  bool check_node_count(uint margin, const char* reason) {
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   650
    if (live_nodes() + margin > (uint)MaxNodeLimit) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
      record_method_not_compilable(reason);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   657
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
  // Node management
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   659
  uint         unique() const              { return _unique; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   660
  uint         next_unique()               { return _unique++; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   661
  void         set_unique(uint i)          { _unique = i; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   662
  static int   debug_idx()                 { return debug_only(_debug_idx)+0; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   663
  static void  set_debug_idx(int i)        { debug_only(_debug_idx = i); }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   664
  Arena*       node_arena()                { return &_node_arena; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   665
  Arena*       old_arena()                 { return &_old_arena; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   666
  RootNode*    root() const                { return _root; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   667
  void         set_root(RootNode* r)       { _root = r; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   668
  StartNode*   start() const;              // (Derived from root.)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
  void         init_start(StartNode* s);
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   670
  Node*        immutable_memory();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   672
  Node*        recent_alloc_ctl() const    { return _recent_alloc_ctl; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   673
  Node*        recent_alloc_obj() const    { return _recent_alloc_obj; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   674
  void         set_recent_alloc(Node* ctl, Node* obj) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
                                                  _recent_alloc_ctl = ctl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
                                                  _recent_alloc_obj = obj;
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   677
                                           }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   678
  void         record_dead_node(uint idx)  { if (_dead_node_list.test_set(idx)) return;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   679
                                             _dead_node_count++;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   680
                                           }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   681
  uint         dead_node_count()           { return _dead_node_count; }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   682
  void         reset_dead_node_list()      { _dead_node_list.Reset();
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   683
                                             _dead_node_count = 0;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   684
                                           }
14828
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   685
  uint          live_nodes() const         {
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   686
    int  val = _unique - _dead_node_count;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   687
    assert (val >= 0, err_msg_res("number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count));
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   688
            return (uint) val;
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   689
                                           }
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   690
#ifdef ASSERT
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   691
  uint         count_live_nodes_by_graph_walk();
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   692
  void         print_missing_nodes();
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   693
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   695
  // Constant table
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   696
  ConstantTable&   constant_table() { return _constant_table; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   697
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   698
  MachConstantBaseNode*     mach_constant_base_node();
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   699
  bool                  has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   700
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
  // Handy undefined Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
  Node*             top() const                 { return _top; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
  // these are used by guys who need to know about creation and transformation of top:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
  Node*             cached_top_node()           { return _top; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
  void          set_cached_top_node(Node* tn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
  GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
  void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
  Node_Notes* default_node_notes() const        { return _default_node_notes; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
  void    set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
  Node_Notes*       node_notes_at(int idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
    return locate_node_notes(_node_note_array, idx, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
  inline bool   set_node_notes_at(int idx, Node_Notes* value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
  // Copy notes from source to dest, if they exist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
  // Overwrite dest only if source provides something.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
  // Return true if information was moved.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
  bool copy_node_notes_to(Node* dest, Node* source);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
  // Workhorse function to sort out the blocked Node_Notes array:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
  inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
                                       int idx, bool can_grow = false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
  void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
  // Type management
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
  Arena*            type_arena()                { return _type_arena; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
  Dict*             type_dict()                 { return _type_dict; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
  void*             type_hwm()                  { return _type_hwm; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
  size_t            type_last_size()            { return _type_last_size; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
  int               num_alias_types()           { return _num_alias_types; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
  void          init_type_arena()                       { _type_arena = &_Compile_types; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
  void          set_type_arena(Arena* a)                { _type_arena = a; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
  void          set_type_dict(Dict* d)                  { _type_dict = d; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
  void          set_type_hwm(void* p)                   { _type_hwm = p; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
  void          set_type_last_size(size_t sz)           { _type_last_size = sz; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
  const TypeFunc* last_tf(ciMethod* m) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
    return (m == _last_tf_m) ? _last_tf : NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
  void set_last_tf(ciMethod* m, const TypeFunc* tf) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
    assert(m != NULL || tf == NULL, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
    _last_tf_m = m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
    _last_tf = tf;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
  AliasType*        alias_type(int                idx)  { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
8725
8c1e3dd5fe1b 7017732: move static fields into Class to prepare for perm gen removal
never
parents: 7433
diff changeset
   752
  AliasType*        alias_type(const TypePtr* adr_type, ciField* field = NULL) { return find_alias_type(adr_type, false, field); }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
  bool         have_alias_type(const TypePtr* adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
  AliasType*        alias_type(ciField*         field);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
  int               get_alias_index(const TypePtr* at)  { return alias_type(at)->index(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
  const TypePtr*    get_adr_type(uint aidx)             { return alias_type(aidx)->adr_type(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
  int               get_general_index(uint aidx)        { return alias_type(aidx)->general_index(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
  // Building nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
  void              rethrow_exceptions(JVMState* jvms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
  void              return_values(JVMState* jvms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
  JVMState*         build_start_state(StartNode* start, const TypeFunc* tf);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
  // Decide how to build a call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
  // The profile factor is a discount to apply to this site's interp. profile.
15118
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   767
  CallGenerator*    call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch, JVMState* jvms, bool allow_inline, float profile_factor, bool allow_intrinsics = true, bool delayed_forbidden = false);
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   768
  bool should_delay_inlining(ciMethod* call_method, JVMState* jvms);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
15118
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   770
  // Helper functions to identify inlining potential at call-site
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   771
  ciMethod* optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass,
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   772
                                  ciMethod* callee, const TypeOopPtr* receiver_type,
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   773
                                  bool is_virtual,
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   774
                                  bool &call_does_dispatch, int &vtable_index);
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   775
  ciMethod* optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass,
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   776
                              ciMethod* callee, const TypeOopPtr* receiver_type);
1a1a6d1dfaab 8005418: JSR 292: virtual dispatch bug in 292 impl
twisti
parents: 15113
diff changeset
   777
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
  // Report if there were too many traps at a current method and bci.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
  // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
  // If there is no MDO at all, report no trap unless told to assume it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
  bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
  // This version, unspecific to a particular bci, asks if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
  // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
  bool too_many_traps(Deoptimization::DeoptReason reason,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
                      // Privately used parameter for logging:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
                      ciMethodData* logmd = NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
  // Report if there were too many recompiles at a method and bci.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
  bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
  // Parsing, optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
  PhaseGVN*         initial_gvn()               { return _initial_gvn; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  Unique_Node_List* for_igvn()                  { return _for_igvn; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
  inline void       record_for_igvn(Node* n);   // Body is after class Unique_Node_List.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  void          set_initial_gvn(PhaseGVN *gvn)           { _initial_gvn = gvn; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  void          set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   797
  // Replace n by nn using initial_gvn, calling hash_delete and
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   798
  // record_for_igvn as needed.
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   799
  void gvn_replace_by(Node* n, Node* nn);
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   800
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   801
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
  void              identify_useful_nodes(Unique_Node_List &useful);
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
   803
  void              update_dead_node_list(Unique_Node_List &useful);
14828
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   804
  void              remove_useless_nodes (Unique_Node_List &useful);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
  WarmCallInfo*     warm_calls() const          { return _warm_calls; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
  void          set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
  WarmCallInfo* pop_warm_call();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   810
  // Record this CallGenerator for inlining at the end of parsing.
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   811
  void              add_late_inline(CallGenerator* cg)        {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   812
    _late_inlines.insert_before(_late_inlines_pos, cg);
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   813
    _late_inlines_pos++;
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   814
  }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   815
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   816
  void              prepend_late_inline(CallGenerator* cg)    {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   817
    _late_inlines.insert_before(0, cg);
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   818
  }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   819
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   820
  void              add_string_late_inline(CallGenerator* cg) {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   821
    _string_late_inlines.push(cg);
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   822
  }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   823
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   824
  void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
4450
6d700b859b3e 6892658: C2 should optimize some stringbuilder patterns
never
parents: 3795
diff changeset
   825
14828
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   826
  void dump_inlining();
bb9dffedf46c 8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents: 14623
diff changeset
   827
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   828
  bool over_inlining_cutoff() const {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   829
    if (!inlining_incrementally()) {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   830
      return unique() > (uint)NodeCountInliningCutoff;
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   831
    } else {
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   832
      return live_nodes() > (uint)LiveNodeCountInliningCutoff;
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   833
    }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   834
  }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   835
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   836
  void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   837
  void dec_number_of_mh_late_inlines() { assert(_number_of_mh_late_inlines > 0, "_number_of_mh_late_inlines < 0 !"); _number_of_mh_late_inlines--; }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   838
  bool has_mh_late_inlines() const     { return _number_of_mh_late_inlines > 0; }
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   839
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   840
  void inline_incrementally_one(PhaseIterGVN& igvn);
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   841
  void inline_incrementally(PhaseIterGVN& igvn);
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   842
  void inline_string_calls(bool parse_time);
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 14828
diff changeset
   843
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
  // Matching, CFG layout, allocation, code generation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
  PhaseCFG*         cfg()                       { return _cfg; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
  bool              select_24_bit_instr() const { return _select_24_bit_instr; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
  bool              in_24_bit_fp_mode() const   { return _in_24_bit_fp_mode; }
3276
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   848
  bool              has_java_calls() const      { return _java_calls > 0; }
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   849
  int               java_calls() const          { return _java_calls; }
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   850
  int               inner_loops() const         { return _inner_loops; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
  Matcher*          matcher()                   { return _matcher; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
  PhaseRegAlloc*    regalloc()                  { return _regalloc; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
  int               frame_slots() const         { return _frame_slots; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
  int               frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
  RegMask&          FIRST_STACK_mask()          { return _FIRST_STACK_mask; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
  Arena*            indexSet_arena()            { return _indexSet_arena; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
  void*             indexSet_free_block_list()  { return _indexSet_free_block_list; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
  uint              node_bundling_limit()       { return _node_bundling_limit; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
  Bundle*           node_bundling_base()        { return _node_bundling_base; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
  void          set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
  void          set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
  bool          starts_bundle(const Node *n) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
  bool          need_stack_bang(int frame_size_in_bytes) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
  bool          need_register_stack_bang() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
  void          set_matcher(Matcher* m)                 { _matcher = m; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
//void          set_regalloc(PhaseRegAlloc* ra)           { _regalloc = ra; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
  void          set_indexSet_arena(Arena* a)            { _indexSet_arena = a; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   869
  void          set_indexSet_free_block_list(void* p)   { _indexSet_free_block_list = p; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
  // Remember if this compilation changes hardware mode to 24-bit precision
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
  void set_24_bit_selection_and_mode(bool selection, bool mode) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
    _select_24_bit_instr = selection;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
    _in_24_bit_fp_mode   = mode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
3276
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   877
  void  set_java_calls(int z) { _java_calls  = z; }
bda7d4532054 6860599: nodes limit could be reached during Output phase
kvn
parents: 1498
diff changeset
   878
  void set_inner_loops(int z) { _inner_loops = z; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
  // Instruction bits passed off to the VM
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
  int               code_size()                 { return _method_size; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
  CodeBuffer*       code_buffer()               { return &_code_buffer; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
  int               first_block_size()          { return _first_block_size; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
  void              set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
  ExceptionHandlerTable*  handler_table()       { return &_handler_table; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
  ImplicitExceptionTable* inc_table()           { return &_inc_table; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
  OopMapSet*        oop_map_set()               { return _oop_map_set; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
  DebugInformationRecorder* debug_info()        { return env()->debug_info(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
  Dependencies*     dependencies()              { return env()->dependencies(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
  static int        CompiledZap_count()         { return _CompiledZap_count; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
  BufferBlob*       scratch_buffer_blob()       { return _scratch_buffer_blob; }
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   892
  void         init_scratch_buffer_blob(int const_size);
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   893
  void        clear_scratch_buffer_blob();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
  void          set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
  relocInfo*        scratch_locs_memory()       { return _scratch_locs_memory; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
  void          set_scratch_locs_memory(relocInfo* b)  { _scratch_locs_memory = b; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
  // emit to scratch blob, report resulting size
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
  uint              scratch_emit_size(const Node* n);
7433
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   900
  void       set_in_scratch_emit_size(bool x)   {        _in_scratch_emit_size = x; }
b418028612ad 6961690: load oops from constant table on SPARC
twisti
parents: 7397
diff changeset
   901
  bool           in_scratch_emit_size() const   { return _in_scratch_emit_size;     }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
  enum ScratchBufferBlob {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
    MAX_inst_size       = 1024,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
    MAX_locs_size       = 128, // number of relocInfo elements
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
    MAX_const_size      = 128,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
    MAX_stubs_size      = 128
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
  // Major entry point.  Given a Scope, compile the associated method.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
  // For normal compilations, entry_bci is InvocationEntryBci.  For on stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
  // replacement, entry_bci indicates the bytecode for which to compile a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
  // continuation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
  Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
211
e2b60448c234 6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents: 1
diff changeset
   915
          int entry_bci, bool subsume_loads, bool do_escape_analysis);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
  // Second major entry point.  From the TypeFunc signature, generate code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
  // to pass arguments from the Java calling convention to the C calling
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
  // convention.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
  Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
          address stub_function, const char *stub_name,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
          int is_fancy_jump, bool pass_tls,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
          bool save_arg_registers, bool return_pc);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
  // From the TypeFunc signature, generate code to pass arguments
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
  // from Compiled calling convention to Interpreter's calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
  void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
  // From the TypeFunc signature, generate code to pass arguments
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
  // from Interpreter's calling convention to Compiler's calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
  void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
  // Are we compiling a method?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
  bool has_method() { return method() != NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
  // Maybe print some information about this compile.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
  void print_compile_messages();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
  // Final graph reshaping, a post-pass after the regular optimizer is done.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
  bool final_graph_reshaping();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
  // returns true if adr is completely contained in the given alias category
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
  bool must_alias(const TypePtr* adr, int alias_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
  // returns true if adr overlaps with the given alias category
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
  bool can_alias(const TypePtr* adr, int alias_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
  // Driver for converting compiler's IR into machine code bits
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
  void Output();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
  // Accessors for node bundling info.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
  Bundle* node_bundling(const Node *n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
  bool valid_bundle_info(const Node *n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
  // Schedule and Bundle the instructions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
  void ScheduleAndBundle();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
  // Build OopMaps for each GC point
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
  void BuildOopMaps();
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   960
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   961
  // Append debug info for the node "local" at safepoint node "sfpt" to the
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   962
  // "array",   May also consult and add to "objs", which describes the
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   963
  // scalar-replaced objects.
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   964
  void FillLocArray( int idx, MachSafePointNode* sfpt,
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   965
                     Node *local, GrowableArray<ScopeValue*> *array,
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   966
                     GrowableArray<ScopeValue*> *objs );
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   967
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   968
  // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   969
  static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   970
  // Requres that "objs" does not contains an ObjectValue whose id matches
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   971
  // that of "sv.  Appends "sv".
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   972
  static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 211
diff changeset
   973
                                     ObjectValue* sv );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
  // Process an OopMap Element while emitting nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
  void Process_OopMap_Node(MachNode *mach, int code_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
10264
6879f93d268d 7063629: use cbcond in C2 generated code on T4
kvn
parents: 9101
diff changeset
   978
  // Initialize code buffer
6879f93d268d 7063629: use cbcond in C2 generated code on T4
kvn
parents: 9101
diff changeset
   979
  CodeBuffer* init_buffer(uint* blk_starts);
6879f93d268d 7063629: use cbcond in C2 generated code on T4
kvn
parents: 9101
diff changeset
   980
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
  // Write out basic block data to code buffer
10264
6879f93d268d 7063629: use cbcond in C2 generated code on T4
kvn
parents: 9101
diff changeset
   982
  void fill_buffer(CodeBuffer* cb, uint* blk_starts);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
  // Determine which variable sized branches can be shortened
10264
6879f93d268d 7063629: use cbcond in C2 generated code on T4
kvn
parents: 9101
diff changeset
   985
  void shorten_branches(uint* blk_starts, int& code_size, int& reloc_size, int& stub_size);
6879f93d268d 7063629: use cbcond in C2 generated code on T4
kvn
parents: 9101
diff changeset
   986
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
  // Compute the size of first NumberOfLoopInstrToAlign instructions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
  // at the head of a loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
  void compute_loop_first_inst_sizes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
  // Compute the information for the exception tables
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
  void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
  // Stack slots that may be unused by the calling convention but must
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
  // otherwise be preserved.  On Intel this includes the return address.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
  // On PowerPC it includes the 4 words holding the old TOC & LR glue.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
  uint in_preserve_stack_slots();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
  // "Top of Stack" slots that may be unused by the calling convention but must
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
  // otherwise be preserved.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
  // On Intel these are not necessary and the value can be zero.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
  // On Sparc this describes the words reserved for storing a register window
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
  // when an interrupt occurs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
  static uint out_preserve_stack_slots();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
  // Number of outgoing stack slots killed above the out_preserve_stack_slots
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
  // for calls to C.  Supports the var-args backing area for register parms.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
  uint varargs_C_out_slots_killed() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
  // Number of Stack Slots consumed by a synchronization entry
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
  int sync_stack_slots() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
  // Compute the name of old_SP.  See <arch>.ad for frame layout.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
  OptoReg::Name compute_old_SP();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
#ifdef ENABLE_ZAP_DEAD_LOCALS
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
  static bool is_node_getting_a_safepoint(Node*);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
  void Insert_zap_nodes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
  Node* call_zap_node(MachSafePointNode* n, int block_no);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
 private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1023
  // Phase control:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
  void Init(int aliaslevel);                     // Prepare for a single compilation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
  int  Inline_Warm();                            // Find more inlining work.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
  void Finish_Warm();                            // Give up on further inlines.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
  void Optimize();                               // Given a graph, optimize it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
  void Code_Gen();                               // Generate code from a graph
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
  // Management of the AliasType table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
  void grow_alias_types();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
  AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
  const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
8725
8c1e3dd5fe1b 7017732: move static fields into Class to prepare for perm gen removal
never
parents: 7433
diff changeset
  1034
  AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
  void verify_top(Node*) const PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
  // Intrinsic setup.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
  void           register_library_intrinsics();                            // initializer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
  CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual);          // constructor
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
  int            intrinsic_insertion_index(ciMethod* m, bool is_virtual);  // helper
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
  CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual);             // query fn
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
  void           register_intrinsic(CallGenerator* cg);                    // update fn
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
  static juint  _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
  static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
#endif
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
  1049
  // Function calls made by the public function final_graph_reshaping.
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
  1050
  // No need to be made public as they are not called elsewhere.
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
  1051
  void final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc);
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
  1052
  void final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc );
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 14126
diff changeset
  1053
  void eliminate_redundant_card_marks(Node* n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
  // Note:  Histogram array size is about 1 Kb.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
  enum {                        // flag bits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
    _intrinsic_worked = 1,      // succeeded at least once
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
    _intrinsic_failed = 2,      // tried it but it failed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
    _intrinsic_disabled = 4,    // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
    _intrinsic_virtual = 8,     // was seen in the virtual form (rare)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
    _intrinsic_both = 16        // was seen in the non-virtual form (usual)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
  // Update histogram.  Return boolean if this is a first-time occurrence.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
  static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
                                          bool is_virtual, int flags) PRODUCT_RETURN0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
  static void print_intrinsic_statistics() PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
  // Graph verification code
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
  // Walk the node list, verifying that there is a one-to-one
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
  // correspondence between Use-Def edges and Def-Use edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
  // The option no_dead_code enables stronger checks that the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
  // graph is strongly connected from root in both directions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
  void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
  // End-of-run dumps.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
  static void print_statistics() PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
  // Dump formatted assembly
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
  void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
  void dump_pc(int *pcs, int pc_limit, Node *n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
  // Verify ADLC assumptions during startup
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
  static void adlc_verification() PRODUCT_RETURN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
  // Definitions of pd methods
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
  static void pd_compiler2_init();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
};
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
  1090
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5914
diff changeset
  1091
#endif // SHARE_VM_OPTO_COMPILE_HPP