File Manager

003 File Manager

Current Path: /usr/src/sys/compat/linuxkpi/common/include/linux

usr / src / sys / compat / linuxkpi / common / include / linux /

📁 ..
📄 acpi.h(1.72 KB)
📄 atomic.h(1.5 KB)
📄 backlight.h(2.88 KB)
📄 bitfield.h(3.2 KB)
📄 bitmap.h(8.2 KB)
📄 bitops.h(9.41 KB)
📄 bottom_half.h(1.49 KB)
📄 cache.h(1.61 KB)
📄 cdev.h(3.77 KB)
📄 clocksource.h(1.63 KB)
📄 compat.h(2.07 KB)
📄 compiler.h(3.56 KB)
📄 completion.h(2.68 KB)
📄 dcache.h(1.64 KB)
📄 debugfs.h(1.96 KB)
📄 delay.h(2.25 KB)
📄 device.h(15.33 KB)
📄 dma-attrs.h(2.12 KB)
📄 dma-mapping.h(8.88 KB)
📄 dmapool.h(2.77 KB)
📄 dmi.h(2 KB)
📄 err.h(2.23 KB)
📄 errno.h(2.18 KB)
📄 etherdevice.h(2.91 KB)
📄 export.h(1.44 KB)
📄 file.h(4.46 KB)
📄 firmware.h(3.27 KB)
📄 fs.h(8.19 KB)
📄 gcd.h(1.7 KB)
📄 gfp.h(4.7 KB)
📄 hardirq.h(1.7 KB)
📄 hrtimer.h(3.04 KB)
📄 idr.h(4.61 KB)
📄 if_arp.h(1.62 KB)
📄 if_ether.h(2.12 KB)
📄 if_vlan.h(1.96 KB)
📄 in.h(1.87 KB)
📄 in6.h(1.54 KB)
📄 inetdevice.h(2.79 KB)
📄 interrupt.h(5.63 KB)
📄 io-mapping.h(3.05 KB)
📄 io.h(10.36 KB)
📄 ioctl.h(1.59 KB)
📄 irq_work.h(2.21 KB)
📄 irqreturn.h(1.56 KB)
📄 jhash.h(3.2 KB)
📄 jiffies.h(4.36 KB)
📄 kdev_t.h(1.76 KB)
📄 kernel.h(16.91 KB)
📄 kmod.h(1.89 KB)
📄 kobject.h(4.23 KB)
📄 kref.h(3.16 KB)
📄 kthread.h(2.84 KB)
📄 ktime.h(5.12 KB)
📄 list.h(12.2 KB)
📄 llist.h(2.25 KB)
📄 lockdep.h(2.99 KB)
📄 log2.h(3.96 KB)
📄 math64.h(2.7 KB)
📄 miscdevice.h(2.42 KB)
📄 mm.h(6.73 KB)
📄 mm_types.h(2.33 KB)
📄 mod_devicetable.h(2.25 KB)
📄 module.h(3.22 KB)
📄 moduleparam.h(5.26 KB)
📄 mutex.h(4.6 KB)
📄 net.h(2.42 KB)
📄 net_dim.h(9.87 KB)
📄 netdevice.h(3.85 KB)
📄 notifier.h(1.97 KB)
📄 numa.h(1.52 KB)
📄 overflow.h(2.13 KB)
📄 page.h(3.28 KB)
📄 pagemap.h(1.63 KB)
📄 pci.h(29.63 KB)
📄 pfn.h(1.75 KB)
📄 pfn_t.h(1.9 KB)
📄 pid.h(2.17 KB)
📄 pm.h(2.01 KB)
📄 poll.h(1.86 KB)
📄 power_supply.h(1.66 KB)
📄 preempt.h(1.69 KB)
📄 prefetch.h(1.55 KB)
📄 printk.h(4.08 KB)
📄 radix-tree.h(3.13 KB)
📄 random.h(2.04 KB)
📄 rbtree.h(3.37 KB)
📄 rculist.h(4.11 KB)
📄 rcupdate.h(3.66 KB)
📄 refcount.h(2.3 KB)
📄 rwlock.h(2.55 KB)
📄 rwsem.h(3.06 KB)
📄 scatterlist.h(12.58 KB)
📄 sched.h(5.91 KB)
📄 semaphore.h(2.36 KB)
📄 seq_file.h(3.03 KB)
📄 shmem_fs.h(2.26 KB)
📄 shrinker.h(2.04 KB)
📄 sizes.h(1.92 KB)
📄 slab.h(6.19 KB)
📄 smp.h(1.57 KB)
📄 socket.h(2.17 KB)
📄 spinlock.h(4.29 KB)
📄 srcu.h(2.02 KB)
📄 string.h(3.83 KB)
📄 swap.h(1.68 KB)
📄 sysfs.h(7.54 KB)
📄 time.h(3.17 KB)
📄 timer.h(3.21 KB)
📄 types.h(2.82 KB)
📄 uaccess.h(3.26 KB)
📄 usb.h(11.33 KB)
📄 vmalloc.h(1.72 KB)
📄 wait.h(9.41 KB)
📄 wait_bit.h(2.03 KB)
📄 workqueue.h(7.58 KB)
📄 ww_mutex.h(3.74 KB)
📄 xarray.h(3.33 KB)

