__ __ __ __ _____ _ _ _____ _ _ _ | \/ | \ \ / / | __ \ (_) | | / ____| | | | | | \ / |_ __\ V / | |__) | __ ___ ____ _| |_ ___ | (___ | |__ ___| | | | |\/| | '__|> < | ___/ '__| \ \ / / _` | __/ _ \ \___ \| '_ \ / _ \ | | | | | | |_ / . \ | | | | | |\ V / (_| | || __/ ____) | | | | __/ | | |_| |_|_(_)_/ \_\ |_| |_| |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1 if you need WebShell for Seo everyday contact me on Telegram Telegram Address : @jackleetFor_More_Tools:
/* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_BITMAP_H
#define _TOOLS_LINUX_BITMAP_H
#include <string.h>
#include <linux/align.h>
#include <linux/bitops.h>
#include <linux/find.h>
#include <stdlib.h>
#include <linux/kernel.h>
#define DECLARE_BITMAP(name,bits) \
unsigned long name[BITS_TO_LONGS(bits)]
unsigned int __bitmap_weight(const unsigned long *bitmap, unsigned int bits);
void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
const unsigned long *bitmap2, int bits);
bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
const unsigned long *bitmap2, unsigned int bits);
bool __bitmap_equal(const unsigned long *bitmap1,
const unsigned long *bitmap2, unsigned int bits);
void __bitmap_clear(unsigned long *map, unsigned int start, int len);
bool __bitmap_intersects(const unsigned long *bitmap1,
const unsigned long *bitmap2, unsigned int bits);
#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
#define BITMAP_LAST_WORD_MASK(nbits) (~0UL >> (-(nbits) & (BITS_PER_LONG - 1)))
#define bitmap_size(nbits) (ALIGN(nbits, BITS_PER_LONG) / BITS_PER_BYTE)
static inline void bitmap_zero(unsigned long *dst, unsigned int nbits)
{
if (small_const_nbits(nbits))
*dst = 0UL;
else {
memset(dst, 0, bitmap_size(nbits));
}
}
static inline void bitmap_fill(unsigned long *dst, unsigned int nbits)
{
unsigned int nlongs = BITS_TO_LONGS(nbits);
if (!small_const_nbits(nbits)) {
unsigned int len = (nlongs - 1) * sizeof(unsigned long);
memset(dst, 0xff, len);
}
dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
}
static inline bool bitmap_empty(const unsigned long *src, unsigned int nbits)
{
if (small_const_nbits(nbits))
return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
return find_first_bit(src, nbits) == nbits;
}
static inline bool bitmap_full(const unsigned long *src, unsigned int nbits)
{
if (small_const_nbits(nbits))
return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
return find_first_zero_bit(src, nbits) == nbits;
}
static inline unsigned int bitmap_weight(const unsigned long *src, unsigned int nbits)
{
if (small_const_nbits(nbits))
return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
return __bitmap_weight(src, nbits);
}
static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
const unsigned long *src2, unsigned int nbits)
{
if (small_const_nbits(nbits))
*dst = *src1 | *src2;
else
__bitmap_or(dst, src1, src2, nbits);
}
/**
* bitmap_zalloc - Allocate bitmap
* @nbits: Number of bits
*/
static inline unsigned long *bitmap_zalloc(int nbits)
{
return calloc(1, bitmap_size(nbits));
}
/*
* bitmap_free - Free bitmap
* @bitmap: pointer to bitmap
*/
static inline void bitmap_free(unsigned long *bitmap)
{
free(bitmap);
}
/*
* bitmap_scnprintf - print bitmap list into buffer
* @bitmap: bitmap
* @nbits: size of bitmap
* @buf: buffer to store output
* @size: size of @buf
*/
size_t bitmap_scnprintf(unsigned long *bitmap, unsigned int nbits,
char *buf, size_t size);
/**
* bitmap_and - Do logical and on bitmaps
* @dst: resulting bitmap
* @src1: operand 1
* @src2: operand 2
* @nbits: size of bitmap
*/
static inline bool bitmap_and(unsigned long *dst, const unsigned long *src1,
const unsigned long *src2, unsigned int nbits)
{
if (small_const_nbits(nbits))
return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0;
return __bitmap_and(dst, src1, src2, nbits);
}
#ifdef __LITTLE_ENDIAN
#define BITMAP_MEM_ALIGNMENT 8
#else
#define BITMAP_MEM_ALIGNMENT (8 * sizeof(unsigned long))
#endif
#define BITMAP_MEM_MASK (BITMAP_MEM_ALIGNMENT - 1)
static inline bool bitmap_equal(const unsigned long *src1,
const unsigned long *src2, unsigned int nbits)
{
if (small_const_nbits(nbits))
return !((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
if (__builtin_constant_p(nbits & BITMAP_MEM_MASK) &&
IS_ALIGNED(nbits, BITMAP_MEM_ALIGNMENT))
return !memcmp(src1, src2, nbits / 8);
return __bitmap_equal(src1, src2, nbits);
}
static inline bool bitmap_intersects(const unsigned long *src1,
const unsigned long *src2,
unsigned int nbits)
{
if (small_const_nbits(nbits))
return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
else
return __bitmap_intersects(src1, src2, nbits);
}
static inline void bitmap_clear(unsigned long *map, unsigned int start,
unsigned int nbits)
{
if (__builtin_constant_p(nbits) && nbits == 1)
__clear_bit(start, map);
else if (small_const_nbits(start + nbits))
*map &= ~GENMASK(start + nbits - 1, start);
else if (__builtin_constant_p(start & BITMAP_MEM_MASK) &&
IS_ALIGNED(start, BITMAP_MEM_ALIGNMENT) &&
__builtin_constant_p(nbits & BITMAP_MEM_MASK) &&
IS_ALIGNED(nbits, BITMAP_MEM_ALIGNMENT))
memset((char *)map + start / 8, 0, nbits / 8);
else
__bitmap_clear(map, start, nbits);
}
#endif /* _TOOLS_LINUX_BITMAP_H */
| Name | Type | Size | Permission | Actions |
|---|---|---|---|---|
| sched | Folder | 0755 |
|
|
| unaligned | Folder | 0755 |
|
|
| align.h | File | 339 B | 0644 |
|
| arm-smccc.h | File | 5.63 KB | 0644 |
|
| atomic.h | File | 363 B | 0644 |
|
| bitfield.h | File | 5.33 KB | 0644 |
|
| bitmap.h | File | 4.82 KB | 0644 |
|
| bitops.h | File | 2.15 KB | 0644 |
|
| bits.h | File | 1.17 KB | 0644 |
|
| btf_ids.h | File | 5.97 KB | 0644 |
|
| bug.h | File | 442 B | 0644 |
|
| build_bug.h | File | 3.04 KB | 0644 |
|
| compiler-gcc.h | File | 1.24 KB | 0644 |
|
| compiler.h | File | 5.82 KB | 0644 |
|
| compiler_types.h | File | 1.09 KB | 0644 |
|
| const.h | File | 421 B | 0644 |
|
| coresight-pmu.h | File | 2.32 KB | 0644 |
|
| ctype.h | File | 1.9 KB | 0644 |
|
| debug_locks.h | File | 288 B | 0644 |
|
| delay.h | File | 117 B | 0644 |
|
| err.h | File | 1.99 KB | 0644 |
|
| export.h | File | 129 B | 0644 |
|
| filter.h | File | 9.59 KB | 0644 |
|
| find.h | File | 5.77 KB | 0644 |
|
| ftrace.h | File | 120 B | 0644 |
|
| gfp.h | File | 322 B | 0644 |
|
| gfp_types.h | File | 46 B | 0644 |
|
| hardirq.h | File | 280 B | 0644 |
|
| hash.h | File | 2.93 KB | 0644 |
|
| hashtable.h | File | 4.44 KB | 0644 |
|
| interrupt.h | File | 129 B | 0644 |
|
| interval_tree_generic.h | File | 6.7 KB | 0644 |
|
| irqflags.h | File | 1.37 KB | 0644 |
|
| jhash.h | File | 4.46 KB | 0644 |
|
| kallsyms.h | File | 646 B | 0644 |
|
| kconfig.h | File | 2.39 KB | 0644 |
|
| kern_levels.h | File | 954 B | 0644 |
|
| kernel.h | File | 2.64 KB | 0644 |
|
| linkage.h | File | 123 B | 0644 |
|
| list.h | File | 22.48 KB | 0644 |
|
| list_sort.h | File | 374 B | 0644 |
|
| lockdep.h | File | 1.43 KB | 0644 |
|
| log2.h | File | 4.46 KB | 0644 |
|
| math.h | File | 764 B | 0644 |
|
| math64.h | File | 1.22 KB | 0644 |
|
| module.h | File | 270 B | 0644 |
|
| mutex.h | File | 117 B | 0644 |
|
| nmi.h | File | 0 B | 0644 |
|
| numa.h | File | 292 B | 0644 |
|
| objtool_types.h | File | 1.8 KB | 0644 |
|
| overflow.h | File | 4.11 KB | 0644 |
|
| poison.h | File | 2.5 KB | 0644 |
|
| proc_fs.h | File | 123 B | 0644 |
|
| rbtree.h | File | 9.32 KB | 0644 |
|
| rbtree_augmented.h | File | 9.34 KB | 0644 |
|
| rcu.h | File | 437 B | 0644 |
|
| refcount.h | File | 4.11 KB | 0644 |
|
| ring_buffer.h | File | 2.4 KB | 0644 |
|
| rwsem.h | File | 920 B | 0644 |
|
| seq_file.h | File | 126 B | 0644 |
|
| sizes.h | File | 1.12 KB | 0644 |
|
| slab.h | File | 1.17 KB | 0644 |
|
| spinlock.h | File | 1.24 KB | 0644 |
|
| stacktrace.h | File | 678 B | 0644 |
|
| static_call_types.h | File | 2.74 KB | 0644 |
|
| string.h | File | 1.4 KB | 0644 |
|
| stringify.h | File | 380 B | 0644 |
|
| time64.h | File | 347 B | 0644 |
|
| types.h | File | 1.72 KB | 0644 |
|
| zalloc.h | File | 252 B | 0644 |
|