Fri, 01 Feb 2013 03:02:01 -0800
8005439: no message about inline method if it specifed by CompileCommand
Reviewed-by: kvn, vlivanov
Contributed-by: Igor Ignatyev <igor.ignatyev@oracle.com>
1 /*
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #ifndef SHARE_VM_OPTO_PARSE_HPP
26 #define SHARE_VM_OPTO_PARSE_HPP
28 #include "ci/ciMethodData.hpp"
29 #include "ci/ciTypeFlow.hpp"
30 #include "compiler/methodLiveness.hpp"
31 #include "libadt/vectset.hpp"
32 #include "oops/generateOopMap.hpp"
33 #include "opto/graphKit.hpp"
34 #include "opto/subnode.hpp"
36 class BytecodeParseHistogram;
37 class InlineTree;
38 class Parse;
39 class SwitchRange;
42 //------------------------------InlineTree-------------------------------------
43 class InlineTree : public ResourceObj {
44 friend class VMStructs;
46 Compile* C; // cache
47 JVMState* _caller_jvms; // state of caller
48 ciMethod* _method; // method being called by the caller_jvms
49 InlineTree* _caller_tree;
50 uint _count_inline_bcs; // Accumulated count of inlined bytecodes
51 // Call-site count / interpreter invocation count, scaled recursively.
52 // Always between 0.0 and 1.0. Represents the percentage of the method's
53 // total execution time used at this call site.
54 const float _site_invoke_ratio;
55 const int _max_inline_level; // the maximum inline level for this sub-tree (may be adjusted)
56 float compute_callee_frequency( int caller_bci ) const;
58 GrowableArray<InlineTree*> _subtrees;
60 void print_impl(outputStream* stj, int indent) const PRODUCT_RETURN;
62 protected:
63 InlineTree(Compile* C,
64 const InlineTree* caller_tree,
65 ciMethod* callee_method,
66 JVMState* caller_jvms,
67 int caller_bci,
68 float site_invoke_ratio,
69 int max_inline_level);
70 InlineTree *build_inline_tree_for_callee(ciMethod* callee_method,
71 JVMState* caller_jvms,
72 int caller_bci);
73 const char* try_to_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result, bool& should_delay);
74 const char* should_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) const;
75 const char* should_not_inline(ciMethod* callee_method, ciMethod* caller_method, WarmCallInfo* wci_result) const;
76 void print_inlining(ciMethod* callee_method, int caller_bci,
77 const char* msg, bool success) const;
79 InlineTree *caller_tree() const { return _caller_tree; }
80 InlineTree* callee_at(int bci, ciMethod* m) const;
81 int inline_level() const { return stack_depth(); }
82 int stack_depth() const { return _caller_jvms ? _caller_jvms->depth() : 0; }
84 public:
85 static const char* check_can_parse(ciMethod* callee);
87 static InlineTree* build_inline_tree_root();
88 static InlineTree* find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee);
90 // For temporary (stack-allocated, stateless) ilts:
91 InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, float site_invoke_ratio, int max_inline_level);
93 // InlineTree enum
94 enum InlineStyle {
95 Inline_do_not_inline = 0, //
96 Inline_cha_is_monomorphic = 1, //
97 Inline_type_profile_monomorphic = 2 //
98 };
100 // See if it is OK to inline.
101 // The receiver is the inline tree for the caller.
102 //
103 // The result is a temperature indication. If it is hot or cold,
104 // inlining is immediate or undesirable. Otherwise, the info block
105 // returned is newly allocated and may be enqueued.
106 //
107 // If the method is inlinable, a new inline subtree is created on the fly,
108 // and may be accessed by find_subtree_from_root.
109 // The call_method is the dest_method for a special or static invocation.
110 // The call_method is an optimized virtual method candidate otherwise.
111 WarmCallInfo* ok_to_inline(ciMethod *call_method, JVMState* caller_jvms, ciCallProfile& profile, WarmCallInfo* wci, bool& should_delay);
113 // Information about inlined method
114 JVMState* caller_jvms() const { return _caller_jvms; }
115 ciMethod *method() const { return _method; }
116 int caller_bci() const { return _caller_jvms ? _caller_jvms->bci() : InvocationEntryBci; }
117 uint count_inline_bcs() const { return _count_inline_bcs; }
118 float site_invoke_ratio() const { return _site_invoke_ratio; };
120 #ifndef PRODUCT
121 private:
122 uint _count_inlines; // Count of inlined methods
123 public:
124 // Debug information collected during parse
125 uint count_inlines() const { return _count_inlines; };
126 #endif
127 GrowableArray<InlineTree*> subtrees() { return _subtrees; }
129 void print_value_on(outputStream* st) const PRODUCT_RETURN;
130 };
133 //-----------------------------------------------------------------------------
134 //------------------------------Parse------------------------------------------
135 // Parse bytecodes, build a Graph
136 class Parse : public GraphKit {
137 public:
138 // Per-block information needed by the parser:
139 class Block {
140 private:
141 ciTypeFlow::Block* _flow;
142 int _pred_count; // how many predecessors in CFG?
143 int _preds_parsed; // how many of these have been parsed?
144 uint _count; // how many times executed? Currently only set by _goto's
145 bool _is_parsed; // has this block been parsed yet?
146 bool _is_handler; // is this block an exception handler?
147 bool _has_merged_backedge; // does this block have merged backedge?
148 SafePointNode* _start_map; // all values flowing into this block
149 MethodLivenessResult _live_locals; // lazily initialized liveness bitmap
151 int _num_successors; // Includes only normal control flow.
152 int _all_successors; // Include exception paths also.
153 Block** _successors;
155 // Use init_node/init_graph to initialize Blocks.
156 // Block() : _live_locals((uintptr_t*)NULL,0) { ShouldNotReachHere(); }
157 Block() : _live_locals(NULL,0) { ShouldNotReachHere(); }
159 public:
161 // Set up the block data structure itself.
162 void init_node(Parse* outer, int po);
163 // Set up the block's relations to other blocks.
164 void init_graph(Parse* outer);
166 ciTypeFlow::Block* flow() const { return _flow; }
167 int pred_count() const { return _pred_count; }
168 int preds_parsed() const { return _preds_parsed; }
169 bool is_parsed() const { return _is_parsed; }
170 bool is_handler() const { return _is_handler; }
171 void set_count( uint x ) { _count = x; }
172 uint count() const { return _count; }
174 SafePointNode* start_map() const { assert(is_merged(),""); return _start_map; }
175 void set_start_map(SafePointNode* m) { assert(!is_merged(), ""); _start_map = m; }
177 // True after any predecessor flows control into this block
178 bool is_merged() const { return _start_map != NULL; }
180 #ifdef ASSERT
181 // True after backedge predecessor flows control into this block
182 bool has_merged_backedge() const { return _has_merged_backedge; }
183 void mark_merged_backedge(Block* pred) {
184 assert(is_SEL_head(), "should be loop head");
185 if (pred != NULL && is_SEL_backedge(pred)) {
186 assert(is_parsed(), "block should be parsed before merging backedges");
187 _has_merged_backedge = true;
188 }
189 }
190 #endif
192 // True when all non-exception predecessors have been parsed.
193 bool is_ready() const { return preds_parsed() == pred_count(); }
195 int num_successors() const { return _num_successors; }
196 int all_successors() const { return _all_successors; }
197 Block* successor_at(int i) const {
198 assert((uint)i < (uint)all_successors(), "");
199 return _successors[i];
200 }
201 Block* successor_for_bci(int bci);
203 int start() const { return flow()->start(); }
204 int limit() const { return flow()->limit(); }
205 int rpo() const { return flow()->rpo(); }
206 int start_sp() const { return flow()->stack_size(); }
208 bool is_loop_head() const { return flow()->is_loop_head(); }
209 bool is_SEL_head() const { return flow()->is_single_entry_loop_head(); }
210 bool is_SEL_backedge(Block* pred) const{ return is_SEL_head() && pred->rpo() >= rpo(); }
211 bool is_invariant_local(uint i) const {
212 const JVMState* jvms = start_map()->jvms();
213 if (!jvms->is_loc(i) || flow()->outer()->has_irreducible_entry()) return false;
214 return flow()->is_invariant_local(i - jvms->locoff());
215 }
216 bool can_elide_SEL_phi(uint i) const { assert(is_SEL_head(),""); return is_invariant_local(i); }
218 const Type* peek(int off=0) const { return stack_type_at(start_sp() - (off+1)); }
220 const Type* stack_type_at(int i) const;
221 const Type* local_type_at(int i) const;
222 static const Type* get_type(ciType* t) { return Type::get_typeflow_type(t); }
224 bool has_trap_at(int bci) const { return flow()->has_trap() && flow()->trap_bci() == bci; }
226 // Call this just before parsing a block.
227 void mark_parsed() {
228 assert(!_is_parsed, "must parse each block exactly once");
229 _is_parsed = true;
230 }
232 // Return the phi/region input index for the "current" pred,
233 // and bump the pred number. For historical reasons these index
234 // numbers are handed out in descending order. The last index is
235 // always PhiNode::Input (i.e., 1). The value returned is known
236 // as a "path number" because it distinguishes by which path we are
237 // entering the block.
238 int next_path_num() {
239 assert(preds_parsed() < pred_count(), "too many preds?");
240 return pred_count() - _preds_parsed++;
241 }
243 // Add a previously unaccounted predecessor to this block.
244 // This operates by increasing the size of the block's region
245 // and all its phi nodes (if any). The value returned is a
246 // path number ("pnum").
247 int add_new_path();
249 // Initialize me by recording the parser's map. My own map must be NULL.
250 void record_state(Parse* outer);
251 };
253 #ifndef PRODUCT
254 // BytecodeParseHistogram collects number of bytecodes parsed, nodes constructed, and transformations.
255 class BytecodeParseHistogram : public ResourceObj {
256 private:
257 enum BPHType {
258 BPH_transforms,
259 BPH_values
260 };
261 static bool _initialized;
262 static uint _bytecodes_parsed [Bytecodes::number_of_codes];
263 static uint _nodes_constructed[Bytecodes::number_of_codes];
264 static uint _nodes_transformed[Bytecodes::number_of_codes];
265 static uint _new_values [Bytecodes::number_of_codes];
267 Bytecodes::Code _initial_bytecode;
268 int _initial_node_count;
269 int _initial_transforms;
270 int _initial_values;
272 Parse *_parser;
273 Compile *_compiler;
275 // Initialization
276 static void reset();
278 // Return info being collected, select with global flag 'BytecodeParseInfo'
279 int current_count(BPHType info_selector);
281 public:
282 BytecodeParseHistogram(Parse *p, Compile *c);
283 static bool initialized();
285 // Record info when starting to parse one bytecode
286 void set_initial_state( Bytecodes::Code bc );
287 // Record results of parsing one bytecode
288 void record_change();
290 // Profile printing
291 static void print(float cutoff = 0.01F); // cutoff in percent
292 };
294 public:
295 // Record work done during parsing
296 BytecodeParseHistogram* _parse_histogram;
297 void set_parse_histogram(BytecodeParseHistogram *bph) { _parse_histogram = bph; }
298 BytecodeParseHistogram* parse_histogram() { return _parse_histogram; }
299 #endif
301 private:
302 friend class Block;
304 // Variables which characterize this compilation as a whole:
306 JVMState* _caller; // JVMS which carries incoming args & state.
307 float _expected_uses; // expected number of calls to this code
308 float _prof_factor; // discount applied to my profile counts
309 int _depth; // Inline tree depth, for debug printouts
310 const TypeFunc*_tf; // My kind of function type
311 int _entry_bci; // the osr bci or InvocationEntryBci
313 ciTypeFlow* _flow; // Results of previous flow pass.
314 Block* _blocks; // Array of basic-block structs.
315 int _block_count; // Number of elements in _blocks.
317 GraphKit _exits; // Record all normal returns and throws here.
318 bool _wrote_final; // Did we write a final field?
319 bool _count_invocations; // update and test invocation counter
320 bool _method_data_update; // update method data oop
322 // Variables which track Java semantics during bytecode parsing:
324 Block* _block; // block currently getting parsed
325 ciBytecodeStream _iter; // stream of this method's bytecodes
327 int _blocks_merged; // Progress meter: state merges from BB preds
328 int _blocks_parsed; // Progress meter: BBs actually parsed
330 const FastLockNode* _synch_lock; // FastLockNode for synchronized method
332 #ifndef PRODUCT
333 int _max_switch_depth; // Debugging SwitchRanges.
334 int _est_switch_depth; // Debugging SwitchRanges.
335 #endif
337 public:
338 // Constructor
339 Parse(JVMState* caller, ciMethod* parse_method, float expected_uses);
341 virtual Parse* is_Parse() const { return (Parse*)this; }
343 public:
344 // Accessors.
345 JVMState* caller() const { return _caller; }
346 float expected_uses() const { return _expected_uses; }
347 float prof_factor() const { return _prof_factor; }
348 int depth() const { return _depth; }
349 const TypeFunc* tf() const { return _tf; }
350 // entry_bci() -- see osr_bci, etc.
352 ciTypeFlow* flow() const { return _flow; }
353 // blocks() -- see rpo_at, start_block, etc.
354 int block_count() const { return _block_count; }
356 GraphKit& exits() { return _exits; }
357 bool wrote_final() const { return _wrote_final; }
358 void set_wrote_final(bool z) { _wrote_final = z; }
359 bool count_invocations() const { return _count_invocations; }
360 bool method_data_update() const { return _method_data_update; }
362 Block* block() const { return _block; }
363 ciBytecodeStream& iter() { return _iter; }
364 Bytecodes::Code bc() const { return _iter.cur_bc(); }
366 void set_block(Block* b) { _block = b; }
368 // Derived accessors:
369 bool is_normal_parse() const { return _entry_bci == InvocationEntryBci; }
370 bool is_osr_parse() const { return _entry_bci != InvocationEntryBci; }
371 int osr_bci() const { assert(is_osr_parse(),""); return _entry_bci; }
373 void set_parse_bci(int bci);
375 // Must this parse be aborted?
376 bool failing() { return C->failing(); }
378 Block* rpo_at(int rpo) {
379 assert(0 <= rpo && rpo < _block_count, "oob");
380 return &_blocks[rpo];
381 }
382 Block* start_block() {
383 return rpo_at(flow()->start_block()->rpo());
384 }
385 // Can return NULL if the flow pass did not complete a block.
386 Block* successor_for_bci(int bci) {
387 return block()->successor_for_bci(bci);
388 }
390 private:
391 // Create a JVMS & map for the initial state of this method.
392 SafePointNode* create_entry_map();
394 // OSR helpers
395 Node *fetch_interpreter_state(int index, BasicType bt, Node *local_addrs, Node *local_addrs_base);
396 Node* check_interpreter_type(Node* l, const Type* type, SafePointNode* &bad_type_exit);
397 void load_interpreter_state(Node* osr_buf);
399 // Functions for managing basic blocks:
400 void init_blocks();
401 void load_state_from(Block* b);
402 void store_state_to(Block* b) { b->record_state(this); }
404 // Parse all the basic blocks.
405 void do_all_blocks();
407 // Parse the current basic block
408 void do_one_block();
410 // Raise an error if we get a bad ciTypeFlow CFG.
411 void handle_missing_successor(int bci);
413 // first actions (before BCI 0)
414 void do_method_entry();
416 // implementation of monitorenter/monitorexit
417 void do_monitor_enter();
418 void do_monitor_exit();
420 // Eagerly create phie throughout the state, to cope with back edges.
421 void ensure_phis_everywhere();
423 // Merge the current mapping into the basic block starting at bci
424 void merge( int target_bci);
425 // Same as plain merge, except that it allocates a new path number.
426 void merge_new_path( int target_bci);
427 // Merge the current mapping into an exception handler.
428 void merge_exception(int target_bci);
429 // Helper: Merge the current mapping into the given basic block
430 void merge_common(Block* target, int pnum);
431 // Helper functions for merging individual cells.
432 PhiNode *ensure_phi( int idx, bool nocreate = false);
433 PhiNode *ensure_memory_phi(int idx, bool nocreate = false);
434 // Helper to merge the current memory state into the given basic block
435 void merge_memory_edges(MergeMemNode* n, int pnum, bool nophi);
437 // Parse this bytecode, and alter the Parsers JVM->Node mapping
438 void do_one_bytecode();
440 // helper function to generate array store check
441 void array_store_check();
442 // Helper function to generate array load
443 void array_load(BasicType etype);
444 // Helper function to generate array store
445 void array_store(BasicType etype);
446 // Helper function to compute array addressing
447 Node* array_addressing(BasicType type, int vals, const Type* *result2=NULL);
449 // Pass current map to exits
450 void return_current(Node* value);
452 // Register finalizers on return from Object.<init>
453 void call_register_finalizer();
455 // Insert a compiler safepoint into the graph
456 void add_safepoint();
458 // Insert a compiler safepoint into the graph, if there is a back-branch.
459 void maybe_add_safepoint(int target_bci) {
460 if (UseLoopSafepoints && target_bci <= bci()) {
461 add_safepoint();
462 }
463 }
465 // Note: Intrinsic generation routines may be found in library_call.cpp.
467 // Helper function to setup Ideal Call nodes
468 void do_call();
470 // Helper function to uncommon-trap or bailout for non-compilable call-sites
471 bool can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass *klass);
473 // Helper function to setup for type-profile based inlining
474 bool prepare_type_profile_inline(ciInstanceKlass* prof_klass, ciMethod* prof_method);
476 // Helper functions for type checking bytecodes:
477 void do_checkcast();
478 void do_instanceof();
480 // Helper functions for shifting & arithmetic
481 void modf();
482 void modd();
483 void l2f();
485 void do_irem();
487 // implementation of _get* and _put* bytecodes
488 void do_getstatic() { do_field_access(true, false); }
489 void do_getfield () { do_field_access(true, true); }
490 void do_putstatic() { do_field_access(false, false); }
491 void do_putfield () { do_field_access(false, true); }
493 // common code for making initial checks and forming addresses
494 void do_field_access(bool is_get, bool is_field);
495 bool static_field_ok_in_clinit(ciField *field, ciMethod *method);
497 // common code for actually performing the load or store
498 void do_get_xxx(Node* obj, ciField* field, bool is_field);
499 void do_put_xxx(Node* obj, ciField* field, bool is_field);
501 // loading from a constant field or the constant pool
502 // returns false if push failed (non-perm field constants only, not ldcs)
503 bool push_constant(ciConstant con, bool require_constant = false);
505 // implementation of object creation bytecodes
506 void emit_guard_for_new(ciInstanceKlass* klass);
507 void do_new();
508 void do_newarray(BasicType elemtype);
509 void do_anewarray();
510 void do_multianewarray();
511 Node* expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs);
513 // implementation of jsr/ret
514 void do_jsr();
515 void do_ret();
517 float dynamic_branch_prediction(float &cnt);
518 float branch_prediction(float &cnt, BoolTest::mask btest, int target_bci);
519 bool seems_never_taken(float prob);
520 bool seems_stable_comparison(BoolTest::mask btest, Node* c);
522 void do_ifnull(BoolTest::mask btest, Node* c);
523 void do_if(BoolTest::mask btest, Node* c);
524 int repush_if_args();
525 void adjust_map_after_if(BoolTest::mask btest, Node* c, float prob,
526 Block* path, Block* other_path);
527 void sharpen_type_after_if(BoolTest::mask btest,
528 Node* con, const Type* tcon,
529 Node* val, const Type* tval);
530 IfNode* jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask);
531 Node* jump_if_join(Node* iffalse, Node* iftrue);
532 void jump_if_true_fork(IfNode *ifNode, int dest_bci_if_true, int prof_table_index);
533 void jump_if_false_fork(IfNode *ifNode, int dest_bci_if_false, int prof_table_index);
534 void jump_if_always_fork(int dest_bci_if_true, int prof_table_index);
536 friend class SwitchRange;
537 void do_tableswitch();
538 void do_lookupswitch();
539 void jump_switch_ranges(Node* a, SwitchRange* lo, SwitchRange* hi, int depth = 0);
540 bool create_jump_tables(Node* a, SwitchRange* lo, SwitchRange* hi);
542 // helper functions for methodData style profiling
543 void test_counter_against_threshold(Node* cnt, int limit);
544 void increment_and_test_invocation_counter(int limit);
545 void test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, int limit);
546 Node* method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize offset, Node* idx = NULL, uint stride = 0);
547 void increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, Node* idx = NULL, uint stride = 0);
548 void set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant);
550 void profile_method_entry();
551 void profile_taken_branch(int target_bci, bool force_update = false);
552 void profile_not_taken_branch(bool force_update = false);
553 void profile_call(Node* receiver);
554 void profile_generic_call();
555 void profile_receiver_type(Node* receiver);
556 void profile_ret(int target_bci);
557 void profile_null_checkcast();
558 void profile_switch_case(int table_index);
560 // helper function for call statistics
561 void count_compiled_calls(bool at_method_entry, bool is_inline) PRODUCT_RETURN;
563 Node_Notes* make_node_notes(Node_Notes* caller_nn);
565 // Helper functions for handling normal and abnormal exits.
566 void build_exits();
568 // Fix up all exceptional control flow exiting a single bytecode.
569 void do_exceptions();
571 // Fix up all exiting control flow at the end of the parse.
572 void do_exits();
574 // Add Catch/CatchProjs
575 // The call is either a Java call or the VM's rethrow stub
576 void catch_call_exceptions(ciExceptionHandlerStream&);
578 // Handle all exceptions thrown by the inlined method.
579 // Also handles exceptions for individual bytecodes.
580 void catch_inline_exceptions(SafePointNode* ex_map);
582 // Merge the given map into correct exceptional exit state.
583 // Assumes that there is no applicable local handler.
584 void throw_to_exit(SafePointNode* ex_map);
586 public:
587 #ifndef PRODUCT
588 // Handle PrintOpto, etc.
589 void show_parse_info();
590 void dump_map_adr_mem() const;
591 static void print_statistics(); // Print some performance counters
592 void dump();
593 void dump_bci(int bci);
594 #endif
595 };
597 #endif // SHARE_VM_OPTO_PARSE_HPP