Lines Matching defs:con
178 jint con;
179 if ((con = in(1)->find_int_con(0)) != 0) {
181 // Finish rest of method to use info in 'con'
182 } else if ((con = in(2)->find_int_con(0)) == 0) {
186 // Now we have a constant Node on the right and the constant in con
187 if( con == 0 ) return NULL; // By zero is handled by Value call
188 if( con == 1 ) return NULL; // By one is handled by Identity call
192 if( con < 0 ) {
193 con = -con;
199 jint bit1 = con & -con; // Extract low bit
200 if( bit1 == con ) { // Found a power of 2?
205 jint bit2 = con-bit1;
207 if( bit2 + bit1 == con ) { // Found all bits in con?
212 } else if (is_power_of_2(con+1)) {
214 jint temp = (jint) (con + 1);
223 res = phase->transform(res);// Transform, before making the zero con
274 jlong con;
275 if ((con = in(1)->find_long_con(0)) != 0) {
277 // Finish rest of method to use info in 'con'
278 } else if ((con = in(2)->find_long_con(0)) == 0) {
282 // Now we have a constant Node on the right and the constant in con
283 if( con == CONST64(0) ) return NULL; // By zero is handled by Value call
284 if( con == CONST64(1) ) return NULL; // By one is handled by Identity call
288 if( con < 0 ) {
289 con = -con;
295 jlong bit1 = con & -con; // Extract low bit
296 if( bit1 == con ) { // Found a power of 2?
301 jlong bit2 = con-bit1;
303 if( bit2 + bit1 == con ) { // Found all bits in con?
308 } else if (is_power_of_2_long(con+1)) {
310 jlong temp = (jlong) (con + 1);
319 res = phase->transform(res);// Transform, before making the zero con
443 int con = t2->get_con();
448 if ((t1_support & con) == t1_support)
459 if ((mask & con) == mask) // If AND is useless, skip it
570 jlong con = t2->get_con();
575 if ((t1_support & con) == t1_support)
587 if( (mask&con) == mask ) // If AND is useless, skip it
651 const int con = t2->get_con() & ( BitsPerInt - 1 ); // masked shift count
653 if ( con == 0 ) return NULL; // let Identity() handle 0 shift count
661 if( t12 && t12->is_con() ){ // Left input is an add of a con?
664 if( con < 16 ) {
668 return new (phase->C) AddINode( lsh, phase->intcon(t12->get_con() << con));
677 return new (phase->C) AndINode(add1->in(1),phase->intcon( -(1<<con)));
693 const jint bits_mask = right_n_bits(BitsPerJavaInteger-con);
763 const int con = t2->get_con() & ( BitsPerLong - 1 ); // masked shift count
765 if ( con == 0 ) return NULL; // let Identity() handle 0 shift count
774 if( t12 && t12->is_con() ){ // Left input is an add of a con?
778 return new (phase->C) AddLNode( lsh, phase->longcon(t12->get_con() << con));
786 return new (phase->C) AndLNode(add1->in(1),phase->longcon( -(CONST64(1)<<con)));
802 const jlong bits_mask = ((jlong)CONST64(1) << (jlong)(BitsPerJavaLong - con)) - CONST64(1);
1103 const int con = t2->get_con() & 31; // Shift count is always masked
1104 if ( con == 0 ) return NULL; // let Identity() handle a 0 shift count
1106 const int mask = right_n_bits(BitsPerJavaInteger - con);
1116 const int con3 = con+con2;
1122 // Check for ((x << z) + Y) >>> z. Replace with x + con>>>z
1145 mask2 >>= con; // *signed* shift downward (high-order zeroes do not help)
1249 const int con = t2->get_con() & ( BitsPerLong - 1 ); // Shift count is always masked
1250 if ( con == 0 ) return NULL; // let Identity() handle a 0 shift count
1253 const jlong mask = (((jlong)CONST64(1) << (jlong)(BitsPerJavaLong - con)) -1);
1255 // Check for ((x << z) + Y) >>> z. Replace with x + con>>>z
1278 mask2 >>= con; // *signed* shift downward (high-order zeroes do not help)