Lines Matching full:bitreverse
1570 /// pieces of a bswap or bitreverse. The subexpression provides a potential
1571 /// piece of a bswap or bitreverse if it can be proven that each non-zero bit in
1576 /// mapping is correct for a bswap or bitreverse.
1665 // the input value to the bswap/bitreverse. To be part of a bswap or
1666 // bitreverse we must be demanding a contiguous range of bits from it.
1681 // together, which isn't a bswap/bitreverse (unless it's an or of the same
1707 /// Given an OR instruction, check to see if this is a bswap or bitreverse
1733 // Now, is the bit permutation correct for a bswap or a bitreverse? We can
1746 Intrin = Intrinsic::bitreverse;
