1071 void process_print_inlining();
1072 void dump_print_inlining();
1073
1074 bool over_inlining_cutoff() const {
1075 if (!inlining_incrementally()) {
1076 return unique() > (uint)NodeCountInliningCutoff;
1077 } else {
1078 return live_nodes() > (uint)LiveNodeCountInliningCutoff;
1079 }
1080 }
1081
1082 void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
1083 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--; }
1084 bool has_mh_late_inlines() const { return _number_of_mh_late_inlines > 0; }
1085
1086 void inline_incrementally_one(PhaseIterGVN& igvn);
1087 void inline_incrementally(PhaseIterGVN& igvn);
1088 void inline_string_calls(bool parse_time);
1089 void inline_boxing_calls(PhaseIterGVN& igvn);
1090 bool optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode);
1091
1092 // Matching, CFG layout, allocation, code generation
1093 PhaseCFG* cfg() { return _cfg; }
1094 bool select_24_bit_instr() const { return _select_24_bit_instr; }
1095 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
1096 bool has_java_calls() const { return _java_calls > 0; }
1097 int java_calls() const { return _java_calls; }
1098 int inner_loops() const { return _inner_loops; }
1099 Matcher* matcher() { return _matcher; }
1100 PhaseRegAlloc* regalloc() { return _regalloc; }
1101 int frame_slots() const { return _frame_slots; }
1102 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
1103 int frame_size_in_bytes() const { return _frame_slots << LogBytesPerInt; }
1104 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
1105 Arena* indexSet_arena() { return _indexSet_arena; }
1106 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
1107 uint node_bundling_limit() { return _node_bundling_limit; }
1108 Bundle* node_bundling_base() { return _node_bundling_base; }
1109 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
1110 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
|
1071 void process_print_inlining();
1072 void dump_print_inlining();
1073
1074 bool over_inlining_cutoff() const {
1075 if (!inlining_incrementally()) {
1076 return unique() > (uint)NodeCountInliningCutoff;
1077 } else {
1078 return live_nodes() > (uint)LiveNodeCountInliningCutoff;
1079 }
1080 }
1081
1082 void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
1083 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--; }
1084 bool has_mh_late_inlines() const { return _number_of_mh_late_inlines > 0; }
1085
1086 void inline_incrementally_one(PhaseIterGVN& igvn);
1087 void inline_incrementally(PhaseIterGVN& igvn);
1088 void inline_string_calls(bool parse_time);
1089 void inline_boxing_calls(PhaseIterGVN& igvn);
1090 bool optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode);
1091 void remove_root_to_sfpts_edges();
1092
1093 // Matching, CFG layout, allocation, code generation
1094 PhaseCFG* cfg() { return _cfg; }
1095 bool select_24_bit_instr() const { return _select_24_bit_instr; }
1096 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
1097 bool has_java_calls() const { return _java_calls > 0; }
1098 int java_calls() const { return _java_calls; }
1099 int inner_loops() const { return _inner_loops; }
1100 Matcher* matcher() { return _matcher; }
1101 PhaseRegAlloc* regalloc() { return _regalloc; }
1102 int frame_slots() const { return _frame_slots; }
1103 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
1104 int frame_size_in_bytes() const { return _frame_slots << LogBytesPerInt; }
1105 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
1106 Arena* indexSet_arena() { return _indexSet_arena; }
1107 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
1108 uint node_bundling_limit() { return _node_bundling_limit; }
1109 Bundle* node_bundling_base() { return _node_bundling_base; }
1110 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
1111 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
|