2005-04-17 00:20:36 +02:00
|
|
|
#ifndef __LINUX_BITMAP_H
|
|
|
|
#define __LINUX_BITMAP_H
|
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/bitops.h>
|
|
|
|
#include <linux/string.h>
|
2007-10-19 08:40:37 +02:00
|
|
|
#include <linux/kernel.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* bitmaps provide bit arrays that consume one or more unsigned
|
|
|
|
* longs. The bitmap interface and available operations are listed
|
|
|
|
* here, in bitmap.h
|
|
|
|
*
|
|
|
|
* Function implementations generic to all architectures are in
|
|
|
|
* lib/bitmap.c. Functions implementations that are architecture
|
|
|
|
* specific are in various include/asm-<arch>/bitops.h headers
|
|
|
|
* and other arch/<arch> specific files.
|
|
|
|
*
|
|
|
|
* See lib/bitmap.c for more details.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The available bitmap operations and their rough meaning in the
|
|
|
|
* case that the bitmap is a single unsigned long are thus:
|
|
|
|
*
|
2006-06-26 13:57:10 +02:00
|
|
|
* Note that nbits should be always a compile time evaluable constant.
|
|
|
|
* Otherwise many inlines will generate horrible code.
|
|
|
|
*
|
2005-04-17 00:20:36 +02:00
|
|
|
* bitmap_zero(dst, nbits) *dst = 0UL
|
|
|
|
* bitmap_fill(dst, nbits) *dst = ~0UL
|
|
|
|
* bitmap_copy(dst, src, nbits) *dst = *src
|
|
|
|
* bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2
|
|
|
|
* bitmap_or(dst, src1, src2, nbits) *dst = *src1 | *src2
|
|
|
|
* bitmap_xor(dst, src1, src2, nbits) *dst = *src1 ^ *src2
|
|
|
|
* bitmap_andnot(dst, src1, src2, nbits) *dst = *src1 & ~(*src2)
|
|
|
|
* bitmap_complement(dst, src, nbits) *dst = ~(*src)
|
|
|
|
* bitmap_equal(src1, src2, nbits) Are *src1 and *src2 equal?
|
|
|
|
* bitmap_intersects(src1, src2, nbits) Do *src1 and *src2 overlap?
|
|
|
|
* bitmap_subset(src1, src2, nbits) Is *src1 a subset of *src2?
|
|
|
|
* bitmap_empty(src, nbits) Are all bits zero in *src?
|
|
|
|
* bitmap_full(src, nbits) Are all bits set in *src?
|
|
|
|
* bitmap_weight(src, nbits) Hamming Weight: number set bits
|
|
|
|
* bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n
|
|
|
|
* bitmap_shift_left(dst, src, n, nbits) *dst = *src << n
|
2005-10-31 00:02:33 +01:00
|
|
|
* bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src)
|
|
|
|
* bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit)
|
mempolicy: add bitmap_onto() and bitmap_fold() operations
The following adds two more bitmap operators, bitmap_onto() and bitmap_fold(),
with the usual cpumask and nodemask wrappers.
The bitmap_onto() operator computes one bitmap relative to another. If the
n-th bit in the origin mask is set, then the m-th bit of the destination mask
will be set, where m is the position of the n-th set bit in the relative mask.
The bitmap_fold() operator folds a bitmap into a second that has bit m set iff
the input bitmap has some bit n set, where m == n mod sz, for the specified sz
value.
There are two substantive changes between this patch and its
predecessor bitmap_relative:
1) Renamed bitmap_relative() to be bitmap_onto().
2) Added bitmap_fold().
The essential motivation for bitmap_onto() is to provide a mechanism for
converting a cpuset-relative CPU or Node mask to an absolute mask. Cpuset
relative masks are written as if the current task were in a cpuset whose CPUs
or Nodes were just the consecutive ones numbered 0..N-1, for some N. The
bitmap_onto() operator is provided in anticipation of adding support for the
first such cpuset relative mask, by the mbind() and set_mempolicy() system
calls, using a planned flag of MPOL_F_RELATIVE_NODES. These bitmap operators
(and their nodemask wrappers, in particular) will be used in code that
converts the user specified cpuset relative memory policy to a specific system
node numbered policy, given the current mems_allowed of the tasks cpuset.
Such cpuset relative mempolicies will address two deficiencies
of the existing interface between cpusets and mempolicies:
1) A task cannot at present reliably establish a cpuset
relative mempolicy because there is an essential race
condition, in that the tasks cpuset may be changed in
between the time the task can query its cpuset placement,
and the time the task can issue the applicable mbind or
set_memplicy system call.
2) A task cannot at present establish what cpuset relative
mempolicy it would like to have, if it is in a smaller
cpuset than it might have mempolicy preferences for,
because the existing interface only allows specifying
mempolicies for nodes currently allowed by the cpuset.
Cpuset relative mempolicies are useful for tasks that don't distinguish
particularly between one CPU or Node and another, but only between how many of
each are allowed, and the proper placement of threads and memory pages on the
various CPUs and Nodes available.
The motivation for the added bitmap_fold() can be seen in the following
example.
Let's say an application has specified some mempolicies that presume 16 memory
nodes, including say a mempolicy that specified MPOL_F_RELATIVE_NODES (cpuset
relative) nodes 12-15. Then lets say that application is crammed into a
cpuset that only has 8 memory nodes, 0-7. If one just uses bitmap_onto(),
this mempolicy, mapped to that cpuset, would ignore the requested relative
nodes above 7, leaving it empty of nodes. That's not good; better to fold the
higher nodes down, so that some nodes are included in the resulting mapped
mempolicy. In this case, the mempolicy nodes 12-15 are taken modulo 8 (the
weight of the mems_allowed of the confining cpuset), resulting in a mempolicy
specifying nodes 4-7.
Signed-off-by: Paul Jackson <pj@sgi.com>
Signed-off-by: David Rientjes <rientjes@google.com>
Cc: Christoph Lameter <clameter@sgi.com>
Cc: Andi Kleen <ak@suse.de>
Cc: Mel Gorman <mel@csn.ul.ie>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: <kosaki.motohiro@jp.fujitsu.com>
Cc: <ray-lk@madrabbit.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-04-28 11:12:29 +02:00
|
|
|
* bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap
|
|
|
|
* bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz
|
2005-04-17 00:20:36 +02:00
|
|
|
* bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf
|
2006-10-11 10:21:55 +02:00
|
|
|
* bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf
|
|
|
|
* bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf
|
2005-04-17 00:20:36 +02:00
|
|
|
* bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf
|
|
|
|
* bitmap_parselist(buf, dst, nbits) Parse bitmap dst from list
|
2006-03-24 12:15:44 +01:00
|
|
|
* bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region
|
|
|
|
* bitmap_release_region(bitmap, pos, order) Free specified bit region
|
|
|
|
* bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Also the following operations in asm/bitops.h apply to bitmaps.
|
|
|
|
*
|
|
|
|
* set_bit(bit, addr) *addr |= bit
|
|
|
|
* clear_bit(bit, addr) *addr &= ~bit
|
|
|
|
* change_bit(bit, addr) *addr ^= bit
|
|
|
|
* test_bit(bit, addr) Is bit set in *addr?
|
|
|
|
* test_and_set_bit(bit, addr) Set bit and return old value
|
|
|
|
* test_and_clear_bit(bit, addr) Clear bit and return old value
|
|
|
|
* test_and_change_bit(bit, addr) Change bit and return old value
|
|
|
|
* find_first_zero_bit(addr, nbits) Position first zero bit in *addr
|
|
|
|
* find_first_bit(addr, nbits) Position first set bit in *addr
|
|
|
|
* find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit
|
|
|
|
* find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used
|
|
|
|
* to declare an array named 'name' of just enough unsigned longs to
|
|
|
|
* contain all bit positions from 0 to 'bits' - 1.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* lib/bitmap.c provides these functions:
|
|
|
|
*/
|
|
|
|
|
|
|
|
extern int __bitmap_empty(const unsigned long *bitmap, int bits);
|
|
|
|
extern int __bitmap_full(const unsigned long *bitmap, int bits);
|
|
|
|
extern int __bitmap_equal(const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
|
|
|
|
int bits);
|
|
|
|
extern void __bitmap_shift_right(unsigned long *dst,
|
|
|
|
const unsigned long *src, int shift, int bits);
|
|
|
|
extern void __bitmap_shift_left(unsigned long *dst,
|
|
|
|
const unsigned long *src, int shift, int bits);
|
|
|
|
extern void __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern void __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern int __bitmap_intersects(const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern int __bitmap_subset(const unsigned long *bitmap1,
|
|
|
|
const unsigned long *bitmap2, int bits);
|
|
|
|
extern int __bitmap_weight(const unsigned long *bitmap, int bits);
|
|
|
|
|
|
|
|
extern int bitmap_scnprintf(char *buf, unsigned int len,
|
|
|
|
const unsigned long *src, int nbits);
|
2006-10-11 10:21:55 +02:00
|
|
|
extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
|
|
|
|
unsigned long *dst, int nbits);
|
|
|
|
extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long *dst, int nbits);
|
|
|
|
extern int bitmap_scnlistprintf(char *buf, unsigned int len,
|
|
|
|
const unsigned long *src, int nbits);
|
|
|
|
extern int bitmap_parselist(const char *buf, unsigned long *maskp,
|
|
|
|
int nmaskbits);
|
2005-10-31 00:02:33 +01:00
|
|
|
extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
|
|
|
|
const unsigned long *old, const unsigned long *new, int bits);
|
|
|
|
extern int bitmap_bitremap(int oldbit,
|
|
|
|
const unsigned long *old, const unsigned long *new, int bits);
|
mempolicy: add bitmap_onto() and bitmap_fold() operations
The following adds two more bitmap operators, bitmap_onto() and bitmap_fold(),
with the usual cpumask and nodemask wrappers.
The bitmap_onto() operator computes one bitmap relative to another. If the
n-th bit in the origin mask is set, then the m-th bit of the destination mask
will be set, where m is the position of the n-th set bit in the relative mask.
The bitmap_fold() operator folds a bitmap into a second that has bit m set iff
the input bitmap has some bit n set, where m == n mod sz, for the specified sz
value.
There are two substantive changes between this patch and its
predecessor bitmap_relative:
1) Renamed bitmap_relative() to be bitmap_onto().
2) Added bitmap_fold().
The essential motivation for bitmap_onto() is to provide a mechanism for
converting a cpuset-relative CPU or Node mask to an absolute mask. Cpuset
relative masks are written as if the current task were in a cpuset whose CPUs
or Nodes were just the consecutive ones numbered 0..N-1, for some N. The
bitmap_onto() operator is provided in anticipation of adding support for the
first such cpuset relative mask, by the mbind() and set_mempolicy() system
calls, using a planned flag of MPOL_F_RELATIVE_NODES. These bitmap operators
(and their nodemask wrappers, in particular) will be used in code that
converts the user specified cpuset relative memory policy to a specific system
node numbered policy, given the current mems_allowed of the tasks cpuset.
Such cpuset relative mempolicies will address two deficiencies
of the existing interface between cpusets and mempolicies:
1) A task cannot at present reliably establish a cpuset
relative mempolicy because there is an essential race
condition, in that the tasks cpuset may be changed in
between the time the task can query its cpuset placement,
and the time the task can issue the applicable mbind or
set_memplicy system call.
2) A task cannot at present establish what cpuset relative
mempolicy it would like to have, if it is in a smaller
cpuset than it might have mempolicy preferences for,
because the existing interface only allows specifying
mempolicies for nodes currently allowed by the cpuset.
Cpuset relative mempolicies are useful for tasks that don't distinguish
particularly between one CPU or Node and another, but only between how many of
each are allowed, and the proper placement of threads and memory pages on the
various CPUs and Nodes available.
The motivation for the added bitmap_fold() can be seen in the following
example.
Let's say an application has specified some mempolicies that presume 16 memory
nodes, including say a mempolicy that specified MPOL_F_RELATIVE_NODES (cpuset
relative) nodes 12-15. Then lets say that application is crammed into a
cpuset that only has 8 memory nodes, 0-7. If one just uses bitmap_onto(),
this mempolicy, mapped to that cpuset, would ignore the requested relative
nodes above 7, leaving it empty of nodes. That's not good; better to fold the
higher nodes down, so that some nodes are included in the resulting mapped
mempolicy. In this case, the mempolicy nodes 12-15 are taken modulo 8 (the
weight of the mems_allowed of the confining cpuset), resulting in a mempolicy
specifying nodes 4-7.
Signed-off-by: Paul Jackson <pj@sgi.com>
Signed-off-by: David Rientjes <rientjes@google.com>
Cc: Christoph Lameter <clameter@sgi.com>
Cc: Andi Kleen <ak@suse.de>
Cc: Mel Gorman <mel@csn.ul.ie>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: <kosaki.motohiro@jp.fujitsu.com>
Cc: <ray-lk@madrabbit.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-04-28 11:12:29 +02:00
|
|
|
extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
|
|
|
|
const unsigned long *relmap, int bits);
|
|
|
|
extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
|
|
|
|
int sz, int bits);
|
2005-04-17 00:20:36 +02:00
|
|
|
extern int bitmap_find_free_region(unsigned long *bitmap, int bits, int order);
|
|
|
|
extern void bitmap_release_region(unsigned long *bitmap, int pos, int order);
|
|
|
|
extern int bitmap_allocate_region(unsigned long *bitmap, int pos, int order);
|
|
|
|
|
|
|
|
#define BITMAP_LAST_WORD_MASK(nbits) \
|
|
|
|
( \
|
|
|
|
((nbits) % BITS_PER_LONG) ? \
|
|
|
|
(1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
|
|
|
|
)
|
|
|
|
|
|
|
|
static inline void bitmap_zero(unsigned long *dst, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = 0UL;
|
|
|
|
else {
|
|
|
|
int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
|
|
|
|
memset(dst, 0, len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_fill(unsigned long *dst, int nbits)
|
|
|
|
{
|
|
|
|
size_t nlongs = BITS_TO_LONGS(nbits);
|
|
|
|
if (nlongs > 1) {
|
|
|
|
int len = (nlongs - 1) * sizeof(unsigned long);
|
|
|
|
memset(dst, 0xff, len);
|
|
|
|
}
|
|
|
|
dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
|
|
|
|
int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = *src;
|
|
|
|
else {
|
|
|
|
int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
|
|
|
|
memcpy(dst, src, len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_and(unsigned long *dst, const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = *src1 & *src2;
|
|
|
|
else
|
|
|
|
__bitmap_and(dst, src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = *src1 | *src2;
|
|
|
|
else
|
|
|
|
__bitmap_or(dst, src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = *src1 ^ *src2;
|
|
|
|
else
|
|
|
|
__bitmap_xor(dst, src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_andnot(unsigned long *dst, const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = *src1 & ~(*src2);
|
|
|
|
else
|
|
|
|
__bitmap_andnot(dst, src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
|
|
|
|
int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = ~(*src) & BITMAP_LAST_WORD_MASK(nbits);
|
|
|
|
else
|
|
|
|
__bitmap_complement(dst, src, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int bitmap_equal(const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
|
|
|
|
else
|
|
|
|
return __bitmap_equal(src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int bitmap_intersects(const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
|
|
|
|
else
|
|
|
|
return __bitmap_intersects(src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int bitmap_subset(const unsigned long *src1,
|
|
|
|
const unsigned long *src2, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
|
|
|
|
else
|
|
|
|
return __bitmap_subset(src1, src2, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int bitmap_empty(const unsigned long *src, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
|
|
|
|
else
|
|
|
|
return __bitmap_empty(src, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int bitmap_full(const unsigned long *src, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
|
|
|
|
else
|
|
|
|
return __bitmap_full(src, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int bitmap_weight(const unsigned long *src, int nbits)
|
|
|
|
{
|
2006-06-26 13:57:10 +02:00
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
|
2005-04-17 00:20:36 +02:00
|
|
|
return __bitmap_weight(src, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_shift_right(unsigned long *dst,
|
|
|
|
const unsigned long *src, int n, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = *src >> n;
|
|
|
|
else
|
|
|
|
__bitmap_shift_right(dst, src, n, nbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bitmap_shift_left(unsigned long *dst,
|
|
|
|
const unsigned long *src, int n, int nbits)
|
|
|
|
{
|
|
|
|
if (nbits <= BITS_PER_LONG)
|
|
|
|
*dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits);
|
|
|
|
else
|
|
|
|
__bitmap_shift_left(dst, src, n, nbits);
|
|
|
|
}
|
|
|
|
|
2006-10-11 10:21:55 +02:00
|
|
|
static inline int bitmap_parse(const char *buf, unsigned int buflen,
|
|
|
|
unsigned long *maskp, int nmaskbits)
|
|
|
|
{
|
|
|
|
return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif /* __ASSEMBLY__ */
|
|
|
|
|
|
|
|
#endif /* __LINUX_BITMAP_H */
|