Lines Matching full:mask
1319 uc16 mask = char_mask ^ exor;
1320 macro_assembler->CheckNotCharacterAfterAnd(c1, mask, on_failure);
1330 uc16 mask = char_mask ^ diff;
1333 mask,
1672 if ((pos->mask & String::kMaxAsciiCharCode) != 0) {
1675 mask_ |= (pos->mask & char_mask) << char_shift;
1695 uint32_t mask = details->mask();
1719 if ((mask & char_mask) == char_mask) need_mask = false;
1720 mask &= char_mask;
1725 if ((mask & 0xffff) == 0xffff) need_mask = false;
1727 if (mask == 0xffffffff) need_mask = false;
1733 assembler->CheckCharacterAfterAnd(value, mask, on_possible_success);
1739 assembler->CheckNotCharacterAfterAnd(value, mask, trace->backtrack());
1752 // mask and value that can be used to test for a quick failure to match.
1794 // and the mask-compare will determine definitely whether we have
1796 pos->mask = char_mask;
1808 // our mask and compare instruction will determine definitely
1815 pos->mask = common_bits;
1819 // Don't ignore case. Nice simple case where the mask-compare will
1822 pos->mask = char_mask;
1838 // A quick check uses multi-character mask and compare. There is no
1840 // so we just conservatively create a mask and value that will always
1842 pos->mask = 0;
1861 // A mask and compare is only perfect if the differing bits form a
1875 // Here we are combining more ranges into the mask and compare
1876 // value. With each new range the mask becomes more sparse and
1879 // mask and compare operation.
1889 pos->mask = common_bits;
1909 positions_[i].mask = 0;
1927 positions_[i].mask = 0;
1950 if (pos->mask != other_pos->mask ||
1953 // Our mask-compare operation will be approximate unless we have the
1957 pos->mask &= other_pos->mask;
1958 pos->value &= pos->mask;
1959 other_pos->value &= pos->mask;
1961 pos->mask &= ~differing_bits;
1962 pos->value &= pos->mask;
2282 // check can have involved a mask and compare operation which may simplify
2448 // characters by means of mask and compare.
2617 * We generate quick checks that do a mask and compare to eliminate a
