a9973e913d
Previously, futex code of McKerenl was called by mccontrol, but there ware some problems with this method. (Mainly, location of McKernel image on memory) Call futex code in mcctrl instead of the one in McKernel image, giving the following benefits: 1. Not relying on shared kernel virtual address space with Linux any more 2. The cpu id store / retrieve is not needed and resulting in the code Change-Id: Ic40929b64a655b270c435859fa287fedb713ee5c refe: #1428
89 lines
1.9 KiB
C
89 lines
1.9 KiB
C
#ifndef _MC_JHASH_H
|
|
#define _MC_JHASH_H
|
|
/**
|
|
* \file mc_jhash.h
|
|
* Licence details are found in the file LICENSE.
|
|
*
|
|
* \brief
|
|
* Adaptation to McKernel
|
|
*
|
|
* \author Balazs Gerofi <bgerofi@riken.jp> \par
|
|
* Copyright (C) 2012 RIKEN AICS
|
|
*
|
|
*
|
|
* HISTORY:
|
|
*/
|
|
|
|
/*
|
|
* 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
|
|
*
|
|
*/
|
|
|
|
/* NOTE: Arguments are modified. */
|
|
#define __mc_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
|
|
|
|
/* A special optimized version that handles 1 or more of uint32_ts.
|
|
* The length parameter here is the number of uint32_ts in the key.
|
|
*/
|
|
static inline uint32_t mc_jhash2(const uint32_t *k, uint32_t length, uint32_t initval)
|
|
{
|
|
uint32_t 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];
|
|
__mc_jhash_mix(a, b, c);
|
|
k += 3; len -= 3;
|
|
}
|
|
|
|
c += length * 4;
|
|
|
|
switch (len) {
|
|
case 2:
|
|
b += k[1];
|
|
case 1:
|
|
a += k[0];
|
|
};
|
|
|
|
__mc_jhash_mix(a, b, c);
|
|
|
|
return c;
|
|
}
|
|
|
|
#endif /* _MC_JHASH_H */
|