File Manager

003 File Manager

Current Path: /usr/include/sys

📁 ..
📄 _atomic64e.h(2.91 KB)
📄 _atomic_subword.h(7.27 KB)
📄 _bitset.h(2.3 KB)
📄 _blockcount.h(1.97 KB)
📄 _bus_dma.h(2.15 KB)
📄 _callout.h(2.68 KB)
📄 _cpuset.h(1.76 KB)
📄 _cscan_atomic.h(18.1 KB)
📄 _cscan_bus.h(10.22 KB)
📄 _domainset.h(2.04 KB)
📄 _eventhandler.h(2.81 KB)
📄 _ffcounter.h(1.84 KB)
📄 _iovec.h(1.93 KB)
📄 _lock.h(2.98 KB)
📄 _lockmgr.h(1.82 KB)
📄 _mutex.h(2.63 KB)
📄 _null.h(1.7 KB)
📄 _pctrie.h(1.65 KB)
📄 _pthreadtypes.h(3.51 KB)
📄 _rangeset.h(1.86 KB)
📄 _rmlock.h(2.59 KB)
📄 _rwlock.h(2.39 KB)
📄 _semaphore.h(2.05 KB)
📄 _seqc.h(160 B)
📄 _sigset.h(2.46 KB)
📄 _smr.h(1.94 KB)
📄 _sockaddr_storage.h(2.37 KB)
📄 _stack.h(1.53 KB)
📄 _stdarg.h(2.15 KB)
📄 _stdint.h(2.6 KB)
📄 _sx.h(1.73 KB)
📄 _task.h(2.62 KB)
📄 _termios.h(7.64 KB)
📄 _timespec.h(2 KB)
📄 _timeval.h(1.88 KB)
📄 _types.h(5.66 KB)
📄 _ucontext.h(2.08 KB)
📄 _uio.h(1.99 KB)
📄 _umtx.h(2.5 KB)
📄 _unrhdr.h(1.92 KB)
📄 _winsize.h(2.14 KB)
📄 aac_ioctl.h(7.56 KB)
📄 abi_compat.h(2.42 KB)
📄 acct.h(4.95 KB)
📄 acl.h(14.62 KB)
📄 agpio.h(5.78 KB)
📄 aio.h(7.69 KB)
📄 alq.h(4.5 KB)
📄 apm.h(88 B)
📄 arb.h(28.88 KB)
📄 assym.h(2.7 KB)
📄 ata.h(45.35 KB)
📄 atomic_common.h(3.26 KB)
📄 auxv.h(1.58 KB)
📄 backlight.h(2.02 KB)
📄 bio.h(6.77 KB)
📄 bitset.h(8.53 KB)
📄 bitstring.h(12.16 KB)
📄 blist.h(3.74 KB)
📄 blockcount.h(3.03 KB)
📄 boot.h(1.8 KB)
📄 buf.h(20.73 KB)
📄 buf_ring.h(10.6 KB)
📄 bufobj.h(5.03 KB)
📄 bus.h(38.2 KB)
📄 bus_dma.h(13.68 KB)
📄 bus_dma_internal.h(2.42 KB)
📄 busdma_bufalloc.h(4.7 KB)
📄 callout.h(6.62 KB)
📄 caprights.h(4.17 KB)
📄 capsicum.h(17.54 KB)
📄 cdefs.h(27.79 KB)
📄 cdio.h(7.09 KB)
📄 cdrio.h(4.88 KB)
📄 cfictl.h(2.21 KB)
📄 chio.h(9.53 KB)
📄 ck.h(251 B)
📄 clock.h(8.07 KB)
📄 cnv.h(4.25 KB)
📄 compressor.h(2.05 KB)
📄 condvar.h(3.42 KB)
📄 conf.h(12.4 KB)
📄 cons.h(5.22 KB)
📄 consio.h(14.01 KB)
📄 copyright.h(1.97 KB)
📄 counter.h(3.02 KB)
📄 coverage.h(2.36 KB)
📄 cpu.h(7.02 KB)
📄 cpuctl.h(2.29 KB)
📄 cpuset.h(5.93 KB)
📄 csan.h(1.71 KB)
📄 ctf.h(14.4 KB)
📄 ctf_api.h(9.43 KB)
📄 ctype.h(2.81 KB)
📄 devctl.h(1.76 KB)
📄 devicestat.h(6.97 KB)
📄 devmap.h(4.04 KB)
📄 dirent.h(4.78 KB)
📁 disk
📄 disk.h(6.31 KB)
📄 disk_zone.h(6.52 KB)
📄 disklabel.h(4.39 KB)
📄 diskmbr.h(1.84 KB)
📄 dkstat.h(2.05 KB)
📄 dnv.h(3.39 KB)
📄 domain.h(3.64 KB)
📄 domainset.h(5.05 KB)
📄 dtrace.h(104.98 KB)
📄 dtrace_bsd.h(6.93 KB)
📄 dvdio.h(3.43 KB)
📄 efi.h(6.21 KB)
📄 efiio.h(2.06 KB)
📄 elf.h(1.6 KB)
📄 elf32.h(7.46 KB)
📄 elf64.h(7.79 KB)
📄 elf_common.h(59.51 KB)
📄 elf_generic.h(2.83 KB)
📄 endian.h(4.98 KB)
📄 epoch.h(4.01 KB)
📄 errno.h(8.29 KB)
📄 eui64.h(2.05 KB)
📄 event.h(12.61 KB)
📄 eventfd.h(1.86 KB)
📄 eventhandler.h(11.8 KB)
📄 eventvar.h(2.46 KB)
📄 exec.h(4.56 KB)
📄 extattr.h(4.08 KB)
📄 fail.h(13.1 KB)
📄 fbio.h(19.95 KB)
📄 fcntl.h(12.02 KB)
📄 fdcio.h(7.6 KB)
📄 file.h(14.06 KB)
📄 filedesc.h(12.13 KB)
📄 filio.h(3.67 KB)
📄 firmware.h(3.11 KB)
📄 fnv_hash.h(1.41 KB)
📄 font.h(3.85 KB)
📄 gmon.h(7.16 KB)
📄 gpio.h(9.85 KB)
📄 gpt.h(1.51 KB)
📄 gsb_crc32.h(998 B)
📄 gtaskqueue.h(4.21 KB)
📄 hash.h(3.55 KB)
📄 hhook.h(5.86 KB)
📄 iconv.h(8.22 KB)
📄 imgact.h(5.22 KB)
📄 imgact_aout.h(5.65 KB)
📄 imgact_binmisc.h(6.95 KB)
📄 imgact_elf.h(4.13 KB)
📄 interrupt.h(8.07 KB)
📄 intr.h(5.36 KB)
📄 ioccom.h(3.82 KB)
📄 ioctl.h(2.24 KB)
📄 ioctl_compat.h(6.42 KB)
📄 iov.h(11.67 KB)
📄 iov_schema.h(2.33 KB)
📄 ipc.h(4.93 KB)
📄 ipmi.h(5.4 KB)
📄 jail.h(14.98 KB)
📄 joystick.h(2.12 KB)
📄 kbio.h(7.81 KB)
📄 kcov.h(2.36 KB)
📄 kdb.h(5.04 KB)
📄 kenv.h(2.02 KB)
📄 kern_prefetch.h(1.67 KB)
📄 kernel.h(16.18 KB)
📄 kerneldump.h(4.85 KB)
📄 khelp.h(3.08 KB)
📄 kobj.h(6.92 KB)
📄 kpilite.h(2.01 KB)
📄 ksem.h(2.34 KB)
📄 kthread.h(3.04 KB)
📄 ktls.h(6.52 KB)
📄 ktr.h(10.92 KB)
📄 ktr_class.h(3.8 KB)
📄 ktrace.h(8.13 KB)
📄 libkern.h(7.74 KB)
📄 limits.h(3.69 KB)
📄 link_aout.h(10.2 KB)
📄 link_elf.h(4.06 KB)
📄 linker.h(11.88 KB)
📄 linker_set.h(3.85 KB)
📄 lock.h(12.24 KB)
📄 lock_profile.h(2.6 KB)
📄 lockf.h(5.55 KB)
📄 lockmgr.h(7 KB)
📄 lockstat.h(5.13 KB)
📄 loginclass.h(2.08 KB)
📄 mac.h(3.96 KB)
📄 malloc.h(11.76 KB)
📄 mbuf.h(50.74 KB)
📄 mchain.h(4.21 KB)
📄 md4.h(1.63 KB)
📄 md5.h(1.81 KB)
📄 mdioctl.h(3.73 KB)
📄 memdesc.h(3.79 KB)
📄 memrange.h(2.36 KB)
📄 mman.h(10.41 KB)
📄 module.h(8.77 KB)
📄 module_khelp.h(3.45 KB)
📄 mount.h(42.05 KB)
📄 mouse.h(12.69 KB)
📄 mpt_ioctl.h(4.27 KB)
📄 mqueue.h(1.86 KB)
📄 msg.h(4.78 KB)
📄 msgbuf.h(3.49 KB)
📄 mtio.h(11.94 KB)
📄 mutex.h(19.18 KB)
📄 namei.h(11.27 KB)
📄 nlist_aout.h(4.23 KB)
📄 nv.h(10.62 KB)
📄 nvpair.h(14.77 KB)
📄 osd.h(4.02 KB)
📄 param.h(12.23 KB)
📄 pciio.h(5.67 KB)
📄 pcpu.h(9.79 KB)
📄 pctrie.h(5.19 KB)
📄 physmem.h(2.92 KB)
📄 pidctrl.h(5.44 KB)
📄 pipe.h(4.63 KB)
📄 pmc.h(37.29 KB)
📄 pmckern.h(8.01 KB)
📄 pmclog.h(9.23 KB)
📄 poll.h(4.03 KB)
📄 posix4.h(3.71 KB)
📄 power.h(2.34 KB)
📄 priority.h(4.39 KB)
📄 priv.h(19.73 KB)
📄 prng.h(354 B)
📄 proc.h(50.73 KB)
📄 procctl.h(4.89 KB)
📄 procdesc.h(4.46 KB)
📄 procfs.h(4.2 KB)
📄 protosw.h(14.56 KB)
📄 ptio.h(1.57 KB)
📄 ptrace.h(8.61 KB)
📄 qmath.h(22.07 KB)
📄 queue.h(28.61 KB)
📄 racct.h(7.48 KB)
📄 random.h(5.41 KB)
📄 rangelock.h(3.86 KB)
📄 rangeset.h(2.96 KB)
📄 rctl.h(5.91 KB)
📄 reboot.h(3.41 KB)
📄 refcount.h(5.72 KB)
📄 regression.h(1.62 KB)
📄 resource.h(5.32 KB)
📄 resourcevar.h(6.33 KB)
📄 rman.h(6.41 KB)
📄 rmlock.h(5.56 KB)
📄 rtprio.h(3.08 KB)
📄 runq.h(2.54 KB)
📄 rwlock.h(10.61 KB)
📄 sbuf.h(4.68 KB)
📄 sched.h(9.06 KB)
📄 sdt.h(17.89 KB)
📄 select.h(3.5 KB)
📄 selinfo.h(2.39 KB)
📄 sem.h(4.31 KB)
📄 sema.h(2.61 KB)
📄 seqc.h(3.26 KB)
📄 serial.h(3.49 KB)
📄 sf_buf.h(5.87 KB)
📄 sglist.h(3.89 KB)
📄 shm.h(5.69 KB)
📄 sigio.h(2.83 KB)
📄 signal.h(15.83 KB)
📄 signalvar.h(12.95 KB)
📄 sleepqueue.h(5.61 KB)
📄 slicer.h(2.19 KB)
📄 smp.h(8.88 KB)
📄 smr.h(7.64 KB)
📄 smr_types.h(4.87 KB)
📄 snoop.h(1014 B)
📄 sockbuf.h(9.9 KB)
📄 socket.h(23.43 KB)
📄 socketvar.h(18.75 KB)
📄 sockio.h(7.97 KB)
📄 sockopt.h(2.98 KB)
📄 soundcard.h(69.38 KB)
📄 specialfd.h(1.56 KB)
📄 spigenio.h(2.28 KB)
📄 stack.h(2.65 KB)
📄 stat.h(13.44 KB)
📄 stats.h(34.73 KB)
📄 statvfs.h(3.08 KB)
📄 stdatomic.h(13.94 KB)
📄 stddef.h(1.7 KB)
📄 stdint.h(2.63 KB)
📄 sx.h(11.04 KB)
📄 syscall.h(13.99 KB)
📄 syscallsubr.h(16.94 KB)
📄 sysctl.h(47.96 KB)
📄 sysent.h(10.82 KB)
📄 syslimits.h(3.14 KB)
📄 syslog.h(7.25 KB)
📄 sysproto.h(153.38 KB)
📄 systm.h(21.97 KB)
📄 taskqueue.h(7.65 KB)
📄 terminal.h(8.25 KB)
📄 termios.h(151 B)
📄 thr.h(2.87 KB)
📄 tiio.h(12.62 KB)
📄 tim_filter.h(4.61 KB)
📄 time.h(16.87 KB)
📄 timeb.h(2.59 KB)
📄 timeet.h(3.65 KB)
📄 timeffc.h(11.94 KB)
📄 timepps.h(6.48 KB)
📄 timers.h(3.56 KB)
📄 times.h(2.46 KB)
📄 timespec.h(2.4 KB)
📄 timetc.h(3.16 KB)
📄 timex.h(6.61 KB)
📄 tree.h(27.93 KB)
📄 tslog.h(2.3 KB)
📄 tty.h(8.98 KB)
📄 ttycom.h(6.48 KB)
📄 ttydefaults.h(3.92 KB)
📄 ttydevsw.h(5.28 KB)
📄 ttydisc.h(2.93 KB)
📄 ttyhook.h(3.98 KB)
📄 ttyqueue.h(5.26 KB)
📄 turnstile.h(4.83 KB)
📄 types.h(11.64 KB)
📄 ucontext.h(2.91 KB)
📄 ucred.h(5.4 KB)
📄 uio.h(4.15 KB)
📄 umtx.h(5.94 KB)
📄 un.h(2.96 KB)
📄 unistd.h(7.34 KB)
📄 unpcb.h(6.77 KB)
📄 user.h(21.58 KB)
📄 utsname.h(2.47 KB)
📄 uuid.h(3.17 KB)
📄 vdso.h(4.26 KB)
📄 vmem.h(4.91 KB)
📄 vmmeter.h(7.72 KB)
📄 vnode.h(40.87 KB)
📄 vtoc.h(89 B)
📄 wait.h(6.11 KB)
📄 watchdog.h(4.22 KB)

