Mercurial > hg > graal-jvmci-8
annotate src/share/vm/opto/parse2.cpp @ 23614:32b682649973 jdk8u75-b04
8132051: Better byte behavior
Reviewed-by: coleenp, roland
| author | kevinw |
|---|---|
| date | Fri, 15 Jan 2016 22:33:15 +0000 |
| parents | eb8b5cc64669 |
| children | b5f3a471e646 d109bda16490 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 23614 | 2 * Copyright (c) 1998, 2016, 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:
1213
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1213
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:
1213
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
| 26 #include "ci/ciMethodData.hpp" | |
| 27 #include "classfile/systemDictionary.hpp" | |
| 28 #include "classfile/vmSymbols.hpp" | |
| 29 #include "compiler/compileLog.hpp" | |
| 30 #include "interpreter/linkResolver.hpp" | |
| 31 #include "memory/universe.inline.hpp" | |
| 32 #include "opto/addnode.hpp" | |
| 33 #include "opto/divnode.hpp" | |
| 34 #include "opto/idealGraphPrinter.hpp" | |
| 35 #include "opto/matcher.hpp" | |
| 36 #include "opto/memnode.hpp" | |
| 37 #include "opto/mulnode.hpp" | |
| 38 #include "opto/parse.hpp" | |
| 39 #include "opto/runtime.hpp" | |
| 40 #include "runtime/deoptimization.hpp" | |
| 41 #include "runtime/sharedRuntime.hpp" | |
| 0 | 42 |
| 43 extern int explicit_null_checks_inserted, | |
| 44 explicit_null_checks_elided; | |
| 45 | |
| 46 //---------------------------------array_load---------------------------------- | |
| 47 void Parse::array_load(BasicType elem_type) { | |
| 48 const Type* elem = Type::TOP; | |
| 49 Node* adr = array_addressing(elem_type, 0, &elem); | |
| 605 | 50 if (stopped()) return; // guaranteed null or range check |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
51 dec_sp(2); // Pop array and index |
| 0 | 52 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(elem_type); |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
53 Node* ld = make_load(control(), adr, elem, elem_type, adr_type, MemNode::unordered); |
| 0 | 54 push(ld); |
| 55 } | |
| 56 | |
| 57 | |
| 58 //--------------------------------array_store---------------------------------- | |
| 59 void Parse::array_store(BasicType elem_type) { | |
| 23614 | 60 const Type* elem = Type::TOP; |
| 61 Node* adr = array_addressing(elem_type, 1, &elem); | |
| 605 | 62 if (stopped()) return; // guaranteed null or range check |
| 0 | 63 Node* val = pop(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
64 dec_sp(2); // Pop array and index |
| 0 | 65 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(elem_type); |
| 23614 | 66 if (elem == TypeInt::BOOL) { |
| 67 elem_type = T_BOOLEAN; | |
| 68 } | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
69 store_to_memory(control(), adr, val, elem_type, adr_type, StoreNode::release_if_reference(elem_type)); |
| 0 | 70 } |
| 71 | |
| 72 | |
| 73 //------------------------------array_addressing------------------------------- | |
| 74 // Pull array and index from the stack. Compute pointer-to-element. | |
| 75 Node* Parse::array_addressing(BasicType type, int vals, const Type* *result2) { | |
| 76 Node *idx = peek(0+vals); // Get from stack without popping | |
| 77 Node *ary = peek(1+vals); // in case of exception | |
| 78 | |
| 79 // Null check the array base, with correct stack contents | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
80 ary = null_check(ary, T_ARRAY); |
| 0 | 81 // Compile-time detect of null-exception? |
| 82 if (stopped()) return top(); | |
| 83 | |
| 84 const TypeAryPtr* arytype = _gvn.type(ary)->is_aryptr(); | |
| 85 const TypeInt* sizetype = arytype->size(); | |
| 86 const Type* elemtype = arytype->elem(); | |
| 87 | |
| 88 if (UseUniqueSubclasses && result2 != NULL) { | |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
129
diff
changeset
|
89 const Type* el = elemtype->make_ptr(); |
|
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
129
diff
changeset
|
90 if (el && el->isa_instptr()) { |
|
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
129
diff
changeset
|
91 const TypeInstPtr* toop = el->is_instptr(); |
| 0 | 92 if (toop->klass()->as_instance_klass()->unique_concrete_subklass()) { |
| 93 // If we load from "AbstractClass[]" we must see "ConcreteSubClass". | |
| 94 const Type* subklass = Type::get_const_type(toop->klass()); | |
|
17671
de95063c0e34
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
17467
diff
changeset
|
95 elemtype = subklass->join_speculative(el); |
| 0 | 96 } |
| 97 } | |
| 98 } | |
| 99 | |
| 100 // Check for big class initializers with all constant offsets | |
| 101 // feeding into a known-size array. | |
| 102 const TypeInt* idxtype = _gvn.type(idx)->is_int(); | |
| 103 // See if the highest idx value is less than the lowest array bound, | |
| 104 // and if the idx value cannot be negative: | |
| 105 bool need_range_check = true; | |
| 106 if (idxtype->_hi < sizetype->_lo && idxtype->_lo >= 0) { | |
| 107 need_range_check = false; | |
| 108 if (C->log() != NULL) C->log()->elem("observe that='!need_range_check'"); | |
| 109 } | |
| 110 | |
| 8862 | 111 ciKlass * arytype_klass = arytype->klass(); |
| 112 if ((arytype_klass != NULL) && (!arytype_klass->is_loaded())) { | |
| 0 | 113 // Only fails for some -Xcomp runs |
| 114 // The class is unloaded. We have to run this bytecode in the interpreter. | |
| 115 uncommon_trap(Deoptimization::Reason_unloaded, | |
| 116 Deoptimization::Action_reinterpret, | |
| 117 arytype->klass(), "!loaded array"); | |
| 118 return top(); | |
| 119 } | |
| 120 | |
| 121 // Do the range check | |
| 122 if (GenerateRangeChecks && need_range_check) { | |
|
129
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
123 Node* tst; |
|
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
124 if (sizetype->_hi <= 0) { |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
125 // The greatest array bound is negative, so we can conclude that we're |
|
129
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
126 // compiling unreachable code, but the unsigned compare trick used below |
|
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
127 // only works with non-negative lengths. Instead, hack "tst" to be zero so |
|
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
128 // the uncommon_trap path will always be taken. |
|
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
129 tst = _gvn.intcon(0); |
|
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
130 } else { |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
131 // Range is constant in array-oop, so we can use the original state of mem |
|
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
132 Node* len = load_array_length(ary); |
|
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
133 |
|
129
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
134 // Test length vs index (standard trick using unsigned compare) |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
135 Node* chk = _gvn.transform( new (C) CmpUNode(idx, len) ); |
|
129
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
136 BoolTest::mask btest = BoolTest::lt; |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
137 tst = _gvn.transform( new (C) BoolNode(chk, btest) ); |
|
129
c0939256690b
6646019: array subscript expressions become top() with -d64
rasbold
parents:
113
diff
changeset
|
138 } |
| 0 | 139 // Branch to failure if out of bounds |
| 140 { BuildCutout unless(this, tst, PROB_MAX); | |
| 141 if (C->allow_range_check_smearing()) { | |
| 142 // Do not use builtin_throw, since range checks are sometimes | |
| 143 // made more stringent by an optimistic transformation. | |
| 144 // This creates "tentative" range checks at this point, | |
| 145 // which are not guaranteed to throw exceptions. | |
| 146 // See IfNode::Ideal, is_range_check, adjust_check. | |
| 147 uncommon_trap(Deoptimization::Reason_range_check, | |
| 148 Deoptimization::Action_make_not_entrant, | |
| 149 NULL, "range_check"); | |
| 150 } else { | |
| 151 // If we have already recompiled with the range-check-widening | |
| 152 // heroic optimization turned off, then we must really be throwing | |
| 153 // range check exceptions. | |
| 154 builtin_throw(Deoptimization::Reason_range_check, idx); | |
| 155 } | |
| 156 } | |
| 157 } | |
| 158 // Check for always knowing you are throwing a range-check exception | |
| 159 if (stopped()) return top(); | |
| 160 | |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
161 Node* ptr = array_element_address(ary, idx, type, sizetype); |
| 0 | 162 |
| 163 if (result2 != NULL) *result2 = elemtype; | |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
164 |
|
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
165 assert(ptr != top(), "top should go hand-in-hand with stopped"); |
|
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
254
diff
changeset
|
166 |
| 0 | 167 return ptr; |
| 168 } | |
| 169 | |
| 170 | |
| 171 // returns IfNode | |
| 172 IfNode* Parse::jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
173 Node *cmp = _gvn.transform( new (C) CmpINode( a, b)); // two cases: shiftcount > 32 and shiftcount <= 32 |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
174 Node *tst = _gvn.transform( new (C) BoolNode( cmp, mask)); |
| 0 | 175 IfNode *iff = create_and_map_if( control(), tst, ((mask == BoolTest::eq) ? PROB_STATIC_INFREQUENT : PROB_FAIR), COUNT_UNKNOWN ); |
| 176 return iff; | |
| 177 } | |
| 178 | |
| 179 // return Region node | |
| 180 Node* Parse::jump_if_join(Node* iffalse, Node* iftrue) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
181 Node *region = new (C) RegionNode(3); // 2 results |
| 0 | 182 record_for_igvn(region); |
| 183 region->init_req(1, iffalse); | |
| 184 region->init_req(2, iftrue ); | |
| 185 _gvn.set_type(region, Type::CONTROL); | |
| 186 region = _gvn.transform(region); | |
| 187 set_control (region); | |
| 188 return region; | |
| 189 } | |
| 190 | |
| 191 | |
| 192 //------------------------------helper for tableswitch------------------------- | |
| 193 void Parse::jump_if_true_fork(IfNode *iff, int dest_bci_if_true, int prof_table_index) { | |
| 194 // True branch, use existing map info | |
| 195 { PreserveJVMState pjvms(this); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
196 Node *iftrue = _gvn.transform( new (C) IfTrueNode (iff) ); |
| 0 | 197 set_control( iftrue ); |
| 198 profile_switch_case(prof_table_index); | |
| 199 merge_new_path(dest_bci_if_true); | |
| 200 } | |
| 201 | |
| 202 // False branch | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
203 Node *iffalse = _gvn.transform( new (C) IfFalseNode(iff) ); |
| 0 | 204 set_control( iffalse ); |
| 205 } | |
| 206 | |
| 207 void Parse::jump_if_false_fork(IfNode *iff, int dest_bci_if_true, int prof_table_index) { | |
| 208 // True branch, use existing map info | |
| 209 { PreserveJVMState pjvms(this); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
210 Node *iffalse = _gvn.transform( new (C) IfFalseNode (iff) ); |
| 0 | 211 set_control( iffalse ); |
| 212 profile_switch_case(prof_table_index); | |
| 213 merge_new_path(dest_bci_if_true); | |
| 214 } | |
| 215 | |
| 216 // False branch | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
217 Node *iftrue = _gvn.transform( new (C) IfTrueNode(iff) ); |
| 0 | 218 set_control( iftrue ); |
| 219 } | |
| 220 | |
| 221 void Parse::jump_if_always_fork(int dest_bci, int prof_table_index) { | |
| 222 // False branch, use existing map and control() | |
| 223 profile_switch_case(prof_table_index); | |
| 224 merge_new_path(dest_bci); | |
| 225 } | |
| 226 | |
| 227 | |
| 228 extern "C" { | |
| 229 static int jint_cmp(const void *i, const void *j) { | |
| 230 int a = *(jint *)i; | |
| 231 int b = *(jint *)j; | |
| 232 return a > b ? 1 : a < b ? -1 : 0; | |
| 233 } | |
| 234 } | |
| 235 | |
| 236 | |
| 237 // Default value for methodData switch indexing. Must be a negative value to avoid | |
| 238 // conflict with any legal switch index. | |
| 239 #define NullTableIndex -1 | |
| 240 | |
| 241 class SwitchRange : public StackObj { | |
| 242 // a range of integers coupled with a bci destination | |
| 243 jint _lo; // inclusive lower limit | |
| 244 jint _hi; // inclusive upper limit | |
| 245 int _dest; | |
| 246 int _table_index; // index into method data table | |
| 247 | |
| 248 public: | |
| 249 jint lo() const { return _lo; } | |
| 250 jint hi() const { return _hi; } | |
| 251 int dest() const { return _dest; } | |
| 252 int table_index() const { return _table_index; } | |
| 253 bool is_singleton() const { return _lo == _hi; } | |
| 254 | |
| 255 void setRange(jint lo, jint hi, int dest, int table_index) { | |
| 256 assert(lo <= hi, "must be a non-empty range"); | |
| 257 _lo = lo, _hi = hi; _dest = dest; _table_index = table_index; | |
| 258 } | |
| 259 bool adjoinRange(jint lo, jint hi, int dest, int table_index) { | |
| 260 assert(lo <= hi, "must be a non-empty range"); | |
| 261 if (lo == _hi+1 && dest == _dest && table_index == _table_index) { | |
| 262 _hi = hi; | |
| 263 return true; | |
| 264 } | |
| 265 return false; | |
| 266 } | |
| 267 | |
| 268 void set (jint value, int dest, int table_index) { | |
| 269 setRange(value, value, dest, table_index); | |
| 270 } | |
| 271 bool adjoin(jint value, int dest, int table_index) { | |
| 272 return adjoinRange(value, value, dest, table_index); | |
| 273 } | |
| 274 | |
|
12866
f478c98e8114
8024774: assert(_con < t->is_tuple()->cnt()) failed: ProjNode::_con must be in range
vlivanov
parents:
10278
diff
changeset
|
275 void print() { |
| 0 | 276 if (is_singleton()) |
| 277 tty->print(" {%d}=>%d", lo(), dest()); | |
| 278 else if (lo() == min_jint) | |
| 279 tty->print(" {..%d}=>%d", hi(), dest()); | |
| 280 else if (hi() == max_jint) | |
| 281 tty->print(" {%d..}=>%d", lo(), dest()); | |
| 282 else | |
| 283 tty->print(" {%d..%d}=>%d", lo(), hi(), dest()); | |
| 284 } | |
| 285 }; | |
| 286 | |
| 287 | |
| 288 //-------------------------------do_tableswitch-------------------------------- | |
| 289 void Parse::do_tableswitch() { | |
| 290 Node* lookup = pop(); | |
| 291 | |
| 292 // Get information about tableswitch | |
| 293 int default_dest = iter().get_dest_table(0); | |
| 294 int lo_index = iter().get_int_table(1); | |
| 295 int hi_index = iter().get_int_table(2); | |
| 296 int len = hi_index - lo_index + 1; | |
| 297 | |
| 298 if (len < 1) { | |
| 299 // If this is a backward branch, add safepoint | |
| 300 maybe_add_safepoint(default_dest); | |
| 301 merge(default_dest); | |
| 302 return; | |
| 303 } | |
| 304 | |
| 305 // generate decision tree, using trichotomy when possible | |
| 306 int rnum = len+2; | |
| 307 bool makes_backward_branch = false; | |
| 308 SwitchRange* ranges = NEW_RESOURCE_ARRAY(SwitchRange, rnum); | |
| 309 int rp = -1; | |
| 310 if (lo_index != min_jint) { | |
| 311 ranges[++rp].setRange(min_jint, lo_index-1, default_dest, NullTableIndex); | |
| 312 } | |
| 313 for (int j = 0; j < len; j++) { | |
| 314 jint match_int = lo_index+j; | |
| 315 int dest = iter().get_dest_table(j+3); | |
| 316 makes_backward_branch |= (dest <= bci()); | |
| 317 int table_index = method_data_update() ? j : NullTableIndex; | |
| 318 if (rp < 0 || !ranges[rp].adjoin(match_int, dest, table_index)) { | |
| 319 ranges[++rp].set(match_int, dest, table_index); | |
| 320 } | |
| 321 } | |
| 322 jint highest = lo_index+(len-1); | |
| 323 assert(ranges[rp].hi() == highest, ""); | |
| 324 if (highest != max_jint | |
| 325 && !ranges[rp].adjoinRange(highest+1, max_jint, default_dest, NullTableIndex)) { | |
| 326 ranges[++rp].setRange(highest+1, max_jint, default_dest, NullTableIndex); | |
| 327 } | |
| 328 assert(rp < len+2, "not too many ranges"); | |
| 329 | |
| 330 // Safepoint in case if backward branch observed | |
| 331 if( makes_backward_branch && UseLoopSafepoints ) | |
| 332 add_safepoint(); | |
| 333 | |
| 334 jump_switch_ranges(lookup, &ranges[0], &ranges[rp]); | |
| 335 } | |
| 336 | |
| 337 | |
| 338 //------------------------------do_lookupswitch-------------------------------- | |
| 339 void Parse::do_lookupswitch() { | |
| 340 Node *lookup = pop(); // lookup value | |
| 341 // Get information about lookupswitch | |
| 342 int default_dest = iter().get_dest_table(0); | |
| 343 int len = iter().get_int_table(1); | |
| 344 | |
| 345 if (len < 1) { // If this is a backward branch, add safepoint | |
| 346 maybe_add_safepoint(default_dest); | |
| 347 merge(default_dest); | |
| 348 return; | |
| 349 } | |
| 350 | |
| 351 // generate decision tree, using trichotomy when possible | |
| 352 jint* table = NEW_RESOURCE_ARRAY(jint, len*2); | |
| 353 { | |
| 354 for( int j = 0; j < len; j++ ) { | |
| 355 table[j+j+0] = iter().get_int_table(2+j+j); | |
| 356 table[j+j+1] = iter().get_dest_table(2+j+j+1); | |
| 357 } | |
| 358 qsort( table, len, 2*sizeof(table[0]), jint_cmp ); | |
| 359 } | |
| 360 | |
| 361 int rnum = len*2+1; | |
| 362 bool makes_backward_branch = false; | |
| 363 SwitchRange* ranges = NEW_RESOURCE_ARRAY(SwitchRange, rnum); | |
| 364 int rp = -1; | |
| 365 for( int j = 0; j < len; j++ ) { | |
| 366 jint match_int = table[j+j+0]; | |
| 367 int dest = table[j+j+1]; | |
| 368 int next_lo = rp < 0 ? min_jint : ranges[rp].hi()+1; | |
| 369 int table_index = method_data_update() ? j : NullTableIndex; | |
| 370 makes_backward_branch |= (dest <= bci()); | |
| 371 if( match_int != next_lo ) { | |
| 372 ranges[++rp].setRange(next_lo, match_int-1, default_dest, NullTableIndex); | |
| 373 } | |
| 374 if( rp < 0 || !ranges[rp].adjoin(match_int, dest, table_index) ) { | |
| 375 ranges[++rp].set(match_int, dest, table_index); | |
| 376 } | |
| 377 } | |
| 378 jint highest = table[2*(len-1)]; | |
| 379 assert(ranges[rp].hi() == highest, ""); | |
| 380 if( highest != max_jint | |
| 381 && !ranges[rp].adjoinRange(highest+1, max_jint, default_dest, NullTableIndex) ) { | |
| 382 ranges[++rp].setRange(highest+1, max_jint, default_dest, NullTableIndex); | |
| 383 } | |
| 384 assert(rp < rnum, "not too many ranges"); | |
| 385 | |
| 386 // Safepoint in case backward branch observed | |
| 387 if( makes_backward_branch && UseLoopSafepoints ) | |
| 388 add_safepoint(); | |
| 389 | |
| 390 jump_switch_ranges(lookup, &ranges[0], &ranges[rp]); | |
| 391 } | |
| 392 | |
| 393 //----------------------------create_jump_tables------------------------------- | |
| 394 bool Parse::create_jump_tables(Node* key_val, SwitchRange* lo, SwitchRange* hi) { | |
| 395 // Are jumptables enabled | |
| 396 if (!UseJumpTables) return false; | |
| 397 | |
| 398 // Are jumptables supported | |
| 399 if (!Matcher::has_match_rule(Op_Jump)) return false; | |
| 400 | |
| 401 // Don't make jump table if profiling | |
| 402 if (method_data_update()) return false; | |
| 403 | |
| 404 // Decide if a guard is needed to lop off big ranges at either (or | |
| 405 // both) end(s) of the input set. We'll call this the default target | |
| 406 // even though we can't be sure that it is the true "default". | |
| 407 | |
| 408 bool needs_guard = false; | |
| 409 int default_dest; | |
| 410 int64 total_outlier_size = 0; | |
| 411 int64 hi_size = ((int64)hi->hi()) - ((int64)hi->lo()) + 1; | |
| 412 int64 lo_size = ((int64)lo->hi()) - ((int64)lo->lo()) + 1; | |
| 413 | |
| 414 if (lo->dest() == hi->dest()) { | |
| 415 total_outlier_size = hi_size + lo_size; | |
| 416 default_dest = lo->dest(); | |
| 417 } else if (lo_size > hi_size) { | |
| 418 total_outlier_size = lo_size; | |
| 419 default_dest = lo->dest(); | |
| 420 } else { | |
| 421 total_outlier_size = hi_size; | |
| 422 default_dest = hi->dest(); | |
| 423 } | |
| 424 | |
| 425 // If a guard test will eliminate very sparse end ranges, then | |
| 426 // it is worth the cost of an extra jump. | |
| 427 if (total_outlier_size > (MaxJumpTableSparseness * 4)) { | |
| 428 needs_guard = true; | |
| 429 if (default_dest == lo->dest()) lo++; | |
| 430 if (default_dest == hi->dest()) hi--; | |
| 431 } | |
| 432 | |
| 433 // Find the total number of cases and ranges | |
| 434 int64 num_cases = ((int64)hi->hi()) - ((int64)lo->lo()) + 1; | |
| 435 int num_range = hi - lo + 1; | |
| 436 | |
| 437 // Don't create table if: too large, too small, or too sparse. | |
| 438 if (num_cases < MinJumpTableSize || num_cases > MaxJumpTableSize) | |
| 439 return false; | |
| 440 if (num_cases > (MaxJumpTableSparseness * num_range)) | |
| 441 return false; | |
| 442 | |
| 443 // Normalize table lookups to zero | |
| 444 int lowval = lo->lo(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
445 key_val = _gvn.transform( new (C) SubINode(key_val, _gvn.intcon(lowval)) ); |
| 0 | 446 |
| 447 // Generate a guard to protect against input keyvals that aren't | |
| 448 // in the switch domain. | |
| 449 if (needs_guard) { | |
| 450 Node* size = _gvn.intcon(num_cases); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
451 Node* cmp = _gvn.transform( new (C) CmpUNode(key_val, size) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
452 Node* tst = _gvn.transform( new (C) BoolNode(cmp, BoolTest::ge) ); |
| 0 | 453 IfNode* iff = create_and_map_if( control(), tst, PROB_FAIR, COUNT_UNKNOWN); |
| 454 jump_if_true_fork(iff, default_dest, NullTableIndex); | |
| 455 } | |
| 456 | |
| 457 // Create an ideal node JumpTable that has projections | |
| 458 // of all possible ranges for a switch statement | |
| 459 // The key_val input must be converted to a pointer offset and scaled. | |
| 460 // Compare Parse::array_addressing above. | |
| 461 #ifdef _LP64 | |
| 462 // Clean the 32-bit int into a real 64-bit offset. | |
| 463 // Otherwise, the jint value 0 might turn into an offset of 0x0800000000. | |
| 464 const TypeLong* lkeytype = TypeLong::make(CONST64(0), num_cases-1, Type::WidenMin); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
465 key_val = _gvn.transform( new (C) ConvI2LNode(key_val, lkeytype) ); |
| 0 | 466 #endif |
| 467 // Shift the value by wordsize so we have an index into the table, rather | |
| 468 // than a switch value | |
| 469 Node *shiftWord = _gvn.MakeConX(wordSize); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
470 key_val = _gvn.transform( new (C) MulXNode( key_val, shiftWord)); |
| 0 | 471 |
| 472 // Create the JumpNode | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
473 Node* jtn = _gvn.transform( new (C) JumpNode(control(), key_val, num_cases) ); |
| 0 | 474 |
| 475 // These are the switch destinations hanging off the jumpnode | |
| 476 int i = 0; | |
| 477 for (SwitchRange* r = lo; r <= hi; r++) { | |
|
12866
f478c98e8114
8024774: assert(_con < t->is_tuple()->cnt()) failed: ProjNode::_con must be in range
vlivanov
parents:
10278
diff
changeset
|
478 for (int64 j = r->lo(); j <= r->hi(); j++, i++) { |
|
f478c98e8114
8024774: assert(_con < t->is_tuple()->cnt()) failed: ProjNode::_con must be in range
vlivanov
parents:
10278
diff
changeset
|
479 Node* input = _gvn.transform(new (C) JumpProjNode(jtn, i, r->dest(), (int)(j - lowval))); |
| 0 | 480 { |
| 481 PreserveJVMState pjvms(this); | |
| 482 set_control(input); | |
| 483 jump_if_always_fork(r->dest(), r->table_index()); | |
| 484 } | |
| 485 } | |
| 486 } | |
| 487 assert(i == num_cases, "miscount of cases"); | |
| 488 stop_and_kill_map(); // no more uses for this JVMS | |
| 489 return true; | |
| 490 } | |
| 491 | |
| 492 //----------------------------jump_switch_ranges------------------------------- | |
| 493 void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi, int switch_depth) { | |
| 494 Block* switch_block = block(); | |
| 495 | |
| 496 if (switch_depth == 0) { | |
| 497 // Do special processing for the top-level call. | |
| 498 assert(lo->lo() == min_jint, "initial range must exhaust Type::INT"); | |
| 499 assert(hi->hi() == max_jint, "initial range must exhaust Type::INT"); | |
| 500 | |
| 501 // Decrement pred-numbers for the unique set of nodes. | |
| 502 #ifdef ASSERT | |
| 503 // Ensure that the block's successors are a (duplicate-free) set. | |
| 504 int successors_counted = 0; // block occurrences in [hi..lo] | |
| 505 int unique_successors = switch_block->num_successors(); | |
| 506 for (int i = 0; i < unique_successors; i++) { | |
| 507 Block* target = switch_block->successor_at(i); | |
| 508 | |
| 509 // Check that the set of successors is the same in both places. | |
| 510 int successors_found = 0; | |
| 511 for (SwitchRange* p = lo; p <= hi; p++) { | |
| 512 if (p->dest() == target->start()) successors_found++; | |
| 513 } | |
| 514 assert(successors_found > 0, "successor must be known"); | |
| 515 successors_counted += successors_found; | |
| 516 } | |
| 517 assert(successors_counted == (hi-lo)+1, "no unexpected successors"); | |
| 518 #endif | |
| 519 | |
| 520 // Maybe prune the inputs, based on the type of key_val. | |
| 521 jint min_val = min_jint; | |
| 522 jint max_val = max_jint; | |
| 523 const TypeInt* ti = key_val->bottom_type()->isa_int(); | |
| 524 if (ti != NULL) { | |
| 525 min_val = ti->_lo; | |
| 526 max_val = ti->_hi; | |
| 527 assert(min_val <= max_val, "invalid int type"); | |
| 528 } | |
| 529 while (lo->hi() < min_val) lo++; | |
| 530 if (lo->lo() < min_val) lo->setRange(min_val, lo->hi(), lo->dest(), lo->table_index()); | |
| 531 while (hi->lo() > max_val) hi--; | |
| 532 if (hi->hi() > max_val) hi->setRange(hi->lo(), max_val, hi->dest(), hi->table_index()); | |
| 533 } | |
| 534 | |
| 535 #ifndef PRODUCT | |
| 536 if (switch_depth == 0) { | |
| 537 _max_switch_depth = 0; | |
| 538 _est_switch_depth = log2_intptr((hi-lo+1)-1)+1; | |
| 539 } | |
| 540 #endif | |
| 541 | |
| 542 assert(lo <= hi, "must be a non-empty set of ranges"); | |
| 543 if (lo == hi) { | |
| 544 jump_if_always_fork(lo->dest(), lo->table_index()); | |
| 545 } else { | |
| 546 assert(lo->hi() == (lo+1)->lo()-1, "contiguous ranges"); | |
| 547 assert(hi->lo() == (hi-1)->hi()+1, "contiguous ranges"); | |
| 548 | |
| 549 if (create_jump_tables(key_val, lo, hi)) return; | |
| 550 | |
| 551 int nr = hi - lo + 1; | |
| 552 | |
| 553 SwitchRange* mid = lo + nr/2; | |
| 554 // if there is an easy choice, pivot at a singleton: | |
| 555 if (nr > 3 && !mid->is_singleton() && (mid-1)->is_singleton()) mid--; | |
| 556 | |
| 557 assert(lo < mid && mid <= hi, "good pivot choice"); | |
| 558 assert(nr != 2 || mid == hi, "should pick higher of 2"); | |
| 559 assert(nr != 3 || mid == hi-1, "should pick middle of 3"); | |
| 560 | |
| 561 Node *test_val = _gvn.intcon(mid->lo()); | |
| 562 | |
| 563 if (mid->is_singleton()) { | |
| 564 IfNode *iff_ne = jump_if_fork_int(key_val, test_val, BoolTest::ne); | |
| 565 jump_if_false_fork(iff_ne, mid->dest(), mid->table_index()); | |
| 566 | |
| 567 // Special Case: If there are exactly three ranges, and the high | |
| 568 // and low range each go to the same place, omit the "gt" test, | |
| 569 // since it will not discriminate anything. | |
| 570 bool eq_test_only = (hi == lo+2 && hi->dest() == lo->dest()); | |
| 571 if (eq_test_only) { | |
| 572 assert(mid == hi-1, ""); | |
| 573 } | |
| 574 | |
| 575 // if there is a higher range, test for it and process it: | |
| 576 if (mid < hi && !eq_test_only) { | |
| 577 // two comparisons of same values--should enable 1 test for 2 branches | |
| 578 // Use BoolTest::le instead of BoolTest::gt | |
| 579 IfNode *iff_le = jump_if_fork_int(key_val, test_val, BoolTest::le); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
580 Node *iftrue = _gvn.transform( new (C) IfTrueNode(iff_le) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
581 Node *iffalse = _gvn.transform( new (C) IfFalseNode(iff_le) ); |
| 0 | 582 { PreserveJVMState pjvms(this); |
| 583 set_control(iffalse); | |
| 584 jump_switch_ranges(key_val, mid+1, hi, switch_depth+1); | |
| 585 } | |
| 586 set_control(iftrue); | |
| 587 } | |
| 588 | |
| 589 } else { | |
| 590 // mid is a range, not a singleton, so treat mid..hi as a unit | |
| 591 IfNode *iff_ge = jump_if_fork_int(key_val, test_val, BoolTest::ge); | |
| 592 | |
| 593 // if there is a higher range, test for it and process it: | |
| 594 if (mid == hi) { | |
| 595 jump_if_true_fork(iff_ge, mid->dest(), mid->table_index()); | |
| 596 } else { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
597 Node *iftrue = _gvn.transform( new (C) IfTrueNode(iff_ge) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
598 Node *iffalse = _gvn.transform( new (C) IfFalseNode(iff_ge) ); |
| 0 | 599 { PreserveJVMState pjvms(this); |
| 600 set_control(iftrue); | |
| 601 jump_switch_ranges(key_val, mid, hi, switch_depth+1); | |
| 602 } | |
| 603 set_control(iffalse); | |
| 604 } | |
| 605 } | |
| 606 | |
| 607 // in any case, process the lower range | |
| 608 jump_switch_ranges(key_val, lo, mid-1, switch_depth+1); | |
| 609 } | |
| 610 | |
| 611 // Decrease pred_count for each successor after all is done. | |
| 612 if (switch_depth == 0) { | |
| 613 int unique_successors = switch_block->num_successors(); | |
| 614 for (int i = 0; i < unique_successors; i++) { | |
| 615 Block* target = switch_block->successor_at(i); | |
| 616 // Throw away the pre-allocated path for each unique successor. | |
| 617 target->next_path_num(); | |
| 618 } | |
| 619 } | |
| 620 | |
| 621 #ifndef PRODUCT | |
| 622 _max_switch_depth = MAX2(switch_depth, _max_switch_depth); | |
| 623 if (TraceOptoParse && Verbose && WizardMode && switch_depth == 0) { | |
| 624 SwitchRange* r; | |
| 625 int nsing = 0; | |
| 626 for( r = lo; r <= hi; r++ ) { | |
| 627 if( r->is_singleton() ) nsing++; | |
| 628 } | |
| 629 tty->print(">>> "); | |
| 630 _method->print_short_name(); | |
| 631 tty->print_cr(" switch decision tree"); | |
| 632 tty->print_cr(" %d ranges (%d singletons), max_depth=%d, est_depth=%d", | |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17799
diff
changeset
|
633 (int) (hi-lo+1), nsing, _max_switch_depth, _est_switch_depth); |
| 0 | 634 if (_max_switch_depth > _est_switch_depth) { |
| 635 tty->print_cr("******** BAD SWITCH DEPTH ********"); | |
| 636 } | |
| 637 tty->print(" "); | |
| 638 for( r = lo; r <= hi; r++ ) { | |
|
12866
f478c98e8114
8024774: assert(_con < t->is_tuple()->cnt()) failed: ProjNode::_con must be in range
vlivanov
parents:
10278
diff
changeset
|
639 r->print(); |
| 0 | 640 } |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17799
diff
changeset
|
641 tty->cr(); |
| 0 | 642 } |
| 643 #endif | |
| 644 } | |
| 645 | |
| 646 void Parse::modf() { | |
| 647 Node *f2 = pop(); | |
| 648 Node *f1 = pop(); | |
| 649 Node* c = make_runtime_call(RC_LEAF, OptoRuntime::modf_Type(), | |
| 650 CAST_FROM_FN_PTR(address, SharedRuntime::frem), | |
| 651 "frem", NULL, //no memory effects | |
| 652 f1, f2); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
653 Node* res = _gvn.transform(new (C) ProjNode(c, TypeFunc::Parms + 0)); |
| 0 | 654 |
| 655 push(res); | |
| 656 } | |
| 657 | |
| 658 void Parse::modd() { | |
| 659 Node *d2 = pop_pair(); | |
| 660 Node *d1 = pop_pair(); | |
| 661 Node* c = make_runtime_call(RC_LEAF, OptoRuntime::Math_DD_D_Type(), | |
| 662 CAST_FROM_FN_PTR(address, SharedRuntime::drem), | |
| 663 "drem", NULL, //no memory effects | |
| 664 d1, top(), d2, top()); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
665 Node* res_d = _gvn.transform(new (C) ProjNode(c, TypeFunc::Parms + 0)); |
| 0 | 666 |
| 667 #ifdef ASSERT | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
668 Node* res_top = _gvn.transform(new (C) ProjNode(c, TypeFunc::Parms + 1)); |
| 0 | 669 assert(res_top == top(), "second value must be top"); |
| 670 #endif | |
| 671 | |
| 672 push_pair(res_d); | |
| 673 } | |
| 674 | |
| 675 void Parse::l2f() { | |
| 676 Node* f2 = pop(); | |
| 677 Node* f1 = pop(); | |
| 678 Node* c = make_runtime_call(RC_LEAF, OptoRuntime::l2f_Type(), | |
| 679 CAST_FROM_FN_PTR(address, SharedRuntime::l2f), | |
| 680 "l2f", NULL, //no memory effects | |
| 681 f1, f2); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
682 Node* res = _gvn.transform(new (C) ProjNode(c, TypeFunc::Parms + 0)); |
| 0 | 683 |
| 684 push(res); | |
| 685 } | |
| 686 | |
| 687 void Parse::do_irem() { | |
| 688 // Must keep both values on the expression-stack during null-check | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
689 zero_check_int(peek()); |
| 0 | 690 // Compile-time detect of null-exception? |
| 691 if (stopped()) return; | |
| 692 | |
| 693 Node* b = pop(); | |
| 694 Node* a = pop(); | |
| 695 | |
| 696 const Type *t = _gvn.type(b); | |
| 697 if (t != Type::TOP) { | |
| 698 const TypeInt *ti = t->is_int(); | |
| 699 if (ti->is_con()) { | |
| 700 int divisor = ti->get_con(); | |
| 701 // check for positive power of 2 | |
| 702 if (divisor > 0 && | |
| 703 (divisor & ~(divisor-1)) == divisor) { | |
| 704 // yes ! | |
| 705 Node *mask = _gvn.intcon((divisor - 1)); | |
| 706 // Sigh, must handle negative dividends | |
| 707 Node *zero = _gvn.intcon(0); | |
| 708 IfNode *ifff = jump_if_fork_int(a, zero, BoolTest::lt); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
709 Node *iff = _gvn.transform( new (C) IfFalseNode(ifff) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
710 Node *ift = _gvn.transform( new (C) IfTrueNode (ifff) ); |
| 0 | 711 Node *reg = jump_if_join(ift, iff); |
| 712 Node *phi = PhiNode::make(reg, NULL, TypeInt::INT); | |
| 713 // Negative path; negate/and/negate | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
714 Node *neg = _gvn.transform( new (C) SubINode(zero, a) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
715 Node *andn= _gvn.transform( new (C) AndINode(neg, mask) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
716 Node *negn= _gvn.transform( new (C) SubINode(zero, andn) ); |
| 0 | 717 phi->init_req(1, negn); |
| 718 // Fast positive case | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
719 Node *andx = _gvn.transform( new (C) AndINode(a, mask) ); |
| 0 | 720 phi->init_req(2, andx); |
| 721 // Push the merge | |
| 722 push( _gvn.transform(phi) ); | |
| 723 return; | |
| 724 } | |
| 725 } | |
| 726 } | |
| 727 // Default case | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
728 push( _gvn.transform( new (C) ModINode(control(),a,b) ) ); |
| 0 | 729 } |
| 730 | |
| 731 // Handle jsr and jsr_w bytecode | |
| 732 void Parse::do_jsr() { | |
| 733 assert(bc() == Bytecodes::_jsr || bc() == Bytecodes::_jsr_w, "wrong bytecode"); | |
| 734 | |
| 735 // Store information about current state, tagged with new _jsr_bci | |
| 736 int return_bci = iter().next_bci(); | |
| 737 int jsr_bci = (bc() == Bytecodes::_jsr) ? iter().get_dest() : iter().get_far_dest(); | |
| 738 | |
| 739 // Update method data | |
| 740 profile_taken_branch(jsr_bci); | |
| 741 | |
| 742 // The way we do things now, there is only one successor block | |
| 743 // for the jsr, because the target code is cloned by ciTypeFlow. | |
| 744 Block* target = successor_for_bci(jsr_bci); | |
| 745 | |
| 746 // What got pushed? | |
| 747 const Type* ret_addr = target->peek(); | |
| 748 assert(ret_addr->singleton(), "must be a constant (cloned jsr body)"); | |
| 749 | |
| 750 // Effect on jsr on stack | |
| 751 push(_gvn.makecon(ret_addr)); | |
| 752 | |
| 753 // Flow to the jsr. | |
| 754 merge(jsr_bci); | |
| 755 } | |
| 756 | |
| 757 // Handle ret bytecode | |
| 758 void Parse::do_ret() { | |
| 759 // Find to whom we return. | |
| 760 assert(block()->num_successors() == 1, "a ret can only go one place now"); | |
| 761 Block* target = block()->successor_at(0); | |
| 762 assert(!target->is_ready(), "our arrival must be expected"); | |
| 763 profile_ret(target->flow()->start()); | |
| 764 int pnum = target->next_path_num(); | |
| 765 merge_common(target, pnum); | |
| 766 } | |
| 767 | |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
768 static bool has_injected_profile(BoolTest::mask btest, Node* test, int& taken, int& not_taken) { |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
769 if (btest != BoolTest::eq && btest != BoolTest::ne) { |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
770 // Only ::eq and ::ne are supported for profile injection. |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
771 return false; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
772 } |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
773 if (test->is_Cmp() && |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
774 test->in(1)->Opcode() == Op_ProfileBoolean) { |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
775 ProfileBooleanNode* profile = (ProfileBooleanNode*)test->in(1); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
776 int false_cnt = profile->false_count(); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
777 int true_cnt = profile->true_count(); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
778 |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
779 // Counts matching depends on the actual test operation (::eq or ::ne). |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
780 // No need to scale the counts because profile injection was designed |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
781 // to feed exact counts into VM. |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
782 taken = (btest == BoolTest::eq) ? false_cnt : true_cnt; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
783 not_taken = (btest == BoolTest::eq) ? true_cnt : false_cnt; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
784 |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
785 profile->consume(); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
786 return true; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
787 } |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
788 return false; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
789 } |
| 0 | 790 //--------------------------dynamic_branch_prediction-------------------------- |
| 791 // Try to gather dynamic branch prediction behavior. Return a probability | |
| 792 // of the branch being taken and set the "cnt" field. Returns a -1.0 | |
| 793 // if we need to use static prediction for some reason. | |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
794 float Parse::dynamic_branch_prediction(float &cnt, BoolTest::mask btest, Node* test) { |
| 0 | 795 ResourceMark rm; |
| 796 | |
| 797 cnt = COUNT_UNKNOWN; | |
| 798 | |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
799 int taken = 0; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
800 int not_taken = 0; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
801 |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
802 bool use_mdo = !has_injected_profile(btest, test, taken, not_taken); |
| 0 | 803 |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
804 if (use_mdo) { |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
805 // Use MethodData information if it is available |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
806 // FIXME: free the ProfileData structure |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
807 ciMethodData* methodData = method()->method_data(); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
808 if (!methodData->is_mature()) return PROB_UNKNOWN; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
809 ciProfileData* data = methodData->bci_to_data(bci()); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
810 if (!data->is_JumpData()) return PROB_UNKNOWN; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
811 |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
812 // get taken and not taken values |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
813 taken = data->as_JumpData()->taken(); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
814 not_taken = 0; |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
815 if (data->is_BranchData()) { |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
816 not_taken = data->as_BranchData()->not_taken(); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
817 } |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
818 |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
819 // scale the counts to be commensurate with invocation counts: |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
820 taken = method()->scale_count(taken); |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
821 not_taken = method()->scale_count(not_taken); |
| 0 | 822 } |
| 823 | |
|
2481
3a808be061ff
6988308: assert((cnt > 0.0f) && (prob > 0.0f)) failed: Bad frequency assignment in if
iveresov
parents:
2426
diff
changeset
|
824 // Give up if too few (or too many, in which case the sum will overflow) counts to be meaningful. |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
825 // We also check that individual counters are positive first, otherwise the sum can become positive. |
|
2481
3a808be061ff
6988308: assert((cnt > 0.0f) && (prob > 0.0f)) failed: Bad frequency assignment in if
iveresov
parents:
2426
diff
changeset
|
826 if (taken < 0 || not_taken < 0 || taken + not_taken < 40) { |
| 0 | 827 if (C->log() != NULL) { |
| 828 C->log()->elem("branch target_bci='%d' taken='%d' not_taken='%d'", iter().get_dest(), taken, not_taken); | |
| 829 } | |
| 830 return PROB_UNKNOWN; | |
| 831 } | |
| 832 | |
| 833 // Compute frequency that we arrive here | |
|
2481
3a808be061ff
6988308: assert((cnt > 0.0f) && (prob > 0.0f)) failed: Bad frequency assignment in if
iveresov
parents:
2426
diff
changeset
|
834 float sum = taken + not_taken; |
| 0 | 835 // Adjust, if this block is a cloned private block but the |
| 836 // Jump counts are shared. Taken the private counts for | |
| 837 // just this path instead of the shared counts. | |
| 838 if( block()->count() > 0 ) | |
| 839 sum = block()->count(); | |
|
2481
3a808be061ff
6988308: assert((cnt > 0.0f) && (prob > 0.0f)) failed: Bad frequency assignment in if
iveresov
parents:
2426
diff
changeset
|
840 cnt = sum / FreqCountInvocations; |
| 0 | 841 |
| 842 // Pin probability to sane limits | |
| 843 float prob; | |
| 844 if( !taken ) | |
| 845 prob = (0+PROB_MIN) / 2; | |
| 846 else if( !not_taken ) | |
| 847 prob = (1+PROB_MAX) / 2; | |
| 848 else { // Compute probability of true path | |
| 849 prob = (float)taken / (float)(taken + not_taken); | |
| 850 if (prob > PROB_MAX) prob = PROB_MAX; | |
| 851 if (prob < PROB_MIN) prob = PROB_MIN; | |
| 852 } | |
| 853 | |
| 854 assert((cnt > 0.0f) && (prob > 0.0f), | |
| 855 "Bad frequency assignment in if"); | |
| 856 | |
| 857 if (C->log() != NULL) { | |
| 858 const char* prob_str = NULL; | |
| 859 if (prob >= PROB_MAX) prob_str = (prob == PROB_MAX) ? "max" : "always"; | |
| 860 if (prob <= PROB_MIN) prob_str = (prob == PROB_MIN) ? "min" : "never"; | |
| 861 char prob_str_buf[30]; | |
| 862 if (prob_str == NULL) { | |
| 863 sprintf(prob_str_buf, "%g", prob); | |
| 864 prob_str = prob_str_buf; | |
| 865 } | |
| 866 C->log()->elem("branch target_bci='%d' taken='%d' not_taken='%d' cnt='%g' prob='%s'", | |
| 867 iter().get_dest(), taken, not_taken, cnt, prob_str); | |
| 868 } | |
| 869 return prob; | |
| 870 } | |
| 871 | |
| 872 //-----------------------------branch_prediction------------------------------- | |
| 873 float Parse::branch_prediction(float& cnt, | |
| 874 BoolTest::mask btest, | |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
875 int target_bci, |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
876 Node* test) { |
|
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
877 float prob = dynamic_branch_prediction(cnt, btest, test); |
| 0 | 878 // If prob is unknown, switch to static prediction |
| 879 if (prob != PROB_UNKNOWN) return prob; | |
| 880 | |
| 881 prob = PROB_FAIR; // Set default value | |
| 882 if (btest == BoolTest::eq) // Exactly equal test? | |
| 883 prob = PROB_STATIC_INFREQUENT; // Assume its relatively infrequent | |
| 884 else if (btest == BoolTest::ne) | |
| 885 prob = PROB_STATIC_FREQUENT; // Assume its relatively frequent | |
| 886 | |
| 887 // If this is a conditional test guarding a backwards branch, | |
| 888 // assume its a loop-back edge. Make it a likely taken branch. | |
| 889 if (target_bci < bci()) { | |
| 890 if (is_osr_parse()) { // Could be a hot OSR'd loop; force deopt | |
| 891 // Since it's an OSR, we probably have profile data, but since | |
| 892 // branch_prediction returned PROB_UNKNOWN, the counts are too small. | |
| 893 // Let's make a special check here for completely zero counts. | |
| 894 ciMethodData* methodData = method()->method_data(); | |
| 895 if (!methodData->is_empty()) { | |
| 896 ciProfileData* data = methodData->bci_to_data(bci()); | |
| 897 // Only stop for truly zero counts, which mean an unknown part | |
| 898 // of the OSR-ed method, and we want to deopt to gather more stats. | |
| 899 // If you have ANY counts, then this loop is simply 'cold' relative | |
| 900 // to the OSR loop. | |
| 901 if (data->as_BranchData()->taken() + | |
| 902 data->as_BranchData()->not_taken() == 0 ) { | |
| 903 // This is the only way to return PROB_UNKNOWN: | |
| 904 return PROB_UNKNOWN; | |
| 905 } | |
| 906 } | |
| 907 } | |
| 908 prob = PROB_STATIC_FREQUENT; // Likely to take backwards branch | |
| 909 } | |
| 910 | |
| 911 assert(prob != PROB_UNKNOWN, "must have some guess at this point"); | |
| 912 return prob; | |
| 913 } | |
| 914 | |
| 915 // The magic constants are chosen so as to match the output of | |
| 916 // branch_prediction() when the profile reports a zero taken count. | |
| 917 // It is important to distinguish zero counts unambiguously, because | |
| 918 // some branches (e.g., _213_javac.Assembler.eliminate) validly produce | |
| 919 // very small but nonzero probabilities, which if confused with zero | |
| 920 // counts would keep the program recompiling indefinitely. | |
|
20440
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
921 bool Parse::seems_never_taken(float prob) const { |
| 0 | 922 return prob < PROB_MIN; |
| 923 } | |
| 924 | |
|
1746
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
925 // True if the comparison seems to be the kind that will not change its |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
926 // statistics from true to false. See comments in adjust_map_after_if. |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
927 // This question is only asked along paths which are already |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
928 // classifed as untaken (by seems_never_taken), so really, |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
929 // if a path is never taken, its controlling comparison is |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
930 // already acting in a stable fashion. If the comparison |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
931 // seems stable, we will put an expensive uncommon trap |
|
20439
f6f9aec27858
8030976: Untaken paths should be more vigorously pruned at highest optimization level
rbackman
parents:
17937
diff
changeset
|
932 // on the untaken path. |
|
20440
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
933 bool Parse::seems_stable_comparison() const { |
|
20439
f6f9aec27858
8030976: Untaken paths should be more vigorously pruned at highest optimization level
rbackman
parents:
17937
diff
changeset
|
934 if (C->too_many_traps(method(), bci(), Deoptimization::Reason_unstable_if)) { |
|
f6f9aec27858
8030976: Untaken paths should be more vigorously pruned at highest optimization level
rbackman
parents:
17937
diff
changeset
|
935 return false; |
|
1746
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
936 } |
|
20439
f6f9aec27858
8030976: Untaken paths should be more vigorously pruned at highest optimization level
rbackman
parents:
17937
diff
changeset
|
937 return true; |
|
1746
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
938 } |
|
4b29a725c43c
6912064: type profiles need to be exploited more for dynamic language support
jrose
parents:
1602
diff
changeset
|
939 |
|
246
9b66e6287f4a
6707044: uncommon_trap of ifnull bytecode leaves garbage on expression stack
rasbold
parents:
235
diff
changeset
|
940 //-------------------------------repush_if_args-------------------------------- |
|
9b66e6287f4a
6707044: uncommon_trap of ifnull bytecode leaves garbage on expression stack
rasbold
parents:
235
diff
changeset
|
941 // Push arguments of an "if" bytecode back onto the stack by adjusting _sp. |
| 1172 | 942 inline int Parse::repush_if_args() { |
| 0 | 943 #ifndef PRODUCT |
| 944 if (PrintOpto && WizardMode) { | |
| 945 tty->print("defending against excessive implicit null exceptions on %s @%d in ", | |
| 946 Bytecodes::name(iter().cur_bc()), iter().cur_bci()); | |
| 947 method()->print_name(); tty->cr(); | |
| 948 } | |
| 949 #endif | |
| 950 int bc_depth = - Bytecodes::depth(iter().cur_bc()); | |
| 951 assert(bc_depth == 1 || bc_depth == 2, "only two kinds of branches"); | |
| 952 DEBUG_ONLY(sync_jvms()); // argument(n) requires a synced jvms | |
| 953 assert(argument(0) != NULL, "must exist"); | |
| 954 assert(bc_depth == 1 || argument(1) != NULL, "two must exist"); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
955 inc_sp(bc_depth); |
| 1172 | 956 return bc_depth; |
| 0 | 957 } |
| 958 | |
| 959 //----------------------------------do_ifnull---------------------------------- | |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
960 void Parse::do_ifnull(BoolTest::mask btest, Node *c) { |
| 0 | 961 int target_bci = iter().get_dest(); |
| 962 | |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
963 Block* branch_block = successor_for_bci(target_bci); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
964 Block* next_block = successor_for_bci(iter().next_bci()); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
965 |
| 0 | 966 float cnt; |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
967 float prob = branch_prediction(cnt, btest, target_bci, c); |
| 0 | 968 if (prob == PROB_UNKNOWN) { |
| 969 // (An earlier version of do_ifnull omitted this trap for OSR methods.) | |
| 970 #ifndef PRODUCT | |
| 971 if (PrintOpto && Verbose) | |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
972 tty->print_cr("Never-taken edge stops compilation at bci %d",bci()); |
| 0 | 973 #endif |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
974 repush_if_args(); // to gather stats on loop |
| 0 | 975 // We need to mark this branch as taken so that if we recompile we will |
| 976 // see that it is possible. In the tiered system the interpreter doesn't | |
| 977 // do profiling and by the time we get to the lower tier from the interpreter | |
| 978 // the path may be cold again. Make sure it doesn't look untaken | |
| 979 profile_taken_branch(target_bci, !ProfileInterpreter); | |
| 980 uncommon_trap(Deoptimization::Reason_unreached, | |
| 981 Deoptimization::Action_reinterpret, | |
| 982 NULL, "cold"); | |
| 10278 | 983 if (C->eliminate_boxing()) { |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
984 // Mark the successor blocks as parsed |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
985 branch_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
986 next_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
987 } |
| 0 | 988 return; |
| 989 } | |
| 990 | |
| 991 explicit_null_checks_inserted++; | |
| 992 | |
| 993 // Generate real control flow | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
994 Node *tst = _gvn.transform( new (C) BoolNode( c, btest ) ); |
| 0 | 995 |
| 996 // Sanity check the probability value | |
| 997 assert(prob > 0.0f,"Bad probability in Parser"); | |
| 998 // Need xform to put node in hash table | |
| 999 IfNode *iff = create_and_xform_if( control(), tst, prob, cnt ); | |
| 1000 assert(iff->_prob > 0.0f,"Optimizer made bad probability in parser"); | |
| 1001 // True branch | |
| 1002 { PreserveJVMState pjvms(this); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1003 Node* iftrue = _gvn.transform( new (C) IfTrueNode (iff) ); |
| 0 | 1004 set_control(iftrue); |
| 1005 | |
| 1006 if (stopped()) { // Path is dead? | |
| 1007 explicit_null_checks_elided++; | |
| 10278 | 1008 if (C->eliminate_boxing()) { |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1009 // Mark the successor block as parsed |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1010 branch_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1011 } |
| 0 | 1012 } else { // Path is live. |
| 1013 // Update method data | |
| 1014 profile_taken_branch(target_bci); | |
| 1015 adjust_map_after_if(btest, c, prob, branch_block, next_block); | |
| 1172 | 1016 if (!stopped()) { |
| 0 | 1017 merge(target_bci); |
| 1172 | 1018 } |
| 0 | 1019 } |
| 1020 } | |
| 1021 | |
| 1022 // False branch | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1023 Node* iffalse = _gvn.transform( new (C) IfFalseNode(iff) ); |
| 0 | 1024 set_control(iffalse); |
| 1025 | |
| 1026 if (stopped()) { // Path is dead? | |
| 1027 explicit_null_checks_elided++; | |
| 10278 | 1028 if (C->eliminate_boxing()) { |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1029 // Mark the successor block as parsed |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1030 next_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1031 } |
| 0 | 1032 } else { // Path is live. |
| 1033 // Update method data | |
| 1034 profile_not_taken_branch(); | |
| 1035 adjust_map_after_if(BoolTest(btest).negate(), c, 1.0-prob, | |
| 1036 next_block, branch_block); | |
| 1037 } | |
| 1038 } | |
| 1039 | |
| 1040 //------------------------------------do_if------------------------------------ | |
| 1041 void Parse::do_if(BoolTest::mask btest, Node* c) { | |
| 1042 int target_bci = iter().get_dest(); | |
| 1043 | |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1044 Block* branch_block = successor_for_bci(target_bci); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1045 Block* next_block = successor_for_bci(iter().next_bci()); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1046 |
| 0 | 1047 float cnt; |
|
22985
eb8b5cc64669
8063137: Never-taken branches should be pruned when GWT LambdaForms are shared
vlivanov
parents:
20440
diff
changeset
|
1048 float prob = branch_prediction(cnt, btest, target_bci, c); |
| 0 | 1049 float untaken_prob = 1.0 - prob; |
| 1050 | |
| 1051 if (prob == PROB_UNKNOWN) { | |
| 1052 #ifndef PRODUCT | |
| 1053 if (PrintOpto && Verbose) | |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
1054 tty->print_cr("Never-taken edge stops compilation at bci %d",bci()); |
| 0 | 1055 #endif |
| 1056 repush_if_args(); // to gather stats on loop | |
| 1057 // We need to mark this branch as taken so that if we recompile we will | |
| 1058 // see that it is possible. In the tiered system the interpreter doesn't | |
| 1059 // do profiling and by the time we get to the lower tier from the interpreter | |
| 1060 // the path may be cold again. Make sure it doesn't look untaken | |
| 1061 profile_taken_branch(target_bci, !ProfileInterpreter); | |
| 1062 uncommon_trap(Deoptimization::Reason_unreached, | |
| 1063 Deoptimization::Action_reinterpret, | |
| 1064 NULL, "cold"); | |
| 10278 | 1065 if (C->eliminate_boxing()) { |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1066 // Mark the successor blocks as parsed |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1067 branch_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1068 next_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1069 } |
| 0 | 1070 return; |
| 1071 } | |
| 1072 | |
| 1073 // Sanity check the probability value | |
| 1074 assert(0.0f < prob && prob < 1.0f,"Bad probability in Parser"); | |
| 1075 | |
| 1076 bool taken_if_true = true; | |
| 1077 // Convert BoolTest to canonical form: | |
| 1078 if (!BoolTest(btest).is_canonical()) { | |
| 1079 btest = BoolTest(btest).negate(); | |
| 1080 taken_if_true = false; | |
| 1081 // prob is NOT updated here; it remains the probability of the taken | |
| 1082 // path (as opposed to the prob of the path guarded by an 'IfTrueNode'). | |
| 1083 } | |
| 1084 assert(btest != BoolTest::eq, "!= is the only canonical exact test"); | |
| 1085 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1086 Node* tst0 = new (C) BoolNode(c, btest); |
| 0 | 1087 Node* tst = _gvn.transform(tst0); |
| 1088 BoolTest::mask taken_btest = BoolTest::illegal; | |
| 1089 BoolTest::mask untaken_btest = BoolTest::illegal; | |
|
37
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1090 |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1091 if (tst->is_Bool()) { |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1092 // Refresh c from the transformed bool node, since it may be |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1093 // simpler than the original c. Also re-canonicalize btest. |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1094 // This wins when (Bool ne (Conv2B p) 0) => (Bool ne (CmpP p NULL)). |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1095 // That can arise from statements like: if (x instanceof C) ... |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1096 if (tst != tst0) { |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1097 // Canonicalize one more time since transform can change it. |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1098 btest = tst->as_Bool()->_test._test; |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1099 if (!BoolTest(btest).is_canonical()) { |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1100 // Reverse edges one more time... |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1101 tst = _gvn.transform( tst->as_Bool()->negate(&_gvn) ); |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1102 btest = tst->as_Bool()->_test._test; |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1103 assert(BoolTest(btest).is_canonical(), "sanity"); |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1104 taken_if_true = !taken_if_true; |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1105 } |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1106 c = tst->in(1); |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1107 } |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1108 BoolTest::mask neg_btest = BoolTest(btest).negate(); |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1109 taken_btest = taken_if_true ? btest : neg_btest; |
|
73970d8c0b27
6671250: In Parse::do_if() old Cmp node 'c' should be replaced with new one after BoolNode transformation
kvn
parents:
17
diff
changeset
|
1110 untaken_btest = taken_if_true ? neg_btest : btest; |
| 0 | 1111 } |
| 1112 | |
| 1113 // Generate real control flow | |
| 1114 float true_prob = (taken_if_true ? prob : untaken_prob); | |
| 1115 IfNode* iff = create_and_map_if(control(), tst, true_prob, cnt); | |
| 1116 assert(iff->_prob > 0.0f,"Optimizer made bad probability in parser"); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1117 Node* taken_branch = new (C) IfTrueNode(iff); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1118 Node* untaken_branch = new (C) IfFalseNode(iff); |
| 0 | 1119 if (!taken_if_true) { // Finish conversion to canonical form |
| 1120 Node* tmp = taken_branch; | |
| 1121 taken_branch = untaken_branch; | |
| 1122 untaken_branch = tmp; | |
| 1123 } | |
| 1124 | |
| 1125 // Branch is taken: | |
| 1126 { PreserveJVMState pjvms(this); | |
| 1127 taken_branch = _gvn.transform(taken_branch); | |
| 1128 set_control(taken_branch); | |
| 1129 | |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1130 if (stopped()) { |
| 10278 | 1131 if (C->eliminate_boxing()) { |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1132 // Mark the successor block as parsed |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1133 branch_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1134 } |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1135 } else { |
| 0 | 1136 // Update method data |
| 1137 profile_taken_branch(target_bci); | |
| 1138 adjust_map_after_if(taken_btest, c, prob, branch_block, next_block); | |
| 1172 | 1139 if (!stopped()) { |
| 0 | 1140 merge(target_bci); |
| 1172 | 1141 } |
| 0 | 1142 } |
| 1143 } | |
| 1144 | |
| 1145 untaken_branch = _gvn.transform(untaken_branch); | |
| 1146 set_control(untaken_branch); | |
| 1147 | |
| 1148 // Branch not taken. | |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1149 if (stopped()) { |
| 10278 | 1150 if (C->eliminate_boxing()) { |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1151 // Mark the successor block as parsed |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1152 next_block->next_path_num(); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1153 } |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
1154 } else { |
| 0 | 1155 // Update method data |
| 1156 profile_not_taken_branch(); | |
| 1157 adjust_map_after_if(untaken_btest, c, untaken_prob, | |
| 1158 next_block, branch_block); | |
| 1159 } | |
| 1160 } | |
| 1161 | |
|
20440
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1162 bool Parse::path_is_suitable_for_uncommon_trap(float prob) const { |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1163 // Don't want to speculate on uncommon traps when running with -Xcomp |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1164 if (!UseInterpreter) { |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1165 return false; |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1166 } |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1167 return (seems_never_taken(prob) && seems_stable_comparison()); |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1168 } |
|
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1169 |
| 0 | 1170 //----------------------------adjust_map_after_if------------------------------ |
| 1171 // Adjust the JVM state to reflect the result of taking this path. | |
| 1172 // Basically, it means inspecting the CmpNode controlling this | |
| 1173 // branch, seeing how it constrains a tested value, and then | |
| 1174 // deciding if it's worth our while to encode this constraint | |
| 1175 // as graph nodes in the current abstract interpretation map. | |
| 1176 void Parse::adjust_map_after_if(BoolTest::mask btest, Node* c, float prob, | |
| 1177 Block* path, Block* other_path) { | |
| 1178 if (stopped() || !c->is_Cmp() || btest == BoolTest::illegal) | |
| 1179 return; // nothing to do | |
| 1180 | |
| 1181 bool is_fallthrough = (path == successor_for_bci(iter().next_bci())); | |
| 1182 | |
|
20440
42460b71ba70
8046289: compiler/6340864/TestLongVect.java timeout with
rbackman
parents:
20439
diff
changeset
|
1183 if (path_is_suitable_for_uncommon_trap(prob)) { |
| 0 | 1184 repush_if_args(); |
|
20439
f6f9aec27858
8030976: Untaken paths should be more vigorously pruned at highest optimization level
rbackman
parents:
17937
diff
changeset
|
1185 uncommon_trap(Deoptimization::Reason_unstable_if, |
| 0 | 1186 Deoptimization::Action_reinterpret, |
| 1187 NULL, | |
| 1188 (is_fallthrough ? "taken always" : "taken never")); | |
| 1189 return; | |
| 1190 } | |
| 1191 | |
| 1192 Node* val = c->in(1); | |
| 1193 Node* con = c->in(2); | |
| 1194 const Type* tcon = _gvn.type(con); | |
| 1195 const Type* tval = _gvn.type(val); | |
| 1196 bool have_con = tcon->singleton(); | |
| 1197 if (tval->singleton()) { | |
| 1198 if (!have_con) { | |
| 1199 // Swap, so constant is in con. | |
| 1200 con = val; | |
| 1201 tcon = tval; | |
| 1202 val = c->in(2); | |
| 1203 tval = _gvn.type(val); | |
| 1204 btest = BoolTest(btest).commute(); | |
| 1205 have_con = true; | |
| 1206 } else { | |
| 1207 // Do we have two constants? Then leave well enough alone. | |
| 1208 have_con = false; | |
| 1209 } | |
| 1210 } | |
| 1211 if (!have_con) // remaining adjustments need a con | |
| 1212 return; | |
| 1213 | |
|
6131
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1214 sharpen_type_after_if(btest, con, tcon, val, tval); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1215 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1216 |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1217 |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1218 static Node* extract_obj_from_klass_load(PhaseGVN* gvn, Node* n) { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1219 Node* ldk; |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6804
diff
changeset
|
1220 if (n->is_DecodeNKlass()) { |
|
6131
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1221 if (n->in(1)->Opcode() != Op_LoadNKlass) { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1222 return NULL; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1223 } else { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1224 ldk = n->in(1); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1225 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1226 } else if (n->Opcode() != Op_LoadKlass) { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1227 return NULL; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1228 } else { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1229 ldk = n; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1230 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1231 assert(ldk != NULL && ldk->is_Load(), "should have found a LoadKlass or LoadNKlass node"); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1232 |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1233 Node* adr = ldk->in(MemNode::Address); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1234 intptr_t off = 0; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1235 Node* obj = AddPNode::Ideal_base_and_offset(adr, gvn, off); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1236 if (obj == NULL || off != oopDesc::klass_offset_in_bytes()) // loading oopDesc::_klass? |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1237 return NULL; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1238 const TypePtr* tp = gvn->type(obj)->is_ptr(); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1239 if (tp == NULL || !(tp->isa_instptr() || tp->isa_aryptr())) // is obj a Java object ptr? |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1240 return NULL; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1241 |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1242 return obj; |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1243 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1244 |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1245 void Parse::sharpen_type_after_if(BoolTest::mask btest, |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1246 Node* con, const Type* tcon, |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1247 Node* val, const Type* tval) { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1248 // Look for opportunities to sharpen the type of a node |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1249 // whose klass is compared with a constant klass. |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1250 if (btest == BoolTest::eq && tcon->isa_klassptr()) { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1251 Node* obj = extract_obj_from_klass_load(&_gvn, val); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1252 const TypeOopPtr* con_type = tcon->isa_klassptr()->as_instance_type(); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1253 if (obj != NULL && (con_type->isa_instptr() || con_type->isa_aryptr())) { |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1254 // Found: |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1255 // Bool(CmpP(LoadKlass(obj._klass), ConP(Foo.klass)), [eq]) |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1256 // or the narrowOop equivalent. |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1257 const Type* obj_type = _gvn.type(obj); |
|
17671
de95063c0e34
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
17467
diff
changeset
|
1258 const TypeOopPtr* tboth = obj_type->join_speculative(con_type)->isa_oopptr(); |
|
6206
70862d781d01
7180769: assert(tboth->klass_is_exact()) failed: klass should be exact
kvn
parents:
6131
diff
changeset
|
1259 if (tboth != NULL && tboth->klass_is_exact() && tboth != obj_type && |
|
70862d781d01
7180769: assert(tboth->klass_is_exact()) failed: klass should be exact
kvn
parents:
6131
diff
changeset
|
1260 tboth->higher_equal(obj_type)) { |
|
6131
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1261 // obj has to be of the exact type Foo if the CmpP succeeds. |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1262 int obj_in_map = map()->find_edge(obj); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1263 JVMState* jvms = this->jvms(); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1264 if (obj_in_map >= 0 && |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1265 (jvms->is_loc(obj_in_map) || jvms->is_stk(obj_in_map))) { |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1266 TypeNode* ccast = new (C) CheckCastPPNode(control(), obj, tboth); |
|
6131
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1267 const Type* tcc = ccast->as_Type()->type(); |
|
17671
de95063c0e34
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
17467
diff
changeset
|
1268 assert(tcc != obj_type && tcc->higher_equal_speculative(obj_type), "must improve"); |
|
6131
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1269 // Delay transform() call to allow recovery of pre-cast value |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1270 // at the control merge. |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1271 _gvn.set_type_bottom(ccast); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1272 record_for_igvn(ccast); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1273 // Here's the payoff. |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1274 replace_in_map(obj, ccast); |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1275 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1276 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1277 } |
|
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1278 } |
| 0 | 1279 |
| 1280 int val_in_map = map()->find_edge(val); | |
| 1281 if (val_in_map < 0) return; // replace_in_map would be useless | |
| 1282 { | |
| 1283 JVMState* jvms = this->jvms(); | |
| 1284 if (!(jvms->is_loc(val_in_map) || | |
| 1285 jvms->is_stk(val_in_map))) | |
| 1286 return; // again, it would be useless | |
| 1287 } | |
| 1288 | |
| 1289 // Check for a comparison to a constant, and "know" that the compared | |
| 1290 // value is constrained on this path. | |
| 1291 assert(tcon->singleton(), ""); | |
| 1292 ConstraintCastNode* ccast = NULL; | |
| 1293 Node* cast = NULL; | |
| 1294 | |
| 1295 switch (btest) { | |
| 1296 case BoolTest::eq: // Constant test? | |
| 1297 { | |
|
17671
de95063c0e34
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
17467
diff
changeset
|
1298 const Type* tboth = tcon->join_speculative(tval); |
| 0 | 1299 if (tboth == tval) break; // Nothing to gain. |
| 1300 if (tcon->isa_int()) { | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1301 ccast = new (C) CastIINode(val, tboth); |
| 0 | 1302 } else if (tcon == TypePtr::NULL_PTR) { |
| 1303 // Cast to null, but keep the pointer identity temporarily live. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1304 ccast = new (C) CastPPNode(val, tboth); |
| 0 | 1305 } else { |
| 1306 const TypeF* tf = tcon->isa_float_constant(); | |
| 1307 const TypeD* td = tcon->isa_double_constant(); | |
| 1308 // Exclude tests vs float/double 0 as these could be | |
| 1309 // either +0 or -0. Just because you are equal to +0 | |
| 1310 // doesn't mean you ARE +0! | |
|
6131
8f6ce6f1049b
7170463: C2 should recognize "obj.getClass() == A.class" code pattern
kvn
parents:
3899
diff
changeset
|
1311 // Note, following code also replaces Long and Oop values. |
| 0 | 1312 if ((!tf || tf->_f != 0.0) && |
| 1313 (!td || td->_d != 0.0)) | |
| 1314 cast = con; // Replace non-constant val by con. | |
| 1315 } | |
| 1316 } | |
| 1317 break; | |
| 1318 | |
| 1319 case BoolTest::ne: | |
| 1320 if (tcon == TypePtr::NULL_PTR) { | |
| 1321 cast = cast_not_null(val, false); | |
| 1322 } | |
| 1323 break; | |
| 1324 | |
| 1325 default: | |
| 1326 // (At this point we could record int range types with CastII.) | |
| 1327 break; | |
| 1328 } | |
| 1329 | |
| 1330 if (ccast != NULL) { | |
| 1331 const Type* tcc = ccast->as_Type()->type(); | |
|
17671
de95063c0e34
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
17467
diff
changeset
|
1332 assert(tcc != tval && tcc->higher_equal_speculative(tval), "must improve"); |
| 0 | 1333 // Delay transform() call to allow recovery of pre-cast value |
| 1334 // at the control merge. | |
| 1335 ccast->set_req(0, control()); | |
| 1336 _gvn.set_type_bottom(ccast); | |
| 1337 record_for_igvn(ccast); | |
| 1338 cast = ccast; | |
| 1339 } | |
| 1340 | |
| 1341 if (cast != NULL) { // Here's the payoff. | |
| 1342 replace_in_map(val, cast); | |
| 1343 } | |
| 1344 } | |
| 1345 | |
| 12966 | 1346 /** |
| 1347 * Use speculative type to optimize CmpP node: if comparison is | |
| 1348 * against the low level class, cast the object to the speculative | |
| 1349 * type if any. CmpP should then go away. | |
| 1350 * | |
| 1351 * @param c expected CmpP node | |
| 1352 * @return result of CmpP on object casted to speculative type | |
| 1353 * | |
| 1354 */ | |
| 1355 Node* Parse::optimize_cmp_with_klass(Node* c) { | |
| 1356 // If this is transformed by the _gvn to a comparison with the low | |
| 1357 // level klass then we may be able to use speculation | |
| 1358 if (c->Opcode() == Op_CmpP && | |
| 1359 (c->in(1)->Opcode() == Op_LoadKlass || c->in(1)->Opcode() == Op_DecodeNKlass) && | |
| 1360 c->in(2)->is_Con()) { | |
| 1361 Node* load_klass = NULL; | |
| 1362 Node* decode = NULL; | |
| 1363 if (c->in(1)->Opcode() == Op_DecodeNKlass) { | |
| 1364 decode = c->in(1); | |
| 1365 load_klass = c->in(1)->in(1); | |
| 1366 } else { | |
| 1367 load_klass = c->in(1); | |
| 1368 } | |
| 1369 if (load_klass->in(2)->is_AddP()) { | |
| 1370 Node* addp = load_klass->in(2); | |
| 1371 Node* obj = addp->in(AddPNode::Address); | |
| 1372 const TypeOopPtr* obj_type = _gvn.type(obj)->is_oopptr(); | |
| 1373 if (obj_type->speculative_type() != NULL) { | |
| 1374 ciKlass* k = obj_type->speculative_type(); | |
| 1375 inc_sp(2); | |
| 1376 obj = maybe_cast_profiled_obj(obj, k); | |
| 1377 dec_sp(2); | |
| 1378 // Make the CmpP use the casted obj | |
| 1379 addp = basic_plus_adr(obj, addp->in(AddPNode::Offset)); | |
| 1380 load_klass = load_klass->clone(); | |
| 1381 load_klass->set_req(2, addp); | |
| 1382 load_klass = _gvn.transform(load_klass); | |
| 1383 if (decode != NULL) { | |
| 1384 decode = decode->clone(); | |
| 1385 decode->set_req(1, load_klass); | |
| 1386 load_klass = _gvn.transform(decode); | |
| 1387 } | |
| 1388 c = c->clone(); | |
| 1389 c->set_req(1, load_klass); | |
| 1390 c = _gvn.transform(c); | |
| 1391 } | |
| 1392 } | |
| 1393 } | |
| 1394 return c; | |
| 1395 } | |
| 0 | 1396 |
| 1397 //------------------------------do_one_bytecode-------------------------------- | |
| 1398 // Parse this bytecode, and alter the Parsers JVM->Node mapping | |
| 1399 void Parse::do_one_bytecode() { | |
| 1400 Node *a, *b, *c, *d; // Handy temps | |
| 1401 BoolTest::mask btest; | |
| 1402 int i; | |
| 1403 | |
| 1404 assert(!has_exceptions(), "bytecode entry state must be clear of throws"); | |
| 1405 | |
| 1406 if (C->check_node_count(NodeLimitFudgeFactor * 5, | |
| 1407 "out of nodes parsing method")) { | |
| 1408 return; | |
| 1409 } | |
| 1410 | |
| 1411 #ifdef ASSERT | |
| 1412 // for setting breakpoints | |
| 1413 if (TraceOptoParse) { | |
| 1414 tty->print(" @"); | |
| 1415 dump_bci(bci()); | |
| 8862 | 1416 tty->cr(); |
| 0 | 1417 } |
| 1418 #endif | |
| 1419 | |
| 1420 switch (bc()) { | |
| 1421 case Bytecodes::_nop: | |
| 1422 // do nothing | |
| 1423 break; | |
| 1424 case Bytecodes::_lconst_0: | |
| 1425 push_pair(longcon(0)); | |
| 1426 break; | |
| 1427 | |
| 1428 case Bytecodes::_lconst_1: | |
| 1429 push_pair(longcon(1)); | |
| 1430 break; | |
| 1431 | |
| 1432 case Bytecodes::_fconst_0: | |
| 1433 push(zerocon(T_FLOAT)); | |
| 1434 break; | |
| 1435 | |
| 1436 case Bytecodes::_fconst_1: | |
| 1437 push(makecon(TypeF::ONE)); | |
| 1438 break; | |
| 1439 | |
| 1440 case Bytecodes::_fconst_2: | |
| 1441 push(makecon(TypeF::make(2.0f))); | |
| 1442 break; | |
| 1443 | |
| 1444 case Bytecodes::_dconst_0: | |
| 1445 push_pair(zerocon(T_DOUBLE)); | |
| 1446 break; | |
| 1447 | |
| 1448 case Bytecodes::_dconst_1: | |
| 1449 push_pair(makecon(TypeD::ONE)); | |
| 1450 break; | |
| 1451 | |
| 1452 case Bytecodes::_iconst_m1:push(intcon(-1)); break; | |
| 1453 case Bytecodes::_iconst_0: push(intcon( 0)); break; | |
| 1454 case Bytecodes::_iconst_1: push(intcon( 1)); break; | |
| 1455 case Bytecodes::_iconst_2: push(intcon( 2)); break; | |
| 1456 case Bytecodes::_iconst_3: push(intcon( 3)); break; | |
| 1457 case Bytecodes::_iconst_4: push(intcon( 4)); break; | |
| 1458 case Bytecodes::_iconst_5: push(intcon( 5)); break; | |
| 1565 | 1459 case Bytecodes::_bipush: push(intcon(iter().get_constant_u1())); break; |
| 1460 case Bytecodes::_sipush: push(intcon(iter().get_constant_u2())); break; | |
| 0 | 1461 case Bytecodes::_aconst_null: push(null()); break; |
| 1462 case Bytecodes::_ldc: | |
| 1463 case Bytecodes::_ldc_w: | |
| 1464 case Bytecodes::_ldc2_w: | |
| 1465 // If the constant is unresolved, run this BC once in the interpreter. | |
| 1602 | 1466 { |
| 0 | 1467 ciConstant constant = iter().get_constant(); |
| 1602 | 1468 if (constant.basic_type() == T_OBJECT && |
| 1469 !constant.as_object()->is_loaded()) { | |
| 1470 int index = iter().get_constant_pool_index(); | |
| 1471 constantTag tag = iter().get_constant_pool_tag(index); | |
| 1472 uncommon_trap(Deoptimization::make_trap_request | |
| 1473 (Deoptimization::Reason_unloaded, | |
| 1474 Deoptimization::Action_reinterpret, | |
| 1475 index), | |
| 1476 NULL, tag.internal_name()); | |
| 1477 break; | |
| 0 | 1478 } |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6206
diff
changeset
|
1479 assert(constant.basic_type() != T_OBJECT || constant.as_object()->is_instance(), |
| 1602 | 1480 "must be java_mirror of klass"); |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
1481 bool pushed = push_constant(constant, true); |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
1482 guarantee(pushed, "must be possible to push this constant"); |
| 0 | 1483 } |
| 1484 | |
| 1485 break; | |
| 1486 | |
| 1487 case Bytecodes::_aload_0: | |
| 1488 push( local(0) ); | |
| 1489 break; | |
| 1490 case Bytecodes::_aload_1: | |
| 1491 push( local(1) ); | |
| 1492 break; | |
| 1493 case Bytecodes::_aload_2: | |
| 1494 push( local(2) ); | |
| 1495 break; | |
| 1496 case Bytecodes::_aload_3: | |
| 1497 push( local(3) ); | |
| 1498 break; | |
| 1499 case Bytecodes::_aload: | |
| 1500 push( local(iter().get_index()) ); | |
| 1501 break; | |
| 1502 | |
| 1503 case Bytecodes::_fload_0: | |
| 1504 case Bytecodes::_iload_0: | |
| 1505 push( local(0) ); | |
| 1506 break; | |
| 1507 case Bytecodes::_fload_1: | |
| 1508 case Bytecodes::_iload_1: | |
| 1509 push( local(1) ); | |
| 1510 break; | |
| 1511 case Bytecodes::_fload_2: | |
| 1512 case Bytecodes::_iload_2: | |
| 1513 push( local(2) ); | |
| 1514 break; | |
| 1515 case Bytecodes::_fload_3: | |
| 1516 case Bytecodes::_iload_3: | |
| 1517 push( local(3) ); | |
| 1518 break; | |
| 1519 case Bytecodes::_fload: | |
| 1520 case Bytecodes::_iload: | |
| 1521 push( local(iter().get_index()) ); | |
| 1522 break; | |
| 1523 case Bytecodes::_lload_0: | |
| 1524 push_pair_local( 0 ); | |
| 1525 break; | |
| 1526 case Bytecodes::_lload_1: | |
| 1527 push_pair_local( 1 ); | |
| 1528 break; | |
| 1529 case Bytecodes::_lload_2: | |
| 1530 push_pair_local( 2 ); | |
| 1531 break; | |
| 1532 case Bytecodes::_lload_3: | |
| 1533 push_pair_local( 3 ); | |
| 1534 break; | |
| 1535 case Bytecodes::_lload: | |
| 1536 push_pair_local( iter().get_index() ); | |
| 1537 break; | |
| 1538 | |
| 1539 case Bytecodes::_dload_0: | |
| 1540 push_pair_local(0); | |
| 1541 break; | |
| 1542 case Bytecodes::_dload_1: | |
| 1543 push_pair_local(1); | |
| 1544 break; | |
| 1545 case Bytecodes::_dload_2: | |
| 1546 push_pair_local(2); | |
| 1547 break; | |
| 1548 case Bytecodes::_dload_3: | |
| 1549 push_pair_local(3); | |
| 1550 break; | |
| 1551 case Bytecodes::_dload: | |
| 1552 push_pair_local(iter().get_index()); | |
| 1553 break; | |
| 1554 case Bytecodes::_fstore_0: | |
| 1555 case Bytecodes::_istore_0: | |
| 1556 case Bytecodes::_astore_0: | |
| 1557 set_local( 0, pop() ); | |
| 1558 break; | |
| 1559 case Bytecodes::_fstore_1: | |
| 1560 case Bytecodes::_istore_1: | |
| 1561 case Bytecodes::_astore_1: | |
| 1562 set_local( 1, pop() ); | |
| 1563 break; | |
| 1564 case Bytecodes::_fstore_2: | |
| 1565 case Bytecodes::_istore_2: | |
| 1566 case Bytecodes::_astore_2: | |
| 1567 set_local( 2, pop() ); | |
| 1568 break; | |
| 1569 case Bytecodes::_fstore_3: | |
| 1570 case Bytecodes::_istore_3: | |
| 1571 case Bytecodes::_astore_3: | |
| 1572 set_local( 3, pop() ); | |
| 1573 break; | |
| 1574 case Bytecodes::_fstore: | |
| 1575 case Bytecodes::_istore: | |
| 1576 case Bytecodes::_astore: | |
| 1577 set_local( iter().get_index(), pop() ); | |
| 1578 break; | |
| 1579 // long stores | |
| 1580 case Bytecodes::_lstore_0: | |
| 1581 set_pair_local( 0, pop_pair() ); | |
| 1582 break; | |
| 1583 case Bytecodes::_lstore_1: | |
| 1584 set_pair_local( 1, pop_pair() ); | |
| 1585 break; | |
| 1586 case Bytecodes::_lstore_2: | |
| 1587 set_pair_local( 2, pop_pair() ); | |
| 1588 break; | |
| 1589 case Bytecodes::_lstore_3: | |
| 1590 set_pair_local( 3, pop_pair() ); | |
| 1591 break; | |
| 1592 case Bytecodes::_lstore: | |
| 1593 set_pair_local( iter().get_index(), pop_pair() ); | |
| 1594 break; | |
| 1595 | |
| 1596 // double stores | |
| 1597 case Bytecodes::_dstore_0: | |
| 1598 set_pair_local( 0, dstore_rounding(pop_pair()) ); | |
| 1599 break; | |
| 1600 case Bytecodes::_dstore_1: | |
| 1601 set_pair_local( 1, dstore_rounding(pop_pair()) ); | |
| 1602 break; | |
| 1603 case Bytecodes::_dstore_2: | |
| 1604 set_pair_local( 2, dstore_rounding(pop_pair()) ); | |
| 1605 break; | |
| 1606 case Bytecodes::_dstore_3: | |
| 1607 set_pair_local( 3, dstore_rounding(pop_pair()) ); | |
| 1608 break; | |
| 1609 case Bytecodes::_dstore: | |
| 1610 set_pair_local( iter().get_index(), dstore_rounding(pop_pair()) ); | |
| 1611 break; | |
| 1612 | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1613 case Bytecodes::_pop: dec_sp(1); break; |
|
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1614 case Bytecodes::_pop2: dec_sp(2); break; |
| 0 | 1615 case Bytecodes::_swap: |
| 1616 a = pop(); | |
| 1617 b = pop(); | |
| 1618 push(a); | |
| 1619 push(b); | |
| 1620 break; | |
| 1621 case Bytecodes::_dup: | |
| 1622 a = pop(); | |
| 1623 push(a); | |
| 1624 push(a); | |
| 1625 break; | |
| 1626 case Bytecodes::_dup_x1: | |
| 1627 a = pop(); | |
| 1628 b = pop(); | |
| 1629 push( a ); | |
| 1630 push( b ); | |
| 1631 push( a ); | |
| 1632 break; | |
| 1633 case Bytecodes::_dup_x2: | |
| 1634 a = pop(); | |
| 1635 b = pop(); | |
| 1636 c = pop(); | |
| 1637 push( a ); | |
| 1638 push( c ); | |
| 1639 push( b ); | |
| 1640 push( a ); | |
| 1641 break; | |
| 1642 case Bytecodes::_dup2: | |
| 1643 a = pop(); | |
| 1644 b = pop(); | |
| 1645 push( b ); | |
| 1646 push( a ); | |
| 1647 push( b ); | |
| 1648 push( a ); | |
| 1649 break; | |
| 1650 | |
| 1651 case Bytecodes::_dup2_x1: | |
| 1652 // before: .. c, b, a | |
| 1653 // after: .. b, a, c, b, a | |
| 1654 // not tested | |
| 1655 a = pop(); | |
| 1656 b = pop(); | |
| 1657 c = pop(); | |
| 1658 push( b ); | |
| 1659 push( a ); | |
| 1660 push( c ); | |
| 1661 push( b ); | |
| 1662 push( a ); | |
| 1663 break; | |
| 1664 case Bytecodes::_dup2_x2: | |
| 1665 // before: .. d, c, b, a | |
| 1666 // after: .. b, a, d, c, b, a | |
| 1667 // not tested | |
| 1668 a = pop(); | |
| 1669 b = pop(); | |
| 1670 c = pop(); | |
| 1671 d = pop(); | |
| 1672 push( b ); | |
| 1673 push( a ); | |
| 1674 push( d ); | |
| 1675 push( c ); | |
| 1676 push( b ); | |
| 1677 push( a ); | |
| 1678 break; | |
| 1679 | |
| 1680 case Bytecodes::_arraylength: { | |
| 1681 // Must do null-check with value on expression stack | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1682 Node *ary = null_check(peek(), T_ARRAY); |
| 0 | 1683 // Compile-time detect of null-exception? |
| 1684 if (stopped()) return; | |
| 1685 a = pop(); | |
| 1686 push(load_array_length(a)); | |
| 1687 break; | |
| 1688 } | |
| 1689 | |
| 1690 case Bytecodes::_baload: array_load(T_BYTE); break; | |
| 1691 case Bytecodes::_caload: array_load(T_CHAR); break; | |
| 1692 case Bytecodes::_iaload: array_load(T_INT); break; | |
| 1693 case Bytecodes::_saload: array_load(T_SHORT); break; | |
| 1694 case Bytecodes::_faload: array_load(T_FLOAT); break; | |
| 1695 case Bytecodes::_aaload: array_load(T_OBJECT); break; | |
| 1696 case Bytecodes::_laload: { | |
| 1697 a = array_addressing(T_LONG, 0); | |
| 605 | 1698 if (stopped()) return; // guaranteed null or range check |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1699 dec_sp(2); // Pop array and index |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
1700 push_pair(make_load(control(), a, TypeLong::LONG, T_LONG, TypeAryPtr::LONGS, MemNode::unordered)); |
| 0 | 1701 break; |
| 1702 } | |
| 1703 case Bytecodes::_daload: { | |
| 1704 a = array_addressing(T_DOUBLE, 0); | |
| 605 | 1705 if (stopped()) return; // guaranteed null or range check |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1706 dec_sp(2); // Pop array and index |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
1707 push_pair(make_load(control(), a, Type::DOUBLE, T_DOUBLE, TypeAryPtr::DOUBLES, MemNode::unordered)); |
| 0 | 1708 break; |
| 1709 } | |
| 1710 case Bytecodes::_bastore: array_store(T_BYTE); break; | |
| 1711 case Bytecodes::_castore: array_store(T_CHAR); break; | |
| 1712 case Bytecodes::_iastore: array_store(T_INT); break; | |
| 1713 case Bytecodes::_sastore: array_store(T_SHORT); break; | |
| 1714 case Bytecodes::_fastore: array_store(T_FLOAT); break; | |
| 1715 case Bytecodes::_aastore: { | |
| 1716 d = array_addressing(T_OBJECT, 1); | |
| 605 | 1717 if (stopped()) return; // guaranteed null or range check |
| 0 | 1718 array_store_check(); |
| 1719 c = pop(); // Oop to store | |
| 1720 b = pop(); // index (already used) | |
| 1721 a = pop(); // the array itself | |
|
827
bf3489cc0aa0
6856025: assert(_base >= OopPtr && _base <= KlassPtr,"Not a Java pointer")
never
parents:
825
diff
changeset
|
1722 const TypeOopPtr* elemtype = _gvn.type(a)->is_aryptr()->elem()->make_oopptr(); |
| 0 | 1723 const TypeAryPtr* adr_type = TypeAryPtr::OOPS; |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
1724 Node* store = store_oop_to_array(control(), a, d, adr_type, c, elemtype, T_OBJECT, MemNode::release); |
| 0 | 1725 break; |
| 1726 } | |
| 1727 case Bytecodes::_lastore: { | |
| 1728 a = array_addressing(T_LONG, 2); | |
| 605 | 1729 if (stopped()) return; // guaranteed null or range check |
| 0 | 1730 c = pop_pair(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1731 dec_sp(2); // Pop array and index |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
1732 store_to_memory(control(), a, c, T_LONG, TypeAryPtr::LONGS, MemNode::unordered); |
| 0 | 1733 break; |
| 1734 } | |
| 1735 case Bytecodes::_dastore: { | |
| 1736 a = array_addressing(T_DOUBLE, 2); | |
| 605 | 1737 if (stopped()) return; // guaranteed null or range check |
| 0 | 1738 c = pop_pair(); |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1739 dec_sp(2); // Pop array and index |
| 0 | 1740 c = dstore_rounding(c); |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
12966
diff
changeset
|
1741 store_to_memory(control(), a, c, T_DOUBLE, TypeAryPtr::DOUBLES, MemNode::unordered); |
| 0 | 1742 break; |
| 1743 } | |
| 1744 case Bytecodes::_getfield: | |
| 1745 do_getfield(); | |
| 1746 break; | |
| 1747 | |
| 1748 case Bytecodes::_getstatic: | |
| 1749 do_getstatic(); | |
| 1750 break; | |
| 1751 | |
| 1752 case Bytecodes::_putfield: | |
| 1753 do_putfield(); | |
| 1754 break; | |
| 1755 | |
| 1756 case Bytecodes::_putstatic: | |
| 1757 do_putstatic(); | |
| 1758 break; | |
| 1759 | |
| 1760 case Bytecodes::_irem: | |
| 1761 do_irem(); | |
| 1762 break; | |
| 1763 case Bytecodes::_idiv: | |
| 1764 // Must keep both values on the expression-stack during null-check | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
1765 zero_check_int(peek()); |
| 0 | 1766 // Compile-time detect of null-exception? |
| 1767 if (stopped()) return; | |
| 1768 b = pop(); | |
| 1769 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1770 push( _gvn.transform( new (C) DivINode(control(),a,b) ) ); |
| 0 | 1771 break; |
| 1772 case Bytecodes::_imul: | |
| 1773 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1774 push( _gvn.transform( new (C) MulINode(a,b) ) ); |
| 0 | 1775 break; |
| 1776 case Bytecodes::_iadd: | |
| 1777 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1778 push( _gvn.transform( new (C) AddINode(a,b) ) ); |
| 0 | 1779 break; |
| 1780 case Bytecodes::_ineg: | |
| 1781 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1782 push( _gvn.transform( new (C) SubINode(_gvn.intcon(0),a)) ); |
| 0 | 1783 break; |
| 1784 case Bytecodes::_isub: | |
| 1785 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1786 push( _gvn.transform( new (C) SubINode(a,b) ) ); |
| 0 | 1787 break; |
| 1788 case Bytecodes::_iand: | |
| 1789 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1790 push( _gvn.transform( new (C) AndINode(a,b) ) ); |
| 0 | 1791 break; |
| 1792 case Bytecodes::_ior: | |
| 1793 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1794 push( _gvn.transform( new (C) OrINode(a,b) ) ); |
| 0 | 1795 break; |
| 1796 case Bytecodes::_ixor: | |
| 1797 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1798 push( _gvn.transform( new (C) XorINode(a,b) ) ); |
| 0 | 1799 break; |
| 1800 case Bytecodes::_ishl: | |
| 1801 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1802 push( _gvn.transform( new (C) LShiftINode(a,b) ) ); |
| 0 | 1803 break; |
| 1804 case Bytecodes::_ishr: | |
| 1805 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1806 push( _gvn.transform( new (C) RShiftINode(a,b) ) ); |
| 0 | 1807 break; |
| 1808 case Bytecodes::_iushr: | |
| 1809 b = pop(); a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1810 push( _gvn.transform( new (C) URShiftINode(a,b) ) ); |
| 0 | 1811 break; |
| 1812 | |
| 1813 case Bytecodes::_fneg: | |
| 1814 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1815 b = _gvn.transform(new (C) NegFNode (a)); |
| 0 | 1816 push(b); |
| 1817 break; | |
| 1818 | |
| 1819 case Bytecodes::_fsub: | |
| 1820 b = pop(); | |
| 1821 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1822 c = _gvn.transform( new (C) SubFNode(a,b) ); |
| 0 | 1823 d = precision_rounding(c); |
| 1824 push( d ); | |
| 1825 break; | |
| 1826 | |
| 1827 case Bytecodes::_fadd: | |
| 1828 b = pop(); | |
| 1829 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1830 c = _gvn.transform( new (C) AddFNode(a,b) ); |
| 0 | 1831 d = precision_rounding(c); |
| 1832 push( d ); | |
| 1833 break; | |
| 1834 | |
| 1835 case Bytecodes::_fmul: | |
| 1836 b = pop(); | |
| 1837 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1838 c = _gvn.transform( new (C) MulFNode(a,b) ); |
| 0 | 1839 d = precision_rounding(c); |
| 1840 push( d ); | |
| 1841 break; | |
| 1842 | |
| 1843 case Bytecodes::_fdiv: | |
| 1844 b = pop(); | |
| 1845 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1846 c = _gvn.transform( new (C) DivFNode(0,a,b) ); |
| 0 | 1847 d = precision_rounding(c); |
| 1848 push( d ); | |
| 1849 break; | |
| 1850 | |
| 1851 case Bytecodes::_frem: | |
| 1852 if (Matcher::has_match_rule(Op_ModF)) { | |
| 1853 // Generate a ModF node. | |
| 1854 b = pop(); | |
| 1855 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1856 c = _gvn.transform( new (C) ModFNode(0,a,b) ); |
| 0 | 1857 d = precision_rounding(c); |
| 1858 push( d ); | |
| 1859 } | |
| 1860 else { | |
| 1861 // Generate a call. | |
| 1862 modf(); | |
| 1863 } | |
| 1864 break; | |
| 1865 | |
| 1866 case Bytecodes::_fcmpl: | |
| 1867 b = pop(); | |
| 1868 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1869 c = _gvn.transform( new (C) CmpF3Node( a, b)); |
| 0 | 1870 push(c); |
| 1871 break; | |
| 1872 case Bytecodes::_fcmpg: | |
| 1873 b = pop(); | |
| 1874 a = pop(); | |
| 1875 | |
| 1876 // Same as fcmpl but need to flip the unordered case. Swap the inputs, | |
| 1877 // which negates the result sign except for unordered. Flip the unordered | |
| 1878 // as well by using CmpF3 which implements unordered-lesser instead of | |
| 1879 // unordered-greater semantics. Finally, commute the result bits. Result | |
| 1880 // is same as using a CmpF3Greater except we did it with CmpF3 alone. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1881 c = _gvn.transform( new (C) CmpF3Node( b, a)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1882 c = _gvn.transform( new (C) SubINode(_gvn.intcon(0),c) ); |
| 0 | 1883 push(c); |
| 1884 break; | |
| 1885 | |
| 1886 case Bytecodes::_f2i: | |
| 1887 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1888 push(_gvn.transform(new (C) ConvF2INode(a))); |
| 0 | 1889 break; |
| 1890 | |
| 1891 case Bytecodes::_d2i: | |
| 1892 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1893 b = _gvn.transform(new (C) ConvD2INode(a)); |
| 0 | 1894 push( b ); |
| 1895 break; | |
| 1896 | |
| 1897 case Bytecodes::_f2d: | |
| 1898 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1899 b = _gvn.transform( new (C) ConvF2DNode(a)); |
| 0 | 1900 push_pair( b ); |
| 1901 break; | |
| 1902 | |
| 1903 case Bytecodes::_d2f: | |
| 1904 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1905 b = _gvn.transform( new (C) ConvD2FNode(a)); |
| 0 | 1906 // This breaks _227_mtrt (speed & correctness) and _222_mpegaudio (speed) |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1907 //b = _gvn.transform(new (C) RoundFloatNode(0, b) ); |
| 0 | 1908 push( b ); |
| 1909 break; | |
| 1910 | |
| 1911 case Bytecodes::_l2f: | |
| 1912 if (Matcher::convL2FSupported()) { | |
| 1913 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1914 b = _gvn.transform( new (C) ConvL2FNode(a)); |
| 0 | 1915 // For i486.ad, FILD doesn't restrict precision to 24 or 53 bits. |
| 1916 // Rather than storing the result into an FP register then pushing | |
| 1917 // out to memory to round, the machine instruction that implements | |
| 1918 // ConvL2D is responsible for rounding. | |
| 1919 // c = precision_rounding(b); | |
| 1920 c = _gvn.transform(b); | |
| 1921 push(c); | |
| 1922 } else { | |
| 1923 l2f(); | |
| 1924 } | |
| 1925 break; | |
| 1926 | |
| 1927 case Bytecodes::_l2d: | |
| 1928 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1929 b = _gvn.transform( new (C) ConvL2DNode(a)); |
| 0 | 1930 // For i486.ad, rounding is always necessary (see _l2f above). |
| 1931 // c = dprecision_rounding(b); | |
| 1932 c = _gvn.transform(b); | |
| 1933 push_pair(c); | |
| 1934 break; | |
| 1935 | |
| 1936 case Bytecodes::_f2l: | |
| 1937 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1938 b = _gvn.transform( new (C) ConvF2LNode(a)); |
| 0 | 1939 push_pair(b); |
| 1940 break; | |
| 1941 | |
| 1942 case Bytecodes::_d2l: | |
| 1943 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1944 b = _gvn.transform( new (C) ConvD2LNode(a)); |
| 0 | 1945 push_pair(b); |
| 1946 break; | |
| 1947 | |
| 1948 case Bytecodes::_dsub: | |
| 1949 b = pop_pair(); | |
| 1950 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1951 c = _gvn.transform( new (C) SubDNode(a,b) ); |
| 0 | 1952 d = dprecision_rounding(c); |
| 1953 push_pair( d ); | |
| 1954 break; | |
| 1955 | |
| 1956 case Bytecodes::_dadd: | |
| 1957 b = pop_pair(); | |
| 1958 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1959 c = _gvn.transform( new (C) AddDNode(a,b) ); |
| 0 | 1960 d = dprecision_rounding(c); |
| 1961 push_pair( d ); | |
| 1962 break; | |
| 1963 | |
| 1964 case Bytecodes::_dmul: | |
| 1965 b = pop_pair(); | |
| 1966 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1967 c = _gvn.transform( new (C) MulDNode(a,b) ); |
| 0 | 1968 d = dprecision_rounding(c); |
| 1969 push_pair( d ); | |
| 1970 break; | |
| 1971 | |
| 1972 case Bytecodes::_ddiv: | |
| 1973 b = pop_pair(); | |
| 1974 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1975 c = _gvn.transform( new (C) DivDNode(0,a,b) ); |
| 0 | 1976 d = dprecision_rounding(c); |
| 1977 push_pair( d ); | |
| 1978 break; | |
| 1979 | |
| 1980 case Bytecodes::_dneg: | |
| 1981 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1982 b = _gvn.transform(new (C) NegDNode (a)); |
| 0 | 1983 push_pair(b); |
| 1984 break; | |
| 1985 | |
| 1986 case Bytecodes::_drem: | |
| 1987 if (Matcher::has_match_rule(Op_ModD)) { | |
| 1988 // Generate a ModD node. | |
| 1989 b = pop_pair(); | |
| 1990 a = pop_pair(); | |
| 1991 // a % b | |
| 1992 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1993 c = _gvn.transform( new (C) ModDNode(0,a,b) ); |
| 0 | 1994 d = dprecision_rounding(c); |
| 1995 push_pair( d ); | |
| 1996 } | |
| 1997 else { | |
| 1998 // Generate a call. | |
| 1999 modd(); | |
| 2000 } | |
| 2001 break; | |
| 2002 | |
| 2003 case Bytecodes::_dcmpl: | |
| 2004 b = pop_pair(); | |
| 2005 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2006 c = _gvn.transform( new (C) CmpD3Node( a, b)); |
| 0 | 2007 push(c); |
| 2008 break; | |
| 2009 | |
| 2010 case Bytecodes::_dcmpg: | |
| 2011 b = pop_pair(); | |
| 2012 a = pop_pair(); | |
| 2013 // Same as dcmpl but need to flip the unordered case. | |
| 2014 // Commute the inputs, which negates the result sign except for unordered. | |
| 2015 // Flip the unordered as well by using CmpD3 which implements | |
| 2016 // unordered-lesser instead of unordered-greater semantics. | |
| 2017 // Finally, negate the result bits. Result is same as using a | |
| 2018 // CmpD3Greater except we did it with CmpD3 alone. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2019 c = _gvn.transform( new (C) CmpD3Node( b, a)); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2020 c = _gvn.transform( new (C) SubINode(_gvn.intcon(0),c) ); |
| 0 | 2021 push(c); |
| 2022 break; | |
| 2023 | |
| 2024 | |
| 2025 // Note for longs -> lo word is on TOS, hi word is on TOS - 1 | |
| 2026 case Bytecodes::_land: | |
| 2027 b = pop_pair(); | |
| 2028 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2029 c = _gvn.transform( new (C) AndLNode(a,b) ); |
| 0 | 2030 push_pair(c); |
| 2031 break; | |
| 2032 case Bytecodes::_lor: | |
| 2033 b = pop_pair(); | |
| 2034 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2035 c = _gvn.transform( new (C) OrLNode(a,b) ); |
| 0 | 2036 push_pair(c); |
| 2037 break; | |
| 2038 case Bytecodes::_lxor: | |
| 2039 b = pop_pair(); | |
| 2040 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2041 c = _gvn.transform( new (C) XorLNode(a,b) ); |
| 0 | 2042 push_pair(c); |
| 2043 break; | |
| 2044 | |
| 2045 case Bytecodes::_lshl: | |
| 2046 b = pop(); // the shift count | |
| 2047 a = pop_pair(); // value to be shifted | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2048 c = _gvn.transform( new (C) LShiftLNode(a,b) ); |
| 0 | 2049 push_pair(c); |
| 2050 break; | |
| 2051 case Bytecodes::_lshr: | |
| 2052 b = pop(); // the shift count | |
| 2053 a = pop_pair(); // value to be shifted | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2054 c = _gvn.transform( new (C) RShiftLNode(a,b) ); |
| 0 | 2055 push_pair(c); |
| 2056 break; | |
| 2057 case Bytecodes::_lushr: | |
| 2058 b = pop(); // the shift count | |
| 2059 a = pop_pair(); // value to be shifted | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2060 c = _gvn.transform( new (C) URShiftLNode(a,b) ); |
| 0 | 2061 push_pair(c); |
| 2062 break; | |
| 2063 case Bytecodes::_lmul: | |
| 2064 b = pop_pair(); | |
| 2065 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2066 c = _gvn.transform( new (C) MulLNode(a,b) ); |
| 0 | 2067 push_pair(c); |
| 2068 break; | |
| 2069 | |
| 2070 case Bytecodes::_lrem: | |
| 2071 // Must keep both values on the expression-stack during null-check | |
| 2072 assert(peek(0) == top(), "long word order"); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
2073 zero_check_long(peek(1)); |
| 0 | 2074 // Compile-time detect of null-exception? |
| 2075 if (stopped()) return; | |
| 2076 b = pop_pair(); | |
| 2077 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2078 c = _gvn.transform( new (C) ModLNode(control(),a,b) ); |
| 0 | 2079 push_pair(c); |
| 2080 break; | |
| 2081 | |
| 2082 case Bytecodes::_ldiv: | |
| 2083 // Must keep both values on the expression-stack during null-check | |
| 2084 assert(peek(0) == top(), "long word order"); | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
2085 zero_check_long(peek(1)); |
| 0 | 2086 // Compile-time detect of null-exception? |
| 2087 if (stopped()) return; | |
| 2088 b = pop_pair(); | |
| 2089 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2090 c = _gvn.transform( new (C) DivLNode(control(),a,b) ); |
| 0 | 2091 push_pair(c); |
| 2092 break; | |
| 2093 | |
| 2094 case Bytecodes::_ladd: | |
| 2095 b = pop_pair(); | |
| 2096 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2097 c = _gvn.transform( new (C) AddLNode(a,b) ); |
| 0 | 2098 push_pair(c); |
| 2099 break; | |
| 2100 case Bytecodes::_lsub: | |
| 2101 b = pop_pair(); | |
| 2102 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2103 c = _gvn.transform( new (C) SubLNode(a,b) ); |
| 0 | 2104 push_pair(c); |
| 2105 break; | |
| 2106 case Bytecodes::_lcmp: | |
| 2107 // Safepoints are now inserted _before_ branches. The long-compare | |
| 2108 // bytecode painfully produces a 3-way value (-1,0,+1) which requires a | |
| 2109 // slew of control flow. These are usually followed by a CmpI vs zero and | |
| 2110 // a branch; this pattern then optimizes to the obvious long-compare and | |
| 2111 // branch. However, if the branch is backwards there's a Safepoint | |
| 2112 // inserted. The inserted Safepoint captures the JVM state at the | |
| 2113 // pre-branch point, i.e. it captures the 3-way value. Thus if a | |
| 2114 // long-compare is used to control a loop the debug info will force | |
| 2115 // computation of the 3-way value, even though the generated code uses a | |
| 2116 // long-compare and branch. We try to rectify the situation by inserting | |
| 2117 // a SafePoint here and have it dominate and kill the safepoint added at a | |
| 2118 // following backwards branch. At this point the JVM state merely holds 2 | |
| 2119 // longs but not the 3-way value. | |
| 2120 if( UseLoopSafepoints ) { | |
| 2121 switch( iter().next_bc() ) { | |
| 2122 case Bytecodes::_ifgt: | |
| 2123 case Bytecodes::_iflt: | |
| 2124 case Bytecodes::_ifge: | |
| 2125 case Bytecodes::_ifle: | |
| 2126 case Bytecodes::_ifne: | |
| 2127 case Bytecodes::_ifeq: | |
| 2128 // If this is a backwards branch in the bytecodes, add Safepoint | |
| 2129 maybe_add_safepoint(iter().next_get_dest()); | |
| 2130 } | |
| 2131 } | |
| 2132 b = pop_pair(); | |
| 2133 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2134 c = _gvn.transform( new (C) CmpL3Node( a, b )); |
| 0 | 2135 push(c); |
| 2136 break; | |
| 2137 | |
| 2138 case Bytecodes::_lneg: | |
| 2139 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2140 b = _gvn.transform( new (C) SubLNode(longcon(0),a)); |
| 0 | 2141 push_pair(b); |
| 2142 break; | |
| 2143 case Bytecodes::_l2i: | |
| 2144 a = pop_pair(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2145 push( _gvn.transform( new (C) ConvL2INode(a))); |
| 0 | 2146 break; |
| 2147 case Bytecodes::_i2l: | |
| 2148 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2149 b = _gvn.transform( new (C) ConvI2LNode(a)); |
| 0 | 2150 push_pair(b); |
| 2151 break; | |
| 2152 case Bytecodes::_i2b: | |
| 2153 // Sign extend | |
| 2154 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2155 a = _gvn.transform( new (C) LShiftINode(a,_gvn.intcon(24)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2156 a = _gvn.transform( new (C) RShiftINode(a,_gvn.intcon(24)) ); |
| 0 | 2157 push( a ); |
| 2158 break; | |
| 2159 case Bytecodes::_i2s: | |
| 2160 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2161 a = _gvn.transform( new (C) LShiftINode(a,_gvn.intcon(16)) ); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2162 a = _gvn.transform( new (C) RShiftINode(a,_gvn.intcon(16)) ); |
| 0 | 2163 push( a ); |
| 2164 break; | |
| 2165 case Bytecodes::_i2c: | |
| 2166 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2167 push( _gvn.transform( new (C) AndINode(a,_gvn.intcon(0xFFFF)) ) ); |
| 0 | 2168 break; |
| 2169 | |
| 2170 case Bytecodes::_i2f: | |
| 2171 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2172 b = _gvn.transform( new (C) ConvI2FNode(a) ) ; |
| 0 | 2173 c = precision_rounding(b); |
| 2174 push (b); | |
| 2175 break; | |
| 2176 | |
| 2177 case Bytecodes::_i2d: | |
| 2178 a = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2179 b = _gvn.transform( new (C) ConvI2DNode(a)); |
| 0 | 2180 push_pair(b); |
| 2181 break; | |
| 2182 | |
| 2183 case Bytecodes::_iinc: // Increment local | |
| 2184 i = iter().get_index(); // Get local index | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2185 set_local( i, _gvn.transform( new (C) AddINode( _gvn.intcon(iter().get_iinc_con()), local(i) ) ) ); |
| 0 | 2186 break; |
| 2187 | |
| 2188 // Exit points of synchronized methods must have an unlock node | |
| 2189 case Bytecodes::_return: | |
| 2190 return_current(NULL); | |
| 2191 break; | |
| 2192 | |
| 2193 case Bytecodes::_ireturn: | |
| 2194 case Bytecodes::_areturn: | |
| 2195 case Bytecodes::_freturn: | |
| 2196 return_current(pop()); | |
| 2197 break; | |
| 2198 case Bytecodes::_lreturn: | |
| 2199 return_current(pop_pair()); | |
| 2200 break; | |
| 2201 case Bytecodes::_dreturn: | |
| 2202 return_current(pop_pair()); | |
| 2203 break; | |
| 2204 | |
| 2205 case Bytecodes::_athrow: | |
| 2206 // null exception oop throws NULL pointer exception | |
|
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6848
diff
changeset
|
2207 null_check(peek()); |
| 0 | 2208 if (stopped()) return; |
| 2209 // Hook the thrown exception directly to subsequent handlers. | |
| 2210 if (BailoutToInterpreterForThrows) { | |
| 2211 // Keep method interpreted from now on. | |
| 2212 uncommon_trap(Deoptimization::Reason_unhandled, | |
| 2213 Deoptimization::Action_make_not_compilable); | |
| 2214 return; | |
| 2215 } | |
|
1213
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1172
diff
changeset
|
2216 if (env()->jvmti_can_post_on_exceptions()) { |
|
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1172
diff
changeset
|
2217 // check if we must post exception events, take uncommon trap if so (with must_throw = false) |
|
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1172
diff
changeset
|
2218 uncommon_trap_if_should_post_on_exceptions(Deoptimization::Reason_unhandled, false); |
|
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1172
diff
changeset
|
2219 } |
|
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1172
diff
changeset
|
2220 // Here if either can_post_on_exceptions or should_post_on_exceptions is false |
| 0 | 2221 add_exception_state(make_exception_state(peek())); |
| 2222 break; | |
| 2223 | |
| 2224 case Bytecodes::_goto: // fall through | |
| 2225 case Bytecodes::_goto_w: { | |
| 2226 int target_bci = (bc() == Bytecodes::_goto) ? iter().get_dest() : iter().get_far_dest(); | |
| 2227 | |
| 2228 // If this is a backwards branch in the bytecodes, add Safepoint | |
| 2229 maybe_add_safepoint(target_bci); | |
| 2230 | |
| 2231 // Update method data | |
| 2232 profile_taken_branch(target_bci); | |
| 2233 | |
| 2234 // Merge the current control into the target basic block | |
| 2235 merge(target_bci); | |
| 2236 | |
| 2237 // See if we can get some profile data and hand it off to the next block | |
| 2238 Block *target_block = block()->successor_for_bci(target_bci); | |
| 2239 if (target_block->pred_count() != 1) break; | |
| 2240 ciMethodData* methodData = method()->method_data(); | |
| 2241 if (!methodData->is_mature()) break; | |
| 2242 ciProfileData* data = methodData->bci_to_data(bci()); | |
| 2243 assert( data->is_JumpData(), "" ); | |
| 2244 int taken = ((ciJumpData*)data)->taken(); | |
| 2245 taken = method()->scale_count(taken); | |
| 2246 target_block->set_count(taken); | |
| 2247 break; | |
| 2248 } | |
| 2249 | |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
2250 case Bytecodes::_ifnull: btest = BoolTest::eq; goto handle_if_null; |
|
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
2251 case Bytecodes::_ifnonnull: btest = BoolTest::ne; goto handle_if_null; |
|
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
2252 handle_if_null: |
|
254
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2253 // If this is a backwards branch in the bytecodes, add Safepoint |
|
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2254 maybe_add_safepoint(iter().get_dest()); |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
2255 a = null(); |
|
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
2256 b = pop(); |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2257 c = _gvn.transform( new (C) CmpPNode(b, a) ); |
|
248
18aab3cdd513
6726504: handle do_ifxxx calls in parser more uniformly
rasbold
parents:
246
diff
changeset
|
2258 do_ifnull(btest, c); |
| 0 | 2259 break; |
| 2260 | |
| 2261 case Bytecodes::_if_acmpeq: btest = BoolTest::eq; goto handle_if_acmp; | |
| 2262 case Bytecodes::_if_acmpne: btest = BoolTest::ne; goto handle_if_acmp; | |
| 2263 handle_if_acmp: | |
|
254
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2264 // If this is a backwards branch in the bytecodes, add Safepoint |
|
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2265 maybe_add_safepoint(iter().get_dest()); |
| 0 | 2266 a = pop(); |
| 2267 b = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2268 c = _gvn.transform( new (C) CmpPNode(b, a) ); |
| 12966 | 2269 c = optimize_cmp_with_klass(c); |
| 0 | 2270 do_if(btest, c); |
| 2271 break; | |
| 2272 | |
| 2273 case Bytecodes::_ifeq: btest = BoolTest::eq; goto handle_ifxx; | |
| 2274 case Bytecodes::_ifne: btest = BoolTest::ne; goto handle_ifxx; | |
| 2275 case Bytecodes::_iflt: btest = BoolTest::lt; goto handle_ifxx; | |
| 2276 case Bytecodes::_ifle: btest = BoolTest::le; goto handle_ifxx; | |
| 2277 case Bytecodes::_ifgt: btest = BoolTest::gt; goto handle_ifxx; | |
| 2278 case Bytecodes::_ifge: btest = BoolTest::ge; goto handle_ifxx; | |
| 2279 handle_ifxx: | |
|
254
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2280 // If this is a backwards branch in the bytecodes, add Safepoint |
|
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2281 maybe_add_safepoint(iter().get_dest()); |
| 0 | 2282 a = _gvn.intcon(0); |
| 2283 b = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2284 c = _gvn.transform( new (C) CmpINode(b, a) ); |
| 0 | 2285 do_if(btest, c); |
| 2286 break; | |
| 2287 | |
| 2288 case Bytecodes::_if_icmpeq: btest = BoolTest::eq; goto handle_if_icmp; | |
| 2289 case Bytecodes::_if_icmpne: btest = BoolTest::ne; goto handle_if_icmp; | |
| 2290 case Bytecodes::_if_icmplt: btest = BoolTest::lt; goto handle_if_icmp; | |
| 2291 case Bytecodes::_if_icmple: btest = BoolTest::le; goto handle_if_icmp; | |
| 2292 case Bytecodes::_if_icmpgt: btest = BoolTest::gt; goto handle_if_icmp; | |
| 2293 case Bytecodes::_if_icmpge: btest = BoolTest::ge; goto handle_if_icmp; | |
| 2294 handle_if_icmp: | |
|
254
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2295 // If this is a backwards branch in the bytecodes, add Safepoint |
|
3e333d6f35dd
6730192: expression stack wrong at deoptimization point
rasbold
parents:
248
diff
changeset
|
2296 maybe_add_safepoint(iter().get_dest()); |
| 0 | 2297 a = pop(); |
| 2298 b = pop(); | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
2299 c = _gvn.transform( new (C) CmpINode( b, a ) ); |
| 0 | 2300 do_if(btest, c); |
| 2301 break; | |
| 2302 | |
| 2303 case Bytecodes::_tableswitch: | |
| 2304 do_tableswitch(); | |
| 2305 break; | |
| 2306 | |
| 2307 case Bytecodes::_lookupswitch: | |
| 2308 do_lookupswitch(); | |
| 2309 break; | |
| 2310 | |
| 2311 case Bytecodes::_invokestatic: | |
|
726
be93aad57795
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
605
diff
changeset
|
2312 case Bytecodes::_invokedynamic: |
| 0 | 2313 case Bytecodes::_invokespecial: |
| 2314 case Bytecodes::_invokevirtual: | |
| 2315 case Bytecodes::_invokeinterface: | |
| 2316 do_call(); | |
| 2317 break; | |
| 2318 case Bytecodes::_checkcast: | |
| 2319 do_checkcast(); | |
| 2320 break; | |
| 2321 case Bytecodes::_instanceof: | |
| 2322 do_instanceof(); | |
| 2323 break; | |
| 2324 case Bytecodes::_anewarray: | |
| 2325 do_anewarray(); | |
| 2326 break; | |
| 2327 case Bytecodes::_newarray: | |
| 2328 do_newarray((BasicType)iter().get_index()); | |
| 2329 break; | |
| 2330 case Bytecodes::_multianewarray: | |
| 2331 do_multianewarray(); | |
| 2332 break; | |
| 2333 case Bytecodes::_new: | |
| 2334 do_new(); | |
| 2335 break; | |
| 2336 | |
| 2337 case Bytecodes::_jsr: | |
| 2338 case Bytecodes::_jsr_w: | |
| 2339 do_jsr(); | |
| 2340 break; | |
| 2341 | |
| 2342 case Bytecodes::_ret: | |
| 2343 do_ret(); | |
| 2344 break; | |
| 2345 | |
| 2346 | |
| 2347 case Bytecodes::_monitorenter: | |
| 2348 do_monitor_enter(); | |
| 2349 break; | |
| 2350 | |
| 2351 case Bytecodes::_monitorexit: | |
| 2352 do_monitor_exit(); | |
| 2353 break; | |
| 2354 | |
| 2355 case Bytecodes::_breakpoint: | |
| 2356 // Breakpoint set concurrently to compile | |
| 2357 // %%% use an uncommon trap? | |
| 2358 C->record_failure("breakpoint in method"); | |
| 2359 return; | |
| 2360 | |
| 2361 default: | |
| 2362 #ifndef PRODUCT | |
| 2363 map()->dump(99); | |
| 2364 #endif | |
| 2365 tty->print("\nUnhandled bytecode %s\n", Bytecodes::name(bc()) ); | |
| 2366 ShouldNotReachHere(); | |
| 2367 } | |
| 2368 | |
| 2369 #ifndef PRODUCT | |
| 2370 IdealGraphPrinter *printer = IdealGraphPrinter::printer(); | |
| 2371 if(printer) { | |
| 2372 char buffer[256]; | |
| 2373 sprintf(buffer, "Bytecode %d: %s", bci(), Bytecodes::name(bc())); | |
| 2374 bool old = printer->traverse_outs(); | |
| 2375 printer->set_traverse_outs(true); | |
| 222 | 2376 printer->print_method(C, buffer, 4); |
| 0 | 2377 printer->set_traverse_outs(old); |
| 2378 } | |
| 2379 #endif | |
| 2380 } |