Editing: bitmap.h

/*
 * Copyright (c) 2013-2017 Mellanox Technologies, Ltd.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice unmodified, this list of conditions, and the following
 *    disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * $FreeBSD$
 */

#ifndef _LINUX_BITMAP_H_
#define	_LINUX_BITMAP_H_

#include <linux/bitops.h>
#include <linux/slab.h>

static inline void
bitmap_zero(unsigned long *addr, const unsigned int size)
{
	memset(addr, 0, BITS_TO_LONGS(size) * sizeof(long));
}

static inline void
bitmap_fill(unsigned long *addr, const unsigned int size)
{
	const unsigned int tail = size & (BITS_PER_LONG - 1);

memset(addr, 0xff, BIT_WORD(size) * sizeof(long));

if (tail)
		addr[BIT_WORD(size)] = BITMAP_LAST_WORD_MASK(tail);
}

static inline int
bitmap_full(unsigned long *addr, const unsigned int size)
{
	const unsigned int end = BIT_WORD(size);
	const unsigned int tail = size & (BITS_PER_LONG - 1);
	unsigned int i;

for (i = 0; i != end; i++) {
		if (addr[i] != ~0UL)
			return (0);
	}

if (tail) {
		const unsigned long mask = BITMAP_LAST_WORD_MASK(tail);

if ((addr[end] & mask) != mask)
			return (0);
	}
	return (1);
}

static inline int
bitmap_empty(unsigned long *addr, const unsigned int size)
{
	const unsigned int end = BIT_WORD(size);
	const unsigned int tail = size & (BITS_PER_LONG - 1);
	unsigned int i;

for (i = 0; i != end; i++) {
		if (addr[i] != 0)
			return (0);
	}

if (tail) {
		const unsigned long mask = BITMAP_LAST_WORD_MASK(tail);

if ((addr[end] & mask) != 0)
			return (0);
	}
	return (1);
}

static inline void
bitmap_set(unsigned long *map, unsigned int start, int nr)
{
	const unsigned int size = start + nr;
	int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
	unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start);

map += BIT_WORD(start);

while (nr - bits_to_set >= 0) {
		*map |= mask_to_set;
		nr -= bits_to_set;
		bits_to_set = BITS_PER_LONG;
		mask_to_set = ~0UL;
		map++;
	}

if (nr) {
		mask_to_set &= BITMAP_LAST_WORD_MASK(size);
		*map |= mask_to_set;
	}
}

static inline void
bitmap_clear(unsigned long *map, unsigned int start, int nr)
{
	const unsigned int size = start + nr;
	int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
	unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start);

map += BIT_WORD(start);

while (nr - bits_to_clear >= 0) {
		*map &= ~mask_to_clear;
		nr -= bits_to_clear;
		bits_to_clear = BITS_PER_LONG;
		mask_to_clear = ~0UL;
		map++;
	}

if (nr) {
		mask_to_clear &= BITMAP_LAST_WORD_MASK(size);
		*map &= ~mask_to_clear;
	}
}

static inline unsigned int
bitmap_find_next_zero_area_off(const unsigned long *map,
    const unsigned int size, unsigned int start,
    unsigned int nr, unsigned int align_mask,
    unsigned int align_offset)
{
	unsigned int index;
	unsigned int end;
	unsigned int i;

retry:
	index = find_next_zero_bit(map, size, start);

index = (((index + align_offset) + align_mask) & ~align_mask) - align_offset;

end = index + nr;
	if (end > size)
		return (end);

i = find_next_bit(map, end, index);
	if (i < end) {
		start = i + 1;
		goto retry;
	}
	return (index);
}

static inline unsigned int
bitmap_find_next_zero_area(const unsigned long *map,
    const unsigned int size, unsigned int start,
    unsigned int nr, unsigned int align_mask)
{
	return (bitmap_find_next_zero_area_off(map, size,
	    start, nr, align_mask, 0));
}

static inline int
bitmap_find_free_region(unsigned long *bitmap, int bits, int order)
{
	int pos;
	int end;

for (pos = 0; (end = pos + (1 << order)) <= bits; pos = end) {
		if (!linux_reg_op(bitmap, pos, order, REG_OP_ISFREE))
			continue;
		linux_reg_op(bitmap, pos, order, REG_OP_ALLOC);
		return (pos);
	}
	return (-ENOMEM);
}

