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: bitops.h

/*-
 * Copyright (c) 2010 Isilon Systems, Inc.
 * Copyright (c) 2010 iX Systems, Inc.
 * Copyright (c) 2010 Panasas, Inc.
 * 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_BITOPS_H_
#define	_LINUX_BITOPS_H_

#include <sys/param.h>
#include <sys/types.h>
#include <sys/systm.h>
#include <sys/errno.h>
#include <sys/libkern.h>

#define	BIT(nr)			(1UL << (nr))
#define	BIT_ULL(nr)		(1ULL << (nr))
#ifdef __LP64__
#define	BITS_PER_LONG		64
#else
#define	BITS_PER_LONG		32
#endif

#define	BITS_PER_LONG_LONG	64

#define	BITMAP_FIRST_WORD_MASK(start)	(~0UL << ((start) % BITS_PER_LONG))
#define	BITMAP_LAST_WORD_MASK(n)	(~0UL >> (BITS_PER_LONG - (n)))
#define	BITS_TO_LONGS(n)	howmany((n), BITS_PER_LONG)
#define	BIT_MASK(nr)		(1UL << ((nr) & (BITS_PER_LONG - 1)))
#define	BIT_WORD(nr)		((nr) / BITS_PER_LONG)
#define	GENMASK(h, l)		(((~0UL) >> (BITS_PER_LONG - (h) - 1)) & ((~0UL) << (l)))
#define	GENMASK_ULL(h, l)	(((~0ULL) >> (BITS_PER_LONG_LONG - (h) - 1)) & ((~0ULL) << (l)))
#define	BITS_PER_BYTE		8
#define	BITS_PER_TYPE(t)	(sizeof(t) * BITS_PER_BYTE)

#define	hweight8(x)	bitcount((uint8_t)(x))
#define	hweight16(x)	bitcount16(x)
#define	hweight32(x)	bitcount32(x)
#define	hweight64(x)	bitcount64(x)
#define	hweight_long(x)	bitcountl(x)

static inline int
__ffs(int mask)
{
	return (ffs(mask) - 1);
}

static inline int
__fls(int mask)
{
	return (fls(mask) - 1);
}

static inline int
__ffsl(long mask)
{
	return (ffsl(mask) - 1);
}

static inline int
__flsl(long mask)
{
	return (flsl(mask) - 1);
}

static inline int
fls64(uint64_t mask)
{
	return (flsll(mask));
}

static inline uint32_t
ror32(uint32_t word, unsigned int shift)
{
	return ((word >> shift) | (word << (32 - shift)));
}

#define	ffz(mask)	__ffs(~(mask))

static inline int get_count_order(unsigned int count)
{
        int order;

order = fls(count) - 1;
        if (count & (count - 1))
                order++;
        return order;
}

static inline unsigned long
find_first_bit(const unsigned long *addr, unsigned long size)
{
	long mask;
	int bit;

for (bit = 0; size >= BITS_PER_LONG;
	    size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
		if (*addr == 0)
			continue;
		return (bit + __ffsl(*addr));
	}
	if (size) {
		mask = (*addr) & BITMAP_LAST_WORD_MASK(size);
		if (mask)
			bit += __ffsl(mask);
		else
			bit += size;
	}
	return (bit);
}

static inline unsigned long
find_first_zero_bit(const unsigned long *addr, unsigned long size)
{
	long mask;
	int bit;

for (bit = 0; size >= BITS_PER_LONG;
	    size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
		if (~(*addr) == 0)
			continue;
		return (bit + __ffsl(~(*addr)));
	}
	if (size) {
		mask = ~(*addr) & BITMAP_LAST_WORD_MASK(size);
		if (mask)
			bit += __ffsl(mask);
		else
			bit += size;
	}
	return (bit);
}

static inline unsigned long
find_last_bit(const unsigned long *addr, unsigned long size)
{
	long mask;
	int offs;
	int bit;
	int pos;

pos = size / BITS_PER_LONG;
	offs = size % BITS_PER_LONG;
	bit = BITS_PER_LONG * pos;
	addr += pos;
	if (offs) {
		mask = (*addr) & BITMAP_LAST_WORD_MASK(offs);
		if (mask)
			return (bit + __flsl(mask));
	}
	while (pos--) {
		addr--;
		bit -= BITS_PER_LONG;
		if (*addr)
			return (bit + __flsl(*addr));
	}
	return (size);
}

static inline unsigned long
find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset)
{
	long mask;
	int offs;
	int bit;
	int pos;

if (offset >= size)
		return (size);
	pos = offset / BITS_PER_LONG;
	offs = offset % BITS_PER_LONG;
	bit = BITS_PER_LONG * pos;
	addr += pos;
	if (offs) {
		mask = (*addr) & ~BITMAP_LAST_WORD_MASK(offs);
		if (mask)
			return (bit + __ffsl(mask));
		if (size - bit <= BITS_PER_LONG)
			return (size);
		bit += BITS_PER_LONG;
		addr++;
	}
	for (size -= bit; size >= BITS_PER_LONG;
	    size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
		if (*addr == 0)
			continue;
		return (bit + __ffsl(*addr));
	}
	if (size) {
		mask = (*addr) & BITMAP_LAST_WORD_MASK(size);
		if (mask)
			bit += __ffsl(mask);
		else
			bit += size;
	}
	return (bit);
}

static inline unsigned long
find_next_zero_bit(const unsigned long *addr, unsigned long size,
    unsigned long offset)
{
	long mask;
	int offs;
	int bit;
	int pos;

if (offset >= size)
		return (size);
	pos = offset / BITS_PER_LONG;
	offs = offset % BITS_PER_LONG;
	bit = BITS_PER_LONG * pos;
	addr += pos;
	if (offs) {
		mask = ~(*addr) & ~BITMAP_LAST_WORD_MASK(offs);
		if (mask)
			return (bit + __ffsl(mask));
		if (size - bit <= BITS_PER_LONG)
			return (size);
		bit += BITS_PER_LONG;
		addr++;
	}
	for (size -= bit; size >= BITS_PER_LONG;
	    size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
		if (~(*addr) == 0)
			continue;
		return (bit + __ffsl(~(*addr)));
	}
	if (size) {
		mask = ~(*addr) & BITMAP_LAST_WORD_MASK(size);
		if (mask)
			bit += __ffsl(mask);
		else
			bit += size;
	}
	return (bit);
}

#define	__set_bit(i, a)							\
    atomic_set_long(&((volatile unsigned long *)(a))[BIT_WORD(i)], BIT_MASK(i))

#define	set_bit(i, a)							\
    atomic_set_long(&((volatile unsigned long *)(a))[BIT_WORD(i)], BIT_MASK(i))

#define	__clear_bit(i, a)						\
    atomic_clear_long(&((volatile unsigned long *)(a))[BIT_WORD(i)], BIT_MASK(i))

#define	clear_bit(i, a)							\
    atomic_clear_long(&((volatile unsigned long *)(a))[BIT_WORD(i)], BIT_MASK(i))

#define	clear_bit_unlock(i, a)						\
    atomic_clear_rel_long(&((volatile unsigned long *)(a))[BIT_WORD(i)], BIT_MASK(i))

#define	test_bit(i, a)							\
    !!(READ_ONCE(((volatile const unsigned long *)(a))[BIT_WORD(i)]) & BIT_MASK(i))

static inline int
test_and_clear_bit(long bit, volatile unsigned long *var)
{
	long val;

var += BIT_WORD(bit);
	bit %= BITS_PER_LONG;
	bit = (1UL << bit);

val = *var;
	while (!atomic_fcmpset_long(var, &val, val & ~bit))
		;
	return !!(val & bit);
}

static inline int
__test_and_clear_bit(long bit, volatile unsigned long *var)
{
	long val;

var += BIT_WORD(bit);
	bit %= BITS_PER_LONG;
	bit = (1UL << bit);

val = *var;
	*var &= ~bit;

return !!(val & bit);
}

static inline int
test_and_set_bit(long bit, volatile unsigned long *var)
{
	long val;

var += BIT_WORD(bit);
	bit %= BITS_PER_LONG;
	bit = (1UL << bit);

val = *var;
	while (!atomic_fcmpset_long(var, &val, val | bit))
		;
	return !!(val & bit);
}

static inline int
__test_and_set_bit(long bit, volatile unsigned long *var)
{
	long val;

var += BIT_WORD(bit);
	bit %= BITS_PER_LONG;
	bit = (1UL << bit);

val = *var;
	*var |= bit;

return !!(val & bit);
}

enum {
        REG_OP_ISFREE,
        REG_OP_ALLOC,
        REG_OP_RELEASE,
};

static inline int
linux_reg_op(unsigned long *bitmap, int pos, int order, int reg_op)
{
        int nbits_reg;
        int index;
        int offset;
        int nlongs_reg;
        int nbitsinlong;
        unsigned long mask;
        int i;
        int ret = 0;

nbits_reg = 1 << order;
        index = pos / BITS_PER_LONG;
        offset = pos - (index * BITS_PER_LONG);
        nlongs_reg = BITS_TO_LONGS(nbits_reg);
        nbitsinlong = MIN(nbits_reg,  BITS_PER_LONG);

mask = (1UL << (nbitsinlong - 1));
        mask += mask - 1;
        mask <<= offset;

switch (reg_op) {
        case REG_OP_ISFREE:
                for (i = 0; i < nlongs_reg; i++) {
                        if (bitmap[index + i] & mask)
                                goto done;
                }
                ret = 1;
                break;

case REG_OP_ALLOC:
                for (i = 0; i < nlongs_reg; i++)
                        bitmap[index + i] |= mask;
                break;

case REG_OP_RELEASE:
                for (i = 0; i < nlongs_reg; i++)
                        bitmap[index + i] &= ~mask;
                break;
        }
done:
        return ret;
}

#define for_each_set_bit(bit, addr, size) \
	for ((bit) = find_first_bit((addr), (size));		\
	     (bit) < (size);					\
	     (bit) = find_next_bit((addr), (size), (bit) + 1))

#define	for_each_clear_bit(bit, addr, size) \
	for ((bit) = find_first_zero_bit((addr), (size));		\
	     (bit) < (size);						\
	     (bit) = find_next_zero_bit((addr), (size), (bit) + 1))

static inline uint64_t
sign_extend64(uint64_t value, int index)
{
	uint8_t shift = 63 - index;

return ((int64_t)(value << shift) >> shift);
}

#endif	/* _LINUX_BITOPS_H_ */

003 File Manager

Editing: bitops.h

Upload File

Create Folder