Blame view
lib/find_last_bit.c
1.11 KB
ab53d472e bitmap: find_last... |
1 2 3 4 5 6 7 8 9 10 11 12 13 |
/* 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) * * 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> |
8bc3bcc93 lib: reduce the u... |
14 |
#include <linux/export.h> |
ab53d472e bitmap: find_last... |
15 16 |
#include <asm/types.h> #include <asm/byteorder.h> |
19de85ef5 bitops: add #ifnd... |
17 |
#ifndef find_last_bit |
ab53d472e bitmap: find_last... |
18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 |
unsigned long find_last_bit(const unsigned long *addr, unsigned long size) { unsigned long words; unsigned long tmp; /* Start at final word. */ words = size / BITS_PER_LONG; /* Partial final word? */ if (size & (BITS_PER_LONG-1)) { tmp = (addr[words] & (~0UL >> (BITS_PER_LONG - (size & (BITS_PER_LONG-1))))); if (tmp) goto found; } while (words) { tmp = addr[--words]; if (tmp) { found: return words * BITS_PER_LONG + __fls(tmp); } } /* Not found */ return size; } EXPORT_SYMBOL(find_last_bit); |
19de85ef5 bitops: add #ifnd... |
46 47 |
#endif |