1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
38 #include <libcfs/libcfs.h>
39 #include <libcfs/user-bitops.h>
41 #define OFF_BY_START(start) ((start)/BITS_PER_LONG)
43 unsigned long find_next_bit(unsigned long *addr,
44 unsigned long size, unsigned long offset)
46 unsigned long *word, *last;
47 unsigned long first_bit, bit, base;
49 word = addr + OFF_BY_START(offset);
50 last = addr + OFF_BY_START(size-1);
51 first_bit = offset % BITS_PER_LONG;
52 base = offset - first_bit;
57 int tmp = (*word++) & (~0UL << first_bit);
59 if (bit < BITS_PER_LONG)
62 base += BITS_PER_LONG;
64 while (word <= last) {
70 base += BITS_PER_LONG;
77 unsigned long find_next_zero_bit(unsigned long *addr,
78 unsigned long size, unsigned long offset)
80 unsigned long *word, *last;
81 unsigned long first_bit, bit, base;
83 word = addr + OFF_BY_START(offset);
84 last = addr + OFF_BY_START(size-1);
85 first_bit = offset % BITS_PER_LONG;
86 base = offset - first_bit;
91 int tmp = (*word++) & (~0UL << first_bit);
93 if (bit < BITS_PER_LONG)
96 base += BITS_PER_LONG;
98 while (word <= last) {
104 base += BITS_PER_LONG;