Editing: bitset.h

/*-
 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
 *
 * Copyright (c) 2008, Jeffrey Roberson <jeff@freebsd.org>
 * All rights reserved.
 *
 * Copyright (c) 2008 Nokia Corporation
 * 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 _SYS_BITSET_H_
#define	_SYS_BITSET_H_

/*
 * Whether expr is both constant and true.  Result is itself constant.
 * Used to enable optimizations for sets with a known small size.
 */
#define	__constexpr_cond(expr)	(__builtin_constant_p((expr)) && (expr))

#define	__bitset_mask(_s, n)						\
	(1UL << (__constexpr_cond(__bitset_words((_s)) == 1) ?		\
	    (__size_t)(n) : ((n) % _BITSET_BITS)))

#define	__bitset_word(_s, n)						\
	(__constexpr_cond(__bitset_words((_s)) == 1) ?			\
	 0 : ((n) / _BITSET_BITS))

#define	BIT_CLR(_s, n, p)						\
	((p)->__bits[__bitset_word(_s, n)] &= ~__bitset_mask((_s), (n)))

#define	BIT_COPY(_s, f, t)	(void)(*(t) = *(f))

#define	BIT_ISSET(_s, n, p)						\
	((((p)->__bits[__bitset_word(_s, n)] & __bitset_mask((_s), (n))) != 0))

