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