2009-01-01 02:42:19 +03:00
|
|
|
/* find_last_bit.c: fallback find next bit implementation
|
|
|
|
*
|
|
|
|
* Copyright (C) 2008 IBM Corporation
|
|
|
|
* Written by Rusty Russell <rusty@rustcorp.com.au>
|
|
|
|
* (Inspired by David Howell's find_next_bit implementation)
|
|
|
|
*
|
2015-04-16 22:43:13 +03:00
|
|
|
* Rewritten by Yury Norov <yury.norov@gmail.com> to decrease
|
|
|
|
* size and improve performance, 2015.
|
|
|
|
*
|
2009-01-01 02:42:19 +03:00
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/bitops.h>
|
2015-04-16 22:43:13 +03:00
|
|
|
#include <linux/bitmap.h>
|
2011-11-17 06:29:17 +04:00
|
|
|
#include <linux/export.h>
|
2015-04-16 22:43:13 +03:00
|
|
|
#include <linux/kernel.h>
|
2009-01-01 02:42:19 +03:00
|
|
|
|
2011-05-27 03:26:09 +04:00
|
|
|
#ifndef find_last_bit
|
|
|
|
|
2009-01-01 02:42:19 +03:00
|
|
|
unsigned long find_last_bit(const unsigned long *addr, unsigned long size)
|
|
|
|
{
|
2015-04-16 22:43:13 +03:00
|
|
|
if (size) {
|
|
|
|
unsigned long val = BITMAP_LAST_WORD_MASK(size);
|
|
|
|
unsigned long idx = (size-1) / BITS_PER_LONG;
|
2009-01-01 02:42:19 +03:00
|
|
|
|
2015-04-16 22:43:13 +03:00
|
|
|
do {
|
|
|
|
val &= addr[idx];
|
|
|
|
if (val)
|
|
|
|
return idx * BITS_PER_LONG + __fls(val);
|
2009-01-01 02:42:19 +03:00
|
|
|
|
2015-04-16 22:43:13 +03:00
|
|
|
val = ~0ul;
|
|
|
|
} while (idx--);
|
2009-01-01 02:42:19 +03:00
|
|
|
}
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(find_last_bit);
|
2011-05-27 03:26:09 +04:00
|
|
|
|
|
|
|
#endif
|