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 [sun.com URL with a
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.
36 #ifndef _LIBCFS_BITMAP_H_
37 #define _LIBCFS_BITMAP_H_
42 unsigned long data[0];
45 #define CFS_BITMAP_SIZE(nbits) \
46 (((nbits/BITS_PER_LONG)+1)*sizeof(long)+sizeof(bitmap_t))
49 bitmap_t *ALLOCATE_BITMAP(int size)
53 OBD_ALLOC(ptr, CFS_BITMAP_SIZE(size));
62 #define FREE_BITMAP(ptr) OBD_FREE(ptr, CFS_BITMAP_SIZE(ptr->size))
65 void cfs_bitmap_set(bitmap_t *bitmap, int nbit)
67 set_bit(nbit, bitmap->data);
71 void cfs_bitmap_clear(bitmap_t *bitmap, int nbit)
73 clear_bit(nbit, bitmap->data);
77 int cfs_bitmap_check(bitmap_t *bitmap, int nbit)
79 return test_bit(nbit, bitmap->data);
82 /* return 0 is bitmap has none set bits */
84 int cfs_bitmap_check_empty(bitmap_t *bitmap)
86 return find_first_bit(bitmap->data, bitmap->size) == bitmap->size;
89 #define cfs_foreach_bit(bitmap, pos) \
90 for((pos)=find_first_bit((bitmap)->data, bitmap->size); \
91 (pos) < (bitmap)->size; \
92 (pos) = find_next_bit((bitmap)->data, (bitmap)->size, (pos)))