vm/opto/mulnode.cpp

179   jint con;
180   if ((con = in(1)->find_int_con(0)) != 0) {
182     // Finish rest of method to use info in 'con'
183   } else if ((con = in(2)->find_int_con(0)) == 0) {
187   // Now we have a constant Node on the right and the constant in con
188   if( con == 0 ) return NULL;   // By zero is handled by Value call
189   if( con == 1 ) return NULL;   // By one  is handled by Identity call
193   if( con < 0 ) {
194     con = -con;
200   jint bit1 = con & -con;       // Extract low bit
201   if( bit1 == con ) {           // Found a power of 2?
206     jint bit2 = con-bit1;
208     if( bit2 + bit1 == con ) {    // Found all bits in con?
213     } else if (is_power_of_2(con+1)) {
215       jint temp = (jint) (con + 1);
224     res = phase->transform(res);// Transform, before making the zero con
275   jlong con;
276   if ((con = in(1)->find_long_con(0)) != 0) {
278     // Finish rest of method to use info in 'con'
279   } else if ((con = in(2)->find_long_con(0)) == 0) {
283   // Now we have a constant Node on the right and the constant in con
284   if( con == CONST64(0) ) return NULL;  // By zero is handled by Value call
285   if( con == CONST64(1) ) return NULL;  // By one  is handled by Identity call
289   if( con < 0 ) {
290     con = -con;
296   jlong bit1 = con & -con;      // Extract low bit
297   if( bit1 == con ) {           // Found a power of 2?
302     jlong bit2 = con-bit1;
304     if( bit2 + bit1 == con ) {    // Found all bits in con?
309     } else if (is_power_of_2_long(con+1)) {
311       jlong temp = (jlong) (con + 1);
320     res = phase->transform(res);// Transform, before making the zero con
444     int con = t2->get_con();
449       if ((t1_support & con) == t1_support)
460         if ((mask & con) == mask)  // If AND is useless, skip it
565     jlong con = t2->get_con();
571       if ((t1_support & con) == t1_support)
583         if( (mask&con) == mask )  // If AND is useless, skip it
647   const int con = t2->get_con() & ( BitsPerInt - 1 );  // masked shift count
649   if ( con == 0 )  return NULL; // let Identity() handle 0 shift count
657     if( t12 && t12->is_con() ){ // Left input is an add of a con?
660       if( con < 16 ) {
664         return new AddINode( lsh, phase->intcon(t12->get_con() << con));
673     return new AndINode(add1->in(1),phase->intcon( -(1<<con)));
689   const jint bits_mask = right_n_bits(BitsPerJavaInteger-con);
759   const int con = t2->get_con() & ( BitsPerLong - 1 );  // masked shift count
761   if ( con == 0 ) return NULL;  // let Identity() handle 0 shift count
770     if( t12 && t12->is_con() ){ // Left input is an add of a con?
774       return new AddLNode( lsh, phase->longcon(t12->get_con() << con));
782     return new AndLNode(add1->in(1),phase->longcon( -(CONST64(1)<<con)));
798   const jlong bits_mask = jlong(max_julong >> con);
1096   const int con = t2->get_con() & 31; // Shift count is always masked
1097   if ( con == 0 ) return NULL;  // let Identity() handle a 0 shift count
1099   const int mask = right_n_bits(BitsPerJavaInteger - con);
1109       const int con3 = con+con2;
1115   // Check for ((x << z) + Y) >>> z.  Replace with x + con>>>z
1138       mask2 >>= con;  // *signed* shift downward (high-order zeroes do not help)
1242   const int con = t2->get_con() & ( BitsPerLong - 1 ); // Shift count is always masked
1243   if ( con == 0 ) return NULL;  // let Identity() handle a 0 shift count
1246   const jlong mask = jlong(max_julong >> con);
1248   // Check for ((x << z) + Y) >>> z.  Replace with x + con>>>z
1271       mask2 >>= con;  // *signed* shift downward (high-order zeroes do not help)