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