General hash interface, with replaceable hash functions, defaults to murmur3.
This commit is contained in:
Peter D. Barnes, Jr.
388
src/core/model/hash-murmur3.cc
Normal file
388
src/core/model/hash-murmur3.cc
Normal file
@@ -0,0 +1,388 @@
|
||||
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
||||
/*
|
||||
* Copyright (c) 2012 Lawrence Livermore National Laboratory
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License version 2 as
|
||||
* published by the Free Software Foundation;
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* Author: Peter D. Barnes, Jr. <pdbarnes@llnl.gov>
|
||||
*/
|
||||
|
||||
#include "ns3/hash.h"
|
||||
#include "ns3/hash-murmur3.h"
|
||||
#include "ns3/log.h"
|
||||
|
||||
|
||||
namespace ns3 {
|
||||
|
||||
NS_LOG_COMPONENT_DEFINE ("Hash-Murmur3");
|
||||
|
||||
namespace HashImplNS {
|
||||
|
||||
namespace Murmur3NS {
|
||||
|
||||
/*************************************************
|
||||
** class Murmur3HashImplementation
|
||||
************************************************/
|
||||
|
||||
// Adapted from http://code.google.com/p/smhasher/
|
||||
|
||||
// Begin Murmur3.cpp ----------------------------->
|
||||
|
||||
//
|
||||
//-----------------------------------------------------------------------------
|
||||
// MurmurHash3 was written by Austin Appleby, and is placed in the public
|
||||
// domain. The author hereby disclaims copyright to this source code.
|
||||
|
||||
// Note - The x86 and x64 versions do _not_ produce the same results, as the
|
||||
// algorithms are optimized for their respective platforms. You can still
|
||||
// compile and run any of them on any platform, but your performance with the
|
||||
// non-native version will be less than optimal.
|
||||
|
||||
|
||||
inline uint32_t rotl32 ( uint32_t x, int8_t r )
|
||||
{
|
||||
return (x << r) | (x >> (32 - r));
|
||||
}
|
||||
|
||||
inline uint64_t rotl64 ( uint64_t x, int8_t r )
|
||||
{
|
||||
return (x << r) | (x >> (64 - r));
|
||||
}
|
||||
|
||||
#define BIG_CONSTANT(x) (x##LLU)
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
// Block read - if your platform needs to do endian-swapping or can only
|
||||
// handle aligned reads, do the conversion here
|
||||
|
||||
inline uint32_t getblock ( const uint32_t * p, int i )
|
||||
{
|
||||
return p[i];
|
||||
}
|
||||
|
||||
inline uint64_t getblock ( const uint64_t * p, int i )
|
||||
{
|
||||
return p[i];
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
// Finalization mix - force all bits of a hash block to avalanche
|
||||
|
||||
inline uint32_t fmix ( uint32_t h )
|
||||
{
|
||||
h ^= h >> 16;
|
||||
h *= 0x85ebca6b;
|
||||
h ^= h >> 13;
|
||||
h *= 0xc2b2ae35;
|
||||
h ^= h >> 16;
|
||||
|
||||
return h;
|
||||
}
|
||||
|
||||
//----------
|
||||
|
||||
inline uint64_t fmix ( uint64_t k )
|
||||
{
|
||||
k ^= k >> 33;
|
||||
k *= BIG_CONSTANT(0xff51afd7ed558ccd);
|
||||
k ^= k >> 33;
|
||||
k *= BIG_CONSTANT(0xc4ceb9fe1a85ec53);
|
||||
k ^= k >> 33;
|
||||
|
||||
return k;
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
|
||||
void MurmurHash3_x86_32 ( const void * key, int len,
|
||||
uint32_t seed, void * out )
|
||||
{
|
||||
const uint8_t * data = (const uint8_t*)key;
|
||||
const int nblocks = len / 4;
|
||||
|
||||
uint32_t h1 = seed;
|
||||
|
||||
uint32_t c1 = 0xcc9e2d51;
|
||||
uint32_t c2 = 0x1b873593;
|
||||
|
||||
//----------
|
||||
// body
|
||||
|
||||
const uint32_t * blocks = (const uint32_t *)(data + nblocks*4);
|
||||
|
||||
for(int i = -nblocks; i; i++)
|
||||
{
|
||||
uint32_t k1 = getblock(blocks,i);
|
||||
|
||||
k1 *= c1;
|
||||
k1 = rotl32(k1,15);
|
||||
k1 *= c2;
|
||||
|
||||
h1 ^= k1;
|
||||
h1 = rotl32(h1,13);
|
||||
h1 = h1*5+0xe6546b64;
|
||||
}
|
||||
|
||||
//----------
|
||||
// tail
|
||||
|
||||
const uint8_t * tail = (const uint8_t*)(data + nblocks*4);
|
||||
|
||||
uint32_t k1 = 0;
|
||||
|
||||
switch(len & 3)
|
||||
{
|
||||
case 3: k1 ^= tail[2] << 16;
|
||||
case 2: k1 ^= tail[1] << 8;
|
||||
case 1: k1 ^= tail[0];
|
||||
k1 *= c1; k1 = rotl32(k1,15); k1 *= c2; h1 ^= k1;
|
||||
};
|
||||
|
||||
//----------
|
||||
// finalization
|
||||
|
||||
h1 ^= len;
|
||||
|
||||
h1 = fmix(h1);
|
||||
|
||||
*(uint32_t*)out = h1;
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
|
||||
void MurmurHash3_x86_128 ( const void * key, const int len,
|
||||
uint32_t seed, void * out )
|
||||
{
|
||||
const uint8_t * data = (const uint8_t*)key;
|
||||
const int nblocks = len / 16;
|
||||
|
||||
uint32_t h1 = seed;
|
||||
uint32_t h2 = seed;
|
||||
uint32_t h3 = seed;
|
||||
uint32_t h4 = seed;
|
||||
|
||||
uint32_t c1 = 0x239b961b;
|
||||
uint32_t c2 = 0xab0e9789;
|
||||
uint32_t c3 = 0x38b34ae5;
|
||||
uint32_t c4 = 0xa1e38b93;
|
||||
|
||||
//----------
|
||||
// body
|
||||
|
||||
const uint32_t * blocks = (const uint32_t *)(data + nblocks*16);
|
||||
|
||||
for(int i = -nblocks; i; i++)
|
||||
{
|
||||
uint32_t k1 = getblock(blocks,i*4+0);
|
||||
uint32_t k2 = getblock(blocks,i*4+1);
|
||||
uint32_t k3 = getblock(blocks,i*4+2);
|
||||
uint32_t k4 = getblock(blocks,i*4+3);
|
||||
|
||||
k1 *= c1; k1 = rotl32(k1,15); k1 *= c2; h1 ^= k1;
|
||||
|
||||
h1 = rotl32(h1,19); h1 += h2; h1 = h1*5+0x561ccd1b;
|
||||
|
||||
k2 *= c2; k2 = rotl32(k2,16); k2 *= c3; h2 ^= k2;
|
||||
|
||||
h2 = rotl32(h2,17); h2 += h3; h2 = h2*5+0x0bcaa747;
|
||||
|
||||
k3 *= c3; k3 = rotl32(k3,17); k3 *= c4; h3 ^= k3;
|
||||
|
||||
h3 = rotl32(h3,15); h3 += h4; h3 = h3*5+0x96cd1c35;
|
||||
|
||||
k4 *= c4; k4 = rotl32(k4,18); k4 *= c1; h4 ^= k4;
|
||||
|
||||
h4 = rotl32(h4,13); h4 += h1; h4 = h4*5+0x32ac3b17;
|
||||
}
|
||||
|
||||
//----------
|
||||
// tail
|
||||
|
||||
const uint8_t * tail = (const uint8_t*)(data + nblocks*16);
|
||||
|
||||
uint32_t k1 = 0;
|
||||
uint32_t k2 = 0;
|
||||
uint32_t k3 = 0;
|
||||
uint32_t k4 = 0;
|
||||
|
||||
switch(len & 15)
|
||||
{
|
||||
case 15: k4 ^= tail[14] << 16;
|
||||
case 14: k4 ^= tail[13] << 8;
|
||||
case 13: k4 ^= tail[12] << 0;
|
||||
k4 *= c4; k4 = rotl32(k4,18); k4 *= c1; h4 ^= k4;
|
||||
|
||||
case 12: k3 ^= tail[11] << 24;
|
||||
case 11: k3 ^= tail[10] << 16;
|
||||
case 10: k3 ^= tail[ 9] << 8;
|
||||
case 9: k3 ^= tail[ 8] << 0;
|
||||
k3 *= c3; k3 = rotl32(k3,17); k3 *= c4; h3 ^= k3;
|
||||
|
||||
case 8: k2 ^= tail[ 7] << 24;
|
||||
case 7: k2 ^= tail[ 6] << 16;
|
||||
case 6: k2 ^= tail[ 5] << 8;
|
||||
case 5: k2 ^= tail[ 4] << 0;
|
||||
k2 *= c2; k2 = rotl32(k2,16); k2 *= c3; h2 ^= k2;
|
||||
|
||||
case 4: k1 ^= tail[ 3] << 24;
|
||||
case 3: k1 ^= tail[ 2] << 16;
|
||||
case 2: k1 ^= tail[ 1] << 8;
|
||||
case 1: k1 ^= tail[ 0] << 0;
|
||||
k1 *= c1; k1 = rotl32(k1,15); k1 *= c2; h1 ^= k1;
|
||||
};
|
||||
|
||||
//----------
|
||||
// finalization
|
||||
|
||||
h1 ^= len; h2 ^= len; h3 ^= len; h4 ^= len;
|
||||
|
||||
h1 += h2; h1 += h3; h1 += h4;
|
||||
h2 += h1; h3 += h1; h4 += h1;
|
||||
|
||||
h1 = fmix(h1);
|
||||
h2 = fmix(h2);
|
||||
h3 = fmix(h3);
|
||||
h4 = fmix(h4);
|
||||
|
||||
h1 += h2; h1 += h3; h1 += h4;
|
||||
h2 += h1; h3 += h1; h4 += h1;
|
||||
|
||||
((uint32_t*)out)[0] = h1;
|
||||
((uint32_t*)out)[1] = h2;
|
||||
((uint32_t*)out)[2] = h3;
|
||||
((uint32_t*)out)[3] = h4;
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
|
||||
void MurmurHash3_x64_128 ( const void * key, const int len,
|
||||
const uint32_t seed, void * out )
|
||||
{
|
||||
const uint8_t * data = (const uint8_t*)key;
|
||||
const int nblocks = len / 16;
|
||||
|
||||
uint64_t h1 = seed;
|
||||
uint64_t h2 = seed;
|
||||
|
||||
uint64_t c1 = BIG_CONSTANT(0x87c37b91114253d5);
|
||||
uint64_t c2 = BIG_CONSTANT(0x4cf5ad432745937f);
|
||||
|
||||
//----------
|
||||
// body
|
||||
|
||||
const uint64_t * blocks = (const uint64_t *)(data);
|
||||
|
||||
for(int i = 0; i < nblocks; i++)
|
||||
{
|
||||
uint64_t k1 = getblock(blocks,i*2+0);
|
||||
uint64_t k2 = getblock(blocks,i*2+1);
|
||||
|
||||
k1 *= c1; k1 = rotl64(k1,31); k1 *= c2; h1 ^= k1;
|
||||
|
||||
h1 = rotl64(h1,27); h1 += h2; h1 = h1*5+0x52dce729;
|
||||
|
||||
k2 *= c2; k2 = rotl64(k2,33); k2 *= c1; h2 ^= k2;
|
||||
|
||||
h2 = rotl64(h2,31); h2 += h1; h2 = h2*5+0x38495ab5;
|
||||
}
|
||||
|
||||
//----------
|
||||
// tail
|
||||
|
||||
const uint8_t * tail = (const uint8_t*)(data + nblocks*16);
|
||||
|
||||
uint64_t k1 = 0;
|
||||
uint64_t k2 = 0;
|
||||
|
||||
switch(len & 15)
|
||||
{
|
||||
case 15: k2 ^= uint64_t(tail[14]) << 48;
|
||||
case 14: k2 ^= uint64_t(tail[13]) << 40;
|
||||
case 13: k2 ^= uint64_t(tail[12]) << 32;
|
||||
case 12: k2 ^= uint64_t(tail[11]) << 24;
|
||||
case 11: k2 ^= uint64_t(tail[10]) << 16;
|
||||
case 10: k2 ^= uint64_t(tail[ 9]) << 8;
|
||||
case 9: k2 ^= uint64_t(tail[ 8]) << 0;
|
||||
k2 *= c2; k2 = rotl64(k2,33); k2 *= c1; h2 ^= k2;
|
||||
|
||||
case 8: k1 ^= uint64_t(tail[ 7]) << 56;
|
||||
case 7: k1 ^= uint64_t(tail[ 6]) << 48;
|
||||
case 6: k1 ^= uint64_t(tail[ 5]) << 40;
|
||||
case 5: k1 ^= uint64_t(tail[ 4]) << 32;
|
||||
case 4: k1 ^= uint64_t(tail[ 3]) << 24;
|
||||
case 3: k1 ^= uint64_t(tail[ 2]) << 16;
|
||||
case 2: k1 ^= uint64_t(tail[ 1]) << 8;
|
||||
case 1: k1 ^= uint64_t(tail[ 0]) << 0;
|
||||
k1 *= c1; k1 = rotl64(k1,31); k1 *= c2; h1 ^= k1;
|
||||
};
|
||||
|
||||
//----------
|
||||
// finalization
|
||||
|
||||
h1 ^= len; h2 ^= len;
|
||||
|
||||
h1 += h2;
|
||||
h2 += h1;
|
||||
|
||||
h1 = fmix(h1);
|
||||
h2 = fmix(h2);
|
||||
|
||||
h1 += h2;
|
||||
h2 += h1;
|
||||
|
||||
((uint64_t*)out)[0] = h1;
|
||||
((uint64_t*)out)[1] = h2;
|
||||
}
|
||||
|
||||
|
||||
// End Murmur3.cpp ----------------------------->
|
||||
|
||||
#undef BIG_CONSTANT
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
|
||||
|
||||
} // namespace Murmur3NS
|
||||
|
||||
|
||||
|
||||
TypeId
|
||||
Murmur3::GetTypeId (void)
|
||||
{
|
||||
static TypeId tid = TypeId ("ns3::HashImpl::Murmur3");
|
||||
return tid;
|
||||
}
|
||||
|
||||
uint32_t
|
||||
Murmur3::GetHash32 (const char * buffer, const size_t size)
|
||||
{
|
||||
uint32_t result;
|
||||
Murmur3NS::MurmurHash3_x86_32 (buffer, size,
|
||||
(uint32_t)SEED, (void *)(&result));
|
||||
return result;
|
||||
}
|
||||
|
||||
uint64_t
|
||||
Murmur3::GetHash64 (const char * buffer, const size_t size)
|
||||
{
|
||||
uint64_t result[2];
|
||||
|
||||
Murmur3NS::MurmurHash3_x86_128 (buffer, size,
|
||||
(uint32_t)SEED, (void *)(result));
|
||||
return result[0];
|
||||
}
|
||||
|
||||
} // namespace HashImpl
|
||||
|
||||
} // namespace ns3
|
||||
87
src/core/model/hash-murmur3.h
Normal file
87
src/core/model/hash-murmur3.h
Normal file
@@ -0,0 +1,87 @@
|
||||
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
||||
/*
|
||||
* Copyright (c) 2012 Lawrence Livermore National Laboratory
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License version 2 as
|
||||
* published by the Free Software Foundation;
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* Author: Peter D. Barnes, Jr. <pdbarnes@llnl.gov>
|
||||
*/
|
||||
|
||||
#ifndef HASH_MURMUR3_H
|
||||
#define HASH_MURMUR3_H
|
||||
|
||||
#include "ns3/hash.h"
|
||||
|
||||
namespace ns3 {
|
||||
|
||||
namespace HashImplNS {
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* \brief Murmur3 hash function implementation
|
||||
*
|
||||
* Adapted from http://code.google.com/p/smhasher/
|
||||
*
|
||||
* MurmurHash3 was written by Austin Appleby, and is placed in the public
|
||||
* domain. The author hereby disclaims copyright to this source code.
|
||||
|
||||
* Note - The x86 and x64 versions do _not_ produce the same results, as the
|
||||
* algorithms are optimized for their respective platforms. You can still
|
||||
* compile and run any of them on any platform, but your performance with the
|
||||
* non-native version will be less than optimal.
|
||||
*/
|
||||
class Murmur3 : public HashImplementation
|
||||
{
|
||||
public:
|
||||
/**
|
||||
* Compute 32-bit hash of a byte buffer
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 32-bit hash of the buffer
|
||||
*/
|
||||
uint32_t GetHash32 (const char * buffer, const size_t size);
|
||||
/**
|
||||
* Compute 64-bit hash of a byte buffer.
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 64-bit hash of the buffer
|
||||
*/
|
||||
uint64_t GetHash64 (const char * buffer, const size_t size);
|
||||
/**
|
||||
* Get Hash TypeId
|
||||
*/
|
||||
static TypeId GetTypeId (void);
|
||||
|
||||
private:
|
||||
/**
|
||||
* Seed value
|
||||
*
|
||||
* This has to be a constant for all MPI ranks to generate
|
||||
* the same hash from the same string.
|
||||
*/
|
||||
enum seed
|
||||
{
|
||||
SEED = 0x8BADF00D // Ate bad food
|
||||
};
|
||||
|
||||
}; // class Murmur3
|
||||
|
||||
} // namespace HashImplNS
|
||||
|
||||
} // namespace ns3
|
||||
|
||||
#endif /* HASH_MURMUR3_H */
|
||||
62
src/core/model/hash.cc
Normal file
62
src/core/model/hash.cc
Normal file
@@ -0,0 +1,62 @@
|
||||
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
||||
/*
|
||||
* Copyright (c) 2012 Lawrence Livermore National Laboratory
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License version 2 as
|
||||
* published by the Free Software Foundation;
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* Author: Peter D. Barnes, Jr. <pdbarnes@llnl.gov>
|
||||
*/
|
||||
|
||||
#include "ns3/hash.h"
|
||||
#include "ns3/log.h"
|
||||
|
||||
|
||||
namespace ns3 {
|
||||
|
||||
NS_LOG_COMPONENT_DEFINE ("Hash");
|
||||
|
||||
/*************************************************
|
||||
** class Hash
|
||||
************************************************/
|
||||
|
||||
TypeId
|
||||
Hash::GetTypeId (void)
|
||||
{
|
||||
static TypeId tid = TypeId ("ns3::Hash");
|
||||
return tid;
|
||||
}
|
||||
|
||||
Hash::Hash ()
|
||||
{
|
||||
m_impl = Create <HashImplNS::Murmur3> ();
|
||||
}
|
||||
|
||||
Hash::Hash (Ptr<HashImplementation> hp)
|
||||
: m_impl(hp)
|
||||
{
|
||||
}
|
||||
|
||||
|
||||
/*************************************************
|
||||
** class HashImplementation
|
||||
************************************************/
|
||||
|
||||
uint64_t
|
||||
HashImplementation::GetHash64 (const char * buffer, const size_t size)
|
||||
{
|
||||
NS_LOG_WARN("64-bit hash requested, only 32-bit implementation available");
|
||||
return GetHash32 (buffer, size);
|
||||
}
|
||||
|
||||
} // namespace ns3
|
||||
329
src/core/model/hash.h
Normal file
329
src/core/model/hash.h
Normal file
@@ -0,0 +1,329 @@
|
||||
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
||||
/*
|
||||
* Copyright (c) 2012 Lawrence Livermore National Laboratory
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License version 2 as
|
||||
* published by the Free Software Foundation;
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* Author: Peter D. Barnes, Jr. <pdbarnes@llnl.gov>
|
||||
*/
|
||||
|
||||
#ifndef HASH_H
|
||||
#define HASH_H
|
||||
|
||||
#include <string>
|
||||
|
||||
#include "ns3/ptr.h"
|
||||
#include "ns3/simple-ref-count.h"
|
||||
#include "ns3/type-id.h"
|
||||
|
||||
|
||||
namespace ns3 {
|
||||
|
||||
class HashImplementation;
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* \brief Generic Hash function interface
|
||||
*
|
||||
* This class provides a generic interface for computing hashes
|
||||
* of buffers. Various getters return hashes of different lengths.
|
||||
* The choice of hash function can be made at construction by
|
||||
* passing a Ptr<> to the desired HashImplementation.
|
||||
* The available implementations are documented in group hash.
|
||||
* The default implementation is Murmur3.
|
||||
*
|
||||
* In addition to this class interface, global functions are
|
||||
* defined which use the default hash implementation.
|
||||
*
|
||||
* \internal
|
||||
*
|
||||
* Would be nice to offer longer hashes. \c uint128_t looks doable,
|
||||
* except that our fallback \c int64x64_t implementation doesn't
|
||||
* offer \c unsigned.
|
||||
*
|
||||
* Longer hashes require returning a byte buffer of some sort,
|
||||
* but our \ref buffer class seems a bit overkill for this case.
|
||||
*
|
||||
*/
|
||||
class Hash
|
||||
{
|
||||
public:
|
||||
/**
|
||||
* Constructor using the default implementation
|
||||
*/
|
||||
Hash ();
|
||||
/**
|
||||
* Constructor using the supplied implementation
|
||||
*
|
||||
* \param [in] hp Ptr<HashImplementation> to the desired implementation
|
||||
*/
|
||||
Hash (Ptr<HashImplementation> hp);
|
||||
|
||||
/**
|
||||
* Compute 32-bit hash of a byte buffer
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 32-bit hash of the buffer
|
||||
*/
|
||||
uint32_t GetHash32 (const char * buffer, const size_t size);
|
||||
/**
|
||||
* Compute 64-bit hash of a byte buffer
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 64-bit hash of the buffer
|
||||
*/
|
||||
uint64_t GetHash64 (const char * buffer, const size_t size);
|
||||
|
||||
/**
|
||||
* Compute 32-bit hash of a string
|
||||
*
|
||||
* \param [in] s string to hash
|
||||
* \return 32-bit hash of the string
|
||||
*/
|
||||
uint32_t GetHash32 (const std::string s);
|
||||
/**
|
||||
* Compute 64-bit hash of a string
|
||||
*
|
||||
* \param [in] s string to hash
|
||||
* \return 64-bit hash of the string
|
||||
*/
|
||||
uint64_t GetHash64 (const std::string s);
|
||||
/**
|
||||
* Get Hash TypeId
|
||||
*/
|
||||
static TypeId GetTypeId (void);
|
||||
|
||||
private:
|
||||
Ptr<HashImplementation> m_impl; /** Hash implementation */
|
||||
|
||||
}; // Hash
|
||||
|
||||
/*************************************************
|
||||
** Global functions
|
||||
************************************************/
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* Compute 32-bit hash of a byte buffer, using the default hash function
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 32-bit hash of the buffer
|
||||
*/
|
||||
uint32_t Hash32 (const char * buffer, const size_t size);
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* Compute 64-bit hash of a byte buffer, using the default hash function
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 64-bit hash of the buffer
|
||||
*/
|
||||
uint64_t Hash64 (const char * buffer, const size_t size);
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* Compute 32-bit hash of a string, using the default hash function
|
||||
*
|
||||
* \param [in] s string to hash
|
||||
* \return 32-bit hash of the string
|
||||
*/
|
||||
uint32_t Hash32 (const std::string s);
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* Compute 64-bit hash of a string, using the default hash function
|
||||
*
|
||||
* \param [in] s string to hash
|
||||
* \return 64-bit hash of the string
|
||||
*/
|
||||
uint64_t Hash64 (const std::string s);
|
||||
|
||||
|
||||
/*************************************************
|
||||
** Hash function implementation class
|
||||
************************************************/
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* \brief Hash function implementation base class
|
||||
*/
|
||||
#ifndef HASHIMPLEMENTATION_C
|
||||
#define HASHIMPLEMENTATION_C
|
||||
class HashImplementation : public SimpleRefCount<HashImplementation>
|
||||
{
|
||||
public:
|
||||
/**
|
||||
* Compute 32-bit hash of a byte buffer
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 32-bit hash of the buffer
|
||||
*/
|
||||
virtual uint32_t GetHash32 (const char * buffer, const size_t size) = 0;
|
||||
/**
|
||||
* Compute 64-bit hash of a byte buffer.
|
||||
*
|
||||
* Default implementation returns 32-bit hash, with a warning.
|
||||
*
|
||||
* \param [in] buffer pointer to the beginning of the buffer
|
||||
* \param [in] size length of the buffer, in bytes
|
||||
* \return 64-bit hash of the buffer
|
||||
*/
|
||||
virtual uint64_t GetHash64 (const char * buffer, const size_t size);
|
||||
/*
|
||||
* Destructor
|
||||
*/
|
||||
virtual ~HashImplementation () {} ;
|
||||
}; // HashImplementation
|
||||
#endif /* HASHIMPLEMENTATION_C */
|
||||
|
||||
/**
|
||||
*
|
||||
* \ingroup hash
|
||||
*
|
||||
* \brief Basic hash function typedefs.
|
||||
*
|
||||
* See Hash32Implementation<> or Hash64Implementation<>
|
||||
*/
|
||||
typedef uint32_t (*Hash32Function_ptr) (const char *, const size_t);
|
||||
typedef uint64_t (*Hash64Function_ptr) (const char *, const size_t);
|
||||
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* \brief Template for HashImplementations from 32-bit hash functions
|
||||
*/
|
||||
template <Hash32Function_ptr hp>
|
||||
class Hash32Implementation : public HashImplementation
|
||||
{
|
||||
uint32_t GetHash32 (const char * buffer, const size_t size)
|
||||
{
|
||||
return (*hp) (buffer, size);
|
||||
}
|
||||
}; // Hash32Implementation<HashFunction>
|
||||
|
||||
/**
|
||||
* \ingroup hash
|
||||
*
|
||||
* \brief Template for HashImplementations from 64-bit hash functions
|
||||
*/
|
||||
template <Hash64Function_ptr hp>
|
||||
class Hash64Implementation : public HashImplementation
|
||||
{
|
||||
uint64_t GetHash64 (const char * buffer, const size_t size)
|
||||
{
|
||||
return (*hp) (buffer, size);
|
||||
}
|
||||
uint32_t GetHash32 (const char * buffer, const size_t size)
|
||||
{
|
||||
uint64_t hash = GetHash64(buffer, size);
|
||||
return (uint32_t *)(&hash);
|
||||
}
|
||||
}; // Hash32Implementation<HashFunction>
|
||||
|
||||
} // namespace ns3
|
||||
|
||||
|
||||
|
||||
/*************************************************
|
||||
** Real Hash function implementations
|
||||
************************************************/
|
||||
|
||||
#include "ns3/hash-murmur3.h"
|
||||
|
||||
|
||||
/*************************************************
|
||||
** Inline implementations for rvo
|
||||
************************************************/
|
||||
|
||||
namespace ns3 {
|
||||
|
||||
/*************************************************
|
||||
class Hash implementation, inlined for rvo
|
||||
*/
|
||||
|
||||
inline
|
||||
uint32_t
|
||||
Hash::GetHash32 (const char * buffer, const size_t size)
|
||||
{
|
||||
return m_impl->GetHash32 (buffer, size);
|
||||
}
|
||||
|
||||
inline
|
||||
uint64_t
|
||||
Hash::GetHash64 (const char * buffer, const size_t size)
|
||||
{
|
||||
return m_impl->GetHash64 (buffer, size);
|
||||
}
|
||||
|
||||
inline
|
||||
uint32_t
|
||||
Hash::GetHash32 (const std::string s)
|
||||
{
|
||||
return m_impl->GetHash32 (s.c_str (), s.size ());
|
||||
}
|
||||
|
||||
inline
|
||||
uint64_t
|
||||
Hash::GetHash64 (const std::string s)
|
||||
{
|
||||
return m_impl->GetHash64 (s.c_str (), s.size ());
|
||||
}
|
||||
|
||||
|
||||
/*************************************************
|
||||
Global hash functions, inlined for rvo
|
||||
*/
|
||||
|
||||
inline
|
||||
uint32_t
|
||||
Hash32 (const char * buffer, const size_t size)
|
||||
{
|
||||
return Hash().GetHash32 (buffer, size);
|
||||
}
|
||||
|
||||
inline
|
||||
uint64_t
|
||||
Hash64 (const char * buffer, const size_t size)
|
||||
{
|
||||
return Hash().GetHash64 (buffer, size);
|
||||
}
|
||||
|
||||
inline
|
||||
uint32_t
|
||||
Hash32 (const std::string s)
|
||||
{
|
||||
return Hash().GetHash32 (s);
|
||||
}
|
||||
|
||||
inline
|
||||
uint64_t
|
||||
Hash64 (const std::string s)
|
||||
{
|
||||
return Hash().GetHash64 (s);
|
||||
}
|
||||
|
||||
|
||||
} // namespace ns3
|
||||
|
||||
#endif /* HASH_H */
|
||||
91
src/core/test/hash-test-suite.cc
Normal file
91
src/core/test/hash-test-suite.cc
Normal file
@@ -0,0 +1,91 @@
|
||||
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
||||
/*
|
||||
* Copyright (c) 2012 Lawrence Livermore National Laboratory
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License version 2 as
|
||||
* published by the Free Software Foundation;
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* Author: Peter D. Barnes, Jr. <pdbarnes@llnl.gov>
|
||||
*/
|
||||
|
||||
#include <iomanip>
|
||||
#include <string>
|
||||
|
||||
#include "ns3/hash.h"
|
||||
#include "ns3/test.h"
|
||||
|
||||
namespace ns3 {
|
||||
|
||||
|
||||
//----------------------------
|
||||
//
|
||||
// Test default hash on fixed string
|
||||
|
||||
class HashFoxTestCase : public TestCase
|
||||
{
|
||||
public:
|
||||
HashFoxTestCase ();
|
||||
virtual ~HashFoxTestCase ();
|
||||
private:
|
||||
virtual void DoRun (void);
|
||||
};
|
||||
|
||||
HashFoxTestCase::HashFoxTestCase ()
|
||||
: TestCase ("Check Hash on a known string")
|
||||
{
|
||||
}
|
||||
|
||||
HashFoxTestCase::~HashFoxTestCase ()
|
||||
{
|
||||
}
|
||||
|
||||
void
|
||||
HashFoxTestCase::DoRun (void)
|
||||
{
|
||||
std::string key("The quick brown fox.");
|
||||
|
||||
uint32_t h32r = 0xd138bc62; // murmur3(key)
|
||||
uint32_t h32 = Hash32 (key);
|
||||
NS_TEST_ASSERT_MSG_EQ (h32, h32r,
|
||||
"Hash32 produced " << std::hex << std::setw ( 8) << h32
|
||||
<< ", expected " << std::hex << std::setw ( 8) << h32r
|
||||
);
|
||||
|
||||
uint64_t h64r = 0xfc30fb5d90d6e3a9;
|
||||
uint64_t h64 = Hash64 (key);
|
||||
NS_TEST_ASSERT_MSG_EQ (h64, h64r,
|
||||
"Hash64 produced " << std::hex << std::setw (16) << h64
|
||||
<< ", expected " << std::hex << std::setw (16) << h64r
|
||||
);
|
||||
}
|
||||
|
||||
|
||||
//----------------------------
|
||||
//
|
||||
// Hash tester
|
||||
|
||||
class HashTestSuite : public TestSuite
|
||||
{
|
||||
public:
|
||||
HashTestSuite ();
|
||||
};
|
||||
|
||||
HashTestSuite::HashTestSuite ()
|
||||
: TestSuite ("hash", UNIT)
|
||||
{
|
||||
AddTestCase (new HashFoxTestCase);
|
||||
}
|
||||
|
||||
static HashTestSuite g_hashTestSuite;
|
||||
|
||||
} // namespace ns3
|
||||
@@ -149,6 +149,8 @@ def build(bld):
|
||||
'model/system-path.cc',
|
||||
'helper/random-variable-stream-helper.cc',
|
||||
'helper/event-garbage-collector.cc',
|
||||
'model/hash.cc',
|
||||
'model/hash-murmur3.cc',
|
||||
]
|
||||
|
||||
core_test = bld.create_ns3_module_test_library('core')
|
||||
@@ -173,6 +175,7 @@ def build(bld):
|
||||
'test/traced-callback-test-suite.cc',
|
||||
'test/type-traits-test-suite.cc',
|
||||
'test/watchdog-test-suite.cc',
|
||||
'test/hash-test-suite.cc',
|
||||
]
|
||||
|
||||
headers = bld(features='ns3header')
|
||||
@@ -251,6 +254,8 @@ def build(bld):
|
||||
'model/math.h',
|
||||
'helper/event-garbage-collector.h',
|
||||
'helper/random-variable-stream-helper.h',
|
||||
'model/hash.h',
|
||||
'model/hash-murmur3.h',
|
||||
]
|
||||
|
||||
if sys.platform == 'win32':
|
||||
|
||||
Reference in New Issue
Block a user