1 /*
2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "memory/allocation.inline.hpp"
26 #include "opto/addnode.hpp"
27 #include "opto/connode.hpp"
28 #include "opto/convertnode.hpp"
29 #include "opto/memnode.hpp"
30 #include "opto/mulnode.hpp"
31 #include "opto/phaseX.hpp"
32 #include "opto/rangeinference.hpp"
33 #include "opto/subnode.hpp"
34 #include "utilities/powerOfTwo.hpp"
35
36 // Portions of code courtesy of Clifford Click
37
38
39 //=============================================================================
40 //------------------------------hash-------------------------------------------
41 // Hash function over MulNodes. Needs to be commutative; i.e., I swap
42 // (commute) inputs to MulNodes willy-nilly so the hash function must return
43 // the same value in the presence of edge swapping.
44 uint MulNode::hash() const {
45 return (uintptr_t)in(1) + (uintptr_t)in(2) + Opcode();
46 }
47
48 //------------------------------Identity---------------------------------------
49 // Multiplying a one preserves the other argument
50 Node* MulNode::Identity(PhaseGVN* phase) {
51 const Type *one = mul_id(); // The multiplicative identity
52 if( phase->type( in(1) )->higher_equal( one ) ) return in(2);
53 if( phase->type( in(2) )->higher_equal( one ) ) return in(1);
54
55 return this;
56 }
57
58 //------------------------------Ideal------------------------------------------
59 // We also canonicalize the Node, moving constants to the right input,
60 // and flatten expressions (so that 1+x+2 becomes x+3).
61 Node *MulNode::Ideal(PhaseGVN *phase, bool can_reshape) {
62 Node* in1 = in(1);
63 Node* in2 = in(2);
64 Node* progress = nullptr; // Progress flag
65
66 // This code is used by And nodes too, but some conversions are
67 // only valid for the actual Mul nodes.
68 uint op = Opcode();
69 bool real_mul = (op == Op_MulI) || (op == Op_MulL) ||
70 (op == Op_MulF) || (op == Op_MulD) ||
71 (op == Op_MulHF);
72
73 // Convert "(-a)*(-b)" into "a*b".
74 if (real_mul && in1->is_Sub() && in2->is_Sub()) {
75 if (phase->type(in1->in(1))->is_zero_type() &&
76 phase->type(in2->in(1))->is_zero_type()) {
77 set_req_X(1, in1->in(2), phase);
78 set_req_X(2, in2->in(2), phase);
79 in1 = in(1);
80 in2 = in(2);
81 progress = this;
82 }
83 }
84
85 // convert "max(a,b) * min(a,b)" into "a*b".
86 if ((in(1)->Opcode() == max_opcode() && in(2)->Opcode() == min_opcode())
87 || (in(1)->Opcode() == min_opcode() && in(2)->Opcode() == max_opcode())) {
88 Node *in11 = in(1)->in(1);
89 Node *in12 = in(1)->in(2);
90
91 Node *in21 = in(2)->in(1);
92 Node *in22 = in(2)->in(2);
93
94 if ((in11 == in21 && in12 == in22) ||
95 (in11 == in22 && in12 == in21)) {
96 set_req_X(1, in11, phase);
97 set_req_X(2, in12, phase);
98 in1 = in(1);
99 in2 = in(2);
100 progress = this;
101 }
102 }
103
104 const Type* t1 = phase->type(in1);
105 const Type* t2 = phase->type(in2);
106
107 // We are OK if right is a constant, or right is a load and
108 // left is a non-constant.
109 if( !(t2->singleton() ||
110 (in(2)->is_Load() && !(t1->singleton() || in(1)->is_Load())) ) ) {
111 if( t1->singleton() || // Left input is a constant?
112 // Otherwise, sort inputs (commutativity) to help value numbering.
113 (in(1)->_idx > in(2)->_idx) ) {
114 swap_edges(1, 2);
115 const Type *t = t1;
116 t1 = t2;
117 t2 = t;
118 progress = this; // Made progress
119 }
120 }
121
122 // If the right input is a constant, and the left input is a product of a
123 // constant, flatten the expression tree.
124 if( t2->singleton() && // Right input is a constant?
125 op != Op_MulF && // Float & double cannot reassociate
126 op != Op_MulD &&
127 op != Op_MulHF) {
128 if( t2 == Type::TOP ) return nullptr;
129 Node *mul1 = in(1);
130 #ifdef ASSERT
131 // Check for dead loop
132 int op1 = mul1->Opcode();
133 if ((mul1 == this) || (in(2) == this) ||
134 ((op1 == mul_opcode() || op1 == add_opcode()) &&
135 ((mul1->in(1) == this) || (mul1->in(2) == this) ||
136 (mul1->in(1) == mul1) || (mul1->in(2) == mul1)))) {
137 assert(false, "dead loop in MulNode::Ideal");
138 }
139 #endif
140
141 if( mul1->Opcode() == mul_opcode() ) { // Left input is a multiply?
142 // Mul of a constant?
143 const Type *t12 = phase->type( mul1->in(2) );
144 if( t12->singleton() && t12 != Type::TOP) { // Left input is an add of a constant?
145 // Compute new constant; check for overflow
146 const Type *tcon01 = ((MulNode*)mul1)->mul_ring(t2,t12);
147 if( tcon01->singleton() ) {
148 // The Mul of the flattened expression
149 set_req_X(1, mul1->in(1), phase);
150 set_req_X(2, phase->makecon(tcon01), phase);
151 t2 = tcon01;
152 progress = this; // Made progress
153 }
154 }
155 }
156 // If the right input is a constant, and the left input is an add of a
157 // constant, flatten the tree: (X+con1)*con0 ==> X*con0 + con1*con0
158 const Node *add1 = in(1);
159 if( add1->Opcode() == add_opcode() ) { // Left input is an add?
160 // Add of a constant?
161 const Type *t12 = phase->type( add1->in(2) );
162 if( t12->singleton() && t12 != Type::TOP ) { // Left input is an add of a constant?
163 assert( add1->in(1) != add1, "dead loop in MulNode::Ideal" );
164 // Compute new constant; check for overflow
165 const Type *tcon01 = mul_ring(t2,t12);
166 if( tcon01->singleton() ) {
167
168 // Convert (X+con1)*con0 into X*con0
169 Node *mul = clone(); // mul = ()*con0
170 mul->set_req(1,add1->in(1)); // mul = X*con0
171 mul = phase->transform(mul);
172
173 Node *add2 = add1->clone();
174 add2->set_req(1, mul); // X*con0 + con0*con1
175 add2->set_req(2, phase->makecon(tcon01) );
176 progress = add2;
177 }
178 }
179 } // End of is left input an add
180 } // End of is right input a Mul
181
182 return progress;
183 }
184
185 //------------------------------Value-----------------------------------------
186 const Type* MulNode::Value(PhaseGVN* phase) const {
187 const Type *t1 = phase->type( in(1) );
188 const Type *t2 = phase->type( in(2) );
189 // Either input is TOP ==> the result is TOP
190 if( t1 == Type::TOP ) return Type::TOP;
191 if( t2 == Type::TOP ) return Type::TOP;
192
193 // Either input is ZERO ==> the result is ZERO.
194 // Not valid for floats or doubles since +0.0 * -0.0 --> +0.0
195 int op = Opcode();
196 if( op == Op_MulI || op == Op_AndI || op == Op_MulL || op == Op_AndL ) {
197 const Type *zero = add_id(); // The multiplicative zero
198 if( t1->higher_equal( zero ) ) return zero;
199 if( t2->higher_equal( zero ) ) return zero;
200 }
201
202 // Either input is BOTTOM ==> the result is the local BOTTOM
203 if( t1 == Type::BOTTOM || t2 == Type::BOTTOM )
204 return bottom_type();
205
206 return mul_ring(t1,t2); // Local flavor of type multiplication
207 }
208
209 MulNode* MulNode::make(Node* in1, Node* in2, BasicType bt) {
210 switch (bt) {
211 case T_INT:
212 return new MulINode(in1, in2);
213 case T_LONG:
214 return new MulLNode(in1, in2);
215 default:
216 fatal("Not implemented for %s", type2name(bt));
217 }
218 return nullptr;
219 }
220
221 MulNode* MulNode::make_and(Node* in1, Node* in2, BasicType bt) {
222 switch (bt) {
223 case T_INT:
224 return new AndINode(in1, in2);
225 case T_LONG:
226 return new AndLNode(in1, in2);
227 default:
228 fatal("Not implemented for %s", type2name(bt));
229 }
230 return nullptr;
231 }
232
233
234 //=============================================================================
235 //------------------------------Ideal------------------------------------------
236 // Check for power-of-2 multiply, then try the regular MulNode::Ideal
237 Node *MulINode::Ideal(PhaseGVN *phase, bool can_reshape) {
238 const jint con = in(2)->find_int_con(0);
239 if (con == 0) {
240 // If in(2) is not a constant, call Ideal() of the parent class to
241 // try to move constant to the right side.
242 return MulNode::Ideal(phase, can_reshape);
243 }
244
245 // Now we have a constant Node on the right and the constant in con.
246 if (con == 1) {
247 // By one is handled by Identity call
248 return nullptr;
249 }
250
251 // Check for negative constant; if so negate the final result
252 bool sign_flip = false;
253
254 unsigned int abs_con = g_uabs(con);
255 if (abs_con != (unsigned int)con) {
256 sign_flip = true;
257 }
258
259 // Get low bit; check for being the only bit
260 Node *res = nullptr;
261 unsigned int bit1 = submultiple_power_of_2(abs_con);
262 if (bit1 == abs_con) { // Found a power of 2?
263 res = new LShiftINode(in(1), phase->intcon(log2i_exact(bit1)));
264 } else {
265 // Check for constant with 2 bits set
266 unsigned int bit2 = abs_con - bit1;
267 bit2 = bit2 & (0 - bit2); // Extract 2nd bit
268 if (bit2 + bit1 == abs_con) { // Found all bits in con?
269 Node *n1 = phase->transform(new LShiftINode(in(1), phase->intcon(log2i_exact(bit1))));
270 Node *n2 = phase->transform(new LShiftINode(in(1), phase->intcon(log2i_exact(bit2))));
271 res = new AddINode(n2, n1);
272 } else if (is_power_of_2(abs_con + 1)) {
273 // Sleezy: power-of-2 - 1. Next time be generic.
274 unsigned int temp = abs_con + 1;
275 Node *n1 = phase->transform(new LShiftINode(in(1), phase->intcon(log2i_exact(temp))));
276 res = new SubINode(n1, in(1));
277 } else {
278 return MulNode::Ideal(phase, can_reshape);
279 }
280 }
281
282 if (sign_flip) { // Need to negate result?
283 res = phase->transform(res);// Transform, before making the zero con
284 res = new SubINode(phase->intcon(0),res);
285 }
286
287 return res; // Return final result
288 }
289
290 // This template class performs type multiplication for MulI/MulLNode. NativeType is either jint or jlong.
291 // In this class, the inputs of the MulNodes are named left and right with types [left_lo,left_hi] and [right_lo,right_hi].
292 //
293 // In general, the multiplication of two x-bit values could produce a result that consumes up to 2x bits if there is
294 // enough space to hold them all. We can therefore distinguish the following two cases for the product:
295 // - no overflow (i.e. product fits into x bits)
296 // - overflow (i.e. product does not fit into x bits)
297 //
298 // When multiplying the two x-bit inputs 'left' and 'right' with their x-bit types [left_lo,left_hi] and [right_lo,right_hi]
299 // we need to find the minimum and maximum of all possible products to define a new type. To do that, we compute the
300 // cross product of [left_lo,left_hi] and [right_lo,right_hi] in 2x-bit space where no over- or underflow can happen.
301 // The cross product consists of the following four multiplications with 2x-bit results:
302 // (1) left_lo * right_lo
303 // (2) left_lo * right_hi
304 // (3) left_hi * right_lo
305 // (4) left_hi * right_hi
306 //
307 // Let's define the following two functions:
308 // - Lx(i): Returns the lower x bits of the 2x-bit number i.
309 // - Ux(i): Returns the upper x bits of the 2x-bit number i.
310 //
311 // Let's first assume all products are positive where only overflows are possible but no underflows. If there is no
312 // overflow for a product p, then the upper x bits of the 2x-bit result p are all zero:
313 // Ux(p) = 0
314 // Lx(p) = p
315 //
316 // If none of the multiplications (1)-(4) overflow, we can truncate the upper x bits and use the following result type
317 // with x bits:
318 // [result_lo,result_hi] = [MIN(Lx(1),Lx(2),Lx(3),Lx(4)),MAX(Lx(1),Lx(2),Lx(3),Lx(4))]
319 //
320 // If any of these multiplications overflows, we could pessimistically take the bottom type for the x bit result
321 // (i.e. all values in the x-bit space could be possible):
322 // [result_lo,result_hi] = [NativeType_min,NativeType_max]
323 //
324 // However, in case of any overflow, we can do better by analyzing the upper x bits of all multiplications (1)-(4) with
325 // 2x-bit results. The upper x bits tell us something about how many times a multiplication has overflown the lower
326 // x bits. If the upper x bits of (1)-(4) are all equal, then we know that all of these multiplications overflowed
327 // the lower x bits the same number of times:
328 // Ux((1)) = Ux((2)) = Ux((3)) = Ux((4))
329 //
330 // If all upper x bits are equal, we can conclude:
331 // Lx(MIN((1),(2),(3),(4))) = MIN(Lx(1),Lx(2),Lx(3),Lx(4)))
332 // Lx(MAX((1),(2),(3),(4))) = MAX(Lx(1),Lx(2),Lx(3),Lx(4)))
333 //
334 // Therefore, we can use the same precise x-bit result type as for the no-overflow case:
335 // [result_lo,result_hi] = [(MIN(Lx(1),Lx(2),Lx(3),Lx(4))),MAX(Lx(1),Lx(2),Lx(3),Lx(4)))]
336 //
337 //
338 // Now let's assume that (1)-(4) are signed multiplications where over- and underflow could occur:
339 // Negative numbers are all sign extend with ones. Therefore, if a negative product does not underflow, then the
340 // upper x bits of the 2x-bit result are all set to ones which is minus one in two's complement. If there is an underflow,
341 // the upper x bits are decremented by the number of times an underflow occurred. The smallest possible negative product
342 // is NativeType_min*NativeType_max, where the upper x bits are set to NativeType_min / 2 (b11...0). It is therefore
343 // impossible to underflow the upper x bits. Thus, when having all ones (i.e. minus one) in the upper x bits, we know
344 // that there is no underflow.
345 //
346 // To be able to compare the number of over-/underflows of positive and negative products, respectively, we normalize
347 // the upper x bits of negative 2x-bit products by adding one. This way a product has no over- or underflow if the
348 // normalized upper x bits are zero. Now we can use the same improved type as for strictly positive products because we
349 // can compare the upper x bits in a unified way with N() being the normalization function:
350 // N(Ux((1))) = N(Ux((2))) = N(Ux((3)) = N(Ux((4)))
351 template<typename NativeType>
352 class IntegerTypeMultiplication {
353
354 NativeType _lo_left;
355 NativeType _lo_right;
356 NativeType _hi_left;
357 NativeType _hi_right;
358 short _widen_left;
359 short _widen_right;
360
361 static const Type* overflow_type();
362 static NativeType multiply_high(NativeType x, NativeType y);
363 const Type* create_type(NativeType lo, NativeType hi) const;
364
365 static NativeType multiply_high_signed_overflow_value(NativeType x, NativeType y) {
366 return normalize_overflow_value(x, y, multiply_high(x, y));
367 }
368
369 bool cross_product_not_same_overflow_value() const {
370 const NativeType lo_lo_high_product = multiply_high_signed_overflow_value(_lo_left, _lo_right);
371 const NativeType lo_hi_high_product = multiply_high_signed_overflow_value(_lo_left, _hi_right);
372 const NativeType hi_lo_high_product = multiply_high_signed_overflow_value(_hi_left, _lo_right);
373 const NativeType hi_hi_high_product = multiply_high_signed_overflow_value(_hi_left, _hi_right);
374 return lo_lo_high_product != lo_hi_high_product ||
375 lo_hi_high_product != hi_lo_high_product ||
376 hi_lo_high_product != hi_hi_high_product;
377 }
378
379 bool does_product_overflow(NativeType x, NativeType y) const {
380 return multiply_high_signed_overflow_value(x, y) != 0;
381 }
382
383 static NativeType normalize_overflow_value(const NativeType x, const NativeType y, NativeType result) {
384 return java_multiply(x, y) < 0 ? result + 1 : result;
385 }
386
387 public:
388 template<class IntegerType>
389 IntegerTypeMultiplication(const IntegerType* left, const IntegerType* right)
390 : _lo_left(left->_lo), _lo_right(right->_lo),
391 _hi_left(left->_hi), _hi_right(right->_hi),
392 _widen_left(left->_widen), _widen_right(right->_widen) {}
393
394 // Compute the product type by multiplying the two input type ranges. We take the minimum and maximum of all possible
395 // values (requires 4 multiplications of all possible combinations of the two range boundary values). If any of these
396 // multiplications overflows/underflows, we need to make sure that they all have the same number of overflows/underflows
397 // If that is not the case, we return the bottom type to cover all values due to the inconsistent overflows/underflows).
398 const Type* compute() const {
399 if (cross_product_not_same_overflow_value()) {
400 return overflow_type();
401 }
402
403 NativeType lo_lo_product = java_multiply(_lo_left, _lo_right);
404 NativeType lo_hi_product = java_multiply(_lo_left, _hi_right);
405 NativeType hi_lo_product = java_multiply(_hi_left, _lo_right);
406 NativeType hi_hi_product = java_multiply(_hi_left, _hi_right);
407 const NativeType min = MIN4(lo_lo_product, lo_hi_product, hi_lo_product, hi_hi_product);
408 const NativeType max = MAX4(lo_lo_product, lo_hi_product, hi_lo_product, hi_hi_product);
409 return create_type(min, max);
410 }
411
412 bool does_overflow() const {
413 return does_product_overflow(_lo_left, _lo_right) ||
414 does_product_overflow(_lo_left, _hi_right) ||
415 does_product_overflow(_hi_left, _lo_right) ||
416 does_product_overflow(_hi_left, _hi_right);
417 }
418 };
419
420 template <>
421 const Type* IntegerTypeMultiplication<jint>::overflow_type() {
422 return TypeInt::INT;
423 }
424
425 template <>
426 jint IntegerTypeMultiplication<jint>::multiply_high(const jint x, const jint y) {
427 const jlong x_64 = x;
428 const jlong y_64 = y;
429 const jlong product = x_64 * y_64;
430 return (jint)((uint64_t)product >> 32u);
431 }
432
433 template <>
434 const Type* IntegerTypeMultiplication<jint>::create_type(jint lo, jint hi) const {
435 return TypeInt::make(lo, hi, MAX2(_widen_left, _widen_right));
436 }
437
438 template <>
439 const Type* IntegerTypeMultiplication<jlong>::overflow_type() {
440 return TypeLong::LONG;
441 }
442
443 template <>
444 jlong IntegerTypeMultiplication<jlong>::multiply_high(const jlong x, const jlong y) {
445 return multiply_high_signed(x, y);
446 }
447
448 template <>
449 const Type* IntegerTypeMultiplication<jlong>::create_type(jlong lo, jlong hi) const {
450 return TypeLong::make(lo, hi, MAX2(_widen_left, _widen_right));
451 }
452
453 // Compute the product type of two integer ranges into this node.
454 const Type* MulINode::mul_ring(const Type* type_left, const Type* type_right) const {
455 const IntegerTypeMultiplication<jint> integer_multiplication(type_left->is_int(), type_right->is_int());
456 return integer_multiplication.compute();
457 }
458
459 bool MulINode::does_overflow(const TypeInt* type_left, const TypeInt* type_right) {
460 const IntegerTypeMultiplication<jint> integer_multiplication(type_left, type_right);
461 return integer_multiplication.does_overflow();
462 }
463
464 // Compute the product type of two long ranges into this node.
465 const Type* MulLNode::mul_ring(const Type* type_left, const Type* type_right) const {
466 const IntegerTypeMultiplication<jlong> integer_multiplication(type_left->is_long(), type_right->is_long());
467 return integer_multiplication.compute();
468 }
469
470 //=============================================================================
471 //------------------------------Ideal------------------------------------------
472 // Check for power-of-2 multiply, then try the regular MulNode::Ideal
473 Node *MulLNode::Ideal(PhaseGVN *phase, bool can_reshape) {
474 const jlong con = in(2)->find_long_con(0);
475 if (con == 0) {
476 // If in(2) is not a constant, call Ideal() of the parent class to
477 // try to move constant to the right side.
478 return MulNode::Ideal(phase, can_reshape);
479 }
480
481 // Now we have a constant Node on the right and the constant in con.
482 if (con == 1) {
483 // By one is handled by Identity call
484 return nullptr;
485 }
486
487 // Check for negative constant; if so negate the final result
488 bool sign_flip = false;
489 julong abs_con = g_uabs(con);
490 if (abs_con != (julong)con) {
491 sign_flip = true;
492 }
493
494 // Get low bit; check for being the only bit
495 Node *res = nullptr;
496 julong bit1 = submultiple_power_of_2(abs_con);
497 if (bit1 == abs_con) { // Found a power of 2?
498 res = new LShiftLNode(in(1), phase->intcon(log2i_exact(bit1)));
499 } else {
500
501 // Check for constant with 2 bits set
502 julong bit2 = abs_con-bit1;
503 bit2 = bit2 & (0-bit2); // Extract 2nd bit
504 if (bit2 + bit1 == abs_con) { // Found all bits in con?
505 Node *n1 = phase->transform(new LShiftLNode(in(1), phase->intcon(log2i_exact(bit1))));
506 Node *n2 = phase->transform(new LShiftLNode(in(1), phase->intcon(log2i_exact(bit2))));
507 res = new AddLNode(n2, n1);
508
509 } else if (is_power_of_2(abs_con+1)) {
510 // Sleezy: power-of-2 -1. Next time be generic.
511 julong temp = abs_con + 1;
512 Node *n1 = phase->transform( new LShiftLNode(in(1), phase->intcon(log2i_exact(temp))));
513 res = new SubLNode(n1, in(1));
514 } else {
515 return MulNode::Ideal(phase, can_reshape);
516 }
517 }
518
519 if (sign_flip) { // Need to negate result?
520 res = phase->transform(res);// Transform, before making the zero con
521 res = new SubLNode(phase->longcon(0),res);
522 }
523
524 return res; // Return final result
525 }
526
527 //=============================================================================
528 //------------------------------mul_ring---------------------------------------
529 // Compute the product type of two double ranges into this node.
530 const Type *MulFNode::mul_ring(const Type *t0, const Type *t1) const {
531 if( t0 == Type::FLOAT || t1 == Type::FLOAT ) return Type::FLOAT;
532 return TypeF::make( t0->getf() * t1->getf() );
533 }
534
535 //------------------------------Ideal---------------------------------------
536 // Check to see if we are multiplying by a constant 2 and convert to add, then try the regular MulNode::Ideal
537 Node* MulFNode::Ideal(PhaseGVN* phase, bool can_reshape) {
538 const TypeF *t2 = phase->type(in(2))->isa_float_constant();
539
540 // x * 2 -> x + x
541 if (t2 != nullptr && t2->getf() == 2) {
542 Node* base = in(1);
543 return new AddFNode(base, base);
544 }
545 return MulNode::Ideal(phase, can_reshape);
546 }
547
548 //=============================================================================
549 //------------------------------Ideal------------------------------------------
550 // Check to see if we are multiplying by a constant 2 and convert to add, then try the regular MulNode::Ideal
551 Node* MulHFNode::Ideal(PhaseGVN* phase, bool can_reshape) {
552 const TypeH* t2 = phase->type(in(2))->isa_half_float_constant();
553
554 // x * 2 -> x + x
555 if (t2 != nullptr && t2->getf() == 2) {
556 Node* base = in(1);
557 return new AddHFNode(base, base);
558 }
559 return MulNode::Ideal(phase, can_reshape);
560 }
561
562 // Compute the product type of two half float ranges into this node.
563 const Type* MulHFNode::mul_ring(const Type* t0, const Type* t1) const {
564 if (t0 == Type::HALF_FLOAT || t1 == Type::HALF_FLOAT) {
565 return Type::HALF_FLOAT;
566 }
567 return TypeH::make(t0->getf() * t1->getf());
568 }
569
570 //=============================================================================
571 //------------------------------mul_ring---------------------------------------
572 // Compute the product type of two double ranges into this node.
573 const Type *MulDNode::mul_ring(const Type *t0, const Type *t1) const {
574 if( t0 == Type::DOUBLE || t1 == Type::DOUBLE ) return Type::DOUBLE;
575 // We must be multiplying 2 double constants.
576 return TypeD::make( t0->getd() * t1->getd() );
577 }
578
579 //------------------------------Ideal---------------------------------------
580 // Check to see if we are multiplying by a constant 2 and convert to add, then try the regular MulNode::Ideal
581 Node* MulDNode::Ideal(PhaseGVN* phase, bool can_reshape) {
582 const TypeD *t2 = phase->type(in(2))->isa_double_constant();
583
584 // x * 2 -> x + x
585 if (t2 != nullptr && t2->getd() == 2) {
586 Node* base = in(1);
587 return new AddDNode(base, base);
588 }
589
590 return MulNode::Ideal(phase, can_reshape);
591 }
592
593 //=============================================================================
594 //------------------------------Value------------------------------------------
595 const Type* MulHiLNode::Value(PhaseGVN* phase) const {
596 const Type *t1 = phase->type( in(1) );
597 const Type *t2 = phase->type( in(2) );
598 const Type *bot = bottom_type();
599 return MulHiValue(t1, t2, bot);
600 }
601
602 const Type* UMulHiLNode::Value(PhaseGVN* phase) const {
603 const Type *t1 = phase->type( in(1) );
604 const Type *t2 = phase->type( in(2) );
605 const Type *bot = bottom_type();
606 return MulHiValue(t1, t2, bot);
607 }
608
609 // A common routine used by UMulHiLNode and MulHiLNode
610 const Type* MulHiValue(const Type *t1, const Type *t2, const Type *bot) {
611 // Either input is TOP ==> the result is TOP
612 if( t1 == Type::TOP ) return Type::TOP;
613 if( t2 == Type::TOP ) return Type::TOP;
614
615 // Either input is BOTTOM ==> the result is the local BOTTOM
616 if( (t1 == bot) || (t2 == bot) ||
617 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) )
618 return bot;
619
620 // It is not worth trying to constant fold this stuff!
621 return TypeLong::LONG;
622 }
623
624 //=============================================================================
625 //------------------------------mul_ring---------------------------------------
626 // Supplied function returns the product of the inputs IN THE CURRENT RING.
627 // For the logical operations the ring's MUL is really a logical AND function.
628 // This also type-checks the inputs for sanity. Guaranteed never to
629 // be passed a TOP or BOTTOM type, these are filtered out by pre-check.
630 const Type* AndINode::mul_ring(const Type* t1, const Type* t2) const {
631 return RangeInference::infer_and(t1->is_int(), t2->is_int());
632 }
633
634 static bool AndIL_is_zero_element_under_mask(const PhaseGVN* phase, const Node* expr, const Node* mask, BasicType bt);
635
636 const Type* AndINode::Value(PhaseGVN* phase) const {
637 if (AndIL_is_zero_element_under_mask(phase, in(1), in(2), T_INT) ||
638 AndIL_is_zero_element_under_mask(phase, in(2), in(1), T_INT)) {
639 return TypeInt::ZERO;
640 }
641
642 return MulNode::Value(phase);
643 }
644
645 //------------------------------Identity---------------------------------------
646 // Masking off the high bits of an unsigned load is not required
647 Node* AndINode::Identity(PhaseGVN* phase) {
648
649 // x & x => x
650 if (in(1) == in(2)) {
651 return in(1);
652 }
653
654 Node* in1 = in(1);
655 uint op = in1->Opcode();
656 const TypeInt* t2 = phase->type(in(2))->isa_int();
657 if (t2 && t2->is_con()) {
658 int con = t2->get_con();
659 // Masking off high bits which are always zero is useless.
660 const TypeInt* t1 = phase->type(in(1))->isa_int();
661 if (t1 != nullptr && t1->_lo >= 0) {
662 jint t1_support = right_n_bits(1 + log2i_graceful(t1->_hi));
663 if ((t1_support & con) == t1_support)
664 return in1;
665 }
666 // Masking off the high bits of a unsigned-shift-right is not
667 // needed either.
668 if (op == Op_URShiftI) {
669 const TypeInt* t12 = phase->type(in1->in(2))->isa_int();
670 if (t12 && t12->is_con()) { // Shift is by a constant
671 int shift = t12->get_con();
672 shift &= BitsPerJavaInteger - 1; // semantics of Java shifts
673 int mask = max_juint >> shift;
674 if ((mask & con) == mask) // If AND is useless, skip it
675 return in1;
676 }
677 }
678 }
679 return MulNode::Identity(phase);
680 }
681
682 //------------------------------Ideal------------------------------------------
683 Node *AndINode::Ideal(PhaseGVN *phase, bool can_reshape) {
684 // Simplify (v1 + v2) & mask to v1 & mask or v2 & mask when possible.
685 Node* progress = AndIL_sum_and_mask(phase, T_INT);
686 if (progress != nullptr) {
687 return progress;
688 }
689
690 // Convert "(~a) & (~b)" into "~(a | b)"
691 if (AddNode::is_not(phase, in(1), T_INT) && AddNode::is_not(phase, in(2), T_INT)) {
692 Node* or_a_b = new OrINode(in(1)->in(1), in(2)->in(1));
693 Node* tn = phase->transform(or_a_b);
694 return AddNode::make_not(phase, tn, T_INT);
695 }
696
697 // Special case constant AND mask
698 const TypeInt *t2 = phase->type( in(2) )->isa_int();
699 if( !t2 || !t2->is_con() ) return MulNode::Ideal(phase, can_reshape);
700 const int mask = t2->get_con();
701 Node *load = in(1);
702 uint lop = load->Opcode();
703
704 // Masking bits off of a Character? Hi bits are already zero.
705 if( lop == Op_LoadUS &&
706 (mask & 0xFFFF0000) ) // Can we make a smaller mask?
707 return new AndINode(load,phase->intcon(mask&0xFFFF));
708
709 // Masking bits off of a Short? Loading a Character does some masking
710 if (can_reshape &&
711 load->outcnt() == 1 && load->unique_out() == this) {
712 if (lop == Op_LoadS && (mask & 0xFFFF0000) == 0 ) {
713 Node* ldus = load->as_Load()->convert_to_unsigned_load(*phase);
714 ldus = phase->transform(ldus);
715 return new AndINode(ldus, phase->intcon(mask & 0xFFFF));
716 }
717
718 // Masking sign bits off of a Byte? Do an unsigned byte load plus
719 // an and.
720 if (lop == Op_LoadB && (mask & 0xFFFFFF00) == 0) {
721 Node* ldub = load->as_Load()->convert_to_unsigned_load(*phase);
722 ldub = phase->transform(ldub);
723 return new AndINode(ldub, phase->intcon(mask));
724 }
725 }
726
727 // Masking off sign bits? Dont make them!
728 if( lop == Op_RShiftI ) {
729 const TypeInt *t12 = phase->type(load->in(2))->isa_int();
730 if( t12 && t12->is_con() ) { // Shift is by a constant
731 int shift = t12->get_con();
732 shift &= BitsPerJavaInteger-1; // semantics of Java shifts
733 const int sign_bits_mask = ~right_n_bits(BitsPerJavaInteger - shift);
734 // If the AND'ing of the 2 masks has no bits, then only original shifted
735 // bits survive. NO sign-extension bits survive the maskings.
736 if( (sign_bits_mask & mask) == 0 ) {
737 // Use zero-fill shift instead
738 Node *zshift = phase->transform(new URShiftINode(load->in(1),load->in(2)));
739 return new AndINode( zshift, in(2) );
740 }
741 }
742 }
743
744 // Check for 'negate/and-1', a pattern emitted when someone asks for
745 // 'mod 2'. Negate leaves the low order bit unchanged (think: complement
746 // plus 1) and the mask is of the low order bit. Skip the negate.
747 if( lop == Op_SubI && mask == 1 && load->in(1) &&
748 phase->type(load->in(1)) == TypeInt::ZERO )
749 return new AndINode( load->in(2), in(2) );
750
751 return MulNode::Ideal(phase, can_reshape);
752 }
753
754 //=============================================================================
755 //------------------------------mul_ring---------------------------------------
756 // Supplied function returns the product of the inputs IN THE CURRENT RING.
757 // For the logical operations the ring's MUL is really a logical AND function.
758 // This also type-checks the inputs for sanity. Guaranteed never to
759 // be passed a TOP or BOTTOM type, these are filtered out by pre-check.
760 const Type* AndLNode::mul_ring(const Type* t1, const Type* t2) const {
761 return RangeInference::infer_and(t1->is_long(), t2->is_long());
762 }
763
764 const Type* AndLNode::Value(PhaseGVN* phase) const {
765 if (AndIL_is_zero_element_under_mask(phase, in(1), in(2), T_LONG) ||
766 AndIL_is_zero_element_under_mask(phase, in(2), in(1), T_LONG)) {
767 return TypeLong::ZERO;
768 }
769
770 return MulNode::Value(phase);
771 }
772
773 //------------------------------Identity---------------------------------------
774 // Masking off the high bits of an unsigned load is not required
775 Node* AndLNode::Identity(PhaseGVN* phase) {
776
777 // x & x => x
778 if (in(1) == in(2)) {
779 return in(1);
780 }
781
782 Node *usr = in(1);
783 const TypeLong *t2 = phase->type( in(2) )->isa_long();
784 if( t2 && t2->is_con() ) {
785 jlong con = t2->get_con();
786 // Masking off high bits which are always zero is useless.
787 const TypeLong* t1 = phase->type( in(1) )->isa_long();
788 if (t1 != nullptr && t1->_lo >= 0) {
789 int bit_count = log2i_graceful(t1->_hi) + 1;
790 jlong t1_support = jlong(max_julong >> (BitsPerJavaLong - bit_count));
791 if ((t1_support & con) == t1_support)
792 return usr;
793 }
794 uint lop = usr->Opcode();
795 // Masking off the high bits of a unsigned-shift-right is not
796 // needed either.
797 if( lop == Op_URShiftL ) {
798 const TypeInt *t12 = phase->type( usr->in(2) )->isa_int();
799 if( t12 && t12->is_con() ) { // Shift is by a constant
800 int shift = t12->get_con();
801 shift &= BitsPerJavaLong - 1; // semantics of Java shifts
802 jlong mask = max_julong >> shift;
803 if( (mask&con) == mask ) // If AND is useless, skip it
804 return usr;
805 }
806 }
807 }
808 return MulNode::Identity(phase);
809 }
810
811 //------------------------------Ideal------------------------------------------
812 Node *AndLNode::Ideal(PhaseGVN *phase, bool can_reshape) {
813 // Simplify (v1 + v2) & mask to v1 & mask or v2 & mask when possible.
814 Node* progress = AndIL_sum_and_mask(phase, T_LONG);
815 if (progress != nullptr) {
816 return progress;
817 }
818
819 // Convert "(~a) & (~b)" into "~(a | b)"
820 if (AddNode::is_not(phase, in(1), T_LONG) && AddNode::is_not(phase, in(2), T_LONG)) {
821 Node* or_a_b = new OrLNode(in(1)->in(1), in(2)->in(1));
822 Node* tn = phase->transform(or_a_b);
823 return AddNode::make_not(phase, tn, T_LONG);
824 }
825
826 // Special case constant AND mask
827 const TypeLong *t2 = phase->type( in(2) )->isa_long();
828 if( !t2 || !t2->is_con() ) return MulNode::Ideal(phase, can_reshape);
829 const jlong mask = t2->get_con();
830
831 Node* in1 = in(1);
832 int op = in1->Opcode();
833
834 // Are we masking a long that was converted from an int with a mask
835 // that fits in 32-bits? Commute them and use an AndINode. Don't
836 // convert masks which would cause a sign extension of the integer
837 // value. This check includes UI2L masks (0x00000000FFFFFFFF) which
838 // would be optimized away later in Identity.
839 if (op == Op_ConvI2L && (mask & UCONST64(0xFFFFFFFF80000000)) == 0) {
840 Node* andi = new AndINode(in1->in(1), phase->intcon(mask));
841 andi = phase->transform(andi);
842 return new ConvI2LNode(andi);
843 }
844
845 // Masking off sign bits? Dont make them!
846 if (op == Op_RShiftL) {
847 const TypeInt* t12 = phase->type(in1->in(2))->isa_int();
848 if( t12 && t12->is_con() ) { // Shift is by a constant
849 int shift = t12->get_con();
850 shift &= BitsPerJavaLong - 1; // semantics of Java shifts
851 if (shift != 0) {
852 const julong sign_bits_mask = ~(((julong)CONST64(1) << (julong)(BitsPerJavaLong - shift)) -1);
853 // If the AND'ing of the 2 masks has no bits, then only original shifted
854 // bits survive. NO sign-extension bits survive the maskings.
855 if( (sign_bits_mask & mask) == 0 ) {
856 // Use zero-fill shift instead
857 Node *zshift = phase->transform(new URShiftLNode(in1->in(1), in1->in(2)));
858 return new AndLNode(zshift, in(2));
859 }
860 }
861 }
862 }
863
864 return MulNode::Ideal(phase, can_reshape);
865 }
866
867 LShiftNode* LShiftNode::make(Node* in1, Node* in2, BasicType bt) {
868 switch (bt) {
869 case T_INT:
870 return new LShiftINode(in1, in2);
871 case T_LONG:
872 return new LShiftLNode(in1, in2);
873 default:
874 fatal("Not implemented for %s", type2name(bt));
875 }
876 return nullptr;
877 }
878
879 // Returns whether the shift amount is constant. If so, sets count.
880 static bool const_shift_count(PhaseGVN* phase, const Node* shift_node, int* count) {
881 const TypeInt* tcount = phase->type(shift_node->in(2))->isa_int();
882 if (tcount != nullptr && tcount->is_con()) {
883 *count = tcount->get_con();
884 return true;
885 }
886 return false;
887 }
888
889 // Returns whether the shift amount is constant. If so, sets real_shift and masked_shift.
890 static bool mask_shift_amount(PhaseGVN* phase, const Node* shift_node, uint nBits, int& real_shift, uint& masked_shift) {
891 if (const_shift_count(phase, shift_node, &real_shift)) {
892 masked_shift = real_shift & (nBits - 1);
893 return true;
894 }
895 return false;
896 }
897
898 // Convenience for when we don't care about the real amount
899 static bool mask_shift_amount(PhaseGVN* phase, const Node* shift_node, uint nBits, uint& masked_shift) {
900 int real_shift;
901 return mask_shift_amount(phase, shift_node, nBits, real_shift, masked_shift);
902 }
903
904 // Use this in ::Ideal only with shiftNode == this!
905 // Sets masked_shift to the masked shift amount if constant or 0 if not constant.
906 // Returns shift_node if the shift amount input node was modified, nullptr otherwise.
907 static Node* mask_and_replace_shift_amount(PhaseGVN* phase, Node* shift_node, uint nBits, uint& masked_shift) {
908 int real_shift;
909 if (mask_shift_amount(phase, shift_node, nBits, real_shift, masked_shift)) {
910 if (masked_shift == 0) {
911 // Let Identity() handle 0 shift count.
912 return nullptr;
913 }
914
915 if (real_shift != (int)masked_shift) {
916 shift_node->set_req(2, phase->intcon(masked_shift)); // Replace shift count with masked value.
917
918 // We need to notify the caller that the graph was reshaped, as Ideal needs
919 // to return the root of the reshaped graph if any change was made.
920 return shift_node;
921 }
922 } else {
923 // Not a shift by a constant.
924 masked_shift = 0;
925 }
926 return nullptr;
927 }
928
929 // Called with
930 // outer_shift = (_ << rhs_outer)
931 // We are looking for the pattern:
932 // outer_shift = ((X << rhs_inner) << rhs_outer)
933 // where rhs_outer and rhs_inner are constant
934 // we denote inner_shift the nested expression (X << rhs_inner)
935 // con_inner = rhs_inner % nbits and con_outer = rhs_outer % nbits
936 // where nbits is the number of bits of the shifts
937 //
938 // There are 2 cases:
939 // if con_outer + con_inner >= nbits => 0
940 // if con_outer + con_inner < nbits => X << (con_outer + con_inner)
941 static Node* collapse_nested_shift_left(PhaseGVN* phase, const Node* outer_shift, uint con_outer, BasicType bt) {
942 assert(bt == T_LONG || bt == T_INT, "Unexpected type");
943 const Node* inner_shift = outer_shift->in(1);
944 if (inner_shift->Opcode() != Op_LShift(bt)) {
945 return nullptr;
946 }
947
948 uint nbits = bits_per_java_integer(bt);
949 uint con_inner;
950 if (!mask_shift_amount(phase, inner_shift, nbits, con_inner)) {
951 return nullptr;
952 }
953
954 if (con_inner == 0) {
955 // We let the Identity() of the inner shift do its job.
956 return nullptr;
957 }
958
959 if (con_outer + con_inner >= nbits) {
960 // While it might be tempting to use
961 // phase->zerocon(bt);
962 // it would be incorrect: zerocon caches nodes, while Ideal is only allowed
963 // to return a new node, this or nullptr, but not an old (cached) node.
964 return ConNode::make(TypeInteger::zero(bt));
965 }
966
967 // con0 + con1 < nbits ==> actual shift happens now
968 Node* con0_plus_con1 = phase->intcon(con_outer + con_inner);
969 return LShiftNode::make(inner_shift->in(1), con0_plus_con1, bt);
970 }
971
972 //------------------------------Identity---------------------------------------
973 Node* LShiftINode::Identity(PhaseGVN* phase) {
974 return IdentityIL(phase, T_INT);
975 }
976
977 Node* LShiftNode::IdealIL(PhaseGVN* phase, bool can_reshape, BasicType bt) {
978 uint con;
979 Node* progress = mask_and_replace_shift_amount(phase, this, bits_per_java_integer(bt), con);
980 if (con == 0) {
981 return nullptr;
982 }
983
984 // If the right input is a constant, and the left input is an add of a
985 // constant, flatten the tree: (X+con1)<<con0 ==> X<<con0 + con1<<con0
986 Node* add1 = in(1);
987 int add1_op = add1->Opcode();
988 if (add1_op == Op_Add(bt)) { // Left input is an add?
989 assert(add1 != add1->in(1), "dead loop in LShiftINode::Ideal");
990
991 // Transform is legal, but check for profit. Avoid breaking 'i2s'
992 // and 'i2b' patterns which typically fold into 'StoreC/StoreB'.
993 if (bt != T_INT || con < 16) {
994 // Left input is an add of the same number?
995 if (con != (bits_per_java_integer(bt) - 1) && add1->in(1) == add1->in(2)) {
996 // Convert "(x + x) << c0" into "x << (c0 + 1)"
997 // In general, this optimization cannot be applied for c0 == 31 (for LShiftI) since
998 // 2x << 31 != x << 32 = x << 0 = x (e.g. x = 1: 2 << 31 = 0 != 1)
999 // or c0 != 63 (for LShiftL) because:
1000 // (x + x) << 63 = 2x << 63, while
1001 // (x + x) << 63 --transform--> x << 64 = x << 0 = x (!= 2x << 63, for example for x = 1)
1002 // According to the Java spec, chapter 15.19, we only consider the six lowest-order bits of the right-hand operand
1003 // (i.e. "right-hand operand" & 0b111111). Therefore, x << 64 is the same as x << 0 (64 = 0b10000000 & 0b0111111 = 0).
1004 return LShiftNode::make(add1->in(1), phase->intcon(con + 1), bt);
1005 }
1006
1007 // Left input is an add of a constant?
1008 const TypeInteger* t12 = phase->type(add1->in(2))->isa_integer(bt);
1009 if (t12 != nullptr && t12->is_con()) { // Left input is an add of a con?
1010 // Compute X << con0
1011 Node* lsh = phase->transform(LShiftNode::make(add1->in(1), in(2), bt));
1012 // Compute X<<con0 + (con1<<con0)
1013 return AddNode::make(lsh, phase->integercon(java_shift_left(t12->get_con_as_long(bt), con, bt), bt), bt);
1014 }
1015 }
1016 }
1017 // Check for "(con0 - X) << con1"
1018 // Transform is legal, but check for profit. Avoid breaking 'i2s'
1019 // and 'i2b' patterns which typically fold into 'StoreC/StoreB'.
1020 if (add1_op == Op_Sub(bt) && (bt != T_INT || con < 16)) { // Left input is a sub?
1021 // Left input is a sub from a constant?
1022 const TypeInteger* t11 = phase->type(add1->in(1))->isa_integer(bt);
1023 if (t11 != nullptr && t11->is_con()) {
1024 // Compute X << con0
1025 Node* lsh = phase->transform(LShiftNode::make(add1->in(2), in(2), bt));
1026 // Compute (con1<<con0) - (X<<con0)
1027 return SubNode::make(phase->integercon(java_shift_left(t11->get_con_as_long(bt), con, bt), bt), lsh, bt);
1028 }
1029 }
1030
1031 // Check for "(x >> C1) << C2"
1032 if (add1_op == Op_RShift(bt) || add1_op == Op_URShift(bt)) {
1033 int add1Con = 0;
1034 const_shift_count(phase, add1, &add1Con);
1035
1036 // Special case C1 == C2, which just masks off low bits
1037 if (add1Con > 0 && con == (uint)add1Con) {
1038 // Convert to "(x & -(1 << C2))"
1039 return MulNode::make_and(add1->in(1), phase->integercon(java_negate(java_shift_left(1, con, bt), bt), bt), bt);
1040 } else {
1041 // Wait until the right shift has been sharpened to the correct count
1042 if (add1Con > 0 && (uint)add1Con < bits_per_java_integer(bt)) {
1043 // As loop parsing can produce LShiftI nodes, we should wait until the graph is fully formed
1044 // to apply optimizations, otherwise we can inadvertently stop vectorization opportunities.
1045 if (phase->is_IterGVN()) {
1046 if (con > (uint)add1Con) {
1047 // Creates "(x << (C2 - C1)) & -(1 << C2)"
1048 Node* lshift = phase->transform(LShiftNode::make(add1->in(1), phase->intcon(con - add1Con), bt));
1049 return MulNode::make_and(lshift, phase->integercon(java_negate(java_shift_left(1, con, bt), bt), bt), bt);
1050 } else {
1051 assert(con < (uint)add1Con, "must be (%d < %d)", con, add1Con);
1052 // Creates "(x >> (C1 - C2)) & -(1 << C2)"
1053
1054 // Handle logical and arithmetic shifts
1055 Node* rshift;
1056 if (add1_op == Op_RShift(bt)) {
1057 rshift = phase->transform(RShiftNode::make(add1->in(1), phase->intcon(add1Con - con), bt));
1058 } else {
1059 rshift = phase->transform(URShiftNode::make(add1->in(1), phase->intcon(add1Con - con), bt));
1060 }
1061
1062 return MulNode::make_and(rshift, phase->integercon(java_negate(java_shift_left(1, con, bt)), bt), bt);
1063 }
1064 } else {
1065 phase->record_for_igvn(this);
1066 }
1067 }
1068 }
1069 }
1070
1071 // Check for "((x >> C1) & Y) << C2"
1072 if (add1_op == Op_And(bt)) {
1073 Node* add2 = add1->in(1);
1074 int add2_op = add2->Opcode();
1075 if (add2_op == Op_RShift(bt) || add2_op == Op_URShift(bt)) {
1076 // Special case C1 == C2, which just masks off low bits
1077 if (add2->in(2) == in(2)) {
1078 // Convert to "(x & (Y << C2))"
1079 Node* y_sh = phase->transform(LShiftNode::make(add1->in(2), phase->intcon(con), bt));
1080 return MulNode::make_and(add2->in(1), y_sh, bt);
1081 }
1082
1083 int add2Con = 0;
1084 const_shift_count(phase, add2, &add2Con);
1085 if (add2Con > 0 && (uint)add2Con < bits_per_java_integer(bt)) {
1086 if (phase->is_IterGVN()) {
1087 // Convert to "((x >> C1) << C2) & (Y << C2)"
1088
1089 // Make "(x >> C1) << C2", which will get folded away by the rule above
1090 Node* x_sh = phase->transform(LShiftNode::make(add2, phase->intcon(con), bt));
1091 // Make "Y << C2", which will simplify when Y is a constant
1092 Node* y_sh = phase->transform(LShiftNode::make(add1->in(2), phase->intcon(con), bt));
1093
1094 return MulNode::make_and(x_sh, y_sh, bt);
1095 } else {
1096 phase->record_for_igvn(this);
1097 }
1098 }
1099 }
1100 }
1101
1102 // Check for ((x & ((1<<(32-c0))-1)) << c0) which ANDs off high bits
1103 // before shifting them away.
1104 const jlong bits_mask = max_unsigned_integer(bt) >> con;
1105 assert(bt != T_INT || bits_mask == right_n_bits(bits_per_java_integer(bt)-con), "inconsistent");
1106 if (add1_op == Op_And(bt) &&
1107 phase->type(add1->in(2)) == TypeInteger::make(bits_mask, bt)) {
1108 return LShiftNode::make(add1->in(1), in(2), bt);
1109 }
1110
1111 // Collapse nested left-shifts with constant rhs:
1112 // (X << con1) << con2 ==> X << (con1 + con2)
1113 Node* doubleShift = collapse_nested_shift_left(phase, this, con, bt);
1114 if (doubleShift != nullptr) {
1115 return doubleShift;
1116 }
1117
1118 return progress;
1119 }
1120
1121 //------------------------------Ideal------------------------------------------
1122 Node* LShiftINode::Ideal(PhaseGVN *phase, bool can_reshape) {
1123 return IdealIL(phase, can_reshape, T_INT);
1124 }
1125
1126 const Type* LShiftNode::ValueIL(PhaseGVN* phase, BasicType bt) const {
1127 const Type* t1 = phase->type(in(1));
1128 const Type* t2 = phase->type(in(2));
1129 // Either input is TOP ==> the result is TOP
1130 if (t1 == Type::TOP) {
1131 return Type::TOP;
1132 }
1133 if (t2 == Type::TOP) {
1134 return Type::TOP;
1135 }
1136
1137 // Left input is ZERO ==> the result is ZERO.
1138 if (t1 == TypeInteger::zero(bt)) {
1139 return TypeInteger::zero(bt);
1140 }
1141 // Shift by zero does nothing
1142 if (t2 == TypeInt::ZERO) {
1143 return t1;
1144 }
1145
1146 // Either input is BOTTOM ==> the result is BOTTOM
1147 if ((t1 == TypeInteger::bottom(bt)) || (t2 == TypeInt::INT) ||
1148 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM)) {
1149 return TypeInteger::bottom(bt);
1150 }
1151
1152 const TypeInteger* r1 = t1->is_integer(bt); // Handy access
1153 const TypeInt* r2 = t2->is_int(); // Handy access
1154
1155 if (!r2->is_con()) {
1156 return TypeInteger::bottom(bt);
1157 }
1158
1159 uint shift = r2->get_con();
1160 shift &= bits_per_java_integer(bt) - 1; // semantics of Java shifts
1161 // Shift by a multiple of 32/64 does nothing:
1162 if (shift == 0) {
1163 return t1;
1164 }
1165
1166 // If the shift is a constant, shift the bounds of the type,
1167 // unless this could lead to an overflow.
1168 if (!r1->is_con()) {
1169 jlong lo = r1->lo_as_long(), hi = r1->hi_as_long();
1170 #ifdef ASSERT
1171 if (bt == T_INT) {
1172 jint lo_int = r1->is_int()->_lo, hi_int = r1->is_int()->_hi;
1173 assert((java_shift_right(java_shift_left(lo, shift, bt), shift, bt) == lo) == (((lo_int << shift) >> shift) == lo_int), "inconsistent");
1174 assert((java_shift_right(java_shift_left(hi, shift, bt), shift, bt) == hi) == (((hi_int << shift) >> shift) == hi_int), "inconsistent");
1175 }
1176 #endif
1177 if (java_shift_right(java_shift_left(lo, shift, bt), shift, bt) == lo &&
1178 java_shift_right(java_shift_left(hi, shift, bt), shift, bt) == hi) {
1179 // No overflow. The range shifts up cleanly.
1180 return TypeInteger::make(java_shift_left(lo, shift, bt),
1181 java_shift_left(hi, shift, bt),
1182 MAX2(r1->_widen, r2->_widen), bt);
1183 }
1184 return TypeInteger::bottom(bt);
1185 }
1186
1187 return TypeInteger::make(java_shift_left(r1->get_con_as_long(bt), shift, bt), bt);
1188 }
1189
1190 //------------------------------Value------------------------------------------
1191 const Type* LShiftINode::Value(PhaseGVN* phase) const {
1192 return ValueIL(phase, T_INT);
1193 }
1194
1195 Node* LShiftNode::IdentityIL(PhaseGVN* phase, BasicType bt) {
1196 int count = 0;
1197 if (const_shift_count(phase, this, &count) && (count & (bits_per_java_integer(bt) - 1)) == 0) {
1198 // Shift by a multiple of 32/64 does nothing
1199 return in(1);
1200 }
1201 return this;
1202 }
1203
1204 //=============================================================================
1205 //------------------------------Identity---------------------------------------
1206 Node* LShiftLNode::Identity(PhaseGVN* phase) {
1207 return IdentityIL(phase, T_LONG);
1208 }
1209
1210 //------------------------------Ideal------------------------------------------
1211 Node* LShiftLNode::Ideal(PhaseGVN* phase, bool can_reshape) {
1212 return IdealIL(phase, can_reshape, T_LONG);
1213 }
1214
1215 //------------------------------Value------------------------------------------
1216 const Type* LShiftLNode::Value(PhaseGVN* phase) const {
1217 return ValueIL(phase, T_LONG);
1218 }
1219
1220 RShiftNode* RShiftNode::make(Node* in1, Node* in2, BasicType bt) {
1221 switch (bt) {
1222 case T_INT:
1223 return new RShiftINode(in1, in2);
1224 case T_LONG:
1225 return new RShiftLNode(in1, in2);
1226 default:
1227 fatal("Not implemented for %s", type2name(bt));
1228 }
1229 return nullptr;
1230 }
1231
1232
1233 //=============================================================================
1234 //------------------------------Identity---------------------------------------
1235 Node* RShiftNode::IdentityIL(PhaseGVN* phase, BasicType bt) {
1236 int count = 0;
1237 if (const_shift_count(phase, this, &count)) {
1238 if ((count & (bits_per_java_integer(bt) - 1)) == 0) {
1239 // Shift by a multiple of 32/64 does nothing
1240 return in(1);
1241 }
1242 // Check for useless sign-masking
1243 int lshift_count = 0;
1244 if (in(1)->Opcode() == Op_LShift(bt) &&
1245 in(1)->req() == 3 &&
1246 // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
1247 // negative constant (e.g. -1 vs 31)
1248 const_shift_count(phase, in(1), &lshift_count)) {
1249 count &= bits_per_java_integer(bt) - 1; // semantics of Java shifts
1250 lshift_count &= bits_per_java_integer(bt) - 1;
1251 if (count == lshift_count) {
1252 // Compute masks for which this shifting doesn't change
1253 jlong lo = (CONST64(-1) << (bits_per_java_integer(bt) - ((uint)count)-1)); // FFFF8000
1254 jlong hi = ~lo; // 00007FFF
1255 const TypeInteger* t11 = phase->type(in(1)->in(1))->isa_integer(bt);
1256 if (t11 == nullptr) {
1257 return this;
1258 }
1259 // Does actual value fit inside of mask?
1260 if (lo <= t11->lo_as_long() && t11->hi_as_long() <= hi) {
1261 return in(1)->in(1); // Then shifting is a nop
1262 }
1263 }
1264 }
1265 }
1266 return this;
1267 }
1268
1269 Node* RShiftINode::Identity(PhaseGVN* phase) {
1270 return IdentityIL(phase, T_INT);
1271 }
1272
1273 Node* RShiftNode::IdealIL(PhaseGVN* phase, bool can_reshape, BasicType bt) {
1274 // Inputs may be TOP if they are dead.
1275 const TypeInteger* t1 = phase->type(in(1))->isa_integer(bt);
1276 if (t1 == nullptr) {
1277 return NodeSentinel; // Left input is an integer
1278 }
1279
1280 uint shift;
1281 Node* progress = mask_and_replace_shift_amount(phase, this, bits_per_java_integer(bt), shift);
1282 if (shift == 0) {
1283 return NodeSentinel;
1284 }
1285
1286 // Check for (x & 0xFF000000) >> 24, whose mask can be made smaller.
1287 // and convert to (x >> 24) & (0xFF000000 >> 24) = x >> 24
1288 // Such expressions arise normally from shift chains like (byte)(x >> 24).
1289 const Node* and_node = in(1);
1290 if (and_node->Opcode() != Op_And(bt)) {
1291 return progress;
1292 }
1293 const TypeInteger* mask_t = phase->type(and_node->in(2))->isa_integer(bt);
1294 if (mask_t != nullptr && mask_t->is_con()) {
1295 jlong maskbits = mask_t->get_con_as_long(bt);
1296 // Convert to "(x >> shift) & (mask >> shift)"
1297 Node* shr_nomask = phase->transform(RShiftNode::make(and_node->in(1), in(2), bt));
1298 return MulNode::make_and(shr_nomask, phase->integercon(maskbits >> shift, bt), bt);
1299 }
1300
1301 return progress;
1302 }
1303
1304 Node* RShiftINode::Ideal(PhaseGVN* phase, bool can_reshape) {
1305 Node* progress = IdealIL(phase, can_reshape, T_INT);
1306 if (progress == NodeSentinel) {
1307 return nullptr;
1308 }
1309 if (progress != nullptr) {
1310 return progress;
1311 }
1312 uint shift;
1313 progress = mask_and_replace_shift_amount(phase, this, BitsPerJavaInteger, shift);
1314 assert(shift != 0, "handled by IdealIL");
1315
1316 // Check for "(short[i] <<16)>>16" which simply sign-extends
1317 const Node *shl = in(1);
1318 if (shl->Opcode() != Op_LShiftI) {
1319 return progress;
1320 }
1321
1322 const TypeInt* left_shift_t = phase->type(shl->in(2))->isa_int();
1323 if (left_shift_t == nullptr) {
1324 return progress;
1325 }
1326 if (shift == 16 && left_shift_t->is_con(16)) {
1327 Node *ld = shl->in(1);
1328 if (ld->Opcode() == Op_LoadS) {
1329 // Sign extension is just useless here. Return a RShiftI of zero instead
1330 // returning 'ld' directly. We cannot return an old Node directly as
1331 // that is the job of 'Identity' calls and Identity calls only work on
1332 // direct inputs ('ld' is an extra Node removed from 'this'). The
1333 // combined optimization requires Identity only return direct inputs.
1334 set_req_X(1, ld, phase);
1335 set_req_X(2, phase->intcon(0), phase);
1336 return this;
1337 }
1338 else if (can_reshape &&
1339 ld->Opcode() == Op_LoadUS &&
1340 ld->outcnt() == 1 && ld->unique_out() == shl)
1341 // Replace zero-extension-load with sign-extension-load
1342 return ld->as_Load()->convert_to_signed_load(*phase);
1343 }
1344
1345 // Check for "(byte[i] <<24)>>24" which simply sign-extends
1346 if (shift == 24 && left_shift_t->is_con(24)) {
1347 Node *ld = shl->in(1);
1348 if (ld->Opcode() == Op_LoadB) {
1349 // Sign extension is just useless here
1350 set_req_X(1, ld, phase);
1351 set_req_X(2, phase->intcon(0), phase);
1352 return this;
1353 }
1354 }
1355
1356 return progress;
1357 }
1358
1359 const Type* RShiftNode::ValueIL(PhaseGVN* phase, BasicType bt) const {
1360 const Type* t1 = phase->type(in(1));
1361 const Type* t2 = phase->type(in(2));
1362 // Either input is TOP ==> the result is TOP
1363 if (t1 == Type::TOP) {
1364 return Type::TOP;
1365 }
1366 if (t2 == Type::TOP) {
1367 return Type::TOP;
1368 }
1369
1370 // Left input is ZERO ==> the result is ZERO.
1371 if (t1 == TypeInteger::zero(bt)) {
1372 return TypeInteger::zero(bt);
1373 }
1374 // Shift by zero does nothing
1375 if (t2 == TypeInt::ZERO) {
1376 return t1;
1377 }
1378
1379 // Either input is BOTTOM ==> the result is BOTTOM
1380 if (t1 == Type::BOTTOM || t2 == Type::BOTTOM) {
1381 return TypeInteger::bottom(bt);
1382 }
1383
1384 const TypeInteger* r1 = t1->isa_integer(bt);
1385 const TypeInt* r2 = t2->isa_int();
1386
1387 // If the shift is a constant, just shift the bounds of the type.
1388 // For example, if the shift is 31/63, we just propagate sign bits.
1389 if (!r1->is_con() && r2->is_con()) {
1390 uint shift = r2->get_con();
1391 shift &= bits_per_java_integer(bt) - 1; // semantics of Java shifts
1392 // Shift by a multiple of 32/64 does nothing:
1393 if (shift == 0) {
1394 return t1;
1395 }
1396 // Calculate reasonably aggressive bounds for the result.
1397 // This is necessary if we are to correctly type things
1398 // like (x<<24>>24) == ((byte)x).
1399 jlong lo = r1->lo_as_long() >> (jint)shift;
1400 jlong hi = r1->hi_as_long() >> (jint)shift;
1401 assert(lo <= hi, "must have valid bounds");
1402 #ifdef ASSERT
1403 if (bt == T_INT) {
1404 jint lo_verify = checked_cast<jint>(r1->lo_as_long()) >> (jint)shift;
1405 jint hi_verify = checked_cast<jint>(r1->hi_as_long()) >> (jint)shift;
1406 assert((checked_cast<jint>(lo) == lo_verify) && (checked_cast<jint>(hi) == hi_verify), "inconsistent");
1407 }
1408 #endif
1409 const TypeInteger* ti = TypeInteger::make(lo, hi, MAX2(r1->_widen,r2->_widen), bt);
1410 #ifdef ASSERT
1411 // Make sure we get the sign-capture idiom correct.
1412 if (shift == bits_per_java_integer(bt) - 1) {
1413 if (r1->lo_as_long() >= 0) {
1414 assert(ti == TypeInteger::zero(bt), ">>31/63 of + is 0");
1415 }
1416 if (r1->hi_as_long() < 0) {
1417 assert(ti == TypeInteger::minus_1(bt), ">>31/63 of - is -1");
1418 }
1419 }
1420 #endif
1421 return ti;
1422 }
1423
1424 if (!r1->is_con() || !r2->is_con()) {
1425 // If the left input is non-negative the result must also be non-negative, regardless of what the right input is.
1426 if (r1->lo_as_long() >= 0) {
1427 return TypeInteger::make(0, r1->hi_as_long(), MAX2(r1->_widen, r2->_widen), bt);
1428 }
1429
1430 // Conversely, if the left input is negative then the result must be negative.
1431 if (r1->hi_as_long() <= -1) {
1432 return TypeInteger::make(r1->lo_as_long(), -1, MAX2(r1->_widen, r2->_widen), bt);
1433 }
1434
1435 return TypeInteger::bottom(bt);
1436 }
1437
1438 // Signed shift right
1439 return TypeInteger::make(r1->get_con_as_long(bt) >> (r2->get_con() & (bits_per_java_integer(bt) - 1)), bt);
1440 }
1441
1442 const Type* RShiftINode::Value(PhaseGVN* phase) const {
1443 return ValueIL(phase, T_INT);
1444 }
1445
1446 //=============================================================================
1447 //------------------------------Identity---------------------------------------
1448 Node* RShiftLNode::Identity(PhaseGVN* phase) {
1449 return IdentityIL(phase, T_LONG);
1450 }
1451
1452 Node* RShiftLNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1453 Node* progress = IdealIL(phase, can_reshape, T_LONG);
1454 if (progress == NodeSentinel) {
1455 return nullptr;
1456 }
1457 return progress;
1458 }
1459
1460 const Type* RShiftLNode::Value(PhaseGVN* phase) const {
1461 return ValueIL(phase, T_LONG);
1462 }
1463
1464 URShiftNode* URShiftNode::make(Node* in1, Node* in2, BasicType bt) {
1465 switch (bt) {
1466 case T_INT:
1467 return new URShiftINode(in1, in2);
1468 case T_LONG:
1469 return new URShiftLNode(in1, in2);
1470 default:
1471 fatal("Not implemented for %s", type2name(bt));
1472 }
1473 return nullptr;
1474 }
1475
1476 //=============================================================================
1477 //------------------------------Identity---------------------------------------
1478 Node* URShiftINode::Identity(PhaseGVN* phase) {
1479 int count = 0;
1480 if (const_shift_count(phase, this, &count) && (count & (BitsPerJavaInteger - 1)) == 0) {
1481 // Shift by a multiple of 32 does nothing
1482 return in(1);
1483 }
1484
1485 // Check for "((x << LogBytesPerWord) + (wordSize-1)) >> LogBytesPerWord" which is just "x".
1486 // Happens during new-array length computation.
1487 // Safe if 'x' is in the range [0..(max_int>>LogBytesPerWord)]
1488 Node *add = in(1);
1489 if (add->Opcode() == Op_AddI) {
1490 const TypeInt *t2 = phase->type(add->in(2))->isa_int();
1491 if (t2 && t2->is_con(wordSize - 1) &&
1492 add->in(1)->Opcode() == Op_LShiftI) {
1493 // Check that shift_counts are LogBytesPerWord.
1494 Node *lshift_count = add->in(1)->in(2);
1495 const TypeInt *t_lshift_count = phase->type(lshift_count)->isa_int();
1496 if (t_lshift_count && t_lshift_count->is_con(LogBytesPerWord) &&
1497 t_lshift_count == phase->type(in(2))) {
1498 Node *x = add->in(1)->in(1);
1499 const TypeInt *t_x = phase->type(x)->isa_int();
1500 if (t_x != nullptr && 0 <= t_x->_lo && t_x->_hi <= (max_jint>>LogBytesPerWord)) {
1501 return x;
1502 }
1503 }
1504 }
1505 }
1506
1507 return (phase->type(in(2))->higher_equal(TypeInt::ZERO)) ? in(1) : this;
1508 }
1509
1510 //------------------------------Ideal------------------------------------------
1511 Node* URShiftINode::Ideal(PhaseGVN* phase, bool can_reshape) {
1512 uint con;
1513 Node* progress = mask_and_replace_shift_amount(phase, this, BitsPerJavaInteger, con);
1514 if (con == 0) {
1515 return nullptr;
1516 }
1517
1518 // We'll be wanting the right-shift amount as a mask of that many bits
1519 const int mask = right_n_bits(BitsPerJavaInteger - con);
1520
1521 int in1_op = in(1)->Opcode();
1522
1523 // Check for ((x>>>a)>>>b) and replace with (x>>>(a+b)) when a+b < 32
1524 if( in1_op == Op_URShiftI ) {
1525 const TypeInt *t12 = phase->type( in(1)->in(2) )->isa_int();
1526 if( t12 && t12->is_con() ) { // Right input is a constant
1527 assert( in(1) != in(1)->in(1), "dead loop in URShiftINode::Ideal" );
1528 const int con2 = t12->get_con() & 31; // Shift count is always masked
1529 const int con3 = con+con2;
1530 if( con3 < 32 ) // Only merge shifts if total is < 32
1531 return new URShiftINode( in(1)->in(1), phase->intcon(con3) );
1532 }
1533 }
1534
1535 // Check for ((x << z) + Y) >>> z. Replace with x + con>>>z
1536 // The idiom for rounding to a power of 2 is "(Q+(2^z-1)) >>> z".
1537 // If Q is "X << z" the rounding is useless. Look for patterns like
1538 // ((X<<Z) + Y) >>> Z and replace with (X + Y>>>Z) & Z-mask.
1539 Node *add = in(1);
1540 if (in1_op == Op_AddI) {
1541 Node *lshl = add->in(1);
1542 Node *y = add->in(2);
1543 if (lshl->Opcode() != Op_LShiftI) {
1544 lshl = add->in(2);
1545 y = add->in(1);
1546 }
1547 // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
1548 // negative constant (e.g. -1 vs 31)
1549 int lshl_con = 0;
1550 if (lshl->Opcode() == Op_LShiftI &&
1551 const_shift_count(phase, lshl, &lshl_con) &&
1552 (lshl_con & (BitsPerJavaInteger - 1)) == con) {
1553 Node *y_z = phase->transform(new URShiftINode(y, in(2)));
1554 Node *sum = phase->transform(new AddINode(lshl->in(1), y_z));
1555 return new AndINode(sum, phase->intcon(mask));
1556 }
1557 }
1558
1559 // Check for (x & mask) >>> z. Replace with (x >>> z) & (mask >>> z)
1560 // This shortens the mask. Also, if we are extracting a high byte and
1561 // storing it to a buffer, the mask will be removed completely.
1562 Node *andi = in(1);
1563 if( in1_op == Op_AndI ) {
1564 const TypeInt *t3 = phase->type( andi->in(2) )->isa_int();
1565 if( t3 && t3->is_con() ) { // Right input is a constant
1566 jint mask2 = t3->get_con();
1567 mask2 >>= con; // *signed* shift downward (high-order zeroes do not help)
1568 Node *newshr = phase->transform( new URShiftINode(andi->in(1), in(2)) );
1569 return new AndINode(newshr, phase->intcon(mask2));
1570 // The negative values are easier to materialize than positive ones.
1571 // A typical case from address arithmetic is ((x & ~15) >> 4).
1572 // It's better to change that to ((x >> 4) & ~0) versus
1573 // ((x >> 4) & 0x0FFFFFFF). The difference is greatest in LP64.
1574 }
1575 }
1576
1577 // Check for "(X << z ) >>> z" which simply zero-extends
1578 Node *shl = in(1);
1579 // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
1580 // negative constant (e.g. -1 vs 31)
1581 int shl_con = 0;
1582 if (in1_op == Op_LShiftI &&
1583 const_shift_count(phase, shl, &shl_con) &&
1584 (shl_con & (BitsPerJavaInteger - 1)) == con)
1585 return new AndINode(shl->in(1), phase->intcon(mask));
1586
1587 // Check for (x >> n) >>> 31. Replace with (x >>> 31)
1588 const TypeInt* t2 = phase->type(in(2))->isa_int();
1589 Node *shr = in(1);
1590 if ( in1_op == Op_RShiftI ) {
1591 Node *in11 = shr->in(1);
1592 Node *in12 = shr->in(2);
1593 const TypeInt *t11 = phase->type(in11)->isa_int();
1594 const TypeInt *t12 = phase->type(in12)->isa_int();
1595 if ( t11 && t2 && t2->is_con(31) && t12 && t12->is_con() ) {
1596 return new URShiftINode(in11, phase->intcon(31));
1597 }
1598 }
1599
1600 return progress;
1601 }
1602
1603 //------------------------------Value------------------------------------------
1604 // A URShiftINode shifts its input2 right by input1 amount.
1605 const Type* URShiftINode::Value(PhaseGVN* phase) const {
1606 // (This is a near clone of RShiftINode::Value.)
1607 const Type *t1 = phase->type( in(1) );
1608 const Type *t2 = phase->type( in(2) );
1609 // Either input is TOP ==> the result is TOP
1610 if( t1 == Type::TOP ) return Type::TOP;
1611 if( t2 == Type::TOP ) return Type::TOP;
1612
1613 // Left input is ZERO ==> the result is ZERO.
1614 if( t1 == TypeInt::ZERO ) return TypeInt::ZERO;
1615 // Shift by zero does nothing
1616 if( t2 == TypeInt::ZERO ) return t1;
1617
1618 // Either input is BOTTOM ==> the result is BOTTOM
1619 if (t1 == Type::BOTTOM || t2 == Type::BOTTOM)
1620 return TypeInt::INT;
1621
1622 if (t2 == TypeInt::INT)
1623 return TypeInt::INT;
1624
1625 const TypeInt *r1 = t1->is_int(); // Handy access
1626 const TypeInt *r2 = t2->is_int(); // Handy access
1627
1628 if (r2->is_con()) {
1629 uint shift = r2->get_con();
1630 shift &= BitsPerJavaInteger-1; // semantics of Java shifts
1631 // Shift by a multiple of 32 does nothing:
1632 if (shift == 0) return t1;
1633 // Calculate reasonably aggressive bounds for the result.
1634 jint lo = (juint)r1->_lo >> (juint)shift;
1635 jint hi = (juint)r1->_hi >> (juint)shift;
1636 if (r1->_hi >= 0 && r1->_lo < 0) {
1637 // If the type has both negative and positive values,
1638 // there are two separate sub-domains to worry about:
1639 // The positive half and the negative half.
1640 jint neg_lo = lo;
1641 jint neg_hi = (juint)-1 >> (juint)shift;
1642 jint pos_lo = (juint) 0 >> (juint)shift;
1643 jint pos_hi = hi;
1644 lo = MIN2(neg_lo, pos_lo); // == 0
1645 hi = MAX2(neg_hi, pos_hi); // == -1 >>> shift;
1646 }
1647 assert(lo <= hi, "must have valid bounds");
1648 const TypeInt* ti = TypeInt::make(lo, hi, MAX2(r1->_widen,r2->_widen));
1649 #ifdef ASSERT
1650 // Make sure we get the sign-capture idiom correct.
1651 if (shift == BitsPerJavaInteger-1) {
1652 if (r1->_lo >= 0) assert(ti == TypeInt::ZERO, ">>>31 of + is 0");
1653 if (r1->_hi < 0) assert(ti == TypeInt::ONE, ">>>31 of - is +1");
1654 }
1655 #endif
1656 return ti;
1657 }
1658
1659 //
1660 // Do not support shifted oops in info for GC
1661 //
1662 // else if( t1->base() == Type::InstPtr ) {
1663 //
1664 // const TypeInstPtr *o = t1->is_instptr();
1665 // if( t1->singleton() )
1666 // return TypeInt::make( ((uint32_t)o->const_oop() + o->_offset) >> shift );
1667 // }
1668 // else if( t1->base() == Type::KlassPtr ) {
1669 // const TypeKlassPtr *o = t1->is_klassptr();
1670 // if( t1->singleton() )
1671 // return TypeInt::make( ((uint32_t)o->const_oop() + o->_offset) >> shift );
1672 // }
1673
1674 return TypeInt::INT;
1675 }
1676
1677 //=============================================================================
1678 //------------------------------Identity---------------------------------------
1679 Node* URShiftLNode::Identity(PhaseGVN* phase) {
1680 int count = 0;
1681 if (const_shift_count(phase, this, &count) && (count & (BitsPerJavaLong - 1)) == 0) {
1682 // Shift by a multiple of 64 does nothing
1683 return in(1);
1684 }
1685 return this;
1686 }
1687
1688 //------------------------------Ideal------------------------------------------
1689 Node* URShiftLNode::Ideal(PhaseGVN* phase, bool can_reshape) {
1690 uint con;
1691 Node* progress = mask_and_replace_shift_amount(phase, this, BitsPerJavaLong, con);
1692 if (con == 0) {
1693 return nullptr;
1694 }
1695
1696 // We'll be wanting the right-shift amount as a mask of that many bits
1697 const jlong mask = jlong(max_julong >> con);
1698
1699 // Check for ((x << z) + Y) >>> z. Replace with x + con>>>z
1700 // The idiom for rounding to a power of 2 is "(Q+(2^z-1)) >>> z".
1701 // If Q is "X << z" the rounding is useless. Look for patterns like
1702 // ((X<<Z) + Y) >>> Z and replace with (X + Y>>>Z) & Z-mask.
1703 Node *add = in(1);
1704 const TypeInt *t2 = phase->type(in(2))->isa_int();
1705 if (add->Opcode() == Op_AddL) {
1706 Node *lshl = add->in(1);
1707 Node *y = add->in(2);
1708 if (lshl->Opcode() != Op_LShiftL) {
1709 lshl = add->in(2);
1710 y = add->in(1);
1711 }
1712 // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
1713 // negative constant (e.g. -1 vs 63)
1714 int lshl_con = 0;
1715 if (lshl->Opcode() == Op_LShiftL &&
1716 const_shift_count(phase, lshl, &lshl_con) &&
1717 (lshl_con & (BitsPerJavaLong - 1)) == con) {
1718 Node* y_z = phase->transform(new URShiftLNode(y, in(2)));
1719 Node* sum = phase->transform(new AddLNode(lshl->in(1), y_z));
1720 return new AndLNode(sum, phase->longcon(mask));
1721 }
1722 }
1723
1724 // Check for (x & mask) >>> z. Replace with (x >>> z) & (mask >>> z)
1725 // This shortens the mask. Also, if we are extracting a high byte and
1726 // storing it to a buffer, the mask will be removed completely.
1727 Node *andi = in(1);
1728 if( andi->Opcode() == Op_AndL ) {
1729 const TypeLong *t3 = phase->type( andi->in(2) )->isa_long();
1730 if( t3 && t3->is_con() ) { // Right input is a constant
1731 jlong mask2 = t3->get_con();
1732 mask2 >>= con; // *signed* shift downward (high-order zeroes do not help)
1733 Node *newshr = phase->transform( new URShiftLNode(andi->in(1), in(2)) );
1734 return new AndLNode(newshr, phase->longcon(mask2));
1735 }
1736 }
1737
1738 // Check for "(X << z ) >>> z" which simply zero-extends
1739 Node *shl = in(1);
1740 // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
1741 // negative constant (e.g. -1 vs 63)
1742 int shl_con = 0;
1743 if (shl->Opcode() == Op_LShiftL &&
1744 const_shift_count(phase, shl, &shl_con) &&
1745 (shl_con & (BitsPerJavaLong - 1)) == con) {
1746 return new AndLNode(shl->in(1), phase->longcon(mask));
1747 }
1748
1749 // Check for (x >> n) >>> 63. Replace with (x >>> 63)
1750 Node *shr = in(1);
1751 if ( shr->Opcode() == Op_RShiftL ) {
1752 Node *in11 = shr->in(1);
1753 Node *in12 = shr->in(2);
1754 const TypeLong *t11 = phase->type(in11)->isa_long();
1755 const TypeInt *t12 = phase->type(in12)->isa_int();
1756 if ( t11 && t2 && t2->is_con(63) && t12 && t12->is_con() ) {
1757 return new URShiftLNode(in11, phase->intcon(63));
1758 }
1759 }
1760
1761 return progress;
1762 }
1763
1764 //------------------------------Value------------------------------------------
1765 // A URShiftINode shifts its input2 right by input1 amount.
1766 const Type* URShiftLNode::Value(PhaseGVN* phase) const {
1767 // (This is a near clone of RShiftLNode::Value.)
1768 const Type *t1 = phase->type( in(1) );
1769 const Type *t2 = phase->type( in(2) );
1770 // Either input is TOP ==> the result is TOP
1771 if( t1 == Type::TOP ) return Type::TOP;
1772 if( t2 == Type::TOP ) return Type::TOP;
1773
1774 // Left input is ZERO ==> the result is ZERO.
1775 if( t1 == TypeLong::ZERO ) return TypeLong::ZERO;
1776 // Shift by zero does nothing
1777 if( t2 == TypeInt::ZERO ) return t1;
1778
1779 // Either input is BOTTOM ==> the result is BOTTOM
1780 if (t1 == Type::BOTTOM || t2 == Type::BOTTOM)
1781 return TypeLong::LONG;
1782
1783 if (t2 == TypeInt::INT)
1784 return TypeLong::LONG;
1785
1786 const TypeLong *r1 = t1->is_long(); // Handy access
1787 const TypeInt *r2 = t2->is_int (); // Handy access
1788
1789 if (r2->is_con()) {
1790 uint shift = r2->get_con();
1791 shift &= BitsPerJavaLong - 1; // semantics of Java shifts
1792 // Shift by a multiple of 64 does nothing:
1793 if (shift == 0) return t1;
1794 // Calculate reasonably aggressive bounds for the result.
1795 jlong lo = (julong)r1->_lo >> (juint)shift;
1796 jlong hi = (julong)r1->_hi >> (juint)shift;
1797 if (r1->_hi >= 0 && r1->_lo < 0) {
1798 // If the type has both negative and positive values,
1799 // there are two separate sub-domains to worry about:
1800 // The positive half and the negative half.
1801 jlong neg_lo = lo;
1802 jlong neg_hi = (julong)-1 >> (juint)shift;
1803 jlong pos_lo = (julong) 0 >> (juint)shift;
1804 jlong pos_hi = hi;
1805 //lo = MIN2(neg_lo, pos_lo); // == 0
1806 lo = neg_lo < pos_lo ? neg_lo : pos_lo;
1807 //hi = MAX2(neg_hi, pos_hi); // == -1 >>> shift;
1808 hi = neg_hi > pos_hi ? neg_hi : pos_hi;
1809 }
1810 assert(lo <= hi, "must have valid bounds");
1811 const TypeLong* tl = TypeLong::make(lo, hi, MAX2(r1->_widen,r2->_widen));
1812 #ifdef ASSERT
1813 // Make sure we get the sign-capture idiom correct.
1814 if (shift == BitsPerJavaLong - 1) {
1815 if (r1->_lo >= 0) assert(tl == TypeLong::ZERO, ">>>63 of + is 0");
1816 if (r1->_hi < 0) assert(tl == TypeLong::ONE, ">>>63 of - is +1");
1817 }
1818 #endif
1819 return tl;
1820 }
1821
1822 return TypeLong::LONG; // Give up
1823 }
1824
1825 //=============================================================================
1826 //------------------------------Ideal------------------------------------------
1827 Node* FmaNode::Ideal(PhaseGVN* phase, bool can_reshape) {
1828 // We canonicalize the node by converting "(-a)*b+c" into "b*(-a)+c"
1829 // This reduces the number of rules in the matcher, as we only need to check
1830 // for negations on the second argument, and not the symmetric case where
1831 // the first argument is negated.
1832 if (in(1)->is_Neg() && !in(2)->is_Neg()) {
1833 swap_edges(1, 2);
1834 return this;
1835 }
1836 return nullptr;
1837 }
1838
1839 //=============================================================================
1840 //------------------------------Value------------------------------------------
1841 const Type* FmaDNode::Value(PhaseGVN* phase) const {
1842 const Type *t1 = phase->type(in(1));
1843 if (t1 == Type::TOP) return Type::TOP;
1844 if (t1->base() != Type::DoubleCon) return Type::DOUBLE;
1845 const Type *t2 = phase->type(in(2));
1846 if (t2 == Type::TOP) return Type::TOP;
1847 if (t2->base() != Type::DoubleCon) return Type::DOUBLE;
1848 const Type *t3 = phase->type(in(3));
1849 if (t3 == Type::TOP) return Type::TOP;
1850 if (t3->base() != Type::DoubleCon) return Type::DOUBLE;
1851 #ifndef __STDC_IEC_559__
1852 return Type::DOUBLE;
1853 #else
1854 double d1 = t1->getd();
1855 double d2 = t2->getd();
1856 double d3 = t3->getd();
1857 return TypeD::make(fma(d1, d2, d3));
1858 #endif
1859 }
1860
1861 //=============================================================================
1862 //------------------------------Value------------------------------------------
1863 const Type* FmaFNode::Value(PhaseGVN* phase) const {
1864 const Type *t1 = phase->type(in(1));
1865 if (t1 == Type::TOP) return Type::TOP;
1866 if (t1->base() != Type::FloatCon) return Type::FLOAT;
1867 const Type *t2 = phase->type(in(2));
1868 if (t2 == Type::TOP) return Type::TOP;
1869 if (t2->base() != Type::FloatCon) return Type::FLOAT;
1870 const Type *t3 = phase->type(in(3));
1871 if (t3 == Type::TOP) return Type::TOP;
1872 if (t3->base() != Type::FloatCon) return Type::FLOAT;
1873 #ifndef __STDC_IEC_559__
1874 return Type::FLOAT;
1875 #else
1876 float f1 = t1->getf();
1877 float f2 = t2->getf();
1878 float f3 = t3->getf();
1879 return TypeF::make(fma(f1, f2, f3));
1880 #endif
1881 }
1882
1883 //=============================================================================
1884 //------------------------------Value------------------------------------------
1885 const Type* FmaHFNode::Value(PhaseGVN* phase) const {
1886 const Type* t1 = phase->type(in(1));
1887 if (t1 == Type::TOP) { return Type::TOP; }
1888 if (t1->base() != Type::HalfFloatCon) { return Type::HALF_FLOAT; }
1889 const Type* t2 = phase->type(in(2));
1890 if (t2 == Type::TOP) { return Type::TOP; }
1891 if (t2->base() != Type::HalfFloatCon) { return Type::HALF_FLOAT; }
1892 const Type* t3 = phase->type(in(3));
1893 if (t3 == Type::TOP) { return Type::TOP; }
1894 if (t3->base() != Type::HalfFloatCon) { return Type::HALF_FLOAT; }
1895 #ifndef __STDC_IEC_559__
1896 return Type::HALF_FLOAT;
1897 #else
1898 float f1 = t1->getf();
1899 float f2 = t2->getf();
1900 float f3 = t3->getf();
1901 return TypeH::make(fma(f1, f2, f3));
1902 #endif
1903 }
1904
1905 //=============================================================================
1906 //------------------------------hash-------------------------------------------
1907 // Hash function for MulAddS2INode. Operation is commutative with commutative pairs.
1908 // The hash function must return the same value when edge swapping is performed.
1909 uint MulAddS2INode::hash() const {
1910 return (uintptr_t)in(1) + (uintptr_t)in(2) + (uintptr_t)in(3) + (uintptr_t)in(4) + Opcode();
1911 }
1912
1913 //------------------------------Rotate Operations ------------------------------
1914
1915 Node* RotateLeftNode::Identity(PhaseGVN* phase) {
1916 const Type* t1 = phase->type(in(1));
1917 if (t1 == Type::TOP) {
1918 return this;
1919 }
1920 int count = 0;
1921 assert(t1->isa_int() || t1->isa_long(), "Unexpected type");
1922 int mask = (t1->isa_int() ? BitsPerJavaInteger : BitsPerJavaLong) - 1;
1923 if (const_shift_count(phase, this, &count) && (count & mask) == 0) {
1924 // Rotate by a multiple of 32/64 does nothing
1925 return in(1);
1926 }
1927 return this;
1928 }
1929
1930 const Type* RotateLeftNode::Value(PhaseGVN* phase) const {
1931 const Type* t1 = phase->type(in(1));
1932 const Type* t2 = phase->type(in(2));
1933 // Either input is TOP ==> the result is TOP
1934 if (t1 == Type::TOP || t2 == Type::TOP) {
1935 return Type::TOP;
1936 }
1937
1938 if (t1->isa_int()) {
1939 const TypeInt* r1 = t1->is_int();
1940 const TypeInt* r2 = t2->is_int();
1941
1942 // Left input is ZERO ==> the result is ZERO.
1943 if (r1 == TypeInt::ZERO) {
1944 return TypeInt::ZERO;
1945 }
1946 // Rotate by zero does nothing
1947 if (r2 == TypeInt::ZERO) {
1948 return r1;
1949 }
1950 if (r1->is_con() && r2->is_con()) {
1951 juint r1_con = (juint)r1->get_con();
1952 juint shift = (juint)(r2->get_con()) & (juint)(BitsPerJavaInteger - 1); // semantics of Java shifts
1953 return TypeInt::make((r1_con << shift) | (r1_con >> (32 - shift)));
1954 }
1955 return TypeInt::INT;
1956 } else {
1957 assert(t1->isa_long(), "Type must be a long");
1958 const TypeLong* r1 = t1->is_long();
1959 const TypeInt* r2 = t2->is_int();
1960
1961 // Left input is ZERO ==> the result is ZERO.
1962 if (r1 == TypeLong::ZERO) {
1963 return TypeLong::ZERO;
1964 }
1965 // Rotate by zero does nothing
1966 if (r2 == TypeInt::ZERO) {
1967 return r1;
1968 }
1969 if (r1->is_con() && r2->is_con()) {
1970 julong r1_con = (julong)r1->get_con();
1971 julong shift = (julong)(r2->get_con()) & (julong)(BitsPerJavaLong - 1); // semantics of Java shifts
1972 return TypeLong::make((r1_con << shift) | (r1_con >> (64 - shift)));
1973 }
1974 return TypeLong::LONG;
1975 }
1976 }
1977
1978 Node* RotateLeftNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1979 const Type* t1 = phase->type(in(1));
1980 const Type* t2 = phase->type(in(2));
1981 if (t2->isa_int() && t2->is_int()->is_con()) {
1982 if (t1->isa_int()) {
1983 int lshift = t2->is_int()->get_con() & 31;
1984 return new RotateRightNode(in(1), phase->intcon(32 - (lshift & 31)), TypeInt::INT);
1985 } else if (t1 != Type::TOP) {
1986 assert(t1->isa_long(), "Type must be a long");
1987 int lshift = t2->is_int()->get_con() & 63;
1988 return new RotateRightNode(in(1), phase->intcon(64 - (lshift & 63)), TypeLong::LONG);
1989 }
1990 }
1991 return nullptr;
1992 }
1993
1994 Node* RotateRightNode::Identity(PhaseGVN* phase) {
1995 const Type* t1 = phase->type(in(1));
1996 if (t1 == Type::TOP) {
1997 return this;
1998 }
1999 int count = 0;
2000 assert(t1->isa_int() || t1->isa_long(), "Unexpected type");
2001 int mask = (t1->isa_int() ? BitsPerJavaInteger : BitsPerJavaLong) - 1;
2002 if (const_shift_count(phase, this, &count) && (count & mask) == 0) {
2003 // Rotate by a multiple of 32/64 does nothing
2004 return in(1);
2005 }
2006 return this;
2007 }
2008
2009 const Type* RotateRightNode::Value(PhaseGVN* phase) const {
2010 const Type* t1 = phase->type(in(1));
2011 const Type* t2 = phase->type(in(2));
2012 // Either input is TOP ==> the result is TOP
2013 if (t1 == Type::TOP || t2 == Type::TOP) {
2014 return Type::TOP;
2015 }
2016
2017 if (t1->isa_int()) {
2018 const TypeInt* r1 = t1->is_int();
2019 const TypeInt* r2 = t2->is_int();
2020
2021 // Left input is ZERO ==> the result is ZERO.
2022 if (r1 == TypeInt::ZERO) {
2023 return TypeInt::ZERO;
2024 }
2025 // Rotate by zero does nothing
2026 if (r2 == TypeInt::ZERO) {
2027 return r1;
2028 }
2029 if (r1->is_con() && r2->is_con()) {
2030 juint r1_con = (juint)r1->get_con();
2031 juint shift = (juint)(r2->get_con()) & (juint)(BitsPerJavaInteger - 1); // semantics of Java shifts
2032 return TypeInt::make((r1_con >> shift) | (r1_con << (32 - shift)));
2033 }
2034 return TypeInt::INT;
2035 } else {
2036 assert(t1->isa_long(), "Type must be a long");
2037 const TypeLong* r1 = t1->is_long();
2038 const TypeInt* r2 = t2->is_int();
2039 // Left input is ZERO ==> the result is ZERO.
2040 if (r1 == TypeLong::ZERO) {
2041 return TypeLong::ZERO;
2042 }
2043 // Rotate by zero does nothing
2044 if (r2 == TypeInt::ZERO) {
2045 return r1;
2046 }
2047 if (r1->is_con() && r2->is_con()) {
2048 julong r1_con = (julong)r1->get_con();
2049 julong shift = (julong)(r2->get_con()) & (julong)(BitsPerJavaLong - 1); // semantics of Java shifts
2050 return TypeLong::make((r1_con >> shift) | (r1_con << (64 - shift)));
2051 }
2052 return TypeLong::LONG;
2053 }
2054 }
2055
2056 //------------------------------ Sum & Mask ------------------------------
2057
2058 // Returns a lower bound on the number of trailing zeros in expr.
2059 static jint AndIL_min_trailing_zeros(const PhaseGVN* phase, const Node* expr, BasicType bt) {
2060 const TypeInteger* type = phase->type(expr)->isa_integer(bt);
2061 if (type == nullptr) {
2062 return 0;
2063 }
2064
2065 expr = expr->uncast();
2066 type = phase->type(expr)->isa_integer(bt);
2067 if (type == nullptr) {
2068 return 0;
2069 }
2070
2071 if (type->is_con()) {
2072 jlong con = type->get_con_as_long(bt);
2073 return con == 0L ? (type2aelembytes(bt) * BitsPerByte) : count_trailing_zeros(con);
2074 }
2075
2076 if (expr->Opcode() == Op_ConvI2L) {
2077 expr = expr->in(1)->uncast();
2078 bt = T_INT;
2079 type = phase->type(expr)->isa_int();
2080 }
2081
2082 // Pattern: expr = (x << shift)
2083 if (expr->Opcode() == Op_LShift(bt)) {
2084 const TypeInt* shift_t = phase->type(expr->in(2))->isa_int();
2085 if (shift_t == nullptr || !shift_t->is_con()) {
2086 return 0;
2087 }
2088 // We need to truncate the shift, as it may not have been canonicalized yet.
2089 // T_INT: 0..31 -> shift_mask = 4 * 8 - 1 = 31
2090 // T_LONG: 0..63 -> shift_mask = 8 * 8 - 1 = 63
2091 // (JLS: "Shift Operators")
2092 jint shift_mask = type2aelembytes(bt) * BitsPerByte - 1;
2093 return shift_t->get_con() & shift_mask;
2094 }
2095
2096 return 0;
2097 }
2098
2099 // Checks whether expr is neutral additive element (zero) under mask,
2100 // i.e. whether an expression of the form:
2101 // (AndX (AddX (expr addend) mask)
2102 // (expr + addend) & mask
2103 // is equivalent to
2104 // (AndX addend mask)
2105 // addend & mask
2106 // for any addend.
2107 // (The X in AndX must be I or L, depending on bt).
2108 //
2109 // We check for the sufficient condition when the lowest set bit in expr is higher than
2110 // the highest set bit in mask, i.e.:
2111 // expr: eeeeee0000000000000
2112 // mask: 000000mmmmmmmmmmmmm
2113 // <--w bits--->
2114 // We do not test for other cases.
2115 //
2116 // Correctness:
2117 // Given "expr" with at least "w" trailing zeros,
2118 // let "mod = 2^w", "suffix_mask = mod - 1"
2119 //
2120 // Since "mask" only has bits set where "suffix_mask" does, we have:
2121 // mask = suffix_mask & mask (SUFFIX_MASK)
2122 //
2123 // And since expr only has bits set above w, and suffix_mask only below:
2124 // expr & suffix_mask == 0 (NO_BIT_OVERLAP)
2125 //
2126 // From unsigned modular arithmetic (with unsigned modulo %), and since mod is
2127 // a power of 2, and we are computing in a ring of powers of 2, we know that
2128 // (x + y) % mod = (x % mod + y) % mod
2129 // (x + y) & suffix_mask = (x & suffix_mask + y) & suffix_mask (MOD_ARITH)
2130 //
2131 // We can now prove the equality:
2132 // (expr + addend) & mask
2133 // = (expr + addend) & suffix_mask & mask (SUFFIX_MASK)
2134 // = (expr & suffix_mask + addend) & suffix_mask & mask (MOD_ARITH)
2135 // = (0 + addend) & suffix_mask & mask (NO_BIT_OVERLAP)
2136 // = addend & mask (SUFFIX_MASK)
2137 //
2138 // Hence, an expr with at least w trailing zeros is a neutral additive element under any mask with bit width w.
2139 static bool AndIL_is_zero_element_under_mask(const PhaseGVN* phase, const Node* expr, const Node* mask, BasicType bt) {
2140 // When the mask is negative, it has the most significant bit set.
2141 const TypeInteger* mask_t = phase->type(mask)->isa_integer(bt);
2142 if (mask_t == nullptr || mask_t->lo_as_long() < 0) {
2143 return false;
2144 }
2145
2146 // When the mask is constant zero, we defer to MulNode::Value to eliminate the entire AndX operation.
2147 if (mask_t->hi_as_long() == 0) {
2148 assert(mask_t->lo_as_long() == 0, "checked earlier");
2149 return false;
2150 }
2151
2152 jint mask_bit_width = BitsPerLong - count_leading_zeros(mask_t->hi_as_long());
2153 jint expr_trailing_zeros = AndIL_min_trailing_zeros(phase, expr, bt);
2154 return expr_trailing_zeros >= mask_bit_width;
2155 }
2156
2157 // Reduces the pattern:
2158 // (AndX (AddX add1 add2) mask)
2159 // to
2160 // (AndX add1 mask), if add2 is neutral wrt mask (see above), and vice versa.
2161 Node* MulNode::AndIL_sum_and_mask(PhaseGVN* phase, BasicType bt) {
2162 Node* add = in(1);
2163 Node* mask = in(2);
2164 int addidx = 0;
2165 if (add->Opcode() == Op_Add(bt)) {
2166 addidx = 1;
2167 } else if (mask->Opcode() == Op_Add(bt)) {
2168 mask = add;
2169 addidx = 2;
2170 add = in(addidx);
2171 }
2172 if (addidx > 0) {
2173 Node* add1 = add->in(1);
2174 Node* add2 = add->in(2);
2175 if (AndIL_is_zero_element_under_mask(phase, add1, mask, bt)) {
2176 set_req_X(addidx, add2, phase);
2177 return this;
2178 } else if (AndIL_is_zero_element_under_mask(phase, add2, mask, bt)) {
2179 set_req_X(addidx, add1, phase);
2180 return this;
2181 }
2182 }
2183 return nullptr;
2184 }