Tue, 11 Sep 2012 16:20:57 +0200
7195816: NPG: Crash in c1_ValueType - ShouldNotReachHere
Summary: C1 needs knowledge of T_METADATA at the LIR level.
Reviewed-by: kvn, coleenp
duke@435 | 1 | /* |
kvn@3604 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. 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 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 27 | #include "opto/addnode.hpp" |
stefank@2314 | 28 | #include "opto/compile.hpp" |
stefank@2314 | 29 | #include "opto/connode.hpp" |
stefank@2314 | 30 | #include "opto/machnode.hpp" |
stefank@2314 | 31 | #include "opto/matcher.hpp" |
stefank@2314 | 32 | #include "opto/memnode.hpp" |
stefank@2314 | 33 | #include "opto/phaseX.hpp" |
stefank@2314 | 34 | #include "opto/subnode.hpp" |
stefank@2314 | 35 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 36 | |
duke@435 | 37 | // Optimization - Graph Style |
duke@435 | 38 | |
duke@435 | 39 | //============================================================================= |
duke@435 | 40 | //------------------------------hash------------------------------------------- |
duke@435 | 41 | uint ConNode::hash() const { |
duke@435 | 42 | return (uintptr_t)in(TypeFunc::Control) + _type->hash(); |
duke@435 | 43 | } |
duke@435 | 44 | |
duke@435 | 45 | //------------------------------make------------------------------------------- |
duke@435 | 46 | ConNode *ConNode::make( Compile* C, const Type *t ) { |
duke@435 | 47 | switch( t->basic_type() ) { |
duke@435 | 48 | case T_INT: return new (C, 1) ConINode( t->is_int() ); |
duke@435 | 49 | case T_LONG: return new (C, 1) ConLNode( t->is_long() ); |
duke@435 | 50 | case T_FLOAT: return new (C, 1) ConFNode( t->is_float_constant() ); |
duke@435 | 51 | case T_DOUBLE: return new (C, 1) ConDNode( t->is_double_constant() ); |
duke@435 | 52 | case T_VOID: return new (C, 1) ConNode ( Type::TOP ); |
coleenp@4037 | 53 | case T_OBJECT: return new (C, 1) ConPNode( t->is_ptr() ); |
kvn@599 | 54 | case T_ARRAY: return new (C, 1) ConPNode( t->is_aryptr() ); |
duke@435 | 55 | case T_ADDRESS: return new (C, 1) ConPNode( t->is_ptr() ); |
kvn@603 | 56 | case T_NARROWOOP: return new (C, 1) ConNNode( t->is_narrowoop() ); |
coleenp@4037 | 57 | case T_METADATA: return new (C, 1) ConPNode( t->is_ptr() ); |
duke@435 | 58 | // Expected cases: TypePtr::NULL_PTR, any is_rawptr() |
duke@435 | 59 | // Also seen: AnyPtr(TopPTR *+top); from command line: |
duke@435 | 60 | // r -XX:+PrintOpto -XX:CIStart=285 -XX:+CompileTheWorld -XX:CompileTheWorldStartAt=660 |
duke@435 | 61 | // %%%% Stop using TypePtr::NULL_PTR to represent nulls: use either TypeRawPtr::NULL_PTR |
duke@435 | 62 | // or else TypeOopPtr::NULL_PTR. Then set Type::_basic_type[AnyPtr] = T_ILLEGAL |
duke@435 | 63 | } |
duke@435 | 64 | ShouldNotReachHere(); |
duke@435 | 65 | return NULL; |
duke@435 | 66 | } |
duke@435 | 67 | |
duke@435 | 68 | //============================================================================= |
duke@435 | 69 | /* |
duke@435 | 70 | The major change is for CMoveP and StrComp. They have related but slightly |
duke@435 | 71 | different problems. They both take in TWO oops which are both null-checked |
duke@435 | 72 | independently before the using Node. After CCP removes the CastPP's they need |
duke@435 | 73 | to pick up the guarding test edge - in this case TWO control edges. I tried |
duke@435 | 74 | various solutions, all have problems: |
duke@435 | 75 | |
duke@435 | 76 | (1) Do nothing. This leads to a bug where we hoist a Load from a CMoveP or a |
duke@435 | 77 | StrComp above a guarding null check. I've seen both cases in normal -Xcomp |
duke@435 | 78 | testing. |
duke@435 | 79 | |
duke@435 | 80 | (2) Plug the control edge from 1 of the 2 oops in. Apparent problem here is |
duke@435 | 81 | to figure out which test post-dominates. The real problem is that it doesn't |
duke@435 | 82 | matter which one you pick. After you pick up, the dominating-test elider in |
duke@435 | 83 | IGVN can remove the test and allow you to hoist up to the dominating test on |
twisti@1040 | 84 | the chosen oop bypassing the test on the not-chosen oop. Seen in testing. |
duke@435 | 85 | Oops. |
duke@435 | 86 | |
duke@435 | 87 | (3) Leave the CastPP's in. This makes the graph more accurate in some sense; |
duke@435 | 88 | we get to keep around the knowledge that an oop is not-null after some test. |
duke@435 | 89 | Alas, the CastPP's interfere with GVN (some values are the regular oop, some |
duke@435 | 90 | are the CastPP of the oop, all merge at Phi's which cannot collapse, etc). |
duke@435 | 91 | This cost us 10% on SpecJVM, even when I removed some of the more trivial |
duke@435 | 92 | cases in the optimizer. Removing more useless Phi's started allowing Loads to |
duke@435 | 93 | illegally float above null checks. I gave up on this approach. |
duke@435 | 94 | |
duke@435 | 95 | (4) Add BOTH control edges to both tests. Alas, too much code knows that |
duke@435 | 96 | control edges are in slot-zero ONLY. Many quick asserts fail; no way to do |
duke@435 | 97 | this one. Note that I really want to allow the CMoveP to float and add both |
duke@435 | 98 | control edges to the dependent Load op - meaning I can select early but I |
duke@435 | 99 | cannot Load until I pass both tests. |
duke@435 | 100 | |
duke@435 | 101 | (5) Do not hoist CMoveP and StrComp. To this end I added the v-call |
duke@435 | 102 | depends_only_on_test(). No obvious performance loss on Spec, but we are |
duke@435 | 103 | clearly conservative on CMoveP (also so on StrComp but that's unlikely to |
duke@435 | 104 | matter ever). |
duke@435 | 105 | |
duke@435 | 106 | */ |
duke@435 | 107 | |
duke@435 | 108 | |
duke@435 | 109 | //------------------------------Ideal------------------------------------------ |
duke@435 | 110 | // Return a node which is more "ideal" than the current node. |
duke@435 | 111 | // Move constants to the right. |
duke@435 | 112 | Node *CMoveNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 113 | if( in(0) && remove_dead_region(phase, can_reshape) ) return this; |
kvn@740 | 114 | // Don't bother trying to transform a dead node |
kvn@740 | 115 | if( in(0) && in(0)->is_top() ) return NULL; |
duke@435 | 116 | assert( !phase->eqv(in(Condition), this) && |
duke@435 | 117 | !phase->eqv(in(IfFalse), this) && |
duke@435 | 118 | !phase->eqv(in(IfTrue), this), "dead loop in CMoveNode::Ideal" ); |
duke@435 | 119 | if( phase->type(in(Condition)) == Type::TOP ) |
duke@435 | 120 | return NULL; // return NULL when Condition is dead |
duke@435 | 121 | |
duke@435 | 122 | if( in(IfFalse)->is_Con() && !in(IfTrue)->is_Con() ) { |
duke@435 | 123 | if( in(Condition)->is_Bool() ) { |
duke@435 | 124 | BoolNode* b = in(Condition)->as_Bool(); |
duke@435 | 125 | BoolNode* b2 = b->negate(phase); |
duke@435 | 126 | return make( phase->C, in(Control), phase->transform(b2), in(IfTrue), in(IfFalse), _type ); |
duke@435 | 127 | } |
duke@435 | 128 | } |
duke@435 | 129 | return NULL; |
duke@435 | 130 | } |
duke@435 | 131 | |
duke@435 | 132 | //------------------------------is_cmove_id------------------------------------ |
duke@435 | 133 | // Helper function to check for CMOVE identity. Shared with PhiNode::Identity |
duke@435 | 134 | Node *CMoveNode::is_cmove_id( PhaseTransform *phase, Node *cmp, Node *t, Node *f, BoolNode *b ) { |
duke@435 | 135 | // Check for Cmp'ing and CMove'ing same values |
duke@435 | 136 | if( (phase->eqv(cmp->in(1),f) && |
duke@435 | 137 | phase->eqv(cmp->in(2),t)) || |
duke@435 | 138 | // Swapped Cmp is OK |
duke@435 | 139 | (phase->eqv(cmp->in(2),f) && |
duke@435 | 140 | phase->eqv(cmp->in(1),t)) ) { |
cfang@1190 | 141 | // Give up this identity check for floating points because it may choose incorrect |
cfang@1190 | 142 | // value around 0.0 and -0.0 |
cfang@1190 | 143 | if ( cmp->Opcode()==Op_CmpF || cmp->Opcode()==Op_CmpD ) |
cfang@1190 | 144 | return NULL; |
duke@435 | 145 | // Check for "(t==f)?t:f;" and replace with "f" |
duke@435 | 146 | if( b->_test._test == BoolTest::eq ) |
duke@435 | 147 | return f; |
duke@435 | 148 | // Allow the inverted case as well |
duke@435 | 149 | // Check for "(t!=f)?t:f;" and replace with "t" |
duke@435 | 150 | if( b->_test._test == BoolTest::ne ) |
duke@435 | 151 | return t; |
duke@435 | 152 | } |
duke@435 | 153 | return NULL; |
duke@435 | 154 | } |
duke@435 | 155 | |
duke@435 | 156 | //------------------------------Identity--------------------------------------- |
duke@435 | 157 | // Conditional-move is an identity if both inputs are the same, or the test |
duke@435 | 158 | // true or false. |
duke@435 | 159 | Node *CMoveNode::Identity( PhaseTransform *phase ) { |
duke@435 | 160 | if( phase->eqv(in(IfFalse),in(IfTrue)) ) // C-moving identical inputs? |
duke@435 | 161 | return in(IfFalse); // Then it doesn't matter |
duke@435 | 162 | if( phase->type(in(Condition)) == TypeInt::ZERO ) |
duke@435 | 163 | return in(IfFalse); // Always pick left(false) input |
duke@435 | 164 | if( phase->type(in(Condition)) == TypeInt::ONE ) |
duke@435 | 165 | return in(IfTrue); // Always pick right(true) input |
duke@435 | 166 | |
duke@435 | 167 | // Check for CMove'ing a constant after comparing against the constant. |
duke@435 | 168 | // Happens all the time now, since if we compare equality vs a constant in |
duke@435 | 169 | // the parser, we "know" the variable is constant on one path and we force |
duke@435 | 170 | // it. Thus code like "if( x==0 ) {/*EMPTY*/}" ends up inserting a |
duke@435 | 171 | // conditional move: "x = (x==0)?0:x;". Yucko. This fix is slightly more |
duke@435 | 172 | // general in that we don't need constants. |
duke@435 | 173 | if( in(Condition)->is_Bool() ) { |
duke@435 | 174 | BoolNode *b = in(Condition)->as_Bool(); |
duke@435 | 175 | Node *cmp = b->in(1); |
duke@435 | 176 | if( cmp->is_Cmp() ) { |
duke@435 | 177 | Node *id = is_cmove_id( phase, cmp, in(IfTrue), in(IfFalse), b ); |
duke@435 | 178 | if( id ) return id; |
duke@435 | 179 | } |
duke@435 | 180 | } |
duke@435 | 181 | |
duke@435 | 182 | return this; |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | //------------------------------Value------------------------------------------ |
duke@435 | 186 | // Result is the meet of inputs |
duke@435 | 187 | const Type *CMoveNode::Value( PhaseTransform *phase ) const { |
duke@435 | 188 | if( phase->type(in(Condition)) == Type::TOP ) |
duke@435 | 189 | return Type::TOP; |
duke@435 | 190 | return phase->type(in(IfFalse))->meet(phase->type(in(IfTrue))); |
duke@435 | 191 | } |
duke@435 | 192 | |
duke@435 | 193 | //------------------------------make------------------------------------------- |
duke@435 | 194 | // Make a correctly-flavored CMove. Since _type is directly determined |
duke@435 | 195 | // from the inputs we do not need to specify it here. |
duke@435 | 196 | CMoveNode *CMoveNode::make( Compile *C, Node *c, Node *bol, Node *left, Node *right, const Type *t ) { |
duke@435 | 197 | switch( t->basic_type() ) { |
duke@435 | 198 | case T_INT: return new (C, 4) CMoveINode( bol, left, right, t->is_int() ); |
duke@435 | 199 | case T_FLOAT: return new (C, 4) CMoveFNode( bol, left, right, t ); |
duke@435 | 200 | case T_DOUBLE: return new (C, 4) CMoveDNode( bol, left, right, t ); |
duke@435 | 201 | case T_LONG: return new (C, 4) CMoveLNode( bol, left, right, t->is_long() ); |
duke@435 | 202 | case T_OBJECT: return new (C, 4) CMovePNode( c, bol, left, right, t->is_oopptr() ); |
duke@435 | 203 | case T_ADDRESS: return new (C, 4) CMovePNode( c, bol, left, right, t->is_ptr() ); |
kvn@599 | 204 | case T_NARROWOOP: return new (C, 4) CMoveNNode( c, bol, left, right, t ); |
duke@435 | 205 | default: |
duke@435 | 206 | ShouldNotReachHere(); |
duke@435 | 207 | return NULL; |
duke@435 | 208 | } |
duke@435 | 209 | } |
duke@435 | 210 | |
duke@435 | 211 | //============================================================================= |
duke@435 | 212 | //------------------------------Ideal------------------------------------------ |
duke@435 | 213 | // Return a node which is more "ideal" than the current node. |
duke@435 | 214 | // Check for conversions to boolean |
duke@435 | 215 | Node *CMoveINode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 216 | // Try generic ideal's first |
duke@435 | 217 | Node *x = CMoveNode::Ideal(phase, can_reshape); |
duke@435 | 218 | if( x ) return x; |
duke@435 | 219 | |
duke@435 | 220 | // If zero is on the left (false-case, no-move-case) it must mean another |
duke@435 | 221 | // constant is on the right (otherwise the shared CMove::Ideal code would |
duke@435 | 222 | // have moved the constant to the right). This situation is bad for Intel |
duke@435 | 223 | // and a don't-care for Sparc. It's bad for Intel because the zero has to |
duke@435 | 224 | // be manifested in a register with a XOR which kills flags, which are live |
duke@435 | 225 | // on input to the CMoveI, leading to a situation which causes excessive |
duke@435 | 226 | // spilling on Intel. For Sparc, if the zero in on the left the Sparc will |
duke@435 | 227 | // zero a register via G0 and conditionally-move the other constant. If the |
duke@435 | 228 | // zero is on the right, the Sparc will load the first constant with a |
duke@435 | 229 | // 13-bit set-lo and conditionally move G0. See bug 4677505. |
duke@435 | 230 | if( phase->type(in(IfFalse)) == TypeInt::ZERO && !(phase->type(in(IfTrue)) == TypeInt::ZERO) ) { |
duke@435 | 231 | if( in(Condition)->is_Bool() ) { |
duke@435 | 232 | BoolNode* b = in(Condition)->as_Bool(); |
duke@435 | 233 | BoolNode* b2 = b->negate(phase); |
duke@435 | 234 | return make( phase->C, in(Control), phase->transform(b2), in(IfTrue), in(IfFalse), _type ); |
duke@435 | 235 | } |
duke@435 | 236 | } |
duke@435 | 237 | |
duke@435 | 238 | // Now check for booleans |
duke@435 | 239 | int flip = 0; |
duke@435 | 240 | |
duke@435 | 241 | // Check for picking from zero/one |
duke@435 | 242 | if( phase->type(in(IfFalse)) == TypeInt::ZERO && phase->type(in(IfTrue)) == TypeInt::ONE ) { |
duke@435 | 243 | flip = 1 - flip; |
duke@435 | 244 | } else if( phase->type(in(IfFalse)) == TypeInt::ONE && phase->type(in(IfTrue)) == TypeInt::ZERO ) { |
duke@435 | 245 | } else return NULL; |
duke@435 | 246 | |
duke@435 | 247 | // Check for eq/ne test |
duke@435 | 248 | if( !in(1)->is_Bool() ) return NULL; |
duke@435 | 249 | BoolNode *bol = in(1)->as_Bool(); |
duke@435 | 250 | if( bol->_test._test == BoolTest::eq ) { |
duke@435 | 251 | } else if( bol->_test._test == BoolTest::ne ) { |
duke@435 | 252 | flip = 1-flip; |
duke@435 | 253 | } else return NULL; |
duke@435 | 254 | |
duke@435 | 255 | // Check for vs 0 or 1 |
duke@435 | 256 | if( !bol->in(1)->is_Cmp() ) return NULL; |
duke@435 | 257 | const CmpNode *cmp = bol->in(1)->as_Cmp(); |
duke@435 | 258 | if( phase->type(cmp->in(2)) == TypeInt::ZERO ) { |
duke@435 | 259 | } else if( phase->type(cmp->in(2)) == TypeInt::ONE ) { |
duke@435 | 260 | // Allow cmp-vs-1 if the other input is bounded by 0-1 |
duke@435 | 261 | if( phase->type(cmp->in(1)) != TypeInt::BOOL ) |
duke@435 | 262 | return NULL; |
duke@435 | 263 | flip = 1 - flip; |
duke@435 | 264 | } else return NULL; |
duke@435 | 265 | |
duke@435 | 266 | // Convert to a bool (flipped) |
duke@435 | 267 | // Build int->bool conversion |
duke@435 | 268 | #ifndef PRODUCT |
duke@435 | 269 | if( PrintOpto ) tty->print_cr("CMOV to I2B"); |
duke@435 | 270 | #endif |
duke@435 | 271 | Node *n = new (phase->C, 2) Conv2BNode( cmp->in(1) ); |
duke@435 | 272 | if( flip ) |
duke@435 | 273 | n = new (phase->C, 3) XorINode( phase->transform(n), phase->intcon(1) ); |
duke@435 | 274 | |
duke@435 | 275 | return n; |
duke@435 | 276 | } |
duke@435 | 277 | |
duke@435 | 278 | //============================================================================= |
duke@435 | 279 | //------------------------------Ideal------------------------------------------ |
duke@435 | 280 | // Return a node which is more "ideal" than the current node. |
duke@435 | 281 | // Check for absolute value |
duke@435 | 282 | Node *CMoveFNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 283 | // Try generic ideal's first |
duke@435 | 284 | Node *x = CMoveNode::Ideal(phase, can_reshape); |
duke@435 | 285 | if( x ) return x; |
duke@435 | 286 | |
duke@435 | 287 | int cmp_zero_idx = 0; // Index of compare input where to look for zero |
duke@435 | 288 | int phi_x_idx = 0; // Index of phi input where to find naked x |
duke@435 | 289 | |
duke@435 | 290 | // Find the Bool |
duke@435 | 291 | if( !in(1)->is_Bool() ) return NULL; |
duke@435 | 292 | BoolNode *bol = in(1)->as_Bool(); |
duke@435 | 293 | // Check bool sense |
duke@435 | 294 | switch( bol->_test._test ) { |
duke@435 | 295 | case BoolTest::lt: cmp_zero_idx = 1; phi_x_idx = IfTrue; break; |
duke@435 | 296 | case BoolTest::le: cmp_zero_idx = 2; phi_x_idx = IfFalse; break; |
duke@435 | 297 | case BoolTest::gt: cmp_zero_idx = 2; phi_x_idx = IfTrue; break; |
duke@435 | 298 | case BoolTest::ge: cmp_zero_idx = 1; phi_x_idx = IfFalse; break; |
duke@435 | 299 | default: return NULL; break; |
duke@435 | 300 | } |
duke@435 | 301 | |
duke@435 | 302 | // Find zero input of CmpF; the other input is being abs'd |
duke@435 | 303 | Node *cmpf = bol->in(1); |
duke@435 | 304 | if( cmpf->Opcode() != Op_CmpF ) return NULL; |
duke@435 | 305 | Node *X = NULL; |
duke@435 | 306 | bool flip = false; |
duke@435 | 307 | if( phase->type(cmpf->in(cmp_zero_idx)) == TypeF::ZERO ) { |
duke@435 | 308 | X = cmpf->in(3 - cmp_zero_idx); |
duke@435 | 309 | } else if (phase->type(cmpf->in(3 - cmp_zero_idx)) == TypeF::ZERO) { |
duke@435 | 310 | // The test is inverted, we should invert the result... |
duke@435 | 311 | X = cmpf->in(cmp_zero_idx); |
duke@435 | 312 | flip = true; |
duke@435 | 313 | } else { |
duke@435 | 314 | return NULL; |
duke@435 | 315 | } |
duke@435 | 316 | |
duke@435 | 317 | // If X is found on the appropriate phi input, find the subtract on the other |
duke@435 | 318 | if( X != in(phi_x_idx) ) return NULL; |
duke@435 | 319 | int phi_sub_idx = phi_x_idx == IfTrue ? IfFalse : IfTrue; |
duke@435 | 320 | Node *sub = in(phi_sub_idx); |
duke@435 | 321 | |
duke@435 | 322 | // Allow only SubF(0,X) and fail out for all others; NegF is not OK |
duke@435 | 323 | if( sub->Opcode() != Op_SubF || |
duke@435 | 324 | sub->in(2) != X || |
duke@435 | 325 | phase->type(sub->in(1)) != TypeF::ZERO ) return NULL; |
duke@435 | 326 | |
duke@435 | 327 | Node *abs = new (phase->C, 2) AbsFNode( X ); |
duke@435 | 328 | if( flip ) |
duke@435 | 329 | abs = new (phase->C, 3) SubFNode(sub->in(1), phase->transform(abs)); |
duke@435 | 330 | |
duke@435 | 331 | return abs; |
duke@435 | 332 | } |
duke@435 | 333 | |
duke@435 | 334 | //============================================================================= |
duke@435 | 335 | //------------------------------Ideal------------------------------------------ |
duke@435 | 336 | // Return a node which is more "ideal" than the current node. |
duke@435 | 337 | // Check for absolute value |
duke@435 | 338 | Node *CMoveDNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 339 | // Try generic ideal's first |
duke@435 | 340 | Node *x = CMoveNode::Ideal(phase, can_reshape); |
duke@435 | 341 | if( x ) return x; |
duke@435 | 342 | |
duke@435 | 343 | int cmp_zero_idx = 0; // Index of compare input where to look for zero |
duke@435 | 344 | int phi_x_idx = 0; // Index of phi input where to find naked x |
duke@435 | 345 | |
duke@435 | 346 | // Find the Bool |
duke@435 | 347 | if( !in(1)->is_Bool() ) return NULL; |
duke@435 | 348 | BoolNode *bol = in(1)->as_Bool(); |
duke@435 | 349 | // Check bool sense |
duke@435 | 350 | switch( bol->_test._test ) { |
duke@435 | 351 | case BoolTest::lt: cmp_zero_idx = 1; phi_x_idx = IfTrue; break; |
duke@435 | 352 | case BoolTest::le: cmp_zero_idx = 2; phi_x_idx = IfFalse; break; |
duke@435 | 353 | case BoolTest::gt: cmp_zero_idx = 2; phi_x_idx = IfTrue; break; |
duke@435 | 354 | case BoolTest::ge: cmp_zero_idx = 1; phi_x_idx = IfFalse; break; |
duke@435 | 355 | default: return NULL; break; |
duke@435 | 356 | } |
duke@435 | 357 | |
duke@435 | 358 | // Find zero input of CmpD; the other input is being abs'd |
duke@435 | 359 | Node *cmpd = bol->in(1); |
duke@435 | 360 | if( cmpd->Opcode() != Op_CmpD ) return NULL; |
duke@435 | 361 | Node *X = NULL; |
duke@435 | 362 | bool flip = false; |
duke@435 | 363 | if( phase->type(cmpd->in(cmp_zero_idx)) == TypeD::ZERO ) { |
duke@435 | 364 | X = cmpd->in(3 - cmp_zero_idx); |
duke@435 | 365 | } else if (phase->type(cmpd->in(3 - cmp_zero_idx)) == TypeD::ZERO) { |
duke@435 | 366 | // The test is inverted, we should invert the result... |
duke@435 | 367 | X = cmpd->in(cmp_zero_idx); |
duke@435 | 368 | flip = true; |
duke@435 | 369 | } else { |
duke@435 | 370 | return NULL; |
duke@435 | 371 | } |
duke@435 | 372 | |
duke@435 | 373 | // If X is found on the appropriate phi input, find the subtract on the other |
duke@435 | 374 | if( X != in(phi_x_idx) ) return NULL; |
duke@435 | 375 | int phi_sub_idx = phi_x_idx == IfTrue ? IfFalse : IfTrue; |
duke@435 | 376 | Node *sub = in(phi_sub_idx); |
duke@435 | 377 | |
duke@435 | 378 | // Allow only SubD(0,X) and fail out for all others; NegD is not OK |
duke@435 | 379 | if( sub->Opcode() != Op_SubD || |
duke@435 | 380 | sub->in(2) != X || |
duke@435 | 381 | phase->type(sub->in(1)) != TypeD::ZERO ) return NULL; |
duke@435 | 382 | |
duke@435 | 383 | Node *abs = new (phase->C, 2) AbsDNode( X ); |
duke@435 | 384 | if( flip ) |
duke@435 | 385 | abs = new (phase->C, 3) SubDNode(sub->in(1), phase->transform(abs)); |
duke@435 | 386 | |
duke@435 | 387 | return abs; |
duke@435 | 388 | } |
duke@435 | 389 | |
duke@435 | 390 | |
duke@435 | 391 | //============================================================================= |
duke@435 | 392 | // If input is already higher or equal to cast type, then this is an identity. |
duke@435 | 393 | Node *ConstraintCastNode::Identity( PhaseTransform *phase ) { |
duke@435 | 394 | return phase->type(in(1))->higher_equal(_type) ? in(1) : this; |
duke@435 | 395 | } |
duke@435 | 396 | |
duke@435 | 397 | //------------------------------Value------------------------------------------ |
duke@435 | 398 | // Take 'join' of input and cast-up type |
duke@435 | 399 | const Type *ConstraintCastNode::Value( PhaseTransform *phase ) const { |
duke@435 | 400 | if( in(0) && phase->type(in(0)) == Type::TOP ) return Type::TOP; |
duke@435 | 401 | const Type* ft = phase->type(in(1))->filter(_type); |
duke@435 | 402 | |
duke@435 | 403 | #ifdef ASSERT |
duke@435 | 404 | // Previous versions of this function had some special case logic, |
duke@435 | 405 | // which is no longer necessary. Make sure of the required effects. |
duke@435 | 406 | switch (Opcode()) { |
duke@435 | 407 | case Op_CastII: |
duke@435 | 408 | { |
duke@435 | 409 | const Type* t1 = phase->type(in(1)); |
duke@435 | 410 | if( t1 == Type::TOP ) assert(ft == Type::TOP, "special case #1"); |
duke@435 | 411 | const Type* rt = t1->join(_type); |
duke@435 | 412 | if (rt->empty()) assert(ft == Type::TOP, "special case #2"); |
duke@435 | 413 | break; |
duke@435 | 414 | } |
duke@435 | 415 | case Op_CastPP: |
duke@435 | 416 | if (phase->type(in(1)) == TypePtr::NULL_PTR && |
duke@435 | 417 | _type->isa_ptr() && _type->is_ptr()->_ptr == TypePtr::NotNull) |
duke@435 | 418 | assert(ft == Type::TOP, "special case #3"); |
duke@435 | 419 | break; |
duke@435 | 420 | } |
duke@435 | 421 | #endif //ASSERT |
duke@435 | 422 | |
duke@435 | 423 | return ft; |
duke@435 | 424 | } |
duke@435 | 425 | |
duke@435 | 426 | //------------------------------Ideal------------------------------------------ |
duke@435 | 427 | // Return a node which is more "ideal" than the current node. Strip out |
duke@435 | 428 | // control copies |
duke@435 | 429 | Node *ConstraintCastNode::Ideal(PhaseGVN *phase, bool can_reshape){ |
duke@435 | 430 | return (in(0) && remove_dead_region(phase, can_reshape)) ? this : NULL; |
duke@435 | 431 | } |
duke@435 | 432 | |
duke@435 | 433 | //------------------------------Ideal_DU_postCCP------------------------------- |
duke@435 | 434 | // Throw away cast after constant propagation |
duke@435 | 435 | Node *ConstraintCastNode::Ideal_DU_postCCP( PhaseCCP *ccp ) { |
duke@435 | 436 | const Type *t = ccp->type(in(1)); |
duke@435 | 437 | ccp->hash_delete(this); |
duke@435 | 438 | set_type(t); // Turn into ID function |
duke@435 | 439 | ccp->hash_insert(this); |
duke@435 | 440 | return this; |
duke@435 | 441 | } |
duke@435 | 442 | |
duke@435 | 443 | |
duke@435 | 444 | //============================================================================= |
duke@435 | 445 | |
duke@435 | 446 | //------------------------------Ideal_DU_postCCP------------------------------- |
duke@435 | 447 | // If not converting int->oop, throw away cast after constant propagation |
duke@435 | 448 | Node *CastPPNode::Ideal_DU_postCCP( PhaseCCP *ccp ) { |
duke@435 | 449 | const Type *t = ccp->type(in(1)); |
kvn@1930 | 450 | if (!t->isa_oop_ptr() || (in(1)->is_DecodeN() && Matcher::gen_narrow_oop_implicit_null_checks())) { |
kvn@803 | 451 | return NULL; // do not transform raw pointers or narrow oops |
duke@435 | 452 | } |
duke@435 | 453 | return ConstraintCastNode::Ideal_DU_postCCP(ccp); |
duke@435 | 454 | } |
duke@435 | 455 | |
duke@435 | 456 | |
duke@435 | 457 | |
duke@435 | 458 | //============================================================================= |
duke@435 | 459 | //------------------------------Identity--------------------------------------- |
duke@435 | 460 | // If input is already higher or equal to cast type, then this is an identity. |
duke@435 | 461 | Node *CheckCastPPNode::Identity( PhaseTransform *phase ) { |
duke@435 | 462 | // Toned down to rescue meeting at a Phi 3 different oops all implementing |
duke@435 | 463 | // the same interface. CompileTheWorld starting at 502, kd12rc1.zip. |
duke@435 | 464 | return (phase->type(in(1)) == phase->type(this)) ? in(1) : this; |
duke@435 | 465 | } |
duke@435 | 466 | |
duke@435 | 467 | // Determine whether "n" is a node which can cause an alias of one of its inputs. Node types |
duke@435 | 468 | // which can create aliases are: CheckCastPP, Phi, and any store (if there is also a load from |
duke@435 | 469 | // the location.) |
duke@435 | 470 | // Note: this checks for aliases created in this compilation, not ones which may |
duke@435 | 471 | // be potentially created at call sites. |
duke@435 | 472 | static bool can_cause_alias(Node *n, PhaseTransform *phase) { |
duke@435 | 473 | bool possible_alias = false; |
duke@435 | 474 | |
duke@435 | 475 | if (n->is_Store()) { |
duke@435 | 476 | possible_alias = !n->as_Store()->value_never_loaded(phase); |
duke@435 | 477 | } else { |
duke@435 | 478 | int opc = n->Opcode(); |
duke@435 | 479 | possible_alias = n->is_Phi() || |
duke@435 | 480 | opc == Op_CheckCastPP || |
duke@435 | 481 | opc == Op_StorePConditional || |
coleenp@548 | 482 | opc == Op_CompareAndSwapP || |
coleenp@548 | 483 | opc == Op_CompareAndSwapN; |
duke@435 | 484 | } |
duke@435 | 485 | return possible_alias; |
duke@435 | 486 | } |
duke@435 | 487 | |
duke@435 | 488 | //------------------------------Value------------------------------------------ |
duke@435 | 489 | // Take 'join' of input and cast-up type, unless working with an Interface |
duke@435 | 490 | const Type *CheckCastPPNode::Value( PhaseTransform *phase ) const { |
duke@435 | 491 | if( in(0) && phase->type(in(0)) == Type::TOP ) return Type::TOP; |
duke@435 | 492 | |
duke@435 | 493 | const Type *inn = phase->type(in(1)); |
duke@435 | 494 | if( inn == Type::TOP ) return Type::TOP; // No information yet |
duke@435 | 495 | |
duke@435 | 496 | const TypePtr *in_type = inn->isa_ptr(); |
duke@435 | 497 | const TypePtr *my_type = _type->isa_ptr(); |
duke@435 | 498 | const Type *result = _type; |
duke@435 | 499 | if( in_type != NULL && my_type != NULL ) { |
duke@435 | 500 | TypePtr::PTR in_ptr = in_type->ptr(); |
duke@435 | 501 | if( in_ptr == TypePtr::Null ) { |
duke@435 | 502 | result = in_type; |
duke@435 | 503 | } else if( in_ptr == TypePtr::Constant ) { |
duke@435 | 504 | // Casting a constant oop to an interface? |
duke@435 | 505 | // (i.e., a String to a Comparable?) |
duke@435 | 506 | // Then return the interface. |
duke@435 | 507 | const TypeOopPtr *jptr = my_type->isa_oopptr(); |
duke@435 | 508 | assert( jptr, "" ); |
duke@435 | 509 | result = (jptr->klass()->is_interface() || !in_type->higher_equal(_type)) |
duke@435 | 510 | ? my_type->cast_to_ptr_type( TypePtr::NotNull ) |
duke@435 | 511 | : in_type; |
duke@435 | 512 | } else { |
duke@435 | 513 | result = my_type->cast_to_ptr_type( my_type->join_ptr(in_ptr) ); |
duke@435 | 514 | } |
duke@435 | 515 | } |
duke@435 | 516 | return result; |
duke@435 | 517 | |
duke@435 | 518 | // JOIN NOT DONE HERE BECAUSE OF INTERFACE ISSUES. |
duke@435 | 519 | // FIX THIS (DO THE JOIN) WHEN UNION TYPES APPEAR! |
duke@435 | 520 | |
duke@435 | 521 | // |
duke@435 | 522 | // Remove this code after overnight run indicates no performance |
duke@435 | 523 | // loss from not performing JOIN at CheckCastPPNode |
duke@435 | 524 | // |
duke@435 | 525 | // const TypeInstPtr *in_oop = in->isa_instptr(); |
duke@435 | 526 | // const TypeInstPtr *my_oop = _type->isa_instptr(); |
duke@435 | 527 | // // If either input is an 'interface', return destination type |
duke@435 | 528 | // assert (in_oop == NULL || in_oop->klass() != NULL, ""); |
duke@435 | 529 | // assert (my_oop == NULL || my_oop->klass() != NULL, ""); |
coleenp@4037 | 530 | // if( (in_oop && in_oop->klass()->is_interface()) |
coleenp@4037 | 531 | // ||(my_oop && my_oop->klass()->is_interface()) ) { |
duke@435 | 532 | // TypePtr::PTR in_ptr = in->isa_ptr() ? in->is_ptr()->_ptr : TypePtr::BotPTR; |
duke@435 | 533 | // // Preserve cast away nullness for interfaces |
duke@435 | 534 | // if( in_ptr == TypePtr::NotNull && my_oop && my_oop->_ptr == TypePtr::BotPTR ) { |
duke@435 | 535 | // return my_oop->cast_to_ptr_type(TypePtr::NotNull); |
duke@435 | 536 | // } |
duke@435 | 537 | // return _type; |
duke@435 | 538 | // } |
duke@435 | 539 | // |
duke@435 | 540 | // // Neither the input nor the destination type is an interface, |
duke@435 | 541 | // |
duke@435 | 542 | // // history: JOIN used to cause weird corner case bugs |
duke@435 | 543 | // // return (in == TypeOopPtr::NULL_PTR) ? in : _type; |
duke@435 | 544 | // // JOIN picks up NotNull in common instance-of/check-cast idioms, both oops. |
duke@435 | 545 | // // JOIN does not preserve NotNull in other cases, e.g. RawPtr vs InstPtr |
duke@435 | 546 | // const Type *join = in->join(_type); |
duke@435 | 547 | // // Check if join preserved NotNull'ness for pointers |
duke@435 | 548 | // if( join->isa_ptr() && _type->isa_ptr() ) { |
duke@435 | 549 | // TypePtr::PTR join_ptr = join->is_ptr()->_ptr; |
duke@435 | 550 | // TypePtr::PTR type_ptr = _type->is_ptr()->_ptr; |
duke@435 | 551 | // // If there isn't any NotNull'ness to preserve |
duke@435 | 552 | // // OR if join preserved NotNull'ness then return it |
duke@435 | 553 | // if( type_ptr == TypePtr::BotPTR || type_ptr == TypePtr::Null || |
duke@435 | 554 | // join_ptr == TypePtr::NotNull || join_ptr == TypePtr::Constant ) { |
duke@435 | 555 | // return join; |
duke@435 | 556 | // } |
duke@435 | 557 | // // ELSE return same old type as before |
duke@435 | 558 | // return _type; |
duke@435 | 559 | // } |
duke@435 | 560 | // // Not joining two pointers |
duke@435 | 561 | // return join; |
duke@435 | 562 | } |
duke@435 | 563 | |
duke@435 | 564 | //------------------------------Ideal------------------------------------------ |
duke@435 | 565 | // Return a node which is more "ideal" than the current node. Strip out |
duke@435 | 566 | // control copies |
duke@435 | 567 | Node *CheckCastPPNode::Ideal(PhaseGVN *phase, bool can_reshape){ |
duke@435 | 568 | return (in(0) && remove_dead_region(phase, can_reshape)) ? this : NULL; |
duke@435 | 569 | } |
duke@435 | 570 | |
coleenp@548 | 571 | |
coleenp@548 | 572 | Node* DecodeNNode::Identity(PhaseTransform* phase) { |
coleenp@548 | 573 | const Type *t = phase->type( in(1) ); |
coleenp@548 | 574 | if( t == Type::TOP ) return in(1); |
coleenp@548 | 575 | |
kvn@603 | 576 | if (in(1)->is_EncodeP()) { |
coleenp@548 | 577 | // (DecodeN (EncodeP p)) -> p |
coleenp@548 | 578 | return in(1)->in(1); |
coleenp@548 | 579 | } |
coleenp@548 | 580 | return this; |
coleenp@548 | 581 | } |
coleenp@548 | 582 | |
kvn@559 | 583 | const Type *DecodeNNode::Value( PhaseTransform *phase ) const { |
kvn@651 | 584 | const Type *t = phase->type( in(1) ); |
kvn@651 | 585 | if (t == Type::TOP) return Type::TOP; |
kvn@651 | 586 | if (t == TypeNarrowOop::NULL_PTR) return TypePtr::NULL_PTR; |
kvn@651 | 587 | |
kvn@651 | 588 | assert(t->isa_narrowoop(), "only narrowoop here"); |
kvn@656 | 589 | return t->make_ptr(); |
kvn@559 | 590 | } |
kvn@559 | 591 | |
coleenp@548 | 592 | Node* EncodePNode::Identity(PhaseTransform* phase) { |
coleenp@548 | 593 | const Type *t = phase->type( in(1) ); |
coleenp@548 | 594 | if( t == Type::TOP ) return in(1); |
coleenp@548 | 595 | |
kvn@603 | 596 | if (in(1)->is_DecodeN()) { |
coleenp@548 | 597 | // (EncodeP (DecodeN p)) -> p |
coleenp@548 | 598 | return in(1)->in(1); |
coleenp@548 | 599 | } |
coleenp@548 | 600 | return this; |
coleenp@548 | 601 | } |
coleenp@548 | 602 | |
kvn@559 | 603 | const Type *EncodePNode::Value( PhaseTransform *phase ) const { |
kvn@651 | 604 | const Type *t = phase->type( in(1) ); |
kvn@651 | 605 | if (t == Type::TOP) return Type::TOP; |
kvn@651 | 606 | if (t == TypePtr::NULL_PTR) return TypeNarrowOop::NULL_PTR; |
kvn@651 | 607 | |
coleenp@4037 | 608 | assert(t->isa_oop_ptr() || UseCompressedKlassPointers && t->isa_klassptr(), "only oopptr here"); |
kvn@656 | 609 | return t->make_narrowoop(); |
kvn@559 | 610 | } |
coleenp@548 | 611 | |
coleenp@548 | 612 | |
kvn@598 | 613 | Node *EncodePNode::Ideal_DU_postCCP( PhaseCCP *ccp ) { |
kvn@598 | 614 | return MemNode::Ideal_common_DU_postCCP(ccp, this, in(1)); |
kvn@598 | 615 | } |
coleenp@548 | 616 | |
duke@435 | 617 | //============================================================================= |
duke@435 | 618 | //------------------------------Identity--------------------------------------- |
duke@435 | 619 | Node *Conv2BNode::Identity( PhaseTransform *phase ) { |
duke@435 | 620 | const Type *t = phase->type( in(1) ); |
duke@435 | 621 | if( t == Type::TOP ) return in(1); |
duke@435 | 622 | if( t == TypeInt::ZERO ) return in(1); |
duke@435 | 623 | if( t == TypeInt::ONE ) return in(1); |
duke@435 | 624 | if( t == TypeInt::BOOL ) return in(1); |
duke@435 | 625 | return this; |
duke@435 | 626 | } |
duke@435 | 627 | |
duke@435 | 628 | //------------------------------Value------------------------------------------ |
duke@435 | 629 | const Type *Conv2BNode::Value( PhaseTransform *phase ) const { |
duke@435 | 630 | const Type *t = phase->type( in(1) ); |
duke@435 | 631 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 632 | if( t == TypeInt::ZERO ) return TypeInt::ZERO; |
duke@435 | 633 | if( t == TypePtr::NULL_PTR ) return TypeInt::ZERO; |
duke@435 | 634 | const TypePtr *tp = t->isa_ptr(); |
duke@435 | 635 | if( tp != NULL ) { |
duke@435 | 636 | if( tp->ptr() == TypePtr::AnyNull ) return Type::TOP; |
duke@435 | 637 | if( tp->ptr() == TypePtr::Constant) return TypeInt::ONE; |
duke@435 | 638 | if (tp->ptr() == TypePtr::NotNull) return TypeInt::ONE; |
duke@435 | 639 | return TypeInt::BOOL; |
duke@435 | 640 | } |
duke@435 | 641 | if (t->base() != Type::Int) return TypeInt::BOOL; |
duke@435 | 642 | const TypeInt *ti = t->is_int(); |
duke@435 | 643 | if( ti->_hi < 0 || ti->_lo > 0 ) return TypeInt::ONE; |
duke@435 | 644 | return TypeInt::BOOL; |
duke@435 | 645 | } |
duke@435 | 646 | |
duke@435 | 647 | |
duke@435 | 648 | // The conversions operations are all Alpha sorted. Please keep it that way! |
duke@435 | 649 | //============================================================================= |
duke@435 | 650 | //------------------------------Value------------------------------------------ |
duke@435 | 651 | const Type *ConvD2FNode::Value( PhaseTransform *phase ) const { |
duke@435 | 652 | const Type *t = phase->type( in(1) ); |
duke@435 | 653 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 654 | if( t == Type::DOUBLE ) return Type::FLOAT; |
duke@435 | 655 | const TypeD *td = t->is_double_constant(); |
duke@435 | 656 | return TypeF::make( (float)td->getd() ); |
duke@435 | 657 | } |
duke@435 | 658 | |
duke@435 | 659 | //------------------------------Identity--------------------------------------- |
duke@435 | 660 | // Float's can be converted to doubles with no loss of bits. Hence |
duke@435 | 661 | // converting a float to a double and back to a float is a NOP. |
duke@435 | 662 | Node *ConvD2FNode::Identity(PhaseTransform *phase) { |
duke@435 | 663 | return (in(1)->Opcode() == Op_ConvF2D) ? in(1)->in(1) : this; |
duke@435 | 664 | } |
duke@435 | 665 | |
duke@435 | 666 | //============================================================================= |
duke@435 | 667 | //------------------------------Value------------------------------------------ |
duke@435 | 668 | const Type *ConvD2INode::Value( PhaseTransform *phase ) const { |
duke@435 | 669 | const Type *t = phase->type( in(1) ); |
duke@435 | 670 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 671 | if( t == Type::DOUBLE ) return TypeInt::INT; |
duke@435 | 672 | const TypeD *td = t->is_double_constant(); |
duke@435 | 673 | return TypeInt::make( SharedRuntime::d2i( td->getd() ) ); |
duke@435 | 674 | } |
duke@435 | 675 | |
duke@435 | 676 | //------------------------------Ideal------------------------------------------ |
duke@435 | 677 | // If converting to an int type, skip any rounding nodes |
duke@435 | 678 | Node *ConvD2INode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 679 | if( in(1)->Opcode() == Op_RoundDouble ) |
duke@435 | 680 | set_req(1,in(1)->in(1)); |
duke@435 | 681 | return NULL; |
duke@435 | 682 | } |
duke@435 | 683 | |
duke@435 | 684 | //------------------------------Identity--------------------------------------- |
duke@435 | 685 | // Int's can be converted to doubles with no loss of bits. Hence |
duke@435 | 686 | // converting an integer to a double and back to an integer is a NOP. |
duke@435 | 687 | Node *ConvD2INode::Identity(PhaseTransform *phase) { |
duke@435 | 688 | return (in(1)->Opcode() == Op_ConvI2D) ? in(1)->in(1) : this; |
duke@435 | 689 | } |
duke@435 | 690 | |
duke@435 | 691 | //============================================================================= |
duke@435 | 692 | //------------------------------Value------------------------------------------ |
duke@435 | 693 | const Type *ConvD2LNode::Value( PhaseTransform *phase ) const { |
duke@435 | 694 | const Type *t = phase->type( in(1) ); |
duke@435 | 695 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 696 | if( t == Type::DOUBLE ) return TypeLong::LONG; |
duke@435 | 697 | const TypeD *td = t->is_double_constant(); |
duke@435 | 698 | return TypeLong::make( SharedRuntime::d2l( td->getd() ) ); |
duke@435 | 699 | } |
duke@435 | 700 | |
duke@435 | 701 | //------------------------------Identity--------------------------------------- |
duke@435 | 702 | Node *ConvD2LNode::Identity(PhaseTransform *phase) { |
duke@435 | 703 | // Remove ConvD2L->ConvL2D->ConvD2L sequences. |
duke@435 | 704 | if( in(1) ->Opcode() == Op_ConvL2D && |
duke@435 | 705 | in(1)->in(1)->Opcode() == Op_ConvD2L ) |
duke@435 | 706 | return in(1)->in(1); |
duke@435 | 707 | return this; |
duke@435 | 708 | } |
duke@435 | 709 | |
duke@435 | 710 | //------------------------------Ideal------------------------------------------ |
duke@435 | 711 | // If converting to an int type, skip any rounding nodes |
duke@435 | 712 | Node *ConvD2LNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 713 | if( in(1)->Opcode() == Op_RoundDouble ) |
duke@435 | 714 | set_req(1,in(1)->in(1)); |
duke@435 | 715 | return NULL; |
duke@435 | 716 | } |
duke@435 | 717 | |
duke@435 | 718 | //============================================================================= |
duke@435 | 719 | //------------------------------Value------------------------------------------ |
duke@435 | 720 | const Type *ConvF2DNode::Value( PhaseTransform *phase ) const { |
duke@435 | 721 | const Type *t = phase->type( in(1) ); |
duke@435 | 722 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 723 | if( t == Type::FLOAT ) return Type::DOUBLE; |
duke@435 | 724 | const TypeF *tf = t->is_float_constant(); |
duke@435 | 725 | return TypeD::make( (double)tf->getf() ); |
duke@435 | 726 | } |
duke@435 | 727 | |
duke@435 | 728 | //============================================================================= |
duke@435 | 729 | //------------------------------Value------------------------------------------ |
duke@435 | 730 | const Type *ConvF2INode::Value( PhaseTransform *phase ) const { |
duke@435 | 731 | const Type *t = phase->type( in(1) ); |
duke@435 | 732 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 733 | if( t == Type::FLOAT ) return TypeInt::INT; |
duke@435 | 734 | const TypeF *tf = t->is_float_constant(); |
duke@435 | 735 | return TypeInt::make( SharedRuntime::f2i( tf->getf() ) ); |
duke@435 | 736 | } |
duke@435 | 737 | |
duke@435 | 738 | //------------------------------Identity--------------------------------------- |
duke@435 | 739 | Node *ConvF2INode::Identity(PhaseTransform *phase) { |
duke@435 | 740 | // Remove ConvF2I->ConvI2F->ConvF2I sequences. |
duke@435 | 741 | if( in(1) ->Opcode() == Op_ConvI2F && |
duke@435 | 742 | in(1)->in(1)->Opcode() == Op_ConvF2I ) |
duke@435 | 743 | return in(1)->in(1); |
duke@435 | 744 | return this; |
duke@435 | 745 | } |
duke@435 | 746 | |
duke@435 | 747 | //------------------------------Ideal------------------------------------------ |
duke@435 | 748 | // If converting to an int type, skip any rounding nodes |
duke@435 | 749 | Node *ConvF2INode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 750 | if( in(1)->Opcode() == Op_RoundFloat ) |
duke@435 | 751 | set_req(1,in(1)->in(1)); |
duke@435 | 752 | return NULL; |
duke@435 | 753 | } |
duke@435 | 754 | |
duke@435 | 755 | //============================================================================= |
duke@435 | 756 | //------------------------------Value------------------------------------------ |
duke@435 | 757 | const Type *ConvF2LNode::Value( PhaseTransform *phase ) const { |
duke@435 | 758 | const Type *t = phase->type( in(1) ); |
duke@435 | 759 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 760 | if( t == Type::FLOAT ) return TypeLong::LONG; |
duke@435 | 761 | const TypeF *tf = t->is_float_constant(); |
duke@435 | 762 | return TypeLong::make( SharedRuntime::f2l( tf->getf() ) ); |
duke@435 | 763 | } |
duke@435 | 764 | |
duke@435 | 765 | //------------------------------Identity--------------------------------------- |
duke@435 | 766 | Node *ConvF2LNode::Identity(PhaseTransform *phase) { |
duke@435 | 767 | // Remove ConvF2L->ConvL2F->ConvF2L sequences. |
duke@435 | 768 | if( in(1) ->Opcode() == Op_ConvL2F && |
duke@435 | 769 | in(1)->in(1)->Opcode() == Op_ConvF2L ) |
duke@435 | 770 | return in(1)->in(1); |
duke@435 | 771 | return this; |
duke@435 | 772 | } |
duke@435 | 773 | |
duke@435 | 774 | //------------------------------Ideal------------------------------------------ |
duke@435 | 775 | // If converting to an int type, skip any rounding nodes |
duke@435 | 776 | Node *ConvF2LNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 777 | if( in(1)->Opcode() == Op_RoundFloat ) |
duke@435 | 778 | set_req(1,in(1)->in(1)); |
duke@435 | 779 | return NULL; |
duke@435 | 780 | } |
duke@435 | 781 | |
duke@435 | 782 | //============================================================================= |
duke@435 | 783 | //------------------------------Value------------------------------------------ |
duke@435 | 784 | const Type *ConvI2DNode::Value( PhaseTransform *phase ) const { |
duke@435 | 785 | const Type *t = phase->type( in(1) ); |
duke@435 | 786 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 787 | const TypeInt *ti = t->is_int(); |
duke@435 | 788 | if( ti->is_con() ) return TypeD::make( (double)ti->get_con() ); |
duke@435 | 789 | return bottom_type(); |
duke@435 | 790 | } |
duke@435 | 791 | |
duke@435 | 792 | //============================================================================= |
duke@435 | 793 | //------------------------------Value------------------------------------------ |
duke@435 | 794 | const Type *ConvI2FNode::Value( PhaseTransform *phase ) const { |
duke@435 | 795 | const Type *t = phase->type( in(1) ); |
duke@435 | 796 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 797 | const TypeInt *ti = t->is_int(); |
duke@435 | 798 | if( ti->is_con() ) return TypeF::make( (float)ti->get_con() ); |
duke@435 | 799 | return bottom_type(); |
duke@435 | 800 | } |
duke@435 | 801 | |
duke@435 | 802 | //------------------------------Identity--------------------------------------- |
duke@435 | 803 | Node *ConvI2FNode::Identity(PhaseTransform *phase) { |
duke@435 | 804 | // Remove ConvI2F->ConvF2I->ConvI2F sequences. |
duke@435 | 805 | if( in(1) ->Opcode() == Op_ConvF2I && |
duke@435 | 806 | in(1)->in(1)->Opcode() == Op_ConvI2F ) |
duke@435 | 807 | return in(1)->in(1); |
duke@435 | 808 | return this; |
duke@435 | 809 | } |
duke@435 | 810 | |
duke@435 | 811 | //============================================================================= |
duke@435 | 812 | //------------------------------Value------------------------------------------ |
duke@435 | 813 | const Type *ConvI2LNode::Value( PhaseTransform *phase ) const { |
duke@435 | 814 | const Type *t = phase->type( in(1) ); |
duke@435 | 815 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 816 | const TypeInt *ti = t->is_int(); |
duke@435 | 817 | const Type* tl = TypeLong::make(ti->_lo, ti->_hi, ti->_widen); |
duke@435 | 818 | // Join my declared type against my incoming type. |
duke@435 | 819 | tl = tl->filter(_type); |
duke@435 | 820 | return tl; |
duke@435 | 821 | } |
duke@435 | 822 | |
duke@435 | 823 | #ifdef _LP64 |
duke@435 | 824 | static inline bool long_ranges_overlap(jlong lo1, jlong hi1, |
duke@435 | 825 | jlong lo2, jlong hi2) { |
duke@435 | 826 | // Two ranges overlap iff one range's low point falls in the other range. |
duke@435 | 827 | return (lo2 <= lo1 && lo1 <= hi2) || (lo1 <= lo2 && lo2 <= hi1); |
duke@435 | 828 | } |
duke@435 | 829 | #endif |
duke@435 | 830 | |
duke@435 | 831 | //------------------------------Ideal------------------------------------------ |
duke@435 | 832 | Node *ConvI2LNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 833 | const TypeLong* this_type = this->type()->is_long(); |
duke@435 | 834 | Node* this_changed = NULL; |
duke@435 | 835 | |
duke@435 | 836 | // If _major_progress, then more loop optimizations follow. Do NOT |
duke@435 | 837 | // remove this node's type assertion until no more loop ops can happen. |
duke@435 | 838 | // The progress bit is set in the major loop optimizations THEN comes the |
duke@435 | 839 | // call to IterGVN and any chance of hitting this code. Cf. Opaque1Node. |
duke@435 | 840 | if (can_reshape && !phase->C->major_progress()) { |
duke@435 | 841 | const TypeInt* in_type = phase->type(in(1))->isa_int(); |
duke@435 | 842 | if (in_type != NULL && this_type != NULL && |
duke@435 | 843 | (in_type->_lo != this_type->_lo || |
duke@435 | 844 | in_type->_hi != this_type->_hi)) { |
duke@435 | 845 | // Although this WORSENS the type, it increases GVN opportunities, |
duke@435 | 846 | // because I2L nodes with the same input will common up, regardless |
duke@435 | 847 | // of slightly differing type assertions. Such slight differences |
duke@435 | 848 | // arise routinely as a result of loop unrolling, so this is a |
duke@435 | 849 | // post-unrolling graph cleanup. Choose a type which depends only |
duke@435 | 850 | // on my input. (Exception: Keep a range assertion of >=0 or <0.) |
duke@435 | 851 | jlong lo1 = this_type->_lo; |
duke@435 | 852 | jlong hi1 = this_type->_hi; |
duke@435 | 853 | int w1 = this_type->_widen; |
duke@435 | 854 | if (lo1 != (jint)lo1 || |
duke@435 | 855 | hi1 != (jint)hi1 || |
duke@435 | 856 | lo1 > hi1) { |
duke@435 | 857 | // Overflow leads to wraparound, wraparound leads to range saturation. |
duke@435 | 858 | lo1 = min_jint; hi1 = max_jint; |
duke@435 | 859 | } else if (lo1 >= 0) { |
duke@435 | 860 | // Keep a range assertion of >=0. |
duke@435 | 861 | lo1 = 0; hi1 = max_jint; |
duke@435 | 862 | } else if (hi1 < 0) { |
duke@435 | 863 | // Keep a range assertion of <0. |
duke@435 | 864 | lo1 = min_jint; hi1 = -1; |
duke@435 | 865 | } else { |
duke@435 | 866 | lo1 = min_jint; hi1 = max_jint; |
duke@435 | 867 | } |
duke@435 | 868 | const TypeLong* wtype = TypeLong::make(MAX2((jlong)in_type->_lo, lo1), |
duke@435 | 869 | MIN2((jlong)in_type->_hi, hi1), |
duke@435 | 870 | MAX2((int)in_type->_widen, w1)); |
duke@435 | 871 | if (wtype != type()) { |
duke@435 | 872 | set_type(wtype); |
duke@435 | 873 | // Note: this_type still has old type value, for the logic below. |
duke@435 | 874 | this_changed = this; |
duke@435 | 875 | } |
duke@435 | 876 | } |
duke@435 | 877 | } |
duke@435 | 878 | |
duke@435 | 879 | #ifdef _LP64 |
duke@435 | 880 | // Convert ConvI2L(AddI(x, y)) to AddL(ConvI2L(x), ConvI2L(y)) , |
duke@435 | 881 | // but only if x and y have subranges that cannot cause 32-bit overflow, |
duke@435 | 882 | // under the assumption that x+y is in my own subrange this->type(). |
duke@435 | 883 | |
duke@435 | 884 | // This assumption is based on a constraint (i.e., type assertion) |
duke@435 | 885 | // established in Parse::array_addressing or perhaps elsewhere. |
duke@435 | 886 | // This constraint has been adjoined to the "natural" type of |
duke@435 | 887 | // the incoming argument in(0). We know (because of runtime |
duke@435 | 888 | // checks) - that the result value I2L(x+y) is in the joined range. |
duke@435 | 889 | // Hence we can restrict the incoming terms (x, y) to values such |
duke@435 | 890 | // that their sum also lands in that range. |
duke@435 | 891 | |
duke@435 | 892 | // This optimization is useful only on 64-bit systems, where we hope |
duke@435 | 893 | // the addition will end up subsumed in an addressing mode. |
duke@435 | 894 | // It is necessary to do this when optimizing an unrolled array |
duke@435 | 895 | // copy loop such as x[i++] = y[i++]. |
duke@435 | 896 | |
duke@435 | 897 | // On 32-bit systems, it's better to perform as much 32-bit math as |
duke@435 | 898 | // possible before the I2L conversion, because 32-bit math is cheaper. |
duke@435 | 899 | // There's no common reason to "leak" a constant offset through the I2L. |
duke@435 | 900 | // Addressing arithmetic will not absorb it as part of a 64-bit AddL. |
duke@435 | 901 | |
duke@435 | 902 | Node* z = in(1); |
duke@435 | 903 | int op = z->Opcode(); |
duke@435 | 904 | if (op == Op_AddI || op == Op_SubI) { |
duke@435 | 905 | Node* x = z->in(1); |
duke@435 | 906 | Node* y = z->in(2); |
duke@435 | 907 | assert (x != z && y != z, "dead loop in ConvI2LNode::Ideal"); |
duke@435 | 908 | if (phase->type(x) == Type::TOP) return this_changed; |
duke@435 | 909 | if (phase->type(y) == Type::TOP) return this_changed; |
duke@435 | 910 | const TypeInt* tx = phase->type(x)->is_int(); |
duke@435 | 911 | const TypeInt* ty = phase->type(y)->is_int(); |
duke@435 | 912 | const TypeLong* tz = this_type; |
duke@435 | 913 | jlong xlo = tx->_lo; |
duke@435 | 914 | jlong xhi = tx->_hi; |
duke@435 | 915 | jlong ylo = ty->_lo; |
duke@435 | 916 | jlong yhi = ty->_hi; |
duke@435 | 917 | jlong zlo = tz->_lo; |
duke@435 | 918 | jlong zhi = tz->_hi; |
duke@435 | 919 | jlong vbit = CONST64(1) << BitsPerInt; |
duke@435 | 920 | int widen = MAX2(tx->_widen, ty->_widen); |
duke@435 | 921 | if (op == Op_SubI) { |
duke@435 | 922 | jlong ylo0 = ylo; |
duke@435 | 923 | ylo = -yhi; |
duke@435 | 924 | yhi = -ylo0; |
duke@435 | 925 | } |
duke@435 | 926 | // See if x+y can cause positive overflow into z+2**32 |
duke@435 | 927 | if (long_ranges_overlap(xlo+ylo, xhi+yhi, zlo+vbit, zhi+vbit)) { |
duke@435 | 928 | return this_changed; |
duke@435 | 929 | } |
duke@435 | 930 | // See if x+y can cause negative overflow into z-2**32 |
duke@435 | 931 | if (long_ranges_overlap(xlo+ylo, xhi+yhi, zlo-vbit, zhi-vbit)) { |
duke@435 | 932 | return this_changed; |
duke@435 | 933 | } |
duke@435 | 934 | // Now it's always safe to assume x+y does not overflow. |
duke@435 | 935 | // This is true even if some pairs x,y might cause overflow, as long |
duke@435 | 936 | // as that overflow value cannot fall into [zlo,zhi]. |
duke@435 | 937 | |
duke@435 | 938 | // Confident that the arithmetic is "as if infinite precision", |
duke@435 | 939 | // we can now use z's range to put constraints on those of x and y. |
duke@435 | 940 | // The "natural" range of x [xlo,xhi] can perhaps be narrowed to a |
duke@435 | 941 | // more "restricted" range by intersecting [xlo,xhi] with the |
duke@435 | 942 | // range obtained by subtracting y's range from the asserted range |
duke@435 | 943 | // of the I2L conversion. Here's the interval arithmetic algebra: |
duke@435 | 944 | // x == z-y == [zlo,zhi]-[ylo,yhi] == [zlo,zhi]+[-yhi,-ylo] |
duke@435 | 945 | // => x in [zlo-yhi, zhi-ylo] |
duke@435 | 946 | // => x in [zlo-yhi, zhi-ylo] INTERSECT [xlo,xhi] |
duke@435 | 947 | // => x in [xlo MAX zlo-yhi, xhi MIN zhi-ylo] |
duke@435 | 948 | jlong rxlo = MAX2(xlo, zlo - yhi); |
duke@435 | 949 | jlong rxhi = MIN2(xhi, zhi - ylo); |
duke@435 | 950 | // And similarly, x changing place with y: |
duke@435 | 951 | jlong rylo = MAX2(ylo, zlo - xhi); |
duke@435 | 952 | jlong ryhi = MIN2(yhi, zhi - xlo); |
duke@435 | 953 | if (rxlo > rxhi || rylo > ryhi) { |
duke@435 | 954 | return this_changed; // x or y is dying; don't mess w/ it |
duke@435 | 955 | } |
duke@435 | 956 | if (op == Op_SubI) { |
duke@435 | 957 | jlong rylo0 = rylo; |
duke@435 | 958 | rylo = -ryhi; |
duke@435 | 959 | ryhi = -rylo0; |
duke@435 | 960 | } |
duke@435 | 961 | |
duke@435 | 962 | Node* cx = phase->transform( new (phase->C, 2) ConvI2LNode(x, TypeLong::make(rxlo, rxhi, widen)) ); |
duke@435 | 963 | Node* cy = phase->transform( new (phase->C, 2) ConvI2LNode(y, TypeLong::make(rylo, ryhi, widen)) ); |
duke@435 | 964 | switch (op) { |
duke@435 | 965 | case Op_AddI: return new (phase->C, 3) AddLNode(cx, cy); |
duke@435 | 966 | case Op_SubI: return new (phase->C, 3) SubLNode(cx, cy); |
duke@435 | 967 | default: ShouldNotReachHere(); |
duke@435 | 968 | } |
duke@435 | 969 | } |
duke@435 | 970 | #endif //_LP64 |
duke@435 | 971 | |
duke@435 | 972 | return this_changed; |
duke@435 | 973 | } |
duke@435 | 974 | |
duke@435 | 975 | //============================================================================= |
duke@435 | 976 | //------------------------------Value------------------------------------------ |
duke@435 | 977 | const Type *ConvL2DNode::Value( PhaseTransform *phase ) const { |
duke@435 | 978 | const Type *t = phase->type( in(1) ); |
duke@435 | 979 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 980 | const TypeLong *tl = t->is_long(); |
duke@435 | 981 | if( tl->is_con() ) return TypeD::make( (double)tl->get_con() ); |
duke@435 | 982 | return bottom_type(); |
duke@435 | 983 | } |
duke@435 | 984 | |
duke@435 | 985 | //============================================================================= |
duke@435 | 986 | //------------------------------Value------------------------------------------ |
duke@435 | 987 | const Type *ConvL2FNode::Value( PhaseTransform *phase ) const { |
duke@435 | 988 | const Type *t = phase->type( in(1) ); |
duke@435 | 989 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 990 | const TypeLong *tl = t->is_long(); |
duke@435 | 991 | if( tl->is_con() ) return TypeF::make( (float)tl->get_con() ); |
duke@435 | 992 | return bottom_type(); |
duke@435 | 993 | } |
duke@435 | 994 | |
duke@435 | 995 | //============================================================================= |
duke@435 | 996 | //----------------------------Identity----------------------------------------- |
duke@435 | 997 | Node *ConvL2INode::Identity( PhaseTransform *phase ) { |
duke@435 | 998 | // Convert L2I(I2L(x)) => x |
duke@435 | 999 | if (in(1)->Opcode() == Op_ConvI2L) return in(1)->in(1); |
duke@435 | 1000 | return this; |
duke@435 | 1001 | } |
duke@435 | 1002 | |
duke@435 | 1003 | //------------------------------Value------------------------------------------ |
duke@435 | 1004 | const Type *ConvL2INode::Value( PhaseTransform *phase ) const { |
duke@435 | 1005 | const Type *t = phase->type( in(1) ); |
duke@435 | 1006 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 1007 | const TypeLong *tl = t->is_long(); |
duke@435 | 1008 | if (tl->is_con()) |
duke@435 | 1009 | // Easy case. |
duke@435 | 1010 | return TypeInt::make((jint)tl->get_con()); |
duke@435 | 1011 | return bottom_type(); |
duke@435 | 1012 | } |
duke@435 | 1013 | |
duke@435 | 1014 | //------------------------------Ideal------------------------------------------ |
duke@435 | 1015 | // Return a node which is more "ideal" than the current node. |
duke@435 | 1016 | // Blow off prior masking to int |
duke@435 | 1017 | Node *ConvL2INode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 1018 | Node *andl = in(1); |
duke@435 | 1019 | uint andl_op = andl->Opcode(); |
duke@435 | 1020 | if( andl_op == Op_AndL ) { |
duke@435 | 1021 | // Blow off prior masking to int |
duke@435 | 1022 | if( phase->type(andl->in(2)) == TypeLong::make( 0xFFFFFFFF ) ) { |
duke@435 | 1023 | set_req(1,andl->in(1)); |
duke@435 | 1024 | return this; |
duke@435 | 1025 | } |
duke@435 | 1026 | } |
duke@435 | 1027 | |
duke@435 | 1028 | // Swap with a prior add: convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y)) |
duke@435 | 1029 | // This replaces an 'AddL' with an 'AddI'. |
duke@435 | 1030 | if( andl_op == Op_AddL ) { |
duke@435 | 1031 | // Don't do this for nodes which have more than one user since |
duke@435 | 1032 | // we'll end up computing the long add anyway. |
duke@435 | 1033 | if (andl->outcnt() > 1) return NULL; |
duke@435 | 1034 | |
duke@435 | 1035 | Node* x = andl->in(1); |
duke@435 | 1036 | Node* y = andl->in(2); |
duke@435 | 1037 | assert( x != andl && y != andl, "dead loop in ConvL2INode::Ideal" ); |
duke@435 | 1038 | if (phase->type(x) == Type::TOP) return NULL; |
duke@435 | 1039 | if (phase->type(y) == Type::TOP) return NULL; |
duke@435 | 1040 | Node *add1 = phase->transform(new (phase->C, 2) ConvL2INode(x)); |
duke@435 | 1041 | Node *add2 = phase->transform(new (phase->C, 2) ConvL2INode(y)); |
duke@435 | 1042 | return new (phase->C, 3) AddINode(add1,add2); |
duke@435 | 1043 | } |
duke@435 | 1044 | |
kvn@471 | 1045 | // Disable optimization: LoadL->ConvL2I ==> LoadI. |
kvn@471 | 1046 | // It causes problems (sizes of Load and Store nodes do not match) |
kvn@471 | 1047 | // in objects initialization code and Escape Analysis. |
duke@435 | 1048 | return NULL; |
duke@435 | 1049 | } |
duke@435 | 1050 | |
duke@435 | 1051 | //============================================================================= |
duke@435 | 1052 | //------------------------------Value------------------------------------------ |
duke@435 | 1053 | const Type *CastX2PNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1054 | const Type* t = phase->type(in(1)); |
kvn@3604 | 1055 | if (t == Type::TOP) return Type::TOP; |
duke@435 | 1056 | if (t->base() == Type_X && t->singleton()) { |
duke@435 | 1057 | uintptr_t bits = (uintptr_t) t->is_intptr_t()->get_con(); |
duke@435 | 1058 | if (bits == 0) return TypePtr::NULL_PTR; |
duke@435 | 1059 | return TypeRawPtr::make((address) bits); |
duke@435 | 1060 | } |
duke@435 | 1061 | return CastX2PNode::bottom_type(); |
duke@435 | 1062 | } |
duke@435 | 1063 | |
duke@435 | 1064 | //------------------------------Idealize--------------------------------------- |
duke@435 | 1065 | static inline bool fits_in_int(const Type* t, bool but_not_min_int = false) { |
duke@435 | 1066 | if (t == Type::TOP) return false; |
duke@435 | 1067 | const TypeX* tl = t->is_intptr_t(); |
duke@435 | 1068 | jint lo = min_jint; |
duke@435 | 1069 | jint hi = max_jint; |
duke@435 | 1070 | if (but_not_min_int) ++lo; // caller wants to negate the value w/o overflow |
duke@435 | 1071 | return (tl->_lo >= lo) && (tl->_hi <= hi); |
duke@435 | 1072 | } |
duke@435 | 1073 | |
duke@435 | 1074 | static inline Node* addP_of_X2P(PhaseGVN *phase, |
duke@435 | 1075 | Node* base, |
duke@435 | 1076 | Node* dispX, |
duke@435 | 1077 | bool negate = false) { |
duke@435 | 1078 | if (negate) { |
duke@435 | 1079 | dispX = new (phase->C, 3) SubXNode(phase->MakeConX(0), phase->transform(dispX)); |
duke@435 | 1080 | } |
duke@435 | 1081 | return new (phase->C, 4) AddPNode(phase->C->top(), |
duke@435 | 1082 | phase->transform(new (phase->C, 2) CastX2PNode(base)), |
duke@435 | 1083 | phase->transform(dispX)); |
duke@435 | 1084 | } |
duke@435 | 1085 | |
duke@435 | 1086 | Node *CastX2PNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 1087 | // convert CastX2P(AddX(x, y)) to AddP(CastX2P(x), y) if y fits in an int |
duke@435 | 1088 | int op = in(1)->Opcode(); |
duke@435 | 1089 | Node* x; |
duke@435 | 1090 | Node* y; |
duke@435 | 1091 | switch (op) { |
duke@435 | 1092 | case Op_SubX: |
duke@435 | 1093 | x = in(1)->in(1); |
kvn@1430 | 1094 | // Avoid ideal transformations ping-pong between this and AddP for raw pointers. |
kvn@1430 | 1095 | if (phase->find_intptr_t_con(x, -1) == 0) |
kvn@1430 | 1096 | break; |
duke@435 | 1097 | y = in(1)->in(2); |
duke@435 | 1098 | if (fits_in_int(phase->type(y), true)) { |
duke@435 | 1099 | return addP_of_X2P(phase, x, y, true); |
duke@435 | 1100 | } |
duke@435 | 1101 | break; |
duke@435 | 1102 | case Op_AddX: |
duke@435 | 1103 | x = in(1)->in(1); |
duke@435 | 1104 | y = in(1)->in(2); |
duke@435 | 1105 | if (fits_in_int(phase->type(y))) { |
duke@435 | 1106 | return addP_of_X2P(phase, x, y); |
duke@435 | 1107 | } |
duke@435 | 1108 | if (fits_in_int(phase->type(x))) { |
duke@435 | 1109 | return addP_of_X2P(phase, y, x); |
duke@435 | 1110 | } |
duke@435 | 1111 | break; |
duke@435 | 1112 | } |
duke@435 | 1113 | return NULL; |
duke@435 | 1114 | } |
duke@435 | 1115 | |
duke@435 | 1116 | //------------------------------Identity--------------------------------------- |
duke@435 | 1117 | Node *CastX2PNode::Identity( PhaseTransform *phase ) { |
duke@435 | 1118 | if (in(1)->Opcode() == Op_CastP2X) return in(1)->in(1); |
duke@435 | 1119 | return this; |
duke@435 | 1120 | } |
duke@435 | 1121 | |
duke@435 | 1122 | //============================================================================= |
duke@435 | 1123 | //------------------------------Value------------------------------------------ |
duke@435 | 1124 | const Type *CastP2XNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1125 | const Type* t = phase->type(in(1)); |
kvn@3604 | 1126 | if (t == Type::TOP) return Type::TOP; |
duke@435 | 1127 | if (t->base() == Type::RawPtr && t->singleton()) { |
duke@435 | 1128 | uintptr_t bits = (uintptr_t) t->is_rawptr()->get_con(); |
duke@435 | 1129 | return TypeX::make(bits); |
duke@435 | 1130 | } |
duke@435 | 1131 | return CastP2XNode::bottom_type(); |
duke@435 | 1132 | } |
duke@435 | 1133 | |
duke@435 | 1134 | Node *CastP2XNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 1135 | return (in(0) && remove_dead_region(phase, can_reshape)) ? this : NULL; |
duke@435 | 1136 | } |
duke@435 | 1137 | |
duke@435 | 1138 | //------------------------------Identity--------------------------------------- |
duke@435 | 1139 | Node *CastP2XNode::Identity( PhaseTransform *phase ) { |
duke@435 | 1140 | if (in(1)->Opcode() == Op_CastX2P) return in(1)->in(1); |
duke@435 | 1141 | return this; |
duke@435 | 1142 | } |
duke@435 | 1143 | |
duke@435 | 1144 | |
duke@435 | 1145 | //============================================================================= |
duke@435 | 1146 | //------------------------------Identity--------------------------------------- |
duke@435 | 1147 | // Remove redundant roundings |
duke@435 | 1148 | Node *RoundFloatNode::Identity( PhaseTransform *phase ) { |
duke@435 | 1149 | assert(Matcher::strict_fp_requires_explicit_rounding, "should only generate for Intel"); |
duke@435 | 1150 | // Do not round constants |
duke@435 | 1151 | if (phase->type(in(1))->base() == Type::FloatCon) return in(1); |
duke@435 | 1152 | int op = in(1)->Opcode(); |
duke@435 | 1153 | // Redundant rounding |
duke@435 | 1154 | if( op == Op_RoundFloat ) return in(1); |
duke@435 | 1155 | // Already rounded |
duke@435 | 1156 | if( op == Op_Parm ) return in(1); |
duke@435 | 1157 | if( op == Op_LoadF ) return in(1); |
duke@435 | 1158 | return this; |
duke@435 | 1159 | } |
duke@435 | 1160 | |
duke@435 | 1161 | //------------------------------Value------------------------------------------ |
duke@435 | 1162 | const Type *RoundFloatNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1163 | return phase->type( in(1) ); |
duke@435 | 1164 | } |
duke@435 | 1165 | |
duke@435 | 1166 | //============================================================================= |
duke@435 | 1167 | //------------------------------Identity--------------------------------------- |
duke@435 | 1168 | // Remove redundant roundings. Incoming arguments are already rounded. |
duke@435 | 1169 | Node *RoundDoubleNode::Identity( PhaseTransform *phase ) { |
duke@435 | 1170 | assert(Matcher::strict_fp_requires_explicit_rounding, "should only generate for Intel"); |
duke@435 | 1171 | // Do not round constants |
duke@435 | 1172 | if (phase->type(in(1))->base() == Type::DoubleCon) return in(1); |
duke@435 | 1173 | int op = in(1)->Opcode(); |
duke@435 | 1174 | // Redundant rounding |
duke@435 | 1175 | if( op == Op_RoundDouble ) return in(1); |
duke@435 | 1176 | // Already rounded |
duke@435 | 1177 | if( op == Op_Parm ) return in(1); |
duke@435 | 1178 | if( op == Op_LoadD ) return in(1); |
duke@435 | 1179 | if( op == Op_ConvF2D ) return in(1); |
duke@435 | 1180 | if( op == Op_ConvI2D ) return in(1); |
duke@435 | 1181 | return this; |
duke@435 | 1182 | } |
duke@435 | 1183 | |
duke@435 | 1184 | //------------------------------Value------------------------------------------ |
duke@435 | 1185 | const Type *RoundDoubleNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1186 | return phase->type( in(1) ); |
duke@435 | 1187 | } |
duke@435 | 1188 | |
duke@435 | 1189 | |
duke@435 | 1190 | //============================================================================= |
duke@435 | 1191 | // Do not allow value-numbering |
duke@435 | 1192 | uint Opaque1Node::hash() const { return NO_HASH; } |
duke@435 | 1193 | uint Opaque1Node::cmp( const Node &n ) const { |
duke@435 | 1194 | return (&n == this); // Always fail except on self |
duke@435 | 1195 | } |
duke@435 | 1196 | |
duke@435 | 1197 | //------------------------------Identity--------------------------------------- |
duke@435 | 1198 | // If _major_progress, then more loop optimizations follow. Do NOT remove |
duke@435 | 1199 | // the opaque Node until no more loop ops can happen. Note the timing of |
duke@435 | 1200 | // _major_progress; it's set in the major loop optimizations THEN comes the |
duke@435 | 1201 | // call to IterGVN and any chance of hitting this code. Hence there's no |
duke@435 | 1202 | // phase-ordering problem with stripping Opaque1 in IGVN followed by some |
duke@435 | 1203 | // more loop optimizations that require it. |
duke@435 | 1204 | Node *Opaque1Node::Identity( PhaseTransform *phase ) { |
duke@435 | 1205 | return phase->C->major_progress() ? this : in(1); |
duke@435 | 1206 | } |
duke@435 | 1207 | |
duke@435 | 1208 | //============================================================================= |
duke@435 | 1209 | // A node to prevent unwanted optimizations. Allows constant folding. Stops |
duke@435 | 1210 | // value-numbering, most Ideal calls or Identity functions. This Node is |
duke@435 | 1211 | // specifically designed to prevent the pre-increment value of a loop trip |
duke@435 | 1212 | // counter from being live out of the bottom of the loop (hence causing the |
duke@435 | 1213 | // pre- and post-increment values both being live and thus requiring an extra |
duke@435 | 1214 | // temp register and an extra move). If we "accidentally" optimize through |
duke@435 | 1215 | // this kind of a Node, we'll get slightly pessimal, but correct, code. Thus |
duke@435 | 1216 | // it's OK to be slightly sloppy on optimizations here. |
duke@435 | 1217 | |
duke@435 | 1218 | // Do not allow value-numbering |
duke@435 | 1219 | uint Opaque2Node::hash() const { return NO_HASH; } |
duke@435 | 1220 | uint Opaque2Node::cmp( const Node &n ) const { |
duke@435 | 1221 | return (&n == this); // Always fail except on self |
duke@435 | 1222 | } |
duke@435 | 1223 | |
duke@435 | 1224 | |
duke@435 | 1225 | //------------------------------Value------------------------------------------ |
duke@435 | 1226 | const Type *MoveL2DNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1227 | const Type *t = phase->type( in(1) ); |
duke@435 | 1228 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 1229 | const TypeLong *tl = t->is_long(); |
duke@435 | 1230 | if( !tl->is_con() ) return bottom_type(); |
duke@435 | 1231 | JavaValue v; |
duke@435 | 1232 | v.set_jlong(tl->get_con()); |
duke@435 | 1233 | return TypeD::make( v.get_jdouble() ); |
duke@435 | 1234 | } |
duke@435 | 1235 | |
duke@435 | 1236 | //------------------------------Value------------------------------------------ |
duke@435 | 1237 | const Type *MoveI2FNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1238 | const Type *t = phase->type( in(1) ); |
duke@435 | 1239 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 1240 | const TypeInt *ti = t->is_int(); |
duke@435 | 1241 | if( !ti->is_con() ) return bottom_type(); |
duke@435 | 1242 | JavaValue v; |
duke@435 | 1243 | v.set_jint(ti->get_con()); |
duke@435 | 1244 | return TypeF::make( v.get_jfloat() ); |
duke@435 | 1245 | } |
duke@435 | 1246 | |
duke@435 | 1247 | //------------------------------Value------------------------------------------ |
duke@435 | 1248 | const Type *MoveF2INode::Value( PhaseTransform *phase ) const { |
duke@435 | 1249 | const Type *t = phase->type( in(1) ); |
duke@435 | 1250 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 1251 | if( t == Type::FLOAT ) return TypeInt::INT; |
duke@435 | 1252 | const TypeF *tf = t->is_float_constant(); |
duke@435 | 1253 | JavaValue v; |
duke@435 | 1254 | v.set_jfloat(tf->getf()); |
duke@435 | 1255 | return TypeInt::make( v.get_jint() ); |
duke@435 | 1256 | } |
duke@435 | 1257 | |
duke@435 | 1258 | //------------------------------Value------------------------------------------ |
duke@435 | 1259 | const Type *MoveD2LNode::Value( PhaseTransform *phase ) const { |
duke@435 | 1260 | const Type *t = phase->type( in(1) ); |
duke@435 | 1261 | if( t == Type::TOP ) return Type::TOP; |
duke@435 | 1262 | if( t == Type::DOUBLE ) return TypeLong::LONG; |
duke@435 | 1263 | const TypeD *td = t->is_double_constant(); |
duke@435 | 1264 | JavaValue v; |
duke@435 | 1265 | v.set_jdouble(td->getd()); |
duke@435 | 1266 | return TypeLong::make( v.get_jlong() ); |
duke@435 | 1267 | } |
twisti@1210 | 1268 | |
twisti@1210 | 1269 | //------------------------------Value------------------------------------------ |
twisti@1210 | 1270 | const Type* CountLeadingZerosINode::Value(PhaseTransform* phase) const { |
twisti@1210 | 1271 | const Type* t = phase->type(in(1)); |
twisti@1210 | 1272 | if (t == Type::TOP) return Type::TOP; |
twisti@1210 | 1273 | const TypeInt* ti = t->isa_int(); |
twisti@1210 | 1274 | if (ti && ti->is_con()) { |
twisti@1210 | 1275 | jint i = ti->get_con(); |
twisti@1210 | 1276 | // HD, Figure 5-6 |
twisti@1210 | 1277 | if (i == 0) |
twisti@1210 | 1278 | return TypeInt::make(BitsPerInt); |
twisti@1210 | 1279 | int n = 1; |
twisti@1210 | 1280 | unsigned int x = i; |
twisti@1210 | 1281 | if (x >> 16 == 0) { n += 16; x <<= 16; } |
twisti@1210 | 1282 | if (x >> 24 == 0) { n += 8; x <<= 8; } |
twisti@1210 | 1283 | if (x >> 28 == 0) { n += 4; x <<= 4; } |
twisti@1210 | 1284 | if (x >> 30 == 0) { n += 2; x <<= 2; } |
twisti@1210 | 1285 | n -= x >> 31; |
twisti@1210 | 1286 | return TypeInt::make(n); |
twisti@1210 | 1287 | } |
twisti@1210 | 1288 | return TypeInt::INT; |
twisti@1210 | 1289 | } |
twisti@1210 | 1290 | |
twisti@1210 | 1291 | //------------------------------Value------------------------------------------ |
twisti@1210 | 1292 | const Type* CountLeadingZerosLNode::Value(PhaseTransform* phase) const { |
twisti@1210 | 1293 | const Type* t = phase->type(in(1)); |
twisti@1210 | 1294 | if (t == Type::TOP) return Type::TOP; |
twisti@1210 | 1295 | const TypeLong* tl = t->isa_long(); |
twisti@1210 | 1296 | if (tl && tl->is_con()) { |
twisti@1210 | 1297 | jlong l = tl->get_con(); |
twisti@1210 | 1298 | // HD, Figure 5-6 |
twisti@1210 | 1299 | if (l == 0) |
twisti@1210 | 1300 | return TypeInt::make(BitsPerLong); |
twisti@1210 | 1301 | int n = 1; |
twisti@1210 | 1302 | unsigned int x = (((julong) l) >> 32); |
twisti@1210 | 1303 | if (x == 0) { n += 32; x = (int) l; } |
twisti@1210 | 1304 | if (x >> 16 == 0) { n += 16; x <<= 16; } |
twisti@1210 | 1305 | if (x >> 24 == 0) { n += 8; x <<= 8; } |
twisti@1210 | 1306 | if (x >> 28 == 0) { n += 4; x <<= 4; } |
twisti@1210 | 1307 | if (x >> 30 == 0) { n += 2; x <<= 2; } |
twisti@1210 | 1308 | n -= x >> 31; |
twisti@1210 | 1309 | return TypeInt::make(n); |
twisti@1210 | 1310 | } |
twisti@1210 | 1311 | return TypeInt::INT; |
twisti@1210 | 1312 | } |
twisti@1210 | 1313 | |
twisti@1210 | 1314 | //------------------------------Value------------------------------------------ |
twisti@1210 | 1315 | const Type* CountTrailingZerosINode::Value(PhaseTransform* phase) const { |
twisti@1210 | 1316 | const Type* t = phase->type(in(1)); |
twisti@1210 | 1317 | if (t == Type::TOP) return Type::TOP; |
twisti@1210 | 1318 | const TypeInt* ti = t->isa_int(); |
twisti@1210 | 1319 | if (ti && ti->is_con()) { |
twisti@1210 | 1320 | jint i = ti->get_con(); |
twisti@1210 | 1321 | // HD, Figure 5-14 |
twisti@1210 | 1322 | int y; |
twisti@1210 | 1323 | if (i == 0) |
twisti@1210 | 1324 | return TypeInt::make(BitsPerInt); |
twisti@1210 | 1325 | int n = 31; |
twisti@1210 | 1326 | y = i << 16; if (y != 0) { n = n - 16; i = y; } |
twisti@1210 | 1327 | y = i << 8; if (y != 0) { n = n - 8; i = y; } |
twisti@1210 | 1328 | y = i << 4; if (y != 0) { n = n - 4; i = y; } |
twisti@1210 | 1329 | y = i << 2; if (y != 0) { n = n - 2; i = y; } |
twisti@1210 | 1330 | y = i << 1; if (y != 0) { n = n - 1; } |
twisti@1210 | 1331 | return TypeInt::make(n); |
twisti@1210 | 1332 | } |
twisti@1210 | 1333 | return TypeInt::INT; |
twisti@1210 | 1334 | } |
twisti@1210 | 1335 | |
twisti@1210 | 1336 | //------------------------------Value------------------------------------------ |
twisti@1210 | 1337 | const Type* CountTrailingZerosLNode::Value(PhaseTransform* phase) const { |
twisti@1210 | 1338 | const Type* t = phase->type(in(1)); |
twisti@1210 | 1339 | if (t == Type::TOP) return Type::TOP; |
twisti@1210 | 1340 | const TypeLong* tl = t->isa_long(); |
twisti@1210 | 1341 | if (tl && tl->is_con()) { |
twisti@1210 | 1342 | jlong l = tl->get_con(); |
twisti@1210 | 1343 | // HD, Figure 5-14 |
twisti@1210 | 1344 | int x, y; |
twisti@1210 | 1345 | if (l == 0) |
twisti@1210 | 1346 | return TypeInt::make(BitsPerLong); |
twisti@1210 | 1347 | int n = 63; |
twisti@1210 | 1348 | y = (int) l; if (y != 0) { n = n - 32; x = y; } else x = (((julong) l) >> 32); |
twisti@1210 | 1349 | y = x << 16; if (y != 0) { n = n - 16; x = y; } |
twisti@1210 | 1350 | y = x << 8; if (y != 0) { n = n - 8; x = y; } |
twisti@1210 | 1351 | y = x << 4; if (y != 0) { n = n - 4; x = y; } |
twisti@1210 | 1352 | y = x << 2; if (y != 0) { n = n - 2; x = y; } |
twisti@1210 | 1353 | y = x << 1; if (y != 0) { n = n - 1; } |
twisti@1210 | 1354 | return TypeInt::make(n); |
twisti@1210 | 1355 | } |
twisti@1210 | 1356 | return TypeInt::INT; |
twisti@1210 | 1357 | } |