#define	BIT_SET(_s, n, p)						\
	((p)->__bits[__bitset_word(_s, n)] |= __bitset_mask((_s), (n)))

#define	BIT_ZERO(_s, p) do {						\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(p)->__bits[__i] = 0L;					\
} while (0)

#define	BIT_FILL(_s, p) do {						\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(p)->__bits[__i] = -1L;					\
} while (0)

#define	BIT_SETOF(_s, n, p) do {					\
	BIT_ZERO(_s, p);						\
	(p)->__bits[__bitset_word(_s, n)] = __bitset_mask((_s), (n));	\
} while (0)

/* Is p empty. */
#define	BIT_EMPTY(_s, p) __extension__ ({				\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		if ((p)->__bits[__i])					\
			break;						\
	__i == __bitset_words((_s));					\
})

/* Is p full set. */
#define	BIT_ISFULLSET(_s, p) __extension__ ({				\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		if ((p)->__bits[__i] != (long)-1)			\
			break;						\
	__i == __bitset_words((_s));					\
})

/* Is c a subset of p. */
#define	BIT_SUBSET(_s, p, c) __extension__ ({				\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		if (((c)->__bits[__i] &					\
		    (p)->__bits[__i]) !=				\
		    (c)->__bits[__i])					\
			break;						\
	__i == __bitset_words((_s));					\
})