static inline int
bitmap_allocate_region(unsigned long *bitmap, int pos, int order)
{
	if (!linux_reg_op(bitmap, pos, order, REG_OP_ISFREE))
		return (-EBUSY);
	linux_reg_op(bitmap, pos, order, REG_OP_ALLOC);
	return (0);
}

static inline void
bitmap_release_region(unsigned long *bitmap, int pos, int order)
{
	linux_reg_op(bitmap, pos, order, REG_OP_RELEASE);
}

static inline unsigned int
bitmap_weight(unsigned long *addr, const unsigned int size)
{
	const unsigned int end = BIT_WORD(size);
	const unsigned int tail = size & (BITS_PER_LONG - 1);
	unsigned int retval = 0;
	unsigned int i;

for (i = 0; i != end; i++)
		retval += hweight_long(addr[i]);

if (tail) {
		const unsigned long mask = BITMAP_LAST_WORD_MASK(tail);

retval += hweight_long(addr[end] & mask);
	}
	return (retval);
}

static inline int
bitmap_equal(const unsigned long *pa,
    const unsigned long *pb, unsigned size)
{
	const unsigned int end = BIT_WORD(size);
	const unsigned int tail = size & (BITS_PER_LONG - 1);
	unsigned int i;

for (i = 0; i != end; i++) {
		if (pa[i] != pb[i])
			return (0);
	}

if (tail) {
		const unsigned long mask = BITMAP_LAST_WORD_MASK(tail);

if ((pa[end] ^ pb[end]) & mask)
			return (0);
	}
	return (1);
}

static inline int
bitmap_subset(const unsigned long *pa,
    const unsigned long *pb, unsigned size)
{
	const unsigned end = BIT_WORD(size);
	const unsigned tail = size & (BITS_PER_LONG - 1);
	unsigned i;

for (i = 0; i != end; i++) {
		if (pa[i] & ~pb[i])
			return (0);
	}

if (tail) {
		const unsigned long mask = BITMAP_LAST_WORD_MASK(tail);

if (pa[end] & ~pb[end] & mask)
			return (0);
	}
	return (1);
}

static inline void
bitmap_complement(unsigned long *dst, const unsigned long *src,
    const unsigned int size)
{
	const unsigned int end = BITS_TO_LONGS(size);
	unsigned int i;

for (i = 0; i != end; i++)
		dst[i] = ~src[i];
}

static inline void
bitmap_copy(unsigned long *dst, const unsigned long *src,
    const unsigned int size)
{
	const unsigned int end = BITS_TO_LONGS(size);
	unsigned int i;

for (i = 0; i != end; i++)
		dst[i] = src[i];
}

static inline void
bitmap_or(unsigned long *dst, const unsigned long *src1,
    const unsigned long *src2, const unsigned int size)
{
	const unsigned int end = BITS_TO_LONGS(size);
	unsigned int i;

for (i = 0; i != end; i++)
		dst[i] = src1[i] | src2[i];
}

static inline void
bitmap_and(unsigned long *dst, const unsigned long *src1,
    const unsigned long *src2, const unsigned int size)
{
	const unsigned int end = BITS_TO_LONGS(size);
	unsigned int i;

for (i = 0; i != end; i++)
		dst[i] = src1[i] & src2[i];
}

static inline void
bitmap_andnot(unsigned long *dst, const unsigned long *src1,
    const unsigned long *src2, const unsigned int size)
{
	const unsigned int end = BITS_TO_LONGS(size);
	unsigned int i;

for (i = 0; i != end; i++)
		dst[i] = src1[i] & ~src2[i];
}

static inline void
bitmap_xor(unsigned long *dst, const unsigned long *src1,
    const unsigned long *src2, const unsigned int size)
{
	const unsigned int end = BITS_TO_LONGS(size);
	unsigned int i;

for (i = 0; i != end; i++)
		dst[i] = src1[i] ^ src2[i];
}

static inline unsigned long *
bitmap_alloc(unsigned int size, gfp_t flags)
{
	return (kmalloc_array(BITS_TO_LONGS(size),
	    sizeof(unsigned long), flags));
}

static inline unsigned long *
bitmap_zalloc(unsigned int size, gfp_t flags)
{
	return (bitmap_alloc(size, flags | __GFP_ZERO));
}

static inline void
bitmap_free(const unsigned long *bitmap)
{
	kfree(bitmap);
}

#endif					/* _LINUX_BITMAP_H_ */

003 File Manager

Editing: bitmap.h

Upload File

Create Folder