Print this page
rev 1839 : 6961690: load oops from constant table on SPARC
Summary: oops should be loaded from the constant table of an nmethod instead of materializing them with a long code sequence.
Reviewed-by:
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/opto/compile.hpp
+++ new/src/share/vm/opto/compile.hpp
1 1 /*
2 2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
|
↓ open down ↓ |
22 lines elided |
↑ open up ↑ |
23 23 */
24 24
25 25 class Block;
26 26 class Bundle;
27 27 class C2Compiler;
28 28 class CallGenerator;
29 29 class ConnectionGraph;
30 30 class InlineTree;
31 31 class Int_Array;
32 32 class Matcher;
33 +class MachConstantNode;
34 +class MachConstantBaseNode;
33 35 class MachNode;
36 +class MachOper;
34 37 class MachSafePointNode;
35 38 class Node;
36 39 class Node_Array;
37 40 class Node_Notes;
38 41 class OptoReg;
39 42 class PhaseCFG;
40 43 class PhaseGVN;
41 44 class PhaseIterGVN;
42 45 class PhaseRegAlloc;
43 46 class PhaseCCP;
44 47 class PhaseCCP_DCE;
45 48 class RootNode;
46 49 class relocInfo;
47 50 class Scope;
48 51 class StartNode;
49 52 class SafePointNode;
50 53 class JVMState;
51 54 class TypeData;
52 55 class TypePtr;
53 56 class TypeFunc;
54 57 class Unique_Node_List;
55 58 class nmethod;
56 59 class WarmCallInfo;
57 60
58 61 //------------------------------Compile----------------------------------------
59 62 // This class defines a top-level Compiler invocation.
60 63
61 64 class Compile : public Phase {
62 65 public:
63 66 // Fixed alias indexes. (See also MergeMemNode.)
64 67 enum {
65 68 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
66 69 AliasIdxBot = 2, // pseudo-index, aliases to everything
67 70 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
68 71 };
69 72
70 73 // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
71 74 // Integrated with logging. If logging is turned on, and dolog is true,
72 75 // then brackets are put into the log, with time stamps and node counts.
73 76 // (The time collection itself is always conditionalized on TimeCompiler.)
74 77 class TracePhase : public TraceTime {
75 78 private:
76 79 Compile* C;
77 80 CompileLog* _log;
78 81 public:
79 82 TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
80 83 ~TracePhase();
81 84 };
82 85
83 86 // Information per category of alias (memory slice)
84 87 class AliasType {
85 88 private:
86 89 friend class Compile;
87 90
88 91 int _index; // unique index, used with MergeMemNode
89 92 const TypePtr* _adr_type; // normalized address type
90 93 ciField* _field; // relevant instance field, or null if none
91 94 bool _is_rewritable; // false if the memory is write-once only
92 95 int _general_index; // if this is type is an instance, the general
93 96 // type that this is an instance of
94 97
95 98 void Init(int i, const TypePtr* at);
96 99
97 100 public:
98 101 int index() const { return _index; }
99 102 const TypePtr* adr_type() const { return _adr_type; }
100 103 ciField* field() const { return _field; }
101 104 bool is_rewritable() const { return _is_rewritable; }
102 105 bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
103 106 int general_index() const { return (_general_index != 0) ? _general_index : _index; }
104 107
105 108 void set_rewritable(bool z) { _is_rewritable = z; }
106 109 void set_field(ciField* f) {
107 110 assert(!_field,"");
108 111 _field = f;
109 112 if (f->is_final()) _is_rewritable = false;
110 113 }
111 114
112 115 void print_on(outputStream* st) PRODUCT_RETURN;
113 116 };
|
↓ open down ↓ |
70 lines elided |
↑ open up ↑ |
114 117
115 118 enum {
116 119 logAliasCacheSize = 6,
117 120 AliasCacheSize = (1<<logAliasCacheSize)
118 121 };
119 122 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
120 123 enum {
121 124 trapHistLength = methodDataOopDesc::_trap_hist_limit
122 125 };
123 126
127 + // Constant entry of the constant table.
128 + class Constant {
129 + private:
130 + BasicType _type;
131 + jvalue _value;
132 + int _offset; // offset of this constant (in bytes) relative to the constant table base.
133 + bool _can_be_reused; // true (default) if the value can be shared with other users.
134 +
135 + public:
136 + Constant() : _type(T_ILLEGAL), _offset(-1), _can_be_reused(true) { _value.l = 0; }
137 + Constant(BasicType type, jvalue value, bool can_be_reused = true) :
138 + _type(type),
139 + _value(value),
140 + _offset(-1),
141 + _can_be_reused(can_be_reused)
142 + {}
143 +
144 + bool operator==(const Constant& other);
145 +
146 + BasicType type() const { return _type; }
147 +
148 + jlong get_jlong() const { return _value.j; }
149 + jfloat get_jfloat() const { return _value.f; }
150 + jdouble get_jdouble() const { return _value.d; }
151 + jobject get_jobject() const { return _value.l; }
152 +
153 + int offset() const { return _offset; }
154 + void set_offset(int offset) { _offset = offset; }
155 +
156 + bool can_be_reused() const { return _can_be_reused; }
157 + };
158 +
159 + // Constant table.
160 + class ConstantTable {
161 + private:
162 + GrowableArray<Constant> _constants; // Constants of this table.
163 + int _size; // Size in bytes the emitted constant table takes (including padding).
164 + int _table_base_offset; // Offset of the table base that gets added to the constant offsets.
165 +
166 + public:
167 + ConstantTable() :
168 + _size(-1),
169 + _table_base_offset(-1) // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit).
170 + {}
171 +
172 + int size() const { assert(_size != -1, "size not yet calculated"); return _size; }
173 +
174 + void set_table_base_offset(int x) { assert(_table_base_offset == -1, "set only once"); _table_base_offset = x; }
175 + int table_base_offset() const { assert(_table_base_offset != -1, "table base offset not yet set"); return _table_base_offset; }
176 +
177 + void emit(CodeBuffer& cb);
178 +
179 + // Returns the offset of the last entry (the top) of the constant table.
180 + int top_offset() const { assert(_constants.top().offset() != -1, "constant not yet bound"); return _constants.top().offset(); }
181 +
182 + void calculate_offsets_and_size();
183 + int find_offset(Constant& con) const;
184 +
185 + void add(Constant& con);
186 + Constant add(BasicType type, jvalue value);
187 + Constant add(MachOper* oper);
188 + Constant add(jfloat f) {
189 + jvalue value; value.f = f;
190 + return add(T_FLOAT, value);
191 + }
192 + Constant add(jdouble d) {
193 + jvalue value; value.d = d;
194 + return add(T_DOUBLE, value);
195 + }
196 +
197 + // Jump table
198 + Constant allocate_jump_table(MachConstantNode* n);
199 + void fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const;
200 + };
201 +
124 202 private:
125 203 // Fixed parameters to this compilation.
126 204 const int _compile_id;
127 205 const bool _save_argument_registers; // save/restore arg regs for trampolines
128 206 const bool _subsume_loads; // Load can be matched as part of a larger op.
129 207 const bool _do_escape_analysis; // Do escape analysis.
130 208 ciMethod* _method; // The method being compiled.
131 209 int _entry_bci; // entry bci for osr methods.
132 210 const TypeFunc* _tf; // My kind of signature
133 211 InlineTree* _ilt; // Ditto (temporary).
134 212 address _stub_function; // VM entry for stub being compiled, or NULL
135 213 const char* _stub_name; // Name of stub or adapter being compiled, or NULL
136 214 address _stub_entry_point; // Compile code entry for generated stub, or NULL
137 215
138 216 // Control of this compilation.
139 217 int _num_loop_opts; // Number of iterations for doing loop optimiztions
140 218 int _max_inline_size; // Max inline size for this compilation
141 219 int _freq_inline_size; // Max hot method inline size for this compilation
142 220 int _fixed_slots; // count of frame slots not allocated by the register
143 221 // allocator i.e. locks, original deopt pc, etc.
144 222 // For deopt
145 223 int _orig_pc_slot;
146 224 int _orig_pc_slot_offset_in_bytes;
147 225
148 226 int _major_progress; // Count of something big happening
149 227 bool _has_loops; // True if the method _may_ have some loops
150 228 bool _has_split_ifs; // True if the method _may_ have some split-if
151 229 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
152 230 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
153 231 uint _trap_hist[trapHistLength]; // Cumulative traps
154 232 bool _trap_can_recompile; // Have we emitted a recompiling trap?
155 233 uint _decompile_count; // Cumulative decompilation counts.
156 234 bool _do_inlining; // True if we intend to do inlining
157 235 bool _do_scheduling; // True if we intend to do scheduling
158 236 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
159 237 bool _do_count_invocations; // True if we generate code to count invocations
160 238 bool _do_method_data_update; // True if we generate code to update methodDataOops
161 239 int _AliasLevel; // Locally-adjusted version of AliasLevel flag.
162 240 bool _print_assembly; // True if we should dump assembly code for this compilation
163 241 #ifndef PRODUCT
164 242 bool _trace_opto_output;
165 243 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
166 244 #endif
167 245
168 246 // JSR 292
169 247 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
170 248
171 249 // Compilation environment.
172 250 Arena _comp_arena; // Arena with lifetime equivalent to Compile
173 251 ciEnv* _env; // CI interface
174 252 CompileLog* _log; // from CompilerThread
175 253 const char* _failure_reason; // for record_failure/failing pattern
176 254 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics.
177 255 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching.
178 256 GrowableArray<Node*>* _predicate_opaqs; // List of Opaque1 nodes for the loop predicates.
179 257 ConnectionGraph* _congraph;
180 258 #ifndef PRODUCT
181 259 IdealGraphPrinter* _printer;
182 260 #endif
183 261
184 262 // Node management
185 263 uint _unique; // Counter for unique Node indices
186 264 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
|
↓ open down ↓ |
53 lines elided |
↑ open up ↑ |
187 265 Arena _node_arena; // Arena for new-space Nodes
188 266 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
189 267 RootNode* _root; // Unique root of compilation, or NULL after bail-out.
190 268 Node* _top; // Unique top node. (Reset by various phases.)
191 269
192 270 Node* _immutable_memory; // Initial memory state
193 271
194 272 Node* _recent_alloc_obj;
195 273 Node* _recent_alloc_ctl;
196 274
275 + // Constant table
276 + ConstantTable _constant_table; // The constant table for this compile.
277 + MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton.
278 +
279 +
197 280 // Blocked array of debugging and profiling information,
198 281 // tracked per node.
199 282 enum { _log2_node_notes_block_size = 8,
200 283 _node_notes_block_size = (1<<_log2_node_notes_block_size)
201 284 };
202 285 GrowableArray<Node_Notes*>* _node_note_array;
203 286 Node_Notes* _default_node_notes; // default notes for new nodes
204 287
205 288 // After parsing and every bulk phase we hang onto the Root instruction.
206 289 // The RootNode instruction is where the whole program begins. It produces
207 290 // the initial Control and BOTTOM for everybody else.
208 291
209 292 // Type management
210 293 Arena _Compile_types; // Arena for all types
211 294 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
212 295 Dict* _type_dict; // Intern table
213 296 void* _type_hwm; // Last allocation (see Type::operator new/delete)
214 297 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
215 298 ciMethod* _last_tf_m; // Cache for
216 299 const TypeFunc* _last_tf; // TypeFunc::make
217 300 AliasType** _alias_types; // List of alias types seen so far.
218 301 int _num_alias_types; // Logical length of _alias_types
219 302 int _max_alias_types; // Physical length of _alias_types
220 303 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
221 304
222 305 // Parsing, optimization
223 306 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
224 307 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN
225 308 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining.
226 309
227 310 GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after
228 311 // main parsing has finished.
229 312
230 313 // Matching, CFG layout, allocation, code generation
231 314 PhaseCFG* _cfg; // Results of CFG finding
232 315 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
233 316 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
234 317 int _java_calls; // Number of java calls in the method
235 318 int _inner_loops; // Number of inner loops in the method
236 319 Matcher* _matcher; // Engine to map ideal to machine instructions
237 320 PhaseRegAlloc* _regalloc; // Results of register allocation.
238 321 int _frame_slots; // Size of total frame in stack slots
239 322 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries
240 323 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
241 324 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
242 325 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
243 326
244 327 uint _node_bundling_limit;
245 328 Bundle* _node_bundling_base; // Information for instruction bundling
246 329
|
↓ open down ↓ |
40 lines elided |
↑ open up ↑ |
247 330 // Instruction bits passed off to the VM
248 331 int _method_size; // Size of nmethod code segment in bytes
249 332 CodeBuffer _code_buffer; // Where the code is assembled
250 333 int _first_block_size; // Size of unvalidated entry point code / OSR poison code
251 334 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers
252 335 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code
253 336 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location)
254 337 static int _CompiledZap_count; // counter compared against CompileZap[First/Last]
255 338 BufferBlob* _scratch_buffer_blob; // For temporary code buffers.
256 339 relocInfo* _scratch_locs_memory; // For temporary code buffers.
340 + int _scratch_const_size; // For temporary code buffers.
341 + bool _in_scratch_emit_size; // true when in scratch_emit_size.
257 342
258 343 public:
259 344 // Accessors
260 345
261 346 // The Compile instance currently active in this (compiler) thread.
262 347 static Compile* current() {
263 348 return (Compile*) ciEnv::current()->compiler_data();
264 349 }
265 350
266 351 // ID for this compilation. Useful for setting breakpoints in the debugger.
267 352 int compile_id() const { return _compile_id; }
268 353
269 354 // Does this compilation allow instructions to subsume loads? User
270 355 // instructions that subsume a load may result in an unschedulable
271 356 // instruction sequence.
272 357 bool subsume_loads() const { return _subsume_loads; }
273 358 // Do escape analysis.
274 359 bool do_escape_analysis() const { return _do_escape_analysis; }
275 360 bool save_argument_registers() const { return _save_argument_registers; }
276 361
277 362
278 363 // Other fixed compilation parameters.
279 364 ciMethod* method() const { return _method; }
280 365 int entry_bci() const { return _entry_bci; }
281 366 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
282 367 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
283 368 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; }
284 369 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; }
285 370 InlineTree* ilt() const { return _ilt; }
286 371 address stub_function() const { return _stub_function; }
287 372 const char* stub_name() const { return _stub_name; }
288 373 address stub_entry_point() const { return _stub_entry_point; }
289 374
290 375 // Control of this compilation.
291 376 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
292 377 void set_fixed_slots(int n) { _fixed_slots = n; }
293 378 int major_progress() const { return _major_progress; }
294 379 void set_major_progress() { _major_progress++; }
295 380 void clear_major_progress() { _major_progress = 0; }
296 381 int num_loop_opts() const { return _num_loop_opts; }
297 382 void set_num_loop_opts(int n) { _num_loop_opts = n; }
298 383 int max_inline_size() const { return _max_inline_size; }
299 384 void set_freq_inline_size(int n) { _freq_inline_size = n; }
300 385 int freq_inline_size() const { return _freq_inline_size; }
301 386 void set_max_inline_size(int n) { _max_inline_size = n; }
302 387 bool has_loops() const { return _has_loops; }
303 388 void set_has_loops(bool z) { _has_loops = z; }
304 389 bool has_split_ifs() const { return _has_split_ifs; }
305 390 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
306 391 bool has_unsafe_access() const { return _has_unsafe_access; }
307 392 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
308 393 bool has_stringbuilder() const { return _has_stringbuilder; }
309 394 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
310 395 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
311 396 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
312 397 bool trap_can_recompile() const { return _trap_can_recompile; }
313 398 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
314 399 uint decompile_count() const { return _decompile_count; }
315 400 void set_decompile_count(uint c) { _decompile_count = c; }
316 401 bool allow_range_check_smearing() const;
317 402 bool do_inlining() const { return _do_inlining; }
318 403 void set_do_inlining(bool z) { _do_inlining = z; }
319 404 bool do_scheduling() const { return _do_scheduling; }
320 405 void set_do_scheduling(bool z) { _do_scheduling = z; }
321 406 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
322 407 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
323 408 bool do_count_invocations() const{ return _do_count_invocations; }
324 409 void set_do_count_invocations(bool z){ _do_count_invocations = z; }
325 410 bool do_method_data_update() const { return _do_method_data_update; }
326 411 void set_do_method_data_update(bool z) { _do_method_data_update = z; }
327 412 int AliasLevel() const { return _AliasLevel; }
328 413 bool print_assembly() const { return _print_assembly; }
329 414 void set_print_assembly(bool z) { _print_assembly = z; }
330 415 // check the CompilerOracle for special behaviours for this compile
331 416 bool method_has_option(const char * option) {
332 417 return method() != NULL && method()->has_option(option);
333 418 }
334 419 #ifndef PRODUCT
335 420 bool trace_opto_output() const { return _trace_opto_output; }
336 421 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
337 422 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
338 423 #endif
339 424
340 425 // JSR 292
341 426 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
342 427 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; }
343 428
344 429 void begin_method() {
345 430 #ifndef PRODUCT
346 431 if (_printer) _printer->begin_method(this);
347 432 #endif
348 433 }
349 434 void print_method(const char * name, int level = 1) {
350 435 #ifndef PRODUCT
351 436 if (_printer) _printer->print_method(this, name, level);
352 437 #endif
353 438 }
354 439 void end_method() {
355 440 #ifndef PRODUCT
356 441 if (_printer) _printer->end_method();
357 442 #endif
358 443 }
359 444
360 445 int macro_count() { return _macro_nodes->length(); }
361 446 int predicate_count() { return _predicate_opaqs->length();}
362 447 Node* macro_node(int idx) { return _macro_nodes->at(idx); }
363 448 Node* predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);}
364 449 ConnectionGraph* congraph() { return _congraph;}
365 450 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
366 451 void add_macro_node(Node * n) {
367 452 //assert(n->is_macro(), "must be a macro node");
368 453 assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
369 454 _macro_nodes->append(n);
370 455 }
371 456 void remove_macro_node(Node * n) {
372 457 // this function may be called twice for a node so check
373 458 // that the node is in the array before attempting to remove it
374 459 if (_macro_nodes->contains(n))
375 460 _macro_nodes->remove(n);
376 461 // remove from _predicate_opaqs list also if it is there
377 462 if (predicate_count() > 0 && _predicate_opaqs->contains(n)){
378 463 _predicate_opaqs->remove(n);
379 464 }
380 465 }
381 466 void add_predicate_opaq(Node * n) {
382 467 assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1");
383 468 assert(_macro_nodes->contains(n), "should have already been in macro list");
384 469 _predicate_opaqs->append(n);
385 470 }
386 471 // remove the opaque nodes that protect the predicates so that the unused checks and
387 472 // uncommon traps will be eliminated from the graph.
388 473 void cleanup_loop_predicates(PhaseIterGVN &igvn);
389 474
390 475 // Compilation environment.
391 476 Arena* comp_arena() { return &_comp_arena; }
392 477 ciEnv* env() const { return _env; }
393 478 CompileLog* log() const { return _log; }
394 479 bool failing() const { return _env->failing() || _failure_reason != NULL; }
395 480 const char* failure_reason() { return _failure_reason; }
396 481 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
397 482
398 483 void record_failure(const char* reason);
399 484 void record_method_not_compilable(const char* reason, bool all_tiers = false) {
400 485 // All bailouts cover "all_tiers" when TieredCompilation is off.
401 486 if (!TieredCompilation) all_tiers = true;
402 487 env()->record_method_not_compilable(reason, all_tiers);
403 488 // Record failure reason.
404 489 record_failure(reason);
405 490 }
406 491 void record_method_not_compilable_all_tiers(const char* reason) {
407 492 record_method_not_compilable(reason, true);
408 493 }
409 494 bool check_node_count(uint margin, const char* reason) {
410 495 if (unique() + margin > (uint)MaxNodeLimit) {
411 496 record_method_not_compilable(reason);
412 497 return true;
413 498 } else {
414 499 return false;
415 500 }
416 501 }
417 502
418 503 // Node management
419 504 uint unique() const { return _unique; }
420 505 uint next_unique() { return _unique++; }
421 506 void set_unique(uint i) { _unique = i; }
422 507 static int debug_idx() { return debug_only(_debug_idx)+0; }
423 508 static void set_debug_idx(int i) { debug_only(_debug_idx = i); }
424 509 Arena* node_arena() { return &_node_arena; }
425 510 Arena* old_arena() { return &_old_arena; }
426 511 RootNode* root() const { return _root; }
427 512 void set_root(RootNode* r) { _root = r; }
428 513 StartNode* start() const; // (Derived from root.)
|
↓ open down ↓ |
162 lines elided |
↑ open up ↑ |
429 514 void init_start(StartNode* s);
430 515 Node* immutable_memory();
431 516
432 517 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
433 518 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
434 519 void set_recent_alloc(Node* ctl, Node* obj) {
435 520 _recent_alloc_ctl = ctl;
436 521 _recent_alloc_obj = obj;
437 522 }
438 523
524 + // Constant table
525 + ConstantTable& constant_table() { return _constant_table; }
526 +
527 + MachConstantBaseNode* mach_constant_base_node();
528 + bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
529 +
439 530 // Handy undefined Node
440 531 Node* top() const { return _top; }
441 532
442 533 // these are used by guys who need to know about creation and transformation of top:
443 534 Node* cached_top_node() { return _top; }
444 535 void set_cached_top_node(Node* tn);
445 536
446 537 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
447 538 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
448 539 Node_Notes* default_node_notes() const { return _default_node_notes; }
449 540 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
450 541
451 542 Node_Notes* node_notes_at(int idx) {
452 543 return locate_node_notes(_node_note_array, idx, false);
453 544 }
454 545 inline bool set_node_notes_at(int idx, Node_Notes* value);
455 546
456 547 // Copy notes from source to dest, if they exist.
457 548 // Overwrite dest only if source provides something.
458 549 // Return true if information was moved.
459 550 bool copy_node_notes_to(Node* dest, Node* source);
460 551
461 552 // Workhorse function to sort out the blocked Node_Notes array:
462 553 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
463 554 int idx, bool can_grow = false);
464 555
465 556 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
466 557
467 558 // Type management
468 559 Arena* type_arena() { return _type_arena; }
469 560 Dict* type_dict() { return _type_dict; }
470 561 void* type_hwm() { return _type_hwm; }
471 562 size_t type_last_size() { return _type_last_size; }
472 563 int num_alias_types() { return _num_alias_types; }
473 564
474 565 void init_type_arena() { _type_arena = &_Compile_types; }
475 566 void set_type_arena(Arena* a) { _type_arena = a; }
476 567 void set_type_dict(Dict* d) { _type_dict = d; }
477 568 void set_type_hwm(void* p) { _type_hwm = p; }
478 569 void set_type_last_size(size_t sz) { _type_last_size = sz; }
479 570
480 571 const TypeFunc* last_tf(ciMethod* m) {
481 572 return (m == _last_tf_m) ? _last_tf : NULL;
482 573 }
483 574 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
484 575 assert(m != NULL || tf == NULL, "");
485 576 _last_tf_m = m;
486 577 _last_tf = tf;
487 578 }
488 579
489 580 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
490 581 AliasType* alias_type(const TypePtr* adr_type) { return find_alias_type(adr_type, false); }
491 582 bool have_alias_type(const TypePtr* adr_type);
492 583 AliasType* alias_type(ciField* field);
493 584
494 585 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
495 586 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
496 587 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
497 588
498 589 // Building nodes
499 590 void rethrow_exceptions(JVMState* jvms);
500 591 void return_values(JVMState* jvms);
501 592 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
502 593
503 594 // Decide how to build a call.
504 595 // The profile factor is a discount to apply to this site's interp. profile.
505 596 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor);
506 597 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms);
507 598
508 599 // Report if there were too many traps at a current method and bci.
509 600 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
510 601 // If there is no MDO at all, report no trap unless told to assume it.
511 602 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
512 603 // This version, unspecific to a particular bci, asks if
513 604 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
514 605 bool too_many_traps(Deoptimization::DeoptReason reason,
515 606 // Privately used parameter for logging:
516 607 ciMethodData* logmd = NULL);
517 608 // Report if there were too many recompiles at a method and bci.
518 609 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
519 610
520 611 // Parsing, optimization
521 612 PhaseGVN* initial_gvn() { return _initial_gvn; }
522 613 Unique_Node_List* for_igvn() { return _for_igvn; }
523 614 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.
524 615 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
525 616 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
526 617
527 618 // Replace n by nn using initial_gvn, calling hash_delete and
528 619 // record_for_igvn as needed.
529 620 void gvn_replace_by(Node* n, Node* nn);
530 621
531 622
532 623 void identify_useful_nodes(Unique_Node_List &useful);
533 624 void remove_useless_nodes (Unique_Node_List &useful);
534 625
535 626 WarmCallInfo* warm_calls() const { return _warm_calls; }
536 627 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
537 628 WarmCallInfo* pop_warm_call();
538 629
539 630 // Record this CallGenerator for inlining at the end of parsing.
540 631 void add_late_inline(CallGenerator* cg) { _late_inlines.push(cg); }
541 632
542 633 // Matching, CFG layout, allocation, code generation
543 634 PhaseCFG* cfg() { return _cfg; }
544 635 bool select_24_bit_instr() const { return _select_24_bit_instr; }
545 636 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
546 637 bool has_java_calls() const { return _java_calls > 0; }
547 638 int java_calls() const { return _java_calls; }
548 639 int inner_loops() const { return _inner_loops; }
549 640 Matcher* matcher() { return _matcher; }
550 641 PhaseRegAlloc* regalloc() { return _regalloc; }
551 642 int frame_slots() const { return _frame_slots; }
552 643 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
553 644 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
554 645 Arena* indexSet_arena() { return _indexSet_arena; }
555 646 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
556 647 uint node_bundling_limit() { return _node_bundling_limit; }
557 648 Bundle* node_bundling_base() { return _node_bundling_base; }
558 649 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
559 650 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
560 651 bool starts_bundle(const Node *n) const;
561 652 bool need_stack_bang(int frame_size_in_bytes) const;
562 653 bool need_register_stack_bang() const;
563 654
564 655 void set_matcher(Matcher* m) { _matcher = m; }
565 656 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
566 657 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
567 658 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
568 659
569 660 // Remember if this compilation changes hardware mode to 24-bit precision
570 661 void set_24_bit_selection_and_mode(bool selection, bool mode) {
571 662 _select_24_bit_instr = selection;
572 663 _in_24_bit_fp_mode = mode;
573 664 }
574 665
575 666 void set_java_calls(int z) { _java_calls = z; }
576 667 void set_inner_loops(int z) { _inner_loops = z; }
577 668
578 669 // Instruction bits passed off to the VM
579 670 int code_size() { return _method_size; }
|
↓ open down ↓ |
131 lines elided |
↑ open up ↑ |
580 671 CodeBuffer* code_buffer() { return &_code_buffer; }
581 672 int first_block_size() { return _first_block_size; }
582 673 void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
583 674 ExceptionHandlerTable* handler_table() { return &_handler_table; }
584 675 ImplicitExceptionTable* inc_table() { return &_inc_table; }
585 676 OopMapSet* oop_map_set() { return _oop_map_set; }
586 677 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
587 678 Dependencies* dependencies() { return env()->dependencies(); }
588 679 static int CompiledZap_count() { return _CompiledZap_count; }
589 680 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; }
590 - void init_scratch_buffer_blob();
681 + void init_scratch_buffer_blob(int const_size);
682 + void clear_scratch_buffer_blob();
591 683 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
592 684 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; }
593 685 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; }
594 686
595 687 // emit to scratch blob, report resulting size
596 688 uint scratch_emit_size(const Node* n);
689 + void set_in_scratch_emit_size(bool x) { _in_scratch_emit_size = x; }
690 + bool in_scratch_emit_size() const { return _in_scratch_emit_size; }
597 691
598 692 enum ScratchBufferBlob {
599 693 MAX_inst_size = 1024,
600 694 MAX_locs_size = 128, // number of relocInfo elements
601 695 MAX_const_size = 128,
602 696 MAX_stubs_size = 128
603 697 };
604 698
605 699 // Major entry point. Given a Scope, compile the associated method.
606 700 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
607 701 // replacement, entry_bci indicates the bytecode for which to compile a
608 702 // continuation.
609 703 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
610 704 int entry_bci, bool subsume_loads, bool do_escape_analysis);
611 705
612 706 // Second major entry point. From the TypeFunc signature, generate code
613 707 // to pass arguments from the Java calling convention to the C calling
614 708 // convention.
615 709 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
616 710 address stub_function, const char *stub_name,
617 711 int is_fancy_jump, bool pass_tls,
618 712 bool save_arg_registers, bool return_pc);
619 713
620 714 // From the TypeFunc signature, generate code to pass arguments
621 715 // from Compiled calling convention to Interpreter's calling convention
622 716 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
623 717
624 718 // From the TypeFunc signature, generate code to pass arguments
625 719 // from Interpreter's calling convention to Compiler's calling convention
626 720 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
627 721
628 722 // Are we compiling a method?
629 723 bool has_method() { return method() != NULL; }
630 724
631 725 // Maybe print some information about this compile.
632 726 void print_compile_messages();
633 727
634 728 // Final graph reshaping, a post-pass after the regular optimizer is done.
635 729 bool final_graph_reshaping();
636 730
637 731 // returns true if adr is completely contained in the given alias category
638 732 bool must_alias(const TypePtr* adr, int alias_idx);
639 733
640 734 // returns true if adr overlaps with the given alias category
641 735 bool can_alias(const TypePtr* adr, int alias_idx);
642 736
643 737 // Driver for converting compiler's IR into machine code bits
644 738 void Output();
645 739
646 740 // Accessors for node bundling info.
647 741 Bundle* node_bundling(const Node *n);
648 742 bool valid_bundle_info(const Node *n);
649 743
650 744 // Schedule and Bundle the instructions
651 745 void ScheduleAndBundle();
652 746
653 747 // Build OopMaps for each GC point
654 748 void BuildOopMaps();
655 749
656 750 // Append debug info for the node "local" at safepoint node "sfpt" to the
657 751 // "array", May also consult and add to "objs", which describes the
658 752 // scalar-replaced objects.
659 753 void FillLocArray( int idx, MachSafePointNode* sfpt,
660 754 Node *local, GrowableArray<ScopeValue*> *array,
661 755 GrowableArray<ScopeValue*> *objs );
662 756
663 757 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
664 758 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
665 759 // Requres that "objs" does not contains an ObjectValue whose id matches
666 760 // that of "sv. Appends "sv".
|
↓ open down ↓ |
60 lines elided |
↑ open up ↑ |
667 761 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
668 762 ObjectValue* sv );
669 763
670 764 // Process an OopMap Element while emitting nodes
671 765 void Process_OopMap_Node(MachNode *mach, int code_offset);
672 766
673 767 // Write out basic block data to code buffer
674 768 void Fill_buffer();
675 769
676 770 // Determine which variable sized branches can be shortened
677 - void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size, int& const_size);
771 + void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size);
678 772
679 773 // Compute the size of first NumberOfLoopInstrToAlign instructions
680 774 // at the head of a loop.
681 775 void compute_loop_first_inst_sizes();
682 776
683 777 // Compute the information for the exception tables
684 778 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
685 779
686 780 // Stack slots that may be unused by the calling convention but must
687 781 // otherwise be preserved. On Intel this includes the return address.
688 782 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
689 783 uint in_preserve_stack_slots();
690 784
691 785 // "Top of Stack" slots that may be unused by the calling convention but must
692 786 // otherwise be preserved.
693 787 // On Intel these are not necessary and the value can be zero.
694 788 // On Sparc this describes the words reserved for storing a register window
695 789 // when an interrupt occurs.
696 790 static uint out_preserve_stack_slots();
697 791
698 792 // Number of outgoing stack slots killed above the out_preserve_stack_slots
699 793 // for calls to C. Supports the var-args backing area for register parms.
700 794 uint varargs_C_out_slots_killed() const;
701 795
702 796 // Number of Stack Slots consumed by a synchronization entry
703 797 int sync_stack_slots() const;
704 798
705 799 // Compute the name of old_SP. See <arch>.ad for frame layout.
706 800 OptoReg::Name compute_old_SP();
707 801
708 802 #ifdef ENABLE_ZAP_DEAD_LOCALS
709 803 static bool is_node_getting_a_safepoint(Node*);
710 804 void Insert_zap_nodes();
711 805 Node* call_zap_node(MachSafePointNode* n, int block_no);
712 806 #endif
713 807
714 808 private:
715 809 // Phase control:
716 810 void Init(int aliaslevel); // Prepare for a single compilation
717 811 int Inline_Warm(); // Find more inlining work.
718 812 void Finish_Warm(); // Give up on further inlines.
719 813 void Optimize(); // Given a graph, optimize it
720 814 void Code_Gen(); // Generate code from a graph
721 815
722 816 // Management of the AliasType table.
723 817 void grow_alias_types();
724 818 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
725 819 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
726 820 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create);
727 821
728 822 void verify_top(Node*) const PRODUCT_RETURN;
729 823
730 824 // Intrinsic setup.
731 825 void register_library_intrinsics(); // initializer
732 826 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
733 827 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper
734 828 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
735 829 void register_intrinsic(CallGenerator* cg); // update fn
736 830
737 831 #ifndef PRODUCT
738 832 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
739 833 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
740 834 #endif
741 835
742 836 public:
743 837
744 838 // Note: Histogram array size is about 1 Kb.
745 839 enum { // flag bits:
746 840 _intrinsic_worked = 1, // succeeded at least once
747 841 _intrinsic_failed = 2, // tried it but it failed
748 842 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
749 843 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
750 844 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
751 845 };
752 846 // Update histogram. Return boolean if this is a first-time occurrence.
753 847 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
754 848 bool is_virtual, int flags) PRODUCT_RETURN0;
755 849 static void print_intrinsic_statistics() PRODUCT_RETURN;
756 850
757 851 // Graph verification code
758 852 // Walk the node list, verifying that there is a one-to-one
759 853 // correspondence between Use-Def edges and Def-Use edges
760 854 // The option no_dead_code enables stronger checks that the
761 855 // graph is strongly connected from root in both directions.
762 856 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
763 857
764 858 // Print bytecodes, including the scope inlining tree
765 859 void print_codes();
766 860
767 861 // End-of-run dumps.
768 862 static void print_statistics() PRODUCT_RETURN;
769 863
770 864 // Dump formatted assembly
771 865 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
772 866 void dump_pc(int *pcs, int pc_limit, Node *n);
773 867
774 868 // Verify ADLC assumptions during startup
775 869 static void adlc_verification() PRODUCT_RETURN;
776 870
777 871 // Definitions of pd methods
778 872 static void pd_compiler2_init();
779 873 };
|
↓ open down ↓ |
92 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX