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

#ifndef	_LINUX_JHASH_H_
#define	_LINUX_JHASH_H_

#include <asm/types.h>

/* jhash.h: Jenkins hash support.
 *
 * Copyright (C) 1996 Bob Jenkins (bob_jenkins@burtleburtle.net)
 *
 * http://burtleburtle.net/bob/hash/
 *
 * These are the credits from Bob's sources:
 *
 * lookup2.c, by Bob Jenkins, December 1996, Public Domain.
 * hash(), hash2(), hash3, and mix() are externally useful functions.
 * Routines to test the hash are included if SELF_TEST is defined.
 * You can use this free for any purpose.  It has no warranty.
 *
 * Copyright (C) 2003 David S. Miller (davem@redhat.com)
 *
 * I've modified Bob's hash to be useful in the Linux kernel, and
 * any bugs present are surely my fault.  -DaveM
 *
 * $FreeBSD$
 */

/* NOTE: Arguments are modified. */
#define __jhash_mix(a, b, c) \
{ \
  a -= b; a -= c; a ^= (c>>13); \
  b -= c; b -= a; b ^= (a<<8); \
  c -= a; c -= b; c ^= (b>>13); \
  a -= b; a -= c; a ^= (c>>12);  \
  b -= c; b -= a; b ^= (a<<16); \
  c -= a; c -= b; c ^= (b>>5); \
  a -= b; a -= c; a ^= (c>>3);  \
  b -= c; b -= a; b ^= (a<<10); \
  c -= a; c -= b; c ^= (b>>15); \
}

/* The golden ration: an arbitrary value */
#define JHASH_GOLDEN_RATIO	0x9e3779b9

/* The most generic version, hashes an arbitrary sequence
 * of bytes.  No alignment or length assumptions are made about
 * the input key.
 */
static inline u32 jhash(const void *key, u32 length, u32 initval)
{
	u32 a, b, c, len;
	const u8 *k = key;

len = length;
	a = b = JHASH_GOLDEN_RATIO;
	c = initval;

while (len >= 12) {
		a += (k[0] +((u32)k[1]<<8) +((u32)k[2]<<16) +((u32)k[3]<<24));
		b += (k[4] +((u32)k[5]<<8) +((u32)k[6]<<16) +((u32)k[7]<<24));
		c += (k[8] +((u32)k[9]<<8) +((u32)k[10]<<16)+((u32)k[11]<<24));

__jhash_mix(a,b,c);

k += 12;
		len -= 12;
	}

c += length;
	switch (len) {
	case 11: c += ((u32)k[10]<<24);
	case 10: c += ((u32)k[9]<<16);
	case 9 : c += ((u32)k[8]<<8);
	case 8 : b += ((u32)k[7]<<24);
	case 7 : b += ((u32)k[6]<<16);
	case 6 : b += ((u32)k[5]<<8);
	case 5 : b += k[4];
	case 4 : a += ((u32)k[3]<<24);
	case 3 : a += ((u32)k[2]<<16);
	case 2 : a += ((u32)k[1]<<8);
	case 1 : a += k[0];
	};

__jhash_mix(a,b,c);

return c;
}

/* A special optimized version that handles 1 or more of u32s.
 * The length parameter here is the number of u32s in the key.
 */
static inline u32 jhash2(const u32 *k, u32 length, u32 initval)
{
	u32 a, b, c, len;

a = b = JHASH_GOLDEN_RATIO;
	c = initval;
	len = length;

while (len >= 3) {
		a += k[0];
		b += k[1];
		c += k[2];
		__jhash_mix(a, b, c);
		k += 3; len -= 3;
	}

c += length * 4;

switch (len) {
	case 2 : b += k[1];
	case 1 : a += k[0];
	};

__jhash_mix(a,b,c);

return c;
}

/* A special ultra-optimized versions that knows they are hashing exactly
 * 3, 2 or 1 word(s).
 *
 * NOTE: In partilar the "c += length; __jhash_mix(a,b,c);" normally
 *       done at the end is not done here.
 */
static inline u32 jhash_3words(u32 a, u32 b, u32 c, u32 initval)
{
	a += JHASH_GOLDEN_RATIO;
	b += JHASH_GOLDEN_RATIO;
	c += initval;

__jhash_mix(a, b, c);

return c;
}

static inline u32 jhash_2words(u32 a, u32 b, u32 initval)
{
	return jhash_3words(a, b, 0, initval);
}

static inline u32 jhash_1word(u32 a, u32 initval)
{
	return jhash_3words(a, 0, 0, initval);
}

#endif	/* _LINUX_JHASH_H_ */

003 File Manager

Editing: jhash.h

Upload File

Create Folder