Lines Matching defs:mask
1209 uint32_t const mask = divisor - 1;
1216 Int32Sub(zero, Word32And(Int32Sub(zero, dividend), mask)),
1217 Word32And(dividend, mask)));
1615 uint32_t mask = mleft.right().ResolvedValue();
1616 if ((mask >> shift) == 0) {
1706 typename A::intN_t const mask = m.right().ResolvedValue();
1707 typename A::intN_t const neg_mask = base::NegateWithWraparound(mask);
1712 base::bits::CountTrailingZeros(mask)) {
1719 (mleft.right().ResolvedValue() & mask) ==
1752 if (mleftleft.right().Is(base::bits::CountTrailingZeros(mask))) {
1763 if (mleftright.right().Is(base::bits::CountTrailingZeros(mask))) {
1785 // Represents an operation of the form `(source & mask) == masked_value`.
1786 // where each bit set in masked_value also has to be set in mask.
1789 uint32_t const mask;
1793 BitfieldCheck(Node* source, uint32_t mask, uint32_t masked_value,
1796 mask(mask),
1799 CHECK_EQ(masked_value & ~mask, 0);
1807 // 2. Equality checks: `(val & mask) == expected`, where:
1815 uint32_t mask = mand.right().ResolvedValue();
1817 if ((masked_value & ~mask) != 0) return {};
1820 NodeProperties::GetValueInput(mand.left().node(), 0), mask,
1823 return BitfieldCheck(mand.left().node(), mask, masked_value, false);
1842 uint32_t overlapping_bits = mask & other.mask;
1849 return BitfieldCheck{source, mask | other.mask,
1867 uint32_t mask = 1 << shift.right().ResolvedValue();
1868 return BitfieldCheck{shift.left().node(), mask, mask,
1899 node->ReplaceInput(0, Word32And(source, combined_bitfield->mask));
2361 auto mask = mand.right().ResolvedValue();
2364 if (shift_bits <= base::bits::CountLeadingZeros(mask) &&
2366 mask << shift_bits <= std::numeric_limits<uint32_t>::max()) {
2368 uint32_t new_mask = static_cast<uint32_t>(mask << shift_bits);