On Wed, 8 Jun 2016 13:42:12 -0700
Andrew Morton wrote:
> On Tue, 7 Jun 2016 10:37:41 +0200 Martin Schwidefsky
> wrote:
>
> > The bitmap_equal function has optimized code for small bitmaps with less
> > than BITS_PER_LONG bits. For larger
On Wed, 8 Jun 2016 13:42:12 -0700
Andrew Morton wrote:
> On Tue, 7 Jun 2016 10:37:41 +0200 Martin Schwidefsky
> wrote:
>
> > The bitmap_equal function has optimized code for small bitmaps with less
> > than BITS_PER_LONG bits. For larger bitmaps the out-of-line function
> > __bitmap_equal is
On Tue, 7 Jun 2016 10:37:41 +0200 Martin Schwidefsky
wrote:
> The bitmap_equal function has optimized code for small bitmaps with less
> than BITS_PER_LONG bits. For larger bitmaps the out-of-line function
> __bitmap_equal is called.
>
> For a constant number of bits
On Tue, 7 Jun 2016 10:37:41 +0200 Martin Schwidefsky
wrote:
> The bitmap_equal function has optimized code for small bitmaps with less
> than BITS_PER_LONG bits. For larger bitmaps the out-of-line function
> __bitmap_equal is called.
>
> For a constant number of bits divisible by
The bitmap_equal function has optimized code for small bitmaps with less
than BITS_PER_LONG bits. For larger bitmaps the out-of-line function
__bitmap_equal is called.
For a constant number of bits divisible by BITS_PER_LONG the memcmp
function can be used. For s390 gcc knows how to optimize this
The bitmap_equal function has optimized code for small bitmaps with less
than BITS_PER_LONG bits. For larger bitmaps the out-of-line function
__bitmap_equal is called.
For a constant number of bits divisible by BITS_PER_LONG the memcmp
function can be used. For s390 gcc knows how to optimize this
6 matches
Mail list logo