4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 #ifndef _LIBCFS_BITMAP_H_
37 #define _LIBCFS_BITMAP_H_
40 #define DIV_ROUND_UP(n, d) (((n) + (d) - 1) / (d))
41 #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, 8 * sizeof(long))
43 #define DECLARE_BITMAP(name, bits) \
44 unsigned long name[BITS_TO_LONGS(bits)]
45 #endif /* !__KERNEL__ */
49 unsigned long data[0];
52 #define CFS_BITMAP_SIZE(nbits) \
53 (((nbits/BITS_PER_LONG)+1)*sizeof(long)+sizeof(cfs_bitmap_t))
56 cfs_bitmap_t *CFS_ALLOCATE_BITMAP(int size)
60 LIBCFS_ALLOC(ptr, CFS_BITMAP_SIZE(size));
69 static inline void CFS_RESET_BITMAP(cfs_bitmap_t *bitmap)
71 if (bitmap->size > 0) {
72 int nbits = bitmap->size;
74 memset(bitmap, 0, CFS_BITMAP_SIZE(nbits));
79 #define CFS_FREE_BITMAP(ptr) LIBCFS_FREE(ptr, CFS_BITMAP_SIZE(ptr->size))
82 void cfs_bitmap_set(cfs_bitmap_t *bitmap, int nbit)
84 set_bit(nbit, bitmap->data);
88 void cfs_bitmap_clear(cfs_bitmap_t *bitmap, int nbit)
90 test_and_clear_bit(nbit, bitmap->data);
94 int cfs_bitmap_check(cfs_bitmap_t *bitmap, int nbit)
96 return test_bit(nbit, bitmap->data);
100 int cfs_bitmap_test_and_clear(cfs_bitmap_t *bitmap, int nbit)
102 return test_and_clear_bit(nbit, bitmap->data);
105 /* return 0 is bitmap has none set bits */
107 int cfs_bitmap_check_empty(cfs_bitmap_t *bitmap)
109 return find_first_bit(bitmap->data, bitmap->size) == bitmap->size;
113 void cfs_bitmap_copy(cfs_bitmap_t *new, cfs_bitmap_t *old)
117 LASSERT(new->size >= old->size);
119 memcpy(new, old, CFS_BITMAP_SIZE(old->size));
123 #define cfs_foreach_bit(bitmap, pos) \
124 for ((pos) = find_first_bit((bitmap)->data, bitmap->size); \
125 (pos) < (bitmap)->size; \
126 (pos) = find_next_bit((bitmap)->data, (bitmap)->size, (pos) + 1))