On Wed, Sep 02, 2015 at 01:34:48PM +0100, Wilco Dijkstra wrote:
> This patch reimplements aarch64_bitmask_imm using bitwise arithmetic rather
> than a slow binary search. The algorithm searches for a sequence of set bits.
> If there are no more set bits and not all bits are set, it is a valid mask.
This patch reimplements aarch64_bitmask_imm using bitwise arithmetic rather
than a slow binary
search. The algorithm searches for a sequence of set bits. If there are no more
set bits and not all
bits are set, it is a valid mask. Otherwise it determines the distance to the
next set bit and
check
