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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2012, 2014, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 #ifndef _LIBCFS_BITMAP_H_
33 #define _LIBCFS_BITMAP_H_
37 unsigned long data[0];
40 #define CFS_BITMAP_SIZE(nbits) \
41 (((nbits / BITS_PER_LONG) + 1) * sizeof(long) + \
42 sizeof(struct cfs_bitmap))
45 struct cfs_bitmap *CFS_ALLOCATE_BITMAP(int size)
47 struct cfs_bitmap *ptr;
49 LIBCFS_ALLOC(ptr, CFS_BITMAP_SIZE(size));
58 static inline void CFS_RESET_BITMAP(struct cfs_bitmap *bitmap)
60 if (bitmap->size > 0) {
61 int nbits = bitmap->size;
63 memset(bitmap, 0, CFS_BITMAP_SIZE(nbits));
68 #define CFS_FREE_BITMAP(ptr) LIBCFS_FREE(ptr, CFS_BITMAP_SIZE(ptr->size))
71 void cfs_bitmap_set(struct cfs_bitmap *bitmap, int nbit)
73 set_bit(nbit, bitmap->data);
77 void cfs_bitmap_clear(struct cfs_bitmap *bitmap, int nbit)
79 test_and_clear_bit(nbit, bitmap->data);
83 int cfs_bitmap_check(struct cfs_bitmap *bitmap, int nbit)
85 return test_bit(nbit, bitmap->data);
89 int cfs_bitmap_test_and_clear(struct cfs_bitmap *bitmap, int nbit)
91 return test_and_clear_bit(nbit, bitmap->data);
94 /* return 0 is bitmap has none set bits */
96 int cfs_bitmap_check_empty(struct cfs_bitmap *bitmap)
98 return find_first_bit(bitmap->data, bitmap->size) == bitmap->size;
102 void cfs_bitmap_copy(struct cfs_bitmap *new, struct cfs_bitmap *old)
106 LASSERT(new->size >= old->size);
108 memcpy(new, old, CFS_BITMAP_SIZE(old->size));
112 #define cfs_foreach_bit(bitmap, pos) \
113 for ((pos) = find_first_bit((bitmap)->data, bitmap->size); \
114 (pos) < (bitmap)->size; \
115 (pos) = find_next_bit((bitmap)->data, (bitmap)->size, (pos) + 1))