Cross Reference: /openjdk7/hotspot/src/share/vm/opto/mulnode.cpp

Lines Matching defs:mask
458         int mask = max_juint >> shift;
459         if ((mask & con) == mask)  // If AND is useless, skip it
469   // Special case constant AND mask
472   const int mask = t2->get_con();
478       (mask & 0xFFFF0000) )     // Can we make a smaller mask?
479     return new (phase->C) AndINode(load,phase->intcon(mask&0xFFFF));
484     if (lop == Op_LoadS && (mask & 0xFFFF0000) == 0 ) {
490       return new (phase->C) AndINode(ldus, phase->intcon(mask & 0xFFFF));
495     if (lop == Op_LoadB && (mask & 0xFFFFFF00) == 0) {
501       return new (phase->C) AndINode(ldub, phase->intcon(mask));
514       if( (sign_bits_mask & mask) == 0 ) {
524   // plus 1) and the mask is of the low order bit.  Skip the negate.
525   if( lop == Op_SubI && mask == 1 && load->in(1) &&
586         jlong mask = max_julong >> shift;
587         if( (mask&con) == mask )  // If AND is useless, skip it
597   // Special case constant AND mask
600   const jlong mask = t2->get_con();
605   // Are we masking a long that was converted from an int with a mask
610   if (op == Op_ConvI2L && (mask & CONST64(0xFFFFFFFF80000000)) == 0) {
611     Node* andi = new (phase->C) AndINode(in1->in(1), phase->intcon(mask));
625       if( (sign_bits_mask & mask) == 0 ) {
877     // Does actual value fit inside of mask?
898   // Check for (x & 0xFF000000) >> 24, whose mask can be made smaller.
900   const Node *mask = in(1);
901   if( mask->Opcode() == Op_AndI &&
902       (t3 = phase->type(mask->in(2))->isa_int()) &&
904     Node *x = mask->in(1);
906     // Convert to "(x >> shift) & (mask >> shift)"
907     Node *shr_nomask = phase->transform( new (phase->C) RShiftINode(mask->in(1), in(2)) );
1105   // We'll be wanting the right-shift amount as a mask of that many bits
1106   const int mask = right_n_bits(BitsPerJavaInteger - con);
1125   // ((X<<Z) + Y) >>> Z  and replace with (X + Y>>>Z) & Z-mask.
1133       return new (phase->C) AndINode( sum, phase->intcon(mask) );
1137   // Check for (x & mask) >>> z.  Replace with (x >>> z) & (mask >>> z)
1138   // This shortens the mask.  Also, if we are extracting a high byte and
1139   // storing it to a buffer, the mask will be removed completely.
1159     return new (phase->C) AndINode( shl->in(1), phase->intcon(mask) );
1251                               // note: mask computation below does not work for 0 shift count
1252   // We'll be wanting the right-shift amount as a mask of that many bits
1253   const jlong mask = (((jlong)CONST64(1) << (jlong)(BitsPerJavaLong - con)) -1);
1258   // ((X<<Z) + Y) >>> Z  and replace with (X + Y>>>Z) & Z-mask.
1266       return new (phase->C) AndLNode( sum, phase->longcon(mask) );
1270   // Check for (x & mask) >>> z.  Replace with (x >>> z) & (mask >>> z)
1271   // This shortens the mask.  Also, if we are extracting a high byte and
1272   // storing it to a buffer, the mask will be removed completely.
1288     return new (phase->C) AndLNode( shl->in(1), phase->longcon(mask) );