Mon, 26 Sep 2011 10:24:05 -0700
7081933: Use zeroing elimination optimization for large array
Summary: Don't zero new typeArray during runtime call if the allocation is followed by arraycopy into it.
Reviewed-by: twisti
duke@435 | 1 | /* |
stefank@2314 | 2 | * Copyright (c) 1997, 2010, 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/cfgnode.hpp" |
stefank@2314 | 29 | #include "opto/connode.hpp" |
stefank@2314 | 30 | #include "opto/machnode.hpp" |
stefank@2314 | 31 | #include "opto/mulnode.hpp" |
stefank@2314 | 32 | #include "opto/phaseX.hpp" |
stefank@2314 | 33 | #include "opto/subnode.hpp" |
stefank@2314 | 34 | |
duke@435 | 35 | // Portions of code courtesy of Clifford Click |
duke@435 | 36 | |
duke@435 | 37 | #define MAXFLOAT ((float)3.40282346638528860e+38) |
duke@435 | 38 | |
duke@435 | 39 | // Classic Add functionality. This covers all the usual 'add' behaviors for |
duke@435 | 40 | // an algebraic ring. Add-integer, add-float, add-double, and binary-or are |
duke@435 | 41 | // all inherited from this class. The various identity values are supplied |
duke@435 | 42 | // by virtual functions. |
duke@435 | 43 | |
duke@435 | 44 | |
duke@435 | 45 | //============================================================================= |
duke@435 | 46 | //------------------------------hash------------------------------------------- |
duke@435 | 47 | // Hash function over AddNodes. Needs to be commutative; i.e., I swap |
duke@435 | 48 | // (commute) inputs to AddNodes willy-nilly so the hash function must return |
duke@435 | 49 | // the same value in the presence of edge swapping. |
duke@435 | 50 | uint AddNode::hash() const { |
duke@435 | 51 | return (uintptr_t)in(1) + (uintptr_t)in(2) + Opcode(); |
duke@435 | 52 | } |
duke@435 | 53 | |
duke@435 | 54 | //------------------------------Identity--------------------------------------- |
duke@435 | 55 | // If either input is a constant 0, return the other input. |
duke@435 | 56 | Node *AddNode::Identity( PhaseTransform *phase ) { |
duke@435 | 57 | const Type *zero = add_id(); // The additive identity |
duke@435 | 58 | if( phase->type( in(1) )->higher_equal( zero ) ) return in(2); |
duke@435 | 59 | if( phase->type( in(2) )->higher_equal( zero ) ) return in(1); |
duke@435 | 60 | return this; |
duke@435 | 61 | } |
duke@435 | 62 | |
duke@435 | 63 | //------------------------------commute---------------------------------------- |
duke@435 | 64 | // Commute operands to move loads and constants to the right. |
duke@435 | 65 | static bool commute( Node *add, int con_left, int con_right ) { |
duke@435 | 66 | Node *in1 = add->in(1); |
duke@435 | 67 | Node *in2 = add->in(2); |
duke@435 | 68 | |
duke@435 | 69 | // Convert "1+x" into "x+1". |
duke@435 | 70 | // Right is a constant; leave it |
duke@435 | 71 | if( con_right ) return false; |
duke@435 | 72 | // Left is a constant; move it right. |
duke@435 | 73 | if( con_left ) { |
duke@435 | 74 | add->swap_edges(1, 2); |
duke@435 | 75 | return true; |
duke@435 | 76 | } |
duke@435 | 77 | |
duke@435 | 78 | // Convert "Load+x" into "x+Load". |
duke@435 | 79 | // Now check for loads |
never@534 | 80 | if (in2->is_Load()) { |
never@534 | 81 | if (!in1->is_Load()) { |
never@534 | 82 | // already x+Load to return |
never@534 | 83 | return false; |
never@534 | 84 | } |
never@534 | 85 | // both are loads, so fall through to sort inputs by idx |
never@534 | 86 | } else if( in1->is_Load() ) { |
never@534 | 87 | // Left is a Load and Right is not; move it right. |
duke@435 | 88 | add->swap_edges(1, 2); |
duke@435 | 89 | return true; |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | PhiNode *phi; |
duke@435 | 93 | // Check for tight loop increments: Loop-phi of Add of loop-phi |
duke@435 | 94 | if( in1->is_Phi() && (phi = in1->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add) |
duke@435 | 95 | return false; |
duke@435 | 96 | if( in2->is_Phi() && (phi = in2->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add){ |
duke@435 | 97 | add->swap_edges(1, 2); |
duke@435 | 98 | return true; |
duke@435 | 99 | } |
duke@435 | 100 | |
duke@435 | 101 | // Otherwise, sort inputs (commutativity) to help value numbering. |
duke@435 | 102 | if( in1->_idx > in2->_idx ) { |
duke@435 | 103 | add->swap_edges(1, 2); |
duke@435 | 104 | return true; |
duke@435 | 105 | } |
duke@435 | 106 | return false; |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | //------------------------------Idealize--------------------------------------- |
duke@435 | 110 | // If we get here, we assume we are associative! |
duke@435 | 111 | Node *AddNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 112 | const Type *t1 = phase->type( in(1) ); |
duke@435 | 113 | const Type *t2 = phase->type( in(2) ); |
duke@435 | 114 | int con_left = t1->singleton(); |
duke@435 | 115 | int con_right = t2->singleton(); |
duke@435 | 116 | |
duke@435 | 117 | // Check for commutative operation desired |
duke@435 | 118 | if( commute(this,con_left,con_right) ) return this; |
duke@435 | 119 | |
duke@435 | 120 | AddNode *progress = NULL; // Progress flag |
duke@435 | 121 | |
duke@435 | 122 | // Convert "(x+1)+2" into "x+(1+2)". If the right input is a |
duke@435 | 123 | // constant, and the left input is an add of a constant, flatten the |
duke@435 | 124 | // expression tree. |
duke@435 | 125 | Node *add1 = in(1); |
duke@435 | 126 | Node *add2 = in(2); |
duke@435 | 127 | int add1_op = add1->Opcode(); |
duke@435 | 128 | int this_op = Opcode(); |
duke@435 | 129 | if( con_right && t2 != Type::TOP && // Right input is a constant? |
duke@435 | 130 | add1_op == this_op ) { // Left input is an Add? |
duke@435 | 131 | |
duke@435 | 132 | // Type of left _in right input |
duke@435 | 133 | const Type *t12 = phase->type( add1->in(2) ); |
duke@435 | 134 | if( t12->singleton() && t12 != Type::TOP ) { // Left input is an add of a constant? |
duke@435 | 135 | // Check for rare case of closed data cycle which can happen inside |
duke@435 | 136 | // unreachable loops. In these cases the computation is undefined. |
duke@435 | 137 | #ifdef ASSERT |
duke@435 | 138 | Node *add11 = add1->in(1); |
duke@435 | 139 | int add11_op = add11->Opcode(); |
duke@435 | 140 | if( (add1 == add1->in(1)) |
duke@435 | 141 | || (add11_op == this_op && add11->in(1) == add1) ) { |
duke@435 | 142 | assert(false, "dead loop in AddNode::Ideal"); |
duke@435 | 143 | } |
duke@435 | 144 | #endif |
duke@435 | 145 | // The Add of the flattened expression |
duke@435 | 146 | Node *x1 = add1->in(1); |
duke@435 | 147 | Node *x2 = phase->makecon( add1->as_Add()->add_ring( t2, t12 )); |
duke@435 | 148 | PhaseIterGVN *igvn = phase->is_IterGVN(); |
duke@435 | 149 | if( igvn ) { |
duke@435 | 150 | set_req_X(2,x2,igvn); |
duke@435 | 151 | set_req_X(1,x1,igvn); |
duke@435 | 152 | } else { |
duke@435 | 153 | set_req(2,x2); |
duke@435 | 154 | set_req(1,x1); |
duke@435 | 155 | } |
duke@435 | 156 | progress = this; // Made progress |
duke@435 | 157 | add1 = in(1); |
duke@435 | 158 | add1_op = add1->Opcode(); |
duke@435 | 159 | } |
duke@435 | 160 | } |
duke@435 | 161 | |
duke@435 | 162 | // Convert "(x+1)+y" into "(x+y)+1". Push constants down the expression tree. |
duke@435 | 163 | if( add1_op == this_op && !con_right ) { |
duke@435 | 164 | Node *a12 = add1->in(2); |
duke@435 | 165 | const Type *t12 = phase->type( a12 ); |
kvn@835 | 166 | if( t12->singleton() && t12 != Type::TOP && (add1 != add1->in(1)) && |
kvn@835 | 167 | !(add1->in(1)->is_Phi() && add1->in(1)->as_Phi()->is_tripcount()) ) { |
kvn@755 | 168 | assert(add1->in(1) != this, "dead loop in AddNode::Ideal"); |
duke@435 | 169 | add2 = add1->clone(); |
duke@435 | 170 | add2->set_req(2, in(2)); |
duke@435 | 171 | add2 = phase->transform(add2); |
duke@435 | 172 | set_req(1, add2); |
duke@435 | 173 | set_req(2, a12); |
duke@435 | 174 | progress = this; |
duke@435 | 175 | add2 = a12; |
duke@435 | 176 | } |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | // Convert "x+(y+1)" into "(x+y)+1". Push constants down the expression tree. |
duke@435 | 180 | int add2_op = add2->Opcode(); |
duke@435 | 181 | if( add2_op == this_op && !con_left ) { |
duke@435 | 182 | Node *a22 = add2->in(2); |
duke@435 | 183 | const Type *t22 = phase->type( a22 ); |
kvn@835 | 184 | if( t22->singleton() && t22 != Type::TOP && (add2 != add2->in(1)) && |
kvn@835 | 185 | !(add2->in(1)->is_Phi() && add2->in(1)->as_Phi()->is_tripcount()) ) { |
kvn@755 | 186 | assert(add2->in(1) != this, "dead loop in AddNode::Ideal"); |
duke@435 | 187 | Node *addx = add2->clone(); |
duke@435 | 188 | addx->set_req(1, in(1)); |
duke@435 | 189 | addx->set_req(2, add2->in(1)); |
duke@435 | 190 | addx = phase->transform(addx); |
duke@435 | 191 | set_req(1, addx); |
duke@435 | 192 | set_req(2, a22); |
duke@435 | 193 | progress = this; |
duke@435 | 194 | } |
duke@435 | 195 | } |
duke@435 | 196 | |
duke@435 | 197 | return progress; |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | //------------------------------Value----------------------------------------- |
duke@435 | 201 | // An add node sums it's two _in. If one input is an RSD, we must mixin |
duke@435 | 202 | // the other input's symbols. |
duke@435 | 203 | const Type *AddNode::Value( PhaseTransform *phase ) const { |
duke@435 | 204 | // Either input is TOP ==> the result is TOP |
duke@435 | 205 | const Type *t1 = phase->type( in(1) ); |
duke@435 | 206 | const Type *t2 = phase->type( in(2) ); |
duke@435 | 207 | if( t1 == Type::TOP ) return Type::TOP; |
duke@435 | 208 | if( t2 == Type::TOP ) return Type::TOP; |
duke@435 | 209 | |
duke@435 | 210 | // Either input is BOTTOM ==> the result is the local BOTTOM |
duke@435 | 211 | const Type *bot = bottom_type(); |
duke@435 | 212 | if( (t1 == bot) || (t2 == bot) || |
duke@435 | 213 | (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) |
duke@435 | 214 | return bot; |
duke@435 | 215 | |
duke@435 | 216 | // Check for an addition involving the additive identity |
duke@435 | 217 | const Type *tadd = add_of_identity( t1, t2 ); |
duke@435 | 218 | if( tadd ) return tadd; |
duke@435 | 219 | |
duke@435 | 220 | return add_ring(t1,t2); // Local flavor of type addition |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | //------------------------------add_identity----------------------------------- |
duke@435 | 224 | // Check for addition of the identity |
duke@435 | 225 | const Type *AddNode::add_of_identity( const Type *t1, const Type *t2 ) const { |
duke@435 | 226 | const Type *zero = add_id(); // The additive identity |
duke@435 | 227 | if( t1->higher_equal( zero ) ) return t2; |
duke@435 | 228 | if( t2->higher_equal( zero ) ) return t1; |
duke@435 | 229 | |
duke@435 | 230 | return NULL; |
duke@435 | 231 | } |
duke@435 | 232 | |
duke@435 | 233 | |
duke@435 | 234 | //============================================================================= |
duke@435 | 235 | //------------------------------Idealize--------------------------------------- |
duke@435 | 236 | Node *AddINode::Ideal(PhaseGVN *phase, bool can_reshape) { |
kvn@835 | 237 | Node* in1 = in(1); |
kvn@835 | 238 | Node* in2 = in(2); |
kvn@835 | 239 | int op1 = in1->Opcode(); |
kvn@835 | 240 | int op2 = in2->Opcode(); |
duke@435 | 241 | // Fold (con1-x)+con2 into (con1+con2)-x |
kvn@835 | 242 | if ( op1 == Op_AddI && op2 == Op_SubI ) { |
kvn@835 | 243 | // Swap edges to try optimizations below |
kvn@835 | 244 | in1 = in2; |
kvn@835 | 245 | in2 = in(1); |
kvn@835 | 246 | op1 = op2; |
kvn@835 | 247 | op2 = in2->Opcode(); |
kvn@835 | 248 | } |
duke@435 | 249 | if( op1 == Op_SubI ) { |
kvn@835 | 250 | const Type *t_sub1 = phase->type( in1->in(1) ); |
kvn@835 | 251 | const Type *t_2 = phase->type( in2 ); |
duke@435 | 252 | if( t_sub1->singleton() && t_2->singleton() && t_sub1 != Type::TOP && t_2 != Type::TOP ) |
duke@435 | 253 | return new (phase->C, 3) SubINode(phase->makecon( add_ring( t_sub1, t_2 ) ), |
kvn@835 | 254 | in1->in(2) ); |
duke@435 | 255 | // Convert "(a-b)+(c-d)" into "(a+c)-(b+d)" |
duke@435 | 256 | if( op2 == Op_SubI ) { |
duke@435 | 257 | // Check for dead cycle: d = (a-b)+(c-d) |
kvn@835 | 258 | assert( in1->in(2) != this && in2->in(2) != this, |
duke@435 | 259 | "dead loop in AddINode::Ideal" ); |
duke@435 | 260 | Node *sub = new (phase->C, 3) SubINode(NULL, NULL); |
kvn@835 | 261 | sub->init_req(1, phase->transform(new (phase->C, 3) AddINode(in1->in(1), in2->in(1) ) )); |
kvn@835 | 262 | sub->init_req(2, phase->transform(new (phase->C, 3) AddINode(in1->in(2), in2->in(2) ) )); |
duke@435 | 263 | return sub; |
duke@435 | 264 | } |
kvn@835 | 265 | // Convert "(a-b)+(b+c)" into "(a+c)" |
kvn@835 | 266 | if( op2 == Op_AddI && in1->in(2) == in2->in(1) ) { |
kvn@835 | 267 | assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddINode::Ideal"); |
kvn@835 | 268 | return new (phase->C, 3) AddINode(in1->in(1), in2->in(2)); |
kvn@835 | 269 | } |
kvn@835 | 270 | // Convert "(a-b)+(c+b)" into "(a+c)" |
kvn@835 | 271 | if( op2 == Op_AddI && in1->in(2) == in2->in(2) ) { |
kvn@835 | 272 | assert(in1->in(1) != this && in2->in(1) != this,"dead loop in AddINode::Ideal"); |
kvn@835 | 273 | return new (phase->C, 3) AddINode(in1->in(1), in2->in(1)); |
kvn@835 | 274 | } |
kvn@835 | 275 | // Convert "(a-b)+(b-c)" into "(a-c)" |
kvn@835 | 276 | if( op2 == Op_SubI && in1->in(2) == in2->in(1) ) { |
kvn@835 | 277 | assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddINode::Ideal"); |
kvn@835 | 278 | return new (phase->C, 3) SubINode(in1->in(1), in2->in(2)); |
kvn@835 | 279 | } |
kvn@835 | 280 | // Convert "(a-b)+(c-a)" into "(c-b)" |
kvn@835 | 281 | if( op2 == Op_SubI && in1->in(1) == in2->in(2) ) { |
kvn@835 | 282 | assert(in1->in(2) != this && in2->in(1) != this,"dead loop in AddINode::Ideal"); |
kvn@835 | 283 | return new (phase->C, 3) SubINode(in2->in(1), in1->in(2)); |
kvn@835 | 284 | } |
duke@435 | 285 | } |
duke@435 | 286 | |
duke@435 | 287 | // Convert "x+(0-y)" into "(x-y)" |
kvn@835 | 288 | if( op2 == Op_SubI && phase->type(in2->in(1)) == TypeInt::ZERO ) |
kvn@835 | 289 | return new (phase->C, 3) SubINode(in1, in2->in(2) ); |
duke@435 | 290 | |
duke@435 | 291 | // Convert "(0-y)+x" into "(x-y)" |
kvn@835 | 292 | if( op1 == Op_SubI && phase->type(in1->in(1)) == TypeInt::ZERO ) |
kvn@835 | 293 | return new (phase->C, 3) SubINode( in2, in1->in(2) ); |
duke@435 | 294 | |
duke@435 | 295 | // Convert (x>>>z)+y into (x+(y<<z))>>>z for small constant z and y. |
duke@435 | 296 | // Helps with array allocation math constant folding |
duke@435 | 297 | // See 4790063: |
duke@435 | 298 | // Unrestricted transformation is unsafe for some runtime values of 'x' |
duke@435 | 299 | // ( x == 0, z == 1, y == -1 ) fails |
duke@435 | 300 | // ( x == -5, z == 1, y == 1 ) fails |
duke@435 | 301 | // Transform works for small z and small negative y when the addition |
duke@435 | 302 | // (x + (y << z)) does not cross zero. |
duke@435 | 303 | // Implement support for negative y and (x >= -(y << z)) |
duke@435 | 304 | // Have not observed cases where type information exists to support |
duke@435 | 305 | // positive y and (x <= -(y << z)) |
duke@435 | 306 | if( op1 == Op_URShiftI && op2 == Op_ConI && |
kvn@835 | 307 | in1->in(2)->Opcode() == Op_ConI ) { |
kvn@835 | 308 | jint z = phase->type( in1->in(2) )->is_int()->get_con() & 0x1f; // only least significant 5 bits matter |
kvn@835 | 309 | jint y = phase->type( in2 )->is_int()->get_con(); |
duke@435 | 310 | |
duke@435 | 311 | if( z < 5 && -5 < y && y < 0 ) { |
kvn@835 | 312 | const Type *t_in11 = phase->type(in1->in(1)); |
duke@435 | 313 | if( t_in11 != Type::TOP && (t_in11->is_int()->_lo >= -(y << z)) ) { |
kvn@835 | 314 | Node *a = phase->transform( new (phase->C, 3) AddINode( in1->in(1), phase->intcon(y<<z) ) ); |
kvn@835 | 315 | return new (phase->C, 3) URShiftINode( a, in1->in(2) ); |
duke@435 | 316 | } |
duke@435 | 317 | } |
duke@435 | 318 | } |
duke@435 | 319 | |
duke@435 | 320 | return AddNode::Ideal(phase, can_reshape); |
duke@435 | 321 | } |
duke@435 | 322 | |
duke@435 | 323 | |
duke@435 | 324 | //------------------------------Identity--------------------------------------- |
duke@435 | 325 | // Fold (x-y)+y OR y+(x-y) into x |
duke@435 | 326 | Node *AddINode::Identity( PhaseTransform *phase ) { |
duke@435 | 327 | if( in(1)->Opcode() == Op_SubI && phase->eqv(in(1)->in(2),in(2)) ) { |
duke@435 | 328 | return in(1)->in(1); |
duke@435 | 329 | } |
duke@435 | 330 | else if( in(2)->Opcode() == Op_SubI && phase->eqv(in(2)->in(2),in(1)) ) { |
duke@435 | 331 | return in(2)->in(1); |
duke@435 | 332 | } |
duke@435 | 333 | return AddNode::Identity(phase); |
duke@435 | 334 | } |
duke@435 | 335 | |
duke@435 | 336 | |
duke@435 | 337 | //------------------------------add_ring--------------------------------------- |
duke@435 | 338 | // Supplied function returns the sum of the inputs. Guaranteed never |
duke@435 | 339 | // to be passed a TOP or BOTTOM type, these are filtered out by |
duke@435 | 340 | // pre-check. |
duke@435 | 341 | const Type *AddINode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 342 | const TypeInt *r0 = t0->is_int(); // Handy access |
duke@435 | 343 | const TypeInt *r1 = t1->is_int(); |
duke@435 | 344 | int lo = r0->_lo + r1->_lo; |
duke@435 | 345 | int hi = r0->_hi + r1->_hi; |
duke@435 | 346 | if( !(r0->is_con() && r1->is_con()) ) { |
duke@435 | 347 | // Not both constants, compute approximate result |
duke@435 | 348 | if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) { |
duke@435 | 349 | lo = min_jint; hi = max_jint; // Underflow on the low side |
duke@435 | 350 | } |
duke@435 | 351 | if( (~(r0->_hi | r1->_hi)) < 0 && hi < 0 ) { |
duke@435 | 352 | lo = min_jint; hi = max_jint; // Overflow on the high side |
duke@435 | 353 | } |
duke@435 | 354 | if( lo > hi ) { // Handle overflow |
duke@435 | 355 | lo = min_jint; hi = max_jint; |
duke@435 | 356 | } |
duke@435 | 357 | } else { |
duke@435 | 358 | // both constants, compute precise result using 'lo' and 'hi' |
duke@435 | 359 | // Semantics define overflow and underflow for integer addition |
duke@435 | 360 | // as expected. In particular: 0x80000000 + 0x80000000 --> 0x0 |
duke@435 | 361 | } |
duke@435 | 362 | return TypeInt::make( lo, hi, MAX2(r0->_widen,r1->_widen) ); |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | |
duke@435 | 366 | //============================================================================= |
duke@435 | 367 | //------------------------------Idealize--------------------------------------- |
duke@435 | 368 | Node *AddLNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
kvn@835 | 369 | Node* in1 = in(1); |
kvn@835 | 370 | Node* in2 = in(2); |
kvn@835 | 371 | int op1 = in1->Opcode(); |
kvn@835 | 372 | int op2 = in2->Opcode(); |
kvn@835 | 373 | // Fold (con1-x)+con2 into (con1+con2)-x |
kvn@835 | 374 | if ( op1 == Op_AddL && op2 == Op_SubL ) { |
kvn@835 | 375 | // Swap edges to try optimizations below |
kvn@835 | 376 | in1 = in2; |
kvn@835 | 377 | in2 = in(1); |
kvn@835 | 378 | op1 = op2; |
kvn@835 | 379 | op2 = in2->Opcode(); |
kvn@835 | 380 | } |
duke@435 | 381 | // Fold (con1-x)+con2 into (con1+con2)-x |
duke@435 | 382 | if( op1 == Op_SubL ) { |
kvn@835 | 383 | const Type *t_sub1 = phase->type( in1->in(1) ); |
kvn@835 | 384 | const Type *t_2 = phase->type( in2 ); |
duke@435 | 385 | if( t_sub1->singleton() && t_2->singleton() && t_sub1 != Type::TOP && t_2 != Type::TOP ) |
duke@435 | 386 | return new (phase->C, 3) SubLNode(phase->makecon( add_ring( t_sub1, t_2 ) ), |
kvn@835 | 387 | in1->in(2) ); |
duke@435 | 388 | // Convert "(a-b)+(c-d)" into "(a+c)-(b+d)" |
duke@435 | 389 | if( op2 == Op_SubL ) { |
duke@435 | 390 | // Check for dead cycle: d = (a-b)+(c-d) |
kvn@835 | 391 | assert( in1->in(2) != this && in2->in(2) != this, |
duke@435 | 392 | "dead loop in AddLNode::Ideal" ); |
duke@435 | 393 | Node *sub = new (phase->C, 3) SubLNode(NULL, NULL); |
kvn@835 | 394 | sub->init_req(1, phase->transform(new (phase->C, 3) AddLNode(in1->in(1), in2->in(1) ) )); |
kvn@835 | 395 | sub->init_req(2, phase->transform(new (phase->C, 3) AddLNode(in1->in(2), in2->in(2) ) )); |
duke@435 | 396 | return sub; |
duke@435 | 397 | } |
kvn@835 | 398 | // Convert "(a-b)+(b+c)" into "(a+c)" |
kvn@835 | 399 | if( op2 == Op_AddL && in1->in(2) == in2->in(1) ) { |
kvn@835 | 400 | assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddLNode::Ideal"); |
kvn@835 | 401 | return new (phase->C, 3) AddLNode(in1->in(1), in2->in(2)); |
kvn@835 | 402 | } |
kvn@835 | 403 | // Convert "(a-b)+(c+b)" into "(a+c)" |
kvn@835 | 404 | if( op2 == Op_AddL && in1->in(2) == in2->in(2) ) { |
kvn@835 | 405 | assert(in1->in(1) != this && in2->in(1) != this,"dead loop in AddLNode::Ideal"); |
kvn@835 | 406 | return new (phase->C, 3) AddLNode(in1->in(1), in2->in(1)); |
kvn@835 | 407 | } |
kvn@835 | 408 | // Convert "(a-b)+(b-c)" into "(a-c)" |
kvn@835 | 409 | if( op2 == Op_SubL && in1->in(2) == in2->in(1) ) { |
kvn@835 | 410 | assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddLNode::Ideal"); |
kvn@835 | 411 | return new (phase->C, 3) SubLNode(in1->in(1), in2->in(2)); |
kvn@835 | 412 | } |
kvn@835 | 413 | // Convert "(a-b)+(c-a)" into "(c-b)" |
kvn@835 | 414 | if( op2 == Op_SubL && in1->in(1) == in1->in(2) ) { |
kvn@835 | 415 | assert(in1->in(2) != this && in2->in(1) != this,"dead loop in AddLNode::Ideal"); |
kvn@835 | 416 | return new (phase->C, 3) SubLNode(in2->in(1), in1->in(2)); |
kvn@835 | 417 | } |
duke@435 | 418 | } |
duke@435 | 419 | |
duke@435 | 420 | // Convert "x+(0-y)" into "(x-y)" |
kvn@835 | 421 | if( op2 == Op_SubL && phase->type(in2->in(1)) == TypeLong::ZERO ) |
kvn@835 | 422 | return new (phase->C, 3) SubLNode( in1, in2->in(2) ); |
kvn@835 | 423 | |
kvn@835 | 424 | // Convert "(0-y)+x" into "(x-y)" |
kvn@835 | 425 | if( op1 == Op_SubL && phase->type(in1->in(1)) == TypeInt::ZERO ) |
kvn@835 | 426 | return new (phase->C, 3) SubLNode( in2, in1->in(2) ); |
duke@435 | 427 | |
duke@435 | 428 | // Convert "X+X+X+X+X...+X+Y" into "k*X+Y" or really convert "X+(X+Y)" |
duke@435 | 429 | // into "(X<<1)+Y" and let shift-folding happen. |
duke@435 | 430 | if( op2 == Op_AddL && |
kvn@835 | 431 | in2->in(1) == in1 && |
duke@435 | 432 | op1 != Op_ConL && |
duke@435 | 433 | 0 ) { |
kvn@835 | 434 | Node *shift = phase->transform(new (phase->C, 3) LShiftLNode(in1,phase->intcon(1))); |
kvn@835 | 435 | return new (phase->C, 3) AddLNode(shift,in2->in(2)); |
duke@435 | 436 | } |
duke@435 | 437 | |
duke@435 | 438 | return AddNode::Ideal(phase, can_reshape); |
duke@435 | 439 | } |
duke@435 | 440 | |
duke@435 | 441 | |
duke@435 | 442 | //------------------------------Identity--------------------------------------- |
duke@435 | 443 | // Fold (x-y)+y OR y+(x-y) into x |
duke@435 | 444 | Node *AddLNode::Identity( PhaseTransform *phase ) { |
duke@435 | 445 | if( in(1)->Opcode() == Op_SubL && phase->eqv(in(1)->in(2),in(2)) ) { |
duke@435 | 446 | return in(1)->in(1); |
duke@435 | 447 | } |
duke@435 | 448 | else if( in(2)->Opcode() == Op_SubL && phase->eqv(in(2)->in(2),in(1)) ) { |
duke@435 | 449 | return in(2)->in(1); |
duke@435 | 450 | } |
duke@435 | 451 | return AddNode::Identity(phase); |
duke@435 | 452 | } |
duke@435 | 453 | |
duke@435 | 454 | |
duke@435 | 455 | //------------------------------add_ring--------------------------------------- |
duke@435 | 456 | // Supplied function returns the sum of the inputs. Guaranteed never |
duke@435 | 457 | // to be passed a TOP or BOTTOM type, these are filtered out by |
duke@435 | 458 | // pre-check. |
duke@435 | 459 | const Type *AddLNode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 460 | const TypeLong *r0 = t0->is_long(); // Handy access |
duke@435 | 461 | const TypeLong *r1 = t1->is_long(); |
duke@435 | 462 | jlong lo = r0->_lo + r1->_lo; |
duke@435 | 463 | jlong hi = r0->_hi + r1->_hi; |
duke@435 | 464 | if( !(r0->is_con() && r1->is_con()) ) { |
duke@435 | 465 | // Not both constants, compute approximate result |
duke@435 | 466 | if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) { |
duke@435 | 467 | lo =min_jlong; hi = max_jlong; // Underflow on the low side |
duke@435 | 468 | } |
duke@435 | 469 | if( (~(r0->_hi | r1->_hi)) < 0 && hi < 0 ) { |
duke@435 | 470 | lo = min_jlong; hi = max_jlong; // Overflow on the high side |
duke@435 | 471 | } |
duke@435 | 472 | if( lo > hi ) { // Handle overflow |
duke@435 | 473 | lo = min_jlong; hi = max_jlong; |
duke@435 | 474 | } |
duke@435 | 475 | } else { |
duke@435 | 476 | // both constants, compute precise result using 'lo' and 'hi' |
duke@435 | 477 | // Semantics define overflow and underflow for integer addition |
duke@435 | 478 | // as expected. In particular: 0x80000000 + 0x80000000 --> 0x0 |
duke@435 | 479 | } |
duke@435 | 480 | return TypeLong::make( lo, hi, MAX2(r0->_widen,r1->_widen) ); |
duke@435 | 481 | } |
duke@435 | 482 | |
duke@435 | 483 | |
duke@435 | 484 | //============================================================================= |
duke@435 | 485 | //------------------------------add_of_identity-------------------------------- |
duke@435 | 486 | // Check for addition of the identity |
duke@435 | 487 | const Type *AddFNode::add_of_identity( const Type *t1, const Type *t2 ) const { |
duke@435 | 488 | // x ADD 0 should return x unless 'x' is a -zero |
duke@435 | 489 | // |
duke@435 | 490 | // const Type *zero = add_id(); // The additive identity |
duke@435 | 491 | // jfloat f1 = t1->getf(); |
duke@435 | 492 | // jfloat f2 = t2->getf(); |
duke@435 | 493 | // |
duke@435 | 494 | // if( t1->higher_equal( zero ) ) return t2; |
duke@435 | 495 | // if( t2->higher_equal( zero ) ) return t1; |
duke@435 | 496 | |
duke@435 | 497 | return NULL; |
duke@435 | 498 | } |
duke@435 | 499 | |
duke@435 | 500 | //------------------------------add_ring--------------------------------------- |
duke@435 | 501 | // Supplied function returns the sum of the inputs. |
duke@435 | 502 | // This also type-checks the inputs for sanity. Guaranteed never to |
duke@435 | 503 | // be passed a TOP or BOTTOM type, these are filtered out by pre-check. |
duke@435 | 504 | const Type *AddFNode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 505 | // We must be adding 2 float constants. |
duke@435 | 506 | return TypeF::make( t0->getf() + t1->getf() ); |
duke@435 | 507 | } |
duke@435 | 508 | |
duke@435 | 509 | //------------------------------Ideal------------------------------------------ |
duke@435 | 510 | Node *AddFNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 511 | if( IdealizedNumerics && !phase->C->method()->is_strict() ) { |
duke@435 | 512 | return AddNode::Ideal(phase, can_reshape); // commutative and associative transforms |
duke@435 | 513 | } |
duke@435 | 514 | |
duke@435 | 515 | // Floating point additions are not associative because of boundary conditions (infinity) |
duke@435 | 516 | return commute(this, |
duke@435 | 517 | phase->type( in(1) )->singleton(), |
duke@435 | 518 | phase->type( in(2) )->singleton() ) ? this : NULL; |
duke@435 | 519 | } |
duke@435 | 520 | |
duke@435 | 521 | |
duke@435 | 522 | //============================================================================= |
duke@435 | 523 | //------------------------------add_of_identity-------------------------------- |
duke@435 | 524 | // Check for addition of the identity |
duke@435 | 525 | const Type *AddDNode::add_of_identity( const Type *t1, const Type *t2 ) const { |
duke@435 | 526 | // x ADD 0 should return x unless 'x' is a -zero |
duke@435 | 527 | // |
duke@435 | 528 | // const Type *zero = add_id(); // The additive identity |
duke@435 | 529 | // jfloat f1 = t1->getf(); |
duke@435 | 530 | // jfloat f2 = t2->getf(); |
duke@435 | 531 | // |
duke@435 | 532 | // if( t1->higher_equal( zero ) ) return t2; |
duke@435 | 533 | // if( t2->higher_equal( zero ) ) return t1; |
duke@435 | 534 | |
duke@435 | 535 | return NULL; |
duke@435 | 536 | } |
duke@435 | 537 | //------------------------------add_ring--------------------------------------- |
duke@435 | 538 | // Supplied function returns the sum of the inputs. |
duke@435 | 539 | // This also type-checks the inputs for sanity. Guaranteed never to |
duke@435 | 540 | // be passed a TOP or BOTTOM type, these are filtered out by pre-check. |
duke@435 | 541 | const Type *AddDNode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 542 | // We must be adding 2 double constants. |
duke@435 | 543 | return TypeD::make( t0->getd() + t1->getd() ); |
duke@435 | 544 | } |
duke@435 | 545 | |
duke@435 | 546 | //------------------------------Ideal------------------------------------------ |
duke@435 | 547 | Node *AddDNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 548 | if( IdealizedNumerics && !phase->C->method()->is_strict() ) { |
duke@435 | 549 | return AddNode::Ideal(phase, can_reshape); // commutative and associative transforms |
duke@435 | 550 | } |
duke@435 | 551 | |
duke@435 | 552 | // Floating point additions are not associative because of boundary conditions (infinity) |
duke@435 | 553 | return commute(this, |
duke@435 | 554 | phase->type( in(1) )->singleton(), |
duke@435 | 555 | phase->type( in(2) )->singleton() ) ? this : NULL; |
duke@435 | 556 | } |
duke@435 | 557 | |
duke@435 | 558 | |
duke@435 | 559 | //============================================================================= |
duke@435 | 560 | //------------------------------Identity--------------------------------------- |
duke@435 | 561 | // If one input is a constant 0, return the other input. |
duke@435 | 562 | Node *AddPNode::Identity( PhaseTransform *phase ) { |
duke@435 | 563 | return ( phase->type( in(Offset) )->higher_equal( TypeX_ZERO ) ) ? in(Address) : this; |
duke@435 | 564 | } |
duke@435 | 565 | |
duke@435 | 566 | //------------------------------Idealize--------------------------------------- |
duke@435 | 567 | Node *AddPNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 568 | // Bail out if dead inputs |
duke@435 | 569 | if( phase->type( in(Address) ) == Type::TOP ) return NULL; |
duke@435 | 570 | |
duke@435 | 571 | // If the left input is an add of a constant, flatten the expression tree. |
duke@435 | 572 | const Node *n = in(Address); |
duke@435 | 573 | if (n->is_AddP() && n->in(Base) == in(Base)) { |
duke@435 | 574 | const AddPNode *addp = n->as_AddP(); // Left input is an AddP |
duke@435 | 575 | assert( !addp->in(Address)->is_AddP() || |
duke@435 | 576 | addp->in(Address)->as_AddP() != addp, |
duke@435 | 577 | "dead loop in AddPNode::Ideal" ); |
duke@435 | 578 | // Type of left input's right input |
duke@435 | 579 | const Type *t = phase->type( addp->in(Offset) ); |
duke@435 | 580 | if( t == Type::TOP ) return NULL; |
duke@435 | 581 | const TypeX *t12 = t->is_intptr_t(); |
duke@435 | 582 | if( t12->is_con() ) { // Left input is an add of a constant? |
duke@435 | 583 | // If the right input is a constant, combine constants |
duke@435 | 584 | const Type *temp_t2 = phase->type( in(Offset) ); |
duke@435 | 585 | if( temp_t2 == Type::TOP ) return NULL; |
duke@435 | 586 | const TypeX *t2 = temp_t2->is_intptr_t(); |
kvn@467 | 587 | Node* address; |
kvn@467 | 588 | Node* offset; |
duke@435 | 589 | if( t2->is_con() ) { |
duke@435 | 590 | // The Add of the flattened expression |
kvn@467 | 591 | address = addp->in(Address); |
kvn@467 | 592 | offset = phase->MakeConX(t2->get_con() + t12->get_con()); |
kvn@467 | 593 | } else { |
kvn@467 | 594 | // Else move the constant to the right. ((A+con)+B) into ((A+B)+con) |
kvn@467 | 595 | address = phase->transform(new (phase->C, 4) AddPNode(in(Base),addp->in(Address),in(Offset))); |
kvn@467 | 596 | offset = addp->in(Offset); |
duke@435 | 597 | } |
kvn@467 | 598 | PhaseIterGVN *igvn = phase->is_IterGVN(); |
kvn@467 | 599 | if( igvn ) { |
kvn@467 | 600 | set_req_X(Address,address,igvn); |
kvn@467 | 601 | set_req_X(Offset,offset,igvn); |
kvn@467 | 602 | } else { |
kvn@467 | 603 | set_req(Address,address); |
kvn@467 | 604 | set_req(Offset,offset); |
kvn@467 | 605 | } |
duke@435 | 606 | return this; |
duke@435 | 607 | } |
duke@435 | 608 | } |
duke@435 | 609 | |
duke@435 | 610 | // Raw pointers? |
duke@435 | 611 | if( in(Base)->bottom_type() == Type::TOP ) { |
duke@435 | 612 | // If this is a NULL+long form (from unsafe accesses), switch to a rawptr. |
duke@435 | 613 | if (phase->type(in(Address)) == TypePtr::NULL_PTR) { |
duke@435 | 614 | Node* offset = in(Offset); |
duke@435 | 615 | return new (phase->C, 2) CastX2PNode(offset); |
duke@435 | 616 | } |
duke@435 | 617 | } |
duke@435 | 618 | |
duke@435 | 619 | // If the right is an add of a constant, push the offset down. |
duke@435 | 620 | // Convert: (ptr + (offset+con)) into (ptr+offset)+con. |
duke@435 | 621 | // The idea is to merge array_base+scaled_index groups together, |
duke@435 | 622 | // and only have different constant offsets from the same base. |
duke@435 | 623 | const Node *add = in(Offset); |
duke@435 | 624 | if( add->Opcode() == Op_AddX && add->in(1) != add ) { |
duke@435 | 625 | const Type *t22 = phase->type( add->in(2) ); |
duke@435 | 626 | if( t22->singleton() && (t22 != Type::TOP) ) { // Right input is an add of a constant? |
duke@435 | 627 | set_req(Address, phase->transform(new (phase->C, 4) AddPNode(in(Base),in(Address),add->in(1)))); |
duke@435 | 628 | set_req(Offset, add->in(2)); |
duke@435 | 629 | return this; // Made progress |
duke@435 | 630 | } |
duke@435 | 631 | } |
duke@435 | 632 | |
duke@435 | 633 | return NULL; // No progress |
duke@435 | 634 | } |
duke@435 | 635 | |
duke@435 | 636 | //------------------------------bottom_type------------------------------------ |
duke@435 | 637 | // Bottom-type is the pointer-type with unknown offset. |
duke@435 | 638 | const Type *AddPNode::bottom_type() const { |
duke@435 | 639 | if (in(Address) == NULL) return TypePtr::BOTTOM; |
duke@435 | 640 | const TypePtr *tp = in(Address)->bottom_type()->isa_ptr(); |
duke@435 | 641 | if( !tp ) return Type::TOP; // TOP input means TOP output |
duke@435 | 642 | assert( in(Offset)->Opcode() != Op_ConP, "" ); |
duke@435 | 643 | const Type *t = in(Offset)->bottom_type(); |
duke@435 | 644 | if( t == Type::TOP ) |
duke@435 | 645 | return tp->add_offset(Type::OffsetTop); |
duke@435 | 646 | const TypeX *tx = t->is_intptr_t(); |
duke@435 | 647 | intptr_t txoffset = Type::OffsetBot; |
duke@435 | 648 | if (tx->is_con()) { // Left input is an add of a constant? |
duke@435 | 649 | txoffset = tx->get_con(); |
duke@435 | 650 | } |
duke@435 | 651 | return tp->add_offset(txoffset); |
duke@435 | 652 | } |
duke@435 | 653 | |
duke@435 | 654 | //------------------------------Value------------------------------------------ |
duke@435 | 655 | const Type *AddPNode::Value( PhaseTransform *phase ) const { |
duke@435 | 656 | // Either input is TOP ==> the result is TOP |
duke@435 | 657 | const Type *t1 = phase->type( in(Address) ); |
duke@435 | 658 | const Type *t2 = phase->type( in(Offset) ); |
duke@435 | 659 | if( t1 == Type::TOP ) return Type::TOP; |
duke@435 | 660 | if( t2 == Type::TOP ) return Type::TOP; |
duke@435 | 661 | |
duke@435 | 662 | // Left input is a pointer |
duke@435 | 663 | const TypePtr *p1 = t1->isa_ptr(); |
duke@435 | 664 | // Right input is an int |
duke@435 | 665 | const TypeX *p2 = t2->is_intptr_t(); |
duke@435 | 666 | // Add 'em |
duke@435 | 667 | intptr_t p2offset = Type::OffsetBot; |
duke@435 | 668 | if (p2->is_con()) { // Left input is an add of a constant? |
duke@435 | 669 | p2offset = p2->get_con(); |
duke@435 | 670 | } |
duke@435 | 671 | return p1->add_offset(p2offset); |
duke@435 | 672 | } |
duke@435 | 673 | |
duke@435 | 674 | //------------------------Ideal_base_and_offset-------------------------------- |
duke@435 | 675 | // Split an oop pointer into a base and offset. |
duke@435 | 676 | // (The offset might be Type::OffsetBot in the case of an array.) |
duke@435 | 677 | // Return the base, or NULL if failure. |
duke@435 | 678 | Node* AddPNode::Ideal_base_and_offset(Node* ptr, PhaseTransform* phase, |
duke@435 | 679 | // second return value: |
duke@435 | 680 | intptr_t& offset) { |
duke@435 | 681 | if (ptr->is_AddP()) { |
duke@435 | 682 | Node* base = ptr->in(AddPNode::Base); |
duke@435 | 683 | Node* addr = ptr->in(AddPNode::Address); |
duke@435 | 684 | Node* offs = ptr->in(AddPNode::Offset); |
duke@435 | 685 | if (base == addr || base->is_top()) { |
duke@435 | 686 | offset = phase->find_intptr_t_con(offs, Type::OffsetBot); |
duke@435 | 687 | if (offset != Type::OffsetBot) { |
duke@435 | 688 | return addr; |
duke@435 | 689 | } |
duke@435 | 690 | } |
duke@435 | 691 | } |
duke@435 | 692 | offset = Type::OffsetBot; |
duke@435 | 693 | return NULL; |
duke@435 | 694 | } |
duke@435 | 695 | |
never@452 | 696 | //------------------------------unpack_offsets---------------------------------- |
never@452 | 697 | // Collect the AddP offset values into the elements array, giving up |
never@452 | 698 | // if there are more than length. |
never@452 | 699 | int AddPNode::unpack_offsets(Node* elements[], int length) { |
never@452 | 700 | int count = 0; |
never@452 | 701 | Node* addr = this; |
never@452 | 702 | Node* base = addr->in(AddPNode::Base); |
never@452 | 703 | while (addr->is_AddP()) { |
never@452 | 704 | if (addr->in(AddPNode::Base) != base) { |
never@452 | 705 | // give up |
never@452 | 706 | return -1; |
never@452 | 707 | } |
never@452 | 708 | elements[count++] = addr->in(AddPNode::Offset); |
never@452 | 709 | if (count == length) { |
never@452 | 710 | // give up |
never@452 | 711 | return -1; |
never@452 | 712 | } |
never@452 | 713 | addr = addr->in(AddPNode::Address); |
never@452 | 714 | } |
never@2118 | 715 | if (addr != base) { |
never@2118 | 716 | return -1; |
never@2118 | 717 | } |
never@452 | 718 | return count; |
never@452 | 719 | } |
never@452 | 720 | |
duke@435 | 721 | //------------------------------match_edge------------------------------------- |
duke@435 | 722 | // Do we Match on this edge index or not? Do not match base pointer edge |
duke@435 | 723 | uint AddPNode::match_edge(uint idx) const { |
duke@435 | 724 | return idx > Base; |
duke@435 | 725 | } |
duke@435 | 726 | |
duke@435 | 727 | //============================================================================= |
duke@435 | 728 | //------------------------------Identity--------------------------------------- |
duke@435 | 729 | Node *OrINode::Identity( PhaseTransform *phase ) { |
duke@435 | 730 | // x | x => x |
duke@435 | 731 | if (phase->eqv(in(1), in(2))) { |
duke@435 | 732 | return in(1); |
duke@435 | 733 | } |
duke@435 | 734 | |
duke@435 | 735 | return AddNode::Identity(phase); |
duke@435 | 736 | } |
duke@435 | 737 | |
duke@435 | 738 | //------------------------------add_ring--------------------------------------- |
duke@435 | 739 | // Supplied function returns the sum of the inputs IN THE CURRENT RING. For |
duke@435 | 740 | // the logical operations the ring's ADD is really a logical OR function. |
duke@435 | 741 | // This also type-checks the inputs for sanity. Guaranteed never to |
duke@435 | 742 | // be passed a TOP or BOTTOM type, these are filtered out by pre-check. |
duke@435 | 743 | const Type *OrINode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 744 | const TypeInt *r0 = t0->is_int(); // Handy access |
duke@435 | 745 | const TypeInt *r1 = t1->is_int(); |
duke@435 | 746 | |
duke@435 | 747 | // If both args are bool, can figure out better types |
duke@435 | 748 | if ( r0 == TypeInt::BOOL ) { |
duke@435 | 749 | if ( r1 == TypeInt::ONE) { |
duke@435 | 750 | return TypeInt::ONE; |
duke@435 | 751 | } else if ( r1 == TypeInt::BOOL ) { |
duke@435 | 752 | return TypeInt::BOOL; |
duke@435 | 753 | } |
duke@435 | 754 | } else if ( r0 == TypeInt::ONE ) { |
duke@435 | 755 | if ( r1 == TypeInt::BOOL ) { |
duke@435 | 756 | return TypeInt::ONE; |
duke@435 | 757 | } |
duke@435 | 758 | } |
duke@435 | 759 | |
duke@435 | 760 | // If either input is not a constant, just return all integers. |
duke@435 | 761 | if( !r0->is_con() || !r1->is_con() ) |
duke@435 | 762 | return TypeInt::INT; // Any integer, but still no symbols. |
duke@435 | 763 | |
duke@435 | 764 | // Otherwise just OR them bits. |
duke@435 | 765 | return TypeInt::make( r0->get_con() | r1->get_con() ); |
duke@435 | 766 | } |
duke@435 | 767 | |
duke@435 | 768 | //============================================================================= |
duke@435 | 769 | //------------------------------Identity--------------------------------------- |
duke@435 | 770 | Node *OrLNode::Identity( PhaseTransform *phase ) { |
duke@435 | 771 | // x | x => x |
duke@435 | 772 | if (phase->eqv(in(1), in(2))) { |
duke@435 | 773 | return in(1); |
duke@435 | 774 | } |
duke@435 | 775 | |
duke@435 | 776 | return AddNode::Identity(phase); |
duke@435 | 777 | } |
duke@435 | 778 | |
duke@435 | 779 | //------------------------------add_ring--------------------------------------- |
duke@435 | 780 | const Type *OrLNode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 781 | const TypeLong *r0 = t0->is_long(); // Handy access |
duke@435 | 782 | const TypeLong *r1 = t1->is_long(); |
duke@435 | 783 | |
duke@435 | 784 | // If either input is not a constant, just return all integers. |
duke@435 | 785 | if( !r0->is_con() || !r1->is_con() ) |
duke@435 | 786 | return TypeLong::LONG; // Any integer, but still no symbols. |
duke@435 | 787 | |
duke@435 | 788 | // Otherwise just OR them bits. |
duke@435 | 789 | return TypeLong::make( r0->get_con() | r1->get_con() ); |
duke@435 | 790 | } |
duke@435 | 791 | |
duke@435 | 792 | //============================================================================= |
duke@435 | 793 | //------------------------------add_ring--------------------------------------- |
duke@435 | 794 | // Supplied function returns the sum of the inputs IN THE CURRENT RING. For |
duke@435 | 795 | // the logical operations the ring's ADD is really a logical OR function. |
duke@435 | 796 | // This also type-checks the inputs for sanity. Guaranteed never to |
duke@435 | 797 | // be passed a TOP or BOTTOM type, these are filtered out by pre-check. |
duke@435 | 798 | const Type *XorINode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 799 | const TypeInt *r0 = t0->is_int(); // Handy access |
duke@435 | 800 | const TypeInt *r1 = t1->is_int(); |
duke@435 | 801 | |
duke@435 | 802 | // Complementing a boolean? |
duke@435 | 803 | if( r0 == TypeInt::BOOL && ( r1 == TypeInt::ONE |
duke@435 | 804 | || r1 == TypeInt::BOOL)) |
duke@435 | 805 | return TypeInt::BOOL; |
duke@435 | 806 | |
duke@435 | 807 | if( !r0->is_con() || !r1->is_con() ) // Not constants |
duke@435 | 808 | return TypeInt::INT; // Any integer, but still no symbols. |
duke@435 | 809 | |
duke@435 | 810 | // Otherwise just XOR them bits. |
duke@435 | 811 | return TypeInt::make( r0->get_con() ^ r1->get_con() ); |
duke@435 | 812 | } |
duke@435 | 813 | |
duke@435 | 814 | //============================================================================= |
duke@435 | 815 | //------------------------------add_ring--------------------------------------- |
duke@435 | 816 | const Type *XorLNode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 817 | const TypeLong *r0 = t0->is_long(); // Handy access |
duke@435 | 818 | const TypeLong *r1 = t1->is_long(); |
duke@435 | 819 | |
duke@435 | 820 | // If either input is not a constant, just return all integers. |
duke@435 | 821 | if( !r0->is_con() || !r1->is_con() ) |
duke@435 | 822 | return TypeLong::LONG; // Any integer, but still no symbols. |
duke@435 | 823 | |
duke@435 | 824 | // Otherwise just OR them bits. |
duke@435 | 825 | return TypeLong::make( r0->get_con() ^ r1->get_con() ); |
duke@435 | 826 | } |
duke@435 | 827 | |
duke@435 | 828 | //============================================================================= |
duke@435 | 829 | //------------------------------add_ring--------------------------------------- |
duke@435 | 830 | // Supplied function returns the sum of the inputs. |
duke@435 | 831 | const Type *MaxINode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 832 | const TypeInt *r0 = t0->is_int(); // Handy access |
duke@435 | 833 | const TypeInt *r1 = t1->is_int(); |
duke@435 | 834 | |
duke@435 | 835 | // Otherwise just MAX them bits. |
duke@435 | 836 | return TypeInt::make( MAX2(r0->_lo,r1->_lo), MAX2(r0->_hi,r1->_hi), MAX2(r0->_widen,r1->_widen) ); |
duke@435 | 837 | } |
duke@435 | 838 | |
duke@435 | 839 | //============================================================================= |
duke@435 | 840 | //------------------------------Idealize--------------------------------------- |
duke@435 | 841 | // MINs show up in range-check loop limit calculations. Look for |
duke@435 | 842 | // "MIN2(x+c0,MIN2(y,x+c1))". Pick the smaller constant: "MIN2(x+c0,y)" |
duke@435 | 843 | Node *MinINode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 844 | Node *progress = NULL; |
duke@435 | 845 | // Force a right-spline graph |
duke@435 | 846 | Node *l = in(1); |
duke@435 | 847 | Node *r = in(2); |
duke@435 | 848 | // Transform MinI1( MinI2(a,b), c) into MinI1( a, MinI2(b,c) ) |
duke@435 | 849 | // to force a right-spline graph for the rest of MinINode::Ideal(). |
duke@435 | 850 | if( l->Opcode() == Op_MinI ) { |
duke@435 | 851 | assert( l != l->in(1), "dead loop in MinINode::Ideal" ); |
duke@435 | 852 | r = phase->transform(new (phase->C, 3) MinINode(l->in(2),r)); |
duke@435 | 853 | l = l->in(1); |
duke@435 | 854 | set_req(1, l); |
duke@435 | 855 | set_req(2, r); |
duke@435 | 856 | return this; |
duke@435 | 857 | } |
duke@435 | 858 | |
duke@435 | 859 | // Get left input & constant |
duke@435 | 860 | Node *x = l; |
duke@435 | 861 | int x_off = 0; |
duke@435 | 862 | if( x->Opcode() == Op_AddI && // Check for "x+c0" and collect constant |
duke@435 | 863 | x->in(2)->is_Con() ) { |
duke@435 | 864 | const Type *t = x->in(2)->bottom_type(); |
duke@435 | 865 | if( t == Type::TOP ) return NULL; // No progress |
duke@435 | 866 | x_off = t->is_int()->get_con(); |
duke@435 | 867 | x = x->in(1); |
duke@435 | 868 | } |
duke@435 | 869 | |
duke@435 | 870 | // Scan a right-spline-tree for MINs |
duke@435 | 871 | Node *y = r; |
duke@435 | 872 | int y_off = 0; |
duke@435 | 873 | // Check final part of MIN tree |
duke@435 | 874 | if( y->Opcode() == Op_AddI && // Check for "y+c1" and collect constant |
duke@435 | 875 | y->in(2)->is_Con() ) { |
duke@435 | 876 | const Type *t = y->in(2)->bottom_type(); |
duke@435 | 877 | if( t == Type::TOP ) return NULL; // No progress |
duke@435 | 878 | y_off = t->is_int()->get_con(); |
duke@435 | 879 | y = y->in(1); |
duke@435 | 880 | } |
duke@435 | 881 | if( x->_idx > y->_idx && r->Opcode() != Op_MinI ) { |
duke@435 | 882 | swap_edges(1, 2); |
duke@435 | 883 | return this; |
duke@435 | 884 | } |
duke@435 | 885 | |
duke@435 | 886 | |
duke@435 | 887 | if( r->Opcode() == Op_MinI ) { |
duke@435 | 888 | assert( r != r->in(2), "dead loop in MinINode::Ideal" ); |
duke@435 | 889 | y = r->in(1); |
duke@435 | 890 | // Check final part of MIN tree |
duke@435 | 891 | if( y->Opcode() == Op_AddI &&// Check for "y+c1" and collect constant |
duke@435 | 892 | y->in(2)->is_Con() ) { |
duke@435 | 893 | const Type *t = y->in(2)->bottom_type(); |
duke@435 | 894 | if( t == Type::TOP ) return NULL; // No progress |
duke@435 | 895 | y_off = t->is_int()->get_con(); |
duke@435 | 896 | y = y->in(1); |
duke@435 | 897 | } |
duke@435 | 898 | |
duke@435 | 899 | if( x->_idx > y->_idx ) |
duke@435 | 900 | return new (phase->C, 3) MinINode(r->in(1),phase->transform(new (phase->C, 3) MinINode(l,r->in(2)))); |
duke@435 | 901 | |
duke@435 | 902 | // See if covers: MIN2(x+c0,MIN2(y+c1,z)) |
duke@435 | 903 | if( !phase->eqv(x,y) ) return NULL; |
duke@435 | 904 | // If (y == x) transform MIN2(x+c0, MIN2(x+c1,z)) into |
duke@435 | 905 | // MIN2(x+c0 or x+c1 which less, z). |
duke@435 | 906 | return new (phase->C, 3) MinINode(phase->transform(new (phase->C, 3) AddINode(x,phase->intcon(MIN2(x_off,y_off)))),r->in(2)); |
duke@435 | 907 | } else { |
duke@435 | 908 | // See if covers: MIN2(x+c0,y+c1) |
duke@435 | 909 | if( !phase->eqv(x,y) ) return NULL; |
duke@435 | 910 | // If (y == x) transform MIN2(x+c0,x+c1) into x+c0 or x+c1 which less. |
duke@435 | 911 | return new (phase->C, 3) AddINode(x,phase->intcon(MIN2(x_off,y_off))); |
duke@435 | 912 | } |
duke@435 | 913 | |
duke@435 | 914 | } |
duke@435 | 915 | |
duke@435 | 916 | //------------------------------add_ring--------------------------------------- |
duke@435 | 917 | // Supplied function returns the sum of the inputs. |
duke@435 | 918 | const Type *MinINode::add_ring( const Type *t0, const Type *t1 ) const { |
duke@435 | 919 | const TypeInt *r0 = t0->is_int(); // Handy access |
duke@435 | 920 | const TypeInt *r1 = t1->is_int(); |
duke@435 | 921 | |
duke@435 | 922 | // Otherwise just MIN them bits. |
duke@435 | 923 | return TypeInt::make( MIN2(r0->_lo,r1->_lo), MIN2(r0->_hi,r1->_hi), MAX2(r0->_widen,r1->_widen) ); |
duke@435 | 924 | } |