/* Are there any common bits between b & c? */
#define	BIT_OVERLAP(_s, p, c) __extension__ ({				\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		if (((c)->__bits[__i] &					\
		    (p)->__bits[__i]) != 0)				\
			break;						\
	__i != __bitset_words((_s));					\
})

/* Compare two sets, returns 0 if equal 1 otherwise. */
#define	BIT_CMP(_s, p, c) __extension__ ({				\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		if (((c)->__bits[__i] !=				\
		    (p)->__bits[__i]))					\
			break;						\
	__i != __bitset_words((_s));					\
})

#define	BIT_OR(_s, d, s) do {						\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] |= (s)->__bits[__i];			\
} while (0)

#define	BIT_OR2(_s, d, s1, s2) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] = (s1)->__bits[__i] | (s2)->__bits[__i];\
} while (0)

#define	BIT_AND(_s, d, s) do {						\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] &= (s)->__bits[__i];			\
} while (0)

#define	BIT_AND2(_s, d, s1, s2) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] = (s1)->__bits[__i] & (s2)->__bits[__i];\
} while (0)

#define	BIT_ANDNOT(_s, d, s) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] &= ~(s)->__bits[__i];			\
} while (0)

#define	BIT_ANDNOT2(_s, d, s1, s2) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] = (s1)->__bits[__i] & ~(s2)->__bits[__i];\
} while (0)

