lib: move find_last_bit to lib/find_next_bit.c

obj-y += bcd.o div64.o sort.o parser.o halfmd4.o debug_locks.o random32.o \

	 bust_spinlocks.o kasprintf.o bitmap.o scatterlist.o \

	 gcd.o lcm.o list_sort.o uuid.o flex_array.o iov_iter.o clz_ctz.o \

	 bsearch.o find_last_bit.o find_next_bit.o llist.o memweight.o kfifo.o \

	 bsearch.o find_next_bit.o llist.o memweight.o kfifo.o \

	 percpu-refcount.o percpu_ida.o rhashtable.o reciprocal_div.o

obj-y += string_helpers.o

obj-$(CONFIG_TEST_STRING_HELPERS) += test-string_helpers.o

/* find_next_bit.c: fallback find next bit implementation

/* bit search implementation

 *

 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.

 * Written by David Howells (dhowells@redhat.com)

 *

 * Copyright (C) 2008 IBM Corporation

 * 'find_last_bit' is written by Rusty Russell <rusty@rustcorp.com.au>

 * (Inspired by David Howell's find_next_bit implementation)

 *

 * Rewritten by Yury Norov <yury.norov@gmail.com> to decrease

 * size and improve performance, 2015.

 *

 */

#include <linux/bitops.h>

#include <linux/bitmap.h>

#include <linux/export.h>

#include <linux/kernel.h>

EXPORT_SYMBOL(find_first_zero_bit);

#endif

#ifndef find_last_bit

unsigned long find_last_bit(const unsigned long *addr, unsigned long size)

{

	if (size) {

		unsigned long val = BITMAP_LAST_WORD_MASK(size);

		unsigned long idx = (size-1) / BITS_PER_LONG;

		do {

			val &= addr[idx];

			if (val)

				return idx * BITS_PER_LONG + __fls(val);

			val = ~0ul;

		} while (idx--);

	}

	return size;

}

EXPORT_SYMBOL(find_last_bit);

#endif

#ifdef __BIG_ENDIAN

/* include/linux/byteorder does not support "unsigned long" type */