#define	BIT_XOR(_s, d, s) do {						\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] ^= (s)->__bits[__i];			\
} while (0)

#define	BIT_XOR2(_s, d, s1, s2) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		(d)->__bits[__i] = (s1)->__bits[__i] ^ (s2)->__bits[__i];\
} while (0)

/*
 * Note, the atomic(9) API is not consistent between clear/set and
 * testandclear/testandset in whether the value argument is a mask
 * or a bit index.
 */

#define	BIT_CLR_ATOMIC(_s, n, p)					\
	atomic_clear_long(&(p)->__bits[__bitset_word(_s, n)],		\
	    __bitset_mask((_s), n))

#define	BIT_SET_ATOMIC(_s, n, p)					\
	atomic_set_long(&(p)->__bits[__bitset_word(_s, n)],		\
	    __bitset_mask((_s), n))

#define	BIT_SET_ATOMIC_ACQ(_s, n, p)					\
	atomic_set_acq_long(&(p)->__bits[__bitset_word(_s, n)],		\
	    __bitset_mask((_s), n))

#define	BIT_TEST_CLR_ATOMIC(_s, n, p)					\
	(atomic_testandclear_long(					\
	    &(p)->__bits[__bitset_word((_s), (n))], (n)) != 0)

#define	BIT_TEST_SET_ATOMIC(_s, n, p)					\
	(atomic_testandset_long(					\
	    &(p)->__bits[__bitset_word((_s), (n))], (n)) != 0)

/* Convenience functions catering special cases. */
#define	BIT_AND_ATOMIC(_s, d, s) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		atomic_clear_long(&(d)->__bits[__i],			\
		    ~(s)->__bits[__i]);					\
} while (0)

#define	BIT_OR_ATOMIC(_s, d, s) do {					\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		atomic_set_long(&(d)->__bits[__i],			\
		    (s)->__bits[__i]);					\
} while (0)

#define	BIT_COPY_STORE_REL(_s, f, t) do {				\
	__size_t __i;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		atomic_store_rel_long(&(t)->__bits[__i],		\
		    (f)->__bits[__i]);					\
} while (0)

/*
 * Note that `start` and the returned value from BIT_FFS_AT are
 * 1-based bit indices.
 */
#define	BIT_FFS_AT(_s, p, start) __extension__ ({			\
	__size_t __i;							\
	long __bit, __mask;						\
									\
	__mask = ~0UL << ((start) % _BITSET_BITS);			\
	__bit = 0;							\
	for (__i = __bitset_word((_s), (start));			\
	    __i < __bitset_words((_s));					\
	    __i++) {							\
		if (((p)->__bits[__i] & __mask) != 0) {			\
			__bit = ffsl((p)->__bits[__i] & __mask);	\
			__bit += __i * _BITSET_BITS;			\
			break;						\
		}							\
		__mask = ~0UL;						\
	}								\
	__bit;								\
})

#define	BIT_FFS(_s, p) BIT_FFS_AT((_s), (p), 0)

#define	BIT_FLS(_s, p) __extension__ ({					\
	__size_t __i;							\
	long __bit;							\
									\
	__bit = 0;							\
	for (__i = __bitset_words((_s)); __i > 0; __i--) {		\
		if ((p)->__bits[__i - 1] != 0) {			\
			__bit = flsl((p)->__bits[__i - 1]);		\
			__bit += (__i - 1) * _BITSET_BITS;		\
			break;						\
		}							\
	}								\
	__bit;								\
})

#define	BIT_COUNT(_s, p) __extension__ ({				\
	__size_t __i;							\
	long __count;							\
									\
	__count = 0;							\
	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
		__count += __bitcountl((p)->__bits[__i]);		\
	__count;							\
})

#define	BITSET_T_INITIALIZER(x)						\
	{ .__bits = { x } }

#define	BITSET_FSET(n)							\
	[ 0 ... ((n) - 1) ] = (-1L)

#define	BITSET_SIZE(_s)	(__bitset_words((_s)) * sizeof(long))

/*
 * Dynamically allocate a bitset.
 */
#define BITSET_ALLOC(_s, mt, mf)	malloc(BITSET_SIZE((_s)), mt, (mf))

#endif /* !_SYS_BITSET_H_ */

003 File Manager

Editing: bitset.h

Upload File

Create Folder